WorldWideScience

Sample records for rapidly-exploring random trees

  1. MARRT: Medial Axis biased rapidly-exploring random trees

    KAUST Repository

    Denny, Jory

    2014-05-01

    © 2014 IEEE. Motion planning is a difficult and widely studied problem in robotics. Current research aims not only to find feasible paths, but to ensure paths have certain properties, e.g., shortest or safest paths. This is difficult for current state-of-the-art sampling-based techniques as they typically focus on simply finding any path. Despite this difficulty, sampling-based techniques have shown great success in planning for a wide range of applications. Among such planners, Rapidly-Exploring Random Trees (RRTs) search the planning space by biasing exploration toward unexplored regions. This paper introduces a novel RRT variant, Medial Axis RRT (MARRT), which biases tree exploration to the medial axis of free space by pushing all configurations from expansion steps towards the medial axis. We prove that this biasing increases the tree\\'s clearance from obstacles. Improving obstacle clearance is useful where path safety is important, e.g., path planning for robots performing tasks in close proximity to the elderly. Finally, we experimentally analyze MARRT, emphasizing its ability to effectively map difficult passages while increasing obstacle clearance, and compare it to contemporary RRT techniques.

  2. A Novel Path Planning for Robots Based on Rapidly-Exploring Random Tree and Particle Swarm Optimizer Algorithm

    Directory of Open Access Journals (Sweden)

    Zhou Feng

    2013-09-01

    Full Text Available A based on Rapidly-exploring Random Tree(RRT and Particle Swarm Optimizer (PSO for path planning of the robot is proposed.First the grid method is built to describe the working space of the mobile robot,then the Rapidly-exploring Random Tree algorithm is used to obtain the global navigation path,and the Particle Swarm Optimizer algorithm is adopted to get the better path.Computer experiment results demonstrate that this novel algorithm can plan an optimal path rapidly in a cluttered environment.The successful obstacle avoidance is achieved,and the model is robust and performs reliably.

  3. Using rapidly-exploring random tree-based algorithms to find smooth and optimal trajectories

    CSIR Research Space (South Africa)

    Matebese, B

    2012-10-01

    Full Text Available -exploring random tree-based algorithms to fi nd smooth and optimal trajectories B MATEBESE1, MK BANDA2 AND S UTETE1 1CSIR Modelling and Digital Science, PO Box 395, Pretoria, South Africa, 0001 2Department of Applied Mathematics, Stellenbosch University... and complex environments. The RRT algorithm is the most popular and has the ability to find a feasible solution faster than other algorithms. The drawback of using RRT is that, as the number of samples increases, the probability that the algorithm converges...

  4. A multi-directional rapidly exploring random graph (mRRG) for protein folding

    KAUST Repository

    Nath, Shuvra Kanti; Thomas, Shawna; Ekenna, Chinwe; Amato, Nancy M.

    2012-01-01

    Modeling large-scale protein motions, such as those involved in folding and binding interactions, is crucial to better understanding not only how proteins move and interact with other molecules but also how proteins misfold, thus causing many devastating diseases. Robotic motion planning algorithms, such as Rapidly Exploring Random Trees (RRTs), have been successful in simulating protein folding pathways. Here, we propose a new multi-directional Rapidly Exploring Random Graph (mRRG) specifically tailored for proteins. Unlike traditional RRGs which only expand a parent conformation in a single direction, our strategy expands the parent conformation in multiple directions to generate new samples. Resulting samples are connected to the parent conformation and its nearest neighbors. By leveraging multiple directions, mRRG can model the protein motion landscape with reduced computational time compared to several other robotics-based methods for small to moderate-sized proteins. Our results on several proteins agree with experimental hydrogen out-exchange, pulse-labeling, and F-value analysis. We also show that mRRG covers the conformation space better as compared to the other computation methods. Copyright © 2012 ACM.

  5. MARRT: Medial Axis biased rapidly-exploring random trees

    KAUST Repository

    Denny, Jory; Greco, Evan; Thomas, Shawna; Amato, Nancy M.

    2014-01-01

    © 2014 IEEE. Motion planning is a difficult and widely studied problem in robotics. Current research aims not only to find feasible paths, but to ensure paths have certain properties, e.g., shortest or safest paths. This is difficult for current

  6. Rapidly Exploring Random Trees Used for Mobile Robots Path Planning

    Czech Academy of Sciences Publication Activity Database

    Krejsa, Jiří; Věchet, S.

    2005-01-01

    Roč. 12, č. 4 (2005), s. 231-238 ISSN 1802-1484. [Mechatronics, Robotics and Biomechanics 2005. Třešť, 26.09.2005-29.09.2005] Institutional research plan: CEZ:AV0Z20760514 Keywords : path planning * mobile robot Subject RIV: JD - Computer Applications, Robotics

  7. Fragmentation of random trees

    International Nuclear Information System (INIS)

    Kalay, Z; Ben-Naim, E

    2015-01-01

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

  8. Random ancestor trees

    International Nuclear Information System (INIS)

    Ben-Naim, E; Krapivsky, P L

    2010-01-01

    We investigate a network growth model in which the genealogy controls the evolution. In this model, a new node selects a random target node and links either to this target node, or to its parent, or to its grandparent, etc; all nodes from the target node to its most ancient ancestor are equiprobable destinations. The emerging random ancestor tree is very shallow: the fraction g n of nodes at distance n from the root decreases super-exponentially with n, g n = e −1 /(n − 1)!. We find that a macroscopic hub at the root coexists with highly connected nodes at higher generations. The maximal degree of a node at the nth generation grows algebraically as N 1/β n , where N is the system size. We obtain the series of nontrivial exponents which are roots of transcendental equations: β 1 ≅1.351 746, β 2 ≅1.682 201, etc. As a consequence, the fraction p k of nodes with degree k has an algebraic tail, p k ∼ k −γ , with γ = β 1 + 1 = 2.351 746

  9. Human action analysis with randomized trees

    CERN Document Server

    Yu, Gang; Liu, Zicheng

    2014-01-01

    This book will provide a comprehensive overview on human action analysis with randomized trees. It will cover both the supervised random trees and the unsupervised random trees. When there are sufficient amount of labeled data available, supervised random trees provides a fast method for space-time interest point matching. When labeled data is minimal as in the case of example-based action search, unsupervised random trees is used to leverage the unlabelled data. We describe how the randomized trees can be used for action classification, action detection, action search, and action prediction.

  10. Aspects of insertion in random trees

    NARCIS (Netherlands)

    Bagchi, Arunabha; Reingold, E.M.

    1982-01-01

    A method formulated by Yao and used by Brown has yielded bounds on the fraction of nodes with specified properties in trees bult by a sequence of random internal nodes in a random tree built by binary search and insertion, and show that in such a tree about bounds better than those now known. We

  11. The spectral dimension of random trees

    International Nuclear Information System (INIS)

    Destri, Claudio; Donetti, Luca

    2002-01-01

    We present a simple yet rigorous approach to the determination of the spectral dimension of random trees, based on the study of the massless limit of the Gaussian model on such trees. As a by-product, we obtain evidence in favour of a new scaling hypothesis for the Gaussian model on generic bounded graphs and in favour of a previously conjectured exact relation between spectral and connectivity dimensions on more general tree-like structures

  12. Speech Recognition Using Randomized Relational Decision Trees

    National Research Council Canada - National Science Library

    Amit, Yali

    1999-01-01

    .... This implies that we recognize words as units, without recognizing their subcomponents. Multiple randomized decision trees are used to access the large pool of acoustic events in a systematic manner and are aggregated to produce the classifier.

  13. Random tree growth by vertex splitting

    International Nuclear Information System (INIS)

    David, F; Dukes, W M B; Jonsson, T; Stefánsson, S Ö

    2009-01-01

    We study a model of growing planar tree graphs where in each time step we separate the tree into two components by splitting a vertex and then connect the two pieces by inserting a new link between the daughter vertices. This model generalizes the preferential attachment model and Ford's α-model for phylogenetic trees. We develop a mean field theory for the vertex degree distribution, prove that the mean field theory is exact in some special cases and check that it agrees with numerical simulations in general. We calculate various correlation functions and show that the intrinsic Hausdorff dimension can vary from 1 to ∞, depending on the parameters of the model

  14. Minimum spanning trees and random resistor networks in d dimensions.

    Science.gov (United States)

    Read, N

    2005-09-01

    We consider minimum-cost spanning trees, both in lattice and Euclidean models, in d dimensions. For the cost of the optimum tree in a box of size L , we show that there is a correction of order L(theta) , where theta or =1 . The arguments all rely on the close relation of Kruskal's greedy algorithm for the minimum spanning tree, percolation, and (for some arguments) random resistor networks. The scaling of the entropy and free energy at small nonzero T , and hence of the number of near-optimal solutions, is also discussed. We suggest that the Steiner tree problem is in the same universality class as the minimum spanning tree in all dimensions, as is the traveling salesman problem in two dimensions. Hence all will have the same value of theta=-3/4 in two dimensions.

  15. From elongated spanning trees to vicious random walks

    OpenAIRE

    Gorsky, A.; Nechaev, S.; Poghosyan, V. S.; Priezzhev, V. B.

    2012-01-01

    Given a spanning forest on a large square lattice, we consider by combinatorial methods a correlation function of $k$ paths ($k$ is odd) along branches of trees or, equivalently, $k$ loop--erased random walks. Starting and ending points of the paths are grouped in a fashion a $k$--leg watermelon. For large distance $r$ between groups of starting and ending points, the ratio of the number of watermelon configurations to the total number of spanning trees behaves as $r^{-\

  16. On the number of spanning trees in random regular graphs

    DEFF Research Database (Denmark)

    Greenhill, Catherine; Kwan, Matthew; Wind, David Kofoed

    2014-01-01

    Let d >= 3 be a fixed integer. We give an asympotic formula for the expected number of spanning trees in a uniformly random d-regular graph with n vertices. (The asymptotics are as n -> infinity, restricted to even n if d is odd.) We also obtain the asymptotic distribution of the number of spanning...

  17. On pricing futures options on random binomial tree

    International Nuclear Information System (INIS)

    Bayram, Kamola; Ganikhodjaev, Nasir

    2013-01-01

    The discrete-time approach to real option valuation has typically been implemented in the finance literature using a binomial tree framework. Instead we develop a new model by randomizing the environment and call such model a random binomial tree. Whereas the usual model has only one environment (u, d) where the price of underlying asset can move by u times up and d times down, and pair (u, d) is constant over the life of the underlying asset, in our new model the underlying security is moving in two environments namely (u 1 , d 1 ) and (u 2 , d 2 ). Thus we obtain two volatilities σ 1 and σ 2 . This new approach enables calculations reflecting the real market since it consider the two states of market normal and extra ordinal. In this paper we define and study Futures options for such models.

  18. From elongated spanning trees to vicious random walks

    Science.gov (United States)

    Gorsky, A.; Nechaev, S.; Poghosyan, V. S.; Priezzhev, V. B.

    2013-05-01

    Given a spanning forest on a large square lattice, we consider by combinatorial methods a correlation function of k paths (k is odd) along branches of trees or, equivalently, k loop-erased random walks. Starting and ending points of the paths are grouped such that they form a k-leg watermelon. For large distance r between groups of starting and ending points, the ratio of the number of watermelon configurations to the total number of spanning trees behaves as r-ν log r with ν = (k2 - 1) / 2. Considering the spanning forest stretched along the meridian of this watermelon, we show that the two-dimensional k-leg loop-erased watermelon exponent ν is converting into the scaling exponent for the reunion probability (at a given point) of k (1 + 1)-dimensional vicious walkers, ν˜ =k2 / 2. At the end, we express the conjectures about the possible relation to integrable systems.

  19. From elongated spanning trees to vicious random walks

    International Nuclear Information System (INIS)

    Gorsky, A.; Nechaev, S.; Poghosyan, V.S.; Priezzhev, V.B.

    2013-01-01

    Given a spanning forest on a large square lattice, we consider by combinatorial methods a correlation function of k paths (k is odd) along branches of trees or, equivalently, k loop-erased random walks. Starting and ending points of the paths are grouped such that they form a k-leg watermelon. For large distance r between groups of starting and ending points, the ratio of the number of watermelon configurations to the total number of spanning trees behaves as r −ν logr with ν=(k 2 −1)/2. Considering the spanning forest stretched along the meridian of this watermelon, we show that the two-dimensional k-leg loop-erased watermelon exponent ν is converting into the scaling exponent for the reunion probability (at a given point) of k(1+1)-dimensional vicious walkers, ν -tilde= k 2 /2. At the end, we express the conjectures about the possible relation to integrable systems

  20. Random forests of interaction trees for estimating individualized treatment effects in randomized trials.

    Science.gov (United States)

    Su, Xiaogang; Peña, Annette T; Liu, Lei; Levine, Richard A

    2018-04-29

    Assessing heterogeneous treatment effects is a growing interest in advancing precision medicine. Individualized treatment effects (ITEs) play a critical role in such an endeavor. Concerning experimental data collected from randomized trials, we put forward a method, termed random forests of interaction trees (RFIT), for estimating ITE on the basis of interaction trees. To this end, we propose a smooth sigmoid surrogate method, as an alternative to greedy search, to speed up tree construction. The RFIT outperforms the "separate regression" approach in estimating ITE. Furthermore, standard errors for the estimated ITE via RFIT are obtained with the infinitesimal jackknife method. We assess and illustrate the use of RFIT via both simulation and the analysis of data from an acupuncture headache trial. Copyright © 2018 John Wiley & Sons, Ltd.

  1. Random trees between two walls: exact partition function

    International Nuclear Information System (INIS)

    Bouttier, J; Di Francesco, P; Guitter, E

    2003-01-01

    We derive the exact partition function for a discrete model of random trees embedded in a one-dimensional space. These trees have vertices labelled by integers representing their position in the target space, with the solid-on-solid constraint that adjacent vertices have labels differing by ±1. A non-trivial partition function is obtained whenever the target space is bounded by walls. We concentrate on the two cases where the target space is (i) the half-line bounded by a wall at the origin or (ii) a segment bounded by two walls at a finite distance. The general solution has a soliton-like structure involving elliptic functions. We derive the corresponding continuum scaling limit which takes the remarkable form of the Weierstrass p function with constrained periods. These results are used to analyse the probability for an evolving population spreading in one dimension to attain the boundary of a given domain with the geometry of the target (i) or (ii). They also translate, via suitable bijections, into generating functions for bounded planar graphs

  2. From elongated spanning trees to vicious random walks

    Energy Technology Data Exchange (ETDEWEB)

    Gorsky, A. [ITEP, B. Cheryomushkinskaya 25, 117218 Moscow (Russian Federation); Nechaev, S., E-mail: nechaev@lptms.u-psud.fr [LPTMS, Université Paris Sud, 91405 Orsay Cedex (France); P.N. Lebedev Physical Institute of the Russian Academy of Sciences, 119991 Moscow (Russian Federation); Poghosyan, V.S. [Institute for Informatics and Automation Problems NAS of Armenia, 375044 Yerevan (Armenia); Priezzhev, V.B. [Bogolubov Laboratory of Theoretical Physics, Joint Institute for Nuclear Research, 141980 Dubna (Russian Federation)

    2013-05-01

    Given a spanning forest on a large square lattice, we consider by combinatorial methods a correlation function of k paths (k is odd) along branches of trees or, equivalently, k loop-erased random walks. Starting and ending points of the paths are grouped such that they form a k-leg watermelon. For large distance r between groups of starting and ending points, the ratio of the number of watermelon configurations to the total number of spanning trees behaves as r{sup −ν}logr with ν=(k{sup 2}−1)/2. Considering the spanning forest stretched along the meridian of this watermelon, we show that the two-dimensional k-leg loop-erased watermelon exponent ν is converting into the scaling exponent for the reunion probability (at a given point) of k(1+1)-dimensional vicious walkers, ν{sup -tilde=}k{sup 2}/2. At the end, we express the conjectures about the possible relation to integrable systems.

  3. Intracranial hypertension prediction using extremely randomized decision trees.

    Science.gov (United States)

    Scalzo, Fabien; Hamilton, Robert; Asgari, Shadnaz; Kim, Sunghan; Hu, Xiao

    2012-10-01

    Intracranial pressure (ICP) elevation (intracranial hypertension, IH) in neurocritical care is typically treated in a reactive fashion; it is only delivered after bedside clinicians notice prolonged ICP elevation. A proactive solution is desirable to improve the treatment of intracranial hypertension. Several studies have shown that the waveform morphology of the intracranial pressure pulse holds predictors about future intracranial hypertension and could therefore be used to alert the bedside clinician of a likely occurrence of the elevation in the immediate future. In this paper, a computational framework is proposed to predict prolonged intracranial hypertension based on morphological waveform features computed from the ICP. A key contribution of this work is to exploit an ensemble classifier method based on extremely randomized decision trees (Extra-Trees). Experiments on a representative set of 30 patients admitted for various intracranial pressure related conditions demonstrate the effectiveness of the predicting framework on ICP pulses acquired under clinical conditions and the superior results of the proposed approach in comparison to linear and AdaBoost classifiers. Copyright © 2011 IPEM. Published by Elsevier Ltd. All rights reserved.

  4. Exploring precrash maneuvers using classification trees and random forests.

    Science.gov (United States)

    Harb, Rami; Yan, Xuedong; Radwan, Essam; Su, Xiaogang

    2009-01-01

    Taking evasive actions vis-à-vis critical traffic situations impending to motor vehicle crashes endows drivers an opportunity to avoid the crash occurrence or at least diminish its severity. This study explores the drivers, vehicles, and environments' characteristics associated with crash avoidance maneuvers (i.e., evasive actions or no evasive actions). Rear-end collisions, head-on collisions, and angle collisions are analyzed separately using decision trees and the significance of the variables on the binary response variable (evasive actions or no evasive actions) is determined. Moreover, the random forests method is employed to rank the importance of the drivers/vehicles/environments characteristics on crash avoidance maneuvers. According to the exploratory analyses' results, drivers' visibility obstruction, drivers' physical impairment, drivers' distraction are associated with crash avoidance maneuvers in all three types of accidents. Moreover, speed limit is associated with rear-end collisions' avoidance maneuvers and vehicle type is correlated with head-on collisions and angle collisions' avoidance maneuvers. It is recommended that future research investigates further the explored trends (e.g., physically impaired drivers, visibility obstruction) using driving simulators which may help in legislative initiatives and in-vehicle technology recommendations.

  5. Using histograms to introduce randomization in the generation of ensembles of decision trees

    Science.gov (United States)

    Kamath, Chandrika; Cantu-Paz, Erick; Littau, David

    2005-02-22

    A system for decision tree ensembles that includes a module to read the data, a module to create a histogram, a module to evaluate a potential split according to some criterion using the histogram, a module to select a split point randomly in an interval around the best split, a module to split the data, and a module to combine multiple decision trees in ensembles. The decision tree method includes the steps of reading the data; creating a histogram; evaluating a potential split according to some criterion using the histogram, selecting a split point randomly in an interval around the best split, splitting the data, and combining multiple decision trees in ensembles.

  6. The physics of randomness and regularities for languages (lifetimes, family trees, and the second languages); in terms of random matrices

    OpenAIRE

    Tuncay, Caglar

    2007-01-01

    The physics of randomness and regularities for languages (mother tongues) and their lifetimes and family trees and for the second languages are studied in terms of two opposite processes; random multiplicative noise [1], and fragmentation [2], where the original model is given in the matrix format. We start with a random initial world, and come out with the regularities, which mimic various empirical data [3] for the present languages.

  7. Assessing the predictive capability of randomized tree-based ensembles in streamflow modelling

    Science.gov (United States)

    Galelli, S.; Castelletti, A.

    2013-07-01

    Combining randomization methods with ensemble prediction is emerging as an effective option to balance accuracy and computational efficiency in data-driven modelling. In this paper, we investigate the prediction capability of extremely randomized trees (Extra-Trees), in terms of accuracy, explanation ability and computational efficiency, in a streamflow modelling exercise. Extra-Trees are a totally randomized tree-based ensemble method that (i) alleviates the poor generalisation property and tendency to overfitting of traditional standalone decision trees (e.g. CART); (ii) is computationally efficient; and, (iii) allows to infer the relative importance of the input variables, which might help in the ex-post physical interpretation of the model. The Extra-Trees potential is analysed on two real-world case studies - Marina catchment (Singapore) and Canning River (Western Australia) - representing two different morphoclimatic contexts. The evaluation is performed against other tree-based methods (CART and M5) and parametric data-driven approaches (ANNs and multiple linear regression). Results show that Extra-Trees perform comparatively well to the best of the benchmarks (i.e. M5) in both the watersheds, while outperforming the other approaches in terms of computational requirement when adopted on large datasets. In addition, the ranking of the input variable provided can be given a physically meaningful interpretation.

  8. Absolutely Continuous Spectrum for Random Schrödinger Operators on the Fibonacci and Similar Tree-strips

    Energy Technology Data Exchange (ETDEWEB)

    Sadel, Christian, E-mail: Christian.Sadel@ist.ac.at [University of British Columbia, Mathematics Department (Canada)

    2014-12-15

    We consider cross products of finite graphs with a class of trees that have arbitrarily but finitely long line segments, such as the Fibonacci tree. Such cross products are called tree-strips. We prove that for small disorder random Schrödinger operators on such tree-strips have purely absolutely continuous spectrum in a certain set.

  9. Evaluation of geocast routing trees on random and actual networks

    NARCIS (Netherlands)

    Meijerink, Berend Jan; Baratchi, Mitra; Heijenk, Geert; Koucheryavy, Yevgeni; Mamatas, Lefteris; Matta, Ibrahim; Ometov, Aleksandr; Papadimitriou, Panagiotis

    2017-01-01

    Efficient geocast routing schemes are needed to transmit messages to mobile networked devices in geographically scoped areas. To design an efficient geocast routing algorithm a comprehensive evaluation of different routing tree approaches is needed. In this paper, we present an analytical study

  10. Random Access to Grammar-Compressed Strings and Trees

    DEFF Research Database (Denmark)

    Bille, Philip; Landau, Gad M.; Raman, Rajeev

    2015-01-01

    representations of S achieving O(log N) random access time, and either O(n · αk(n)) construction time and space on the pointer machine model, or O(n) construction time and space on the RAM. Here, αk(n) is the inverse of the kth row of Ackermann's function. Our representations also efficiently support...

  11. The Canopy Graph and Level Statistics for Random Operators on Trees

    International Nuclear Information System (INIS)

    Aizenman, Michael; Warzel, Simone

    2006-01-01

    For operators with homogeneous disorder, it is generally expected that there is a relation between the spectral characteristics of a random operator in the infinite setup and the distribution of the energy gaps in its finite volume versions, in corresponding energy ranges. Whereas pure point spectrum of the infinite operator goes along with Poisson level statistics, it is expected that purely absolutely continuous spectrum would be associated with gap distributions resembling the corresponding random matrix ensemble. We prove that on regular rooted trees, which exhibit both spectral types, the eigenstate point process has always Poissonian limit. However, we also find that this does not contradict the picture described above if that is carefully interpreted, as the relevant limit of finite trees is not the infinite homogenous tree graph but rather a single-ended 'canopy graph.' For this tree graph, the random Schroedinger operator is proven here to have only pure-point spectrum at any strength of the disorder. For more general single-ended trees it is shown that the spectrum is always singular - pure point possibly with singular continuous component which is proven to occur in some cases

  12. Trees

    Science.gov (United States)

    Al-Khaja, Nawal

    2007-01-01

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

  13. Local random configuration-tree theory for string repetition and facilitated dynamics of glass

    Science.gov (United States)

    Lam, Chi-Hang

    2018-02-01

    We derive a microscopic theory of glassy dynamics based on the transport of voids by micro-string motions, each of which involves particles arranged in a line hopping simultaneously displacing one another. Disorder is modeled by a random energy landscape quenched in the configuration space of distinguishable particles, but transient in the physical space as expected for glassy fluids. We study the evolution of local regions with m coupled voids. At a low temperature, energetically accessible local particle configurations can be organized into a random tree with nodes and edges denoting configurations and micro-string propagations respectively. Such trees defined in the configuration space naturally describe systems defined in two- or three-dimensional physical space. A micro-string propagation initiated by a void can facilitate similar motions by other voids via perturbing the random energy landscape, realizing path interactions between voids or equivalently string interactions. We obtain explicit expressions of the particle diffusion coefficient and a particle return probability. Under our approximation, as temperature decreases, random trees of energetically accessible configurations exhibit a sequence of percolation transitions in the configuration space, with local regions containing fewer coupled voids entering the non-percolating immobile phase first. Dynamics is dominated by coupled voids of an optimal group size, which increases as temperature decreases. Comparison with a distinguishable-particle lattice model (DPLM) of glass shows very good quantitative agreements using only two adjustable parameters related to typical energy fluctuations and the interaction range of the micro-strings.

  14. Constructing Binomial Trees Via Random Maps for Analysis of Financial Assets

    Directory of Open Access Journals (Sweden)

    Antonio Airton Carneiro de Freitas

    2010-04-01

    Full Text Available Random maps can be constructed from a priori knowledge of the financial assets. It is also addressed the reverse problem, i.e. from a function of an empirical stationary probability density function we set up a random map that naturally leads to an implied binomial tree, allowing the adjustment of models, including the ability to incorporate jumps. An applica- tion related to the options market is presented. It is emphasized that the quality of the model to incorporate a priori knowledge of the financial asset may be affected, for example, by the skewed vision of the analyst.

  15. Some Limit Properties of Random Transition Probability for Second-Order Nonhomogeneous Markov Chains Indexed by a Tree

    Directory of Open Access Journals (Sweden)

    Shi Zhiyan

    2009-01-01

    Full Text Available We study some limit properties of the harmonic mean of random transition probability for a second-order nonhomogeneous Markov chain and a nonhomogeneous Markov chain indexed by a tree. As corollary, we obtain the property of the harmonic mean of random transition probability for a nonhomogeneous Markov chain.

  16. Analysis of tree stand horizontal structure using random point field methods

    Directory of Open Access Journals (Sweden)

    O. P. Sekretenko

    2015-06-01

    Full Text Available This paper uses the model approach to analyze the horizontal structure of forest stands. The main types of models of random point fields and statistical procedures that can be used to analyze spatial patterns of trees of uneven and even-aged stands are described. We show how modern methods of spatial statistics can be used to address one of the objectives of forestry – to clarify the laws of natural thinning of forest stand and the corresponding changes in its spatial structure over time. Studying natural forest thinning, we describe the consecutive stages of modeling: selection of the appropriate parametric model, parameter estimation and generation of point patterns in accordance with the selected model, the selection of statistical functions to describe the horizontal structure of forest stands and testing of statistical hypotheses. We show the possibilities of a specialized software package, spatstat, which is designed to meet the challenges of spatial statistics and provides software support for modern methods of analysis of spatial data. We show that a model of stand thinning that does not consider inter-tree interaction can project the size distribution of the trees properly, but the spatial pattern of the modeled stand is not quite consistent with observed data. Using data of three even-aged pine forest stands of 25, 55, and 90-years old, we demonstrate that the spatial point process models are useful for combining measurements in the forest stands of different ages to study the forest stand natural thinning.

  17. Learning a constrained conditional random field for enhanced segmentation of fallen trees in ALS point clouds

    Science.gov (United States)

    Polewski, Przemyslaw; Yao, Wei; Heurich, Marco; Krzystek, Peter; Stilla, Uwe

    2018-06-01

    In this study, we present a method for improving the quality of automatic single fallen tree stem segmentation in ALS data by applying a specialized constrained conditional random field (CRF). The entire processing pipeline is composed of two steps. First, short stem segments of equal length are detected and a subset of them is selected for further processing, while in the second step the chosen segments are merged to form entire trees. The first step is accomplished using the specialized CRF defined on the space of segment labelings, capable of finding segment candidates which are easier to merge subsequently. To achieve this, the CRF considers not only the features of every candidate individually, but incorporates pairwise spatial interactions between adjacent segments into the model. In particular, pairwise interactions include a collinearity/angular deviation probability which is learned from training data as well as the ratio of spatial overlap, whereas unary potentials encode a learned probabilistic model of the laser point distribution around each segment. Each of these components enters the CRF energy with its own balance factor. To process previously unseen data, we first calculate the subset of segments for merging on a grid of balance factors by minimizing the CRF energy. Then, we perform the merging and rank the balance configurations according to the quality of their resulting merged trees, obtained from a learned tree appearance model. The final result is derived from the top-ranked configuration. We tested our approach on 5 plots from the Bavarian Forest National Park using reference data acquired in a field inventory. Compared to our previous segment selection method without pairwise interactions, an increase in detection correctness and completeness of up to 7 and 9 percentage points, respectively, was observed.

  18. Random walk hierarchy measure: What is more hierarchical, a chain, a tree or a star?

    Science.gov (United States)

    Czégel, Dániel; Palla, Gergely

    2015-01-01

    Signs of hierarchy are prevalent in a wide range of systems in nature and society. One of the key problems is quantifying the importance of hierarchical organisation in the structure of the network representing the interactions or connections between the fundamental units of the studied system. Although a number of notable methods are already available, their vast majority is treating all directed acyclic graphs as already maximally hierarchical. Here we propose a hierarchy measure based on random walks on the network. The novelty of our approach is that directed trees corresponding to multi level pyramidal structures obtain higher hierarchy scores compared to directed chains and directed stars. Furthermore, in the thermodynamic limit the hierarchy measure of regular trees is converging to a well defined limit depending only on the branching number. When applied to real networks, our method is computationally very effective, as the result can be evaluated with arbitrary precision by subsequent multiplications of the transition matrix describing the random walk process. In addition, the tests on real world networks provided very intuitive results, e.g., the trophic levels obtained from our approach on a food web were highly consistent with former results from ecology. PMID:26657012

  19. Random walk hierarchy measure: What is more hierarchical, a chain, a tree or a star?

    Science.gov (United States)

    Czégel, Dániel; Palla, Gergely

    2015-12-10

    Signs of hierarchy are prevalent in a wide range of systems in nature and society. One of the key problems is quantifying the importance of hierarchical organisation in the structure of the network representing the interactions or connections between the fundamental units of the studied system. Although a number of notable methods are already available, their vast majority is treating all directed acyclic graphs as already maximally hierarchical. Here we propose a hierarchy measure based on random walks on the network. The novelty of our approach is that directed trees corresponding to multi level pyramidal structures obtain higher hierarchy scores compared to directed chains and directed stars. Furthermore, in the thermodynamic limit the hierarchy measure of regular trees is converging to a well defined limit depending only on the branching number. When applied to real networks, our method is computationally very effective, as the result can be evaluated with arbitrary precision by subsequent multiplications of the transition matrix describing the random walk process. In addition, the tests on real world networks provided very intuitive results, e.g., the trophic levels obtained from our approach on a food web were highly consistent with former results from ecology.

  20. Ground States of Random Spanning Trees on a D-Wave 2X

    Science.gov (United States)

    Hall, J. S.; Hobl, L.; Novotny, M. A.; Michielsen, Kristel

    The performances of two D-Wave 2 machines (476 and 496 qubits) and of a 1097-qubit D-Wave 2X were investigated. Each chip has a Chimera interaction graph calG . Problem input consists of values for the fields hj and for the two-qubit interactions Ji , j of an Ising spin-glass problem formulated on calG . Output is returned in terms of a spin configuration {sj } , with sj = +/- 1 . We generated random spanning trees (RSTs) uniformly distributed over all spanning trees of calG . On the 476-qubit D-Wave 2, RSTs were generated on the full chip with Ji , j = - 1 and hj = 0 and solved one thousand times. The distribution of solution energies and the average magnetization of each qubit were determined. On both the 476- and 1097-qubit machines, four identical spanning trees were generated on each quadrant of the chip. The statistical independence of these regions was investigated. In another study, on the D-Wave 2X, one hundred RSTs with random Ji , j ∈ { - 1 , 1 } and hj = 0 were generated on the full chip. Each RST problem was solved one hundred times and the number of times the ground state energy was found was recorded. This procedure was repeated for square subgraphs, with dimensions ranging from 7 ×7 to 11 ×11. Supported in part by NSF Grants DGE-0947419 and DMR-1206233. D-Wave time provided by D-Wave Systems and by the USRA Quantum Artificial Intelligence Laboratory Research Opportunity.

  1. Randomized branch sampling to estimatefruit production in Pecan trees cv. ‘Barton’

    Directory of Open Access Journals (Sweden)

    Filemom Manoel Mokochinski

    Full Text Available ABSTRACT: Sampling techniques to quantify the production of fruits are still very scarce and create a gap in crop development research. This study was conducted in a rural property in the county of Cachoeira do Sul - RS to estimate the efficiency of randomized branch sampling (RBS in quantifying the production of pecan fruit at three different ages (5,7 and 10 years. Two selection techniques were tested: the probability proportional to the diameter (PPD and the uniform probability (UP techniques, which were performed on nine trees, three from each age and randomly chosen. The RBS underestimated fruit production for all ages, and its main drawback was the high sampling error (125.17% - PPD and 111.04% - UP. The UP was regarded as more efficient than the PPD, though both techniques estimated similar production and similar experimental errors. In conclusion, we reported that branch sampling was inaccurate for this case study, requiring new studies to produce estimates with smaller sampling error.

  2. Toward combining thematic information with hierarchical multiscale segmentations using tree Markov random field model

    Science.gov (United States)

    Zhang, Xueliang; Xiao, Pengfeng; Feng, Xuezhi

    2017-09-01

    It has been a common idea to produce multiscale segmentations to represent the various geographic objects in high-spatial resolution remote sensing (HR) images. However, it remains a great challenge to automatically select the proper segmentation scale(s) just according to the image information. In this study, we propose a novel way of information fusion at object level by combining hierarchical multiscale segmentations with existed thematic information produced by classification or recognition. The tree Markov random field (T-MRF) model is designed for the multiscale combination framework, through which the object type is determined as close as the existed thematic information. At the same time, the object boundary is jointly determined by the thematic labels and the multiscale segments through the minimization of the energy function. The benefits of the proposed T-MRF combination model include: (1) reducing the dependence of segmentation scale selection when utilizing multiscale segmentations; (2) exploring the hierarchical context naturally imbedded in the multiscale segmentations. The HR images in both urban and rural areas are used in the experiments to show the effectiveness of the proposed combination framework on these two aspects.

  3. A Comparison between Decision Tree and Random Forest in Determining the Risk Factors Associated with Type 2 Diabetes.

    Science.gov (United States)

    Esmaily, Habibollah; Tayefi, Maryam; Doosti, Hassan; Ghayour-Mobarhan, Majid; Nezami, Hossein; Amirabadizadeh, Alireza

    2018-04-24

    We aimed to identify the associated risk factors of type 2 diabetes mellitus (T2DM) using data mining approach, decision tree and random forest techniques using the Mashhad Stroke and Heart Atherosclerotic Disorders (MASHAD) Study program. A cross-sectional study. The MASHAD study started in 2010 and will continue until 2020. Two data mining tools, namely decision trees, and random forests, are used for predicting T2DM when some other characteristics are observed on 9528 subjects recruited from MASHAD database. This paper makes a comparison between these two models in terms of accuracy, sensitivity, specificity and the area under ROC curve. The prevalence rate of T2DM was 14% among these subjects. The decision tree model has 64.9% accuracy, 64.5% sensitivity, 66.8% specificity, and area under the ROC curve measuring 68.6%, while the random forest model has 71.1% accuracy, 71.3% sensitivity, 69.9% specificity, and area under the ROC curve measuring 77.3% respectively. The random forest model, when used with demographic, clinical, and anthropometric and biochemical measurements, can provide a simple tool to identify associated risk factors for type 2 diabetes. Such identification can substantially use for managing the health policy to reduce the number of subjects with T2DM .

  4. Parametric and non-parametric masking of randomness in sequence alignments can be improved and leads to better resolved trees

    Directory of Open Access Journals (Sweden)

    von Reumont Björn M

    2010-03-01

    Full Text Available Abstract Background Methods of alignment masking, which refers to the technique of excluding alignment blocks prior to tree reconstructions, have been successful in improving the signal-to-noise ratio in sequence alignments. However, the lack of formally well defined methods to identify randomness in sequence alignments has prevented a routine application of alignment masking. In this study, we compared the effects on tree reconstructions of the most commonly used profiling method (GBLOCKS which uses a predefined set of rules in combination with alignment masking, with a new profiling approach (ALISCORE based on Monte Carlo resampling within a sliding window, using different data sets and alignment methods. While the GBLOCKS approach excludes variable sections above a certain threshold which choice is left arbitrary, the ALISCORE algorithm is free of a priori rating of parameter space and therefore more objective. Results ALISCORE was successfully extended to amino acids using a proportional model and empirical substitution matrices to score randomness in multiple sequence alignments. A complex bootstrap resampling leads to an even distribution of scores of randomly similar sequences to assess randomness of the observed sequence similarity. Testing performance on real data, both masking methods, GBLOCKS and ALISCORE, helped to improve tree resolution. The sliding window approach was less sensitive to different alignments of identical data sets and performed equally well on all data sets. Concurrently, ALISCORE is capable of dealing with different substitution patterns and heterogeneous base composition. ALISCORE and the most relaxed GBLOCKS gap parameter setting performed best on all data sets. Correspondingly, Neighbor-Net analyses showed the most decrease in conflict. Conclusions Alignment masking improves signal-to-noise ratio in multiple sequence alignments prior to phylogenetic reconstruction. Given the robust performance of alignment

  5. K-Means Algorithm Performance Analysis With Determining The Value Of Starting Centroid With Random And KD-Tree Method

    Science.gov (United States)

    Sirait, Kamson; Tulus; Budhiarti Nababan, Erna

    2017-12-01

    Clustering methods that have high accuracy and time efficiency are necessary for the filtering process. One method that has been known and applied in clustering is K-Means Clustering. In its application, the determination of the begining value of the cluster center greatly affects the results of the K-Means algorithm. This research discusses the results of K-Means Clustering with starting centroid determination with a random and KD-Tree method. The initial determination of random centroid on the data set of 1000 student academic data to classify the potentially dropout has a sse value of 952972 for the quality variable and 232.48 for the GPA, whereas the initial centroid determination by KD-Tree has a sse value of 504302 for the quality variable and 214,37 for the GPA variable. The smaller sse values indicate that the result of K-Means Clustering with initial KD-Tree centroid selection have better accuracy than K-Means Clustering method with random initial centorid selection.

  6. New machine learning tools for predictive vegetation mapping after climate change: Bagging and Random Forest perform better than Regression Tree Analysis

    Science.gov (United States)

    L.R. Iverson; A.M. Prasad; A. Liaw

    2004-01-01

    More and better machine learning tools are becoming available for landscape ecologists to aid in understanding species-environment relationships and to map probable species occurrence now and potentially into the future. To thal end, we evaluated three statistical models: Regression Tree Analybib (RTA), Bagging Trees (BT) and Random Forest (RF) for their utility in...

  7. Variances in the projections, resulting from CLIMEX, Boosted Regression Trees and Random Forests techniques

    Science.gov (United States)

    Shabani, Farzin; Kumar, Lalit; Solhjouy-fard, Samaneh

    2017-08-01

    The aim of this study was to have a comparative investigation and evaluation of the capabilities of correlative and mechanistic modeling processes, applied to the projection of future distributions of date palm in novel environments and to establish a method of minimizing uncertainty in the projections of differing techniques. The location of this study on a global scale is in Middle Eastern Countries. We compared the mechanistic model CLIMEX (CL) with the correlative models MaxEnt (MX), Boosted Regression Trees (BRT), and Random Forests (RF) to project current and future distributions of date palm ( Phoenix dactylifera L.). The Global Climate Model (GCM), the CSIRO-Mk3.0 (CS) using the A2 emissions scenario, was selected for making projections. Both indigenous and alien distribution data of the species were utilized in the modeling process. The common areas predicted by MX, BRT, RF, and CL from the CS GCM were extracted and compared to ascertain projection uncertainty levels of each individual technique. The common areas identified by all four modeling techniques were used to produce a map indicating suitable and unsuitable areas for date palm cultivation for Middle Eastern countries, for the present and the year 2100. The four different modeling approaches predict fairly different distributions. Projections from CL were more conservative than from MX. The BRT and RF were the most conservative methods in terms of projections for the current time. The combination of the final CL and MX projections for the present and 2100 provide higher certainty concerning those areas that will become highly suitable for future date palm cultivation. According to the four models, cold, hot, and wet stress, with differences on a regional basis, appears to be the major restrictions on future date palm distribution. The results demonstrate variances in the projections, resulting from different techniques. The assessment and interpretation of model projections requires reservations

  8. Maximizing the Diversity of Ensemble Random Forests for Tree Genera Classification Using High Density LiDAR Data

    Directory of Open Access Journals (Sweden)

    Connie Ko

    2016-08-01

    Full Text Available Recent research into improving the effectiveness of forest inventory management using airborne LiDAR data has focused on developing advanced theories in data analytics. Furthermore, supervised learning as a predictive model for classifying tree genera (and species, where possible has been gaining popularity in order to minimize this labor-intensive task. However, bottlenecks remain that hinder the immediate adoption of supervised learning methods. With supervised classification, training samples are required for learning the parameters that govern the performance of a classifier, yet the selection of training data is often subjective and the quality of such samples is critically important. For LiDAR scanning in forest environments, the quantification of data quality is somewhat abstract, normally referring to some metric related to the completeness of individual tree crowns; however, this is not an issue that has received much attention in the literature. Intuitively the choice of training samples having varying quality will affect classification accuracy. In this paper a Diversity Index (DI is proposed that characterizes the diversity of data quality (Qi among selected training samples required for constructing a classification model of tree genera. The training sample is diversified in terms of data quality as opposed to the number of samples per class. The diversified training sample allows the classifier to better learn the positive and negative instances and; therefore; has a higher classification accuracy in discriminating the “unknown” class samples from the “known” samples. Our algorithm is implemented within the Random Forests base classifiers with six derived geometric features from LiDAR data. The training sample contains three tree genera (pine; poplar; and maple and the validation samples contains four labels (pine; poplar; maple; and “unknown”. Classification accuracy improved from 72.8%; when training samples were

  9. A novel prediction approach for antimalarial activities of Trimethoprim, Pyrimethamine, and Cycloguanil analogues using extremely randomized trees.

    Science.gov (United States)

    Nattee, Cholwich; Khamsemanan, Nirattaya; Lawtrakul, Luckhana; Toochinda, Pisanu; Hannongbua, Supa

    2017-01-01

    Malaria is still one of the most serious diseases in tropical regions. This is due in part to the high resistance against available drugs for the inhibition of parasites, Plasmodium, the cause of the disease. New potent compounds with high clinical utility are urgently needed. In this work, we created a novel model using a regression tree to study structure-activity relationships and predict the inhibition constant, K i of three different antimalarial analogues (Trimethoprim, Pyrimethamine, and Cycloguanil) based on their molecular descriptors. To the best of our knowledge, this work is the first attempt to study the structure-activity relationships of all three analogues combined. The most relevant descriptors and appropriate parameters of the regression tree are harvested using extremely randomized trees. These descriptors are water accessible surface area, Log of the aqueous solubility, total hydrophobic van der Waals surface area, and molecular refractivity. Out of all possible combinations of these selected parameters and descriptors, the tree with the strongest coefficient of determination is selected to be our prediction model. Predicted K i values from the proposed model show a strong coefficient of determination, R 2 =0.996, to experimental K i values. From the structure of the regression tree, compounds with high accessible surface area of all hydrophobic atoms (ASA_H) and low aqueous solubility of inhibitors (Log S) generally possess low K i values. Our prediction model can also be utilized as a screening test for new antimalarial drug compounds which may reduce the time and expenses for new drug development. New compounds with high predicted K i should be excluded from further drug development. It is also our inference that a threshold of ASA_H greater than 575.80 and Log S less than or equal to -4.36 is a sufficient condition for a new compound to possess a low K i . Copyright © 2016 Elsevier Inc. All rights reserved.

  10. Pseudo-random Trees: Multiple Independent Sequence Generators for Parallel and Branching Computations

    Science.gov (United States)

    Halton, John H.

    1989-09-01

    A class of families of linear congruential pseudo-random sequences is defined, for which it is possible to branch at any event without changing the sequence of random numbers used in the original random walk and for which the sequences in different branches show properties analogous to mutual statistical independence. This is a hitherto unavailable, and computationally desirable, tool.

  11. Imitation learning of car driving skills with decision trees and random forests

    Directory of Open Access Journals (Sweden)

    Cichosz Paweł

    2014-09-01

    Full Text Available Machine learning is an appealing and useful approach to creating vehicle control algorithms, both for simulated and real vehicles. One common learning scenario that is often possible to apply is learning by imitation, in which the behavior of an exemplary driver provides training instances for a supervised learning algorithm. This article follows this approach in the domain of simulated car racing, using the TORCS simulator. In contrast to most prior work on imitation learning, a symbolic decision tree knowledge representation is adopted, which combines potentially high accuracy with human readability, an advantage that can be important in many applications. Decision trees are demonstrated to be capable of representing high quality control models, reaching the performance level of sophisticated pre-designed algorithms. This is achieved by enhancing the basic imitation learning scenario to include active retraining, automatically triggered on control failures. It is also demonstrated how better stability and generalization can be achieved by sacrificing human-readability and using decision tree model ensembles. The methodology for learning control models contributed by this article can be hopefully applied to solve real-world control tasks, as well as to develop video game bots

  12. Repeated measurements of blood lactate concentration as a prognostic marker in horses with acute colitis evaluated with classification and regression trees (CART) and random forest analysis

    DEFF Research Database (Denmark)

    Petersen, Mette Bisgaard; Tolver, Anders; Husted, Louise

    2016-01-01

    -off value of 7 mmol/L had a sensitivity of 0.66 and a specificity of 0.92 in predicting survival. In independent test data, the sensitivity was 0.69 and the specificity was 0.76. At the observed survival rate (38%), the optimal decision tree identified horses as non-survivors when the Lac at admission...... admitted with acute colitis (trees, as well as random...

  13. Efficient random access high resolution region-of-interest (ROI) image retrieval using backward coding of wavelet trees (BCWT)

    Science.gov (United States)

    Corona, Enrique; Nutter, Brian; Mitra, Sunanda; Guo, Jiangling; Karp, Tanja

    2008-03-01

    Efficient retrieval of high quality Regions-Of-Interest (ROI) from high resolution medical images is essential for reliable interpretation and accurate diagnosis. Random access to high quality ROI from codestreams is becoming an essential feature in many still image compression applications, particularly in viewing diseased areas from large medical images. This feature is easier to implement in block based codecs because of the inherent spatial independency of the code blocks. This independency implies that the decoding order of the blocks is unimportant as long as the position for each is properly identified. In contrast, wavelet-tree based codecs naturally use some interdependency that exploits the decaying spectrum model of the wavelet coefficients. Thus one must keep track of the decoding order from level to level with such codecs. We have developed an innovative multi-rate image subband coding scheme using "Backward Coding of Wavelet Trees (BCWT)" which is fast, memory efficient, and resolution scalable. It offers far less complexity than many other existing codecs including both, wavelet-tree, and block based algorithms. The ROI feature in BCWT is implemented through a transcoder stage that generates a new BCWT codestream containing only the information associated with the user-defined ROI. This paper presents an efficient technique that locates a particular ROI within the BCWT coded domain, and decodes it back to the spatial domain. This technique allows better access and proper identification of pathologies in high resolution images since only a small fraction of the codestream is required to be transmitted and analyzed.

  14. Spatial prediction of landslides using a hybrid machine learning approach based on Random Subspace and Classification and Regression Trees

    Science.gov (United States)

    Pham, Binh Thai; Prakash, Indra; Tien Bui, Dieu

    2018-02-01

    A hybrid machine learning approach of Random Subspace (RSS) and Classification And Regression Trees (CART) is proposed to develop a model named RSSCART for spatial prediction of landslides. This model is a combination of the RSS method which is known as an efficient ensemble technique and the CART which is a state of the art classifier. The Luc Yen district of Yen Bai province, a prominent landslide prone area of Viet Nam, was selected for the model development. Performance of the RSSCART model was evaluated through the Receiver Operating Characteristic (ROC) curve, statistical analysis methods, and the Chi Square test. Results were compared with other benchmark landslide models namely Support Vector Machines (SVM), single CART, Naïve Bayes Trees (NBT), and Logistic Regression (LR). In the development of model, ten important landslide affecting factors related with geomorphology, geology and geo-environment were considered namely slope angles, elevation, slope aspect, curvature, lithology, distance to faults, distance to rivers, distance to roads, and rainfall. Performance of the RSSCART model (AUC = 0.841) is the best compared with other popular landslide models namely SVM (0.835), single CART (0.822), NBT (0.821), and LR (0.723). These results indicate that performance of the RSSCART is a promising method for spatial landslide prediction.

  15. Effect of tree nuts on glycemic control in diabetes: a systematic review and meta-analysis of randomized controlled dietary trials.

    Directory of Open Access Journals (Sweden)

    Effie Viguiliouk

    Full Text Available Tree nut consumption has been associated with reduced diabetes risk, however, results from randomized trials on glycemic control have been inconsistent.To provide better evidence for diabetes guidelines development, we conducted a systematic review and meta-analysis of randomized controlled trials to assess the effects of tree nuts on markers of glycemic control in individuals with diabetes.MEDLINE, EMBASE, CINAHL, and Cochrane databases through 6 April 2014.Randomized controlled trials ≥3 weeks conducted in individuals with diabetes that compare the effect of diets emphasizing tree nuts to isocaloric diets without tree nuts on HbA1c, fasting glucose, fasting insulin, and HOMA-IR.Two independent reviewer's extracted relevant data and assessed study quality and risk of bias. Data were pooled by the generic inverse variance method and expressed as mean differences (MD with 95% CI's. Heterogeneity was assessed (Cochran Q-statistic and quantified (I2.Twelve trials (n = 450 were included. Diets emphasizing tree nuts at a median dose of 56 g/d significantly lowered HbA1c (MD = -0.07% [95% CI:-0.10, -0.03%]; P = 0.0003 and fasting glucose (MD = -0.15 mmol/L [95% CI: -0.27, -0.02 mmol/L]; P = 0.03 compared with control diets. No significant treatment effects were observed for fasting insulin and HOMA-IR, however the direction of effect favoured tree nuts.Majority of trials were of short duration and poor quality.Pooled analyses show that tree nuts improve glycemic control in individuals with type 2 diabetes, supporting their inclusion in a healthy diet. Owing to the uncertainties in our analyses there is a need for longer, higher quality trials with a focus on using nuts to displace high-glycemic index carbohydrates.ClinicalTrials.gov NCT01630980.

  16. An Introduction to Recursive Partitioning: Rationale, Application, and Characteristics of Classification and Regression Trees, Bagging, and Random Forests

    Science.gov (United States)

    Strobl, Carolin; Malley, James; Tutz, Gerhard

    2009-01-01

    Recursive partitioning methods have become popular and widely used tools for nonparametric regression and classification in many scientific fields. Especially random forests, which can deal with large numbers of predictor variables even in the presence of complex interactions, have been applied successfully in genetics, clinical medicine, and…

  17. Discrete probability models and methods probability on graphs and trees, Markov chains and random fields, entropy and coding

    CERN Document Server

    Brémaud, Pierre

    2017-01-01

    The emphasis in this book is placed on general models (Markov chains, random fields, random graphs), universal methods (the probabilistic method, the coupling method, the Stein-Chen method, martingale methods, the method of types) and versatile tools (Chernoff's bound, Hoeffding's inequality, Holley's inequality) whose domain of application extends far beyond the present text. Although the examples treated in the book relate to the possible applications, in the communication and computing sciences, in operations research and in physics, this book is in the first instance concerned with theory. The level of the book is that of a beginning graduate course. It is self-contained, the prerequisites consisting merely of basic calculus (series) and basic linear algebra (matrices). The reader is not assumed to be trained in probability since the first chapters give in considerable detail the background necessary to understand the rest of the book. .

  18. POROSIMETRY BY RANDOM NODE STRUCTURING IN VIRTUAL CONCRETE

    Directory of Open Access Journals (Sweden)

    Piet Stroeven

    2012-05-01

    Full Text Available Two different porosimetry methods are presented in two successive papers. Inspiration for the development came from the rapidly-exploring random tree (RRT approach used in robotics. The novel methods are applied to virtual cementitious materials produced by a modern concurrent algorithm-based discrete element modeling system, HADES. This would render possible realistically simulating all aspects of particulate matter that influence structure-sensitive features of the pore network structure in maturing concrete, namely size, shape and dispersion of the aggregate and cement particles. Pore space is a complex tortuous entity. Practical methods conventionally applied for assessment of pore size distribution may fail or present biased information. Among them, mercury intrusion porosimetry and 2D quantitative image analysis are popular. The mathematical morphology operator “opening” can be applied to sections and even provide 3D information on pore size distribution, provided isotropy is guaranteed. However, aggregate grain surfaces lead to anisotropy in porosity. The presented methods allow exploration of pore space in the virtual material, after which pore size distribution is derived from star volume measurements. In addition to size of pores their continuity is of crucial importance for durability estimation. Double-random multiple tree structuring (DRaMuTS, introduced earlier in IA&S (Stroeven et al., 2011b and random node structuring (RaNoS provide such information.

  19. Flowering Trees

    Indian Academy of Sciences (India)

    Flowering Trees. Boswellia serrata Roxb. ex Colebr. (Indian Frankincense tree) of Burseraceae is a large-sized deciduous tree that is native to India. Bark is thin, greenish-ash-coloured that exfoliates into smooth papery flakes. Stem exudes pinkish resin ... Fruit is a three-valved capsule. A green gum-resin exudes from the ...

  20. Flowering Trees

    Indian Academy of Sciences (India)

    IAS Admin

    Flowering Trees. Ailanthus excelsa Roxb. (INDIAN TREE OF. HEAVEN) of Simaroubaceae is a lofty tree with large pinnately compound alternate leaves, which are ... inflorescences, unisexual and greenish-yellow. Fruits are winged, wings many-nerved. Wood is used in making match sticks. 1. Male flower; 2. Female flower.

  1. Flowering Trees

    Indian Academy of Sciences (India)

    Flowering Trees. Gyrocarpus americanus Jacq. (Helicopter Tree) of Hernandiaceae is a moderate size deciduous tree that grows to about 12 m in height with a smooth, shining, greenish-white bark. The leaves are ovate, rarely irregularly ... flowers which are unpleasant smelling. Fruit is a woody nut with two long thin wings.

  2. Flowering Trees

    Indian Academy of Sciences (India)

    More Details Fulltext PDF. Volume 8 Issue 8 August 2003 pp 112-112 Flowering Trees. Zizyphus jujuba Lam. of Rhamnaceae · More Details Fulltext PDF. Volume 8 Issue 9 September 2003 pp 97-97 Flowering Trees. Moringa oleifera · More Details Fulltext PDF. Volume 8 Issue 10 October 2003 pp 100-100 Flowering Trees.

  3. Generic Ising trees

    DEFF Research Database (Denmark)

    Durhuus, Bergfinnur Jøgvan; Napolitano, George Maria

    2012-01-01

    The Ising model on a class of infinite random trees is defined as a thermodynamiclimit of finite systems. A detailed description of the corresponding distribution of infinite spin configurations is given. As an application, we study the magnetization properties of such systems and prove that they......The Ising model on a class of infinite random trees is defined as a thermodynamiclimit of finite systems. A detailed description of the corresponding distribution of infinite spin configurations is given. As an application, we study the magnetization properties of such systems and prove...... that they exhibit no spontaneous magnetization. Furthermore, the values of the Hausdorff and spectral dimensions of the underlying trees are calculated and found to be, respectively,¯dh =2 and¯ds = 4/3....

  4. Tree compression with top trees

    DEFF Research Database (Denmark)

    Bille, Philip; Gørtz, Inge Li; Landau, Gad M.

    2013-01-01

    We introduce a new compression scheme for labeled trees based on top trees [3]. Our compression scheme is the first to simultaneously take advantage of internal repeats in the tree (as opposed to the classical DAG compression that only exploits rooted subtree repeats) while also supporting fast...

  5. Tree compression with top trees

    DEFF Research Database (Denmark)

    Bille, Philip; Gørtz, Inge Li; Landau, Gad M.

    2015-01-01

    We introduce a new compression scheme for labeled trees based on top trees. Our compression scheme is the first to simultaneously take advantage of internal repeats in the tree (as opposed to the classical DAG compression that only exploits rooted subtree repeats) while also supporting fast...

  6. Exploratory Decision-Tree Modeling of Data from the Randomized REACTT Trial of Tadalafil Versus Placebo to Predict Recovery of Erectile Function After Bilateral Nerve-Sparing Radical Prostatectomy.

    Science.gov (United States)

    Montorsi, Francesco; Oelke, Matthias; Henneges, Carsten; Brock, Gerald; Salonia, Andrea; d'Anzeo, Gianluca; Rossi, Andrea; Mulhall, John P; Büttner, Hartwig

    2016-09-01

    Understanding predictors for the recovery of erectile function (EF) after nerve-sparing radical prostatectomy (nsRP) might help clinicians and patients in preoperative counseling and expectation management of EF rehabilitation strategies. To describe the effect of potential predictors on EF recovery after nsRP by post hoc decision-tree modeling of data from A Study of Tadalafil After Radical Prostatectomy (REACTT). Randomized double-blind double-dummy placebo-controlled trial in 423 men aged decision-tree models, using the International Index of Erectile Function-Erectile Function (IIEF-EF) domain score at the end of double-blind treatment, washout, and open-label treatment as response variable. Each model evaluated the association between potential predictors: presurgery IIEF domain and IIEF single-item scores, surgical approach, nerve-sparing score (NSS), and postsurgery randomized treatment group. The first decision-tree model (n=422, intention-to-treat population) identified high presurgery sexual desire (IIEF item 12: ≥3.5 and decision-tree analyses identified high presurgery sexual desire, confidence, and intercourse satisfaction as key predictors for EF recovery. Patients meeting these criteria might benefit the most from conserving surgery and early postsurgery EF rehabilitation. Strategies for improving EF after surgery should be discussed preoperatively with all patients; this information may support expectation management for functional recovery on an individual patient level. Understanding how patient characteristics and different treatment options affect the recovery of erectile function (EF) after radical surgery for prostate cancer might help physicians select the optimal treatment for their patients. This analysis of data from a clinical trial suggested that high presurgery sexual desire, sexual confidence, and intercourse satisfaction are key factors predicting EF recovery. Patients meeting these criteria might benefit the most from conserving

  7. Tree Nut Allergies

    Science.gov (United States)

    ... Blog Vision Awards Common Allergens Tree Nut Allergy Tree Nut Allergy Learn about tree nut allergy, how ... a Tree Nut Label card . Allergic Reactions to Tree Nuts Tree nuts can cause a severe and ...

  8. Decision tree modeling using R.

    Science.gov (United States)

    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.

  9. Integrating cyber attacks within fault trees

    International Nuclear Information System (INIS)

    Nai Fovino, Igor; Masera, Marcelo; De Cian, Alessio

    2009-01-01

    In this paper, a new method for quantitative security risk assessment of complex systems is presented, combining fault-tree analysis, traditionally used in reliability analysis, with the recently introduced Attack-tree analysis, proposed for the study of malicious attack patterns. The combined use of fault trees and attack trees helps the analyst to effectively face the security challenges posed by the introduction of modern ICT technologies in the control systems of critical infrastructures. The proposed approach allows considering the interaction of malicious deliberate acts with random failures. Formal definitions of fault tree and attack tree are provided and a mathematical model for the calculation of system fault probabilities is presented.

  10. On Tree-Based Phylogenetic Networks.

    Science.gov (United States)

    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.

  11. Integrating cyber attacks within fault trees

    Energy Technology Data Exchange (ETDEWEB)

    Nai Fovino, Igor [Joint Research Centre - EC, Institute for the Protection and Security of the Citizen, Ispra, VA (Italy)], E-mail: igor.nai@jrc.it; Masera, Marcelo [Joint Research Centre - EC, Institute for the Protection and Security of the Citizen, Ispra, VA (Italy); De Cian, Alessio [Department of Electrical Engineering, University di Genova, Genoa (Italy)

    2009-09-15

    In this paper, a new method for quantitative security risk assessment of complex systems is presented, combining fault-tree analysis, traditionally used in reliability analysis, with the recently introduced Attack-tree analysis, proposed for the study of malicious attack patterns. The combined use of fault trees and attack trees helps the analyst to effectively face the security challenges posed by the introduction of modern ICT technologies in the control systems of critical infrastructures. The proposed approach allows considering the interaction of malicious deliberate acts with random failures. Formal definitions of fault tree and attack tree are provided and a mathematical model for the calculation of system fault probabilities is presented.

  12. Flowering Trees

    Indian Academy of Sciences (India)

    medium-sized handsome tree with a straight bole that branches at the top. Leaves are once pinnate, with two to three pairs of leaflets. Young parts of the tree are velvety. Inflorescence is a branched raceme borne at the branch ends. Flowers are large, white, attractive, and fragrant. Corolla is funnel-shaped. Fruit is an ...

  13. Flowering Trees

    Indian Academy of Sciences (India)

    Cassia siamia Lamk. (Siamese tree senna) of Caesalpiniaceae is a small or medium size handsome tree. Leaves are alternate, pinnately compound and glandular, upto 18 cm long with 8–12 pairs of leaflets. Inflorescence is axillary or terminal and branched. Flowering lasts for a long period from March to February. Fruit is ...

  14. Flowering Trees

    Indian Academy of Sciences (India)

    Flowering Trees. Cerbera manghasL. (SEA MANGO) of Apocynaceae is a medium-sized evergreen coastal tree with milky latex. The bark is grey-brown, thick and ... Fruit is large. (5–10 cm long), oval containing two flattened seeds and resembles a mango, hence the name Mangas or. Manghas. Leaves and fruits contain ...

  15. Flowering Trees

    Indian Academy of Sciences (India)

    user

    Flowering Trees. Gliricidia sepium(Jacq.) Kunta ex Walp. (Quickstick) of Fabaceae is a small deciduous tree with. Pinnately compound leaves. Flower are prroduced in large number in early summer on terminal racemes. They are attractive, pinkish-white and typically like bean flowers. Fruit is a few-seeded flat pod.

  16. Flowering Trees

    Indian Academy of Sciences (India)

    Flowering Trees. Acrocarpus fraxinifolius Wight & Arn. (PINK CEDAR, AUSTRALIAN ASH) of. Caesalpiniaceae is a lofty unarmed deciduous native tree that attains a height of 30–60m with buttresses. Bark is thin and light grey. Leaves are compound and bright red when young. Flowers in dense, erect, axillary racemes.

  17. Talking Trees

    Science.gov (United States)

    Tolman, Marvin

    2005-01-01

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

  18. Drawing Trees

    DEFF Research Database (Denmark)

    Halkjær From, Andreas; Schlichtkrull, Anders; Villadsen, Jørgen

    2018-01-01

    We formally prove in Isabelle/HOL two properties of an algorithm for laying out trees visually. The first property states that removing layout annotations recovers the original tree. The second property states that nodes are placed at least a unit of distance apart. We have yet to formalize three...

  19. Flowering Trees

    Indian Academy of Sciences (India)

    Srimath

    Grevillea robusta A. Cunn. ex R. Br. (Sil- ver Oak) of Proteaceae is a daintily lacy ornamental tree while young and growing into a mighty tree (45 m). Young shoots are silvery grey and the leaves are fern- like. Flowers are golden-yellow in one- sided racemes (10 cm). Fruit is a boat- shaped, woody follicle.

  20. Decision-Tree, Rule-Based, and Random Forest Classification of High-Resolution Multispectral Imagery for Wetland Mapping and Inventory

    Science.gov (United States)

    Efforts are increasingly being made to classify the world’s wetland resources, an important ecosystem and habitat that is diminishing in abundance. There are multiple remote sensing classification methods, including a suite of nonparametric classifiers such as decision-tree...

  1. Phylogenetic trees

    OpenAIRE

    Baños, Hector; Bushek, Nathaniel; Davidson, Ruth; Gross, Elizabeth; Harris, Pamela E.; Krone, Robert; Long, Colby; Stewart, Allen; Walker, Robert

    2016-01-01

    We introduce the package PhylogeneticTrees for Macaulay2 which allows users to compute phylogenetic invariants for group-based tree models. We provide some background information on phylogenetic algebraic geometry and show how the package PhylogeneticTrees can be used to calculate a generating set for a phylogenetic ideal as well as a lower bound for its dimension. Finally, we show how methods within the package can be used to compute a generating set for the join of any two ideals.

  2. Succinct Representations of Binary Trees for Range Minimum Queries

    DEFF Research Database (Denmark)

    Davoodi, Pooya; Raman, Rajeev; Satti, Srinivasa

    2012-01-01

    is a modification of the representation of Farzan and Munro (SWAT 2008); a consequence of this result is that we can represent the Cartesian tree of a random permutation in 1.92n + o(n) bits in expectation. The second one uses a well-known transformation between binary trees and ordinal trees, and ordinal tree...

  3. Tree manipulation experiment

    Science.gov (United States)

    Nishina, K.; Takenaka, C.; Ishizuka, S.; Hashimoto, S.; Yagai, Y.

    2012-12-01

    Some forest operations such as thinning and harvesting management could cause changes in N cycling and N2O emission from soils, since thinning and harvesting managements are accompanied with changes in aboveground environments such as an increase of slash falling and solar radiation on the forest floor. However, a considerable uncertainty exists in effects of thinning and harvesting on N2O fluxes regarding changes in belowground environments by cutting trees. To focus on the effect of changes in belowground environments on the N2O emissions from soils, we conducted a tree manipulation experiment in Japanese cedar (Cryptomeria japonica) stand without soil compaction and slash falling near the chambers and measured N2O flux at 50 cm and 150 cm distances from the tree trunk (stump) before and after cutting. We targeted 5 trees for the manipulation and established the measurement chambers to the 4 directions around each targeted tree relative to upper slope (upper, left, right, lower positions). We evaluated the effect of logging on the emission by using hierarchical Bayesian model. HB model can evaluate the variability in observed data and their uncertainties in the estimation with various probability distributions. Moreover, the HB model can easily accommodate the non-linear relationship among the N2O emissions and the environmental factors, and explicitly take non-independent data (nested structure of data) for the estimation into account by using random effects in the model. Our results showed tree cutting stimulated N2O emission from soils, and also that the increase of N2O flux depended on the distance from the trunk (stump): the increase of N2O flux at 50 cm from the trunk (stump) was greater than that of 150 cm from the trunk. The posterior simulation of the HB model indicated that the stimulation of N2O emission by tree cut- ting could reach up to 200 cm in our experimental plot. By tree cutting, the estimated N2O emission at 0-40 cm from the trunk doubled

  4. Electron Tree

    DEFF Research Database (Denmark)

    Appelt, Ane L; Rønde, Heidi S

    2013-01-01

    The photo shows a close-up of a Lichtenberg figure – popularly called an “electron tree” – produced in a cylinder of polymethyl methacrylate (PMMA). Electron trees are created by irradiating a suitable insulating material, in this case PMMA, with an intense high energy electron beam. Upon discharge......, during dielectric breakdown in the material, the electrons generate branching chains of fractures on leaving the PMMA, producing the tree pattern seen. To be able to create electron trees with a clinical linear accelerator, one needs to access the primary electron beam used for photon treatments. We...... appropriated a linac that was being decommissioned in our department and dismantled the head to circumvent the target and ion chambers. This is one of 24 electron trees produced before we had to stop the fun and allow the rest of the accelerator to be disassembled....

  5. Flowering Trees

    Indian Academy of Sciences (India)

    Srimath

    shaped corolla. Fruit is large, ellipsoidal, green with a hard and smooth shell containing numerous flattened seeds, which are embedded in fleshy pulp. Calabash tree is commonly grown in the tropical gardens of the world as a botanical oddity.

  6. Tree Coding of Bilevel Images

    DEFF Research Database (Denmark)

    Martins, Bo; Forchhammer, Søren

    1998-01-01

    Presently, sequential tree coders are the best general purpose bilevel image coders and the best coders of halftoned images. The current ISO standard, Joint Bilevel Image Experts Group (JBIG), is a good example. A sequential tree coder encodes the data by feeding estimates of conditional...... is one order of magnitude slower than JBIG, obtains excellent and highly robust compression performance. A multipass free tree coding scheme produces superior compression results for all test images. A multipass free template coding scheme produces significantly better results than JBIG for difficult...... images such as halftones. By utilizing randomized subsampling in the template selection, the speed becomes acceptable for practical image coding...

  7. Creating ensembles of decision trees through sampling

    Science.gov (United States)

    Kamath, Chandrika; Cantu-Paz, Erick

    2005-08-30

    A system for decision tree ensembles that includes a module to read the data, a module to sort the data, a module to evaluate a potential split of the data according to some criterion using a random sample of the data, a module to split the data, and a module to combine multiple decision trees in ensembles. The decision tree method is based on statistical sampling techniques and includes the steps of reading the data; sorting the data; evaluating a potential split according to some criterion using a random sample of the data, splitting the data, and combining multiple decision trees in ensembles.

  8. Randomized clinical trial comparing the efficacy of the vaginal use of metronidazole with a Brazilian pepper tree (Schinus) extract for the treatment of bacterial vaginosis.

    Science.gov (United States)

    Leite, S R R F; Amorim, M M R; Sereno, P F B; Leite, T N F; Ferreira, J A C; Ximenes, R A A

    2011-03-01

    A 7.4% vaginal extract of the Brazilian pepper tree (Schinus terebinthifolius Raddi) was compared with 0.75% vaginal metronidazole, both manufactured by the Hebron Laboratory, for the treatment of bacterial vaginosis, used at bedtime for 7 nights. The condition was diagnosed using the combined criteria of Amsel and Nugent in two groups of 140 and 137 women, aged between 18 and 40 years. Intention-to-treat analysis was performed. Women were excluded from the study if they presented delayed menstruation, were pregnant, were using or had used any topical or systemic medication, presented any other vaginal infections, presented hymen integrity, or if they reported any history suggestive of acute pelvic inflammatory disease. According to Amsel's criteria separately, 29 patients (21.2%) treated with the extract and 87 (62.1%) treated with metronidazole were considered to be cured (P < 0.001). According to Nugent's score separately, 19 women (13.9%) treated with the extract and 79 (56.4%) treated with metronidazole were considered to be cured (P < 0.001). Using the two criteria together, the so-called total cure was observed in 17 women (12.4%) treated with the extract and in 79 women (56.4%) treated with metronidazole (P < 0.001). In conclusion, the cure rate for bacterial vaginosis using a vaginal gel from a pepper tree extract was lower than the rate obtained with metronidazole gel, while side effects were infrequent and non-severe in both groups.

  9. Data mining methods in the prediction of Dementia: A real-data comparison of the accuracy, sensitivity and specificity of linear discriminant analysis, logistic regression, neural networks, support vector machines, classification trees and random forests

    Directory of Open Access Journals (Sweden)

    Santana Isabel

    2011-08-01

    Full Text Available Abstract Background Dementia and cognitive impairment associated with aging are a major medical and social concern. Neuropsychological testing is a key element in the diagnostic procedures of Mild Cognitive Impairment (MCI, but has presently a limited value in the prediction of progression to dementia. We advance the hypothesis that newer statistical classification methods derived from data mining and machine learning methods like Neural Networks, Support Vector Machines and Random Forests can improve accuracy, sensitivity and specificity of predictions obtained from neuropsychological testing. Seven non parametric classifiers derived from data mining methods (Multilayer Perceptrons Neural Networks, Radial Basis Function Neural Networks, Support Vector Machines, CART, CHAID and QUEST Classification Trees and Random Forests were compared to three traditional classifiers (Linear Discriminant Analysis, Quadratic Discriminant Analysis and Logistic Regression in terms of overall classification accuracy, specificity, sensitivity, Area under the ROC curve and Press'Q. Model predictors were 10 neuropsychological tests currently used in the diagnosis of dementia. Statistical distributions of classification parameters obtained from a 5-fold cross-validation were compared using the Friedman's nonparametric test. Results Press' Q test showed that all classifiers performed better than chance alone (p Conclusions When taking into account sensitivity, specificity and overall classification accuracy Random Forests and Linear Discriminant analysis rank first among all the classifiers tested in prediction of dementia using several neuropsychological tests. These methods may be used to improve accuracy, sensitivity and specificity of Dementia predictions from neuropsychological testing.

  10. A Metric on Phylogenetic Tree Shapes.

    Science.gov (United States)

    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.

  11. Evaluating effectiveness of down-sampling for stratified designs and unbalanced prevalence in Random Forest models of tree species distributions in Nevada

    Science.gov (United States)

    Elizabeth A. Freeman; Gretchen G. Moisen; Tracy S. Frescino

    2012-01-01

    Random Forests is frequently used to model species distributions over large geographic areas. Complications arise when data used to train the models have been collected in stratified designs that involve different sampling intensity per stratum. The modeling process is further complicated if some of the target species are relatively rare on the landscape leading to an...

  12. Flowering Trees

    Indian Academy of Sciences (India)

    deciduous tree with irregularly-shaped trunk, greyish-white scaly bark and milky latex. Leaves in opposite pairs are simple, oblong and whitish beneath. Flowers that occur in branched inflorescence are white, 2–. 3cm across and fragrant. Calyx is glandular inside. Petals bear numerous linear white scales, the corollary.

  13. Flowering Trees

    Indian Academy of Sciences (India)

    Berrya cordifolia (Willd.) Burret (Syn. B. ammonilla Roxb.) – Trincomali Wood of Tiliaceae is a tall evergreen tree with straight trunk, smooth brownish-grey bark and simple broad leaves. Inflorescence is much branched with white flowers. Stamens are many with golden yellow anthers. Fruit is a capsule with six spreading ...

  14. Flowering Trees

    Indian Academy of Sciences (India)

    Canthium parviflorum Lam. of Rubiaceae is a large shrub that often grows into a small tree with conspicuous spines. Leaves are simple, in pairs at each node and are shiny. Inflorescence is an axillary few-flowered cymose fascicle. Flowers are small (less than 1 cm across), 4-merous and greenish-white. Fruit is ellipsoid ...

  15. Flowering Trees

    Indian Academy of Sciences (India)

    sriranga

    Hook.f. ex Brandis (Yellow. Cadamba) of Rubiaceae is a large and handsome deciduous tree. Leaves are simple, large, orbicular, and drawn abruptly at the apex. Flowers are small, yellowish and aggregate into small spherical heads. The corolla is funnel-shaped with five stamens inserted at its mouth. Fruit is a capsule.

  16. Flowering Trees

    Indian Academy of Sciences (India)

    Celtis tetrandra Roxb. of Ulmaceae is a moderately large handsome deciduous tree with green branchlets and grayish-brown bark. Leaves are simple with three to four secondary veins running parallel to the mid vein. Flowers are solitary, male, female and bisexual and inconspicuous. Fruit is berry-like, small and globose ...

  17. Flowering Trees

    Indian Academy of Sciences (India)

    IAS Admin

    Aglaia elaeagnoidea (A.Juss.) Benth. of Meliaceae is a small-sized evergreen tree of both moist and dry deciduous forests. The leaves are alternate and pinnately compound, terminating in a single leaflet. Leaflets are more or less elliptic with entire margin. Flowers are small on branched inflorescence. Fruit is a globose ...

  18. Flowering Trees

    Indian Academy of Sciences (India)

    user

    Flowers are borne on stiff bunches terminally on short shoots. They are 2-3 cm across, white, sweet-scented with light-brown hairy sepals and many stamens. Loquat fruits are round or pear-shaped, 3-5 cm long and are edible. A native of China, Loquat tree is grown in parks as an ornamental and also for its fruits.

  19. Flowering Trees

    Indian Academy of Sciences (India)

    mid-sized slow-growing evergreen tree with spreading branches that form a dense crown. The bark is smooth, thick, dark and flakes off in large shreds. Leaves are thick, oblong, leathery and bright red when young. The female flowers are drooping and are larger than male flowers. Fruit is large, red in color and velvety.

  20. Flowering Trees

    Indian Academy of Sciences (India)

    Andira inermis (wright) DC. , Dog Almond of Fabaceae is a handsome lofty evergreen tree. Leaves are alternate and pinnately compound with 4–7 pairs of leaflets. Flowers are fragrant and are borne on compact branched inflorescences. Fruit is ellipsoidal one-seeded drupe that is peculiar to members of this family.

  1. Flowering Trees

    Indian Academy of Sciences (India)

    narrow towards base. Flowers are large and attrac- tive, but emit unpleasant foetid smell. They appear in small numbers on erect terminal clusters and open at night. Stamens are numerous, pink or white. Style is slender and long, terminating in a small stigma. Fruit is green, ovoid and indistinctly lobed. Flowering Trees.

  2. Flowering Trees

    Indian Academy of Sciences (India)

    Muntingia calabura L. (Singapore cherry) of. Elaeocarpaceae is a medium size handsome ever- green tree. Leaves are simple and alternate with sticky hairs. Flowers are bisexual, bear numerous stamens, white in colour and arise in the leaf axils. Fruit is a berry, edible with several small seeds embedded in a fleshy pulp ...

  3. ~{owering 'Trees

    Indian Academy of Sciences (India)

    . Stamens are fused into a purple staminal tube that is toothed. Fruit is about 0.5 in. across, nearly globose, generally 5-seeded, green but yellow when ripe, quite smooth at first but wrinkled in drying, remaining long on the tree ajier ripening.

  4. Tree Mortality

    Science.gov (United States)

    Mark J. Ambrose

    2012-01-01

    Tree mortality is a natural process in all forest ecosystems. However, extremely high mortality also can be an indicator of forest health issues. On a regional scale, high mortality levels may indicate widespread insect or disease problems. High mortality may also occur if a large proportion of the forest in a particular region is made up of older, senescent stands....

  5. Flowering Trees

    Indian Academy of Sciences (India)

    Guaiacum officinale L. (LIGNUM-VITAE) of Zygophyllaceae is a dense-crowned, squat, knobbly, rough and twisted medium-sized ev- ergreen tree with mottled bark. The wood is very hard and resinous. Leaves are compound. The leaflets are smooth, leathery, ovate-ellipti- cal and appear in two pairs. Flowers (about 1.5.

  6. On the number of vertices of each rank in phylogenetic trees and their generalizations

    OpenAIRE

    Bóna, Miklós

    2015-01-01

    We find surprisingly simple formulas for the limiting probability that the rank of a randomly selected vertex in a randomly selected phylogenetic tree or generalized phylogenetic tree is a given integer.

  7. Decision trees in epidemiological research

    Directory of Open Access Journals (Sweden)

    Ashwini Venkatasubramaniam

    2017-09-01

    Full Text Available Abstract Background In many studies, it is of interest to identify population subgroups that are relatively homogeneous with respect to an outcome. The nature of these subgroups can provide insight into effect mechanisms and suggest targets for tailored interventions. However, identifying relevant subgroups can be challenging with standard statistical methods. Main text We review the literature on decision trees, a family of techniques for partitioning the population, on the basis of covariates, into distinct subgroups who share similar values of an outcome variable. We compare two decision tree methods, the popular Classification and Regression tree (CART technique and the newer Conditional Inference tree (CTree technique, assessing their performance in a simulation study and using data from the Box Lunch Study, a randomized controlled trial of a portion size intervention. Both CART and CTree identify homogeneous population subgroups and offer improved prediction accuracy relative to regression-based approaches when subgroups are truly present in the data. An important distinction between CART and CTree is that the latter uses a formal statistical hypothesis testing framework in building decision trees, which simplifies the process of identifying and interpreting the final tree model. We also introduce a novel way to visualize the subgroups defined by decision trees. Our novel graphical visualization provides a more scientifically meaningful characterization of the subgroups identified by decision trees. Conclusions Decision trees are a useful tool for identifying homogeneous subgroups defined by combinations of individual characteristics. While all decision tree techniques generate subgroups, we advocate the use of the newer CTree technique due to its simplicity and ease of interpretation.

  8. Decision trees in epidemiological research.

    Science.gov (United States)

    Venkatasubramaniam, Ashwini; Wolfson, Julian; Mitchell, Nathan; Barnes, Timothy; JaKa, Meghan; French, Simone

    2017-01-01

    In many studies, it is of interest to identify population subgroups that are relatively homogeneous with respect to an outcome. The nature of these subgroups can provide insight into effect mechanisms and suggest targets for tailored interventions. However, identifying relevant subgroups can be challenging with standard statistical methods. We review the literature on decision trees, a family of techniques for partitioning the population, on the basis of covariates, into distinct subgroups who share similar values of an outcome variable. We compare two decision tree methods, the popular Classification and Regression tree (CART) technique and the newer Conditional Inference tree (CTree) technique, assessing their performance in a simulation study and using data from the Box Lunch Study, a randomized controlled trial of a portion size intervention. Both CART and CTree identify homogeneous population subgroups and offer improved prediction accuracy relative to regression-based approaches when subgroups are truly present in the data. An important distinction between CART and CTree is that the latter uses a formal statistical hypothesis testing framework in building decision trees, which simplifies the process of identifying and interpreting the final tree model. We also introduce a novel way to visualize the subgroups defined by decision trees. Our novel graphical visualization provides a more scientifically meaningful characterization of the subgroups identified by decision trees. Decision trees are a useful tool for identifying homogeneous subgroups defined by combinations of individual characteristics. While all decision tree techniques generate subgroups, we advocate the use of the newer CTree technique due to its simplicity and ease of interpretation.

  9. Coalescent methods for estimating phylogenetic trees.

    Science.gov (United States)

    Liu, Liang; Yu, Lili; Kubatko, Laura; Pearl, Dennis K; Edwards, Scott V

    2009-10-01

    We review recent models to estimate phylogenetic trees under the multispecies coalescent. Although the distinction between gene trees and species trees has come to the fore of phylogenetics, only recently have methods been developed that explicitly estimate species trees. Of the several factors that can cause gene tree heterogeneity and discordance with the species tree, deep coalescence due to random genetic drift in branches of the species tree has been modeled most thoroughly. Bayesian approaches to estimating species trees utilizes two likelihood functions, one of which has been widely used in traditional phylogenetics and involves the model of nucleotide substitution, and the second of which is less familiar to phylogeneticists and involves the probability distribution of gene trees given a species tree. Other recent parametric and nonparametric methods for estimating species trees involve parsimony criteria, summary statistics, supertree and consensus methods. Species tree approaches are an appropriate goal for systematics, appear to work well in some cases where concatenation can be misleading, and suggest that sampling many independent loci will be paramount. Such methods can also be challenging to implement because of the complexity of the models and computational time. In addition, further elaboration of the simplest of coalescent models will be required to incorporate commonly known issues such as deviation from the molecular clock, gene flow and other genetic forces.

  10. Improved Anonymity for Key-trees

    NARCIS (Netherlands)

    Veugen, P.J.M.; Beye, M.

    2013-01-01

    Randomized hash-lock protocols for Radio Frequency IDentification (RFID) tags offer forward untraceability, but incur heavy search on the server. Key trees have been proposed as a way to reduce search times, but because partial keys in such trees are shared, key compromise affects several tags.

  11. Surface tree languages and parallel derivation trees

    NARCIS (Netherlands)

    Engelfriet, Joost

    1976-01-01

    The surface tree languages obtained by top-down finite state transformation of monadic trees are exactly the frontier-preserving homomorphic images of sets of derivation trees of ETOL systems. The corresponding class of tree transformation languages is therefore equal to the class of ETOL languages.

  12. Trees are good, but…

    Science.gov (United States)

    E.G. McPherson; F. Ferrini

    2010-01-01

    We know that “trees are good,” and most people believe this to be true. But if this is so, why are so many trees neglected, and so many tree wells empty? An individual’s attitude toward trees may result from their firsthand encounters with specific trees. Understanding how attitudes about trees are shaped, particularly aversion to trees, is critical to the business of...

  13. Modular tree automata

    DEFF Research Database (Denmark)

    Bahr, Patrick

    2012-01-01

    Tree automata are traditionally used to study properties of tree languages and tree transformations. In this paper, we consider tree automata as the basis for modular and extensible recursion schemes. We show, using well-known techniques, how to derive from standard tree automata highly modular...

  14. Simple street tree sampling

    Science.gov (United States)

    David J. Nowak; Jeffrey T. Walton; James Baldwin; Jerry. Bond

    2015-01-01

    Information on street trees is critical for management of this important resource. Sampling of street tree populations provides an efficient means to obtain street tree population information. Long-term repeat measures of street tree samples supply additional information on street tree changes and can be used to report damages from catastrophic events. Analyses of...

  15. Minimum variance rooting of phylogenetic trees and implications for species tree reconstruction.

    Science.gov (United States)

    Mai, Uyen; Sayyari, Erfan; Mirarab, Siavash

    2017-01-01

    Phylogenetic trees inferred using commonly-used models of sequence evolution are unrooted, but the root position matters both for interpretation and downstream applications. This issue has been long recognized; however, whether the potential for discordance between the species tree and gene trees impacts methods of rooting a phylogenetic tree has not been extensively studied. In this paper, we introduce a new method of rooting a tree based on its branch length distribution; our method, which minimizes the variance of root to tip distances, is inspired by the traditional midpoint rerooting and is justified when deviations from the strict molecular clock are random. Like midpoint rerooting, the method can be implemented in a linear time algorithm. In extensive simulations that consider discordance between gene trees and the species tree, we show that the new method is more accurate than midpoint rerooting, but its relative accuracy compared to using outgroups to root gene trees depends on the size of the dataset and levels of deviations from the strict clock. We show high levels of error for all methods of rooting estimated gene trees due to factors that include effects of gene tree discordance, deviations from the clock, and gene tree estimation error. Our simulations, however, did not reveal significant differences between two equivalent methods for species tree estimation that use rooted and unrooted input, namely, STAR and NJst. Nevertheless, our results point to limitations of existing scalable rooting methods.

  16. City of Pittsburgh Trees

    Data.gov (United States)

    Allegheny County / City of Pittsburgh / Western PA Regional Data Center — Trees cared for and managed by the City of Pittsburgh Department of Public Works Forestry Division. Tree Benefits are calculated using the National Tree Benefit...

  17. Predictive equations for dimensions and leaf area of coastal Southern California street trees

    Science.gov (United States)

    P.J. Peper; E.G. McPherson; S.M. Mori

    2001-01-01

    Tree height, crown height, crown width, diameter at breast height (dbh), and leaf area were measured for 16 species of commonly planted street trees in the coastal southern California city of Santa Monica, USA. The randomly sampled trees were planted from 1 to 44 years ago. Using number of years after planting or dbh as explanatory variables, mean values of dbh, tree...

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

    Science.gov (United States)

    Fisler, Marie; Lecointre, Guillaume

    2013-01-01

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

  19. Urban tree growth modeling

    Science.gov (United States)

    E. Gregory McPherson; Paula J. Peper

    2012-01-01

    This paper describes three long-term tree growth studies conducted to evaluate tree performance because repeated measurements of the same trees produce critical data for growth model calibration and validation. Several empirical and process-based approaches to modeling tree growth are reviewed. Modeling is more advanced in the fields of forestry and...

  20. Keeping trees as assets

    Science.gov (United States)

    Kevin T. Smith

    2009-01-01

    Landscape trees have real value and contribute to making livable communities. Making the most of that value requires providing trees with the proper care and attention. As potentially large and long-lived organisms, trees benefit from commitment to regular care that respects the natural tree system. This system captures, transforms, and uses energy to survive, grow,...

  1. Shapes of tree representations of spin-glass landscapes

    International Nuclear Information System (INIS)

    Hordijk, Wim; Fontanari, Jose F; Stadler, Peter F

    2003-01-01

    Much of the information about the multi-valley structure of disordered spin systems can be convened in a simple tree structure - a barrier tree - the leaves and internal nodes of which represent, respectively, the local minima and the lowest energy saddles connecting those minima. Here we apply several statistics used in the study of phylogenetic trees to barrier trees that result from the energy landscapes of p-spin models. These statistics give information about the shape of these barrier trees, in particular about balance and symmetry. We then ask if they can be used to classify different types of landscapes, compare them with results obtained from random trees, and investigate the structure of subtrees of the barrier trees. We conclude that at least one of the used statistics is capable of distinguishing different types of landscapes, that the barrier trees from p-spin energy landscapes are quite different from random trees, and that subtrees of barrier trees do not reflect the overall tree structure, but their structure is correlated with their 'depth' in the tree

  2. Classification and regression trees

    CERN Document Server

    Breiman, Leo; Olshen, Richard A; Stone, Charles J

    1984-01-01

    The methodology used to construct tree structured rules is the focus of this monograph. Unlike many other statistical procedures, which moved from pencil and paper to calculators, this text's use of trees was unthinkable before computers. Both the practical and theoretical sides have been developed in the authors' study of tree methods. Classification and Regression Trees reflects these two sides, covering the use of trees as a data analysis method, and in a more mathematical framework, proving some of their fundamental properties.

  3. Stratified B-trees and versioning dictionaries

    OpenAIRE

    Twigg, Andy; Byde, Andrew; Milos, Grzegorz; Moreton, Tim; Wilkes, John; Wilkie, Tom

    2011-01-01

    A classic versioned data structure in storage and computer science is the copy-on-write (CoW) B-tree -- it underlies many of today's file systems and databases, including WAFL, ZFS, Btrfs and more. Unfortunately, it doesn't inherit the B-tree's optimality properties; it has poor space utilization, cannot offer fast updates, and relies on random IO to scale. Yet, nothing better has been developed since. We describe the `stratified B-tree', which beats all known semi-external memory versioned B...

  4. Fault tree handbook

    International Nuclear Information System (INIS)

    Haasl, D.F.; Roberts, N.H.; Vesely, W.E.; Goldberg, F.F.

    1981-01-01

    This handbook describes a methodology for reliability analysis of complex systems such as those which comprise the engineered safety features of nuclear power generating stations. After an initial overview of the available system analysis approaches, the handbook focuses on a description of the deductive method known as fault tree analysis. The following aspects of fault tree analysis are covered: basic concepts for fault tree analysis; basic elements of a fault tree; fault tree construction; probability, statistics, and Boolean algebra for the fault tree analyst; qualitative and quantitative fault tree evaluation techniques; and computer codes for fault tree evaluation. Also discussed are several example problems illustrating the basic concepts of fault tree construction and evaluation

  5. There's Life in Hazard Trees

    Science.gov (United States)

    Mary Torsello; Toni McLellan

    The goals of hazard tree management programs are to maximize public safety and maintain a healthy sustainable tree resource. Although hazard tree management frequently targets removal of trees or parts of trees that attract wildlife, it can take into account a diversity of tree values. With just a little extra planning, hazard tree management can be highly beneficial...

  6. Covering tree with stars

    DEFF Research Database (Denmark)

    Baumbach, Jan; Guo, Jiong; Ibragimov, Rashid

    2015-01-01

    We study the tree edit distance problem with edge deletions and edge insertions as edit operations. We reformulate a special case of this problem as Covering Tree with Stars (CTS): given a tree T and a set of stars, can we connect the stars in by adding edges between them such that the resulting...... tree is isomorphic to T? We prove that in the general setting, CST is NP-complete, which implies that the tree edit distance considered here is also NP-hard, even when both input trees having diameters bounded by 10. We also show that, when the number of distinct stars is bounded by a constant k, CTS...

  7. Shade Trees Spatial Distribution and Its Effect on Grains and Beverage Quality of Shaded Coffee Trees

    Directory of Open Access Journals (Sweden)

    Francisco José da Silva Neto

    2018-01-01

    Full Text Available Shading coffee trees has gained importance, especially among smallholders, as an option to improve the products’ quality, therefore acquiring place at the specialty coffee market, where consumers are willing to give bonus for quality. This work aims to evaluate the influence of shade trees’ spatial distribution among coffee trees’ agronomic characteristics, yield, and beans and cup quality of shaded coffee trees. The experimental design consisted of completely randomized blocks with six repetitions and four treatments: coffee trees on shade trees planting rows, distant one meter from the trunk; coffee trees on shade trees planting row, distant six meters from the trunk; and coffee plants between the rows of shade trees, parallel to the previous treatments. The parameters analyzed were plant height, canopy diameter, plagiotropic branches’ length, yield, coffee fruits’ phenological stage, ripe cherries’ Brix degree, percentage of black, unripe, and insect damaged beans, bean size, and beverage quality. Shade trees quickened coffee fruits’ phenological stage of coffee trees nearest to them. This point also showed the best beverage quality, except for overripe fruits. The remaining parameters evaluated were not affected by shade trees’ spatial distribution.

  8. Trees and highway safety.

    Science.gov (United States)

    2011-03-01

    To minimize the severity of run-off-road collisions of vehicles with trees, departments of transportation (DOTs) : commonly establish clear zones for trees and other fixed objects. Caltrans clear zone on freeways is 30 feet : minimum (40 feet pref...

  9. Decision-Tree Program

    Science.gov (United States)

    Buntine, Wray

    1994-01-01

    IND computer program introduces Bayesian and Markov/maximum-likelihood (MML) methods and more-sophisticated methods of searching in growing trees. Produces more-accurate class-probability estimates important in applications like diagnosis. Provides range of features and styles with convenience for casual user, fine-tuning for advanced user or for those interested in research. Consists of four basic kinds of routines: data-manipulation, tree-generation, tree-testing, and tree-display. Written in C language.

  10. Minnesota's Forest Trees. Revised.

    Science.gov (United States)

    Miles, William R.; Fuller, Bruce L.

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

  11. D2-tree

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Sioutas, Spyros; Pantazos, Kostas

    2015-01-01

    We present a new overlay, called the Deterministic Decentralized tree (D2-tree). The D2-tree compares favorably to other overlays for the following reasons: (a) it provides matching and better complexities, which are deterministic for the supported operations; (b) the management of nodes (peers...

  12. Covering tree with stars

    DEFF Research Database (Denmark)

    Baumbach, Jan; Guo, Jian-Ying; Ibragimov, Rashid

    2013-01-01

    We study the tree edit distance problem with edge deletions and edge insertions as edit operations. We reformulate a special case of this problem as Covering Tree with Stars (CTS): given a tree T and a set of stars, can we connect the stars in by adding edges between them such that the resulting ...

  13. Winter Birch Trees

    Science.gov (United States)

    Sweeney, Debra; Rounds, Judy

    2011-01-01

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

  14. Total well dominated trees

    DEFF Research Database (Denmark)

    Finbow, Arthur; Frendrup, Allan; Vestergaard, Preben D.

    cardinality then G is a total well dominated graph. In this paper we study composition and decomposition of total well dominated trees. By a reversible process we prove that any total well dominated tree can both be reduced to and constructed from a family of three small trees....

  15. TreePics: visualizing trees with pictures

    Directory of Open Access Journals (Sweden)

    Nicolas Puillandre

    2017-09-01

    Full Text Available While many programs are available to edit phylogenetic trees, associating pictures with branch tips in an efficient and automatic way is not an available option. Here, we present TreePics, a standalone software that uses a web browser to visualize phylogenetic trees in Newick format and that associates pictures (typically, pictures of the voucher specimens to the tip of each branch. Pictures are visualized as thumbnails and can be enlarged by a mouse rollover. Further, several pictures can be selected and displayed in a separate window for visual comparison. TreePics works either online or in a full standalone version, where it can display trees with several thousands of pictures (depending on the memory available. We argue that TreePics can be particularly useful in a preliminary stage of research, such as to quickly detect conflicts between a DNA-based phylogenetic tree and morphological variation, that may be due to contamination that needs to be removed prior to final analyses, or the presence of species complexes.

  16. Use of DNA markers in forest tree improvement research

    Science.gov (United States)

    D.B. Neale; M.E. Devey; K.D. Jermstad; M.R. Ahuja; M.C. Alosi; K.A. Marshall

    1992-01-01

    DNA markers are rapidly being developed for forest trees. The most important markers are restriction fragment length polymorphisms (RFLPs), polymerase chain reaction- (PCR) based markers such as random amplified polymorphic DNA (RAPD), and fingerprinting markers. DNA markers can supplement isozyme markers for monitoring tree improvement activities such as; estimating...

  17. [Effects of crop tree release on stand growth and stand structure of Cunninghamia lanceolata plantation].

    Science.gov (United States)

    Wu, Jian-qiang; Wang, Yi-xiang; Yang, Yi; Zhu, Ting-ting; Zhu, Xu-dan

    2015-02-01

    Crop trees were selected in a 26-year-old even-aged Cunninghamia lanceolata plantation in Lin' an, and compared in plots that were released and unreleased to examine growth and structure responses for 3 years after thinning. Crop tree release significantly increased the mean increments of diameter and volume of individual tree by 1.30 and 1.25 times relative to trees in control stands, respectively. The increments of diameter and volume of crop trees were significantly higher than those of general trees in thinning plots, crop trees and general trees in control plots, which suggested that the responses from different tree types to crop tree release treatment were different. Crop tree release increased the average distances of crop trees to the nearest neighboring trees, reducing competition among crop trees by about 68.2%. 3-year stand volume increment for thinning stands had no significant difference with that of control stands although the number of trees was only 81.5% of the control. Crop trees in thinned plots with diameters over than 14 cm reached 18.0% over 3 years, compared with 12.0% for trees without thinning, suggesting that crop tree release benefited the larger individual trees. The pattern of tree locations in thinning plots tended to be random, complying with the rule that tree distribution pattern changes with growth. Crop tree release in C. lanceolata plantation not only promoted the stand growth, but also optimized the stand structure, benefiting crop trees sustained rapid growth and larger diameter trees production.

  18. FB-Tree: A B+-Tree for Flash-Based SSDs

    DEFF Research Database (Denmark)

    Jørgensen, Martin V.; Rasmussen, René B.; Saltenis, Simonas

    2011-01-01

    Due to their many advantages, flash-based SSDs (Solid-State Drives) have become a mainstream alternative to magnetic disks for database servers. Nevertheless, database systems, designed and optimized for magnetic disks, still do not fully exploit all the benefits of the new technology. We propose....... As a consequence, the FB-tree outperforms a regular B+-tree in all scenarios tested. For instance, the throughput of a random workload of 75% updates increases by a factor of three using only two times the space of the B+-tree....

  19. A Survey of Wood Protection Chemicals, Tree Killers and Sprayers ...

    African Journals Online (AJOL)

    chemicals used in wood protection (preservation) within Makurdi metropolis. A purposive, non-random sampling was undertaken in Makurdi metropolis to identify wood protection chemicals/tree-killers available in agrochemical stores, ...

  20. Spectra of chemical trees

    International Nuclear Information System (INIS)

    Balasubramanian, K.

    1982-01-01

    A method is developed for obtaining the spectra of trees of NMR and chemical interests. The characteristic polynomials of branched trees can be obtained in terms of the characteristic polynomials of unbranched trees and branches by pruning the tree at the joints. The unbranched trees can also be broken down further until a tree containing just two vertices is obtained. The effectively reduces the order of the secular determinant of the tree used at the beginning to determinants of orders atmost equal to the number of vertices in the branch containing the largest number of vertices. An illustrative example of a NMR graph is given for which the 22 x 22 secular determinant is reduced to determinants of orders atmost 4 x 4 in just the second step of the algorithm. The tree pruning algorithm can be applied even to trees with no symmetry elements and such a factoring can be achieved. Methods developed here can be elegantly used to find if two trees are cospectral and to construct cospectral trees

  1. Refining discordant gene trees.

    Science.gov (United States)

    Górecki, Pawel; Eulenstein, Oliver

    2014-01-01

    Evolutionary studies are complicated by discordance between gene trees and the species tree in which they evolved. Dealing with discordant trees often relies on comparison costs between gene and species trees, including the well-established Robinson-Foulds, gene duplication, and deep coalescence costs. While these costs have provided credible results for binary rooted gene trees, corresponding cost definitions for non-binary unrooted gene trees, which are frequently occurring in practice, are challenged by biological realism. We propose a natural extension of the well-established costs for comparing unrooted and non-binary gene trees with rooted binary species trees using a binary refinement model. For the duplication cost we describe an efficient algorithm that is based on a linear time reduction and also computes an optimal rooted binary refinement of the given gene tree. Finally, we show that similar reductions lead to solutions for computing the deep coalescence and the Robinson-Foulds costs. Our binary refinement of Robinson-Foulds, gene duplication, and deep coalescence costs for unrooted and non-binary gene trees together with the linear time reductions provided here for computing these costs significantly extends the range of trees that can be incorporated into approaches dealing with discordance.

  2. Nutrient removal by apple, pear and cherry nursery trees

    OpenAIRE

    Giovambattista Sorrenti; Maurizio Quartieri; Silvia Salvi; Moreno Toselli

    2017-01-01

    Given that nursery is a peculiar environment, the amount of nutrients removed by nursery trees represents a fundamental acquisition to optimise fertilisation strategies, with economic and environmental implications. In this context, we determined nutrient removal by apple, pear and cherry nursery trees at the end of the nursery growing cycle. We randomly removed 5 leafless apple (Golden Delicious/EMLA M9; density of 30,000 trees ha–1), pear (Santa Maria/Adams; density of 30,000 trees ha–1) an...

  3. The valuative tree

    CERN Document Server

    Favre, Charles

    2004-01-01

    This volume is devoted to a beautiful object, called the valuative tree and designed as a powerful tool for the study of singularities in two complex dimensions. Its intricate yet manageable structure can be analyzed by both algebraic and geometric means. Many types of singularities, including those of curves, ideals, and plurisubharmonic functions, can be encoded in terms of positive measures on the valuative tree. The construction of these measures uses a natural tree Laplace operator of independent interest.

  4. Coded Splitting Tree Protocols

    DEFF Research Database (Denmark)

    Sørensen, Jesper Hemming; Stefanovic, Cedomir; Popovski, Petar

    2013-01-01

    This paper presents a novel approach to multiple access control called coded splitting tree protocol. The approach builds on the known tree splitting protocols, code structure and successive interference cancellation (SIC). Several instances of the tree splitting protocol are initiated, each...... instance is terminated prematurely and subsequently iterated. The combined set of leaves from all the tree instances can then be viewed as a graph code, which is decodable using belief propagation. The main design problem is determining the order of splitting, which enables successful decoding as early...

  5. Morocco - Fruit Tree Productivity

    Data.gov (United States)

    Millennium Challenge Corporation — Date Tree Irrigation Project: The specific objectives of this evaluation are threefold: - Performance evaluation of project activities, like the mid-term evaluation,...

  6. SLE as a Mating of Trees in Euclidean Geometry

    Science.gov (United States)

    Holden, Nina; Sun, Xin

    2018-05-01

    The mating of trees approach to Schramm-Loewner evolution (SLE) in the random geometry of Liouville quantum gravity (LQG) has been recently developed by Duplantier et al. (Liouville quantum gravity as a mating of trees, 2014. arXiv:1409.7055). In this paper we consider the mating of trees approach to SLE in Euclidean geometry. Let {η} be a whole-plane space-filling SLE with parameter {κ > 4} , parameterized by Lebesgue measure. The main observable in the mating of trees approach is the contour function, a two-dimensional continuous process describing the evolution of the Minkowski content of the left and right frontier of {η} . We prove regularity properties of the contour function and show that (as in the LQG case) it encodes all the information about the curve {η} . We also prove that the uniform spanning tree on {Z^2} converges to SLE8 in the natural topology associated with the mating of trees approach.

  7. Are trees long-lived?

    Science.gov (United States)

    Kevin T. Smith

    2009-01-01

    Trees and tree care can capture the best of people's motivations and intentions. Trees are living memorials that help communities heal at sites of national tragedy, such as Oklahoma City and the World Trade Center. We mark the places of important historical events by the trees that grew nearby even if the original tree, such as the Charter Oak in Connecticut or...

  8. The tree BVOC index

    Science.gov (United States)

    J.R. Simpson; E.G. McPherson

    2011-01-01

    Urban trees can produce a number of benefits, among them improved air quality. Biogenic volatile organic compounds (BVOCs) emitted by some species are ozone precursors. Modifying future tree planting to favor lower-emitting species can reduce these emissions and aid air management districts in meeting federally mandated emissions reductions for these compounds. Changes...

  9. Tree growth visualization

    Science.gov (United States)

    L. Linsen; B.J. Karis; E.G. McPherson; B. Hamann

    2005-01-01

    In computer graphics, models describing the fractal branching structure of trees typically exploit the modularity of tree structures. The models are based on local production rules, which are applied iteratively and simultaneously to create a complex branching system. The objective is to generate three-dimensional scenes of often many realistic- looking and non-...

  10. Flowering T Flowering Trees

    Indian Academy of Sciences (India)

    Adansonia digitata L. ( The Baobab Tree) of Bombacaceae is a tree with swollen trunk that attains a dia. of 10m. Leaves are digitately compound with leaflets up to 18cm. long. Flowers are large, solitary, waxy white, and open at dusk. They open in 30 seconds and are bat pollinated. Stamens are many. Fruit is about 30 cm ...

  11. Fault tree graphics

    International Nuclear Information System (INIS)

    Bass, L.; Wynholds, H.W.; Porterfield, W.R.

    1975-01-01

    Described is an operational system that enables the user, through an intelligent graphics terminal, to construct, modify, analyze, and store fault trees. With this system, complex engineering designs can be analyzed. This paper discusses the system and its capabilities. Included is a brief discussion of fault tree analysis, which represents an aspect of reliability and safety modeling

  12. Tree biology and dendrochemistry

    Science.gov (United States)

    Kevin T. Smith; Walter C. Shortle

    1996-01-01

    Dendrochemistry, the interpretation of elemental analysis of dated tree rings, can provide a temporal record of environmental change. Using the dendrochemical record requires an understanding of tree biology. In this review, we pose four questions concerning assumptions that underlie recent dendrochemical research: 1) Does the chemical composition of the wood directly...

  13. Individual tree control

    Science.gov (United States)

    Harvey A. Holt

    1989-01-01

    Controlling individual unwanted trees in forest stands is a readily accepted method for improving the value of future harvests. The practice is especially important in mixed hardwood forests where species differ considerably in value and within species individual trees differ in quality. Individual stem control is a mechanical or chemical weeding operation that...

  14. Trees and Climate Change

    OpenAIRE

    Dettenmaier, Megan; Kuhns, Michael; Unger, Bethany; McAvoy, Darren

    2017-01-01

    This fact sheet describes the complex relationship between forests and climate change based on current research. It explains ways that trees can mitigate some of the risks associated with climate change. It details the impacts that forests are having on the changing climate and discuss specific ways that trees can be used to reduce or counter carbon emissions directly and indirectly.

  15. Structural Equation Model Trees

    Science.gov (United States)

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

    2013-01-01

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

  16. Matching Subsequences in Trees

    DEFF Research Database (Denmark)

    Bille, Philip; Gørtz, Inge Li

    2009-01-01

    Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the root and ends at a leaf. In this paper we propose this problem as a useful query primitive for XML data, and provide new...

  17. Environmental tritium in trees

    International Nuclear Information System (INIS)

    Brown, R.M.

    1979-01-01

    The distribution of environmental tritium in the free water and organically bound hydrogen of trees growing in the vicinity of the Chalk River Nuclear Laboratories (CRNL) has been studied. The regional dispersal of HTO in the atmosphere has been observed by surveying the tritium content of leaf moisture. Measurement of the distribution of organically bound tritium in the wood of tree ring sequences has given information on past concentrations of HTO taken up by trees growing in the CRNL Liquid Waste Disposal Area. For samples at background environmental levels, cellulose separation and analysis was done. The pattern of bomb tritium in precipitation of 1955-68 was observed to be preserved in the organically bound tritium of a tree ring sequence. Reactor tritium was discernible in a tree growing at a distance of 10 km from CRNL. These techniques provide convenient means of monitoring dispersal of HTO from nuclear facilities. (author)

  18. Generalising tree traversals and tree transformations to DAGs

    DEFF Research Database (Denmark)

    Bahr, Patrick; Axelsson, Emil

    2017-01-01

    We present a recursion scheme based on attribute grammars that can be transparently applied to trees and acyclic graphs. Our recursion scheme allows the programmer to implement a tree traversal or a tree transformation and then apply it to compact graph representations of trees instead. The resul......We present a recursion scheme based on attribute grammars that can be transparently applied to trees and acyclic graphs. Our recursion scheme allows the programmer to implement a tree traversal or a tree transformation and then apply it to compact graph representations of trees instead...... as the complementing theory with a number of examples....

  19. How a dependent's variable non-randomness affects taper equation ...

    African Journals Online (AJOL)

    In order to apply the least squares method in regression analysis, the values of the dependent variable Y should be random. In an example of regression analysis linear and nonlinear taper equations, which estimate the diameter of the tree dhi at any height of the tree hi, were compared. For each tree the diameter at the ...

  20. Taxon ordering in phylogenetic trees by means of evolutionary algorithms

    Directory of Open Access Journals (Sweden)

    Cerutti Francesco

    2011-07-01

    Full Text Available Abstract Background In in a typical "left-to-right" phylogenetic tree, the vertical order of taxa is meaningless, as only the branch path between them reflects their degree of similarity. To make unresolved trees more informative, here we propose an innovative Evolutionary Algorithm (EA method to search the best graphical representation of unresolved trees, in order to give a biological meaning to the vertical order of taxa. Methods Starting from a West Nile virus phylogenetic tree, in a (1 + 1-EA we evolved it by randomly rotating the internal nodes and selecting the tree with better fitness every generation. The fitness is a sum of genetic distances between the considered taxon and the r (radius next taxa. After having set the radius to the best performance, we evolved the trees with (λ + μ-EAs to study the influence of population on the algorithm. Results The (1 + 1-EA consistently outperformed a random search, and better results were obtained setting the radius to 8. The (λ + μ-EAs performed as well as the (1 + 1, except the larger population (1000 + 1000. Conclusions The trees after the evolution showed an improvement both of the fitness (based on a genetic distance matrix, then close taxa are actually genetically close, and of the biological interpretation. Samples collected in the same state or year moved close each other, making the tree easier to interpret. Biological relationships between samples are also easier to observe.

  1. A recursive algorithm for trees and forests

    OpenAIRE

    Guo, Song; Guo, Victor J. W.

    2017-01-01

    Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on $\\{1,2,\\ldots,n\\}$. Classical formulas for counting various trees such as rooted trees, bipartite trees, tripartite trees, plane trees, $k$-ary plane trees, $k$-edge colored trees follow immediately from our recursive relations.

  2. Phylogenetic trees in bioinformatics

    Energy Technology Data Exchange (ETDEWEB)

    Burr, Tom L [Los Alamos National Laboratory

    2008-01-01

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

  3. Skewed Binary Search Trees

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Moruz, Gabriel

    2006-01-01

    It is well-known that to minimize the number of comparisons a binary search tree should be perfectly balanced. Previous work has shown that a dominating factor over the running time for a search is the number of cache faults performed, and that an appropriate memory layout of a binary search tree...... can reduce the number of cache faults by several hundred percent. Motivated by the fact that during a search branching to the left or right at a node does not necessarily have the same cost, e.g. because of branch prediction schemes, we in this paper study the class of skewed binary search trees....... For all nodes in a skewed binary search tree the ratio between the size of the left subtree and the size of the tree is a fixed constant (a ratio of 1/2 gives perfect balanced trees). In this paper we present an experimental study of various memory layouts of static skewed binary search trees, where each...

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

    Science.gov (United States)

    Goloboff, Pablo A

    2014-10-01

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

  5. The gravity apple tree

    International Nuclear Information System (INIS)

    Aldama, Mariana Espinosa

    2015-01-01

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

  6. Visualizing phylogenetic tree landscapes.

    Science.gov (United States)

    Wilgenbusch, James C; Huang, Wen; Gallivan, Kyle A

    2017-02-02

    Genomic-scale sequence alignments are increasingly used to infer phylogenies in order to better understand the processes and patterns of evolution. Different partitions within these new alignments (e.g., genes, codon positions, and structural features) often favor hundreds if not thousands of competing phylogenies. Summarizing and comparing phylogenies obtained from multi-source data sets using current consensus tree methods discards valuable information and can disguise potential methodological problems. Discovery of efficient and accurate dimensionality reduction methods used to display at once in 2- or 3- dimensions the relationship among these competing phylogenies will help practitioners diagnose the limits of current evolutionary models and potential problems with phylogenetic reconstruction methods when analyzing large multi-source data sets. We introduce several dimensionality reduction methods to visualize in 2- and 3-dimensions the relationship among competing phylogenies obtained from gene partitions found in three mid- to large-size mitochondrial genome alignments. We test the performance of these dimensionality reduction methods by applying several goodness-of-fit measures. The intrinsic dimensionality of each data set is also estimated to determine whether projections in 2- and 3-dimensions can be expected to reveal meaningful relationships among trees from different data partitions. Several new approaches to aid in the comparison of different phylogenetic landscapes are presented. Curvilinear Components Analysis (CCA) and a stochastic gradient decent (SGD) optimization method give the best representation of the original tree-to-tree distance matrix for each of the three- mitochondrial genome alignments and greatly outperformed the method currently used to visualize tree landscapes. The CCA + SGD method converged at least as fast as previously applied methods for visualizing tree landscapes. We demonstrate for all three mtDNA alignments that 3D

  7. Minimal spanning trees, filaments and galaxy clustering

    International Nuclear Information System (INIS)

    Barrow, J.D.; Sonoda, D.H.

    1985-01-01

    A graph theoretical technique for assessing intrinsic patterns in point data sets is described. A unique construction, the minimal spanning tree, can be associated with any point data set given all the inter-point separations. This construction enables the skeletal pattern of galaxy clustering to be singled out in quantitative fashion and differs from other statistics applied to these data sets. This technique is described and applied to two- and three-dimensional distributions of galaxies and also to comparable random samples and numerical simulations. The observed CfA and Zwicky data exhibit characteristic distributions of edge-lengths in their minimal spanning trees which are distinct from those found in random samples. (author)

  8. Inferring epidemic contact structure from phylogenetic trees.

    Directory of Open Access Journals (Sweden)

    Gabriel E Leventhal

    Full Text Available Contact structure is believed to have a large impact on epidemic spreading and consequently using networks to model such contact structure continues to gain interest in epidemiology. However, detailed knowledge of the exact contact structure underlying real epidemics is limited. Here we address the question whether the structure of the contact network leaves a detectable genetic fingerprint in the pathogen population. To this end we compare phylogenies generated by disease outbreaks in simulated populations with different types of contact networks. We find that the shape of these phylogenies strongly depends on contact structure. In particular, measures of tree imbalance allow us to quantify to what extent the contact structure underlying an epidemic deviates from a null model contact network and illustrate this in the case of random mixing. Using a phylogeny from the Swiss HIV epidemic, we show that this epidemic has a significantly more unbalanced tree than would be expected from random mixing.

  9. Tree-growth analyses to estimate tree species' drought tolerance

    NARCIS (Netherlands)

    Eilmann, B.; Rigling, A.

    2012-01-01

    Climate change is challenging forestry management and practices. Among other things, tree species with the ability to cope with more extreme climate conditions have to be identified. However, while environmental factors may severely limit tree growth or even cause tree death, assessing a tree

  10. Big trees, old trees, and growth factor tables

    Science.gov (United States)

    Kevin T. Smith

    2018-01-01

    The potential for a tree to reach a great size and to live a long life frequently captures the public's imagination. Sometimes the desire to know the age of an impressively large tree is simple curiosity. For others, the date-of-tree establishment can make a big diff erence for management, particularly for trees at historic sites or those mentioned in property...

  11. A bijection between phylogenetic trees and plane oriented recursive trees

    OpenAIRE

    Prodinger, Helmut

    2017-01-01

    Phylogenetic trees are binary nonplanar trees with labelled leaves, and plane oriented recursive trees are planar trees with an increasing labelling. Both families are enumerated by double factorials. A bijection is constructed, using the respective representations a 2-partitions and trapezoidal words.

  12. A Suffix Tree Or Not a Suffix Tree?

    DEFF Research Database (Denmark)

    Starikovskaya, Tatiana; Vildhøj, Hjalte Wedel

    2015-01-01

    In this paper we study the structure of suffix trees. Given an unlabeled tree r on n nodes and suffix links of its internal nodes, we ask the question “Is r a suffix tree?”, i.e., is there a string S whose suffix tree has the same topological structure as r? We place no restrictions on S, in part...

  13. Investigation of Growth and Survival of Transplanted Plane and Pine Trees According to IBA Application, Tree Age, Transplanting Time and Method

    Directory of Open Access Journals (Sweden)

    N. Etemadi

    2015-03-01

    Full Text Available The major problems in transplanting the landscape trees are high level of mortality and low establishment rate of transplanted trees, especially in the first year. In order to achieve the best condition for successful transplanting of pine and plane trees in Isfahan landscape, the present study was carried out based on a completely randomized block design with four replicates and three treatments including transplanting method (balled and burlapped and bare root, tree age (immature and mature and IBA application (0 and 150 mg/L. Trees were transplanted during 2009 and 2010 in three times (dormant season, early and late growing season. Survival rate and Relative Growth Rate index based on tree height (RGRH and trunk diameter (RGRD were measured during the first and second years. Trees transplanted early in the growing season showed the most survival percentage during the two years, as compared to other transplanting dates. Survival of Balled and burlapped and immature transplanted trees was significantly greater than bare root or mature trees. The significant effect of age treatment was continued in the second year. IBA treatment had no effect on survival rate of the studied species. Balled and burlapped and immature transplanted pine trees also had higher RGRH and RGRD compared to bare root or mature trees. According to the results of this study, early growing season is the best time for transplanting pine and plane trees. Also, transplanting of immature trees using balled and burlapped method is recommended to increase the survival and establishment rate.

  14. NLCD 2001 - Tree Canopy

    Data.gov (United States)

    Minnesota Department of Natural Resources — The National Land Cover Database 2001 tree canopy layer for Minnesota (mapping zones 39-42, 50-51) was produced through a cooperative project conducted by the...

  15. Trees for future forests

    DEFF Research Database (Denmark)

    Lobo, Albin

    Climate change creates new challenges in forest management. The increase in temperature may in the long run be beneficial for the forests in the northern latitudes, but the high rate at which climate change is predicted to proceed will make adaptation difficult because trees are long living sessile...... organisms. The aim of the present thesis is therefore to explore genetic resilience and phenotypic plasticity mechanisms that allows trees to adapt and evolve with changing climates. The thesis focus on the abiotic factors associated with climate change, especially raised temperatures and lack...... age of these tree species and the uncertainty around the pace and effect of climate, it remains an open question if the native populations can respond fast enough. Phenotypic plasticity through epigenetic regulation of spring phenology is found to be present in a tree species which might act...

  16. Value tree analysis

    International Nuclear Information System (INIS)

    Keeney, R.; Renn, O.; Winterfeldt, D. von; Kotte, U.

    1985-01-01

    What are the targets and criteria on which national energy policy should be based. What priorities should be set, and how can different social interests be matched. To answer these questions, a new instrument of decision theory is presented which has been applied with good results to controversial political issues in the USA. The new technique is known under the name of value tree analysis. Members of important West German organisations (BDI, VDI, RWE, the Catholic and Protestant Church, Deutscher Naturschutzring, and ecological research institutions) were asked about the goals of their organisations. These goals were then ordered systematically and arranged in a hierarchical tree structure. The value trees of different groups can be combined into a catalogue of social criteria of acceptability and policy assessment. The authors describe the philosophy and methodology of value tree analysis and give an outline of its application in the development of a socially acceptable energy policy. (orig.) [de

  17. Multiscale singularity trees

    DEFF Research Database (Denmark)

    Somchaipeng, Kerawit; Sporring, Jon; Johansen, Peter

    2007-01-01

    We propose MultiScale Singularity Trees (MSSTs) as a structure to represent images, and we propose an algorithm for image comparison based on comparing MSSTs. The algorithm is tested on 3 public image databases and compared to 2 state-of-theart methods. We conclude that the computational complexity...... of our algorithm only allows for the comparison of small trees, and that the results of our method are comparable with state-of-the-art using much fewer parameters for image representation....

  18. Type extension trees

    DEFF Research Database (Denmark)

    Jaeger, Manfred

    2006-01-01

    We introduce type extension trees as a formal representation language for complex combinatorial features of relational data. Based on a very simple syntax this language provides a unified framework for expressing features as diverse as embedded subgraphs on the one hand, and marginal counts...... of attribute values on the other. We show by various examples how many existing relational data mining techniques can be expressed as the problem of constructing a type extension tree and a discriminant function....

  19. Tree felling 2014

    CERN Multimedia

    2014-01-01

    With a view to creating new landscapes and making its population of trees safer and healthier, this winter CERN will complete the tree-felling campaign started in 2010.   Tree felling will take place between 15 and 22 November on the Swiss part of the Meyrin site. This work is being carried out above all for safety reasons. The trees to be cut down are at risk of falling as they are too old and too tall to withstand the wind. In addition, the roots of poplar trees are very powerful and spread widely, potentially damaging underground networks, pavements and roadways. Compensatory tree planting campaigns will take place in the future, subject to the availability of funding, with the aim of creating coherent landscapes while also respecting the functional constraints of the site. These matters are being considered in close collaboration with the Geneva nature and countryside directorate (Direction générale de la nature et du paysage, DGNP). GS-SE Group

  20. Benefit-based tree valuation

    Science.gov (United States)

    E.G. McPherson

    2007-01-01

    Benefit-based tree valuation provides alternative estimates of the fair and reasonable value of trees while illustrating the relative contribution of different benefit types. This study compared estimates of tree value obtained using cost- and benefit-based approaches. The cost-based approach used the Council of Landscape and Tree Appraisers trunk formula method, and...

  1. Attack Trees with Sequential Conjunction

    NARCIS (Netherlands)

    Jhawar, Ravi; Kordy, Barbara; Mauw, Sjouke; Radomirović, Sasa; Trujillo-Rasua, Rolando

    2015-01-01

    We provide the first formal foundation of SAND attack trees which are a popular extension of the well-known attack trees. The SAND at- tack tree formalism increases the expressivity of attack trees by intro- ducing the sequential conjunctive operator SAND. This operator enables the modeling of

  2. Economic Valuation of Urban Trees: Ribnjak Park Case Study, Zagreb

    Directory of Open Access Journals (Sweden)

    Karlo Beljan

    2015-06-01

    Full Text Available Background and Purpose: Population growth, urbanisation and technological development are creating a growing need for urban forests and parks, which are becoming green oases for recreation and relaxation. Apart from the sociological and economic components, urban forest valuation is presented through tourism, the market value of main and secondary forest products, and the growing value of real estate in the vicinity of green areas. Environmental economics explores the optimal ratio between the costs and the benefits received from the investment in the environment. The aim of this research is monetary valuation of urban trees. Materials and Methods: A Danish model for tree value determination was applied in Ribnjak Park as a case study. The model is based on tree growing costs and the present value. It is limited by the subjective aesthetic tree value estimation, but it is used in Europe because of its practicality. Individual tree value estimation is used because of the tree damage from vehicles or new residential buildings. The method is suitable for individual trees or groups of trees, but it is not appropriate for forest stands. Twenty random selected trees from nine different tree species have been analysed in the park. Diameter at breast height, tree height, expected age, aesthetic value and location were recorded for each tree. Furthermore, ecological, social and health tree values were taken into account separately with the calculation of points. Results: According to the evaluation, the average monetary value of one tree in Ribnjak Park is 542 EUR. The average diameter at breast height is 57.86 cm with the average age of 96.14 years. Plane trees have the highest value in comparison to other sampled species. Conclusions: Tree values vary depending on age, dimension or aesthetic values. The disadvantage of this method is in the estimation of very old tree value and in high involvement of personal estimation, which creates an opportunity

  3. Dissecting the circle, at random*

    Directory of Open Access Journals (Sweden)

    Curien Nicolas

    2014-01-01

    Full Text Available Random laminations of the disk are the continuous limits of random non-crossing configurations of regular polygons. We provide an expository account on this subject. Initiated by the work of Aldous on the Brownian triangulation, this field now possesses many characters such as the random recursive triangulation, the stable laminations and the Markovian hyperbolic triangulation of the disk. We will review the properties and constructions of these objects as well as the close relationships they enjoy with the theory of continuous random trees. Some open questions are scattered along the text.

  4. Steiner trees in industry

    CERN Document Server

    Du, Ding-Zhu

    2001-01-01

    This book is a collection of articles studying various Steiner tree prob­ lems with applications in industries, such as the design of electronic cir­ cuits, computer networking, telecommunication, and perfect phylogeny. The Steiner tree problem was initiated in the Euclidean plane. Given a set of points in the Euclidean plane, the shortest network interconnect­ ing the points in the set is called the Steiner minimum tree. The Steiner minimum tree may contain some vertices which are not the given points. Those vertices are called Steiner points while the given points are called terminals. The shortest network for three terminals was first studied by Fermat (1601-1665). Fermat proposed the problem of finding a point to minimize the total distance from it to three terminals in the Euclidean plane. The direct generalization is to find a point to minimize the total distance from it to n terminals, which is still called the Fermat problem today. The Steiner minimum tree problem is an indirect generalization. Sch...

  5. Visualization of Uncertain Contour Trees

    DEFF Research Database (Denmark)

    Kraus, Martin

    2010-01-01

    Contour trees can represent the topology of large volume data sets in a relatively compact, discrete data structure. However, the resulting trees often contain many thousands of nodes; thus, many graph drawing techniques fail to produce satisfactory results. Therefore, several visualization methods...... were proposed recently for the visualization of contour trees. Unfortunately, none of these techniques is able to handle uncertain contour trees although any uncertainty of the volume data inevitably results in partially uncertain contour trees. In this work, we visualize uncertain contour trees...... by combining the contour trees of two morphologically filtered versions of a volume data set, which represent the range of uncertainty. These two contour trees are combined and visualized within a single image such that a range of potential contour trees is represented by the resulting visualization. Thus...

  6. ColorTree: a batch customization tool for phylogenic trees.

    Science.gov (United States)

    Chen, Wei-Hua; Lercher, Martin J

    2009-07-31

    Genome sequencing projects and comparative genomics studies typically aim to trace the evolutionary history of large gene sets, often requiring human inspection of hundreds of phylogenetic trees. If trees are checked for compatibility with an explicit null hypothesis (e.g., the monophyly of certain groups), this daunting task is greatly facilitated by an appropriate coloring scheme. In this note, we introduce ColorTree, a simple yet powerful batch customization tool for phylogenic trees. Based on pattern matching rules, ColorTree applies a set of customizations to an input tree file, e.g., coloring labels or branches. The customized trees are saved to an output file, which can then be viewed and further edited by Dendroscope (a freely available tree viewer). ColorTree runs on any Perl installation as a stand-alone command line tool, and its application can thus be easily automated. This way, hundreds of phylogenic trees can be customized for easy visual inspection in a matter of minutes. ColorTree allows efficient and flexible visual customization of large tree sets through the application of a user-supplied configuration file to multiple tree files.

  7. A parallel buffer tree

    DEFF Research Database (Denmark)

    Sitchinava, Nodar; Zeh, Norbert

    2012-01-01

    We present the parallel buffer tree, a parallel external memory (PEM) data structure for batched search problems. This data structure is a non-trivial extension of Arge's sequential buffer tree to a private-cache multiprocessor environment and reduces the number of I/O operations by the number of...... in the optimal OhOf(psortN + K/PB) parallel I/O complexity, where K is the size of the output reported in the process and psortN is the parallel I/O complexity of sorting N elements using P processors....

  8. Randomization tests

    CERN Document Server

    Edgington, Eugene

    2007-01-01

    Statistical Tests That Do Not Require Random Sampling Randomization Tests Numerical Examples Randomization Tests and Nonrandom Samples The Prevalence of Nonrandom Samples in Experiments The Irrelevance of Random Samples for the Typical Experiment Generalizing from Nonrandom Samples Intelligibility Respect for the Validity of Randomization Tests Versatility Practicality Precursors of Randomization Tests Other Applications of Permutation Tests Questions and Exercises Notes References Randomized Experiments Unique Benefits of Experiments Experimentation without Mani

  9. Embedding complete ternary tree in hypercubes using AVL trees

    NARCIS (Netherlands)

    S.A. Choudum; I. Raman (Indhumathi)

    2008-01-01

    htmlabstractA complete ternary tree is a tree in which every non-leaf vertex has exactly three children. We prove that a complete ternary tree of height h, TTh, is embeddable in a hypercube of dimension . This result coincides with the result of [2]. However, in this paper, the embedding utilizes

  10. Portraits of Tree Families

    NARCIS (Netherlands)

    Balgooy, van M.M.J.

    1998-01-01

    With the publication of the second volume of the series ‘Malesian Seed Plants’, entitled ‘Portraits of Tree Families’, I would like to refer to the Introduction of the first volume, ‘Spot-characters’ for a historical background and an explanation of the aims of this series. The present book treats

  11. P{owering 'Trees

    Indian Academy of Sciences (India)

    Melia dubia Cav. of Meliaceae is a large deciduous tree. Leaves are compound with toothed leaflets. Flowers are small, greenish-yellow in much-branched inflorescences. Fruits are green, ellipsoidal with a single seed covered by hard portion ( as in a mango fruit) and surrounded by fleshy pulp outside. The bark is bitter ...

  12. Programming macro tree transducers

    DEFF Research Database (Denmark)

    Bahr, Patrick; Day, Laurence E.

    2013-01-01

    transducers can be concisely represented in Haskell, and demonstrate the benefits of utilising such an approach with a number of examples. In particular, tree transducers afford a modular programming style as they can be easily composed and manipulated. Our Haskell representation generalises the original...

  13. Chapter 5 - Tree Mortality

    Science.gov (United States)

    Mark J. Ambrose

    2014-01-01

    Tree mortality is a natural process in all forest ecosystems. Extremely high mortality, however, can also be an indicator of forest health issues. On a regional scale, high mortality levels may indicate widespread insect or disease problems. High mortality may also occur if a large proportion of the forest in a particular region is made up of older, senescent stands....

  14. A Universal Phylogenetic Tree.

    Science.gov (United States)

    Offner, Susan

    2001-01-01

    Presents a universal phylogenetic tree suitable for use in high school and college-level biology classrooms. Illustrates the antiquity of life and that all life is related, even if it dates back 3.5 billion years. Reflects important evolutionary relationships and provides an exciting way to learn about the history of life. (SAH)

  15. Base tree property

    Czech Academy of Sciences Publication Activity Database

    Balcar, B.; Doucha, Michal; Hrušák, M.

    2015-01-01

    Roč. 32, č. 1 (2015), s. 69-81 ISSN 0167-8094 R&D Projects: GA AV ČR IAA100190902 Institutional support: RVO:67985840 Keywords : forcing * Boolean algebras * base tree Subject RIV: BA - General Mathematics Impact factor: 0.614, year: 2015 http://link.springer.com/article/10.1007/s11083-013-9316-2

  16. Multiquarks and Steiner trees

    International Nuclear Information System (INIS)

    Richard, Jean-Marc

    2010-01-01

    A brief review review is presented of models tentatively leading to stable multiquarks. A new attempt is presented, based on a Steiner-tree model of confinement, which is inspired by by QCD. It leads to more attraction than the empirical colour-additive model used in earlier multiquark calculations, and predict several multiquark states in configurations with different flavours.

  17. A deterministic model for the growth of non-conducting electrical tree structures

    International Nuclear Information System (INIS)

    Dodd, S J

    2003-01-01

    Electrical treeing is of interest to the electrical generation, transmission and distribution industries as it is one of the causes of insulation failure in electrical machines, switchgear and transformer bushings. In this paper a deterministic electrical tree growth model is described. The model is based on electrostatics and local electron avalanches to model partial discharge activity within the growing tree structure. Damage to the resin surrounding the tree structure is dependent on the local electrostatic energy dissipation by partial discharges within the tree structure and weighted by the magnitudes of the local electric fields in the resin surrounding the tree structure. The model is successful in simulating the formation of branched structures without the need of a random variable, a requirement of previous stochastic models. Instability in the spatial development of partial discharges within the tree structure takes the role of the stochastic element as used in previous models to produce branched tree structures. The simulated electrical trees conform to the experimentally observed behaviour; tree length versus time and electrical tree growth rate as a function of applied voltage for non-conducting electrical trees. The phase synchronous partial discharge activity and the spatial distribution of emitted light from the tree structure are also in agreement with experimental data for non-conducting trees as grown in a flexible epoxy resin and in polyethylene. The fact that similar tree growth behaviour is found using pure amorphous (epoxy resin) and semicrystalline (polyethylene) materials demonstrate that neither annealed or quenched noise, representing material inhomogeneity, is required for the formation of irregular branched structures (electrical trees). Instead, as shown in this paper, branched growth can occur due to the instability of individual discharges within the tree structure

  18. Infinite Random Graphs as Statistical Mechanical Models

    DEFF Research Database (Denmark)

    Durhuus, Bergfinnur Jøgvan; Napolitano, George Maria

    2011-01-01

    We discuss two examples of infinite random graphs obtained as limits of finite statistical mechanical systems: a model of two-dimensional dis-cretized quantum gravity defined in terms of causal triangulated surfaces, and the Ising model on generic random trees. For the former model we describe a ...

  19. Tree Transduction Tools for Cdec

    Directory of Open Access Journals (Sweden)

    Austin Matthews

    2014-09-01

    Full Text Available We describe a collection of open source tools for learning tree-to-string and tree-to-tree transducers and the extensions to the cdec decoder that enable translation with these. Our modular, easy-to-extend tools extract rules from trees or forests aligned to strings and trees subject to different structural constraints. A fast, multithreaded implementation of the Cohn and Blunsom (2009 model for extracting compact tree-to-string rules is also included. The implementation of the tree composition algorithm used by cdec is described, and translation quality and decoding time results are presented. Our experimental results add to the body of evidence suggesting that tree transducers are a compelling option for translation, particularly when decoding speed and translation model size are important.

  20. Selecting Landscape Plants: Shade Trees

    OpenAIRE

    Relf, Diane; Appleton, Bonnie Lee, 1948-2012; Close, David

    2015-01-01

    Because of the permanency of trees and their importance in the landscape, care must be taken to select the best species for each situation. This publication goes over how to choose landscape trees that are shade tolerant.

  1. Adjustable chain trees for proteins

    DEFF Research Database (Denmark)

    Winter, Pawel; Fonseca, Rasmus

    2012-01-01

    A chain tree is a data structure for changing protein conformations. It enables very fast detection of clashes and free energy potential calculations. A modified version of chain trees that adjust themselves to the changing conformations of folding proteins is introduced. This results in much...... tighter bounding volume hierarchies and therefore fewer intersection checks. Computational results indicate that the efficiency of the adjustable chain trees is significantly improved compared to the traditional chain trees....

  2. Introduction to fault tree analysis

    International Nuclear Information System (INIS)

    Barlow, R.E.; Lambert, H.E.

    1975-01-01

    An elementary, engineering oriented introduction to fault tree analysis is presented. The basic concepts, techniques and applications of fault tree analysis, FTA, are described. The two major steps of FTA are identified as (1) the construction of the fault tree and (2) its evaluation. The evaluation of the fault tree can be qualitative or quantitative depending upon the scope, extensiveness and use of the analysis. The advantages, limitations and usefulness of FTA are discussed

  3. Greedy heuristics for minimization of number of terminal nodes in decision trees

    KAUST Repository

    Hussain, Shahid

    2014-10-01

    This paper describes, in detail, several greedy heuristics for construction of decision trees. We study the number of terminal nodes of decision trees, which is closely related with the cardinality of the set of rules corresponding to the tree. We compare these heuristics empirically for two different types of datasets (datasets acquired from UCI ML Repository and randomly generated data) as well as compare with the optimal results obtained using dynamic programming method.

  4. Greedy heuristics for minimization of number of terminal nodes in decision trees

    KAUST Repository

    Hussain, Shahid

    2014-01-01

    This paper describes, in detail, several greedy heuristics for construction of decision trees. We study the number of terminal nodes of decision trees, which is closely related with the cardinality of the set of rules corresponding to the tree. We compare these heuristics empirically for two different types of datasets (datasets acquired from UCI ML Repository and randomly generated data) as well as compare with the optimal results obtained using dynamic programming method.

  5. The Re-Think Tree.

    Science.gov (United States)

    Gear, Jim

    1993-01-01

    The Re-Think Tree is a simple framework to help individuals assess and improve their behaviors related to environmental issues. The branches of the tree in order of priority are refuse, reduce, re-use, and recycle. Roots of the tree include such things as public opinion, education, and watchdog groups. (KS)

  6. The Hopi Fruit Tree Book.

    Science.gov (United States)

    Nyhuis, Jane

    Referring as often as possible to traditional Hopi practices and to materials readily available on the reservation, the illustrated booklet provides information on the care and maintenance of young fruit trees. An introduction to fruit trees explains the special characteristics of new trees, e.g., grafting, planting pits, and watering. The…

  7. Rectilinear Full Steiner Tree Generation

    DEFF Research Database (Denmark)

    Zachariasen, Martin

    1999-01-01

    The fastest exact algorithm (in practice) for the rectilinear Steiner tree problem in the plane uses a two-phase scheme: First, a small but sufficient set of full Steiner trees (FSTs) is generated and then a Steiner minimum tree is constructed from this set by using simple backtrack search, dynamic...

  8. Inferences from growing trees backwards

    Science.gov (United States)

    David W. Green; Kent A. McDonald

    1997-01-01

    The objective of this paper is to illustrate how longitudinal stress wave techniques can be useful in tracking the future quality of a growing tree. Monitoring the quality of selected trees in a plantation forest could provide early input to decisions on the effectiveness of management practices, or future utilization options, for trees in a plantation. There will...

  9. Genetic transformation of forest trees

    African Journals Online (AJOL)

    Admin

    In this review, the recent progress on genetic transformation of forest trees were discussed. Its described also, different applications of genetic engineering for improving forest trees or understanding the mechanisms governing genes expression in woody plants. Key words: Genetic transformation, transgenic forest trees, ...

  10. Socio-economic determinants of growing trees on farms in the middle hills of Nepal

    DEFF Research Database (Denmark)

    Oli, B.N.; Treue, Thorsten; Larsen, Helle Overgaard

    2015-01-01

    were found. The Shannon–Wiener index was 2.46 and Simpson’s Dominance index was 0.15. Trees on farmland contributed on average 43 % of households’ firewood and fodder consumption. Apparent determinants of tree growing were identified through OLS regression; they included size of land and livestock......On-farm tree growing is potentially important for livelihood strategies and forest conservation, and varies greatly according to local contexts. A detailed knowledge base is therefore needed, requiring, inter alia, the documentation of factors associated with growing trees on farms. The present...... study surveyed 304 randomly sampled households in ten community forestry user groups in Nepal, eliciting data on demographics, income and consumption of tree products. All trees on households’ farm land were registered by species. Farmers had on average 65 trees per hectare and a total of 92 species...

  11. TREE SELECTING AND TREE RING MEASURING IN DENDROCHRONOLOGICAL INVESTIGATIONS

    Directory of Open Access Journals (Sweden)

    Sefa Akbulut

    2004-04-01

    Full Text Available Dendrochronology is a method of dating which makes use of the annual nature of tree growth. Dendrochronology may be divided into a number of subfields, each of which covers one or more aspects of the use of tree ring data: dendroclimatology, dendrogeomorphology, dendrohydrology, dendroecology, dendroarchaelogy, and dendrogylaciology. Basic of all form the analysis of the tree rings. The wood or tree rings can aid to dating past events about climatology, ecology, geology, hydrology. Dendrochronological studies are conducted either on increment cores or on discs. It may be seen abnormalities on tree rings during the measurement like that false rings, missing rings, reaction wood. Like that situation, increment cores must be extracted from four different sides of each tree and be studied as more as on tree.

  12. Tree Colors: Color Schemes for Tree-Structured Data.

    Science.gov (United States)

    Tennekes, Martijn; de Jonge, Edwin

    2014-12-01

    We present a method to map tree structures to colors from the Hue-Chroma-Luminance color model, which is known for its well balanced perceptual properties. The Tree Colors method can be tuned with several parameters, whose effect on the resulting color schemes is discussed in detail. We provide a free and open source implementation with sensible parameter defaults. Categorical data are very common in statistical graphics, and often these categories form a classification tree. We evaluate applying Tree Colors to tree structured data with a survey on a large group of users from a national statistical institute. Our user study suggests that Tree Colors are useful, not only for improving node-link diagrams, but also for unveiling tree structure in non-hierarchical visualizations.

  13. Rate of tree carbon accumulation increases continuously with tree size.

    Science.gov (United States)

    Stephenson, N L; Das, A J; Condit, R; Russo, S E; Baker, P J; Beckman, N G; Coomes, D A; Lines, E R; Morris, W K; Rüger, N; Alvarez, E; Blundo, C; Bunyavejchewin, S; Chuyong, G; Davies, S J; Duque, A; Ewango, C N; Flores, O; Franklin, J F; Grau, H R; Hao, Z; Harmon, M E; Hubbell, S P; Kenfack, D; Lin, Y; Makana, J-R; Malizia, A; Malizia, L R; Pabst, R J; Pongpattananurak, N; Su, S-H; Sun, I-F; Tan, S; Thomas, D; van Mantgem, P J; Wang, X; Wiser, S K; Zavala, M A

    2014-03-06

    Forests are major components of the global carbon cycle, providing substantial feedback to atmospheric greenhouse gas concentrations. Our ability to understand and predict changes in the forest carbon cycle--particularly net primary productivity and carbon storage--increasingly relies on models that represent biological processes across several scales of biological organization, from tree leaves to forest stands. Yet, despite advances in our understanding of productivity at the scales of leaves and stands, no consensus exists about the nature of productivity at the scale of the individual tree, in part because we lack a broad empirical assessment of whether rates of absolute tree mass growth (and thus carbon accumulation) decrease, remain constant, or increase as trees increase in size and age. Here we present a global analysis of 403 tropical and temperate tree species, showing that for most species mass growth rate increases continuously with tree size. Thus, large, old trees do not act simply as senescent carbon reservoirs but actively fix large amounts of carbon compared to smaller trees; at the extreme, a single big tree can add the same amount of carbon to the forest within a year as is contained in an entire mid-sized tree. The apparent paradoxes of individual tree growth increasing with tree size despite declining leaf-level and stand-level productivity can be explained, respectively, by increases in a tree's total leaf area that outpace declines in productivity per unit of leaf area and, among other factors, age-related reductions in population density. Our results resolve conflicting assumptions about the nature of tree growth, inform efforts to undertand and model forest carbon dynamics, and have additional implications for theories of resource allocation and plant senescence.

  14. Contrasting natural regeneration and tree planting in fourteen North American cities

    Science.gov (United States)

    David J. Nowak

    2012-01-01

    Field data from randomly located plots in 12 cities in the United States and Canada were used to estimate the proportion of the existing tree population that was planted or occurred via natural regeneration. In addition, two cities (Baltimore and Syracuse) were recently re-sampled to estimate the proportion of newly established trees that were planted. Results for the...

  15. Probability distribution of long-run indiscriminate felling of trees in ...

    African Journals Online (AJOL)

    The study was undertaken to determine the probability distribution of Long-run indiscriminate felling of trees in northern senatorial district of Adamawa State. Specifically, the study focused on examining the future direction of indiscriminate felling of trees as well as its equilibrium distribution. A multi-stage and simple random ...

  16. Degree distribution of shortest path trees and bias of network sampling algorithms

    NARCIS (Netherlands)

    Bhamidi, S.; Goodman, J.A.; Hofstad, van der R.W.; Komjáthy, J.

    2013-01-01

    In this article, we explicitly derive the limiting distribution of the degree distribution of the shortest path tree from a single source on various random network models with edge weights. We determine the power-law exponent of the degree distribution of this tree and compare it to the degree

  17. Degree distribution of shortest path trees and bias of network sampling algorithms

    NARCIS (Netherlands)

    Bhamidi, S.; Goodman, J.A.; Hofstad, van der R.W.; Komjáthy, J.

    2015-01-01

    In this article, we explicitly derive the limiting degree distribution of the shortest path tree from a single source on various random network models with edge weights. We determine the asymptotics of the degree distribution for large degrees of this tree and compare it to the degree distribution

  18. Comparison of Greedy Algorithms for Decision Tree Optimization

    KAUST Repository

    Alkhalid, Abdulaziz

    2013-01-01

    This chapter is devoted to the study of 16 types of greedy algorithms for decision tree construction. The dynamic programming approach is used for construction of optimal decision trees. Optimization is performed relative to minimal values of average depth, depth, number of nodes, number of terminal nodes, and number of nonterminal nodes of decision trees. We compare average depth, depth, number of nodes, number of terminal nodes and number of nonterminal nodes of constructed trees with minimum values of the considered parameters obtained based on a dynamic programming approach. We report experiments performed on data sets from UCI ML Repository and randomly generated binary decision tables. As a result, for depth, average depth, and number of nodes we propose a number of good heuristics. © Springer-Verlag Berlin Heidelberg 2013.

  19. HERB RECOVERY IN DEGRADED CAATINGA SITES ENRICHED WITH NATIVE TREES

    Directory of Open Access Journals (Sweden)

    Juliana Matos Figueiredo

    2017-01-01

    Full Text Available Herb recovery was evaluated in degraded Caatinga sites protected from grazing and enriched with native trees, in Patos-PB state, Brazil . Treatments were randomized according to a block design with five treatments (no tree planting –T 0 – or tree planting of three tree species in pure –T 1 = Poincianella pyramidalis , T 2 = Mimosa tenuiflora and T 3 = Cnidoscolus quercifolius – or mixed balanced stands –T 4 and five replications of squared-144-m 2 plots with 36 seedlings developing in planting holes enriched with manure and chemical fertilizers, arranged in a 2 m x 2 m grid. Data were collected from September 2008 to October 2009. After this period, natural tree regeneration was still not observed, and tree canopy covered 15 to 49% of the soil and did not affect herb growth and species composition. Initial and final herb cover were 16% and 100%, respectively. The number of dicot herbs increased from five, mainly two Sida species, to 13 species, monocots were represented by one species only (Aristida sp ., and quantity of herb forage reached 3 ton/ha (2:1, dicot:monocot. Adjacent overgrazed plots kept the initial low level of herb cover and species composition. Animal deferment during one year allowed the increase in soil cover and plant diversity in degraded Caatinga sites into which planted tree seedlings established successfully. This management practice could be implemented to avoid further environmental degradation and recover degraded areas.

  20. Fault tree analysis

    International Nuclear Information System (INIS)

    1981-09-01

    Suggestion are made concerning the method of the fault tree analysis, the use of certain symbols in the examination of system failures. This purpose of the fault free analysis is to find logical connections of component or subsystem failures leading to undesirable occurrances. The results of these examinations are part of the system assessment concerning operation and safety. The objectives of the analysis are: systematical identification of all possible failure combinations (causes) leading to a specific undesirable occurrance, finding of reliability parameters such as frequency of failure combinations, frequency of the undesirable occurrance or non-availability of the system when required. The fault tree analysis provides a near and reconstructable documentation of the examination. (orig./HP) [de

  1. Tree-level formalism

    International Nuclear Information System (INIS)

    Brandhuber, Andreas; Spence, Bill; Travaglini, Gabriele

    2011-01-01

    We review two novel techniques used to calculate tree-level scattering amplitudes efficiently: MHV diagrams, and on-shell recursion relations. For the MHV diagrams, we consider applications to tree-level amplitudes and focus in particular on the N=4 supersymmetric formulation. We also briefly describe the derivation of loop amplitudes using MHV diagrams. For the recursion relations, after presenting their general proof, we discuss several applications to massless theories with and without supersymmetry, to theories with massive particles, and to graviton amplitudes in general relativity. This article is an invited review for a special issue of Journal of Physics A: Mathematical and Theoretical devoted to 'Scattering amplitudes in gauge theories'. (review)

  2. Tree Rings: Timekeepers of the Past.

    Science.gov (United States)

    Phipps, R. L.; McGowan, J.

    One of a series of general interest publications on science issues, this booklet describes the uses of tree rings in historical and biological recordkeeping. Separate sections cover the following topics: dating of tree rings, dating with tree rings, tree ring formation, tree ring identification, sample collections, tree ring cross dating, tree…

  3. Wood for the trees

    Directory of Open Access Journals (Sweden)

    Rob Garbutt

    2013-10-01

    Full Text Available Our paper focuses on the materiality, cultural history and cultural relations of selected artworks in the exhibition Wood for the trees (Lismore Regional Gallery, New South Wales, Australia, 10 June – 17 July 2011. The title of the exhibition, intentionally misreading the aphorism “Can’t see the wood for the trees”, by reading the wood for the resource rather than the collective wood[s], implies conservation, preservation, and the need for sustaining the originating resource. These ideas have particular resonance on the NSW far north coast, a region once rich in rainforest. While the Indigenous population had sustainable practices of forest and land management, the colonists deployed felling and harvesting in order to convert the value of the local, abundant rainforest trees into high-value timber. By the late twentieth century, however, a new wave of settlers launched a protest movements against the proposed logging of remnant rainforest at Terania Creek and elsewhere in the region. Wood for the trees, curated by Gallery Director Brett Adlington, plays on this dynamic relationship between wood, trees and people. We discuss the way selected artworks give expression to the themes or concepts of productive labour, nature and culture, conservation and sustainability, and memory. The artworks include Watjinbuy Marrawilil’s (1980 Carved ancestral figure ceremonial pole, Elizabeth Stops’ (2009/10 Explorations into colonisation, Hossein Valamanesh’s (2008 Memory stick, and AñA Wojak’s (2008 Unread book (in a forgotten language. Our art writing on the works, a practice informed by Bal (2002, Muecke (2008 and Papastergiadis (2004, becomes a conversation between the works and the themes or concepts. As a form of material excess of the most productive kind (Grosz, 2008, p. 7, art seeds a response to that which is in the air waiting to be said of the past, present and future.

  4. Recursive Trees for Practical ORAM

    Directory of Open Access Journals (Sweden)

    Moataz Tarik

    2015-06-01

    Full Text Available We present a new, general data structure that reduces the communication cost of recent tree-based ORAMs. Contrary to ORAM trees with constant height and path lengths, our new construction r-ORAM allows for trees with varying shorter path length. Accessing an element in the ORAM tree results in different communication costs depending on the location of the element. The main idea behind r-ORAM is a recursive ORAM tree structure, where nodes in the tree are roots of other trees. While this approach results in a worst-case access cost (tree height at most as any recent tree-based ORAM, we show that the average cost saving is around 35% for recent binary tree ORAMs. Besides reducing communication cost, r-ORAM also reduces storage overhead on the server by 4% to 20% depending on the ORAM’s client memory type. To prove r-ORAM’s soundness, we conduct a detailed overflow analysis. r-ORAM’s recursive approach is general in that it can be applied to all recent tree ORAMs, both constant and poly-log client memory ORAMs. Finally, we implement and benchmark r-ORAM in a practical setting to back up our theoretical claims.

  5. Mathematical foundations of event trees

    International Nuclear Information System (INIS)

    Papazoglou, Ioannis A.

    1998-01-01

    A mathematical foundation from first principles of event trees is presented. The main objective of this formulation is to offer a formal basis for developing automated computer assisted construction techniques for event trees. The mathematical theory of event trees is based on the correspondence between the paths of the tree and the elements of the outcome space of a joint event. The concept of a basic cylinder set is introduced to describe joint event outcomes conditional on specific outcomes of basic events or unconditional on the outcome of basic events. The concept of outcome space partition is used to describe the minimum amount of information intended to be preserved by the event tree representation. These concepts form the basis for an algorithm for systematic search for and generation of the most compact (reduced) form of an event tree consistent with the minimum amount of information the tree should preserve. This mathematical foundation allows for the development of techniques for automated generation of event trees corresponding to joint events which are formally described through other types of graphical models. Such a technique has been developed for complex systems described by functional blocks and it is reported elsewhere. On the quantification issue of event trees, a formal definition of a probability space corresponding to the event tree outcomes is provided. Finally, a short discussion is offered on the relationship of the presented mathematical theory with the more general use of event trees in reliability analysis of dynamic systems

  6. Making CSB + -Trees Processor Conscious

    DEFF Research Database (Denmark)

    Samuel, Michael; Pedersen, Anders Uhl; Bonnet, Philippe

    2005-01-01

    of the CSB+-tree. We argue that it is necessary to consider a larger group of parameters in order to adapt CSB+-tree to processor architectures as different as Pentium and Itanium. We identify this group of parameters and study how it impacts the performance of CSB+-tree on Itanium 2. Finally, we propose......Cache-conscious indexes, such as CSB+-tree, are sensitive to the underlying processor architecture. In this paper, we focus on how to adapt the CSB+-tree so that it performs well on a range of different processor architectures. Previous work has focused on the impact of node size on the performance...... a systematic method for adapting CSB+-tree to new platforms. This work is a first step towards integrating CSB+-tree in MySQL’s heap storage manager....

  7. Submodular unsplittable flow on trees

    DEFF Research Database (Denmark)

    Adamaszek, Anna Maria; Chalermsook, Parinya; Ene, Alina

    2016-01-01

    We study the Unsplittable Flow problem (UFP) on trees with a submodular objective function. The input to this problem is a tree with edge capacities and a collection of tasks, each characterized by a source node, a sink node, and a demand. A subset of the tasks is feasible if the tasks can...... simultaneously send their demands from the source to the sink without violating the edge capacities. The goal is to select a feasible subset of the tasks that maximizes a submodular objective function. Our main result is an O(k log n)-approximation algorithm for Submodular UFP on trees where k denotes...... the pathwidth of the given tree. Since every tree has pathwidth O(log n), we obtain an O(log2 n) approximation for arbitrary trees. This is the first non-trivial approximation guarantee for the problem and it matches the best approximation known for UFP on trees with a linear objective function. Our main...

  8. (Almost) practical tree codes

    KAUST Repository

    Khina, Anatoly

    2016-08-15

    We consider the problem of stabilizing an unstable plant driven by bounded noise over a digital noisy communication link, a scenario at the heart of networked control. To stabilize such a plant, one needs real-time encoding and decoding with an error probability profile that decays exponentially with the decoding delay. The works of Schulman and Sahai over the past two decades have developed the notions of tree codes and anytime capacity, and provided the theoretical framework for studying such problems. Nonetheless, there has been little practical progress in this area due to the absence of explicit constructions of tree codes with efficient encoding and decoding algorithms. Recently, linear time-invariant tree codes were proposed to achieve the desired result under maximum-likelihood decoding. In this work, we take one more step towards practicality, by showing that these codes can be efficiently decoded using sequential decoding algorithms, up to some loss in performance (and with some practical complexity caveats). We supplement our theoretical results with numerical simulations that demonstrate the effectiveness of the decoder in a control system setting.

  9. Robust dynamical effects in traffic and chaotic maps on trees

    Indian Academy of Sciences (India)

    Here we study two types of well-defined diffusive dynamics on scale-free trees: traffic of packets as navigated random walks, and chaotic standard maps coupled along the network links. We show that in both cases robust collective dynamic effects appear, which can be measured statistically and related to non-ergodicity of ...

  10. Demographic trends in Claremont California’s street tree population

    Science.gov (United States)

    Natalie S. van Doorn; E. Gregory McPherson

    2018-01-01

    The aim of this study was to quantify street tree population dynamics in the city of Claremont, CA. A repeated measures survey (2000 and 2014) based on a stratified random sampling approach across size classes and for the most abundant 21 species was analyzed to calculate removal, growth, and replacement planting rates. Demographic rates were estimated using a...

  11. Rate of tree carbon accumulation increases continuously with tree size

    Science.gov (United States)

    Stephenson, N.L.; Das, A.J.; Condit, R.; Russo, S.E.; Baker, P.J.; Beckman, N.G.; Coomes, D.A.; Lines, E.R.; Morris, W.K.; Rüger, N.; Álvarez, E.; Blundo, C.; Bunyavejchewin, S.; Chuyong, G.; Davies, S.J.; Duque, Á.; Ewango, C.N.; Flores, O.; Franklin, J.F.; Grau, H.R.; Hao, Z.; Harmon, M.E.; Hubbell, S.P.; Kenfack, D.; Lin, Y.; Makana, J.-R.; Malizia, A.; Malizia, L.R.; Pabst, R.J.; Pongpattananurak, N.; Su, S.-H.; Sun, I-F.; Tan, S.; Thomas, D.; van Mantgem, P.J.; Wang, X.; Wiser, S.K.; Zavala, M.A.

    2014-01-01

    Forests are major components of the global carbon cycle, providing substantial feedback to atmospheric greenhouse gas concentrations. Our ability to understand and predict changes in the forest carbon cycle—particularly net primary productivity and carbon storage - increasingly relies on models that represent biological processes across several scales of biological organization, from tree leaves to forest stands. Yet, despite advances in our understanding of productivity at the scales of leaves and stands, no consensus exists about the nature of productivity at the scale of the individual tree, in part because we lack a broad empirical assessment of whether rates of absolute tree mass growth (and thus carbon accumulation) decrease, remain constant, or increase as trees increase in size and age. Here we present a global analysis of 403 tropical and temperate tree species, showing that for most species mass growth rate increases continuously with tree size. Thus, large, old trees do not act simply as senescent carbon reservoirs but actively fix large amounts of carbon compared to smaller trees; at the extreme, a single big tree can add the same amount of carbon to the forest within a year as is contained in an entire mid-sized tree. The apparent paradoxes of individual tree growth increasing with tree size despite declining leaf-level and stand-level productivity can be explained, respectively, by increases in a tree’s total leaf area that outpace declines in productivity per unit of leaf area and, among other factors, age-related reductions in population density. Our results resolve conflicting assumptions about the nature of tree growth, inform efforts to understand and model forest carbon dynamics, and have additional implications for theories of resource allocation and plant senescence.

  12. The contribution of competition to tree mortality in old-growth coniferous forests

    Science.gov (United States)

    Das, A.; Battles, J.; Stephenson, N.L.; van Mantgem, P.J.

    2011-01-01

    Competition is a well-documented contributor to tree mortality in temperate forests, with numerous studies documenting a relationship between tree death and the competitive environment. Models frequently rely on competition as the only non-random mechanism affecting tree mortality. However, for mature forests, competition may cease to be the primary driver of mortality.We use a large, long-term dataset to study the importance of competition in determining tree mortality in old-growth forests on the western slope of the Sierra Nevada of California, U.S.A. We make use of the comparative spatial configuration of dead and live trees, changes in tree spatial pattern through time, and field assessments of contributors to an individual tree's death to quantify competitive effects.Competition was apparently a significant contributor to tree mortality in these forests. Trees that died tended to be in more competitive environments than trees that survived, and suppression frequently appeared as a factor contributing to mortality. On the other hand, based on spatial pattern analyses, only three of 14 plots demonstrated compelling evidence that competition was dominating mortality. Most of the rest of the plots fell within the expectation for random mortality, and three fit neither the random nor the competition model. These results suggest that while competition is often playing a significant role in tree mortality processes in these forests it only infrequently governs those processes. In addition, the field assessments indicated a substantial presence of biotic mortality agents in trees that died.While competition is almost certainly important, demographics in these forests cannot accurately be characterized without a better grasp of other mortality processes. In particular, we likely need a better understanding of biotic agents and their interactions with one another and with competition. ?? 2011.

  13. Radiofrequency radiation injures trees around mobile phone base stations.

    Science.gov (United States)

    Waldmann-Selsam, Cornelia; Balmori-de la Puente, Alfonso; Breunig, Helmut; Balmori, Alfonso

    2016-12-01

    In the last two decades, the deployment of phone masts around the world has taken place and, for many years, there has been a discussion in the scientific community about the possible environmental impact from mobile phone base stations. Trees have several advantages over animals as experimental subjects and the aim of this study was to verify whether there is a connection between unusual (generally unilateral) tree damage and radiofrequency exposure. To achieve this, a detailed long-term (2006-2015) field monitoring study was performed in the cities of Bamberg and Hallstadt (Germany). During monitoring, observations and photographic recordings of unusual or unexplainable tree damage were taken, alongside the measurement of electromagnetic radiation. In 2015 measurements of RF-EMF (Radiofrequency Electromagnetic Fields) were carried out. A polygon spanning both cities was chosen as the study site, where 144 measurements of the radiofrequency of electromagnetic fields were taken at a height of 1.5m in streets and parks at different locations. By interpolation of the 144 measurement points, we were able to compile an electromagnetic map of the power flux density in Bamberg and Hallstadt. We selected 60 damaged trees, in addition to 30 randomly selected trees and 30 trees in low radiation areas (n=120) in this polygon. The measurements of all trees revealed significant differences between the damaged side facing a phone mast and the opposite side, as well as differences between the exposed side of damaged trees and all other groups of trees in both sides. Thus, we found that side differences in measured values of power flux density corresponded to side differences in damage. The 30 selected trees in low radiation areas (no visual contact to any phone mast and power flux density under 50μW/m 2 ) showed no damage. Statistical analysis demonstrated that electromagnetic radiation from mobile phone masts is harmful for trees. These results are consistent with the fact

  14. Random walk on random walks

    NARCIS (Netherlands)

    Hilário, M.; Hollander, den W.Th.F.; Sidoravicius, V.; Soares dos Santos, R.; Teixeira, A.

    2014-01-01

    In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density ¿¿(0,8). At each step the random walk performs a nearest-neighbour jump, moving to

  15. On Determining if Tree-based Networks Contain Fixed Trees.

    Science.gov (United States)

    Anaya, Maria; Anipchenko-Ulaj, Olga; Ashfaq, Aisha; Chiu, Joyce; Kaiser, Mahedi; Ohsawa, Max Shoji; Owen, Megan; Pavlechko, Ella; St John, Katherine; Suleria, Shivam; Thompson, Keith; Yap, Corrine

    2016-05-01

    We address an open question of Francis and Steel about phylogenetic networks and trees. They give a polynomial time algorithm to decide if a phylogenetic network, N, is tree-based and pose the problem: given a fixed tree T and network N, is N based on T? We show that it is [Formula: see text]-hard to decide, by reduction from 3-Dimensional Matching (3DM) and further that the problem is fixed-parameter tractable.

  16. Trees in the city: valuing street trees in Portland, Oregon

    Science.gov (United States)

    G.H. Donovan; D.T. Butry

    2010-01-01

    We use a hedonic price model to simultaneously estimate the effects of street trees on the sales price and the time-on-market (TOM) of houses in Portland. Oregon. On average, street trees add $8,870 to sales price and reduce TOM by 1.7 days. In addition, we found that the benefits of street trees spill over to neighboring houses. Because the provision and maintenance...

  17. The Problem of Predecessors on Spanning Trees

    Directory of Open Access Journals (Sweden)

    V. S. Poghosyan

    2011-01-01

    Full Text Available We consider the equiprobable distribution of spanning trees on the square lattice. All bonds of each tree can be oriented uniquely with respect to an arbitrary chosen site called the root. The problem of predecessors is to find the probability that a path along the oriented bonds passes sequentially fixed sites i and j. The conformal field theory for the Potts model predicts the fractal dimension of the path to be 5/4. Using this result, we show that the probability in the predecessors problem for two sites separated by large distance r decreases as P(r ∼ r −3/4. If sites i and j are nearest neighbors on the square lattice, the probability P(1 = 5/16 can be found from the analytical theory developed for the sandpile model. The known equivalence between the loop erased random walk (LERW and the directed path on the spanning tree states that P(1 is the probability for the LERW started at i to reach the neighboring site j. By analogy with the self-avoiding walk, P(1 can be called the return probability. Extensive Monte-Carlo simulations confirm the theoretical predictions.

  18. Systolic trees and systolic language recognition by tree automata

    Energy Technology Data Exchange (ETDEWEB)

    Steinby, M

    1983-01-01

    K. Culik II, J. Gruska, A. Salomaa and D. Wood have studied the language recognition capabilities of certain types of systolically operating networks of processors (see research reports Cs-81-32, Cs-81-36 and Cs-82-01, Univ. of Waterloo, Ontario, Canada). In this paper, their model for systolic VLSI trees is formalised in terms of standard tree automaton theory, and the way in which some known facts about recognisable forests and tree transductions can be applied in VLSI tree theory is demonstrated. 13 references.

  19. Recent tree cover increases in eastern China linked to low, declining human pressure, steep topography, and climatic conditions favoring tree growth.

    Science.gov (United States)

    Nüchel, Jonas; Svenning, Jens-Christian

    2017-01-01

    Globally, the extent of forest continues to decline, however, some countries have increased their forest extent in recent years. China is one of these countries and has managed to increase their tree cover through huge reforestation and afforestation programs during recent decades as well as land abandonment dynamics. This study investigates tree cover change in the eastern half of China between 2000 and 2010 on three different scales, using random forest modeling of remote sensing data for tree cover in relation to environmental and anthropogenic predictor variables. Our results show that between the years 2000 and 2010 2,667,875 km2 experienced an increase in tree cover while 1,854,900 km2 experienced a decline in tree cover. The area experiencing ≥10% increase in tree cover is almost twice as large as the area with ≥10% drop in tree cover. There is a clear relation between topography and tree cover change with steeper and mid-elevation areas having a larger response on tree cover increase than other areas. Furthermore, human influence, change in population density, and actual evapotranspiration are also important factors in explaining where tree cover has changed. This study adds to the understanding of tree cover change in China, as it has focus on the entire eastern half of China on three different scales and how tree cover change is linked to topography and anthropogenic pressure. Though, our results show an increase in tree cover in China, this study emphasizes the importance of incorporating anthropogenic factors together with biodiversity protection into the reforestation and afforestation programs in the future.

  20. Recent tree cover increases in eastern China linked to low, declining human pressure, steep topography, and climatic conditions favoring tree growth.

    Directory of Open Access Journals (Sweden)

    Jonas Nüchel

    Full Text Available Globally, the extent of forest continues to decline, however, some countries have increased their forest extent in recent years. China is one of these countries and has managed to increase their tree cover through huge reforestation and afforestation programs during recent decades as well as land abandonment dynamics. This study investigates tree cover change in the eastern half of China between 2000 and 2010 on three different scales, using random forest modeling of remote sensing data for tree cover in relation to environmental and anthropogenic predictor variables. Our results show that between the years 2000 and 2010 2,667,875 km2 experienced an increase in tree cover while 1,854,900 km2 experienced a decline in tree cover. The area experiencing ≥10% increase in tree cover is almost twice as large as the area with ≥10% drop in tree cover. There is a clear relation between topography and tree cover change with steeper and mid-elevation areas having a larger response on tree cover increase than other areas. Furthermore, human influence, change in population density, and actual evapotranspiration are also important factors in explaining where tree cover has changed. This study adds to the understanding of tree cover change in China, as it has focus on the entire eastern half of China on three different scales and how tree cover change is linked to topography and anthropogenic pressure. Though, our results show an increase in tree cover in China, this study emphasizes the importance of incorporating anthropogenic factors together with biodiversity protection into the reforestation and afforestation programs in the future.

  1. PageRank in scale-free random graphs

    NARCIS (Netherlands)

    Chen, Ningyuan; Litvak, Nelli; Olvera-Cravioto, Mariana; Bonata, Anthony; Chung, Fan; Pralat, Paweł

    2014-01-01

    We analyze the distribution of PageRank on a directed configuration model and show that as the size of the graph grows to infinity, the PageRank of a randomly chosen node can be closely approximated by the PageRank of the root node of an appropriately constructed tree. This tree approximation is in

  2. Tree felling: a necessary evil

    CERN Multimedia

    CERN Bulletin

    2013-01-01

    CERN started a campaign of tree felling in 2010 for safety reasons, and it will continue this year in various parts of the Meyrin site. As in previous years, the trees cut down in 2013 will be recycled and some will be replaced.   Diseased tree that had to be cut down on the Meyrin site. In association with the Geneva nature and countryside directorate (Direction générale de la nature et du paysage, DGNP), CERN commissioned the Geneva school of landscaping, engineering and architecture (Haute école du paysage, d’ingénierie et d’architecture, HEPIA) to compile an inventory of the trees on the Meyrin site. In total, 1285 trees (excluding poplars) were recorded. 75.5% of these trees were declared to be in a good state of health (i.e. 971 trees), 21.5% in a moderate state of health (276 trees) and 3% in a poor state of health (38 trees). As for the poplars, the 236 specimens recorded on the Meyrin site were judged to be too old, to...

  3. Human decision error (HUMDEE) trees

    International Nuclear Information System (INIS)

    Ostrom, L.T.

    1993-01-01

    Graphical presentations of human actions in incident and accident sequences have been used for many years. However, for the most part, human decision making has been underrepresented in these trees. This paper presents a method of incorporating the human decision process into graphical presentations of incident/accident sequences. This presentation is in the form of logic trees. These trees are called Human Decision Error Trees or HUMDEE for short. The primary benefit of HUMDEE trees is that they graphically illustrate what else the individuals involved in the event could have done to prevent either the initiation or continuation of the event. HUMDEE trees also present the alternate paths available at the operator decision points in the incident/accident sequence. This is different from the Technique for Human Error Rate Prediction (THERP) event trees. There are many uses of these trees. They can be used for incident/accident investigations to show what other courses of actions were available and for training operators. The trees also have a consequence component so that not only the decision can be explored, also the consequence of that decision

  4. Phylogenetic trees and Euclidean embeddings.

    Science.gov (United States)

    Layer, Mark; Rhodes, John A

    2017-01-01

    It was recently observed by de Vienne et al. (Syst Biol 60(6):826-832, 2011) that a simple square root transformation of distances between taxa on a phylogenetic tree allowed for an embedding of the taxa into Euclidean space. While the justification for this was based on a diffusion model of continuous character evolution along the tree, here we give a direct and elementary explanation for it that provides substantial additional insight. We use this embedding to reinterpret the differences between the NJ and BIONJ tree building algorithms, providing one illustration of how this embedding reflects tree structures in data.

  5. Occurrence of leguminous trees

    Energy Technology Data Exchange (ETDEWEB)

    Kirkbride, J.H.; Arkcoll, D.B.A.; Turnbull, J.W.; Magalhaes, L.M.S.; Fernandes, N.P.

    1984-01-01

    Five papers from the symposium are presented. Kirkbride, J.H. Jr.; Legumes of the cerrado. pp 23-46 (Refs. 55) A review is given. Some 548 legume species in 59 genera are listed that have been reported from cerrado vegetation. Felker, P.; Legume trees in semi-arid and arid areas. pp 47-59 (Refs. 41) A review is given of worldwide research activities. Arkcoll, D.B.; A comparison of some fast growing species suitable for woodlots in the wet tropics. pp 61-68 (Refs. 9) Studies are described near Manaus on intensive silviculture (for fuelwood production) of Eucalyptus deglupta, Cedrelinga catanaeformis (catenaeformis), Jacaranda copaia, and Inga edulis. Turnbull, J.W.; Six phyllodinous Acacia species for planting in the humid tropical lowlands. pp 69-73 (Refs. 14) Distribution, ecology, growth, and utilization are described for A. auriculiformis, A. mangium, A. aulacocarpa, A. crassicarpa, A. cincinnata, and A. polystachya. Magalhaes, L.M.S., Fernandes, N.P.; Experimental stands of leguminous trees in the Manaus region. pp 75-79 (Refs. 8) Performance up to age 20 yr of Cedrelinga catenaeformis, Dalbergia nigra, Dinizia excelsa, Dipteryx odorata, Dipteryx sp., Diplotropis sp., Eperua bijuga, Pithecellobium racemosum, Vouacapoua pallidior, and Hymenaea sp. is described.

  6. The Steiner tree problem

    CERN Document Server

    Hwang, FK; Winter, P

    1992-01-01

    The Steiner problem asks for a shortest network which spans a given set of points. Minimum spanning networks have been well-studied when all connections are required to be between the given points. The novelty of the Steiner tree problem is that new auxiliary points can be introduced between the original points so that a spanning network of all the points will be shorter than otherwise possible. These new points are called Steiner points - locating them has proved problematic and research has diverged along many different avenues. This volume is devoted to the assimilation of the rich field of intriguing analyses and the consolidation of the fragments. A section has been given to each of the three major areas of interest which have emerged. The first concerns the Euclidean Steiner Problem, historically the original Steiner tree problem proposed by Jarník and Kössler in 1934. The second deals with the Steiner Problem in Networks, which was propounded independently by Hakimi and Levin and has enjoyed the most...

  7. Genealogy and gene trees.

    Science.gov (United States)

    Rasmuson, Marianne

    2008-02-01

    Heredity can be followed in persons or in genes. Persons can be identified only a few generations back, but simplified models indicate that universal ancestors to all now living persons have occurred in the past. Genetic variability can be characterized as variants of DNA sequences. Data are available only from living persons, but from the pattern of variation gene trees can be inferred by means of coalescence models. The merging of lines backwards in time leads to a MRCA (most recent common ancestor). The time and place of living for this inferred person can give insights in human evolutionary history. Demographic processes are incorporated in the model, but since culture and customs are known to influence demography the models used ought to be tested against available genealogy. The Icelandic data base offers a possibility to do so and points to some discrepancies. Mitochondrial DNA and Y chromosome patterns give a rather consistent view of human evolutionary history during the latest 100 000 years but the earlier epochs of human evolution demand gene trees with longer branches. The results of such studies reveal as yet unsolved problems about the sources of our genome.

  8. Distributed Merge Trees

    Energy Technology Data Exchange (ETDEWEB)

    Morozov, Dmitriy; Weber, Gunther

    2013-01-08

    Improved simulations and sensors are producing datasets whose increasing complexity exhausts our ability to visualize and comprehend them directly. To cope with this problem, we can detect and extract significant features in the data and use them as the basis for subsequent analysis. Topological methods are valuable in this context because they provide robust and general feature definitions. As the growth of serial computational power has stalled, data analysis is becoming increasingly dependent on massively parallel machines. To satisfy the computational demand created by complex datasets, algorithms need to effectively utilize these computer architectures. The main strength of topological methods, their emphasis on global information, turns into an obstacle during parallelization. We present two approaches to alleviate this problem. We develop a distributed representation of the merge tree that avoids computing the global tree on a single processor and lets us parallelize subsequent queries. To account for the increasing number of cores per processor, we develop a new data structure that lets us take advantage of multiple shared-memory cores to parallelize the work on a single node. Finally, we present experiments that illustrate the strengths of our approach as well as help identify future challenges.

  9. Tree phylogenetic diversity promotes host-parasitoid interactions.

    Science.gov (United States)

    Staab, Michael; Bruelheide, Helge; Durka, Walter; Michalski, Stefan; Purschke, Oliver; Zhu, Chao-Dong; Klein, Alexandra-Maria

    2016-07-13

    Evidence from grassland experiments suggests that a plant community's phylogenetic diversity (PD) is a strong predictor of ecosystem processes, even stronger than species richness per se This has, however, never been extended to species-rich forests and host-parasitoid interactions. We used cavity-nesting Hymenoptera and their parasitoids collected in a subtropical forest as a model system to test whether hosts, parasitoids, and their interactions are influenced by tree PD and a comprehensive set of environmental variables, including tree species richness. Parasitism rate and parasitoid abundance were positively correlated with tree PD. All variables describing parasitoids decreased with elevation, and were, except parasitism rate, dependent on host abundance. Quantitative descriptors of host-parasitoid networks were independent of the environment. Our study indicates that host-parasitoid interactions in species-rich forests are related to the PD of the tree community, which influences parasitism rates through parasitoid abundance. We show that effects of tree community PD are much stronger than effects of tree species richness, can cascade to high trophic levels, and promote trophic interactions. As during habitat modification phylogenetic information is usually lost non-randomly, even species-rich habitats may not be able to continuously provide the ecosystem process parasitism if the evolutionarily most distinct plant lineages vanish. © 2016 The Author(s).

  10. Shopping intention prediction using decision trees

    Directory of Open Access Journals (Sweden)

    Dario Šebalj

    2017-09-01

    Full Text Available Introduction: The price is considered to be neglected marketing mix element due to the complexity of price management and sensitivity of customers on price changes. It pulls the fastest customer reactions to that change. Accordingly, the process of making shopping decisions can be very challenging for customer. Objective: The aim of this paper is to create a model that is able to predict shopping intention and classify respondents into one of the two categories, depending on whether they intend to shop or not. Methods: Data sample consists of 305 respondents, who are persons older than 18 years involved in buying groceries for their household. The research was conducted in February 2017. In order to create a model, the decision trees method was used with its several classification algorithms. Results: All models, except the one that used RandomTree algorithm, achieved relatively high classification rate (over the 80%. The highest classification accuracy of 84.75% gave J48 and RandomForest algorithms. Since there is no statistically significant difference between those two algorithms, authors decided to choose J48 algorithm and build a decision tree. Conclusions: The value for money and price level in the store were the most significant variables for classification of shopping intention. Future study plans to compare this model with some other data mining techniques, such as neural networks or support vector machines since these techniques achieved very good accuracy in some previous research in this field.

  11. Random magnetism

    International Nuclear Information System (INIS)

    Tahir-Kheli, R.A.

    1975-01-01

    A few simple problems relating to random magnetic systems are presented. Translational symmetry, only on the macroscopic scale, is assumed for these systems. A random set of parameters, on the microscopic scale, for the various regions of these systems is also assumed. A probability distribution for randomness is obeyed. Knowledge of the form of these probability distributions, is assumed in all cases [pt

  12. Visualizing Individual Tree Differences in Tree-Ring Studies

    Directory of Open Access Journals (Sweden)

    Mario Trouillier

    2018-04-01

    Full Text Available Averaging tree-ring measurements from multiple individuals is one of the most common procedures in dendrochronology. It serves to filter out noise from individual differences between trees, such as competition, height, and micro-site effects, which ideally results in a site chronology sensitive to regional scale factors such as climate. However, the climate sensitivity of individual trees can be modulated by factors like competition, height, and nitrogen deposition, calling attention to whether average chronologies adequately assess climatic growth-control. In this study, we demonstrate four simple but effective methods to visually assess differences between individual trees. Using individual tree climate-correlations we: (1 employed jitter plots with superimposed metadata to assess potential causes for these differences; (2 plotted the frequency distributions of climate correlations over time as heat maps; (3 mapped the spatial distribution of climate sensitivity over time to assess spatio-temporal dynamics; and (4 used t-distributed Stochastic Neighborhood Embedding (t-SNE to assess which trees were generally more similar in terms of their tree-ring pattern and their correlation with climate variables. This suite of exploratory methods can indicate if individuals in tree-ring datasets respond differently to climate variability, and therefore, should not solely be explored with climate correlations of the mean population chronology.

  13. Tree Size Comparison of Some Important Street Trees Growing at ...

    African Journals Online (AJOL)

    PROF HORSFALL

    More research is needed on these trees for healthy environment of city. The present ..... use and CO2 emissions from power plants. Environ. Poll. .... Anna. Bot., 65:567-574. Kozlowski, T.T., 1971. Growth and Development of. Trees. Vol. 1.

  14. Relating phylogenetic trees to transmission trees of infectious disease outbreaks.

    Science.gov (United States)

    Ypma, Rolf J F; van Ballegooijen, W Marijn; Wallinga, Jacco

    2013-11-01

    Transmission events are the fundamental building blocks of the dynamics of any infectious disease. Much about the epidemiology of a disease can be learned when these individual transmission events are known or can be estimated. Such estimations are difficult and generally feasible only when detailed epidemiological data are available. The genealogy estimated from genetic sequences of sampled pathogens is another rich source of information on transmission history. Optimal inference of transmission events calls for the combination of genetic data and epidemiological data into one joint analysis. A key difficulty is that the transmission tree, which describes the transmission events between infected hosts, differs from the phylogenetic tree, which describes the ancestral relationships between pathogens sampled from these hosts. The trees differ both in timing of the internal nodes and in topology. These differences become more pronounced when a higher fraction of infected hosts is sampled. We show how the phylogenetic tree of sampled pathogens is related to the transmission tree of an outbreak of an infectious disease, by the within-host dynamics of pathogens. We provide a statistical framework to infer key epidemiological and mutational parameters by simultaneously estimating the phylogenetic tree and the transmission tree. We test the approach using simulations and illustrate its use on an outbreak of foot-and-mouth disease. The approach unifies existing methods in the emerging field of phylodynamics with transmission tree reconstruction methods that are used in infectious disease epidemiology.

  15. DIF Trees: Using Classification Trees to Detect Differential Item Functioning

    Science.gov (United States)

    Vaughn, Brandon K.; Wang, Qiu

    2010-01-01

    A nonparametric tree classification procedure is used to detect differential item functioning for items that are dichotomously scored. Classification trees are shown to be an alternative procedure to detect differential item functioning other than the use of traditional Mantel-Haenszel and logistic regression analysis. A nonparametric…

  16. Picking a tree: habitat use by the tree agama, Acanthocercus ...

    African Journals Online (AJOL)

    We studied tree agama (Acanthocercus a. atricollis) habitat use in the Magaliesberg mountain range in northern South Africa using sightings of marked individuals, and in a few cases, radio-telemetry. Acanthocercus a. atricollis preferentially selected thorn trees (46%; Acacia karroo), followed by common sugarbush (10%; ...

  17. Two Trees: Migrating Fault Trees to Decision Trees for Real Time Fault Detection on International Space Station

    Science.gov (United States)

    Lee, Charles; Alena, Richard L.; Robinson, Peter

    2004-01-01

    We started from ISS fault trees example to migrate to decision trees, presented a method to convert fault trees to decision trees. The method shows that the visualizations of root cause of fault are easier and the tree manipulating becomes more programmatic via available decision tree programs. The visualization of decision trees for the diagnostic shows a format of straight forward and easy understands. For ISS real time fault diagnostic, the status of the systems could be shown by mining the signals through the trees and see where it stops at. The other advantage to use decision trees is that the trees can learn the fault patterns and predict the future fault from the historic data. The learning is not only on the static data sets but also can be online, through accumulating the real time data sets, the decision trees can gain and store faults patterns in the trees and recognize them when they come.

  18. Better trees through systematic breeding

    Science.gov (United States)

    Robert Z. Callaham

    1957-01-01

    Today I would like to tell you briefly about the efforts of forest geneticists to improve the quality of forest trees. What do we mean by quality? Here, the consumer has the first word. The trees we produce are primarily for timber production, and the timber growing and wood-using industries give us our guidelines. Nevertheless, many of the characteristics sought by...

  19. Tree physiology and bark beetles

    Science.gov (United States)

    Michael G. Ryan; Gerard Sapes; Anna Sala; Sharon Hood

    2015-01-01

    Irruptive bark beetles usually co-occur with their co-evolved tree hosts at very low (endemic) population densities. However, recent droughts and higher temperatures have promoted widespread tree mortality with consequences for forest carbon, fire and ecosystem services (Kurz et al., 2008; Raffa et al., 2008; Jenkins et al., 2012). In this issue of New Phytologist,...

  20. Tree Hydraulics: How Sap Rises

    Science.gov (United States)

    Denny, Mark

    2012-01-01

    Trees transport water from roots to crown--a height that can exceed 100 m. The physics of tree hydraulics can be conveyed with simple fluid dynamics based upon the Hagen-Poiseuille equation and Murray's law. Here the conduit structure is modelled as conical pipes and as branching pipes. The force required to lift sap is generated mostly by…

  1. Boosted decision trees and applications

    International Nuclear Information System (INIS)

    Coadou, Y.

    2013-01-01

    Decision trees are a machine learning technique more and more commonly used in high energy physics, while it has been widely used in the social sciences. After introducing the concepts of decision trees, this article focuses on its application in particle physics. (authors)

  2. Who pays for tree improvement?

    Science.gov (United States)

    Tom D. Byram; E. M. Raley

    2011-01-01

    Tree improvement has been one of the most successful collaborative research efforts in history, eliciting participation from a wide variety of players. This effort has included state forestry agencies, research universities, integrated forest industries, and the USDA Forest Service. Tree improvement was organized through cooperatives whose objectives were to distribute...

  3. Mean-field lattice trees

    NARCIS (Netherlands)

    Borgs, C.; Chayes, J.T.; Hofstad, van der R.W.; Slade, G.

    1999-01-01

    We introduce a mean-field model of lattice trees based on embeddings into d of abstract trees having a critical Poisson offspring distribution. This model provides a combinatorial interpretation for the self-consistent mean-field model introduced previously by Derbez and Slade [9], and provides an

  4. Randomized random walk on a random walk

    International Nuclear Information System (INIS)

    Lee, P.A.

    1983-06-01

    This paper discusses generalizations of the model introduced by Kehr and Kunter of the random walk of a particle on a one-dimensional chain which in turn has been constructed by a random walk procedure. The superimposed random walk is randomised in time according to the occurrences of a stochastic point process. The probability of finding the particle in a particular position at a certain instant is obtained explicitly in the transform domain. It is found that the asymptotic behaviour for large time of the mean-square displacement of the particle depends critically on the assumed structure of the basic random walk, giving a diffusion-like term for an asymmetric walk or a square root law if the walk is symmetric. Many results are obtained in closed form for the Poisson process case, and these agree with those given previously by Kehr and Kunter. (author)

  5. Modelling tree biomasses in Finland

    Energy Technology Data Exchange (ETDEWEB)

    Repola, J.

    2013-06-01

    Biomass equations for above- and below-ground tree components of Scots pine (Pinus sylvestris L), Norway spruce (Picea abies [L.] Karst) and birch (Betula pendula Roth and Betula pubescens Ehrh.) were compiled using empirical material from a total of 102 stands. These stands (44 Scots pine, 34 Norway spruce and 24 birch stands) were located mainly on mineral soil sites representing a large part of Finland. The biomass models were based on data measured from 1648 sample trees, comprising 908 pine, 613 spruce and 127 birch trees. Biomass equations were derived for the total above-ground biomass and for the individual tree components: stem wood, stem bark, living and dead branches, needles, stump, and roots, as dependent variables. Three multivariate models with different numbers of independent variables for above-ground biomass and one for below-ground biomass were constructed. Variables that are normally measured in forest inventories were used as independent variables. The simplest model formulations, multivariate models (1) were mainly based on tree diameter and height as independent variables. In more elaborated multivariate models, (2) and (3), additional commonly measured tree variables such as age, crown length, bark thickness and radial growth rate were added. Tree biomass modelling includes consecutive phases, which cause unreliability in the prediction of biomass. First, biomasses of sample trees should be determined reliably to decrease the statistical errors caused by sub-sampling. In this study, methods to improve the accuracy of stem biomass estimates of the sample trees were developed. In addition, the reliability of the method applied to estimate sample-tree crown biomass was tested, and no systematic error was detected. Second, the whole information content of data should be utilized in order to achieve reliable parameter estimates and applicable and flexible model structure. In the modelling approach, the basic assumption was that the biomasses of

  6. Ensemble of randomized soft decision trees for robust classification

    Indian Academy of Sciences (India)

    G KISHOR KUMAR

    1Department of Information Technology, Rajeev Gandhi Memorial College of Engineering and Technology,. Nandyal ... Data Mining is a process which discovers knowledge from ... for many applications like diagnosis systems [23], video.

  7. Totally optimal decision trees for Boolean functions

    KAUST Repository

    Chikalov, Igor; Hussain, Shahid; Moshkov, Mikhail

    2016-01-01

    We study decision trees which are totally optimal relative to different sets of complexity parameters for Boolean functions. A totally optimal tree is an optimal tree relative to each parameter from the set simultaneously. We consider the parameters

  8. Utilising Tree-Based Ensemble Learning for Speaker Segmentation

    DEFF Research Database (Denmark)

    Abou-Zleikha, Mohamed; Tan, Zheng-Hua; Christensen, Mads Græsbøll

    2014-01-01

    In audio and speech processing, accurate detection of the changing points between multiple speakers in speech segments is an important stage for several applications such as speaker identification and tracking. Bayesian Information Criteria (BIC)-based approaches are the most traditionally used...... for a certain condition, the model becomes biased to the data used for training limiting the model’s generalisation ability. In this paper, we propose a BIC-based tuning-free approach for speaker segmentation through the use of ensemble-based learning. A forest of segmentation trees is constructed in which each...... tree is trained using a sampled version of the speech segment. During the tree construction process, a set of randomly selected points in the input sequence is examined as potential segmentation points. The point that yields the highest ΔBIC is chosen and the same process is repeated for the resultant...

  9. Small Worlds in the Tree Topologies of Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Qiao, Li; Lingguo, Cui; Baihai, Zhang

    2010-01-01

    In this study, the characteristics of small worlds are investigated in the context of the tree topologies of wireless sensor networks. Tree topologies, which construct spatial graphs with larger characteristic path lengths than random graphs and small clustering coefficients, are ubiquitous...... in wireless sensor networks. Suffering from the link rewiring or the link addition, the characteristic path length of the tree topology reduces rapidly and the clustering coefficient increases greatly. The variety of characteristic path length influences the time synchronization characteristics of wireless...... sensor networks greatly. With the increase of the link rewiring or the link addition probability, the time synchronization error decreases drastically. Two novel protocols named LEACH-SW and TREEPSI-SW are proposed to improve the performances of the sensor networks, in which the small world...

  10. Inferring phylogenetic trees from the knowledge of rare evolutionary events.

    Science.gov (United States)

    Hellmuth, Marc; Hernandez-Rosales, Maribel; Long, Yangjing; Stadler, Peter F

    2018-06-01

    Rare events have played an increasing role in molecular phylogenetics as potentially homoplasy-poor characters. In this contribution we analyze the phylogenetic information content from a combinatorial point of view by considering the binary relation on the set of taxa defined by the existence of a single event separating two taxa. We show that the graph-representation of this relation must be a tree. Moreover, we characterize completely the relationship between the tree of such relations and the underlying phylogenetic tree. With directed operations such as tandem-duplication-random-loss events in mind we demonstrate how non-symmetric information constrains the position of the root in the partially reconstructed phylogeny.

  11. Disentangling the diversity of arboreal ant communities in tropical forest trees.

    Science.gov (United States)

    Klimes, Petr; Fibich, Pavel; Idigel, Cliffson; Rimandai, Maling

    2015-01-01

    Tropical canopies are known for their high abundance and diversity of ants. However, the factors which enable coexistence of so many species in trees, and in particular, the role of foragers in determining local diversity, are not well understood. We censused nesting and foraging arboreal ant communities in two 0.32 ha plots of primary and secondary lowland rainforest in New Guinea and explored their species diversity and composition. Null models were used to test if the records of species foraging (but not nesting) in a tree were dependent on the spatial distribution of nests in surrounding trees. In total, 102 ant species from 389 trees occurred in the primary plot compared with only 50 species from 295 trees in the secondary forest plot. However, there was only a small difference in mean ant richness per tree between primary and secondary forest (3.8 and 3.3 sp. respectively) and considerably lower richness per tree was found only when nests were considered (1.5 sp. in both forests). About half of foraging individuals collected in a tree belonged to species which were not nesting in that tree. Null models showed that the ants foraging but not nesting in a tree are more likely to nest in nearby trees than would be expected at random. The effects of both forest stage and tree size traits were similar regardless of whether only foragers, only nests, or both datasets combined were considered. However, relative abundance distributions of species differed between foraging and nesting communities. The primary forest plot was dominated by native ant species, whereas invasive species were common in secondary forest. This study demonstrates the high contribution of foragers to arboreal ant diversity, indicating an important role of connectivity between trees, and also highlights the importance of primary vegetation for the conservation of native ant communities.

  12. Are There Infinite Irrigation Trees?

    Science.gov (United States)

    Bernot, M.; Caselles, V.; Morel, J. M.

    2006-08-01

    In many natural or artificial flow systems, a fluid flow network succeeds in irrigating every point of a volume from a source. Examples are the blood vessels, the bronchial tree and many irrigation and draining systems. Such systems have raised recently a lot of interest and some attempts have been made to formalize their description, as a finite tree of tubes, and their scaling laws [25], [26]. In contrast, several mathematical models [5], [22], [10], propose an idealization of these irrigation trees, where a countable set of tubes irrigates any point of a volume with positive Lebesgue measure. There is no geometric obstruction to this infinitesimal model and general existence and structure theorems have been proved. As we show, there may instead be an energetic obstruction. Under Poiseuille law R(s) = s -2 for the resistance of tubes with section s, the dissipated power of a volume irrigating tree cannot be finite. In other terms, infinite irrigation trees seem to be impossible from the fluid mechanics viewpoint. This also implies that the usual principle analysis performed for the biological models needs not to impose a minimal size for the tubes of an irrigating tree; the existence of the minimal size can be proven from the only two obvious conditions for such irrigation trees, namely the Kirchhoff and Poiseuille laws.

  13. Maximum Gene-Support Tree

    Directory of Open Access Journals (Sweden)

    Yunfeng Shan

    2008-01-01

    Full Text Available Genomes and genes diversify during evolution; however, it is unclear to what extent genes still retain the relationship among species. Model species for molecular phylogenetic studies include yeasts and viruses whose genomes were sequenced as well as plants that have the fossil-supported true phylogenetic trees available. In this study, we generated single gene trees of seven yeast species as well as single gene trees of nine baculovirus species using all the orthologous genes among the species compared. Homologous genes among seven known plants were used for validation of the finding. Four algorithms—maximum parsimony (MP, minimum evolution (ME, maximum likelihood (ML, and neighbor-joining (NJ—were used. Trees were reconstructed before and after weighting the DNA and protein sequence lengths among genes. Rarely a gene can always generate the “true tree” by all the four algorithms. However, the most frequent gene tree, termed “maximum gene-support tree” (MGS tree, or WMGS tree for the weighted one, in yeasts, baculoviruses, or plants was consistently found to be the “true tree” among the species. The results provide insights into the overall degree of divergence of orthologous genes of the genomes analyzed and suggest the following: 1 The true tree relationship among the species studied is still maintained by the largest group of orthologous genes; 2 There are usually more orthologous genes with higher similarities between genetically closer species than between genetically more distant ones; and 3 The maximum gene-support tree reflects the phylogenetic relationship among species in comparison.

  14. Random clustering ferns for multimodal object recognition

    OpenAIRE

    Villamizar Vergel, Michael Alejandro; Garrell Zulueta, Anais; Sanfeliu Cortés, Alberto; Moreno-Noguer, Francesc

    2017-01-01

    The final publication is available at link.springer.com We propose an efficient and robust method for the recognition of objects exhibiting multiple intra-class modes, where each one is associated with a particular object appearance. The proposed method, called random clustering ferns, combines synergically a single and real-time classifier, based on the boosted assembling of extremely randomized trees (ferns), with an unsupervised and probabilistic approach in order to recognize efficient...

  15. Linking and Cutting Spanning Trees

    Directory of Open Access Journals (Sweden)

    Luís M. S. Russo

    2018-04-01

    Full Text Available We consider the problem of uniformly generating a spanning tree for an undirected connected graph. This process is useful for computing statistics, namely for phylogenetic trees. We describe a Markov chain for producing these trees. For cycle graphs, we prove that this approach significantly outperforms existing algorithms. For general graphs, experimental results show that the chain converges quickly. This yields an efficient algorithm due to the use of proper fast data structures. To obtain the mixing time of the chain we describe a coupling, which we analyze for cycle graphs and simulate for other graphs.

  16. Tree Ordination as Invented Tradition

    Directory of Open Access Journals (Sweden)

    Avery Morrow

    2012-01-01

    Full Text Available The symbolic ordination of trees as monks in Thailand is widely perceived in Western scholarship to be proof of the power of Buddhism to spur ecological thought. However, a closer analysis of tree ordination demonstrates that it is not primarily about Buddhist teaching, but rather is an invented tradition based on the sanctity of Thai Buddhist symbols as well as those of spirit worship and the monarchy. Tree ordinations performed by non-Buddhist minorities in Thailand do not demonstrate a religious commitment but rather a political one.

  17. Multiple-purpose trees for pastoral farming in New Zealand: with emphasis on tree legumes. [Lucerne Tree: Medick Tree

    Energy Technology Data Exchange (ETDEWEB)

    Davies, D J.G.; Macfarlane, R P

    1979-01-01

    The potential for soil conservation and agroforestry of several native and exotic legumes is discussed. Flowering period, chemical composition of leaves/pods, hardiness to frost and drought, timber value, forage potential for livestock and bees, ornamental value and other products are tabulated with information on up to 38 species. Two low-growing species that have proved useful for slope stabilization as well as forage are tree lucerne (Cytisus palmensis) and tree medick (Medicago arborea), the latter being shrubby and more suitable for cold districts. Gleditsia triacanthos is recommended as a shade and fodder tree for farm pasture.

  18. Generalising tree traversals to DAGs

    DEFF Research Database (Denmark)

    Bahr, Patrick; Axelsson, Emil

    2015-01-01

    We present a recursion scheme based on attribute grammars that can be transparently applied to trees and acyclic graphs. Our recursion scheme allows the programmer to implement a tree traversal and then apply it to compact graph representations of trees instead. The resulting graph traversals avoid...... is not sound. Therefore, we complement our implementation of the recursion scheme with a number of correspondence theorems that ensure soundness for various classes of traversals. We illustrate the practical applicability of the implementation as well as the complementing theory with a number of examples....

  19. Tree-growth analyses to estimate tree species' drought tolerance.

    Science.gov (United States)

    Eilmann, Britta; Rigling, Andreas

    2012-02-01

    Climate change is challenging forestry management and practices. Among other things, tree species with the ability to cope with more extreme climate conditions have to be identified. However, while environmental factors may severely limit tree growth or even cause tree death, assessing a tree species' potential for surviving future aggravated environmental conditions is rather demanding. The aim of this study was to find a tree-ring-based method suitable for identifying very drought-tolerant species, particularly potential substitute species for Scots pine (Pinus sylvestris L.) in Valais. In this inner-Alpine valley, Scots pine used to be the dominating species for dry forests, but today it suffers from high drought-induced mortality. We investigate the growth response of two native tree species, Scots pine and European larch (Larix decidua Mill.), and two non-native species, black pine (Pinus nigra Arnold) and Douglas fir (Pseudotsuga menziesii Mirb. var. menziesii), to drought. This involved analysing how the radial increment of these species responded to increasing water shortage (abandonment of irrigation) and to increasingly frequent drought years. Black pine and Douglas fir are able to cope with drought better than Scots pine and larch, as they show relatively high radial growth even after irrigation has been stopped and a plastic growth response to drought years. European larch does not seem to be able to cope with these dry conditions as it lacks the ability to recover from drought years. The analysis of trees' short-term response to extreme climate events seems to be the most promising and suitable method for detecting how tolerant a tree species is towards drought. However, combining all the methods used in this study provides a complete picture of how water shortage could limit species.

  20. TreeCluster: Massively scalable transmission clustering using phylogenetic trees

    OpenAIRE

    Moshiri, Alexander

    2018-01-01

    Background: The ability to infer transmission clusters from molecular data is critical to designing and evaluating viral control strategies. Viral sequencing datasets are growing rapidly, but standard methods of transmission cluster inference do not scale well beyond thousands of sequences. Results: I present TreeCluster, a cross-platform tool that performs transmission cluster inference on a given phylogenetic tree orders of magnitude faster than existing inference methods and supports multi...

  1. Moose?tree interactions: rebrowsing is common across tree species

    OpenAIRE

    Mathisen, Karen Marie; Milner, Jos M.; Skarpe, Christina

    2017-01-01

    Background Plant strategies to resist herbivory include tolerance and avoidance. Tolerance strategies, such as rapid regrowth which increases the palatability of new shoots, can lead to positive feedback loops between plants and herbivores. An example of such a positive feedback occurs when moose (Alces alces) browse trees in boreal forests. We described the degree of change in tree morphology that accumulated over time in response to repeated browsing by moose, using an index of accumulated ...

  2. Resummed tree heptagon

    Science.gov (United States)

    Belitsky, A. V.

    2018-04-01

    The form factor program for the regularized space-time S-matrix in planar maximally supersymmetric gauge theory, known as the pentagon operator product expansion, is formulated in terms of flux-tube excitations propagating on a dual two-dimensional world-sheet, whose dynamics is known exactly as a function of 't Hooft coupling. Both MHV and non-MHV amplitudes are described in a uniform, systematic fashion within this framework, with the difference between the two encoded in coupling-dependent helicity form factors expressed via Zhukowski variables. The nontrivial SU(4) tensor structure of flux-tube transitions is coupling independent and is known for any number of charged excitations from solutions of a system of Watson and Mirror equations. This description allows one to resum the infinite series of form factors and recover the space-time S-matrix exactly in kinematical variables at a given order of perturbation series. Recently, this was done for the hexagon. Presently, we successfully perform resummation for the seven-leg tree NMHV amplitude. To this end, we construct the flux-tube integrands of the fifteen independent Grassmann component of the heptagon with an infinite number of small fermion-antifermion pairs accounted for in NMHV two-channel conformal blocks.

  3. Trees as metal scavengers

    International Nuclear Information System (INIS)

    Hallman, N.

    2000-01-01

    Full text: Tree roots extract metal ions form wet soils in two different ways. At the soil/root hair interface soluble ions in contact with the cellulose wall move through it and enter the cell through the plasmalemma; the semi permeable membrane that encloses every living cell. Some ions, especially those that are part of cellular metabolic processes eg. Na, K, Fe, Mg, S move into the cytoplasm, are bound into organic complexes and travel from cell to cell within the cytoplasm. This requires energy, and the amount of any of these metabolically active ions taken in tends to be regulated by the plant. The movement of the ions from cell to cell is slow, selective, and regulated by requirements of synthesis of for example Mg in the chlorophyll molecule. This means that more Mg is transported to cells of leaves than of cells of roots. This movement of ions is simplistic, or within the cytoplasm. Other ions are swept along in the transpiration stream and enter the complex plumbing system that brings water to the leaves for metabolism and cooling. Water in this apoplastic pathway travels within the pipes (xylem) of the wood and in the cellulose of the walls. It travels along essentially non-living parts of the plant. Ions such as As, Pb, Ni, Cr accumulate in sites such as leaves and bark. Analysis of plant parts can indicate the presence of heavy metals and can give an indication of ore bodies within the root zone

  4. Random Fields

    Science.gov (United States)

    Vanmarcke, Erik

    1983-03-01

    Random variation over space and time is one of the few attributes that might safely be predicted as characterizing almost any given complex system. Random fields or "distributed disorder systems" confront astronomers, physicists, geologists, meteorologists, biologists, and other natural scientists. They appear in the artifacts developed by electrical, mechanical, civil, and other engineers. They even underlie the processes of social and economic change. The purpose of this book is to bring together existing and new methodologies of random field theory and indicate how they can be applied to these diverse areas where a "deterministic treatment is inefficient and conventional statistics insufficient." Many new results and methods are included. After outlining the extent and characteristics of the random field approach, the book reviews the classical theory of multidimensional random processes and introduces basic probability concepts and methods in the random field context. It next gives a concise amount of the second-order analysis of homogeneous random fields, in both the space-time domain and the wave number-frequency domain. This is followed by a chapter on spectral moments and related measures of disorder and on level excursions and extremes of Gaussian and related random fields. After developing a new framework of analysis based on local averages of one-, two-, and n-dimensional processes, the book concludes with a chapter discussing ramifications in the important areas of estimation, prediction, and control. The mathematical prerequisite has been held to basic college-level calculus.

  5. Myocardial Perfusion: Characteristics of Distal Intramyocardial Arteriolar Trees.

    Science.gov (United States)

    Zamir, Mair; Vercnocke, Andrew J; Edwards, Phillip K; Anderson, Jill L; Jorgensen, Steven M; Ritman, Erik L

    2015-11-01

    A combination of experimental, theoretical, and imaging methodologies is used to examine the hierarchical structure and function of intramyocardial arteriolar trees in porcine hearts to provide a window onto a region of myocardial microvasculature which has been difficult to fully explore so far. A total of 66 microvascular trees from 6 isolated myocardial specimens were analyzed, with a cumulative number of 2438 arteriolar branches greater than or equal to 40 μm lumen diameter. The distribution of flow rates within each tree was derived from an assumed power law relationship for that tree between the diameter of vessel segments and flow rates that are consistent with that power law and subject to conservation of mass along hierarchical structure of the tree. The results indicate that the power law index increases at levels of arteriolar vasculature closer to the capillary level, consistent with a concomitant decrease in shear stress acting on endothelial tissue. These results resolve a long standing predicament which could not be resolved previously because of lack of data about the 3D, interconnected, arterioles. In the context of myocardial perfusion, the results indicate that the coefficient of variation of flow rate in pre-capillary distal arterioles is high, suggesting that heterogeneity of flow rate in these arterioles is not entirely random but may be due at least in part to active control.

  6. Time Series of Images to Improve Tree Species Classification

    Science.gov (United States)

    Miyoshi, G. T.; Imai, N. N.; de Moraes, M. V. A.; Tommaselli, A. M. G.; Näsi, R.

    2017-10-01

    Tree species classification provides valuable information to forest monitoring and management. The high floristic variation of the tree species appears as a challenging issue in the tree species classification because the vegetation characteristics changes according to the season. To help to monitor this complex environment, the imaging spectroscopy has been largely applied since the development of miniaturized sensors attached to Unmanned Aerial Vehicles (UAV). Considering the seasonal changes in forests and the higher spectral and spatial resolution acquired with sensors attached to UAV, we present the use of time series of images to classify four tree species. The study area is an Atlantic Forest area located in the western part of São Paulo State. Images were acquired in August 2015 and August 2016, generating three data sets of images: only with the image spectra of 2015; only with the image spectra of 2016; with the layer stacking of images from 2015 and 2016. Four tree species were classified using Spectral angle mapper (SAM), Spectral information divergence (SID) and Random Forest (RF). The results showed that SAM and SID caused an overfitting of the data whereas RF showed better results and the use of the layer stacking improved the classification achieving a kappa coefficient of 18.26 %.

  7. Soil phosphorus heterogeneity promotes tree species diversity and phylogenetic clustering in a tropical seasonal rainforest.

    Science.gov (United States)

    Xu, Wumei; Ci, Xiuqin; Song, Caiyun; He, Tianhua; Zhang, Wenfu; Li, Qiaoming; Li, Jie

    2016-12-01

    The niche theory predicts that environmental heterogeneity and species diversity are positively correlated in tropical forests, whereas the neutral theory suggests that stochastic processes are more important in determining species diversity. This study sought to investigate the effects of soil nutrient (nitrogen and phosphorus) heterogeneity on tree species diversity in the Xishuangbanna tropical seasonal rainforest in southwestern China. Thirty-nine plots of 400 m 2 (20 × 20 m) were randomly located in the Xishuangbanna tropical seasonal rainforest. Within each plot, soil nutrient (nitrogen and phosphorus) availability and heterogeneity, tree species diversity, and community phylogenetic structure were measured. Soil phosphorus heterogeneity and tree species diversity in each plot were positively correlated, while phosphorus availability and tree species diversity were not. The trees in plots with low soil phosphorus heterogeneity were phylogenetically overdispersed, while the phylogenetic structure of trees within the plots became clustered as heterogeneity increased. Neither nitrogen availability nor its heterogeneity was correlated to tree species diversity or the phylogenetic structure of trees within the plots. The interspecific competition in the forest plots with low soil phosphorus heterogeneity could lead to an overdispersed community. However, as heterogeneity increase, more closely related species may be able to coexist together and lead to a clustered community. Our results indicate that soil phosphorus heterogeneity significantly affects tree diversity in the Xishuangbanna tropical seasonal rainforest, suggesting that deterministic processes are dominant in this tropical forest assembly.

  8. The Tree of Industrial Life

    DEFF Research Database (Denmark)

    Andersen, Esben Sloth

    2002-01-01

    The purpose of this paper is to bring forth an interaction between evolutionary economics and industrial systematics. The suggested solution is to reconstruct the "family tree" of the industries. Such a tree is based on similarities, but it may also reflect the evolutionary history in industries....... For this purpose the paper shows how matrices of input-output coefficients can be transformed into binary characteristics matrices and to distance matrices, and it also discusses the possible evolutionary meaning of this translation. Then these derived matrices are used as inputs to algorithms for the heuristic...... finding of optimal industrial trees. The results are presented as taxonomic trees that can easily be compared with the hierarchical structure of existing systems of industrial classification....

  9. Fremont Tree-Well Filter

    Science.gov (United States)

    Information about the SFBWQP Fremont Tree-Well Filter Spine project, part of an EPA competitive grant program to improve SF Bay water quality focused on restoring impaired waters and enhancing aquatic resources.

  10. Algorithms for Decision Tree Construction

    KAUST Repository

    Chikalov, Igor

    2011-01-01

    The study of algorithms for decision tree construction was initiated in 1960s. The first algorithms are based on the separation heuristic [13, 31] that at each step tries dividing the set of objects as evenly as possible. Later Garey and Graham [28] showed that such algorithm may construct decision trees whose average depth is arbitrarily far from the minimum. Hyafil and Rivest in [35] proved NP-hardness of DT problem that is constructing a tree with the minimum average depth for a diagnostic problem over 2-valued information system and uniform probability distribution. Cox et al. in [22] showed that for a two-class problem over information system, even finding the root node attribute for an optimal tree is an NP-hard problem. © Springer-Verlag Berlin Heidelberg 2011.

  11. Visualizing Contour Trees within Histograms

    DEFF Research Database (Denmark)

    Kraus, Martin

    2010-01-01

    Many of the topological features of the isosurfaces of a scalar volume field can be compactly represented by its contour tree. Unfortunately, the contour trees of most real-world volume data sets are too complex to be visualized by dot-and-line diagrams. Therefore, we propose a new visualization...... that is suitable for large contour trees and efficiently conveys the topological structure of the most important isosurface components. This visualization is integrated into a histogram of the volume data; thus, it offers strictly more information than a traditional histogram. We present algorithms...... to automatically compute the graph layout and to calculate appropriate approximations of the contour tree and the surface area of the relevant isosurface components. The benefits of this new visualization are demonstrated with the help of several publicly available volume data sets....

  12. Distance labeling schemes for trees

    DEFF Research Database (Denmark)

    Alstrup, Stephen; Gørtz, Inge Li; Bistrup Halvorsen, Esben

    2016-01-01

    We consider distance labeling schemes for trees: given a tree with n nodes, label the nodes with binary strings such that, given the labels of any two nodes, one can determine, by looking only at the labels, the distance in the tree between the two nodes. A lower bound by Gavoille et al. [Gavoille...... variants such as, for example, small distances in trees [Alstrup et al., SODA, 2003]. We improve the known upper and lower bounds of exact distance labeling by showing that 1/4 log2(n) bits are needed and that 1/2 log2(n) bits are sufficient. We also give (1 + ε)-stretch labeling schemes using Theta...

  13. Design of Probabilistic Random Forests with Applications to Anticancer Drug Sensitivity Prediction.

    Science.gov (United States)

    Rahman, Raziur; Haider, Saad; Ghosh, Souparno; Pal, Ranadip

    2015-01-01

    Random forests consisting of an ensemble of regression trees with equal weights are frequently used for design of predictive models. In this article, we consider an extension of the methodology by representing the regression trees in the form of probabilistic trees and analyzing the nature of heteroscedasticity. The probabilistic tree representation allows for analytical computation of confidence intervals (CIs), and the tree weight optimization is expected to provide stricter CIs with comparable performance in mean error. We approached the ensemble of probabilistic trees' prediction from the perspectives of a mixture distribution and as a weighted sum of correlated random variables. We applied our methodology to the drug sensitivity prediction problem on synthetic and cancer cell line encyclopedia dataset and illustrated that tree weights can be selected to reduce the average length of the CI without increase in mean error.

  14. Generic physical protection logic trees

    International Nuclear Information System (INIS)

    Paulus, W.K.

    1981-10-01

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

  15. Border trees of complex networks

    International Nuclear Information System (INIS)

    Villas Boas, Paulino R; Rodrigues, Francisco A; Travieso, Gonzalo; Fontoura Costa, Luciano da

    2008-01-01

    The comprehensive characterization of the structure of complex networks is essential to understand the dynamical processes which guide their evolution. The discovery of the scale-free distribution and the small-world properties of real networks were fundamental to stimulate more realistic models and to understand important dynamical processes related to network growth. However, the properties of the network borders (nodes with degree equal to 1), one of its most fragile parts, remained little investigated and understood. The border nodes may be involved in the evolution of structures such as geographical networks. Here we analyze the border trees of complex networks, which are defined as the subgraphs without cycles connected to the remainder of the network (containing cycles) and terminating into border nodes. In addition to describing an algorithm for identification of such tree subgraphs, we also consider how their topological properties can be quantified in terms of their depth and number of leaves. We investigate the properties of border trees for several theoretical models as well as real-world networks. Among the obtained results, we found that more than half of the nodes of some real-world networks belong to the border trees. A power-law with cut-off was observed for the distribution of the depth and number of leaves of the border trees. An analysis of the local role of the nodes in the border trees was also performed

  16. Generic physical protection logic trees

    Energy Technology Data Exchange (ETDEWEB)

    Paulus, W.K.

    1981-10-01

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

  17. Objective consensus from decision trees

    International Nuclear Information System (INIS)

    Putora, Paul Martin; Panje, Cedric M; Papachristofilou, Alexandros; Pra, Alan Dal; Hundsberger, Thomas; Plasswilm, Ludwig

    2014-01-01

    Consensus-based approaches provide an alternative to evidence-based decision making, especially in situations where high-level evidence is limited. Our aim was to demonstrate a novel source of information, objective consensus based on recommendations in decision tree format from multiple sources. Based on nine sample recommendations in decision tree format a representative analysis was performed. The most common (mode) recommendations for each eventuality (each permutation of parameters) were determined. The same procedure was applied to real clinical recommendations for primary radiotherapy for prostate cancer. Data was collected from 16 radiation oncology centres, converted into decision tree format and analyzed in order to determine the objective consensus. Based on information from multiple sources in decision tree format, treatment recommendations can be assessed for every parameter combination. An objective consensus can be determined by means of mode recommendations without compromise or confrontation among the parties. In the clinical example involving prostate cancer therapy, three parameters were used with two cut-off values each (Gleason score, PSA, T-stage) resulting in a total of 27 possible combinations per decision tree. Despite significant variations among the recommendations, a mode recommendation could be found for specific combinations of parameters. Recommendations represented as decision trees can serve as a basis for objective consensus among multiple parties

  18. Objective consensus from decision trees.

    Science.gov (United States)

    Putora, Paul Martin; Panje, Cedric M; Papachristofilou, Alexandros; Dal Pra, Alan; Hundsberger, Thomas; Plasswilm, Ludwig

    2014-12-05

    Consensus-based approaches provide an alternative to evidence-based decision making, especially in situations where high-level evidence is limited. Our aim was to demonstrate a novel source of information, objective consensus based on recommendations in decision tree format from multiple sources. Based on nine sample recommendations in decision tree format a representative analysis was performed. The most common (mode) recommendations for each eventuality (each permutation of parameters) were determined. The same procedure was applied to real clinical recommendations for primary radiotherapy for prostate cancer. Data was collected from 16 radiation oncology centres, converted into decision tree format and analyzed in order to determine the objective consensus. Based on information from multiple sources in decision tree format, treatment recommendations can be assessed for every parameter combination. An objective consensus can be determined by means of mode recommendations without compromise or confrontation among the parties. In the clinical example involving prostate cancer therapy, three parameters were used with two cut-off values each (Gleason score, PSA, T-stage) resulting in a total of 27 possible combinations per decision tree. Despite significant variations among the recommendations, a mode recommendation could be found for specific combinations of parameters. Recommendations represented as decision trees can serve as a basis for objective consensus among multiple parties.

  19. Longest common extensions in trees

    DEFF Research Database (Denmark)

    Bille, Philip; Gawrychowski, Pawel; Gørtz, Inge Li

    2016-01-01

    to trees and suggest a few applications of LCE in trees to tries and XML databases. Given a labeled and rooted tree T of size n, the goal is to preprocess T into a compact data structure that support the following LCE queries between subpaths and subtrees in T. Let v1, v2, w1, and w2 be nodes of T...... such that w1 and w2 are descendants of v1 and v2 respectively. - LCEPP(v1, w1, v2, w2): (path-path LCE) return the longest common prefix of the paths v1 ~→ w1 and v2 ~→ w2. - LCEPT(v1, w1, v2): (path-tree LCE) return maximal path-path LCE of the path v1 ~→ w1 and any path from v2 to a descendant leaf. - LCETT......(v1, v2): (tree-tree LCE) return a maximal path-path LCE of any pair of paths from v1 and v2 to descendant leaves. We present the first non-trivial bounds for supporting these queries. For LCEPP queries, we present a linear-space solution with O(log* n) query time. For LCEPT queries, we present...

  20. Longest Common Extensions in Trees

    DEFF Research Database (Denmark)

    Bille, Philip; Gawrychowski, Pawel; Gørtz, Inge Li

    2015-01-01

    to trees and suggest a few applications of LCE in trees to tries and XML databases. Given a labeled and rooted tree T of size n, the goal is to preprocess T into a compact data structure that support the following LCE queries between subpaths and subtrees in T. Let v1, v2, w1, and w2 be nodes of T...... such that w1 and w2 are descendants of v1 and v2 respectively. - LCEPP(v1, w1, v2, w2): (path-path LCE) return the longest common prefix of the paths v1 ~→ w1 and v2 ~→ w2. - LCEPT(v1, w1, v2): (path-tree LCE) return maximal path-path LCE of the path v1 ~→ w1 and any path from v2 to a descendant leaf. - LCETT......(v1, v2): (tree-tree LCE) return a maximal path-path LCE of any pair of paths from v1 and v2 to descendant leaves. We present the first non-trivial bounds for supporting these queries. For LCEPP queries, we present a linear-space solution with O(log* n) query time. For LCEPT queries, we present...

  1. Entropy lower bounds of quantum decision tree complexity

    OpenAIRE

    Shi, Yaoyun

    2000-01-01

    We prove a general lower bound of quantum decision tree complexity in terms of some entropy notion. We regard the computation as a communication process in which the oracle and the computer exchange several rounds of messages, each round consisting of O(log(n)) bits. Let E(f) be the Shannon entropy of the random variable f(X), where X is uniformly random in f's domain. Our main result is that it takes \\Omega(E(f)) queries to compute any \\emph{total} function f. It is interesting to contrast t...

  2. Predicting membrane protein types using various decision tree classifiers based on various modes of general PseAAC for imbalanced datasets.

    Science.gov (United States)

    Sankari, E Siva; Manimegalai, D

    2017-12-21

    Predicting membrane protein types is an important and challenging research area in bioinformatics and proteomics. Traditional biophysical methods are used to classify membrane protein types. Due to large exploration of uncharacterized protein sequences in databases, traditional methods are very time consuming, expensive and susceptible to errors. Hence, it is highly desirable to develop a robust, reliable, and efficient method to predict membrane protein types. Imbalanced datasets and large datasets are often handled well by decision tree classifiers. Since imbalanced datasets are taken, the performance of various decision tree classifiers such as Decision Tree (DT), Classification And Regression Tree (CART), C4.5, Random tree, REP (Reduced Error Pruning) tree, ensemble methods such as Adaboost, RUS (Random Under Sampling) boost, Rotation forest and Random forest are analysed. Among the various decision tree classifiers Random forest performs well in less time with good accuracy of 96.35%. Another inference is RUS boost decision tree classifier is able to classify one or two samples in the class with very less samples while the other classifiers such as DT, Adaboost, Rotation forest and Random forest are not sensitive for the classes with fewer samples. Also the performance of decision tree classifiers is compared with SVM (Support Vector Machine) and Naive Bayes classifier. Copyright © 2017 Elsevier Ltd. All rights reserved.

  3. Factors that influence Christmas tree sales

    Science.gov (United States)

    Thomas H. Pendleton; Lawrence D. Garrett

    1970-01-01

    An analysis of the metropolitan Christmas tree market in Winston-Salem, N. C., shows that to sell more trees, Christmas tree retailers should locate their lots on heavily traveled streets in business areas, have adequate parking facilities, advertise, and have attractive displays of trees. Retailers who follow these practices can expect to receive higher prices for...

  4. Critical wind speed at which trees break

    Science.gov (United States)

    Virot, E.; Ponomarenko, A.; Dehandschoewercker, É.; Quéré, D.; Clanet, C.

    2016-02-01

    Data from storms suggest that the critical wind speed at which trees break is constant (≃42 m /s ), regardless of tree characteristics. We question the physical origin of this observation both experimentally and theoretically. By combining Hooke's law, Griffith's criterion, and tree allometry, we show that the critical wind speed indeed hardly depends on the height, diameter, and elastic properties of trees.

  5. Field guide to red tree vole nests

    Science.gov (United States)

    Damon B. Lesmeister; James K. Swingle

    2017-01-01

    Surveys for red tree vole (Arborimus longicaudus) nests require tree climbing because the species is a highly specialized arboreal rodent that live in the tree canopy of coniferous forests in western Oregon and northwestern California. Tree voles are associated with old coniferous forest (≥80 years old) that are structurally complex, but are often...

  6. Mitered fractal trees: constructions and properties

    NARCIS (Netherlands)

    Verhoeff, T.; Verhoeff, K.; Bosch, R.; McKenna, D.; Sarhangi, R.

    2012-01-01

    Tree-like structures, that is, branching structures without cycles, are attractive for artful expression. Especially interesting are fractal trees, where each subtree is a scaled and possibly otherwise transformed version of the entire tree. Such trees can be rendered in 3D by using beams with a

  7. Critical wind speed at which trees break.

    Science.gov (United States)

    Virot, E; Ponomarenko, A; Dehandschoewercker, É; Quéré, D; Clanet, C

    2016-02-01

    Data from storms suggest that the critical wind speed at which trees break is constant (≃42m/s), regardless of tree characteristics. We question the physical origin of this observation both experimentally and theoretically. By combining Hooke's law, Griffith's criterion, and tree allometry, we show that the critical wind speed indeed hardly depends on the height, diameter, and elastic properties of trees.

  8. Microwave sensing of tree trunks

    Science.gov (United States)

    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

  9. Lesser prairie-chicken avoidance of trees in a grassland landscape

    Science.gov (United States)

    Lautenbach, Joseph M.; Plumb, Reid T.; Robinson, Samantha G.; Hagen, Christian A.; Haukos, David A.; Pitman, James C.

    2016-01-01

    Grasslands are among the most imperiled ecosystems in North America. Reasons that grasslands are threatened include conversion to row-crop agriculture, fragmentation, and changes in fire regimes. The reduction of fire processes in remaining prairies has resulted in tree encroachment and establishment in grasslands, further reducing grassland quantity and quality. Grassland birds have been experiencing precipitous population declines in recent decades, commensurate with landscape changes to grasslands. The lesser prairie-chicken (Tympanuchus pallidicinctus Ridgway) is a declining species of prairie grouse of conservation concern. We used second- and third-order habitat selection metrics to test if female lesser prairie-chickens avoid grasslands where trees were present. Our results indicated that female lesser prairie-chickens selected habitats avoiding the nearest trees by 283 m on average, nearly twice as far as would be expected at random. Lesser prairie-chickens were 40 times more likely to use habitats with tree densities of 0 trees ∙ ha− 1 than habitats with 5 trees ∙ ha− 1. Probability of use indicated that lesser prairie-chickens were 19 times more likely to use habitats 1000 m from the nearest tree when compared with using habitats 0 m from the nearest tree. Nest survival was not affected at densities 2 trees ∙ ha− 1. Avoidance of trees could be due to perceived increased predation risk, reduced habitat quality, or a combination of these potentially confounding factors. Preventing further establishment and expansion of trees in landscapes occupied by lesser prairie-chickens could contribute to the continued persistence of the species. Additionally, restoring grasslands through tree removal may facilitate conservation efforts for grassland species such as the lesser prairie-chicken by improving habitat quality and promoting expansion of occupied range.

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

    Science.gov (United States)

    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

  11. Colourings of (k-r,k-trees

    Directory of Open Access Journals (Sweden)

    M. Borowiecki

    2017-01-01

    Full Text Available Trees are generalized to a special kind of higher dimensional complexes known as \\((j,k\\-trees ([L. W. Beineke, R. E. Pippert, On the structure of \\((m,n\\-trees, Proc. 8th S-E Conf. Combinatorics, Graph Theory and Computing, 1977, 75-80], and which are a natural extension of \\(k\\-trees for \\(j=k-1\\. The aim of this paper is to study\\((k-r,k\\-trees ([H. P. Patil, Studies on \\(k\\-trees and some related topics, PhD Thesis, University of Warsaw, Poland, 1984], which are a generalization of \\(k\\-trees (or usual trees when \\(k=1\\. We obtain the chromatic polynomial of \\((k-r,k\\-trees and show that any two \\((k-r,k\\-trees of the same order are chromatically equivalent. However, if \\(r\

  12. A bicriterion Steiner tree problem on graph

    Directory of Open Access Journals (Sweden)

    Vujošević Mirko B.

    2003-01-01

    Full Text Available This paper presents a formulation of bicriterion Steiner tree problem which is stated as a task of finding a Steiner tree with maximal capacity and minimal length. It is considered as a lexicographic multicriteria problem. This means that the bottleneck Steiner tree problem is solved first. After that, the next optimization problem is stated as a classical minimums Steiner tree problem under the constraint on capacity of the tree. The paper also presents some computational experiments with the multicriteria problem.

  13. Tree Notation: an antifragile program notation

    OpenAIRE

    Yunits, Breck

    2017-01-01

    This paper presents Tree Notation, a new simple, universal syntax. Language designers can invent new programming languages, called Tree Languages, on top of Tree Notation. Tree Languages have a number of advantages over traditional programming languages. We include a Visual Abstract to succinctly display the problem and discovery. Then we describe the problem--the BNF to abstract syntax tree (AST) parse step--and introduce the novel solution we discovered: a new family of 2D programming langu...

  14. Short Tree, Long Tree, Right Tree, Wrong Tree: New Acquisition Bias Corrections for Inferring SNP Phylogenies.

    Science.gov (United States)

    Leaché, Adam D; Banbury, Barbara L; Felsenstein, Joseph; de Oca, Adrián Nieto-Montes; Stamatakis, Alexandros

    2015-11-01

    Single nucleotide polymorphisms (SNPs) are useful markers for phylogenetic studies owing in part to their ubiquity throughout the genome and ease of collection. Restriction site associated DNA sequencing (RADseq) methods are becoming increasingly popular for SNP data collection, but an assessment of the best practises for using these data in phylogenetics is lacking. We use computer simulations, and new double digest RADseq (ddRADseq) data for the lizard family Phrynosomatidae, to investigate the accuracy of RAD loci for phylogenetic inference. We compare the two primary ways RAD loci are used during phylogenetic analysis, including the analysis of full sequences (i.e., SNPs together with invariant sites), or the analysis of SNPs on their own after excluding invariant sites. We find that using full sequences rather than just SNPs is preferable from the perspectives of branch length and topological accuracy, but not of computational time. We introduce two new acquisition bias corrections for dealing with alignments composed exclusively of SNPs, a conditional likelihood method and a reconstituted DNA approach. The conditional likelihood method conditions on the presence of variable characters only (the number of invariant sites that are unsampled but known to exist is not considered), while the reconstituted DNA approach requires the user to specify the exact number of unsampled invariant sites prior to the analysis. Under simulation, branch length biases increase with the amount of missing data for both acquisition bias correction methods, but branch length accuracy is much improved in the reconstituted DNA approach compared to the conditional likelihood approach. Phylogenetic analyses of the empirical data using concatenation or a coalescent-based species tree approach provide strong support for many of the accepted relationships among phrynosomatid lizards, suggesting that RAD loci contain useful phylogenetic signal across a range of divergence times despite the

  15. Nutrient removal by apple, pear and cherry nursery trees

    Directory of Open Access Journals (Sweden)

    Giovambattista Sorrenti

    2017-06-01

    Full Text Available Given that nursery is a peculiar environment, the amount of nutrients removed by nursery trees represents a fundamental acquisition to optimise fertilisation strategies, with economic and environmental implications. In this context, we determined nutrient removal by apple, pear and cherry nursery trees at the end of the nursery growing cycle. We randomly removed 5 leafless apple (Golden Delicious/EMLA M9; density of 30,000 trees ha–1, pear (Santa Maria/Adams; density of 30,000 trees ha–1 and cherry (AlexTM/Gisela 6®; density of 40,000 trees ha–1 trees from a commercial nursery. Trees were divided into roots (below the root collar, rootstock (above-ground wood between root collar and grafting point and variety (1-year-old wood above the grafting point. For each organ we determined biomass, macro- (N, P, K, Ca, Mg, S, and micro- (Fe, Mn, Zn, Cu, and B nutrient concentration. Pear trees were the most developed (650 g (dw tree–1, equal to 1.75 and 2.78 folds than apple and cherry trees, respectively whereas, independently of the species, variety mostly contributed (>50% to the total tree biomass, followed by roots and then above-ground rootstock. However, the dry biomass and nutrient amount measured in rootstocks (including roots represent the cumulative amount of 2 and 3 seasons, for Gisela® 6 (tissue culture and pome fruit species (generated by mound layering, respectively. Macro and micronutrients were mostly concentrated in roots, followed by variety and rootstock, irrespective of the species. Independently of the tissue, macronutrients concentration hierarchy was N>Ca>K> P>Mg>S. Removed N by whole tree accounted for 6.58, 3.53 and 2.49 g tree–1 for pear, apple and cherry, respectively, corresponding to almost 200, 107 and 100 kg N ha–1, respectively. High amounts of K and Ca were used by pear (130-140 kg ha–1 and apple trees (~50 and 130 kg ha–1 of K and Ca, respectively, while ~25 kg K ha–1 and 55 kg Ca ha–1 were

  16. Evolving Random Forest for Preference Learning

    DEFF Research Database (Denmark)

    Abou-Zleikha, Mohamed; Shaker, Noor

    2015-01-01

    This paper introduces a novel approach for pairwise preference learning through a combination of an evolutionary method and random forest. Grammatical evolution is used to describe the structure of the trees in the Random Forest (RF) and to handle the process of evolution. Evolved random forests ...... obtained for predicting pairwise self-reports of users for the three emotional states engagement, frustration and challenge show very promising results that are comparable and in some cases superior to those obtained from state-of-the-art methods....

  17. Utilization of nitrogen fixing trees

    Energy Technology Data Exchange (ETDEWEB)

    Brewbaker, J.L.; Beldt, R. van den; MacDicken, K.; Budowski, G.; Kass, D.C.L.; Russo, R.O.; Escalante, G.; Herrera, R.; Aranguren, J.; Arkcoll, D.B.; Doebereinger, J. (cord.)

    1983-01-01

    Six papers from the symposium are noted. Brewbaker, J.L., Beldt, R. van den, MacDicken, K. Fuelwood uses and properties of nitrogen-fixing trees, pp 193-204, (Refs. 15). Includes a list of 35 nitrogen-fixing trees of high fuelwood value. Budowski, G.; Kass, D.C.L.; Russo, R.O. Leguminous trees for shade, pp 205-222, (Refs. 68). Escalante, G., Herrera, R., Aranguren, J.; Nitrogen fixation in shade trees (Erythrina poeppigiana) in cocoa plantations in northern Venezuela, pp 223-230, (Refs. 13). Arkcoll, D.B.; Some leguminous trees providing useful fruits in the North of Brazil, pp 235-239, (Refs. 13). This paper deals with Parkia platycephala, Pentaclethra macroloba, Swartzia sp., Cassia leiandra, Hymenaea courbaril, dipteryz odorata, Inga edulis, I. macrophylla, and I. cinnamonea. Baggio, A.J.; Possibilities of the use of Gliricidia sepium in agroforestry systems in Brazil, pp 241-243; (Refs. 15). Seiffert, N.F.; Biological nitrogen and protein production of Leucaena cultivars grown to supplement the nutrition of ruminants, pp 245-249, (Refs. 14). Leucaena leucocephala cv. Peru, L. campina grande (L. leucocephala), and L. cunningham (L. leucocephalae) were promising for use as browse by beef cattle in central Brazil.

  18. Isoprene emission from Indian trees

    Science.gov (United States)

    Varshney, C. K.; Singh, Abhai Pratap

    2003-12-01

    Isoprene is the most dominant non-methane volatile organic compound (NMVOC) emitted by plants. NMVOCs play an important role in regulating the composition of atmospheric trace gases including global concentration of tropospheric ozone. Our present knowledge about NMVOCs emission is mainly from studies on temperate tree species. So far information on biogenic NMVOCs emission from tropical tree species is limited. In this study, isoprene emission rates from 40 tropical Indian tree species belonging to 33 genera and 17 families were measured for the first time using a dynamic flow through enclosure chamber technique. The isoprene emission rate from plants (30°C and PAR 1000 μmolm-2s-1) ranged from undetectable to 81.5 μg g-1 h-1 and values were found to be comparable with other studies on tropical tree species. Tree species screened for isoprene emission in the present study may be grouped into the four categories, proposed by [2001], namely, 18 species were negligible or BDL isoprene emitting (Morus alba Linn., which were earlier reported as BDL or non isoprene emitters in US [, 1998; , 2001] were found to be appreciably high isoprene emitters (0.61-21.60 μg g-1 h-1) in the present study.

  19. Automated Generation of Attack Trees

    DEFF Research Database (Denmark)

    Vigo, Roberto; Nielson, Flemming; Nielson, Hanne Riis

    2014-01-01

    Attack trees are widely used to represent threat scenarios in a succinct and intuitive manner, suitable for conveying security information to non-experts. The manual construction of such objects relies on the creativity and experience of specialists, and therefore it is error-prone and impractica......Attack trees are widely used to represent threat scenarios in a succinct and intuitive manner, suitable for conveying security information to non-experts. The manual construction of such objects relies on the creativity and experience of specialists, and therefore it is error......-prone and impracticable for large systems. Nonetheless, the automated generation of attack trees has only been explored in connection to computer networks and levering rich models, whose analysis typically leads to an exponential blow-up of the state space. We propose a static analysis approach where attack trees...... are automatically inferred from a process algebraic specification in a syntax-directed fashion, encompassing a great many application domains and avoiding incurring systematically an exponential explosion. Moreover, we show how the standard propositional denotation of an attack tree can be used to phrase...

  20. Drawing Contour Trees in the Plane.

    Science.gov (United States)

    Heine, C; Schneider, D; Carr, Hamish; Scheuermann, G

    2011-11-01

    The contour tree compactly describes scalar field topology. From the viewpoint of graph drawing, it is a tree with attributes at vertices and optionally on edges. Standard tree drawing algorithms emphasize structural properties of the tree and neglect the attributes. Applying known techniques to convey this information proves hard and sometimes even impossible. We present several adaptions of popular graph drawing approaches to the problem of contour tree drawing and evaluate them. We identify five esthetic criteria for drawing contour trees and present a novel algorithm for drawing contour trees in the plane that satisfies four of these criteria. Our implementation is fast and effective for contour tree sizes usually used in interactive systems (around 100 branches) and also produces readable pictures for larger trees, as is shown for an 800 branch example.

  1. Totally optimal decision trees for Boolean functions

    KAUST Repository

    Chikalov, Igor

    2016-07-28

    We study decision trees which are totally optimal relative to different sets of complexity parameters for Boolean functions. A totally optimal tree is an optimal tree relative to each parameter from the set simultaneously. We consider the parameters characterizing both time (in the worst- and average-case) and space complexity of decision trees, i.e., depth, total path length (average depth), and number of nodes. We have created tools based on extensions of dynamic programming to study totally optimal trees. These tools are applicable to both exact and approximate decision trees, and allow us to make multi-stage optimization of decision trees relative to different parameters and to count the number of optimal trees. Based on the experimental results we have formulated the following hypotheses (and subsequently proved): for almost all Boolean functions there exist totally optimal decision trees (i) relative to the depth and number of nodes, and (ii) relative to the depth and average depth.

  2. Integrated fault tree development environment

    International Nuclear Information System (INIS)

    Dixon, B.W.

    1986-01-01

    Probabilistic Risk Assessment (PRA) techniques are utilized in the nuclear industry to perform safety analyses of complex defense-in-depth systems. A major effort in PRA development is fault tree construction. The Integrated Fault Tree Environment (IFTREE) is an interactive, graphics-based tool for fault tree design. IFTREE provides integrated building, editing, and analysis features on a personal workstation. The design philosophy of IFTREE is presented, and the interface is described. IFTREE utilizes a unique rule-based solution algorithm founded in artificial intelligence (AI) techniques. The impact of the AI approach on the program design is stressed. IFTREE has been developed to handle the design and maintenance of full-size living PRAs and is currently in use

  3. Detecting treatment-subgroup interactions in clustered data with generalized linear mixed-effects model trees.

    Science.gov (United States)

    Fokkema, M; Smits, N; Zeileis, A; Hothorn, T; Kelderman, H

    2017-10-25

    Identification of subgroups of patients for whom treatment A is more effective than treatment B, and vice versa, is of key importance to the development of personalized medicine. Tree-based algorithms are helpful tools for the detection of such interactions, but none of the available algorithms allow for taking into account clustered or nested dataset structures, which are particularly common in psychological research. Therefore, we propose the generalized linear mixed-effects model tree (GLMM tree) algorithm, which allows for the detection of treatment-subgroup interactions, while accounting for the clustered structure of a dataset. The algorithm uses model-based recursive partitioning to detect treatment-subgroup interactions, and a GLMM to estimate the random-effects parameters. In a simulation study, GLMM trees show higher accuracy in recovering treatment-subgroup interactions, higher predictive accuracy, and lower type II error rates than linear-model-based recursive partitioning and mixed-effects regression trees. Also, GLMM trees show somewhat higher predictive accuracy than linear mixed-effects models with pre-specified interaction effects, on average. We illustrate the application of GLMM trees on an individual patient-level data meta-analysis on treatments for depression. We conclude that GLMM trees are a promising exploratory tool for the detection of treatment-subgroup interactions in clustered datasets.

  4. Ecosystem Service of Shade Trees on Nutrient Cycling and Productivity of Coffee Agro-ecosystems

    Directory of Open Access Journals (Sweden)

    Rusdi Evizal

    2009-05-01

    Full Text Available Shade trees are significant in certification scheme of sustainable coffee production. They play an importance role on ecosystem functioning. This research is aimed to study ecosystem service of shade trees in some coffee agro-ecosystems particularly on nutrient cycling and land productivity. Four agro-ecosys tems of Robusta coffee (Coffea canephora, namely sun coffee (without shade trees, coffee shaded by Michelia champaca, coffee shaded by Gliricidia sepium, and coffee shaded by Erythrina indica are evaluated during 2007—2008. Smallholder coffee plantation in Sumberjaya Subdistrict, West Lampung, which managed under local standard were employed using Randomized Complete Block Design with 3 replications. The result showed that litter fall dynamic from shade trees and from coffee trees was influenced by rainfall. Shade trees decreased weed biomass while increased litter fall production. In dry season, shade trees decreased litter fall from coffee shaded by M. champaca. G. sepium and E. indica shaded coffee showed higher yield than sun coffee and M. champaca shaded coffee. Except for M. champaca shaded coffee, yield had positive correlation (r = 0.99 with litter fall production and had negative correlation (r = —0.82 with weed biomass production. Biomass production (litter fall + weed of sun coffee and shaded coffee was not significantly different. Litter fall of shade trees had significance on nutrient cycle mainly to balance the lost of nitrogen in coffee bean harvesting.Key Words: Coffea canephora, Michelia champaca, Gliricidia sepium, Erythrina indica, litter production, nutrient cycle, coffee yield.

  5. Spatial Distribution and Site-Specific Spraying of Main Sucking Pests of Elm Trees.

    Science.gov (United States)

    Karimzadeh, R; Iranipour, S

    2017-06-01

    Elm trees are important landscape trees and sucking insects weaken the elm trees and produce large amounts of honeydew. The main objectives of this study were to identify main honeydew-producing pests of elm trees and do site-specific spraying against these pests. To map the spatial distribution of the sucking pests in the large scale, the study area was divided into 40 × 40 m grids and one tree was chosen randomly from each grid (a total of 55 trees). These trees were sampled twice a year in 2011 and 2012. Each sample was a 30-cm branch terminal. Eight samples were taken from each tree in four cardinal directions and two canopy levels. The number of sucking insects and leaves of each sample were counted and recorded. Spatial analysis of the data was carried out using geostatistics. Kriging was used for producing prediction maps. Insecticide application was restricted to the regions with populations higher than threshold. To identify within-tree distribution of the honeydew-producing pests, six and four elm trees were chosen in 2011 and 2012 respectively, and sampled weekly. These trees were sampled as described previously. European elm scale (EES), Gossyparia spuria (Modeer) and two species of aphids were the dominant honeydew-producing pests. The results revealed that the effects of direction, canopy level and their interactions on insect populations were not statistically significant (P < 0.05). Site-specific spraying decreased the amount of insecticides used by ca. 20%, while satisfactory control of the sucking pests and honeydew excretion was obtained. Considering the environmental and economic benefits of site-specific spraying, it is worth doing more complementary works in this area.

  6. Arquitectura de los árboles Tree architecture

    Directory of Open Access Journals (Sweden)

    Francis Hallé

    2010-12-01

    Full Text Available La forma de la copa nunca es aleatoria; cada árbol tiene su programa específico de desarrollo, controlado por genes, desde la germinación. La forma del árbol adulto puede ser modificada por factores ecológicos, pero siempre persisten las reglas de desarrollo; analizar estas reglas es el objetivo de la arquitectura. Llamaré «modelo arquitectural» al programa genético de crecimiento y desarrollo que aparece en un árbol joven. De los 22 modelos actualmente reconocidos, presentaré los cinco más comunes. Cuando el modelo tiene una expresión única, permaneciendo durante toda la vida, el árbol es «unitario»; estos árboles unitarios son arcaicos. El concepto de «reiteración» es clave para entender lo que es un árbol: este mecanismo transforma el árbol en una colonia; los «árboles reiterados» (AR crecen los unos encima de los otros, tal como parásitos. La reiteración da a luz un árbol entero, con tronco, ramas y raíces. Un AR todavía joven crece verticalmente; luego, con la plasticidad de la madera y la palanca, se inclina y se vuelve horizontal, lo que es eficaz para capturar la luz. Fue importante el descubrimiento, dentro de una misma copa, de variaciones genéticas de un AR al otro: en varias especies, el árbol es una colonia de genomas.Trees never have a random crown form; each tree has its specific developmental program, controlled by genes, since its germination. The form of the adult tree may be modified by ecological factors but developmental rules are ever lasting; analyzing these rules is the objective of architecture. The genetic program of growth and development of a young tree will be referred to as «architectural model». The five most common out of the 22 architectural models so far recognized will be presented. Whenever a model has a unique expression that persists during the whole life of a tree, the tree is called «unitary»; these unitary trees are ancient. The concept of «reiteration» is key to

  7. Interpreting the universal phylogenetic tree

    Science.gov (United States)

    Woese, C. R.

    2000-01-01

    The universal phylogenetic tree not only spans all extant life, but its root and earliest branchings represent stages in the evolutionary process before modern cell types had come into being. The evolution of the cell is an interplay between vertically derived and horizontally acquired variation. Primitive cellular entities were necessarily simpler and more modular in design than are modern cells. Consequently, horizontal gene transfer early on was pervasive, dominating the evolutionary dynamic. The root of the universal phylogenetic tree represents the first stage in cellular evolution when the evolving cell became sufficiently integrated and stable to the erosive effects of horizontal gene transfer that true organismal lineages could exist.

  8. Columnar apple tree named 'Moonlight'

    OpenAIRE

    Tupý, J. (Jaroslav); Louda, O. (Otto); Zima, J. (Jan)

    2010-01-01

    A new and distinct Malus domestica (Borkh.) apple tree variety is provided which exhibits a columnar tree type, weakly vigorous compact growth, predominant bearing on spurs and V.sub.f-resistance against scab. The new variety yields late maturing, medium-sized, globose-conical to conical fruits having good storage quality. The fruit color is yellow-green to yellow with a partial red to orange blush. The fruits have a yellow-colored firm flesh that is crisp and juicy with a good sweet/sour bal...

  9. Interpreting CNNs via Decision Trees

    OpenAIRE

    Zhang, Quanshi; Yang, Yu; Wu, Ying Nian; Zhu, Song-Chun

    2018-01-01

    This paper presents a method to learn a decision tree to quantitatively explain the logic of each prediction of a pre-trained convolutional neural networks (CNNs). Our method boosts the following two aspects of network interpretability. 1) In the CNN, each filter in a high conv-layer must represent a specific object part, instead of describing mixed patterns without clear meanings. 2) People can explain each specific prediction made by the CNN at the semantic level using a decision tree, i.e....

  10. Random magnetism

    International Nuclear Information System (INIS)

    Tsallis, C.

    1980-03-01

    The 'ingredients' which control a phase transition in well defined system as well as in random ones (e.g. random magnetic systems) are listed and discussed within a somehow unifying perspective. Among these 'ingredients' we find the couplings and elements responsible for the cooperative phenomenon, the topological connectivity as well as possible topological incompatibilities, the influence of new degrees of freedom, the order parameter dimensionality, the ground state degeneracy and finally the 'quanticity' of the system. The general trends, though illustrated in magnetic systems, essentially hold for all phase transitions, and give a basis for connection of this area with Field theory, Theory of dynamical systems, etc. (Author) [pt

  11. Random magnetism

    International Nuclear Information System (INIS)

    Tsallis, C.

    1981-01-01

    The 'ingredients' which control a phase transition in well defined systems as well as in random ones (e.q. random magnetic systems) are listed and discussed within a somehow unifying perspective. Among these 'ingredients' the couplings and elements responsible for the cooperative phenomenon, the topological connectivity as well as possible topological incompatibilities, the influence of new degrees of freedom, the order parameter dimensionality, the ground state degeneracy and finally the 'quanticity' of the system are found. The general trends, though illustrated in magnetic systems, essentially hold for all phase transitions, and give a basis for connection of this area with Field theory, Theory of dynamical systems, etc. (Author) [pt

  12. Usefulness of problem tree, objective tree and logical framework ...

    African Journals Online (AJOL)

    The discussion has led to the conclusion that higher learning institutions are not adequately preparing graduates to face the increasing labor market demands in terms of skills and competitiveness. Having outlined the roots of the problem through the problem tree, the researchers proposed potential strategies to handle the ...

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

    Science.gov (United States)

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

  14. Water Transport in Trees--An Artificial Laboratory Tree

    Science.gov (United States)

    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…

  15. Edge-Disjoint Fibonacci Trees in Hypercube

    Directory of Open Access Journals (Sweden)

    Indhumathi Raman

    2014-01-01

    Full Text Available The Fibonacci tree is a rooted binary tree whose number of vertices admit a recursive definition similar to the Fibonacci numbers. In this paper, we prove that a hypercube of dimension h admits two edge-disjoint Fibonacci trees of height h, two edge-disjoint Fibonacci trees of height h-2, two edge-disjoint Fibonacci trees of height h-4 and so on, as subgraphs. The result shows that an algorithm with Fibonacci trees as underlying data structure can be implemented concurrently on a hypercube network with no communication latency.

  16. Incompletely resolved phylogenetic trees inflate estimates of phylogenetic conservatism.

    Science.gov (United States)

    Davies, T Jonathan; Kraft, Nathan J B; Salamin, Nicolas; Wolkovich, Elizabeth M

    2012-02-01

    The tendency for more closely related species to share similar traits and ecological strategies can be explained by their longer shared evolutionary histories and represents phylogenetic conservatism. How strongly species traits co-vary with phylogeny can significantly impact how we analyze cross-species data and can influence our interpretation of assembly rules in the rapidly expanding field of community phylogenetics. Phylogenetic conservatism is typically quantified by analyzing the distribution of species values on the phylogenetic tree that connects them. Many phylogenetic approaches, however, assume a completely sampled phylogeny: while we have good estimates of deeper phylogenetic relationships for many species-rich groups, such as birds and flowering plants, we often lack information on more recent interspecific relationships (i.e., within a genus). A common solution has been to represent these relationships as polytomies on trees using taxonomy as a guide. Here we show that such trees can dramatically inflate estimates of phylogenetic conservatism quantified using S. P. Blomberg et al.'s K statistic. Using simulations, we show that even randomly generated traits can appear to be phylogenetically conserved on poorly resolved trees. We provide a simple rarefaction-based solution that can reliably retrieve unbiased estimates of K, and we illustrate our method using data on first flowering times from Thoreau's woods (Concord, Massachusetts, USA).

  17. ‘FUJI’ APPLE TREE RESPONSE TO PHOSPHORUS FERTILIZATION

    Directory of Open Access Journals (Sweden)

    GILBERTO NAVA

    Full Text Available ABSTRACT The aim of this work was to evaluate the effects of orchard fertilization with increasing rates of phosphorus (P on yield and critical levels of P in the soil and in the leaf of ‘Fuji’ apple trees. The experiment was conducted in São Joaquim, state of Santa Catarina, southern Brazil, from 2010 to 2015, in an Inceptisol soil. The three apple orchards were planted in 2004 with the Fuji cultivar grafted on Marubakaido/ M9 rootstock and grown under a high-plant-density system (1984 trees ha-1. Annual fertilizer levels of 0, 40, 80, 120 and 160 kg ha-1 of P2O5 (as triple superphosphate were applied to the soil surface, without incorporation, in a randomized block design with five replicates. In the first and last years (2011 and 2015, soil samples were collected from 0-10, 10-20 and 0-20 cm layers and the available P content was analyzed. Annually, whole leaves were collected and analyzed for P content. The number and weight of fruits per tree and hfruit yield were also evaluated. Application of P increased the content of available P in the soil, but this increase was not accompanied by increased leaf P content nor by increased fruit yield. This suggests that, in soils with medium to high content of organic matter and well fertilized with P before planting, there is no response of apple trees for P reapplication in the 10 subsequent years.

  18. Detecting Drought-Induced Tree Mortality in Sierra Nevada Forests with Time Series of Satellite Data

    Directory of Open Access Journals (Sweden)

    Sarah Byer

    2017-09-01

    Full Text Available A five-year drought in California led to a significant increase in tree mortality in the Sierra Nevada forests from 2012 to 2016. Landscape level monitoring of forest health and tree dieback is critical for vegetation and disaster management strategies. We examined the capability of multispectral imagery from the Moderate Resolution Imaging Spectroradiometer (MODIS in detecting and explaining the impacts of the recent severe drought in Sierra Nevada forests. Remote sensing metrics were developed to represent baseline forest health conditions and drought stress using time series of MODIS vegetation indices (VIs and a water index. We used Random Forest algorithms, trained with forest aerial detection surveys data, to detect tree mortality based on the remote sensing metrics and topographical variables. Map estimates of tree mortality demonstrated that our two-stage Random Forest models were capable of detecting the spatial patterns and severity of tree mortality, with an overall producer’s accuracy of 96.3% for the classification Random Forest (CRF and a RMSE of 7.19 dead trees per acre for the regression Random Forest (RRF. The overall omission errors of the CRF ranged from 19% for the severe mortality class to 27% for the low mortality class. Interpretations of the models revealed that forests with higher productivity preceding the onset of drought were more vulnerable to drought stress and, consequently, more likely to experience tree mortality. This method highlights the importance of incorporating baseline forest health data and measurements of drought stress in understanding forest response to severe drought.

  19. Random Decrement

    DEFF Research Database (Denmark)

    Asmussen, J.C.; Ibrahim, S.R.; Brincker, Rune

    Abstraet Thispaper demansirates how to use the Random Decrement (RD) technique for identification o flinear structures subjected to ambient excitation. The theory behind the technique will be presented and guidelines how to choose the different variables will be given. This is done by introducing...

  20. Random Decrement

    DEFF Research Database (Denmark)

    Asmussen, J. C.; Ibrahim, S. R.; Brincker, Rune

    This paper demonstrates how to use the Random Decrement (RD) technique for identification of linear structures subjected to ambient excitation. The theory behind the technique will be presented and guidelines how to choose the different variables will be given. This is done by introducing a new...

  1. Random Decrement

    DEFF Research Database (Denmark)

    Asmussen, J. C.; Ibrahim, R.; Brincker, Rune

    1998-01-01

    This paper demonstrates how to use the Random Decrement (RD) technique for identification of linear structures subjected to ambient excitation. The theory behind the technique will be presented and guidelines how to choose the different variables will be given. This is done by introducing a new...

  2. Random dynamics

    International Nuclear Information System (INIS)

    Bennett, D.L.; Brene, N.; Nielsen, H.B.

    1986-06-01

    The goal of random dynamics is the derivation of the laws of Nature as we know them (standard model) from inessential assumptions. The inessential assumptions made here are expressed as sets of general models at extremely high energies: gauge glass and spacetime foam. Both sets of models lead tentatively to the standard model. (orig.)

  3. Random dynamics

    International Nuclear Information System (INIS)

    Bennett, D.L.

    1987-01-01

    The goal of random dynamics is the derivation of the laws of Nature as we know them (standard model) from inessential assumptions. The inessential assumptions made here are expressed as sets of general models at extremely high energies: Gauge glass and spacetime foam. Both sets of models lead tentatively to the standard model. (orig.)

  4. Random Dynamics

    Science.gov (United States)

    Bennett, D. L.; Brene, N.; Nielsen, H. B.

    1987-01-01

    The goal of random dynamics is the derivation of the laws of Nature as we know them (standard model) from inessential assumptions. The inessential assumptions made here are expressed as sets of general models at extremely high energies: gauge glass and spacetime foam. Both sets of models lead tentatively to the standard model.

  5. Effect of different tree mortality patterns on stand development in the forest model SIBYLA

    Directory of Open Access Journals (Sweden)

    Trombik Jiří

    2016-09-01

    Full Text Available Forest mortality critically affects stand structure and the quality of ecosystem services provided by forests. Spruce bark beetle (Ips typographus generates rather complex infestation and mortality patterns, and implementation of such patterns in forest models is challenging. We present here the procedure, which allows to simulate the bark beetle-related tree mortality in the forest dynamics model Sibyla. We explored how sensitive various production and stand structure indicators are to tree mortality patterns, which can be generated by bark beetles. We compared the simulation outputs for three unmanaged forest stands with 40, 70 and 100% proportion of spruce as affected by the disturbance-related mortality that occurred in a random pattern and in a patchy pattern. The used tree species and age class-specific mortality rates were derived from the disturbance-related mortality records from Slovakia. The proposed algorithm was developed in the SQLite using the Python language, and the algorithm allowed us to define the degree of spatial clustering of dead trees ranging from a random distribution to a completely clustered distribution; a number of trees that died in either mode is set to remain equal. We found significant differences between the long-term developments of the three investigated forest stands, but we found very little effect of the tested mortality modes on stand increment, tree species composition and diversity, and tree size diversity. Hence, our hypothesis that the different pattern of dead trees emergence should affect the competitive interactions between trees and regeneration, and thus affect selected productivity and stand structure indicators was not confirmed.

  6. Recursive algorithms for phylogenetic tree counting.

    Science.gov (United States)

    Gavryushkina, Alexandra; Welch, David; Drummond, Alexei J

    2013-10-28

    In Bayesian phylogenetic inference we are interested in distributions over a space of trees. The number of trees in a tree space is an important characteristic of the space and is useful for specifying prior distributions. When all samples come from the same time point and no prior information available on divergence times, the tree counting problem is easy. However, when fossil evidence is used in the inference to constrain the tree or data are sampled serially, new tree spaces arise and counting the number of trees is more difficult. We describe an algorithm that is polynomial in the number of sampled individuals for counting of resolutions of a constraint tree assuming that the number of constraints is fixed. We generalise this algorithm to counting resolutions of a fully ranked constraint tree. We describe a quadratic algorithm for counting the number of possible fully ranked trees on n sampled individuals. We introduce a new type of tree, called a fully ranked tree with sampled ancestors, and describe a cubic time algorithm for counting the number of such trees on n sampled individuals. These algorithms should be employed for Bayesian Markov chain Monte Carlo inference when fossil data are included or data are serially sampled.

  7. TreePOD: Sensitivity-Aware Selection of Pareto-Optimal Decision Trees.

    Science.gov (United States)

    Muhlbacher, Thomas; Linhardt, Lorenz; Moller, Torsten; Piringer, Harald

    2018-01-01

    Balancing accuracy gains with other objectives such as interpretability is a key challenge when building decision trees. However, this process is difficult to automate because it involves know-how about the domain as well as the purpose of the model. This paper presents TreePOD, a new approach for sensitivity-aware model selection along trade-offs. TreePOD is based on exploring a large set of candidate trees generated by sampling the parameters of tree construction algorithms. Based on this set, visualizations of quantitative and qualitative tree aspects provide a comprehensive overview of possible tree characteristics. Along trade-offs between two objectives, TreePOD provides efficient selection guidance by focusing on Pareto-optimal tree candidates. TreePOD also conveys the sensitivities of tree characteristics on variations of selected parameters by extending the tree generation process with a full-factorial sampling. We demonstrate how TreePOD supports a variety of tasks involved in decision tree selection and describe its integration in a holistic workflow for building and selecting decision trees. For evaluation, we illustrate a case study for predicting critical power grid states, and we report qualitative feedback from domain experts in the energy sector. This feedback suggests that TreePOD enables users with and without statistical background a confident and efficient identification of suitable decision trees.

  8. Identifying the rooted species tree from the distribution of unrooted gene trees under the coalescent.

    Science.gov (United States)

    Allman, Elizabeth S; Degnan, James H; Rhodes, John A

    2011-06-01

    Gene trees are evolutionary trees representing the ancestry of genes sampled from multiple populations. Species trees represent populations of individuals-each with many genes-splitting into new populations or species. The coalescent process, which models ancestry of gene copies within populations, is often used to model the probability distribution of gene trees given a fixed species tree. This multispecies coalescent model provides a framework for phylogeneticists to infer species trees from gene trees using maximum likelihood or Bayesian approaches. Because the coalescent models a branching process over time, all trees are typically assumed to be rooted in this setting. Often, however, gene trees inferred by traditional phylogenetic methods are unrooted. We investigate probabilities of unrooted gene trees under the multispecies coalescent model. We show that when there are four species with one gene sampled per species, the distribution of unrooted gene tree topologies identifies the unrooted species tree topology and some, but not all, information in the species tree edges (branch lengths). The location of the root on the species tree is not identifiable in this situation. However, for 5 or more species with one gene sampled per species, we show that the distribution of unrooted gene tree topologies identifies the rooted species tree topology and all its internal branch lengths. The length of any pendant branch leading to a leaf of the species tree is also identifiable for any species from which more than one gene is sampled.

  9. GumTree: Data reduction

    Energy Technology Data Exchange (ETDEWEB)

    Rayner, Hugh [Bragg Institute, Australian Nuclear Science and Technology Organisation, Lucas Heights, NSW (Australia)]. E-mail: hrz@ansto.gov.au; Hathaway, Paul [Bragg Institute, Australian Nuclear Science and Technology Organisation, Lucas Heights, NSW (Australia); Hauser, Nick [Bragg Institute, Australian Nuclear Science and Technology Organisation, Lucas Heights, NSW (Australia); Fei, Yang [Bragg Institute, Australian Nuclear Science and Technology Organisation, Lucas Heights, NSW (Australia); Franceschini, Ferdi [Bragg Institute, Australian Nuclear Science and Technology Organisation, Lucas Heights, NSW (Australia); Lam, Tony [Bragg Institute, Australian Nuclear Science and Technology Organisation, Lucas Heights, NSW (Australia)

    2006-11-15

    Access to software tools for interactive data reduction, visualisation and analysis during a neutron scattering experiment enables instrument users to make informed decisions regarding the direction and success of their experiment. ANSTO aims to enhance the experiment experience of its facility's users by integrating these data reduction tools with the instrument control interface for immediate feedback. GumTree is a software framework and application designed to support an Integrated Scientific Experimental Environment, for concurrent access to instrument control, data acquisition, visualisation and analysis software. The Data Reduction and Analysis (DRA) module is a component of the GumTree framework that allows users to perform data reduction, correction and basic analysis within GumTree while an experiment is running. It is highly integrated with GumTree, able to pull experiment data and metadata directly from the instrument control and data acquisition components. The DRA itself uses components common to all instruments at the facility, providing a consistent interface. It features familiar ISAW-based 1D and 2D plotting, an OpenGL-based 3D plotter and peak fitting performed by fityk. This paper covers the benefits of integration, the flexibility of the DRA module, ease of use for the interface and audit trail generation.

  10. Tree value conversion standards revisited

    Science.gov (United States)

    Paul S. DeBald; Martin E. Dale; Martin E. Dale

    1991-01-01

    Updated tree value conversion standards (TVCS) are presented for 12 important hardwood species of the oak-hickory forest. These updated standards-developed for each species by butt-log grade, merchantable height, and diameter at breast height-reflect the changes in lumber prices and in conversion costs which have occurred since 1976 when the original TVCS were...

  11. Induction of Ordinal Decision Trees

    NARCIS (Netherlands)

    J.C. Bioch (Cor); V. Popova (Viara)

    2003-01-01

    textabstractThis paper focuses on the problem of monotone decision trees from the point of view of the multicriteria decision aid methodology (MCDA). By taking into account the preferences of the decision maker, an attempt is made to bring closer similar research within machine learning and MCDA.

  12. Are there tides within trees?

    Science.gov (United States)

    Fisahn, Joachim

    2018-01-24

    Tree stem diameters and electrical stem potentials exhibit rhythmic variations with periodicities of 24-25 h. Under free-running conditions of constant light or darkness these rhythms were suggested to be mediated by the lunisolar gravitational force. To further unravel the regulation of tree stem diameter dilatations, many of the published time courses of diameter variations were re-evaluated in conjunction with the contemporaneous time courses of the lunisolar tidal acceleration. This was accomplished by application of the Etide program, which estimates, with high temporal resolution, local gravitational changes as a consequence of the diurnal variations of the lunisolar gravitational force due to the orbits and relative positions of Earth, Moon and Sun. In all instances investigated, it was evident that a synchronism exists between the times of the turning points of both the lunisolar tide and stem diameter variations when the direction of extension changes. This finding of synchrony documents that the lunisolar tide is a regulator of the tree stem diameter dilatations. Under the described experimental conditions, rhythms in tree stem diameter dilations and electrical stem potentials are controlled by the lunisolar gravitational acceleration. © The Author(s) 2018. Published by Oxford University Press on behalf of the Annals of Botany Company. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

  13. Tree improvement and environmental forestry

    Science.gov (United States)

    Warren T. Doolittle

    1971-01-01

    I was invited to talk to you about some of the things tree improvement can do to help our forest environment. Now I do not claim to have a corner on the market for ideas that geneticists can use in our environment, and I know that a number of scholarly papers have been presented previously on this subject.

  14. Eucalyptus as a landscape tree

    Science.gov (United States)

    W. Douglas Hamilton

    1983-01-01

    Ninety-two species of Eucalyptus were evaluated at the University of California re- search station in San Jose. The purpose: to find acceptable new street and park trees. Growth rates and horticultural characteristics were noted. Forty-three species were studied in locations statewide to evaluate site adaptation and landscape usefulness; flooded, cold, dry, saline....

  15. A Distributed Spanning Tree Algorithm

    DEFF Research Database (Denmark)

    Johansen, Karl Erik; Jørgensen, Ulla Lundin; Nielsen, Sven Hauge

    We present a distributed algorithm for constructing a spanning tree for connected undirected graphs. Nodes correspond to processors and edges correspond to two-way channels. Each processor has initially a distinct identity and all processors perform the same algorithm. Computation as well...

  16. Trees of Our National Forests.

    Science.gov (United States)

    Forest Service (USDA), Washington, DC.

    Presented is a description of the creation of the National Forests system, how trees grow, managing the National Forests, types of management systems, and managing for multiple use, including wildlife, water, recreation and other uses. Included are: (1) photographs; (2) line drawings of typical leaves, cones, flowers, and seeds; and (3)…

  17. The Trees that surround us

    Science.gov (United States)

    Costa, M. E. G.; Rodrigues, M. A. S.

    2012-04-01

    In our school the activities linked with sciences are developed in a partnership with other school subjects. Interdisciplinary projects are always valued from beginning to end of a project. It is common for teachers of different areas to work together in a Science project. Research of English written articles is very important not only for the development of our students' scientific literacy but also as a way of widening knowledge and a view on different perspectives of life instead of being limited to research of any articles in Portuguese language. In this study we are going to collect data about the predominant tree species in the region, especially the invasive trees from the acacia species, the native tree species and the commercial species. We are going to study the reasons for the appearance of each species and draw a chart of soil occupation in the council. This chart will also allow the study of the distribution and use of land for each tree species. This research work is the first stage for a contribution to warn the town council of the dangers of the invasive species to the future economy of the council.

  18. Wellhead and tree standards updated

    International Nuclear Information System (INIS)

    Dach, A.J. Jr.; Haeberle, T.

    1996-01-01

    Revisions in the API 6A, 17th Edition, have resolved a number of long-term problems and expanded its scope and coverage of wellhead and christmas tree equipment. The 17th Edition, Feb. 1, 1996, represents the state-of-the-art in international requirements for wellhead and christmas tree equipment. The design, materials, and quality control aspects of API 6A have all been improved with an emphasis on making the document more acceptable around the world. However, there are unresolved issues that raise many questions about the future direction of efforts aimed at international standardization of wellhead and christmas tree equipment. Unfortunately, these unresolved issues confuse both manufacturers and companies purchasing this equipment. This ultimately increases wellhead and christmas tree costs, so it is to everyone's advantage to resolve these issues. This article describes the significant revisions that are included in API 6A, 17th Edition. Also discussed are the regulatory, standardization, and customer acceptance issues that cloud the future of API 6A, 17th Edition

  19. The Tree of Life Project

    Science.gov (United States)

    Milbrath, Sherry

    2009-01-01

    Middle-school students are just beginning to recognize their place in the world. That is why this author believes it is important to incorporate their world into their art. In this article, the author discusses the "Tree of Life" project, which she developed for her students in order to make them aware of various environmental issues, and how to…

  20. GumTree: Data reduction

    International Nuclear Information System (INIS)

    Rayner, Hugh; Hathaway, Paul; Hauser, Nick; Fei, Yang; Franceschini, Ferdi; Lam, Tony

    2006-01-01

    Access to software tools for interactive data reduction, visualisation and analysis during a neutron scattering experiment enables instrument users to make informed decisions regarding the direction and success of their experiment. ANSTO aims to enhance the experiment experience of its facility's users by integrating these data reduction tools with the instrument control interface for immediate feedback. GumTree is a software framework and application designed to support an Integrated Scientific Experimental Environment, for concurrent access to instrument control, data acquisition, visualisation and analysis software. The Data Reduction and Analysis (DRA) module is a component of the GumTree framework that allows users to perform data reduction, correction and basic analysis within GumTree while an experiment is running. It is highly integrated with GumTree, able to pull experiment data and metadata directly from the instrument control and data acquisition components. The DRA itself uses components common to all instruments at the facility, providing a consistent interface. It features familiar ISAW-based 1D and 2D plotting, an OpenGL-based 3D plotter and peak fitting performed by fityk. This paper covers the benefits of integration, the flexibility of the DRA module, ease of use for the interface and audit trail generation

  1. Algorithms for Decision Tree Construction

    KAUST Repository

    Chikalov, Igor

    2011-01-01

    The study of algorithms for decision tree construction was initiated in 1960s. The first algorithms are based on the separation heuristic [13, 31] that at each step tries dividing the set of objects as evenly as possible. Later Garey and Graham [28

  2. Can Children Read Evolutionary Trees?

    Science.gov (United States)

    Ainsworth, Shaaron; Saffer, Jessica

    2013-01-01

    Representations of the "tree of life" such as cladograms show the history of lineages and their relationships. They are increasingly found in formal and informal learning settings. Unfortunately, there is evidence that these representations can be challenging to interpret correctly. This study explored the question of whether children…

  3. Top tips from tree tops

    Science.gov (United States)

    Ornes, Stephen

    2018-04-01

    The ability of trees to cool by transporting water from their roots to the leaves has been known for centuries. But as Stephen Ornes discovers, the principles of transpiration are also inspiring innovative techniques to cool vehicles travelling at hypersonic speeds, where unwanted heat is a problem too

  4. A distributed spanning tree algorithm

    DEFF Research Database (Denmark)

    Johansen, Karl Erik; Jørgensen, Ulla Lundin; Nielsen, Svend Hauge

    1988-01-01

    We present a distributed algorithm for constructing a spanning tree for connected undirected graphs. Nodes correspond to processors and edges correspond to two way channels. Each processor has initially a distinct identity and all processors perform the same algorithm. Computation as well as comm...

  5. Species-Level Differences in Hyperspectral Metrics among Tropical Rainforest Trees as Determined by a Tree-Based Classifier

    Directory of Open Access Journals (Sweden)

    Dar A. Roberts

    2012-06-01

    Full Text Available This study explores a method to classify seven tropical rainforest tree species from full-range (400–2,500 nm hyperspectral data acquired at tissue (leaf and bark, pixel and crown scales using laboratory and airborne sensors. Metrics that respond to vegetation chemistry and structure were derived using narrowband indices, derivative- and absorption-based techniques, and spectral mixture analysis. We then used the Random Forests tree-based classifier to discriminate species with minimally-correlated, importance-ranked metrics. At all scales, best overall accuracies were achieved with metrics derived from all four techniques and that targeted chemical and structural properties across the visible to shortwave infrared spectrum (400–2500 nm. For tissue spectra, overall accuracies were 86.8% for leaves, 74.2% for bark, and 84.9% for leaves plus bark. Variation in tissue metrics was best explained by an axis of red absorption related to photosynthetic leaves and an axis distinguishing bark water and other chemical absorption features. Overall accuracies for individual tree crowns were 71.5% for pixel spectra, 70.6% crown-mean spectra, and 87.4% for a pixel-majority technique. At pixel and crown scales, tree structure and phenology at the time of image acquisition were important factors that determined species spectral separability.

  6. From Fractal Trees to Deltaic Networks

    Science.gov (United States)

    Cazanacli, D.; Wolinsky, M. A.; Sylvester, Z.; Cantelli, A.; Paola, C.

    2013-12-01

    Geometric networks that capture many aspects of natural deltas can be constructed from simple concepts from graph theory and normal probability distributions. Fractal trees with symmetrical geometries are the result of replicating two simple geometric elements, line segments whose lengths decrease and bifurcation angles that are commonly held constant. Branches could also have a thickness, which in the case of natural distributary systems is the equivalent of channel width. In river- or wave-dominated natural deltas, the channel width is a function of discharge. When normal variations around the mean values for length, bifurcating angles, and discharge are applied, along with either pruning of 'clashing' branches or merging (equivalent to channel confluence), fractal trees start resembling natural deltaic networks, except that the resulting channels are unnaturally straight. Introducing a bifurcation probability fewer, naturally curved channels are obtained. If there is no bifurcation, the direction of each new segment depends on the direction the previous segment upstream (correlated random walk) and, to a lesser extent, on a general direction of growth (directional bias). When bifurcation occurs, the resulting two directions also depend on the bifurcation angle and the discharge split proportions, with the dominant branch following the direction of the upstream parent channel closely. The bifurcation probability controls the channel density and, in conjunction with the variability of the directional angles, the overall curvature of the channels. The growth of the network in effect is associated with net delta progradation. The overall shape and shape evolution of the delta depend mainly on the bifurcation angle average size and angle variability coupled with the degree of dominant direction dependency (bias). The proposed algorithm demonstrates how, based on only a few simple rules, a wide variety of channel networks resembling natural deltas, can be replicated

  7. International Tree Ring Data Bank (ITRDB)

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — Tree ring data from the International Tree Ring Data Bank and World Data Center for Paleoclimatology archives. Data include raw treering measurements (most are...

  8. Interactive wood combustion for botanical tree models

    KAUST Repository

    Pirk, Sö ren; Jarząbek, Michał; Hadrich, Torsten; Michels, Dominik L.; Palubicki, Wojciech

    2017-01-01

    We present a novel method for the combustion of botanical tree models. Tree models are represented as connected particles for the branching structure and a polygonal surface mesh for the combustion. Each particle stores biological and physical

  9. EDITORIAL Development Linkages between Tree Breeding ...

    African Journals Online (AJOL)

    EDITORIAL Development Linkages between Tree Breeding Programmes and National/Regional Tree Seed Centres in Africa. ... Discovery and Innovation. Journal Home · ABOUT THIS JOURNAL · Advanced Search · Current Issue · Archives.

  10. Systolic automata for VLSI on balanced trees

    Energy Technology Data Exchange (ETDEWEB)

    Culik, K Ii; Gruska, J; Salomaa, A

    1983-01-01

    Systolic tree automata with a binary (or, more generally, balanced) underlying tree are investigated. The main emphasis is on input conditions, decidability, and characterization of acceptable languages. 4 references.

  11. Representing Boolean Functions by Decision Trees

    KAUST Repository

    Chikalov, Igor

    2011-01-01

    A Boolean or discrete function can be represented by a decision tree. A compact form of decision tree named binary decision diagram or branching program is widely known in logic design [2, 40]. This representation is equivalent to other forms

  12. Computing Refined Buneman Trees in Cubic Time

    DEFF Research Database (Denmark)

    Brodal, G.S.; Fagerberg, R.; Östlin, A.

    2003-01-01

    Reconstructing the evolutionary tree for a set of n species based on pairwise distances between the species is a fundamental problem in bioinformatics. Neighbor joining is a popular distance based tree reconstruction method. It always proposes fully resolved binary trees despite missing evidence...... in the underlying distance data. Distance based methods based on the theory of Buneman trees and refined Buneman trees avoid this problem by only proposing evolutionary trees whose edges satisfy a number of constraints. These trees might not be fully resolved but there is strong combinatorial evidence for each...... proposed edge. The currently best algorithm for computing the refined Buneman tree from a given distance measure has a running time of O(n 5) and a space consumption of O(n 4). In this paper, we present an algorithm with running time O(n 3) and space consumption O(n 2). The improved complexity of our...

  13. Understanding search trees via statistical physics

    Indian Academy of Sciences (India)

    ary search tree model (where stands for the number of branches of the search tree), an important problem for data storage in computer science, using a variety of statistical physics techniques that allow us to obtain exact asymptotic results.

  14. Tree rings and radiocarbon calibration

    International Nuclear Information System (INIS)

    Barbetti, M.

    1999-01-01

    Only a few kinds of trees in Australia and Southeast Asia are known to have growth rings that are both distinct and annual. Those that do are therefore extremely important to climatic and isotope studies. In western Tasmania, extensive work with Huon pine (Lagarostrobos franklinii) has shown that many living trees are more than 1,000 years old, and that their ring widths are sensitive to temperature, rainfall and cloud cover (Buckley et al. 1997). At the Stanley River there is a forest of living (and recently felled) trees which we have sampled and measured. There are also thousands of subfossil Huon pine logs, buried at depths less than 5 metres in an area of floodplain extending over a distance of more than a kilometre with a width of tens of metres. Some of these logs have been buried for 50,000 years or more, but most of them belong to the period between 15,000 years and the present. In previous expeditions in the 1980s and 1990s, we excavated and sampled about 350 logs (Barbetti et al. 1995; Nanson et al. 1995). By measuring the ring-width patterns, and matching them between logs and living trees, we have constructed a tree-ring dated chronology from 571 BC to AD 1992. We have also built a 4254-ring floating chronology (placed by radiocarbon at ca. 3580 to 7830 years ago), and an earlier 1268-ring chronology (ca. 7,580 to 8,850 years ago). There are many individuals, or pairs of logs which match and together span several centuries, at 9,000 years ago and beyond

  15. Groups, graphs and random walks

    CERN Document Server

    Salvatori, Maura; Sava-Huss, Ecaterina

    2017-01-01

    An accessible and panoramic account of the theory of random walks on groups and graphs, stressing the strong connections of the theory with other branches of mathematics, including geometric and combinatorial group theory, potential analysis, and theoretical computer science. This volume brings together original surveys and research-expository papers from renowned and leading experts, many of whom spoke at the workshop 'Groups, Graphs and Random Walks' celebrating the sixtieth birthday of Wolfgang Woess in Cortona, Italy. Topics include: growth and amenability of groups; Schrödinger operators and symbolic dynamics; ergodic theorems; Thompson's group F; Poisson boundaries; probability theory on buildings and groups of Lie type; structure trees for edge cuts in networks; and mathematical crystallography. In what is currently a fast-growing area of mathematics, this book provides an up-to-date and valuable reference for both researchers and graduate students, from which future research activities will undoubted...

  16. A Durable Flash Memory Search Tree

    OpenAIRE

    Clay III, James; Wortman, Kevin

    2012-01-01

    We consider the task of optimizing the B-tree data structure, used extensively in operating systems and databases, for sustainable usage on multi-level flash memory. Empirical evidence shows that this new flash memory tree, or FM Tree, extends the operational lifespan of each block of flash memory by a factor of roughly 27 to 70 times, while still supporting logarithmic-time search tree operations.

  17. Using tree diversity to compare phylogenetic heuristics.

    Science.gov (United States)

    Sul, Seung-Jin; Matthews, Suzanne; Williams, Tiffani L

    2009-04-29

    Evolutionary trees are family trees that represent the relationships between a group of organisms. Phylogenetic heuristics are used to search stochastically for the best-scoring trees in tree space. Given that better tree scores are believed to be better approximations of the true phylogeny, traditional evaluation techniques have used tree scores to determine the heuristics that find the best scores in the fastest time. We develop new techniques to evaluate phylogenetic heuristics based on both tree scores and topologies to compare Pauprat and Rec-I-DCM3, two popular Maximum Parsimony search algorithms. Our results show that although Pauprat and Rec-I-DCM3 find the trees with the same best scores, topologically these trees are quite different. Furthermore, the Rec-I-DCM3 trees cluster distinctly from the Pauprat trees. In addition to our heatmap visualizations of using parsimony scores and the Robinson-Foulds distance to compare best-scoring trees found by the two heuristics, we also develop entropy-based methods to show the diversity of the trees found. Overall, Pauprat identifies more diverse trees than Rec-I-DCM3. Overall, our work shows that there is value to comparing heuristics beyond the parsimony scores that they find. Pauprat is a slower heuristic than Rec-I-DCM3. However, our work shows that there is tremendous value in using Pauprat to reconstruct trees-especially since it finds identical scoring but topologically distinct trees. Hence, instead of discounting Pauprat, effort should go in improving its implementation. Ultimately, improved performance measures lead to better phylogenetic heuristics and will result in better approximations of the true evolutionary history of the organisms of interest.

  18. Locating a tree in a phylogenetic network

    OpenAIRE

    van Iersel, Leo; Semple, Charles; Steel, Mike

    2010-01-01

    Phylogenetic trees and networks are leaf-labelled graphs that are used to describe evolutionary histories of species. The Tree Containment problem asks whether a given phylogenetic tree is embedded in a given phylogenetic network. Given a phylogenetic network and a cluster of species, the Cluster Containment problem asks whether the given cluster is a cluster of some phylogenetic tree embedded in the network. Both problems are known to be NP-complete in general. In this article, we consider t...

  19. The transposition distance for phylogenetic trees

    OpenAIRE

    Rossello, Francesc; Valiente, Gabriel

    2006-01-01

    The search for similarity and dissimilarity measures on phylogenetic trees has been motivated by the computation of consensus trees, the search by similarity in phylogenetic databases, and the assessment of clustering results in bioinformatics. The transposition distance for fully resolved phylogenetic trees is a recent addition to the extensive collection of available metrics for comparing phylogenetic trees. In this paper, we generalize the transposition distance from fully resolved to arbi...

  20. Animals and trees: food for thought

    Energy Technology Data Exchange (ETDEWEB)

    Openshaw, K.

    1979-01-01

    In many areas of Africa, combining tree-growing with animal rearing is advantageous, as the trees provide shade, animal fodder and timber for fuel and building, while grazing animals reduce the fire hazard from ground vegetation and improve soil fertility through droppings. Acacia albida, Prosopis cineraria, P. chilensis, leucaena leucocephala and Ailanthus excelsa are discussed as promising fodder trees, and an appendix is included with notes on 21 other trees for fodder or the production of medicines.

  1. The national tree-list layer

    Science.gov (United States)

    Stacy A. Drury; Jason M. Herynk

    2011-01-01

    The National Tree-List Layer (NTLL) project used LANDFIRE map products to produce the first national tree-list map layer that represents tree populations at stand and regional levels. The NTLL was produced in a short time frame to address the needs of Fire and Aviation Management for a map layer that could be used as input for simulating fire-caused tree mortality...

  2. Dimensional Reduction for the General Markov Model on Phylogenetic Trees.

    Science.gov (United States)

    Sumner, Jeremy G

    2017-03-01

    We present a method of dimensional reduction for the general Markov model of sequence evolution on a phylogenetic tree. We show that taking certain linear combinations of the associated random variables (site pattern counts) reduces the dimensionality of the model from exponential in the number of extant taxa, to quadratic in the number of taxa, while retaining the ability to statistically identify phylogenetic divergence events. A key feature is the identification of an invariant subspace which depends only bilinearly on the model parameters, in contrast to the usual multi-linear dependence in the full space. We discuss potential applications including the computation of split (edge) weights on phylogenetic trees from observed sequence data.

  3. On Tree-Constrained Matchings and Generalizations

    NARCIS (Netherlands)

    S. Canzar (Stefan); K. Elbassioni; G.W. Klau (Gunnar); J. Mestre

    2011-01-01

    htmlabstractWe consider the following \\textsc{Tree-Constrained Bipartite Matching} problem: Given two rooted trees $T_1=(V_1,E_1)$, $T_2=(V_2,E_2)$ and a weight function $w: V_1\\times V_2 \\mapsto \\mathbb{R}_+$, find a maximum weight matching $\\mathcal{M}$ between nodes of the two trees, such that

  4. Measuring and analyzing urban tree cover

    Science.gov (United States)

    David J. Nowak; Rowan A. Rowntree; E. Gregory McPherson; Susan M. Sisinni; Esther R. Kirkmann; Jack C. Stevens

    1996-01-01

    Measurement of city tree cover can aid in urban vegetation planning, management, and research by revealing characteristics of vegetation across a city. Urban tree cover in the United States ranges from 0.4% in Lancaster, California, to 55% in Baton Rouge, Louisiana. Two important factors that affect the amount of urban tree cover are the natural environment and land...

  5. Understanding the challenges of municipal tree planting

    Science.gov (United States)

    E.G. McPherson; R. Young

    2010-01-01

    Nine of the twelve largest cities in the U.S. have mayoral tree planting initiatives (TPIs), with pledges to plant nearly 20 million trees. Although executive-level support for trees has never been this widespread, many wonder if this support will endure as administrations change and budgets tighten. In an effort to share lessons learned from successes and setbacks, a...

  6. THE CONTRIBUTION OF AGROFORESTRY TREE PRODUCTS TO ...

    African Journals Online (AJOL)

    philiph

    contribution of agro-forestry tree products to the livelihood of rural farmers was high and accounted for ... systems in which trees are grown with ... livelihood of farmers in rural areas and .... pulp, the seed are boiled in water and dried .... treatment of fracture/dislocation of bones. Some agroforestry trees that provides the rural ...

  7. Sampling the quality of hardwood trees

    Science.gov (United States)

    Adrian M. Gilbert

    1959-01-01

    Anyone acquainted with the conversion of hardwood trees into wood products knows that timber has a wide range in quality. Some trees will yield better products than others. So, in addition to rate of growth and size, tree values are affected by the quality of products yielded.

  8. Locating a tree in a phylogenetic network

    NARCIS (Netherlands)

    Iersel, van L.J.J.; Semple, C.; Steel, M.A.

    2010-01-01

    Phylogenetic trees and networks are leaf-labelled graphs that are used to describe evolutionary histories of species. The Tree Containment problem asks whether a given phylogenetic tree is embedded in a given phylogenetic network. Given a phylogenetic network and a cluster of species, the Cluster

  9. Finding small equivalent decision trees is hard

    NARCIS (Netherlands)

    Zantema, H.; Bodlaender, H.L.

    2000-01-01

    Two decision trees are called decision equivalent if they represent the same function, i.e., they yield the same result for every possible input. We prove that given a decision tree and a number, to decide if there is a decision equivalent decision tree of size at most that number is NPcomplete. As

  10. Which trees should be removed in thinning?

    Directory of Open Access Journals (Sweden)

    Timo Pukkala

    2015-12-01

    Full Text Available Background: In economically optimal management, trees that are removed in a thinning treatment should be selected on the basis of their value, relative value increment and the effect of removal on the growth of remaining trees. Large valuable trees with decreased value increment should be removed, especially when they overtop smaller trees. Methods: This study optimized the tree selection rule in the thinning treatments of continuous cover management when the aim is to maximize the profitability of forest management. The weights of three criteria (stem value, relative value increment and effect of removal on the competition of remaining trees were optimized together with thinning intervals. Results and conclusions: The results confirmed the hypothesis that optimal thinning involves removing predominantly large trees. Increasing stumpage value, decreasing relative value increment, and increasing competitive influence increased the likelihood that removal is optimal decision. However, if the spatial distribution of trees is irregular, it is optimal to leave large trees in sparse places and remove somewhat smaller trees from dense places. However, the benefit of optimal thinning, as compared to diameter limit cutting is not usually large in pure one-species stands. On the contrary, removing the smallest trees from the stand may lead to significant (30–40 % reductions in the net present value of harvest incomes. Keywords: Continuous cover forestry, Tree selection, High thinning, Optimal management, Spatial distribution, Spatial growth model

  11. Evaluating realized genetic gains from tree improvement.

    Science.gov (United States)

    J.B. St. Clair

    1993-01-01

    Tree improvement has become an essential part of the management of forest lands for wood production, and predicting yields and realized gains from forests planted with genetically-improved trees will become increasingly important. This paper discusses concepts of tree improvement and genetic gain important to growth and yield modeling, and reviews previous studies of...

  12. A practical alternative to single tree selection?

    Science.gov (United States)

    Gary W. Miller; H. Clay Smith

    1993-01-01

    When landowners want to develop and maintain an uneven-aged tree structure in eastern hardwood stands, single-tree selection often is suggested as the only advisable, long-term partial regeneration harvest method. Single-tree selection is preferred because it provides a means for improving quality and controlling stocking of the residual stand necessary for sustained...

  13. Do you believe in palm trees?

    Science.gov (United States)

    Kevin T. Smith

    2013-01-01

    Palms are real, but are they really trees? The answer depends on definitions. As usually tall, peremrial plants with roots, stems, and leaves, palms seem to qualify. Palms should also qualify because arborists care for them, and arborists care for trees, right? My introduction to botany class defined trees as plants that produce wood. Unraveling the question of whether...

  14. Carbon dynamics in trees: feast or famine?

    Science.gov (United States)

    Anna Sala; David R. Woodruff; Fredrick C. Meinzer

    2012-01-01

    Research on the degree to which carbon (C) availability limits growth in trees, as well as recent trends in climate change and concurrent increases in drought related tree mortality, have led to a renewed focus on the physiological mechanisms associated with tree growth responses to current and future climate. This has led to some dispute over the role of stored...

  15. Shedding light on tree growth : ring analysis of juvenile tropical trees

    NARCIS (Netherlands)

    Soliz Gamboa, C.C.

    2010-01-01

    In the understory of tropical forests light is believed to be the main limiting growth factor for the newly established trees. Trees growing in shade of the understory may experience periods of slow radial growth. It is expected that gaps created by tree or branch fall will provoke tree growth

  16. Per tree estimates with n-tree distance sampling: an application to increment core data

    Science.gov (United States)

    Thomas B. Lynch; Robert F. Wittwer

    2002-01-01

    Per tree estimates using the n trees nearest a point can be obtained by using a ratio of per unit area estimates from n-tree distance sampling. This ratio was used to estimate average age by d.b.h. classes for cottonwood trees (Populus deltoides Bartr. ex Marsh.) on the Cimarron National Grassland. Increment...

  17. Tree-space statistics and approximations for large-scale analysis of anatomical trees

    DEFF Research Database (Denmark)

    Feragen, Aasa; Owen, Megan; Petersen, Jens

    2013-01-01

    parametrize the relevant parts of tree-space well. Using the developed approximate statistics, we illustrate how the structure and geometry of airway trees vary across a population and show that airway trees with Chronic Obstructive Pulmonary Disease come from a different distribution in tree-space than...

  18. Monitoring Million Trees LA: Tree performance during the early years and future benefits

    Science.gov (United States)

    E. Gregory McPherson

    2014-01-01

    Million Trees LA (MTLA) is one of several large-scale mayoral tree planting initiatives striving to create more livable cities through urban forestry. This study combined field sampling of tree survival and growth with numerical modeling of future benefits to assess performance of MTLA plantings. From 2006 to 2010 MTLA planted a diverse mix of 91,786 trees....

  19. Estimating tree species diversity in the savannah using NDVI and woody canopy cover

    Science.gov (United States)

    Madonsela, Sabelo; Cho, Moses Azong; Ramoelo, Abel; Mutanga, Onisimo; Naidoo, Laven

    2018-04-01

    Remote sensing applications in biodiversity research often rely on the establishment of relationships between spectral information from the image and tree species diversity measured in the field. Most studies have used normalized difference vegetation index (NDVI) to estimate tree species diversity on the basis that it is sensitive to primary productivity which defines spatial variation in plant diversity. The NDVI signal is influenced by photosynthetically active vegetation which, in the savannah, includes woody canopy foliage and grasses. The question is whether the relationship between NDVI and tree species diversity in the savanna depends on the woody cover percentage. This study explored the relationship between woody canopy cover (WCC) and tree species diversity in the savannah woodland of southern Africa and also investigated whether there is a significant interaction between seasonal NDVI and WCC in the factorial model when estimating tree species diversity. To fulfil our aim, we followed stratified random sampling approach and surveyed tree species in 68 plots of 90 m × 90 m across the study area. Within each plot, all trees with diameter at breast height of >10 cm were sampled and Shannon index - a common measure of species diversity which considers both species richness and abundance - was used to quantify tree species diversity. We then extracted WCC in each plot from existing fractional woody cover product produced from Synthetic Aperture Radar (SAR) data. Factorial regression model was used to determine the interaction effect between NDVI and WCC when estimating tree species diversity. Results from regression analysis showed that (i) WCC has a highly significant relationship with tree species diversity (r2 = 0.21; p NDVI and WCC is not significant, however, the factorial model significantly reduced the error of prediction (RMSE = 0.47, p NDVI (RMSE = 0.49) or WCC (RMSE = 0.49) model during the senescence period. The result justifies our assertion

  20. Study of Spatial Distribution of the Hawthorn (Crataegus monogyna Trees Attacked by Orchard Ermine (Yponomeuta padella in Bazoft Forests of Chaharmahal and Bakhtiari Province

    Directory of Open Access Journals (Sweden)

    H. Shariati Najaf Abadi

    2016-03-01

    Full Text Available Forest trees demonstrate different distribution patterns, depend on their living condition (Such as pest infestations. Forest density and epidemic pest concentration are hypothetically among the most influential factors. The current study was carried out on distribution pattern of the orchard ermine (Yponomeuta padella infested hawthorn trees (Crataegus monogyna in Bazoft river watershed in Central Zagros. Nine sites were selected with different infections. The site selection was based on pollution and position (North or South it. Pollution, density of trees and coordinates (X , Y were recorded for each tree. Eberhart and Ripley’s K functions were used to elucidate the infested and non-infested tree distribution. The results showed a clumped distribution of the trees in sound sites and in infested sites with high hawthorn density. Trees in low-dense infested sites had a tendency toward more random and even uniform population distribution.

  1. DupTree: a program for large-scale phylogenetic analyses using gene tree parsimony.

    Science.gov (United States)

    Wehe, André; Bansal, Mukul S; Burleigh, J Gordon; Eulenstein, Oliver

    2008-07-01

    DupTree is a new software program for inferring rooted species trees from collections of gene trees using the gene tree parsimony approach. The program implements a novel algorithm that significantly improves upon the run time of standard search heuristics for gene tree parsimony, and enables the first truly genome-scale phylogenetic analyses. In addition, DupTree allows users to examine alternate rootings and to weight the reconciliation costs for gene trees. DupTree is an open source project written in C++. DupTree for Mac OS X, Windows, and Linux along with a sample dataset and an on-line manual are available at http://genome.cs.iastate.edu/CBL/DupTree

  2. Response of land surface phenology to variation in tree cover during green-up and senescence periods in the semi-arid savanna of Southern Africa

    CSIR Research Space (South Africa)

    Cho, Moses A

    2017-07-01

    Full Text Available ) seasonal time series (2001 to 2015) maps for a study region in South Africa. Tree cover (%) data for 100 randomly selected polygons grouped into three tree cover classes: low (< 20%, n = 44), medium (20-40%, n = 22) and high (> 40%, n = 34) were used...

  3. Static terrestrial laser scanning of juvenile understory trees for field phenotyping

    Science.gov (United States)

    Wang, Huanhuan; Lin, Yi

    2014-11-01

    This study was to attempt the cutting-edge 3D remote sensing technique of static terrestrial laser scanning (TLS) for parametric 3D reconstruction of juvenile understory trees. The data for test was collected with a Leica HDS6100 TLS system in a single-scan way. The geometrical structures of juvenile understory trees are extracted by model fitting. Cones are used to model trunks and branches. Principal component analysis (PCA) is adopted to calculate their major axes. Coordinate transformation and orthogonal projection are used to estimate the parameters of the cones. Then, AutoCAD is utilized to simulate the morphological characteristics of the understory trees, and to add secondary branches and leaves in a random way. Comparison of the reference values and the estimated values gives the regression equation and shows that the proposed algorithm of extracting parameters is credible. The results have basically verified the applicability of TLS for field phenotyping of juvenile understory trees.

  4. FastTree: Computing Large Minimum Evolution Trees with Profiles instead of a Distance Matrix

    OpenAIRE

    Price, Morgan N.; Dehal, Paramvir S.; Arkin, Adam P.

    2009-01-01

    Gene families are growing rapidly, but standard methods for inferring phylogenies do not scale to alignments with over 10,000 sequences. We present FastTree, a method for constructing large phylogenies and for estimating their reliability. Instead of storing a distance matrix, FastTree stores sequence profiles of internal nodes in the tree. FastTree uses these profiles to implement Neighbor-Joining and uses heuristics to quickly identify candidate joins. FastTree then uses nearest neighbor in...

  5. Bayesian additive decision trees of biomarker by treatment interactions for predictive biomarker detection and subgroup identification.

    Science.gov (United States)

    Zhao, Yang; Zheng, Wei; Zhuo, Daisy Y; Lu, Yuefeng; Ma, Xiwen; Liu, Hengchang; Zeng, Zhen; Laird, Glen

    2017-10-11

    Personalized medicine, or tailored therapy, has been an active and important topic in recent medical research. Many methods have been proposed in the literature for predictive biomarker detection and subgroup identification. In this article, we propose a novel decision tree-based approach applicable in randomized clinical trials. We model the prognostic effects of the biomarkers using additive regression trees and the biomarker-by-treatment effect using a single regression tree. Bayesian approach is utilized to periodically revise the split variables and the split rules of the decision trees, which provides a better overall fitting. Gibbs sampler is implemented in the MCMC procedure, which updates the prognostic trees and the interaction tree separately. We use the posterior distribution of the interaction tree to construct the predictive scores of the biomarkers and to identify the subgroup where the treatment is superior to the control. Numerical simulations show that our proposed method performs well under various settings comparing to existing methods. We also demonstrate an application of our method in a real clinical trial.

  6. The Effect of Restoration Treatments on the Spatial Variability of Soil Processes under Longleaf Pine Trees

    Directory of Open Access Journals (Sweden)

    John K. Hiers

    2012-08-01

    Full Text Available The objectives of this study were to (1 characterize tree-based spatial patterning of soil properties and understory vegetation in frequently burned (“reference state” and fire-suppressed longleaf pine forests; and (2 determine how restoration treatments affected patterning. To attain these objectives, we used an experimental manipulation of management types implemented 15 years ago in Florida. We randomly located six mature longleaf pine trees in one reference and four restoration treatments (i.e., burn, control, herbicide, and mechanical, for a total of 36 trees. In addition to the original treatments and as part of a monitoring program, all plots were subjected to several prescribed fires during these 15 years. Under each tree, we sampled mineral soil and understory vegetation at 1 m, 2 m, 3 m and 4 m (vegetation only away from the tree. At these sites, soil carbon and nitrogen were higher near the trunk while graminoids, forbs and saw palmetto covers showed an opposite trend. Our results confirmed that longleaf pine trees affect the spatial patterning of soil and understory vegetation, and this patterning was mostly limited to the restoration sites. We suggest frequent burning as a probable cause for a lack of spatial structure in the “reference state”. We attribute the presence of spatial patterning in the restoration sites to accumulation of organic materials near the base of mature trees.

  7. Tree cover in Central Africa: determinants and sensitivity under contrasted scenarios of global change.

    Science.gov (United States)

    Aleman, Julie C; Blarquez, Olivier; Gourlet-Fleury, Sylvie; Bremond, Laurent; Favier, Charly

    2017-01-30

    Tree cover is a key variable for ecosystem functioning, and is widely used to study tropical ecosystems. But its determinants and their relative importance are still a matter of debate, especially because most regional and global analyses have not considered the influence of agricultural practices. More information is urgently needed regarding how human practices influence vegetation structure. Here we focused in Central Africa, a region still subjected to traditional agricultural practices with a clear vegetation gradient. Using remote sensing data and global databases, we calibrated a Random Forest model to correlatively link tree cover with climatic, edaphic, fire and agricultural practices data. We showed that annual rainfall and accumulated water deficit were the main drivers of the distribution of tree cover and vegetation classes (defined by the modes of tree cover density), but agricultural practices, especially pastoralism, were also important in determining tree cover. We simulated future tree cover with our model using different scenarios of climate and land-use (agriculture and population) changes. Our simulations suggest that tree cover may respond differently regarding the type of scenarios, but land-use change was an important driver of vegetation change even able to counterbalance the effect of climate change in Central Africa.

  8. Detection of dead standing Eucalyptus camaldulensis without tree delineation for managing biodiversity in native Australian forest

    Science.gov (United States)

    Miltiadou, Milto; Campbell, Neil D. F.; Gonzalez Aracil, Susana; Brown, Tony; Grant, Michael G.

    2018-05-01

    In Australia, many birds and arboreal animals use hollows for shelters, but studies predict shortage of hollows in near future. Aged dead trees are more likely to contain hollows and therefore automated detection of them plays a substantial role in preserving biodiversity and consequently maintaining a resilient ecosystem. For this purpose full-waveform LiDAR data were acquired from a native Eucalypt forest in Southern Australia. The structure of the forest significantly varies in terms of tree density, age and height. Additionally, Eucalyptus camaldulensis have multiple trunk splits making tree delineation very challenging. For that reason, this paper investigates automated detection of dead standing Eucalyptus camaldulensis without tree delineation. It also presents the new feature of the open source software DASOS, which extracts features for 3D object detection in voxelised FW LiDAR. A random forest classifier, a weighted-distance KNN algorithm and a seed growth algorithm are used to create a 2D probabilistic field and to then predict potential positions of dead trees. It is shown that tree health assessment is possible without tree delineation but since it is a new research directions there are many improvements to be made.

  9. Tokunaga and Horton self-similarity for level set trees of Markov chains

    International Nuclear Information System (INIS)

    Zaliapin, Ilia; Kovchegov, Yevgeniy

    2012-01-01

    Highlights: ► Self-similar properties of the level set trees for Markov chains are studied. ► Tokunaga and Horton self-similarity are established for symmetric Markov chains and regular Brownian motion. ► Strong, distributional self-similarity is established for symmetric Markov chains with exponential jumps. ► It is conjectured that fractional Brownian motions are Tokunaga self-similar. - Abstract: The Horton and Tokunaga branching laws provide a convenient framework for studying self-similarity in random trees. The Horton self-similarity is a weaker property that addresses the principal branching in a tree; it is a counterpart of the power-law size distribution for elements of a branching system. The stronger Tokunaga self-similarity addresses so-called side branching. The Horton and Tokunaga self-similarity have been empirically established in numerous observed and modeled systems, and proven for two paradigmatic models: the critical Galton–Watson branching process with finite progeny and the finite-tree representation of a regular Brownian excursion. This study establishes the Tokunaga and Horton self-similarity for a tree representation of a finite symmetric homogeneous Markov chain. We also extend the concept of Horton and Tokunaga self-similarity to infinite trees and establish self-similarity for an infinite-tree representation of a regular Brownian motion. We conjecture that fractional Brownian motions are also Tokunaga and Horton self-similar, with self-similarity parameters depending on the Hurst exponent.

  10. Influence of matrix type on tree community assemblages along tropical dry forest edges.

    Science.gov (United States)

    Benítez-Malvido, Julieta; Gallardo-Vásquez, Julio César; Alvarez-Añorve, Mariana Y; Avila-Cabadilla, Luis Daniel

    2014-05-01

    • Anthropogenic habitat edges have strong negative consequences for the functioning of tropical ecosystems. However, edge effects on tropical dry forest tree communities have been barely documented.• In Chamela, Mexico, we investigated the phylogenetic composition and structure of tree assemblages (≥5 cm dbh) along edges abutting different matrices: (1) disturbed vegetation with cattle, (2) pastures with cattle and, (3) pastures without cattle. Additionally, we sampled preserved forest interiors.• All edge types exhibited similar tree density, basal area and diversity to interior forests, but differed in species composition. A nonmetric multidimensional scaling ordination showed that the presence of cattle influenced species composition more strongly than the vegetation structure of the matrix; tree assemblages abutting matrices with cattle had lower scores in the ordination. The phylogenetic composition of tree assemblages followed the same pattern. The principal plant families and genera were associated according to disturbance regimes as follows: pastures and disturbed vegetation (1) with cattle and (2) without cattle, and (3) pastures without cattle and interior forests. All habitats showed random phylogenetic structures, suggesting that tree communities are assembled mainly by stochastic processes. Long-lived species persisting after edge creation could have important implications in the phylogenetic structure of tree assemblages.• Edge creation exerts a stronger influence on TDF vegetation pathways than previously documented, leading to new ecological communities. Phylogenetic analysis may, however, be needed to detect such changes. © 2014 Botanical Society of America, Inc.

  11. On the distribution of interspecies correlation for Markov models of character evolution on Yule trees.

    Science.gov (United States)

    Mulder, Willem H; Crawford, Forrest W

    2015-01-07

    Efforts to reconstruct phylogenetic trees and understand evolutionary processes depend fundamentally on stochastic models of speciation and mutation. The simplest continuous-time model for speciation in phylogenetic trees is the Yule process, in which new species are "born" from existing lineages at a constant rate. Recent work has illuminated some of the structural properties of Yule trees, but it remains mostly unknown how these properties affect sequence and trait patterns observed at the tips of the phylogenetic tree. Understanding the interplay between speciation and mutation under simple models of evolution is essential for deriving valid phylogenetic inference methods and gives insight into the optimal design of phylogenetic studies. In this work, we derive the probability distribution of interspecies covariance under Brownian motion and Ornstein-Uhlenbeck models of phenotypic change on a Yule tree. We compute the probability distribution of the number of mutations shared between two randomly chosen taxa in a Yule tree under discrete Markov mutation models. Our results suggest summary measures of phylogenetic information content, illuminate the correlation between site patterns in sequences or traits of related organisms, and provide heuristics for experimental design and reconstruction of phylogenetic trees. Copyright © 2014 Elsevier Ltd. All rights reserved.

  12. Inferring species trees from incongruent multi-copy gene trees using the Robinson-Foulds distance

    Science.gov (United States)

    2013-01-01

    Background Constructing species trees from multi-copy gene trees remains a challenging problem in phylogenetics. One difficulty is that the underlying genes can be incongruent due to evolutionary processes such as gene duplication and loss, deep coalescence, or lateral gene transfer. Gene tree estimation errors may further exacerbate the difficulties of species tree estimation. Results We present a new approach for inferring species trees from incongruent multi-copy gene trees that is based on a generalization of the Robinson-Foulds (RF) distance measure to multi-labeled trees (mul-trees). We prove that it is NP-hard to compute the RF distance between two mul-trees; however, it is easy to calculate this distance between a mul-tree and a singly-labeled species tree. Motivated by this, we formulate the RF problem for mul-trees (MulRF) as follows: Given a collection of multi-copy gene trees, find a singly-labeled species tree that minimizes the total RF distance from the input mul-trees. We develop and implement a fast SPR-based heuristic algorithm for the NP-hard MulRF problem. We compare the performance of the MulRF method (available at http://genome.cs.iastate.edu/CBL/MulRF/) with several gene tree parsimony approaches using gene tree simulations that incorporate gene tree error, gene duplications and losses, and/or lateral transfer. The MulRF method produces more accurate species trees than gene tree parsimony approaches. We also demonstrate that the MulRF method infers in minutes a credible plant species tree from a collection of nearly 2,000 gene trees. Conclusions Our new phylogenetic inference method, based on a generalized RF distance, makes it possible to quickly estimate species trees from large genomic data sets. Since the MulRF method, unlike gene tree parsimony, is based on a generic tree distance measure, it is appealing for analyses of genomic data sets, in which many processes such as deep coalescence, recombination, gene duplication and losses as

  13. Navigation and Tree Mapping in Orchards

    DEFF Research Database (Denmark)

    Jæger-Hansen, Claes Lund; Griepentrog, Hans W.; Andersen, Jens Christian

    In this paper an algorithm for estimating tree positions is presented. The sensors used for the algorithm is GNSS and LIDAR, and data is collected in an orchard with grapefruit trees while driving along the rows. The positions of the trees are estimated using ellipse fitting on point clouds....... The average accuracy for the center point estimation is 0.2 m in the along track direction and 0.35 m in the across track direction. The goal of the tree mapping algorithm is create a database of individual trees, and be the basis for creation of a graph map that can be used for mission planning...

  14. Computer aided construction of fault tree

    International Nuclear Information System (INIS)

    Kovacs, Z.

    1982-01-01

    Computer code CAT for the automatic construction of the fault tree is briefly described. Code CAT makes possible simple modelling of components using decision tables, it accelerates the fault tree construction process, constructs fault trees of different complexity, and is capable of harmonized co-operation with programs PREPandKITT 1,2 for fault tree analysis. The efficiency of program CAT and thus the accuracy and completeness of fault trees constructed significantly depends on the compilation and sophistication of decision tables. Currently, program CAT is used in co-operation with programs PREPandKITT 1,2 in reliability analyses of nuclear power plant systems. (B.S.)

  15. Day-roost tree selection by northern long-eared bats - What do non-roost tree comparisons and one year of data really tell us?

    Science.gov (United States)

    Silvis, Alexander; Ford, W. Mark; Britzke, Eric R.

    2015-01-01

    Bat day-roost selection often is described through comparisons of day-roosts with randomly selected, and assumed unused, trees. Relatively few studies, however, look at patterns of multi-year selection or compare day-roosts used across years. We explored day-roost selection using 2 years of roost selection data for female northern long-eared bats (Myotis septentrionalis) on the Fort Knox Military Reservation, Kentucky, USA. We compared characteristics of randomly selected non-roost trees and day-roosts using a multinomial logistic model and day-roost species selection using chi-squared tests. We found that factors differentiating day-roosts from non-roosts and day-roosts between years varied. Day-roosts differed from non-roosts in the first year of data in all measured factors, but only in size and decay stage in the second year. Between years, day-roosts differed in size and canopy position, but not decay stage. Day-roost species selection was non-random and did not differ between years. Although bats used multiple trees, our results suggest that there were additional unused trees that were suitable as roosts at any time. Day-roost selection pattern descriptions will be inadequate if based only on a single year of data, and inferences of roost selection based only on comparisons of roost to non-roosts should be limited.

  16. Day-roost tree selection by northern long-eared bats—What do non-roost tree comparisons and one year of data really tell us?

    Science.gov (United States)

    Silvis, Alexander; Ford, W. Mark; Britzke, Eric R.

    2015-01-01

    Bat day-roost selection often is described through comparisons of day-roosts with randomly selected, and assumed unused, trees. Relatively few studies, however, look at patterns of multi-year selection or compare day-roosts used across years. We explored day-roost selection using 2 years of roost selection data for female northern long-eared bats (Myotis septentrionalis) on the Fort Knox Military Reservation, Kentucky, USA. We compared characteristics of randomly selected non-roost trees and day-roosts using a multinomial logistic model and day-roost species selection using chi-squared tests. We found that factors differentiating day-roosts from non-roosts and day-roosts between years varied. Day-roosts differed from non-roosts in the first year of data in all measured factors, but only in size and decay stage in the second year. Between years, day-roosts differed in size and canopy position, but not decay stage. Day-roost species selection was non-random and did not differ between years. Although bats used multiple trees, our results suggest that there were additional unused trees that were suitable as roosts at any time. Day-roost selection pattern descriptions will be inadequate if based only on a single year of data, and inferences of roost selection based only on comparisons of roost to non-roosts should be limited.

  17. Air pollution and tree growth

    Energy Technology Data Exchange (ETDEWEB)

    Scurfield, G

    1960-01-01

    The problem of air pollution is reviewed with emphasis on its origin and its effects on trees and shrubs. These effects are described from two points of view: the effects of general air pollution, and also the effects of specific pollutants. The considerable mixing, dilution and interaction that pollutants undergo in the air often renders it exceedingly difficult to assign pollution damage to any specific chemical or physical entity. Moreover, it is often impossible to assign responsibility for damage to any particular source. The constituents of general air pollution may be subdivided into those potentially incapable, and those potentially capable, of entering the plant either through the leaf stomata or indirectly by way of the soil. Specific pollutants cause damage directly, as well as indirectly from the chemical reactions that occur in the polluted atmosphere. Sulfur dioxide is discussed in detail in relation to tree and shrub damage, with numerous examples of plant injuries.

  18. Spanning Tree Based Attribute Clustering

    DEFF Research Database (Denmark)

    Zeng, Yifeng; Jorge, Cordero Hernandez

    2009-01-01

    Attribute clustering has been previously employed to detect statistical dependence between subsets of variables. We propose a novel attribute clustering algorithm motivated by research of complex networks, called the Star Discovery algorithm. The algorithm partitions and indirectly discards...... inconsistent edges from a maximum spanning tree by starting appropriate initial modes, therefore generating stable clusters. It discovers sound clusters through simple graph operations and achieves significant computational savings. We compare the Star Discovery algorithm against earlier attribute clustering...

  19. Carbon Sequestration by Urban Trees

    DEFF Research Database (Denmark)

    Fares, Silvano; Paoletti, Elena; Calfapietra, Carlo

    2017-01-01

    Carbon dioxide (CO2) is the most prominent component of anthropogenic greenhouse gas emissions, resulting mainly from fuel combustion in the built environment – for activities such as heating of buildings, urban mobility and cooking. The concentration of near-surface CO2 in cities is affected by ....... In this chapter, we review the most recent studies and highlight emerging research needs for a better understanding of present and future roles of urban trees in removing CO2 from the atmosphere....

  20. Chemicals from trees and shrubs

    Energy Technology Data Exchange (ETDEWEB)

    Halloran, G M

    1978-01-01

    The need for finding economically viable alternatives to crude oil is discussed in the context of Australia's uncertain reserves of black coal, from which crude oil derivatives may have to be obtained when oil supplies become depleted. A table is presented showing the major fractions of crude oil and the likely sources (in general terms) of equivalent substances from forest trees, shrubs and agricultural species.

  1. Meta-learning in decision tree induction

    CERN Document Server

    Grąbczewski, Krzysztof

    2014-01-01

    The book focuses on different variants of decision tree induction but also describes  the meta-learning approach in general which is applicable to other types of machine learning algorithms. The book discusses different variants of decision tree induction and represents a useful source of information to readers wishing to review some of the techniques used in decision tree learning, as well as different ensemble methods that involve decision trees. It is shown that the knowledge of different components used within decision tree learning needs to be systematized to enable the system to generate and evaluate different variants of machine learning algorithms with the aim of identifying the top-most performers or potentially the best one. A unified view of decision tree learning enables to emulate different decision tree algorithms simply by setting certain parameters. As meta-learning requires running many different processes with the aim of obtaining performance results, a detailed description of the experimen...

  2. Rooted triple consensus and anomalous gene trees

    Directory of Open Access Journals (Sweden)

    Schmidt Heiko A

    2008-04-01

    Full Text Available Abstract Background Anomalous gene trees (AGTs are gene trees with a topology different from a species tree that are more probable to observe than congruent gene trees. In this paper we propose a rooted triple approach to finding the correct species tree in the presence of AGTs. Results Based on simulated data we show that our method outperforms the extended majority rule consensus strategy, while still resolving the species tree. Applying both methods to a metazoan data set of 216 genes, we tested whether AGTs substantially interfere with the reconstruction of the metazoan phylogeny. Conclusion Evidence of AGTs was not found in this data set, suggesting that erroneously reconstructed gene trees are the most significant challenge in the reconstruction of phylogenetic relationships among species with current data. The new method does however rule out the erroneous reconstruction of deep or poorly resolved splits in the presence of lineage sorting.

  3. The stopping rules for winsorized tree

    Science.gov (United States)

    Ch'ng, Chee Keong; Mahat, Nor Idayu

    2017-11-01

    Winsorized tree is a modified tree-based classifier that is able to investigate and to handle all outliers in all nodes along the process of constructing the tree. It overcomes the tedious process of constructing a classical tree where the splitting of branches and pruning go concurrently so that the constructed tree would not grow bushy. This mechanism is controlled by the proposed algorithm. In winsorized tree, data are screened for identifying outlier. If outlier is detected, the value is neutralized using winsorize approach. Both outlier identification and value neutralization are executed recursively in every node until predetermined stopping criterion is met. The aim of this paper is to search for significant stopping criterion to stop the tree from further splitting before overfitting. The result obtained from the conducted experiment on pima indian dataset proved that the node could produce the final successor nodes (leaves) when it has achieved the range of 70% in information gain.

  4. Nonbinary Tree-Based Phylogenetic Networks.

    Science.gov (United States)

    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.

  5. Deterministic Automata for Unordered Trees

    Directory of Open Access Journals (Sweden)

    Adrien Boiret

    2014-08-01

    Full Text Available Automata for unordered unranked trees are relevant for defining schemas and queries for data trees in Json or Xml format. While the existing notions are well-investigated concerning expressiveness, they all lack a proper notion of determinism, which makes it difficult to distinguish subclasses of automata for which problems such as inclusion, equivalence, and minimization can be solved efficiently. In this paper, we propose and investigate different notions of "horizontal determinism", starting from automata for unranked trees in which the horizontal evaluation is performed by finite state automata. We show that a restriction to confluent horizontal evaluation leads to polynomial-time emptiness and universality, but still suffers from coNP-completeness of the emptiness of binary intersections. Finally, efficient algorithms can be obtained by imposing an order of horizontal evaluation globally for all automata in the class. Depending on the choice of the order, we obtain different classes of automata, each of which has the same expressiveness as CMso.

  6. Carbon-14 in tree rings

    International Nuclear Information System (INIS)

    Cain, W.F.; Suess, H.E.

    1976-01-01

    In order to investigate how reliably the carbon 14 content of tree rings reflects that of atmospheric carbon dioxide, two types of determinations were carried out: (1) carbon 14 determinations in annual rings from the beginning of this century until 1974 and (2) carbon 14 determinations in synchronous wood from the North American bristlecone pine and from European oak trees, dendrochronologically dated to have grown in the third and fourth century B.C. The first series of measurements showed that bomb-produced radiocarbon was incorporated in wood at a time when it was converted from sapwood to heartwood, whenever radiocarbon from bomb testing was present in the atmosphere. The second series showed that wood more than 2000 years old and grown on two different continents at different altitudes had, within the limits of experimental error, the same radiocarbon content. This work and other experimental evidence, obtained in part by other laboratories, show that tree rings reflect the average radiocarbon content of global atmospheric carbon dioxide accurately within several parts per mil. In rare cases, deviations of up to 10 parts per thousand may be possible. This means that a typical single radiocarbon date for wood or charcoal possesses an intrinsic uncertainty (viz., an estimated ''one-sigma error'' in addition to all the other errors) of the order of +-50 years. This intrinsic uncertainty is independent of the absolute age of the sample. More accurate dates can, in principle, be obtained by the so-called method of ''wiggle matching.''

  7. Random tensors

    CERN Document Server

    Gurau, Razvan

    2017-01-01

    Written by the creator of the modern theory of random tensors, this book is the first self-contained introductory text to this rapidly developing theory. Starting from notions familiar to the average researcher or PhD student in mathematical or theoretical physics, the book presents in detail the theory and its applications to physics. The recent detections of the Higgs boson at the LHC and gravitational waves at LIGO mark new milestones in Physics confirming long standing predictions of Quantum Field Theory and General Relativity. These two experimental results only reinforce today the need to find an underlying common framework of the two: the elusive theory of Quantum Gravity. Over the past thirty years, several alternatives have been proposed as theories of Quantum Gravity, chief among them String Theory. While these theories are yet to be tested experimentally, key lessons have already been learned. Whatever the theory of Quantum Gravity may be, it must incorporate random geometry in one form or another....

  8. Interacting walkers on the Cayley tree, and polymer statistics

    International Nuclear Information System (INIS)

    Priezzhev, V.B.

    1986-01-01

    We obtain the generating function for an ensemble of random walkers on the Cayley tree of coordination number z. The pair interaction between walkers is taken into account. This forbids two walkers to occupy the same lattice point after an equal number of steps. Interacting polymer statistics results from this model if one associates time (or the number of steps) with an additional space coordinate. The limiting free energy appears in a form that corresponds to the phase transition of ''3/2 order.''

  9. Sign Compute Resolve for Random Access

    DEFF Research Database (Denmark)

    Goseling, Jasper; Stefanovic, Cedomir; Popovski, Petar

    2014-01-01

    users collide. We measure the performance of the proposed method in terms of user resolution rate as well as overall throughput of the system. The results show that our approach significantly increases the performance of the system even compared to coded random access, where collisions are not wasted......We present an approach to random access that is based on three elements: physical-layer network coding, signature codes and tree splitting. Upon occurrence of a collision, physical-layer network coding enables the receiver to decode the sum of the information that was transmitted by the individual...

  10. Summer Roost Tree Selection by Eastern Red, Seminole, and Evening Bats in the Upper Coastal Plain of South Carolina

    Energy Technology Data Exchange (ETDEWEB)

    Menzel, M.A.; Carter, T.C.; Ford, W.M.; Chapman, B.R.; Ozier, J.

    2000-01-01

    Radiotraction of six eastern red bats, six seminole bats and twenty-four evening bats to 55, 61, and 65 day roosts during 1996 to 1997 in the Upper Coastal Plain of South Carolina. For each species, testing was done for differences between used roost trees and randomly located trees. Also tested for differences between habitat characteristics surrounding roost trees and randomly located trees. Eastern Red and Seminole bats generally roosted in canopies of hardwood and pine while clinging to foilage and small branches. Evening bats roosted in cavities or under exfoliating bark in pines and dead snags. Forest management strategies named within the study should be beneficial for providing roosts in the Upper Coastal Plain of South Carolina.

  11. TREE SPECIES DIRECT SOWING FOR FOREST RESTORATION

    Directory of Open Access Journals (Sweden)

    Robério Anastácio Ferreira

    2007-09-01

    Full Text Available The direct sowing to tropical forest restoration can be viable when the ecological and silvicultural aspects of species areknown. This work evaluated the effect of breaking seed dormancy and a physical protector on the initial growth of riparian treespecies. The experiment was carried out in a randomized blocks design, in a factorial (2x2, with four blocks and four plots for eachtreatment. The treatment to break seed dormancy used were: immersion in sulphuric acid for 20 minutes and washing in water for 1hour plus soaking for 24 hours for Trema micrantha; immersion in boiling water (100oC with following soaking until refreshing for24 hours to Senna multijuga and Senna macranthera and pre-soaking in water for 2 hours for Solanum granuloso-leprosum. Thephysical protector used was a transparent plastic cup (500mL. The breaking seed dormancy used was efficient in laboratory, exceptfor S. macranthera. In field conditions, it was efficient only for S. multijuga and S. macranthera. The physical protector did notpresented any benefit for the studied tree species regarding seedlings emergence and survival, but it provided significant differencesin height and base diameter for S. multijuga and in height for S. macranthera after three months. After 24 months, T. micranthapresented the highest values for height and basal diameter. S. macranthera presented the height relative growth and T. micrantha thehighest basal diameter. The studied species can be recommended for ecological forest restoration, using direct sowing.

  12. MixtureTree annotator: a program for automatic colorization and visual annotation of MixtureTree.

    Directory of Open Access Journals (Sweden)

    Shu-Chuan Chen

    Full Text Available The MixtureTree Annotator, written in JAVA, allows the user to automatically color any phylogenetic tree in Newick format generated from any phylogeny reconstruction program and output the Nexus file. By providing the ability to automatically color the tree by sequence name, the MixtureTree Annotator provides a unique advantage over any other programs which perform a similar function. In addition, the MixtureTree Annotator is the only package that can efficiently annotate the output produced by MixtureTree with mutation information and coalescent time information. In order to visualize the resulting output file, a modified version of FigTree is used. Certain popular methods, which lack good built-in visualization tools, for example, MEGA, Mesquite, PHY-FI, TreeView, treeGraph and Geneious, may give results with human errors due to either manually adding colors to each node or with other limitations, for example only using color based on a number, such as branch length, or by taxonomy. In addition to allowing the user to automatically color any given Newick tree by sequence name, the MixtureTree Annotator is the only method that allows the user to automatically annotate the resulting tree created by the MixtureTree program. The MixtureTree Annotator is fast and easy-to-use, while still allowing the user full control over the coloring and annotating process.

  13. Public Reactions to New Street Tree Planting

    Directory of Open Access Journals (Sweden)

    Ruth A. Rae

    2010-01-01

    Full Text Available MillionTreesNYC, which has the goal of planting one million trees in New York City by 2017, is intended to make New York City a greener, more sustainable city and is part of the Mayor’s comprehensive long term strategic plan, PlaNYC. Through planting a tree at every suitable sidewalk location in the city, the City of New York is transforming blocks and communities, and providing a variety of environmental, social and aesthetic benefits. This article examines the large scale municipal planting of new street trees and the reaction by some of the pubic to this planting.Trees offer benefits to the city overall, but the public may not understand these benefits or the street tree planting process. Between 2007 and 2009, the Department of Parks & Recreation planted 53,235 new street trees, and received 4,108 items of correspondence from the public. The majority of this correspondence consisted of public comments about the City’s new street tree planting policies and processes including placement objections, maintenance concerns, reports of resultant damage from tree planting operations, requests for new street trees and reports of tree conditions.This study describes the operational policies that guide New York City's municipal street tree planting, and results of content and spatial analysis of the correspondence. Qualitative analysis of the correspondence revealed the public perceptions and concerns related to the MillionTreesNYC program. Spatial analysis explored the relationship between the planting locations of new street trees and the locations of the citizen correspondence.Public reactions to this large scale municipal planting are related to the dual public and private nature of the sidewalk, issues of territoriality, responsibility, aesthetics and place attachment. Correspondence volume was associated with the scale of the new street tree block planting program, and the effectiveness of NYC’s 311 Customer Service Center. The discussion

  14. Important LiDAR metrics for discriminating forest tree species in Central Europe

    Science.gov (United States)

    Shi, Yifang; Wang, Tiejun; Skidmore, Andrew K.; Heurich, Marco

    2018-03-01

    Numerous airborne LiDAR-derived metrics have been proposed for classifying tree species. Yet an in-depth ecological and biological understanding of the significance of these metrics for tree species mapping remains largely unexplored. In this paper, we evaluated the performance of 37 frequently used LiDAR metrics derived under leaf-on and leaf-off conditions, respectively, for discriminating six different tree species in a natural forest in Germany. We firstly assessed the correlation between these metrics. Then we applied a Random Forest algorithm to classify the tree species and evaluated the importance of the LiDAR metrics. Finally, we identified the most important LiDAR metrics and tested their robustness and transferability. Our results indicated that about 60% of LiDAR metrics were highly correlated to each other (|r| > 0.7). There was no statistically significant difference in tree species mapping accuracy between the use of leaf-on and leaf-off LiDAR metrics. However, combining leaf-on and leaf-off LiDAR metrics significantly increased the overall accuracy from 58.2% (leaf-on) and 62.0% (leaf-off) to 66.5% as well as the kappa coefficient from 0.47 (leaf-on) and 0.51 (leaf-off) to 0.58. Radiometric features, especially intensity related metrics, provided more consistent and significant contributions than geometric features for tree species discrimination. Specifically, the mean intensity of first-or-single returns as well as the mean value of echo width were identified as the most robust LiDAR metrics for tree species discrimination. These results indicate that metrics derived from airborne LiDAR data, especially radiometric metrics, can aid in discriminating tree species in a mixed temperate forest, and represent candidate metrics for tree species classification and monitoring in Central Europe.

  15. The limited contribution of large trees to annual biomass production in an old-growth tropical forest.

    Science.gov (United States)

    Ligot, Gauthier; Gourlet-Fleury, Sylvie; Ouédraogo, Dakis-Yaoba; Morin, Xavier; Bauwens, Sébastien; Baya, Fidele; Brostaux, Yves; Doucet, Jean-Louis; Fayolle, Adeline

    2018-04-16

    Although the importance of large trees regarding biodiversity and carbon stock in old-growth forests is undeniable, their annual contribution to biomass production and carbon uptake remains poorly studied at the stand level. To clarify the role of large trees in biomass production, we used data of tree growth, mortality, and recruitment monitored during 20 yr in 10 4-ha plots in a species-rich tropical forest (Central African Republic). Using a random block design, three different silvicultural treatments, control, logged, and logged + thinned, were applied in the 10 plots. Annual biomass gains and losses were analyzed in relation to the relative biomass abundance of large trees and by tree size classes using a spatial bootstrap procedure. Although large trees had high individual growth rates and constituted a substantial amount of biomass, stand-level biomass production decreased with the abundance of large trees in all treatments and plots. The contribution of large trees to annual stand-level biomass production appeared limited in comparison to that of small trees. This pattern did not only originate from differences in abundance of small vs. large trees or differences in initial biomass stocks among tree size classes, but also from a reduced relative growth rate of large trees and a relatively constant mortality rate among tree size classes. In a context in which large trees are increasingly gaining attention as being a valuable and a key structural characteristic of natural forests, the present study brought key insights to better gauge the relatively limited role of large trees in annual stand-level biomass production. In terms of carbon uptake, these results suggest, as already demonstrated, a low net carbon uptake of old-growth forests in comparison to that of logged forests. Tropical forests that reach a successional stage with relatively high density of large trees progressively cease to be carbon sinks as large trees contribute sparsely or even

  16. Folding and unfolding phylogenetic trees and networks.

    Science.gov (United States)

    Huber, Katharina T; Moulton, Vincent; Steel, Mike; Wu, Taoyang

    2016-12-01

    Phylogenetic networks are rooted, labelled directed acyclic graphswhich are commonly used to represent reticulate evolution. There is a close relationship between phylogenetic networks and multi-labelled trees (MUL-trees). Indeed, any phylogenetic network N can be "unfolded" to obtain a MUL-tree U(N) and, conversely, a MUL-tree T can in certain circumstances be "folded" to obtain aphylogenetic network F(T) that exhibits T. In this paper, we study properties of the operations U and F in more detail. In particular, we introduce the class of stable networks, phylogenetic networks N for which F(U(N)) is isomorphic to N, characterise such networks, and show that they are related to the well-known class of tree-sibling networks. We also explore how the concept of displaying a tree in a network N can be related to displaying the tree in the MUL-tree U(N). To do this, we develop aphylogenetic analogue of graph fibrations. This allows us to view U(N) as the analogue of the universal cover of a digraph, and to establish a close connection between displaying trees in U(N) and reconciling phylogenetic trees with networks.

  17. Fuzzy tree automata and syntactic pattern recognition.

    Science.gov (United States)

    Lee, E T

    1982-04-01

    An approach of representing patterns by trees and processing these trees by fuzzy tree automata is described. Fuzzy tree automata are defined and investigated. The results include that the class of fuzzy root-to-frontier recognizable ¿-trees is closed under intersection, union, and complementation. Thus, the class of fuzzy root-to-frontier recognizable ¿-trees forms a Boolean algebra. Fuzzy tree automata are applied to processing fuzzy tree representation of patterns based on syntactic pattern recognition. The grade of acceptance is defined and investigated. Quantitative measures of ``approximate isosceles triangle,'' ``approximate elongated isosceles triangle,'' ``approximate rectangle,'' and ``approximate cross'' are defined and used in the illustrative examples of this approach. By using these quantitative measures, a house, a house with high roof, and a church are also presented as illustrative examples. In addition, three fuzzy tree automata are constructed which have the capability of processing the fuzzy tree representations of ``fuzzy houses,'' ``houses with high roofs,'' and ``fuzzy churches,'' respectively. The results may have useful applications in pattern recognition, image processing, artificial intelligence, pattern database design and processing, image science, and pictorial information systems.

  18. The dynamics of strangling among forest trees.

    Science.gov (United States)

    Okamoto, Kenichi W

    2015-11-07

    Strangler trees germinate and grow on other trees, eventually enveloping and potentially even girdling their hosts. This allows them to mitigate fitness costs otherwise incurred by germinating and competing with other trees on the forest floor, as well as minimize risks associated with host tree-fall. If stranglers can themselves host other strangler trees, they may not even seem to need non-stranglers to persist. Yet despite their high fitness potential, strangler trees neither dominate the communities in which they occur nor is the strategy particularly common outside of figs (genus Ficus). Here we analyze how dynamic interactions between strangling and non-strangling trees can shape the adaptive landscape for strangling mutants and mutant trees that have lost the ability to strangle. We find a threshold which strangler germination rates must exceed for selection to favor the evolution of strangling, regardless of how effectively hemiepiphytic stranglers may subsequently replace their hosts. This condition describes the magnitude of the phenotypic displacement in the ability to germinate on other trees necessary for invasion by a mutant tree that could potentially strangle its host following establishment as an epiphyte. We show how the relative abilities of strangling and non-strangling trees to occupy empty sites can govern whether strangling is an evolutionarily stable strategy, and obtain the conditions for strangler coexistence with non-stranglers. We then elucidate when the evolution of strangling can disrupt stable coexistence between commensal epiphytic ancestors and their non-strangling host trees. This allows us to highlight parallels between the invasion fitness of strangler trees arising from commensalist ancestors, and cases where strangling can arise in concert with the evolution of hemiepiphytism among free-standing ancestors. Finally, we discuss how our results can inform the evolutionary ecology of antagonistic interactions more generally

  19. ETE: a python Environment for Tree Exploration.

    Science.gov (United States)

    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.

  20. ETE: a python Environment for Tree Exploration

    Directory of Open Access Journals (Sweden)

    Gabaldón Toni

    2010-01-01

    Full Text Available Abstract 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.

  1. Effects of changing the random number stride in Monte Carlo calculations

    International Nuclear Information System (INIS)

    Hendricks, J.S.

    1991-01-01

    This paper reports on a common practice in Monte Carlo radiation transport codes which is to start each random walk a specified number of steps up the random number sequence from the previous one. This is called the stride in the random number sequence between source particles. It is used for correlated sampling or to provide tree-structured random numbers. A new random number generator algorithm for the major Monte Carlo code MCNP has been written to allow adjustment of the random number stride. This random number generator is machine portable. The effects of varying the stride for several sample problems are examined

  2. TreeFam: a curated database of phylogenetic trees of animal gene families

    DEFF Research Database (Denmark)

    Li, Heng; Coghlan, Avril; Ruan, Jue

    2006-01-01

    TreeFam is a database of phylogenetic trees of gene families found in animals. It aims to develop a curated resource that presents the accurate evolutionary history of all animal gene families, as well as reliable ortholog and paralog assignments. Curated families are being added progressively......, based on seed alignments and trees in a similar fashion to Pfam. Release 1.1 of TreeFam contains curated trees for 690 families and automatically generated trees for another 11 646 families. These represent over 128 000 genes from nine fully sequenced animal genomes and over 45 000 other animal proteins...

  3. Performance Analysis of Evolutionary Algorithms for Steiner Tree Problems.

    Science.gov (United States)

    Lai, Xinsheng; Zhou, Yuren; Xia, Xiaoyun; Zhang, Qingfu

    2017-01-01

    The Steiner tree problem (STP) aims to determine some Steiner nodes such that the minimum spanning tree over these Steiner nodes and a given set of special nodes has the minimum weight, which is NP-hard. STP includes several important cases. The Steiner tree problem in graphs (GSTP) is one of them. Many heuristics have been proposed for STP, and some of them have proved to be performance guarantee approximation algorithms for this problem. Since evolutionary algorithms (EAs) are general and popular randomized heuristics, it is significant to investigate the performance of EAs for STP. Several empirical investigations have shown that EAs are efficient for STP. However, up to now, there is no theoretical work on the performance of EAs for STP. In this article, we reveal that the (1+1) EA achieves 3/2-approximation ratio for STP in a special class of quasi-bipartite graphs in expected runtime [Formula: see text], where [Formula: see text], [Formula: see text], and [Formula: see text] are, respectively, the number of Steiner nodes, the number of special nodes, and the largest weight among all edges in the input graph. We also show that the (1+1) EA is better than two other heuristics on two GSTP instances, and the (1+1) EA may be inefficient on a constructed GSTP instance.

  4. Methods to overcome dormancy in tree tomato (Solanum betaceum seeds

    Directory of Open Access Journals (Sweden)

    Carlos Kosera Neto

    2015-12-01

    Full Text Available The tree tomato (Solanum betaceum is a poorly known species that has fruits with great economic potential, as it can be consumed in natura or industrialized. However, for reaching this potential, it is necessary the development of technologies for seedlings production. The propagation of this species is mainly done by seeds, but the seed germination process is usually slow, especially under stress conditions. This study aimed at verifying whether tree tomato seeds have dormancy and which is the best method to obtain fast and uniform germination. A completely randomized design was adopted in a 5 x 2 factorial arrangement (methods to overcome dormancy x light, with four replications of 50 or 60 seeds, depending on the production cycle. The methods tested were cold stratification, hydropriming, priming with GA3 solution and control, with or without light. Seed germination and germination rate index, as well as the beginning and average time of germination, were also evaluated. The use of GA3 at a concentration of 100 mg L-1 or 300 mg L-1 is recommended to the germination of tree tomato seeds.

  5. Nitrogen fixation in trees - 1

    Energy Technology Data Exchange (ETDEWEB)

    Dobereiner, J.; Gauthier, D.L.; Diem, H.G.; Dommergues, Y.R.; Bonetti, R.; Oliveira, L.A.; Magalhaes, F.M.M.; Faria, S.M. de; Franco, A.A.; Menandro, M.S.

    1984-01-01

    Six papers are presented from the symposium. Dobereiner, J.; Nodulation and nitrogen fixation in leguminous trees, 83-90, (15 ref.), reviews studies on Brazilian species. Gauthier, D.L., Diem, H.G., Dommergues, Y.R., Tropical and subtropical actinorhizal plants, 119-136, (Refs. 50), reports on studies on Casuarinaceae. Bonetti, R., Oliveira, L.A., Magalhaes, F.M.M.; Rhizobium populations and occurrence of VA mycorrhizae in plantations of forest trees, 137-142, (Refs. 15), studies Amazonia stands of Cedrelinga catenaeformis, Calophyllum brasiliense, Dipteryx odorata, D. potiphylla, Carapa guianensis, Goupia glabra, Tabebuia serratifolia, Clarisia racemosa, Pithecellobium racemosum, Vouacapoua pallidior, Eperua bijuga, and Diplotropis species. Nodulation was observed in Cedrelinga catenaeformis and V. pallidior. Faria, S.M. de, Franco, A.A., Menandro, M.S., Jesus, R.M. de, Baitello, J.B.; Aguiar, O.T. de, Doebereiner, J; survey of nodulation in leguminous tree species native to southeastern Brazil, 143-153, (Refs. 7), reports on 119 species, with first reports of nodulation in the genera Bowdichia, Poecilanthe, Melanoxylon, Moldenhaurea (Moldenhawera), and Pseudosamanea. Gaiad, S., Carpanezzi, A.A.; Occurrence of Rhizobium in Leguminosae of silvicultural interest for south Brazil, 155-158, (Refs. 2). Nodulation is reported in Mimosa scabrella, Acacia mearnsii, A. longifolia various trinervis, Enterolobium contortisiliquum, and Erythrina falcata. Magalhaes, L.M.S., Blum, W.E.H., Nodulation and growth of Cedrelinga catanaeformis in experimental stands in the Manaus region - Amazonas, 159-164, (Refs. 5). Results indicate that C. catenaeformis can be used in degraded areas of very low soil fertility.

  6. Optimal Monotone Drawings of Trees

    OpenAIRE

    He, Dayu; He, Xin

    2016-01-01

    A monotone drawing of a graph G is a straight-line drawing of G such that, for every pair of vertices u,w in G, there exists abpath P_{uw} in G that is monotone in some direction l_{uw}. (Namely, the order of the orthogonal projections of the vertices of P_{uw} on l_{uw} is the same as the order they appear in P_{uw}.) The problem of finding monotone drawings for trees has been studied in several recent papers. The main focus is to reduce the size of the drawing. Currently, the smallest drawi...

  7. Helping to increase tree crops

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1970-07-01

    Tree crops such as coffee, coconuts, palm oil, citrus fruits and cocoa are of major importance to the economies of countries in Africa, Asia and Latin America, and may be a prime source of foreign exchange earnings. The search for ways to improve efficiently the yields of crops like these - now being aided by the Division of Atomic Energy in Food and Agriculture operated jointly with the Food and Agriculture Organization - thus has a clearly defined practical goal. D. Nethsinghe deals here with some of the work. (author)

  8. Helping to increase tree crops

    International Nuclear Information System (INIS)

    1970-01-01

    Tree crops such as coffee, coconuts, palm oil, citrus fruits and cocoa are of major importance to the economies of countries in Africa, Asia and Latin America, and may be a prime source of foreign exchange earnings. The search for ways to improve efficiently the yields of crops like these - now being aided by the Division of Atomic Energy in Food and Agriculture operated jointly with the Food and Agriculture Organization - thus has a clearly defined practical goal. D. Nethsinghe deals here with some of the work. (author)

  9. Whole-tree distribution and temporal variation of non-structural carbohydrates in broadleaf evergreen trees.

    Science.gov (United States)

    Smith, Merryn G; Miller, Rebecca E; Arndt, Stefan K; Kasel, Sabine; Bennett, Lauren T

    2018-04-01

    Non-structural carbohydrates (NSCs) form a fundamental yet poorly quantified carbon pool in trees. Studies of NSC seasonality in forest trees have seldom measured whole-tree NSC stocks and allocation among organs, and are not representative of all tree functional types. Non-structural carbohydrate research has primarily focussed on broadleaf deciduous and coniferous evergreen trees with distinct growing seasons, while broadleaf evergreen trees remain under-studied despite their different growth phenology. We measured whole-tree NSC allocation and temporal variation in Eucalyptus obliqua L'Hér., a broadleaf evergreen tree species typically occurring in mixed-age temperate forests, which has year-round growth and the capacity to resprout after fire. Our overarching objective was to improve the empirical basis for understanding the functional importance of NSC allocation and stock changes at the tree- and organ-level in this tree functional type. Starch was the principal storage carbohydrate and was primarily stored in the stem and roots of young (14-year-old) trees rather than the lignotuber, which did not appear to be a specialized starch storage organ. Whole-tree NSC stocks were depleted during spring and summer due to significant decreases in starch mass in the roots and stem, seemingly to support root and crown growth but potentially exacerbated by water stress in summer. Seasonality of stem NSCs differed between young and mature trees, and was not synchronized with stem basal area increments in mature trees. Our results suggest that the relative magnitude of seasonal NSC stock changes could vary with tree growth stage, and that the main drivers of NSC fluctuations in broadleaf evergreen trees in temperate biomes could be periodic disturbances such as summer drought and fire, rather than growth phenology. These results have implications for understanding post-fire tree recovery via resprouting, and for incorporating NSC pools into carbon models of mixed

  10. TreeNetViz: revealing patterns of networks over tree structures.

    Science.gov (United States)

    Gou, Liang; Zhang, Xiaolong Luke

    2011-12-01

    Network data often contain important attributes from various dimensions such as social affiliations and areas of expertise in a social network. If such attributes exhibit a tree structure, visualizing a compound graph consisting of tree and network structures becomes complicated. How to visually reveal patterns of a network over a tree has not been fully studied. In this paper, we propose a compound graph model, TreeNet, to support visualization and analysis of a network at multiple levels of aggregation over a tree. We also present a visualization design, TreeNetViz, to offer the multiscale and cross-scale exploration and interaction of a TreeNet graph. TreeNetViz uses a Radial, Space-Filling (RSF) visualization to represent the tree structure, a circle layout with novel optimization to show aggregated networks derived from TreeNet, and an edge bundling technique to reduce visual complexity. Our circular layout algorithm reduces both total edge-crossings and edge length and also considers hierarchical structure constraints and edge weight in a TreeNet graph. These experiments illustrate that the algorithm can reduce visual cluttering in TreeNet graphs. Our case study also shows that TreeNetViz has the potential to support the analysis of a compound graph by revealing multiscale and cross-scale network patterns. © 2011 IEEE

  11. VC-dimension of univariate decision trees.

    Science.gov (United States)

    Yildiz, Olcay Taner

    2015-02-01

    In this paper, we give and prove the lower bounds of the Vapnik-Chervonenkis (VC)-dimension of the univariate decision tree hypothesis class. The VC-dimension of the univariate decision tree depends on the VC-dimension values of its subtrees and the number of inputs. Via a search algorithm that calculates the VC-dimension of univariate decision trees exhaustively, we show that our VC-dimension bounds are tight for simple trees. To verify that the VC-dimension bounds are useful, we also use them to get VC-generalization bounds for complexity control using structural risk minimization in decision trees, i.e., pruning. Our simulation results show that structural risk minimization pruning using the VC-dimension bounds finds trees that are more accurate as those pruned using cross validation.

  12. Geodesic atlas-based labeling of anatomical trees

    DEFF Research Database (Denmark)

    Feragen, Aasa; Petersen, Jens; Owen, Megan

    2015-01-01

    We present a fast and robust atlas-based algorithm for labeling airway trees, using geodesic distances in a geometric tree-space. Possible branch label configurations for an unlabeled airway tree are evaluated using distances to a training set of labeled airway trees. In tree-space, airway tree t...... equally complete airway trees, and comparable in performance to that of experts in pulmonary medicine, emphasizing the suitability of the labeling algorithm for clinical use....

  13. On the structure of path-like trees

    OpenAIRE

    Muntaner Batle, Francesc Antoni; Rius Font, Miquel

    2007-01-01

    We study the structure of path-like trees. In order to do this, we introduce a set of trees that we call expandable trees. In this paper we also generalize the concept of path-like trees and we call such generalization generalized path-like trees. As in the case of path-like trees, generalized path-like trees, have very nice labeling properties.

  14. Reconciliation with non-binary species trees.

    Science.gov (United States)

    Vernot, Benjamin; Stolzer, Maureen; Goldman, Aiton; Durand, Dannie

    2008-10-01

    Reconciliation extracts information from the topological incongruence between gene and species trees to infer duplications and losses in the history of a gene family. The inferred duplication-loss histories provide valuable information for a broad range of biological applications, including ortholog identification, estimating gene duplication times, and rooting and correcting gene trees. While reconciliation for binary trees is a tractable and well studied problem, there are no algorithms for reconciliation with non-binary species trees. Yet a striking proportion of species trees are non-binary. For example, 64% of branch points in the NCBI taxonomy have three or more children. When applied to non-binary species trees, current algorithms overestimate the number of duplications because they cannot distinguish between duplication and incomplete lineage sorting. We present the first algorithms for reconciling binary gene trees with non-binary species trees under a duplication-loss parsimony model. Our algorithms utilize an efficient mapping from gene to species trees to infer the minimum number of duplications in O(|V(G) | x (k(S) + h(S))) time, where |V(G)| is the number of nodes in the gene tree, h(S) is the height of the species tree and k(S) is the size of its largest polytomy. We present a dynamic programming algorithm which also minimizes the total number of losses. Although this algorithm is exponential in the size of the largest polytomy, it performs well in practice for polytomies with outdegree of 12 or less. We also present a heuristic which estimates the minimal number of losses in polynomial time. In empirical tests, this algorithm finds an optimal loss history 99% of the time. Our algorithms have been implemented in NOTUNG, a robust, production quality, tree-fitting program, which provides a graphical user interface for exploratory analysis and also supports automated, high-throughput analysis of large data sets.

  15. Nonbinary tree-based phylogenetic networks

    OpenAIRE

    Jetten, Laura; van Iersel, Leo

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

  16. Transforming phylogenetic networks: Moving beyond tree space

    OpenAIRE

    Huber, Katharina T.; Moulton, Vincent; Wu, Taoyang

    2016-01-01

    Phylogenetic networks are a generalization of phylogenetic trees that are used to represent reticulate evolution. Unrooted phylogenetic networks form a special class of such networks, which naturally generalize unrooted phylogenetic trees. In this paper we define two operations on unrooted phylogenetic networks, one of which is a generalization of the well-known nearest-neighbor interchange (NNI) operation on phylogenetic trees. We show that any unrooted phylogenetic network can be transforme...

  17. Tank waste remediation system architecture tree

    International Nuclear Information System (INIS)

    PECK, L.G.

    1999-01-01

    The TWRS Architecture Tree presented in this document is a hierarchical breakdown to support the TWRS systems engineering analysis of the TWRS physical system, including facilities, hardware and software. The purpose for this systems engineering architecture tree is to describe and communicate the system's selected and existing architecture, to provide a common structure to improve the integration of work and resulting products, and to provide a framework as a basis for TWRS Specification Tree development

  18. Tank waste remediation system architecture tree; TOPICAL

    International Nuclear Information System (INIS)

    PECK, L.G.

    1999-01-01

    The TWRS Architecture Tree presented in this document is a hierarchical breakdown to support the TWRS systems engineering analysis of the TWRS physical system, including facilities, hardware and software. The purpose for this systems engineering architecture tree is to describe and communicate the system's selected and existing architecture, to provide a common structure to improve the integration of work and resulting products, and to provide a framework as a basis for TWRS Specification Tree development

  19. Random pulse generator

    International Nuclear Information System (INIS)

    Guo Ya'nan; Jin Dapeng; Zhao Dixin; Liu Zhen'an; Qiao Qiao; Chinese Academy of Sciences, Beijing

    2007-01-01

    Due to the randomness of radioactive decay and nuclear reaction, the signals from detectors are random in time. But normal pulse generator generates periodical pulses. To measure the performances of nuclear electronic devices under random inputs, a random generator is necessary. Types of random pulse generator are reviewed, 2 digital random pulse generators are introduced. (authors)

  20. Random matrices and random difference equations

    International Nuclear Information System (INIS)

    Uppuluri, V.R.R.

    1975-01-01

    Mathematical models leading to products of random matrices and random difference equations are discussed. A one-compartment model with random behavior is introduced, and it is shown how the average concentration in the discrete time model converges to the exponential function. This is of relevance to understanding how radioactivity gets trapped in bone structure in blood--bone systems. The ideas are then generalized to two-compartment models and mammillary systems, where products of random matrices appear in a natural way. The appearance of products of random matrices in applications in demography and control theory is considered. Then random sequences motivated from the following problems are studied: constant pulsing and random decay models, random pulsing and constant decay models, and random pulsing and random decay models

  1. Maintenance of carbohydrate transport in tall trees

    DEFF Research Database (Denmark)

    Savage, Jessica A.; Beecher, Sierra D.; Clerx, Laura

    2017-01-01

    Trees present a critical challenge to long-distance transport because as a tree grows in height and the transport pathway increases in length, the hydraulic resistance of the vascular tissue should increase. This has led many to question whether trees can rely on a passive transport mechanism to ...... that reduce transport resistance. As a result, the key to the long-standing mystery of how trees maintain phloem transport as they increase in size lies in the structure of the phloem and its ability to change hydraulic properties with plant height.......Trees present a critical challenge to long-distance transport because as a tree grows in height and the transport pathway increases in length, the hydraulic resistance of the vascular tissue should increase. This has led many to question whether trees can rely on a passive transport mechanism...... in the leaves of a tall tree in situ. Across nine deciduous species, we find that hydraulic resistance in the phloem scales inversely with plant height because of a shift in sieve element structure along the length of individual trees. This scaling relationship seems robust across multiple species despite large...

  2. Breaking the fault tree circular logic

    International Nuclear Information System (INIS)

    Lankin, M.

    2000-01-01

    Event tree - fault tree approach to model failures of nuclear plants as well as of other complex facilities is noticeably dominant now. This approach implies modeling an object in form of unidirectional logical graph - tree, i.e. graph without circular logic. However, genuine nuclear plants intrinsically demonstrate quite a few logical loops (circular logic), especially where electrical systems are involved. This paper shows the incorrectness of existing practice of circular logic breaking by elimination of part of logical dependencies and puts forward a formal algorithm, which enables the analyst to correctly model the failure of complex object, which involves logical dependencies between system and components, in form of fault tree. (author)

  3. Modular representation and analysis of fault trees

    Energy Technology Data Exchange (ETDEWEB)

    Olmos, J; Wolf, L [Massachusetts Inst. of Tech., Cambridge (USA). Dept. of Nuclear Engineering

    1978-08-01

    An analytical method to describe fault tree diagrams in terms of their modular compositions is developed. Fault tree structures are characterized by recursively relating the top tree event to all its basic component inputs through a set of equations defining each of the modulus for the fault tree. It is shown that such a modular description is an extremely valuable tool for making a quantitative analysis of fault trees. The modularization methodology has been implemented into the PL-MOD computer code, written in PL/1 language, which is capable of modularizing fault trees containing replicated components and replicated modular gates. PL-MOD in addition can handle mutually exclusive inputs and explicit higher order symmetric (k-out-of-n) gates. The step-by-step modularization of fault trees performed by PL-MOD is demonstrated and it is shown how this procedure is only made possible through an extensive use of the list processing tools available in PL/1. A number of nuclear reactor safety system fault trees were analyzed. PL-MOD performed the modularization and evaluation of the modular occurrence probabilities and Vesely-Fussell importance measures for these systems very efficiently. In particular its execution time for the modularization of a PWR High Pressure Injection System reduced fault tree was 25 times faster than that necessary to generate its equivalent minimal cut-set description using MOCUS, a code considered to be fast by present standards.

  4. Tritium concentrations in tree ring cellulose

    International Nuclear Information System (INIS)

    Kaji, Toshio; Momoshima, Noriyuki; Takashima, Yoshimasa.

    1989-01-01

    Measurements of tritium (tissue bound tritium; TBT) concentration in tree rings are presented and discussed. Such measurement is expected to provide a useful means of estimating the tritium level in the environment in the past. The concentration of tritium bound in the tissue (TBT) in a tree ring considered to reflect the environmental tritium level in the area at the time of the formation of the ring, while the concentration of tritium in the free water in the tissue represents the current environmental tritium level. First, tritium concentration in tree ring cellulose sampled from a cedar tree grown in a typical environment in Fukuoka Prefecture is compared with the tritium concentration in precipitation in Tokyo. Results show that the year-to-year variations in the tritium concentration in the tree rings agree well with those in precipitation. The maximum concentration, which occurred in 1963, is attibuted to atmospheric nuclear testing which was performed frequently during the 1961 - 1963 period. Measurement is also made of the tritium concentration in tree ring cellulose sampled from a pine tree grown near the Isotope Center of Kyushu University (Fukuoka). Results indicate that the background level is higher probably due to the release of tritium from the facilities around the pine tree. Thus, measurement of tritium in tree ring cellulose clearly shows the year-to-year variation in the tritium concentration in the atmosphere. (N.K.)

  5. The space of ultrametric phylogenetic trees.

    Science.gov (United States)

    Gavryushkin, Alex; Drummond, Alexei J

    2016-08-21

    The reliability of a phylogenetic inference method from genomic sequence data is ensured by its statistical consistency. Bayesian inference methods produce a sample of phylogenetic trees from the posterior distribution given sequence data. Hence the question of statistical consistency of such methods is equivalent to the consistency of the summary of the sample. More generally, statistical consistency is ensured by the tree space used to analyse the sample. In this paper, we consider two standard parameterisations of phylogenetic time-trees used in evolutionary models: inter-coalescent interval lengths and absolute times of divergence events. For each of these parameterisations we introduce a natural metric space on ultrametric phylogenetic trees. We compare the introduced spaces with existing models of tree space and formulate several formal requirements that a metric space on phylogenetic trees must possess in order to be a satisfactory space for statistical analysis, and justify them. We show that only a few known constructions of the space of phylogenetic trees satisfy these requirements. However, our results suggest that these basic requirements are not enough to distinguish between the two metric spaces we introduce and that the choice between metric spaces requires additional properties to be considered. Particularly, that the summary tree minimising the square distance to the trees from the sample might be different for different parameterisations. This suggests that further fundamental insight is needed into the problem of statistical consistency of phylogenetic inference methods. Copyright © 2016 The Authors. Published by Elsevier Ltd.. All rights reserved.

  6. Fruit load governs transpiration of olive trees

    Science.gov (United States)

    Bustan, Amnon; Dag, Arnon; Yermiyahu, Uri; Erel, Ran; Presnov, Eugene; Agam, Nurit; Kool, Dilia; Iwema, Joost; Zipori, Isaac; Ben-Gal, Alon

    2016-01-01

    We tested the hypothesis that whole-tree water consumption of olives (Olea europaea L.) is fruit load-dependent and investigated the driving physiological mechanisms. Fruit load was manipulated in mature olives grown in weighing-drainage lysimeters. Fruit was thinned or entirely removed from trees at three separate stages of growth: early, mid and late in the season. Tree-scale transpiration, calculated from lysimeter water balance, was found to be a function of fruit load, canopy size and weather conditions. Fruit removal caused an immediate decline in water consumption, measured as whole-plant transpiration normalized to tree size, which persisted until the end of the season. The later the execution of fruit removal, the greater was the response. The amount of water transpired by a fruit-loaded tree was found to be roughly 30% greater than that of an equivalent low- or nonyielding tree. The tree-scale response to fruit was reflected in stem water potential but was not mirrored in leaf-scale physiological measurements of stomatal conductance or photosynthesis. Trees with low or no fruit load had higher vegetative growth rates. However, no significant difference was observed in the overall aboveground dry biomass among groups, when fruit was included. This case, where carbon sources and sinks were both not limiting, suggests that the role of fruit on water consumption involves signaling and alterations in hydraulic properties of vascular tissues and tree organs. PMID:26802540

  7. Big data of tree species distributions

    DEFF Research Database (Denmark)

    Serra-Diaz, Josep M.; Enquist, Brian J.; Maitner, Brian

    2018-01-01

    are currently available in big databases, several challenges hamper their use, notably geolocation problems and taxonomic uncertainty. Further, we lack a complete picture of the data coverage and quality assessment for open/public databases of tree occurrences. Methods: We combined data from five major...... and data aggregation, especially from national forest inventory programs, to improve the current publicly available data.......Background: Trees play crucial roles in the biosphere and societies worldwide, with a total of 60,065 tree species currently identified. Increasingly, a large amount of data on tree species occurrences is being generated worldwide: from inventories to pressed plants. While many of these data...

  8. Local biotic adaptation of trees and shrubs to plant neighbors

    Science.gov (United States)

    Grady, Kevin C.; Wood, Troy E.; Kolb, Thomas E.; Hersch-Green, Erika; Shuster, Stephen M.; Gehring, Catherine A.; Hart, Stephen C.; Allan, Gerard J.; Whitham, Thomas G.

    2017-01-01

    Natural selection as a result of plant–plant interactions can lead to local biotic adaptation. This may occur where species frequently interact and compete intensely for resources limiting growth, survival, and reproduction. Selection is demonstrated by comparing a genotype interacting with con- or hetero-specific sympatric neighbor genotypes with a shared site-level history (derived from the same source location), to the same genotype interacting with foreign neighbor genotypes (from different sources). Better genotype performance in sympatric than allopatric neighborhoods provides evidence of local biotic adaptation. This pattern might be explained by selection to avoid competition by shifting resource niches (differentiation) or by interactions benefitting one or more members (facilitation). We tested for local biotic adaptation among two riparian trees, Populus fremontii and Salix gooddingii, and the shrub Salix exigua by transplanting replicated genotypes from multiple source locations to a 17 000 tree common garden with sympatric and allopatric treatments along the Colorado River in California. Three major patterns were observed: 1) across species, 62 of 88 genotypes grew faster with sympatric neighbors than allopatric neighbors; 2) these growth rates, on an individual tree basis, were 44, 15 and 33% higher in sympatric than allopatric treatments for P. fremontii, S. exigua and S. gooddingii, respectively, and; 3) survivorship was higher in sympatric treatments for P. fremontiiand S. exigua. These results support the view that fitness of foundation species supporting diverse communities and dominating ecosystem processes is determined by adaptive interactions among multiple plant species with the outcome that performance depends on the genetic identity of plant neighbors. The occurrence of evolution in a plant-community context for trees and shrubs builds on ecological evolutionary research that has demonstrated co-evolution among herbaceous taxa, and

  9. Screening of tomato varieties for fruit tree based Agroforestry system

    Directory of Open Access Journals (Sweden)

    J. Hossain

    2014-12-01

    Full Text Available An experiment was conducted with four tomato varieties under a six year old orchard was accomplished at the Bangabandhu Sheikh Mujibur Rahman Agricultural University (BSMRAU research farm during October 2011 to April 2012. The experiment was laid out in a Randomized Complete Block Design with three replications. Four tomato varieties (BARI Tomato 2, BARI Tomato 8, BARI Tomato 14 and BARI Tomato 15 were grown under guava, mango, olive and control. Results showed that light availability in control plot (999.75 μ mol m-2s-1 was remarkably higher over fruit tree based agroforestry systems and it was 58.8, 43.9 and 31.5% of the control for guava, mango and olive based systems, respectively. The shortest tomato plant was observed in olive based system (54.91 cm, while the tallest plant was observed in mango based system (60.09 cm. The highest SPAD value and number of primary branches per plant was recorded in control plot. Fruit length, fruit girth was found lowest in olive based system. The highest yield (34.06 t ha-1 was recorded in control plot while the lowest yield (10.26 t ha-1 was recorded in olive based system. The economic performance of fruit tree based tomato production system showed that both the net return and BCR of mango and guava based system was higher over control and olive based system. The contents of organic carbon, nitrogen, available phosphorus, potassium and sulfur of before experimentation soil were slightly higher in fruit tree based agroforestry systems than the control. After experimentation, nutrient elements in soil were found increased slightly than initial soils. Fruit tree based agroforestry systems could be ranked based on the economic performance as mango> guava> control> olive based system with BARI Tomato 15, BARI Tomato 2, BARI Tomato 14 and BARI Tomato 8, respectively.

  10. TreeScaper: Visualizing and Extracting Phylogenetic Signal from Sets of Trees.

    Science.gov (United States)

    Huang, Wen; Zhou, Guifang; Marchand, Melissa; Ash, Jeremy R; Morris, David; Van Dooren, Paul; Brown, Jeremy M; Gallivan, Kyle A; Wilgenbusch, Jim C

    2016-12-01

    Modern phylogenomic analyses often result in large collections of phylogenetic trees representing uncertainty in individual gene trees, variation across genes, or both. Extracting phylogenetic signal from these tree sets can be challenging, as they are difficult to visualize, explore, and quantify. To overcome some of these challenges, we have developed TreeScaper, an application for tree set visualization as well as the identification of distinct phylogenetic signals. GUI and command-line versions of TreeScaper and a manual with tutorials can be downloaded from https://github.com/whuang08/TreeScaper/releases TreeScaper is distributed under the GNU General Public License. © The Author 2016. Published by Oxford University Press on behalf of the Society for Molecular Biology and Evolution. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

  11. Computer aided fault tree synthesis

    International Nuclear Information System (INIS)

    Poucet, A.

    1983-01-01

    Nuclear as well as non-nuclear organisations are showing during the past few years a growing interest in the field of reliability analysis. This urges for the development of powerful, state of the art methods and computer codes for performing such analysis on complex systems. In this report an interactive, computer aided approach is discussed, based on the well known fault tree technique. The time consuming and difficut task of manually constructing a system model (one or more fault trees) is replaced by an efficient interactive procedure in which the flexibility and the learning process inherent to the manual approach are combined with the accuracy in the modelling and the speed of the fully automatical approach. The method presented is based upon the use of a library containing component models. The possibility of setting up a standard library of models of general use and the link with a data collection system are discussed. The method has been implemented in the CAFTS-SALP software package which is described shortly in the report

  12. Application of decision tree model for the ground subsidence hazard mapping near abandoned underground coal mines.

    Science.gov (United States)

    Lee, Saro; Park, Inhye

    2013-09-30

    Subsidence of ground caused by underground mines poses hazards to human life and property. This study analyzed the hazard to ground subsidence using factors that can affect ground subsidence and a decision tree approach in a geographic information system (GIS). The study area was Taebaek, Gangwon-do, Korea, where many abandoned underground coal mines exist. Spatial data, topography, geology, and various ground-engineering data for the subsidence area were collected and compiled in a database for mapping ground-subsidence hazard (GSH). The subsidence area was randomly split 50/50 for training and validation of the models. A data-mining classification technique was applied to the GSH mapping, and decision trees were constructed using the chi-squared automatic interaction detector (CHAID) and the quick, unbiased, and efficient statistical tree (QUEST) algorithms. The frequency ratio model was also applied to the GSH mapping for comparing with probabilistic model. The resulting GSH maps were validated using area-under-the-curve (AUC) analysis with the subsidence area data that had not been used for training the model. The highest accuracy was achieved by the decision tree model using CHAID algorithm (94.01%) comparing with QUEST algorithms (90.37%) and frequency ratio model (86.70%). These accuracies are higher than previously reported results for decision tree. Decision tree methods can therefore be used efficiently for GSH analysis and might be widely used for prediction of various spatial events. Copyright © 2013. Published by Elsevier Ltd.

  13. Development of a New Decision Tree to Rapidly Screen Chemical Estrogenic Activities of Xenopus laevis.

    Science.gov (United States)

    Wang, Ting; Li, Weiying; Zheng, Xiaofeng; Lin, Zhifen; Kong, Deyang

    2014-02-01

    During the last past decades, there is an increasing number of studies about estrogenic activities of the environmental pollutants on amphibians and many determination methods have been proposed. However, these determination methods are time-consuming and expensive, and a rapid and simple method to screen and test the chemicals for estrogenic activities to amphibians is therefore imperative. Herein is proposed a new decision tree formulated not only with physicochemical parameters but also a biological parameter that was successfully used to screen estrogenic activities of the chemicals on amphibians. The biological parameter, CDOCKER interaction energy (Ebinding ) between chemicals and the target proteins was calculated based on the method of molecular docking, and it was used to revise the decision tree formulated by Hong only with physicochemical parameters for screening estrogenic activity of chemicals in rat. According to the correlation between Ebinding of rat and Xenopus laevis, a new decision tree for estrogenic activities in Xenopus laevis is finally proposed. Then it was validated by using the randomly 8 chemicals which can be frequently exposed to Xenopus laevis, and the agreement between the results from the new decision tree and the ones from experiments is generally satisfactory. Consequently, the new decision tree can be used to screen the estrogenic activities of the chemicals, and combinational use of the Ebinding and classical physicochemical parameters can greatly improves Hong's decision tree. Copyright © 2014 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

  14. Genetic distances and phylogenetic trees of different Awassi sheep populations based on DNA sequencing.

    Science.gov (United States)

    Al-Atiyat, R M; Aljumaah, R S

    2014-08-27

    This study aimed to estimate evolutionary distances and to reconstruct phylogeny trees between different Awassi sheep populations. Thirty-two sheep individuals from three different geographical areas of Jordan and the Kingdom of Saudi Arabia (KSA) were randomly sampled. DNA was extracted from the tissue samples and sequenced using the T7 promoter universal primer. Different phylogenetic trees were reconstructed from 0.64-kb DNA sequences using the MEGA software with the best general time reverse distance model. Three methods of distance estimation were then used. The maximum composite likelihood test was considered for reconstructing maximum likelihood, neighbor-joining and UPGMA trees. The maximum likelihood tree indicated three major clusters separated by cytosine (C) and thymine (T). The greatest distance was shown between the South sheep and North sheep. On the other hand, the KSA sheep as an outgroup showed shorter evolutionary distance to the North sheep population than to the others. The neighbor-joining and UPGMA trees showed quite reliable clusters of evolutionary differentiation of Jordan sheep populations from the Saudi population. The overall results support geographical information and ecological types of the sheep populations studied. Summing up, the resulting phylogeny trees may contribute to the limited information about the genetic relatedness and phylogeny of Awassi sheep in nearby Arab countries.

  15. PHENOLOGICAL CHARACTERISTICS OF GENOTYPES FROM CATTLEY GUAVA AND GUAVA TREES SUBMITTED TO FRUCTIFICATION PRUNING

    Directory of Open Access Journals (Sweden)

    CINTIA APARECIDA BREMENKAMP

    Full Text Available ABSTRACT Psidium cattleianum Sabine is a species from the Myrtaceae family that serves as an option for the native fruits cultivation, besides being considered a source of resistance to the Meloidogyne enterolobii nematode. Although cattley guava trees from this species produce flower buds in young branches, there are no reports of response to fructification pruning or phenological synchronism with the guava tree. The objective of this paper was the comparative evaluation of the genotype response of strawberry guava trees and guava cultivars to fructification pruning, thus, describing the phenology of both species under the same cultivation conditions. The experiment was conducted under an entirely randomized outline, in 7x2 factorial scheme, being evaluated seven genotypes (three from strawberry guava and four from guava trees, and with pruning performed in two seasons (May 2012 and March 2013, with three repetitions. Fructification pruning was executed by a lopping on all mature branches, from the last growth flow in the woody branch region. Were evaluated budding characteristics and fruit harvesting, as well as number of days from pruning to the observation of the phenological event. Cattley guava tree pruning stimulated fructification of all three genotypes after pruning done on May and two genotypes after the March’s pruning. There has been a sync between the guava cultivars’ flowering and both strawberry guava trees genotypes, when those were pruned on May.

  16. Minimizing the cost of translocation failure with decision-tree models that predict species' behavioral response in translocation sites.

    Science.gov (United States)

    Ebrahimi, Mehregan; Ebrahimie, Esmaeil; Bull, C Michael

    2015-08-01

    The high number of failures is one reason why translocation is often not recommended. Considering how behavior changes during translocations may improve translocation success. To derive decision-tree models for species' translocation, we used data on the short-term responses of an endangered Australian skink in 5 simulated translocations with different release conditions. We used 4 different decision-tree algorithms (decision tree, decision-tree parallel, decision stump, and random forest) with 4 different criteria (gain ratio, information gain, gini index, and accuracy) to investigate how environmental and behavioral parameters may affect the success of a translocation. We assumed behavioral changes that increased dispersal away from a release site would reduce translocation success. The trees became more complex when we included all behavioral parameters as attributes, but these trees yielded more detailed information about why and how dispersal occurred. According to these complex trees, there were positive associations between some behavioral parameters, such as fight and dispersal, that showed there was a higher chance, for example, of dispersal among lizards that fought than among those that did not fight. Decision trees based on parameters related to release conditions were easier to understand and could be used by managers to make translocation decisions under different circumstances. © 2015 Society for Conservation Biology.

  17. Encoding phylogenetic trees in terms of weighted quartets.

    Science.gov (United States)

    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.

  18. SOFT TREE: Fault Tree Technique as Applied to Software. Revision.

    Science.gov (United States)

    1983-10-01

    13 12 - 16 03 - 18 09 - 19 01 - 19 02 - 19 03 - 19 05 18. Con’t Non- Nuclear Munition, Non- Nuclear Munition Safety, Fuze Safety, Microprocessor...costucin the’ V’Y wvSoft Tree be ver fam-’il~. iar-a’--. that te persnns conihhsutnge thoftd refec be very familia wthipeetino microprocessosor atd idotwee h...ro 7- qSf" fart~b -To WA0 IFu t TOC6Lf e aF ’t9 q-EN rNz Al fC1~ATOk -1- 1AP6AG $ LA ? To.~ Yujiif’ ToA4. IWOv~:EAii CI~t~J~13Lf ToP5M A~E F CAP Avrif

  19. Decision tree analysis in subarachnoid hemorrhage: prediction of outcome parameters during the course of aneurysmal subarachnoid hemorrhage using decision tree analysis.

    Science.gov (United States)

    Hostettler, Isabel Charlotte; Muroi, Carl; Richter, Johannes Konstantin; Schmid, Josef; Neidert, Marian Christoph; Seule, Martin; Boss, Oliver; Pangalu, Athina; Germans, Menno Robbert; Keller, Emanuela

    2018-01-19

    OBJECTIVE The aim of this study was to create prediction models for outcome parameters by decision tree analysis based on clinical and laboratory data in patients with aneurysmal subarachnoid hemorrhage (aSAH). METHODS The database consisted of clinical and laboratory parameters of 548 patients with aSAH who were admitted to the Neurocritical Care Unit, University Hospital Zurich. To examine the model performance, the cohort was randomly divided into a derivation cohort (60% [n = 329]; training data set) and a validation cohort (40% [n = 219]; test data set). The classification and regression tree prediction algorithm was applied to predict death, functional outcome, and ventriculoperitoneal (VP) shunt dependency. Chi-square automatic interaction detection was applied to predict delayed cerebral infarction on days 1, 3, and 7. RESULTS The overall mortality was 18.4%. The accuracy of the decision tree models was good for survival on day 1 and favorable functional outcome at all time points, with a difference between the training and test data sets of decision trees enables exploration of dependent variables in the context of multiple changing influences over the course of an illness. The decision tree currently generated increases awareness of the early systemic stress response, which is seemingly pertinent for prognostication.

  20. Physiological and biochemical characterization of mango tree with paclobutrazol application via irrigation.

    OpenAIRE

    SOUZA, M. A. de; MESQUITA, A. C.; SIMOES, W. L.; FERREITA, K. M.; ARAÚJO, E. F. J.

    2017-01-01

    Paclobutrazol application in mango tree floral induction is followed by changes in the hormonal balance and carbohydrates production. This study aimed at evaluating the physiological and biochemical variables of mango tree (Palmer cultivar) by applying paclobutrazol doses via irrigation. The experimental design was randomized blocks, with five paclobutrazol doses (0.7 g, 1.0 g, 1.3 g, 1.6 g and 1.9 g of a.i. per linear meter of canopy) and one additional treatment, with one dose in the conven...

  1. Anomalous diffusion in a lattice-gas wind-tree model

    International Nuclear Information System (INIS)

    Kong, X.P.; Cohen, E.G.D.

    1989-01-01

    Two new strictly deterministic lattice-gas automata derived from Ehrenfest's wind-tree model are studied. While in one model normal diffusion occurs, the other model exhibits abnormal diffusion in that the distribution function of the displacements of the wind particle is non-Gaussian, but its second moment, the mean-square displacement, is proportional to the time, so that a diffusion coefficient can be defined. A connection with the percolation problem and a self-avoiding random walk for the case in which the lattice is completely covered with trees is discussed

  2. ( Quercus spp. ) using random amplified polymorphic DNA (RAPD)

    African Journals Online (AJOL)

    Quercus is one of the most important woody genera of the Northern hemisphere and considered as one of the main forest tree species in Iran. In this study, genetic relationships in the genus Quercus, using random amplified polymorphic DNA (RAPD) was examined. Five species, including: Quercus robur, Quercus ...

  3. First-passage percolation on the random graph

    NARCIS (Netherlands)

    Hofstad, van der R.W.; Hooghiemstra, G.; Van Mieghem, P.

    2001-01-01

    We study first-passage percolation on the random graph Gp(N) with exponentially distributed weights on the links. For the special case of the complete graph, this problem can be described in terms of a continuous-time Markov chain and recursive trees. The Markov chain X(t) describes the number of

  4. Tree architecture and life-history strategies across 200 co-occurring tropical tree species

    NARCIS (Netherlands)

    Iida, Y.; Kohyama, T.S.; Kubo, T.; Kassim, A.R.; Poorter, L.; Sterck, F.J.; Potts, M.D.

    2011-01-01

    1. Tree architecture is thought to allow species to partition horizontal and vertical light gradients in the forest canopy. Tree architecture is closely related to light capture, carbon gain and the efficiency with which trees reach the canopy. Previous studies that investigated how light gradients

  5. Forest FIRE and FIRE wood : tools for tree automata and tree algorithms

    NARCIS (Netherlands)

    Cleophas, L.G.W.A.; Piskorski, J.; Watson, B.W.; Yli-Jyrä, A.

    2009-01-01

    Pattern matching, acceptance, and parsing algorithms on node-labeled, ordered, ranked trees ('tree algorithms') are important for applications such as instruction selection and tree transformation/term rewriting. Many such algorithms have been developed. They often are based on results from such

  6. 36 CFR 223.4 - Exchange of trees or portions of trees.

    Science.gov (United States)

    2010-07-01

    ... 36 Parks, Forests, and Public Property 2 2010-07-01 2010-07-01 false Exchange of trees or portions of trees. 223.4 Section 223.4 Parks, Forests, and Public Property FOREST SERVICE, DEPARTMENT OF AGRICULTURE SALE AND DISPOSAL OF NATIONAL FOREST SYSTEM TIMBER General Provisions § 223.4 Exchange of trees or...

  7. How many trees are enough? Tree death and the urban canopy

    Science.gov (United States)

    Lara A. Roman

    2014-01-01

    Massive city tree planting campaigns have invigorated the urban forestry movement, and engaged politicians, planners, and the public in urban greening. Million tree initiatives have been launched in Los Angeles, CA; Denver, CO; New York City, NY; Philadelphia, PA, and other cities. Sacramento, CA even has a five million tree program. These...

  8. Atlas of United States Trees, Volume 2: Alaska Trees and Common Shrubs.

    Science.gov (United States)

    Viereck, Leslie A.; Little, Elbert L., Jr.

    This volume is the second in a series of atlases describing the natural distribution or range of native tree species in the United States. The 82 species maps include 32 of trees in Alaska, 6 of shrubs rarely reaching tree size, and 44 more of common shrubs. More than 20 additional maps summarize environmental factors and furnish general…

  9. Understanding recruitment failure in tropical tree species: Insights from a tree ring study

    NARCIS (Netherlands)

    Vlam, M.; Baker, P.J.; Bunyavejchewin, S.; Mohren, G.M.J.; Zuidema, P.A.

    2014-01-01

    Many tropical tree species have population structures that exhibit strong recruitment failure. While the presence of adult trees indicates that appropriate regeneration conditions occurred in the past, it is often unclear why small individuals are absent. Knowing how, when and where these tree

  10. Carbon mapping of Argentine savannas: Using fractional tree cover to scale from field to region

    Science.gov (United States)

    González-Roglich, M.; Swenson, J. J.

    2015-12-01

    Programs which intend to maintain or enhance carbon (C) stocks in natural ecosystems are promising, but require detailed and spatially explicit C distribution models to monitor the effectiveness of management interventions. Savanna ecosystems are significant components of the global C cycle, covering about one fifth of the global land mass, but they have received less attention in C monitoring protocols. Our goal was to estimate C storage across a broad savanna ecosystem using field surveys and freely available satellite images. We first mapped tree canopies at 2.5 m resolution with a spatial subset of high resolution panchromatic images to then predict regional wall-to-wall tree percent cover using 30-m Landsat imagery and the Random Forests algorithms. We found that a model with summer and winter spectral indices from Landsat, climate and topography performed best. Using a linear relationship between C and % tree cover, we then predicted tree C stocks across the gradient of tree cover, explaining 87 % of the variability. The spatially explicit validation of the tree C model with field-measured C-stocks revealed an RMSE of 8.2 tC/ha which represented ~30% of the mean C stock for areas with tree cover, comparable to studies based on more advanced remote sensing methods, such as LiDAR and RADAR. Sample spatial distribution highly affected the performance of the RF models in predicting tree cover, raising concerns regarding the predictive capabilities of the model in areas for which training data is not present. The 50,000 km2 has ~41 Tg C, which could be released to the atmosphere if agricultural pressure intensifies in this semiarid savanna.

  11. Large-Scale Mixed Temperate Forest Mapping at the Single Tree Level using Airborne Laser Scanning

    Science.gov (United States)

    Scholl, V.; Morsdorf, F.; Ginzler, C.; Schaepman, M. E.

    2017-12-01

    Monitoring vegetation on a single tree level is critical to understand and model a variety of processes, functions, and changes in forest systems. Remote sensing technologies are increasingly utilized to complement and upscale the field-based measurements of forest inventories. Airborne laser scanning (ALS) systems provide valuable information in the vertical dimension for effective vegetation structure mapping. Although many algorithms exist to extract single tree segments from forest scans, they are often tuned to perform well in homogeneous coniferous or deciduous areas and are not successful in mixed forests. Other methods are too computationally expensive to apply operationally. The aim of this study was to develop a single tree detection workflow using leaf-off ALS data for the canton of Aargau in Switzerland. Aargau covers an area of over 1,400km2 and features mixed forests with various development stages and topography. Forest type was classified using random forests to guide local parameter selection. Canopy height model-based treetop maxima were detected and maintained based on the relationship between tree height and window size, used as a proxy to crown diameter. Watershed segmentation was used to generate crown polygons surrounding each maximum. The location, height, and crown dimensions of single trees were derived from the ALS returns within each polygon. Validation was performed through comparison with field measurements and extrapolated estimates from long-term monitoring plots of the Swiss National Forest Inventory within the framework of the Swiss Federal Institute for Forest, Snow, and Landscape Research. This method shows promise for robust, large-scale single tree detection in mixed forests. The single tree data will aid ecological studies as well as forest management practices. Figure description: Height-normalized ALS point cloud data (top) and resulting single tree segments (bottom) on the Laegeren mountain in Switzerland.

  12. Bayesian nonparametric meta-analysis using Polya tree mixture models.

    Science.gov (United States)

    Branscum, Adam J; Hanson, Timothy E

    2008-09-01

    Summary. A common goal in meta-analysis is estimation of a single effect measure using data from several studies that are each designed to address the same scientific inquiry. Because studies are typically conducted in geographically disperse locations, recent developments in the statistical analysis of meta-analytic data involve the use of random effects models that account for study-to-study variability attributable to differences in environments, demographics, genetics, and other sources that lead to heterogeneity in populations. Stemming from asymptotic theory, study-specific summary statistics are modeled according to normal distributions with means representing latent true effect measures. A parametric approach subsequently models these latent measures using a normal distribution, which is strictly a convenient modeling assumption absent of theoretical justification. To eliminate the influence of overly restrictive parametric models on inferences, we consider a broader class of random effects distributions. We develop a novel hierarchical Bayesian nonparametric Polya tree mixture (PTM) model. We present methodology for testing the PTM versus a normal random effects model. These methods provide researchers a straightforward approach for conducting a sensitivity analysis of the normality assumption for random effects. An application involving meta-analysis of epidemiologic studies designed to characterize the association between alcohol consumption and breast cancer is presented, which together with results from simulated data highlight the performance of PTMs in the presence of nonnormality of effect measures in the source population.

  13. Topics in random walks in random environment

    International Nuclear Information System (INIS)

    Sznitman, A.-S.

    2004-01-01

    Over the last twenty-five years random motions in random media have been intensively investigated and some new general methods and paradigms have by now emerged. Random walks in random environment constitute one of the canonical models of the field. However in dimension bigger than one they are still poorly understood and many of the basic issues remain to this day unresolved. The present series of lectures attempt to give an account of the progresses which have been made over the last few years, especially in the study of multi-dimensional random walks in random environment with ballistic behavior. (author)

  14. Fast Tree: Computing Large Minimum-Evolution Trees with Profiles instead of a Distance Matrix

    Energy Technology Data Exchange (ETDEWEB)

    N. Price, Morgan; S. Dehal, Paramvir; P. Arkin, Adam

    2009-07-31

    Gene families are growing rapidly, but standard methods for inferring phylogenies do not scale to alignments with over 10,000 sequences. We present FastTree, a method for constructing large phylogenies and for estimating their reliability. Instead of storing a distance matrix, FastTree stores sequence profiles of internal nodes in the tree. FastTree uses these profiles to implement neighbor-joining and uses heuristics to quickly identify candidate joins. FastTree then uses nearest-neighbor interchanges to reduce the length of the tree. For an alignment with N sequences, L sites, and a different characters, a distance matrix requires O(N^2) space and O(N^2 L) time, but FastTree requires just O( NLa + N sqrt(N) ) memory and O( N sqrt(N) log(N) L a ) time. To estimate the tree's reliability, FastTree uses local bootstrapping, which gives another 100-fold speedup over a distance matrix. For example, FastTree computed a tree and support values for 158,022 distinct 16S ribosomal RNAs in 17 hours and 2.4 gigabytes of memory. Just computing pairwise Jukes-Cantor distances and storing them, without inferring a tree or bootstrapping, would require 17 hours and 50 gigabytes of memory. In simulations, FastTree was slightly more accurate than neighbor joining, BIONJ, or FastME; on genuine alignments, FastTree's topologies had higher likelihoods. FastTree is available at http://microbesonline.org/fasttree.

  15. Injective Labeled Oriented Trees are Aspherical

    OpenAIRE

    Harlander, Jens; Rosebrock, Stephan

    2012-01-01

    A labeled oriented tree is called injective if each generator occurs at most once as an edge label. We show that injective labeled oriented trees are aspherical. The proof relies on a new relative asphericity test based on a lemma of Stallings.

  16. Tree root mapping with ground penetrating radar

    CSIR Research Space (South Africa)

    Van Schoor, Abraham M

    2009-09-01

    Full Text Available In this paper, the application of ground penetrating radar (GPR) for the mapping of near surface tree roots is demonstrated. GPR enables tree roots to be mapped in a non-destructive and cost-effective manner and is therefore a useful prospecting...

  17. Portraits of Non-Tree Families

    NARCIS (Netherlands)

    Balgooy, van M.M.J.

    2001-01-01

    This is the third and final volume of the series ‘Malesian Seed Plants’. It contains the ‘portraits’ of 124 non-tree families, i.e. families which are mainly herbaceous, climbing, shrubby, or trees with a stem diameter at breast height of less than 10 cm or a height of less than 10 m. Users of the

  18. Smoothed analysis of binary search trees

    NARCIS (Netherlands)

    Manthey, Bodo; Reischuk, Rüdiger

    2007-01-01

    Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform distribution is only logarithmic. The exact value is one of the best studied problems in average-case complexity. We

  19. Tools for valuing tree and park services

    Science.gov (United States)

    E.G. McPherson

    2010-01-01

    Arborists and urban foresters plan, design, construct, and manage trees and parks in cities throughout the world. These civic improvements create walkable, cool environments, save energy, reduce stormwater runoff, sequester carbon dioxide, and absorb air pollutants. The presence of trees and green spaces in cities is associated with increases in property values,...

  20. A coinductive calculus of binary trees

    NARCIS (Netherlands)

    A.M. Silva (Alexandra); J.J.M.M. Rutten (Jan)

    2007-01-01

    htmlabstractWe study the set T_A of infinite binary trees with nodes labelled in a semiring A from a coalgebraic perspective. We present coinductive definition and proof principles based on the fact that T_A carries a final coalgebra structure. By viewing trees as formal power series, we develop a