MARRT: Medial Axis biased rapidly-exploring random trees
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.
Qureshi, Ahmed Hussain; Ayaz, Yasar
2017-01-01
The sampling based motion planning algorithm known as Rapidly-exploring Random Trees (RRT) has gained the attention of many researchers due to their computational efficiency and effectiveness. Recently, a variant of RRT called RRT* has been proposed that ensures asymptotic optimality. Subsequently its bidirectional version has also been introduced in the literature known as Bidirectional-RRT* (B-RRT*). We introduce a new variant called Intelligent Bidirectional-RRT* (IB-RRT*) which is an impr...
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.
A multi-directional rapidly exploring random graph (mRRG) for protein folding
Nath, Shuvra Kanti
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.
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, Robot ics 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, Robot ics
Directory of Open Access Journals (Sweden)
Shi Zhan
2011-03-01
Full Text Available These notes provide an elementary and self-contained introduction to branching random walks. Section 1 gives a brief overview of Galton–Watson trees, whereas Section 2 presents the classical law of large numbers for branching random walks. These two short sections are not exactly indispensable, but they introduce the idea of using size-biased trees, thus giving motivations and an avant-goût to the main part, Section 3, where branching random walks are studied from a deeper point of view, and are connected to the model of directed polymers on a tree. Tree-related random processes form a rich and exciting research subject. These notes cover only special topics. For a general account, we refer to the St-Flour lecture notes of Peres [47] and to the forthcoming book of Lyons and Peres [42], as well as to Duquesne and Le Gall [23] and Le Gall [37] for continuous random trees.
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 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 to a sub-optimal solution increases. Furthermore, the path generated by this algorithm...
Random Projection Trees Revisited
Dhesi, Aman; Kar, Purushottam
2010-01-01
The Random Projection Tree structures proposed in [Freund-Dasgupta STOC08] are space partitioning data structures that automatically adapt to various notions of intrinsic dimensionality of data. We prove new results for both the RPTreeMax and the RPTreeMean data structures. Our result for RPTreeMax gives a near-optimal bound on the number of levels required by this data structure to reduce the size of its cells by a factor $s \\geq 2$. We also prove a packing lemma for this data structure. Our...
Large Deviations for Random Trees.
Bakhtin, Yuri; Heitsch, Christine
2008-08-01
We consider large random trees under Gibbs distributions and prove a Large Deviation Principle (LDP) for the distribution of degrees of vertices of the tree. The LDP rate function is given explicitly. An immediate consequence is a Law of Large Numbers for the distribution of vertex degrees in a large random tree. Our motivation for this study comes from the analysis of RNA secondary structures.
Randomized tree construction algorithm to explore energy landscapes.
Jaillet, Léonard; Corcho, Francesc J; Pérez, Juan-Jesús; Cortés, Juan
2011-12-01
In this work, a new method for exploring conformational energy landscapes is described. The method, called transition-rapidly exploring random tree (T-RRT), combines ideas from statistical physics and robot path planning algorithms. A search tree is constructed on the conformational space starting from a given state. The tree expansion is driven by a double strategy: on the one hand, it is naturally biased toward yet unexplored regions of the space; on the other, a Monte Carlo-like transition test guides the expansion toward energetically favorable regions. The balance between these two strategies is automatically achieved due to a self-tuning mechanism. The method is able to efficiently find both energy minima and transition paths between them. As a proof of concept, the method is applied to two academic benchmarks and the alanine dipeptide. Copyright © 2011 Wiley Periodicals, Inc.
Human action analysis with randomized trees
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.
Aspects of insertion in random trees
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
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.
Random recursive trees and the elephant random walk
Kürsten, Rüdiger
2016-03-01
One class of random walks with infinite memory, so-called elephant random walks, are simple models describing anomalous diffusion. We present a surprising connection between these models and bond percolation on random recursive trees. We use a coupling between the two models to translate results from elephant random walks to the percolation process. We calculate, besides other quantities, exact expressions for the first and the second moment of the root cluster size and of the number of nodes in child clusters of the first generation. We further introduce another model, the skew elephant random walk, and calculate the first and second moment of this process.
The resistance of randomly grown trees
Colman, E. R.; Rodgers, G. J.
2011-12-01
An electrical network with the structure of a random tree is considered: starting from a root vertex, in one iteration each leaf (a vertex with zero or one adjacent edges) of the tree is extended by either a single edge with probability p or two edges with probability 1 - p. With each edge having a resistance equal to 1Ω, the total resistance Rn between the root vertex and a busbar connecting all the vertices at the nth level is considered. A dynamical system is presented which approximates Rn, it is shown that the mean value for this system approaches (1 + p)/(1 - p) as n → ∞, the distribution of Rn at large n is also examined. Additionally, a random sequence construction akin to a random Fibonacci sequence is used to approximate Rn; this sequence is shown to be related to the Legendre polynomials and its mean is shown to converge with | - (1 + p)/(1 - p)| ˜ n-1/2.
The resistance of randomly grown trees
Energy Technology Data Exchange (ETDEWEB)
Colman, E R; Rodgers, G J, E-mail: Ewan.Colman@brunel.ac.uk [Department of Mathematical Sciences, Brunel University, Uxbridge, Middlesex UB8 3PH (United Kingdom)
2011-12-16
An electrical network with the structure of a random tree is considered: starting from a root vertex, in one iteration each leaf (a vertex with zero or one adjacent edges) of the tree is extended by either a single edge with probability p or two edges with probability 1 - p. With each edge having a resistance equal to 1{Omega}, the total resistance R{sub n} between the root vertex and a busbar connecting all the vertices at the nth level is considered. A dynamical system is presented which approximates R{sub n}, it is shown that the mean value Left-Pointing-Angle-Bracket R{sub n} Right-Pointing-Angle-Bracket for this system approaches (1 + p)/(1 - p) as n {yields} {infinity}, the distribution of R{sub n} at large n is also examined. Additionally, a random sequence construction akin to a random Fibonacci sequence is used to approximate R{sub n}; this sequence is shown to be related to the Legendre polynomials and its mean is shown to converge with | Left-Pointing-Angle-Bracket R{sub n} Right-Pointing-Angle-Bracket - (1 + p)/(1 - p)| {approx} n{sup -1/2}. (paper)
Randomized Binomial Tree and Pricing of American-Style Options
Hu Xiaoping; Cao Jie
2014-01-01
Randomized binomial tree and methods for pricing American options were studied. Firstly, both the completeness and the no-arbitrage conditions in the randomized binomial tree market were proved. Secondly, the description of the node was given, and the cubic polynomial relationship between the number of nodes and the time steps was also obtained. Then, the characteristics of paths and storage structure of the randomized binomial tree were depicted. Then, the procedure and method for pricing Am...
Analysis of some parameters for random nodes in priority trees
Directory of Open Access Journals (Sweden)
Alois Panholzer
2008-04-01
Full Text Available Priority trees are a certain data structure used for priority queue administration. Under the model that all permutations of the numbers $1, dots, n$ are equally likely to construct a priority tree of size $n$ we study the following parameters in size-$n$ trees: depth of a random node, number of right edges to a random node, and number of descendants of a random node. For all parameters studied we give limiting distribution results.
POROSIMETRY BY DOUBLE-RANDOM MULTIPLE TREE STRUCTURING IN VIRTUAL CONCRETE
Directory of Open Access Journals (Sweden)
Piet Stroeven
2012-03-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 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. Unfortunately, aggregate grain surfaces lead to pore anisotropy. 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, presented herein, and random node structuring (RaNoS provide such information. The latter method will be introduced in a next issue of IA&S.
Rapidly-Exploring Roadmaps: Weighing Exploration vs. Refinement in Optimal Motion Planning.
Alterovitz, Ron; Patil, Sachin; Derbakova, Anna
2011-01-01
Computing globally optimal motion plans requires exploring the configuration space to identify reachable free space regions as well as refining understanding of already explored regions to find better paths. We present the rapidly-exploring roadmap (RRM), a new method for single-query optimal motion planning that allows the user to explicitly consider the trade-off between exploration and refinement. RRM initially explores the configuration space like a rapidly exploring random tree (RRT). Once a path is found, RRM uses a user-specified parameter to weigh whether to explore further or to refine the explored space by adding edges to the current roadmap to find higher quality paths in the explored space. Unlike prior methods, RRM does not focus solely on exploration or refine prematurely. We demonstrate the performance of RRM and the trade-off between exploration and refinement using two examples, a point robot moving in a plane and a concentric tube robot capable of following curved trajectories inside patient anatomy for minimally invasive medical procedures.
Minimal vertex covers of random trees
Coulomb, Stephane
2004-01-01
We study minimal vertex covers of trees. Contrarily to the number $N_{vc}(A)$ of minimal vertex covers of the tree $A$, $\\log N_{vc}(A)$ is a self-averaging quantity. We show that, for large sizes $n$, $\\lim_{n\\to +\\infty} _n/n= 0.1033252\\pm 10^{-7}$. The basic idea is, given a tree, to concentrate on its degenerate vertices, that is those vertices which belong to some minimal vertex cover but not to all of them. Deletion of the other vertices induces a forest of totally degenerate trees. We ...
Minimal vertex covers of random trees
Coulomb, Stéphane
2005-06-01
We study minimal vertex covers of trees. In contrast to the number Nvc(A) of minimal vertex covers of the tree A, logNvc(A) is a self-averaging quantity. We show that, for large sizes n, \\lim_{n\\to+\\infty } \\langle \\log N_{\\mathrm {vc}}(A)\\rangle_n/n= 0.103\\,3252\\pm 10^{-7} . The basic idea is, given a tree, to concentrate on its degenerate vertices, that is those vertices which belong to some minimal vertex cover but not to all of them. Deletion of the other vertices induces a forest of totally degenerate trees. We show that the problem reduces to the computation of the size distribution of this forest, which we perform analytically, and of the average \\langle \\log N_{\\mathrm {vc}}\\rangle over totally degenerate trees of given size, which we perform numerically.
Quantum walks induced by Dirichlet random walks on infinite trees
Higuchi, Yusuke; Segawa, Etsuo
2018-02-01
We consider the Grover walk on infinite trees from the viewpoint of spectral analysis. From the previous work, infinite regular trees provide localization. In this paper, we give the complete characterization of the eigenspace of this Grover walk, which involves localization of its behavior and recovers the previous work. Our result suggests that the Grover walk on infinite trees may be regarded as a limit of the quantum walk induced by the isotropic random walk with the Dirichlet boundary condition at the n-th depth rather than one with the Neumann boundary condition.
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 spanni...
Limit distributions for queues and random rooted trees
Directory of Open Access Journals (Sweden)
Lajos Takács
1993-01-01
Full Text Available In this paper several limit theorems are proved for the fluctuations of the queue size during the initial busy period of a queuing process with one server. These theorems are used to find the solutions of various problems connected with the heights and widths of random rooted trees.
Using histograms to introduce randomization in the generation of ensembles of decision trees
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.
Ensemble of randomized soft decision trees for robust classification
Indian Academy of Sciences (India)
For classification, decision trees have become very popular because of its simplicity, interpret-ability and good performance. To induce a decision tree classifier for data having continuous valued attributes, the most common approach is, split the continuous attribute range into a hard (crisp) partition having two or more ...
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.
Evaluation of geocast routing trees on random and actual networks
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
Random Access to Grammar-Compressed Strings and Trees
DEFF Research Database (Denmark)
Bille, Philip; Landau, Gad M.; Raman, Rajeev
2015-01-01
Grammar-based compression, where one replaces a long string by a small context-free grammar that generates the string, is a simple and powerful paradigm that captures (sometimes with slight reduction in efficiency) many of the popular compression schemes, including the Lempel-Ziv family, run...... and other operations on grammar-compressed ordered trees. All of the above bounds significantly improve the currently best known results. To achieve these bounds, we introduce several new techniques and data structures of independent interest, including a predecessor data structure, two “biased” weighted...
Revisiting the impacts of non-random extinction on the tree-of-life.
Davies, T Jonathan; Yessoufou, Kowiyou
2013-08-23
The tree-of-life represents the diversity of living organisms. Species extinction and the concomitant loss of branches from the tree-of-life is therefore a major conservation concern. There is increasing evidence indicating that extinction is phylogenetically non-random, such that if one species is vulnerable to extinction so too are its close relatives. However, the impact of non-random extinctions on the tree-of-life has been a matter of recent debate. Here, we combine simulations with empirical data on extinction risk in mammals. We demonstrate that phylogenetically clustered extinction leads to a disproportionate loss of branches from the tree-of-life, but that the loss of their summed lengths is indistinguishable from random extinction. We argue that under a speciational model of evolution, the number of branches lost might be of equal or greater consequences than the loss of summed branch lengths. We therefore suggest that the impact of non-random extinction on the tree-of-life may have been underestimated.
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.
Random cascades on wavelet trees and their use in analyzing and modeling natural images
Wainwright, Martin J.; Simoncelli, Eero P.; Willsky, Alan S.
2000-12-01
We develop a new class of non-Gaussian multiscale stochastic processes defined by random cascades on trees of wavelet or other multiresolution coefficients. These cascades reproduce a rich semi-parametric class of random variables known as Gaussian scale mixtures. We demonstrate that this model class can accurately capture the remarkably regular and non- Gaussian features of natural images in a parsimonious fashion, involving only a small set of parameters. In addition, this model structure leads to efficient algorithms for image processing. In particular, we develop a Newton- like algorithm for MAP estimation that exploits very fast algorithm for linear-Gaussian estimation on trees, and hence is efficient. On the basis of this MAP estimator, we develop and illustrate a denoising technique that is based on a global prior model, and preserves the structure of natural images.
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.
Elizabeth A. Freeman; Gretchen G. Moisen; John W. Coulston; Barry T. (Ty) Wilson
2015-01-01
As part of the development of the 2011 National Land Cover Database (NLCD) tree canopy cover layer, a pilot project was launched to test the use of high-resolution photography coupled with extensive ancillary data to map the distribution of tree canopy cover over four study regions in the conterminous US. Two stochastic modeling techniques, random forests (RF...
Random walk hierarchy measure: What is more hierarchical, a chain, a tree or a star?
Czégel, Dániel
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...
Classification of endomicroscopic images of the lung based on random subwindows and extra-trees.
Désir, Chesner; Petitjean, Caroline; Heutte, Laurent; Salaün, Mathieu; Thiberville, Luc
2012-09-01
Recently, the in vivo imaging of pulmonary alveoli was made possible thanks to confocal microscopy. For these images, we wish to aid the clinician by developing a computer-aided diagnosis system, able to discriminate between healthy and pathological subjects. The lack of expertise currently available on these images has first led us to choose a generic approach, based on pixel-value description of randomly extracted subwindows and decision tree ensemble for classification (extra-trees). In order to deal with the great complexity of our images, we adapt this method by introducing a texture-based description of the subwindows, based on local binary patterns. We show through our experimental protocol that this adaptation is a promising way to classify fibered confocal fluorescence microscopy images. In addition, we introduce a rejection mechanism on the classifier output to prevent nondetection errors.
Directory of Open Access Journals (Sweden)
Henri Epstein
2016-11-01
Full Text Available An algebraic formalism, developed with V. Glaser and R. Stora for the study of the generalized retarded functions of quantum field theory, is used to prove a factorization theorem which provides a complete description of the generalized retarded functions associated with any tree graph. Integrating over the variables associated to internal vertices to obtain the perturbative generalized retarded functions for interacting fields arising from such graphs is shown to be possible for a large category of space–times.
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.
Lv, Jie; Ma, Ting
2016-10-01
Tree species distribution is an important issue for sustainable forest resource management. However, the accuracy of tree species discrimination using remote-sensing data needs to be improved to support operational forestry-monitoring tasks. This study aimed to classify tree species in the Liangshui Nature Reserve of Heilongjiang Province, China using spectral and structural remote sensing information in an auto-mated Random Forest modelling approach. This study evaluates and compares the performance of two machine learning classifiers, random forests (RF), support vector machine (SVM) to classify the Chinese high-resolution remote sensing satellite GF-1 images. Texture factor was extracted from GF-1 image with grey-level co-occurrence matrix method. Normalized Difference Vegetation Index (NDVI), Ratio Vegetation Index (RVI), Enhanced Vegetation Index (EVI), Difference Vegetation Index (DVI) were calculated and coupled into the model. The result show that the Random Forest model yielded the highest classification accuracy and prediction success for the tree species with an overall classification accuracy of 81.07% and Kappa coefficient value of 0.77. The proposed random forests method was able to achieve highly satisfactory tree species discrimination results. And aerial LiDAR data should be further explored in future research activities.
2013-01-01
Objectives. Global perceptions of stress (GPS) have major implications for mental and physical health, and stress in midlife may influence adaptation in later life. Thus, it is important to determine the unique and interactive effects of diverse influences of role stress (at work or in personal relationships), loneliness, life events, time pressure, caregiving, finances, discrimination, and neighborhood circumstances on these GPS. Method. Exploratory regression trees and random forests were used to examine complex interactions among myriad events and chronic stressors in middle-aged participants’ (N = 410; mean age = 52.12) GPS. Results. Different role and domain stressors were influential at high and low levels of loneliness. Varied combinations of these stressors resulting in similar levels of perceived stress are also outlined as examples of equifinality. Loneliness emerged as an important predictor across trees. Discussion. Exploring multiple stressors simultaneously provides insights into the diversity of stressor combinations across individuals—even those with similar levels of global perceived stress—and answers theoretical mandates to better understand the influence of stress by sampling from many domain and role stressors. Further, the unique influences of each predictor relative to the others inform theory and applied work. Finally, examples of equifinality and multifinality call for targeted interventions. PMID:23341437
Lin, Yu-Ping; Kao, Ying-Jer; Chen, Pochung; Lin, Yu-Cheng
2017-08-01
The antiferromagnetic Ising chain in both transverse and longitudinal magnetic fields is one of the paradigmatic models of a quantum phase transition. The antiferromagnetic system exhibits a zero-temperature critical line separating an antiferromagnetic phase and a paramagnetic phase; the critical line connects an integrable quantum critical point at zero longitudinal field and a classical first-order transition point at zero transverse field. Using a strong-disorder renormalization group method formulated as a tree tensor network, we study the zero-temperature phase of the quantum Ising chain with bond randomness. We introduce a new matrix product operator representation of high-order moments, which provides an efficient and accurate tool for determining quantum phase transitions via the Binder cumulant of the order parameter. Our results demonstrate an infinite-randomness quantum critical point in zero longitudinal field accompanied by pronounced quantum Griffiths singularities, arising from rare ordered regions with anomalously slow fluctuations inside the paramagnetic phase. The strong Griffiths effects are signaled by a large dynamical exponent z >1 , which characterizes a power-law density of low-energy states of the localized rare regions and becomes infinite at the quantum critical point. Upon application of a longitudinal field, the quantum phase transition between the paramagnetic phase and the antiferromagnetic phase is completely destroyed. Furthermore, quantum Griffiths effects are suppressed, showing z <1 , when the dynamics of the rare regions is hampered by the longitudinal field.
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
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...
Effie Viguiliouk; Kendall, Cyril W. C.; Sonia Blanco Mejia; Cozma, Adrian I.; Vanessa Ha; Arash Mirrahimi; Viranda H Jayalath; Augustin, Livia S A; Laura Chiavaroli; Leiter, Lawrence A; de Souza, Russell J.; Jenkins, David J.A.; John L Sievenpiper
2014-01-01
Background Tree nut consumption has been associated with reduced diabetes risk, however, results from randomized trials on glycemic control have been inconsistent. Objective 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. Data Sources MEDLINE, EMBASE, CINAHL, and Cochrane databases through 6 April 201...
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
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
Hu, Chen; Steingrimsson, Jon Arni
2017-10-19
A crucial component of making individualized treatment decisions is to accurately predict each patient's disease risk. In clinical oncology, disease risks are often measured through time-to-event data, such as overall survival and progression/recurrence-free survival, and are often subject to censoring. Risk prediction models based on recursive partitioning methods are becoming increasingly popular largely due to their ability to handle nonlinear relationships, higher-order interactions, and/or high-dimensional covariates. The most popular recursive partitioning methods are versions of the Classification and Regression Tree (CART) algorithm, which builds a simple interpretable tree structured model. With the aim of increasing prediction accuracy, the random forest algorithm averages multiple CART trees, creating a flexible risk prediction model. Risk prediction models used in clinical oncology commonly use both traditional demographic and tumor pathological factors as well as high-dimensional genetic markers and treatment parameters from multimodality treatments. In this article, we describe the most commonly used extensions of the CART and random forest algorithms to right-censored outcomes. We focus on how they differ from the methods for noncensored outcomes, and how the different splitting rules and methods for cost-complexity pruning impact these algorithms. We demonstrate these algorithms by analyzing a randomized Phase III clinical trial of breast cancer. We also conduct Monte Carlo simulations to compare the prediction accuracy of survival forests with more commonly used regression models under various scenarios. These simulation studies aim to evaluate how sensitive the prediction accuracy is to the underlying model specifications, the choice of tuning parameters, and the degrees of missing covariates.
Large deviations for random trees and the branching of RNA secondary structures.
Bakhtin, Yuri; Heitsch, Christine E
2009-01-01
We give a Large Deviation Principle (LDP) with explicit rate function for the distribution of vertex degrees in plane trees, a combinatorial model of RNA secondary structures. We calculate the typical degree distributions based on nearest neighbor free energies, and compare our results with the branching configurations found in two sets of large RNA secondary structures. We find substantial agreement overall, with some interesting deviations which merit further study.
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
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...
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.
Mishra, Gunjan; Sehgal, Deepak; Valadi, Jayaraman K
2017-01-01
Antimicrobial peptides are host defense peptides being viewed as replacement to broad-spectrum antibiotics due to varied advantages. Hepatitis is the commonest infectious disease of liver, affecting 500 million globally with reported adverse side effects in treatment therapy. Antimicrobial peptides active against hepatitis are called as anti-hepatitis peptides (AHP). In current work, we present Extratrees and Random Forests based Quantitative Structure Activity Relationship (QSAR) regression modeling using extracted sequence based descriptors for prediction of the anti-hepatitis activity. The Extra-trees regression model yielded a very high performance in terms coefficient of determination (R2) as 0.95 for test set and 0.7 for the independent dataset. We hypothesize that the developed model can further be used to identify potentially active anti-hepatitis peptides with a high level of reliability.
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.
Karin L. Riley; Isaac C. Grenfell; Mark A. Finney
2015-01-01
Mapping the number, size, and species of trees in forests across the western United States has utility for a number of research endeavors, ranging from estimation of terrestrial carbon resources to tree mortality following wildfires. For landscape fire and forest simulations that use the Forest Vegetation Simulator (FVS), a tree-level dataset, or âtree listâ, is a...
Rufai, Shamsuddeen; Hanafi, M M; Rafii, M Y; Ahmad, S; Arolu, I W; Ferdous, Jannatul
2013-01-01
The knowledge of genetic diversity of tree crop is very important for breeding and improvement program for the purpose of improving the yield and quality of its produce. Genetic diversity study and analysis of genetic relationship among 20 Moringa oleifera were carried out with the aid of twelve primers from, random amplified polymorphic DNA marker. The seeds of twenty M. oleifera genotypes from various origins were collected and germinated and raised in nursery before transplanting to the field at University Agricultural Park (TPU). Genetic diversity parameter, such as Shannon's information index and expected heterozygosity, revealed the presence of high genetic divergence with value of 1.80 and 0.13 for Malaysian population and 0.30 and 0.19 for the international population, respectively. Mean of Nei's gene diversity index for the two populations was estimated to be 0.20. In addition, a dendrogram constructed, using UPGMA cluster analysis based on Nei's genetic distance, grouped the twenty M. oleifera into five distinct clusters. The study revealed a great extent of variation which is essential for successful breeding and improvement program. From this study, M. oleifera genotypes of wide genetic origin, such as T-01, T-06, M-01, and M-02, are recommended to be used as parent in future breeding program.
Directory of Open Access Journals (Sweden)
Shamsuddeen Rufai
2013-01-01
Full Text Available The knowledge of genetic diversity of tree crop is very important for breeding and improvement program for the purpose of improving the yield and quality of its produce. Genetic diversity study and analysis of genetic relationship among 20 Moringa oleifera were carried out with the aid of twelve primers from, random amplified polymorphic DNA marker. The seeds of twenty M. oleifera genotypes from various origins were collected and germinated and raised in nursery before transplanting to the field at University Agricultural Park (TPU. Genetic diversity parameter, such as Shannon's information index and expected heterozygosity, revealed the presence of high genetic divergence with value of 1.80 and 0.13 for Malaysian population and 0.30 and 0.19 for the international population, respectively. Mean of Nei's gene diversity index for the two populations was estimated to be 0.20. In addition, a dendrogram constructed, using UPGMA cluster analysis based on Nei's genetic distance, grouped the twenty M. oleifera into five distinct clusters. The study revealed a great extent of variation which is essential for successful breeding and improvement program. From this study, M. oleifera genotypes of wide genetic origin, such as T-01, T-06, M-01, and M-02, are recommended to be used as parent in future breeding program.
Friederichs, Hendrik; Ligges, Sandra; Weissenstein, Anne
2014-02-01
Physicians and medical students may lack sufficient numeracy skills to make treatment decisions, interpret test results, and practice evidence-based medicine. We evaluated whether the use of a tree diagram without numerical values as an aid for numerical processing might improve students' test results when dealing with percentages. A prospective randomized study was carried out with 102 third-year students. Participants received 3 diagnostic test problems and were asked to determine positive predictive values. The information in these tests was expressed either in (1) natural frequencies, (2) conditional probabilities, or (3) conditional probabilities with a tree diagram without numbers. Ninety-eight (96.1%) complete data sets could be obtained. The group working with natural frequencies achieved significantly higher test results (n = 29, mean score: 1.1, P = 0.045) than the group working with conditional probabilities (n = 34, mean score: 0.56). The students who were given a tree diagram in addition to conditional probabilities (n = 35, mean score: 1.26) also achieved significantly better scores than the group with conditional probabilities alone (P = 0.008). The difference between the group who had received natural frequencies and the group working with conditional probabilities and the tree diagram was not significant. We suggest the use of a tree diagram as a visual aid when dealing with diagnostic tests expressed in conditional probabilities.
Viguiliouk, Effie; Kendall, Cyril W. C.; Blanco Mejia, Sonia; Cozma, Adrian I.; Ha, Vanessa; Mirrahimi, Arash; Jayalath, Viranda H.; Augustin, Livia S. A.; Chiavaroli, Laura; Leiter, Lawrence A.; de Souza, Russell J.; Jenkins, David J. A.; Sievenpiper, John L.
2014-01-01
Background Tree nut consumption has been associated with reduced diabetes risk, however, results from randomized trials on glycemic control have been inconsistent. Objective 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. Data Sources MEDLINE, EMBASE, CINAHL, and Cochrane databases through 6 April 2014. Study Selection 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. Data Extraction and Synthesis 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). Results 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. Limitations Majority of trials were of short duration and poor quality. Conclusions 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. Trial Registration ClinicalTrials.gov NCT01630980 PMID:25076495
Dry, Matthew J.; Preiss, Kym; Wagemans, Johan
2012-01-01
We investigated human performance on the Euclidean Traveling Salesperson Problem (TSP) and Euclidean Minimum Spanning Tree Problem (MST-P) in regards to a factor that has previously received little attention within the literature: the spatial distributions of TSP and MST-P stimuli. First, we describe a method for quantifying the relative degree of…
Directory of Open Access Journals (Sweden)
Berger Jürgen
2004-08-01
Full Text Available Abstract Background Involving patients in decision making on diagnostic procedures requires a basic level of statistical thinking. However, innumeracy is prevalent even among physicians. In medical teaching the 2 × 2 table is widely used as a visual help for computations whereas in psychology the frequency tree is favoured. We assumed that the 2 × 2 table is more suitable to support computations of predictive values. Methods 184 students without prior statistical training were randomised either to a step-by-step self-learning tutorial using the 2 × 2 table (n = 94 or the frequency tree (n = 90. During the training session students were instructed by two sample tasks and a total of five positive predictive values had to be computed. During a follow-up session 4 weeks later participants had to compute 5 different tasks of comparable degree of difficulty without having the tutorial instructions at their disposal. The primary outcome was the correct solution of the tasks. Results There were no statistically significant differences between the two groups. About 58% achieved correct solutions in 4–5 tasks following the training session and 26% in the follow-up examination. Conclusions These findings do not support the hypothesis that the 2 × 2 table is more valuable to facilitate the calculation of positive predictive values than the frequency tree.
Steckelberg, Anke; Balgenorth, Andrea; Berger, Jürgen; Mühlhauser, Ingrid
2004-08-10
Involving patients in decision making on diagnostic procedures requires a basic level of statistical thinking. However, innumeracy is prevalent even among physicians. In medical teaching the 2 x 2 table is widely used as a visual help for computations whereas in psychology the frequency tree is favoured. We assumed that the 2 x 2 table is more suitable to support computations of predictive values. 184 students without prior statistical training were randomised either to a step-by-step self-learning tutorial using the 2 x 2 table (n = 94) or the frequency tree (n = 90). During the training session students were instructed by two sample tasks and a total of five positive predictive values had to be computed. During a follow-up session 4 weeks later participants had to compute 5 different tasks of comparable degree of difficulty without having the tutorial instructions at their disposal. The primary outcome was the correct solution of the tasks. There were no statistically significant differences between the two groups. About 58% achieved correct solutions in 4-5 tasks following the training session and 26% in the follow-up examination. These findings do not support the hypothesis that the 2 x 2 table is more valuable to facilitate the calculation of positive predictive values than the frequency tree.
Cavity tree selection by red-cockaded woodpeckers in relation to tree age
D. Craig Rudolph; Richard N. Conner
1991-01-01
We aged over 1350 Red-cockaded Woodpecker (Picoides borealis) cavity trees and a comparable number of randomly selected trees. Resulting data strongly support the hypothesis that Red-cockaded Woodpeckers preferentially select older trees. Ages of recently initiated cavity trees in the Texas study areas generally were similar to those of cavity trees...
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. .
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.
Nohr, Lise Anett; Rasmussen, Lars Bjørn; Straand, Jørund
2009-01-01
Guggul, herbal extract from resin of the Commiphora mukul tree, is widely used in Asia as a cholesterol-lowering agent based on Indian Ayurvedic medicine. Its popularity for this use is increasing in the US and Western Europe. Guggulsterones, the presumed bioactive compounds of guggul, may antagonise two nuclear hormone receptors involved in cholesterol metabolism, which is a possible explanation for hypolipidemic effects of these extracts. However, publications of efficacy data on the use of guggul extracts in Western populations are scarce. To study the efficacy of a guggul-based formulation (short: guggul) on blood lipids in healthy adults with moderately increased cholesterol. Double-blind, randomised, placebo controlled trial in Norwegian general practice. 43 women and men, age 27-70, with moderately increased cholesterol, randomised to use 2160mg guggul (4 capsules) daily, or placebo for 12 weeks. Mean change in total cholesterol, low-density lipoprotein cholesterol (LDL-C), triglycerides, high-density lipoprotein cholesterol (HDL-C) and total cholesterol/HDL-C ratio compared with baseline. Lipids were analysed at baseline, and at 6 and 12 weeks. In addition, unexpected events and adverse effects were recorded. Two dropouts, one withdrawal, and incomplete lab results for six persons left 34 participants to accomplish the trial (18-guggul, 16-placebo) with complete lab test data. After 12 weeks, mean levels of total cholesterol and HDL-C in the active group were significantly reduced compared with the placebo group. However, the mean levels of LDL-C, triglycerides, and total cholesterol/HDL-C ratio between the two groups did not change significantly. Ten guggul users (vs. four in the placebo group) reported side effects: mild gastrointestinal discomfort (n=7), possible thyroid problems (n=2), and generalized skin rash (n=1). The latter resulted in withdrawal from trial. Even if total cholesterol and HDL-C were significantly reduced, the clinical magnitude of
Indian Academy of Sciences (India)
Flowering Trees. Dolichandrone atrovirens (Roth) K. Schum. (Spathe Trumpet Tree) of Bignoniaceae is a 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 ...
Gunnarsson, A Birgitta; Wagman, Petra; Håkansson, Carita; Hedin, Katarina
2015-11-09
Depression and anxiety disorders are increasing among the general population in the Western world. Individuals may need several kinds of treatment in order to maintain health, such as cognitive behavioural therapy (CBT) and drug treatment. However, having an everyday life that "works" is also important, suggesting a need for interventions based on activities that facilitate a satisfying everyday life. There is still lack of such evidence-based interventions. The Tree Theme Method(®) (TTM) is an occupational therapy intervention designed for a client-centred context in which an individual develops strategies to become an actor in his or her everyday life. Previous studies of the TTM have focused on process evaluation; therefore, further studies are needed to evaluate the method's effects. The aim of this paper is to outline an intervention that can evaluate the effects of the TTM in terms of psychological symptoms, as well as everyday occupations and well-being, in patients suffering from depression and anxiety. This randomized clinical trial includes patients from three Swedish counties randomized to either intervention or treatment as usual. Men and women aged 18-65 years who have been diagnosed with either depression or anxiety are eligible for inclusion. Data collection is carried out at baseline, and outcomes are assessed at the end of intervention, as well as at 3 months and 12 months after intervention ends. The outcomes measured are psychological symptoms, everyday activities, and health-related factors. Depression and anxiety may create difficulties for individuals in the activities of their everyday lives to the extent that they require diagnosis and intervention. Despite this reality, evidence-based interventions that focus on everyday activities are lacking. Therefore, it would be useful to design a specific method for occupational therapy intervention that does precisely that. This study provides insight into the effects of the TTM, comparing it to
Directory of Open Access Journals (Sweden)
Rong Li
2016-12-01
Full Text Available The species composition of plant assemblages can in large part be explained by a long history of biogeographic and evolutionary events. Over the past decade, botanists and plant ecologists have increasingly sought to quantify phylogenetic signal in ecological traits to help inform their inferences regarding the mechanisms driving plant assemblages. However, most studies with a test of phylogenetic signal in the ecological traits have focused on a local scale, while comparatively few studies have been carried out on a regional scale. In this study, I presented a family-level phylogeny and a genus-level phylogeny that included all families and genera of extant seed plants in China, and use both phylogenies to examine whether areal-types or distribution patterns of families and genera of seed plants are non-randomly distributed across the Chinese tree of life. My study shows that the areal-types of families and genera of seed plants exhibit significant phylogenetic signal across the family- or genus-level phylogeny of seed plants in China.
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...
Qiu, Lefeng; Wang, Kai; Long, Wenli; Wang, Ke; Hu, Wei; Amable, Gabriel S
2016-01-01
Soil cadmium (Cd) contamination has attracted a great deal of attention because of its detrimental effects on animals and humans. This study aimed to develop and compare the performances of stepwise linear regression (SLR), classification and regression tree (CART) and random forest (RF) models in the prediction and mapping of the spatial distribution of soil Cd and to identify likely sources of Cd accumulation in Fuyang County, eastern China. Soil Cd data from 276 topsoil (0-20 cm) samples were collected and randomly divided into calibration (222 samples) and validation datasets (54 samples). Auxiliary data, including detailed land use information, soil organic matter, soil pH, and topographic data, were incorporated into the models to simulate the soil Cd concentrations and further identify the main factors influencing soil Cd variation. The predictive models for soil Cd concentration exhibited acceptable overall accuracies (72.22% for SLR, 70.37% for CART, and 75.93% for RF). The SLR model exhibited the largest predicted deviation, with a mean error (ME) of 0.074 mg/kg, a mean absolute error (MAE) of 0.160 mg/kg, and a root mean squared error (RMSE) of 0.274 mg/kg, and the RF model produced the results closest to the observed values, with an ME of 0.002 mg/kg, an MAE of 0.132 mg/kg, and an RMSE of 0.198 mg/kg. The RF model also exhibited the greatest R2 value (0.772). The CART model predictions closely followed, with ME, MAE, RMSE, and R2 values of 0.013 mg/kg, 0.154 mg/kg, 0.230 mg/kg and 0.644, respectively. The three prediction maps generally exhibited similar and realistic spatial patterns of soil Cd contamination. The heavily Cd-affected areas were primarily located in the alluvial valley plain of the Fuchun River and its tributaries because of the dramatic industrialization and urbanization processes that have occurred there. The most important variable for explaining high levels of soil Cd accumulation was the presence of metal smelting industries. The
Directory of Open Access Journals (Sweden)
Lefeng Qiu
Full Text Available Soil cadmium (Cd contamination has attracted a great deal of attention because of its detrimental effects on animals and humans. This study aimed to develop and compare the performances of stepwise linear regression (SLR, classification and regression tree (CART and random forest (RF models in the prediction and mapping of the spatial distribution of soil Cd and to identify likely sources of Cd accumulation in Fuyang County, eastern China. Soil Cd data from 276 topsoil (0-20 cm samples were collected and randomly divided into calibration (222 samples and validation datasets (54 samples. Auxiliary data, including detailed land use information, soil organic matter, soil pH, and topographic data, were incorporated into the models to simulate the soil Cd concentrations and further identify the main factors influencing soil Cd variation. The predictive models for soil Cd concentration exhibited acceptable overall accuracies (72.22% for SLR, 70.37% for CART, and 75.93% for RF. The SLR model exhibited the largest predicted deviation, with a mean error (ME of 0.074 mg/kg, a mean absolute error (MAE of 0.160 mg/kg, and a root mean squared error (RMSE of 0.274 mg/kg, and the RF model produced the results closest to the observed values, with an ME of 0.002 mg/kg, an MAE of 0.132 mg/kg, and an RMSE of 0.198 mg/kg. The RF model also exhibited the greatest R2 value (0.772. The CART model predictions closely followed, with ME, MAE, RMSE, and R2 values of 0.013 mg/kg, 0.154 mg/kg, 0.230 mg/kg and 0.644, respectively. The three prediction maps generally exhibited similar and realistic spatial patterns of soil Cd contamination. The heavily Cd-affected areas were primarily located in the alluvial valley plain of the Fuchun River and its tributaries because of the dramatic industrialization and urbanization processes that have occurred there. The most important variable for explaining high levels of soil Cd accumulation was the presence of metal smelting industries
Indian Academy of Sciences (India)
Flowering Trees. Brachichiton acerifolius F. Muell., commonly called as the Illawara flame tree is a member of Malvaceae family and is native to sub-tropical parts of Australia. Due to its spectacular flowers and tolerance to wide range of climates, it's now cultivated all over the world for its beauty. The tree produces flowers ...
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 crowded at the branch ends; leaflets 8–14 pairs, very variable in shape and with irregularly toothed margin. Flowers are small and appear in large, lax, often ...
Indian Academy of Sciences (India)
Srimath
Flowering Trees. 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.
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 when cut. Leaves are once compound and are crowded at the branch ...
Indian Academy of Sciences (India)
Srimath
Flowering Trees. Couroupita guianensis Abul (Cannonball tree) of Lecythidaceae is a large semi-evergreen tree with a straight bole and spreading crown. Leaves are simple and clustered at the end of short branches. Flowers are large, showy, strongly scented with six fleshy perianth lobes. They are borne on long woody ...
Understanding search trees via statistical physics
Indian Academy of Sciences (India)
http://www.ias.ac.in/article/fulltext/pram/064/06/1175-1189. Keywords. Search trees; fragmentation; travelling fronts; phase transition. Abstract. We study the random -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 ...
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
Decision tree modeling using R.
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.
Indian Academy of Sciences (India)
Srimath
(Indian Coral Tree;Hindi:Pangra)of Leguminosae is a small, quick-growing deciduous tree with a small crown. Branches are covered with dark conical prickles, which fall off after some time. The leaves are compound with three leaflets. Bright red or scarlet flowers which appear following leaf fall are in clusters at branch ends.
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…
Indian Academy of Sciences (India)
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 lobed, dark green above and pale grey underneath. They are 3-nerved from the base and often ...
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.
Indian Academy of Sciences (India)
Srimath
Flowering Trees. Diospyros montana Roxb. (Mountain Ebony) of. Ebenaceae is a medium size deciduous tree with slim, straight trunk and narrow open crown. Leaves are simple, elliptic and leathery. Young leaves are covered with dense velvety growth of hairs. Flow- ers are small, unisexual, males in groups of four or.
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.
Indian Academy of Sciences (India)
IAS Admin
Flowering Trees. Alangium salviifolium (L.f.) Wangerin ssp. salviifolium (SAGE-. LEAVED ALANGIUM) of Alangiaceae is a small deciduous tree, sometimes straggling and sometimes spinous. Leaves are alternate, variable, narrowly oblong or ovate-lanceolate. Flowers are in axillary fascicles. They are 1.5–2 cms long, white ...
Indian Academy of Sciences (India)
Flowering Trees. Diospyros peregrina (Gaertn.) Guercke Syn. Diospyros embryopteris Pers., Diospyros malabarica Desr. (PALE MOON EBONY, RIBER EBONY) of Ebenaceae is a small or mid-sized slow-growing evergreen tree with spreading branches that form a dense crown. The bark is smooth, thick, dark and flakes off ...
Indian Academy of Sciences (India)
Baccaurea courtallensis Muell.-Arg. of Euphorbiaceae is an evergreen tree that is very attractive when in flower. Leaves are alternate. Male and female flowers are borne on separate trees. Inflorescences bearing several flowers arise in tufts on tubercles on the stem. Fruits are crimson red in colour. Seeds are covered.
Indian Academy of Sciences (India)
:Flowering 'Trees. Prima Vera of Mexico (botanical name: Cybistex donell-smithii) The tree planted in 1973 in the RRllawn at the spot where Prof Raman s body was cremated on 21. November 1970 flowered with a magnificient golden crown on the concluding day of the Golden Jubilee of the Institute. 4th February 1999.
Optimized Flight Path for Localization Using Line of Bearing
2015-03-26
Cramér-Rao Lower Bound CEP Circular Error Probability CPLE Cartesian Pseudo-Linear Estimator RRT Rapidly-exploring Random Tree KKT Karush-Kuhn-Tucker...planning method, rapidly-exploring random trees. An RRT is iteratively formed using random points by applying control inputs and this can be assumed as...The Rapidly-exploring Random Tree ( RRT ) provides a broad class of path plan- ning as a randomized data structure. A RRT can expand iteratively by
Guo, Sheng; Duan, Jin-ao; Tang, Yuping; Qian, Dawei; Zhu, Zhenhua; Qian, Yefei; Shang, Erxin; Su, Shulan
2011-03-01
To rapidly explore the differentiating components and the potential chemical markers for discrimination between those Chinese medicinal herbs with similar chemical characteristics, an ultra-high-performance liquid chromatography (UHPLC)-TOFMS coupled with multivariate statistical analysis method was proposed and validated by using two Ziziphus species (Z. jujuba and Z. jujuba var. spinosa) as the model herbs. After the samples were analyzed using UHPLC-TOFMS, the data sets of retention time (RT)-m/z pairs, ion intensities and sample codes were further processed with orthogonal partial least squared discriminant analysis (OPLS-DA) to holistically compare the difference between the fruits of these two Ziziphus species, and to generate an S-plot. Those compounds correlating to the points at the two ends of "S" were regarded as the most differentiating components between these two kinds of samples. By comparing the mass/UV spectra and retention times with those of reference compounds, these components were finally characterized as zizyberenalic acid, palmitoleic acid, oleic acid, pomonic acid and rutin, and these compounds would be the potential chemical markers for discrimination of these jujube products. The results suggested that this newly established approach could be used to rapidly determine the subtle differences and explore the potential chemical markers for differentiation within the herbs with similar chemical ingredients. Copyright © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
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....
Gunnarsson, Birgitta; Wagman, Petra; Håkansson, Carita; Hedin, Katarina
2015-01-01
Background Depression and anxiety disorders are increasing among the general population in the Western world. Individuals may need several kinds of treatment in order to maintain health, such as cognitive behavioural therapy (CBT) and drug treatment. However, having an everyday life that ?works? is also important, suggesting a need for interventions based on activities that facilitate a satisfying everyday life. There is still lack of such evidence-based interventions. The Tree Theme Method? ...
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...... navigational queries directly on the compressed representation. We show that the new compression scheme achieves close to optimal worst-case compression, can compress exponentially better than DAG compression, is never much worse than DAG compression, and supports navigational queries in logarithmic time....
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...... navigational queries directly on the compressed representation. We show that the new compression scheme achieves close to optimal worst-case compression, can compress exponentially better than DAG compression, is never much worse than DAG compression, and supports navigational queries in logarithmic time....
Decision trees and forests: a probabilistic perspective
Lakshminarayanan, B.
2016-01-01
Decision trees and ensembles of decision trees are very popular in machine learning and often achieve state-of-the-art performance on black-box prediction tasks. However, popular variants such as C4.5, CART, boosted trees and random forests lack a probabilistic interpretation since they usually just specify an algorithm for training a model. We take a probabilistic approach where we cast the decision tree structures and the parameters associated with the nodes of a decision tree as a probabil...
Indian Academy of Sciences (India)
Cerbera manghasL. (SEA MANGO) of Apocynaceae is a medium-sized evergreen coastal tree with milky latex. The bark is grey-brown, thick and rough. Leaves are leathery, long-veined, alternate and usually crowded at the end of branches. Flowers are in terminal compact clusters and are mildly scented, large (3–.
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.
Indian Academy of Sciences (India)
IAS Admin
handsome tree reaching a height of 15–20 feet. Leaves are alternate, pinnately compound (11–35 pairs of leaflets) and clustered at the branch ends. Flowers are small, fragrant and are borne on branched inflorescence directly from the trunk. Fruits are bright-green, oblong and lobed. They taste sour and are pickled.
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.
Indian Academy of Sciences (India)
IAS Admin
Caesalpinia coriaria (Jacq.) Willd. (THE AMERICAN SUMACH, DIVI-DIVI) of. Caesalpiniaceae is a small unarmed tree reaching up to 10 m in height with a spreading crown. Leaves are alternate and twice compound. The flowers are small, about 0.6 cm (enlarged 5 times here), greenish-yellow, fragrant and appear in dense ...
Indian Academy of Sciences (India)
IAS Admin
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 berry (1.5 to 2 cm across) with one ...
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 ...
Indian Academy of Sciences (India)
sriranga
Haldina cordifolia (Roxb.) Ridsd. Syn. Adina cordifolia (Roxb.) 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 ...
Indian Academy of Sciences (India)
... green but yellow when ripe, quite smooth at first but wrinkled in drying, remaining long on the tree ajier ripening. The species is widely natural but occasionally cultivated for firewood as it grows very fast. The bark is very bitter and is used as an anthelmintic. Heartwood is reddish brown and takes good polish and hence.
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....
Indian Academy of Sciences (India)
user
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. G. sepium is a native of ...
Indian Academy of Sciences (India)
deciduous tropical tree with often multiple stems and handsome foliage. Leaves are 8–10 cm long, dull green, the two thin leathery halves of the lamina fusing or the cleft between them extending beyond the middle. Flowers are gorgeous, axillary with ...
Indian Academy of Sciences (India)
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 wings. Seeds bear short stiff hairs that cause skin irritation.
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 ...
Indian Academy of Sciences (India)
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 cm across) are clustered in leaf axils and are bisexual. Fruit is yellow, fleshy, two-valved.
Indian Academy of Sciences (India)
Srimath
. (6-10m high) evergreen tree with a straight trunk and broad open crown. Leaves are clustered at the end of twigs. They are dark green, broadest near the rounded apex and tapering towards the base with a short stalk. Flowers are greenish or ...
Indian Academy of Sciences (India)
The tree is a host of lac insects which secrete a resinous substance that yields shellac or lac. A ruby-coloured gum known as Bengal Kino is collected from the incisions made in the bark. The wood, resistant to water, is used in water-well work. The seeds are used as anthelmintic and as an antidote for snake-bite.
Indian Academy of Sciences (India)
Sterculia foetida L. (INDIAN ALMOND,. JAVA OLIVE) of Sterculiaceae is a tall deciduous tree reaching a height of 20 m with faintly ridged grey bark. The bole reaches up to 2m in girth. Branches are reddish, usually horizontal. Leaves are large, palmately compound (5–7 leaflets) and clustered at the branch ends. Flowers ...
Directory of Open Access Journals (Sweden)
S.R.R.F. Leite
2011-03-01
Full Text Available 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.
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...
Decision trees in epidemiological research.
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.
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.
Unimodular trees versus Einstein trees
Energy Technology Data Exchange (ETDEWEB)
Alvarez, Enrique; Gonzalez-Martin, Sergio [Universidad Autonoma, Instituto de Fisica Teorica, IFT-UAM/CSIC, Madrid (Spain); Universidad Autonoma de Madrid, Departamento de Fisica Teorica, Madrid (Spain); Martin, Carmelo P. [Universidad Complutense de Madrid (UCM), Departamento de Fisica Teorica I Facultad de Ciencias Fisicas, Madrid (Spain)
2016-10-15
The maximally helicity violating tree-level scattering amplitudes involving three, four or five gravitons are worked out in Unimodular Gravity. They are found to coincide with the corresponding amplitudes in General Relativity. This a remarkable result, insofar as both the propagators and the vertices are quite different in the two theories. (orig.)
Understanding search trees via statistical physics
Indian Academy of Sciences (India)
Abstract. We study the random m-ary search tree model (where m 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. In particular, we show that the probability ...
Jenkins, Peter
Tree climbing offers a safe, inexpensive adventure sport that can be performed almost anywhere. Using standard procedures practiced in tree surgery or rock climbing, almost any tree can be climbed. Tree climbing provides challenge and adventure as well as a vigorous upper-body workout. Tree Climbers International classifies trees using a system…
THE CONTRIBUTION OF AGROFORESTRY TREE PRODUCTS TO ...
African Journals Online (AJOL)
philiph
forestry tree products to rural farmers in Karim-Lamido Local Government Area was conducted. Fourty (40) farmers randomly selected from 45.5% of eleven wards were interviewed, using a well- designed and pretested questionnaire. The data ...
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...
Mondrian Forests: Efficient Online Random Forests
Lakshminarayanan, Balaji; Roy, Daniel M.; Teh, Yee Whye
2014-01-01
Ensembles of randomized decision trees, usually referred to as random forests, are widely used for classification and regression tasks in machine learning and statistics. Random forests achieve competitive predictive performance and are computationally efficient to train and test, making them excellent candidates for real-world prediction tasks. The most popular random forest variants (such as Breiman's random forest and extremely randomized trees) operate on batches of training data. Online ...
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...
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 r...
Programming macro tree transducers
DEFF Research Database (Denmark)
Bahr, Patrick; Day, Laurence E.
2013-01-01
A tree transducer is a set of mutually recursive functions transforming an input tree into an output tree. Macro tree transducers extend this recursion scheme by allowing each function to be defined in terms of an arbitrary number of accumulation parameters. In this paper, we show how macro tree ...
Maroco, João; Silva, Dina; Rodrigues, Ana; Guerreiro, Manuela; Santana, Isabel; de Mendonça, Alexandre
2011-08-17
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. Press' Q test showed that all classifiers performed better than chance alone (p classification accuracy (Median (Me) = 0.76) an area under the ROC (Me = 0.90). However this method showed high specificity (Me = 1.0) but low sensitivity (Me = 0.3). Random Forest ranked second in overall accuracy (Me = 0.73) with high area under the ROC (Me = 0.73) specificity (Me = 0.73) and sensitivity (Me = 0.64). Linear Discriminant Analysis also showed acceptable overall accuracy (Me = 0.66), with acceptable area under the ROC (Me = 0.72) specificity (Me = 0.66) and sensitivity (Me = 0.64). The remaining classifiers showed overall classification accuracy above a median value of 0.63, but for most
Composition and distribution of economic tree species in Nagi ...
African Journals Online (AJOL)
The inventory of economic trees in Nagi Natural Forest Reserve, Benue state was carried out to determine the status and dominance tree species. A total area of 0.4ha was sampled representing twenty percent of the reserve. Ten (10) sample plots of equal size (20 m x 20m) were randomly selected using simple random ...
Sattath, Shmuel; Tversky, Amos
1977-01-01
Tree representations of similarity data are investigated. Hierarchical clustering is critically examined, and a more general procedure, called the additive tree, is presented. The additive tree representation is then compared to multidimensional scaling. (Author/JKS)
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...
The combinatorics of tandem duplication trees.
Gascuel, Olivier; Hendy, Michael D; Jean-Marie, Alain; McLachlan, Robert
2003-02-01
We developed a recurrence relation that counts the number of tandem duplication trees (either rooted or unrooted) that are consistent with a set of n tandemly repeated sequences generated under the standard unequal recombination (or crossover) model of tandem duplications. The number of rooted duplication trees is exactly twice the number of unrooted trees, which means that on average only two positions for a root on a duplication tree are possible. Using the recurrence, we tabulated these numbers for small values of n. We also developed an asymptotic formula that for large n provides estimates for these numbers. These numbers give a priori probabilities for phylogenies of the repeated sequences to be duplication trees. This work extends earlier studies where exhaustive counts of the numbers for small n were obtained. One application showed the significance of finding that most maximum-parsimony trees constructed from repeat sequences from human immunoglobins and T-cell receptors were tandem duplication trees. Those findings provided strong support to the proposed mechanisms of tandem gene duplication. The recurrence relation also suggests efficient algorithms to recognize duplication trees and to generate random duplication trees for simulation. We present a linear-time recognition algorithm.
Mekler, Alan H.; Shelah, Saharon
1993-01-01
A canary tree is a tree of cardinality the continuum which has no uncountable branch, but gains a branch whenever a stationary set is destroyed (without adding reals). Canary trees are important in infinitary model theory. The existence of a canary tree is independent of ZFC + GCH.
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...
Classification and regression trees
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.
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...
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...... 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...
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...
Holmgren, Milena; Scheffer, Marten
2017-01-01
Few things are more defining in a landscape compared to the absence or presence of trees, both in aesthetic and in functional terms. At the same time, tree cover has been profoundly affected by humans since ancient times. It is therefore not surprising that opinions about deforestation and
Directory of Open Access Journals (Sweden)
Yen Hung Chen
2012-01-01
minimum cost spanning tree T in G such that the total weight in T is at most a given bound B. In this paper, we present two polynomial time approximation schemes (PTASs for the constrained minimum spanning tree problem.
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...... as possible. Evaluations show that the proposed protocol provides considerable gains over the standard tree splitting protocol applying SIC. The improvement comes at the expense of an increased feedback and receiver complexity....
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.
Riba, Colin
2015-01-01
International audience; We propose a notion of morphisms between tree automata based on game semantics. Morphisms are winning strategies on a synchronous restriction of the linear implication between acceptance games. This leads to split indexed categories, with substitution based on a suitable notion of synchronous tree function. By restricting to tree functions issued from maps on alphabets, this gives a fibration of tree automata. We then discuss the (fibrewise) monoidal structure issued f...
Zwiernik, Piotr
2017-01-01
Latent tree models are graphical models defined on trees, in which only a subset of variables is observed. They were first discussed by Judea Pearl as tree-decomposable distributions to generalise star-decomposable distributions such as the latent class model. Latent tree models, or their submodels, are widely used in: phylogenetic analysis, network tomography, computer vision, causal modeling, and data clustering. They also contain other well-known classes of models like hidden Markov models...
A Parallel Randomized Path Planner for Robot Navigation
Directory of Open Access Journals (Sweden)
S. Sengupta
2008-11-01
Full Text Available Computation of a collision-free path for a movable object among obstacles is an important problem in the fields of robotics, CIM and AI. Various automatic task level programming systems can be build for robot guidance, teleoperation, assembly and disassembly among others, if a suitable method for motion planning is available. In the basic variation of motion planning, the task is to generate a collision-free path for a movable object among known and static obstacles. Classically the problem was defined for a rigid 6 degrees-of-freedom body as 'the piano mover's problem'. However, the majority of the research has been conducted in the field of robotics, often under the title of path planning. Rapidly-Exploring Random Trees (RRTs are a recently developed representation on which fast continuous domain path planners can be based. In this work, we have built a parallel path planning system based on RRTs that interleaves planning and execution, first evaluating it in simulation and then applying it to physical robots. Our distributed algorithm, PRRT (parallel RRT, introduces a parallel extension of previous RRT work, the process splitting and parallel cost penalty search with a comment on Real Time Stagnancy reduction, which improves re-planning efficiency, decreases latency involved in finding feasible paths and the quality of generated paths. PRRT is successfully applied to a real-time multi-robot system. In this paper we illustrate how it is possible to implement a parallel version of RRT based motion planner which yields optimal speed up.
A Parallel Randomized Path Planner for Robot Navigation
Directory of Open Access Journals (Sweden)
S. Sengupta
2006-09-01
Full Text Available Computation of a collision-free path for a movable object among obstacles is an important problem in the fields of robotics, CIM and AI. Various automatic task level programming systems can be build for robot guidance, teleoperation, assembly and disassembly among others, if a suitable method for motion planning is available. In the basic variation of motion planning, the task is to generate a collision-free path for a movable object among known and static obstacles. Classically the problem was defined for a rigid 6 degrees-of-freedom body as ‘the piano mover's problem’. However, the majority of the research has been conducted in the field of robotics, often under the title of path planning. Rapidly-Exploring Random Trees (RRTs are a recently developed representation on which fast continuous domain path planners can be based. In this work, we have built a parallel path planning system based on RRTs that interleaves planning and execution, first evaluating it in simulation and then applying it to physical robots. Our distributed algorithm, PRRT (parallel RRT, introduces a parallel extension of previous RRT work, the process splitting and parallel cost penalty search with a comment on Real Time Stagnancy reduction, which improves re-planning efficiency, decreases latency involved in finding feasible paths and the quality of generated paths. PRRT is successfully applied to a real-time multi-robot system. In this paper we illustrate how it is possible to implement a parallel version of RRT based motion planner which yields optimal speed up.
Engelfriet, Joost; Vogler, Heiko
1985-01-01
Macro tree transducers are a combination of top-down tree transducers and macro grammars. They serve as a model for syntax-directed semantics in which context information can be handled. In this paper the formal model of macro tree transducers is studied by investigating typical automata theoretical
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....
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…
Indian Academy of Sciences (India)
Flowering T. Flowering Trees. 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 ...
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...
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...... the FB-tree: a combination of an adapted B+-tree, a storage manager, and a buffer manager, all optimized for modern SSDs. Together the techniques enable writing to SSDs in relatively large blocks, thus achieving greater overall throughput. This is achieved by the out-of-place writing, whereby every time....... 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....
Energy Technology Data Exchange (ETDEWEB)
Morozov, Dmitriy; Weber, Gunther H.
2014-03-31
Topological techniques provide robust tools for data analysis. They are used, for example, for feature extraction, for data de-noising, and for comparison of data sets. This chapter concerns contour trees, a topological descriptor that records the connectivity of the isosurfaces of scalar functions. These trees are fundamental to analysis and visualization of physical phenomena modeled by real-valued measurements. We study the parallel analysis of contour trees. After describing a particular representation of a contour tree, called local{global representation, we illustrate how di erent problems that rely on contour trees can be solved in parallel with minimal communication.
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, ...
New Gromov-Inspired Metrics on Phylogenetic Tree Space.
Liebscher, Volkmar
2018-03-01
We present a new class of metrics for unrooted phylogenetic X-trees inspired by the Gromov-Hausdorff distance for (compact) metric spaces. These metrics can be efficiently computed by linear or quadratic programming. They are robust under NNI operations, too. The local behaviour of the metrics shows that they are different from any previously introduced metrics. The performance of the metrics is briefly analysed on random weighted and unweighted trees as well as random caterpillars.
An Empirical Study of Insertion and Deletion in Binary Search Trees.
1982-12-02
AksriMw: The structure of bbnay trees naturally hed to ame Insertion algorithm. To~ Iner a node Into a binay tree (known not to contain the node...Hbbard 621] proved that deleting a random node (i.e., where each node has an equal probability of being deleted) from a binay tree of sue ft, with dl
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.
Directory of Open Access Journals (Sweden)
Short Ian
2014-05-01
Full Text Available A buttoning of a tree that has vertices v1, v2, . . . , vn is a closed walk that starts at v1 and travels along the shortest path in the tree to v2, and then along the shortest path to v3, and so forth, finishing with the shortest path from vn to v1. Inspired by a problem about buttoning a shirt inefficiently, we determine the maximum length of buttonings of trees
A theory of game trees, based on solution trees
W.H.L.M. Pijls (Wim); A. de Bruin (Arie); A. Plaat (Aske)
1996-01-01
textabstractIn this paper a complete theory of game tree algorithms is presented, entirely based upon the notion of a solution tree. Two types of solution trees are distinguished: max and min solution trees respectively. We show that most game tree algorithms construct a superposition of a max and a
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 available processor cores compared to its sequential counterpart, thereby taking full advantage of multicore parallelism. The parallel buffer tree is a search tree data structure that supports the batched parallel processing of a sequence of N insertions, deletions, membership queries, and range queries...
Morocco - Fruit Tree Productivity
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,...
Directory of Open Access Journals (Sweden)
Ertuğrul Filiz
2011-11-01
Full Text Available Biotechnological methods are used in many areas nowadays and one of these areas is applications of biotechnology in forest trees. Biotechnological methods are used frequently on vital issues such as gaining resistance against diseases and herbicide of forest trees, increasing tree growth rates and development of resistance against environmental stresses (drought, salinity, climate change etc.. Also, for improving the quality of wood that reducing lignin content and increasing the amount of cellulose draws attention. This together with applications, positive and negative effects of transgenic trees to the environment is discussed and it was tried to be provided on the auditing legal regulations concerned with these studies.
Social network sampling using spanning trees
Jalali, Zeinab S.; Rezvanian, Alireza; Meybodi, Mohammad Reza
2016-12-01
Due to the large scales and limitations in accessing most online social networks, it is hard or infeasible to directly access them in a reasonable amount of time for studying and analysis. Hence, network sampling has emerged as a suitable technique to study and analyze real networks. The main goal of sampling online social networks is constructing a small scale sampled network which preserves the most important properties of the original network. In this paper, we propose two sampling algorithms for sampling online social networks using spanning trees. The first proposed sampling algorithm finds several spanning trees from randomly chosen starting nodes; then the edges in these spanning trees are ranked according to the number of times that each edge has appeared in the set of found spanning trees in the given network. The sampled network is then constructed as a sub-graph of the original network which contains a fraction of nodes that are incident on highly ranked edges. In order to avoid traversing the entire network, the second sampling algorithm is proposed using partial spanning trees. The second sampling algorithm is similar to the first algorithm except that it uses partial spanning trees. Several experiments are conducted to examine the performance of the proposed sampling algorithms on well-known real networks. The obtained results in comparison with other popular sampling methods demonstrate the efficiency of the proposed sampling algorithms in terms of Kolmogorov-Smirnov distance (KSD), skew divergence distance (SDD) and normalized distance (ND).
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...
TreeCmp: Comparison of Trees in Polynomial Time
Bogdanowicz, Damian; Giaro, Krzysztof; Wróbel, Borys
2012-01-01
When a phylogenetic reconstruction does not result in one tree but in several, tree metrics permit finding out how far the reconstructed trees are from one another. They also permit to assess the accuracy of a reconstruction if a true tree is known. TreeCmp implements eight metrics that can be calculated in polynomial time for arbitrary (not only bifurcating) trees: four for unrooted (Matching Split metric, which we have recently proposed, Robinson-Foulds, Path Difference, Quartet) and four for rooted trees (Matching Cluster, Robinson-Foulds cluster, Nodal Splitted and Triple). TreeCmp is the first implementation of Matching Split/Cluster metrics and the first efficient and convenient implementation of Nodal Splitted. It allows to compare relatively large trees. We provide an example of the application of TreeCmp to compare the accuracy of ten approaches to phylogenetic reconstruction with trees up to 5000 external nodes, using a measure of accuracy based on normalized similarity between trees.
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...
Tree biology and dendrochemistry
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...
Braus, Judy, Ed.
1992-01-01
Ranger Rick's NatureScope is a creative education series dedicated to inspiring in children an understanding and appreciation of the natural world while developing the skills they will need to make responsible decisions about the environment. Contents are organized into the following sections: (1) "What Makes a Tree a Tree?," including…
Structural Equation Model Trees
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…
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...
Uncovering dynamic fault trees
Junges, Sebastian; Guck, Dennis; Katoen, Joost P.; Stoelinga, Mariëlle Ida Antoinette
Fault tree analysis is a widespread industry standard for assessing system reliability. Standard (static) fault trees model the failure behaviour of systems in dependence of their component failures. To overcome their limited expressive power, common dependability patterns, such as spare management,
Robert L. Brisbin
1989-01-01
Tree grading provides a way to evaluate the quality characteristics and value of standing hardwood trees. This is important because the differences in price between high-quality and low-quality end products can be very large. Since hardwood timber varies greatly in quality and value among species, within species, and even within specific geographic areas, timber...
Rubino, Darrin L.; Hanson, Deborah
2009-01-01
The circles and patterns in a tree's stem tell a story, but that story can be a mystery. Interpreting the story of tree rings provides a way to heighten the natural curiosity of students and help them gain insight into the interaction of elements in the environment. It also represents a wonderful opportunity to incorporate the nature of science.…
DEFF Research Database (Denmark)
Assent, Ira; Krieger, Ralph; Afschari, Farzad
2008-01-01
Continuous growth in sensor data and other temporal data increases the importance of retrieval and similarity search in time series data. Efficient time series query processing is crucial for interactive applications. Existing multidimensional indexes like the R-tree provide efficient querying......, the efficiency benefits of indexing are lost. In this paper, we propose the TS-tree (time series tree), an index structure for efficient time series retrieval and similarity search. Exploiting inherent properties of time series quantization and dimensionality reduction, the TS-tree indexes high-dimensional data...... in an overlap-free manner. During query processing, powerful pruning via quantized separator and meta data information greatly reduces the number of pages which have to be accessed, resulting in substantial speed-up. In thorough experiments on synthetic and real world time series data we demonstrate that our TS-tree...
Energy Technology Data Exchange (ETDEWEB)
Heyser, W.; Iken, J.; Meyer, F.H.
1988-10-22
Tree species that are particularly endangered in our forests are characterized by the fact that they live in an obligatory symbiosis with ectomycorrhiza fungii. In verifying which tree species appear to be more damaged or less severely damaged, a conspicuous phenomenon noted was that the tree species exhibiting slight symptoms of damage or none at all included such ones as form mycorrhizas facultatively or dispense with mycorrhizas, e.g. Acer, Aesculus, Fraxinus, Populus, Salix. Given that trees in municipal gardens reflect the development and extent of damage in a way similar to forests, and given also that much greater numbers of tree species are often cultured in parks of this type, the latter were considered particularly suited to examine the question of whether a relationship exists between mycotrophy and the severity of damage.
From Family Trees to Decision Trees.
Trobian, Helen R.
This paper is a preliminary inquiry by a non-mathematician into graphic methods of sequential planning and ways in which hierarchical analysis and tree structures can be helpful in developing interest in the use of mathematical modeling in the search for creative solutions to real-life problems. Highlights include a discussion of hierarchical…
Cooperative Navigation for Low-bandwidth Mobile Acoustic Networks
2015-01-01
process PPS pulse per second PRM probabilistic road map PSK phase-shift keying RF radio frequency RRG rapidly-exploring random graph RRT rapidly-exploring...et al., 1996; Švestka and Overmars, 1997) and the rapidly-exploring random tree ( RRT ) (Lavalle, 17 Figure 1.6 Illustration of planning approaches...for a holonomic vehicle moving from the start (green) to goal (red). (a) Grid-based planner (b) Sample-based planner ( RRT shown) (c) Optimization motion
Using the minimum spanning tree to trace mass segregation
Allison, R.J.; Goodwin, S.P.; Parker, R.J.; Portegies Zwart, S.F.; de Grijs, R.; Kouwenhoven, M.B.N.
2009-01-01
We present a new method to detect and quantify mass segregation in star clusters. It compares the minimum spanning tree (MST) of massive stars with that of random stars. If mass segregation is present, the MST length of the most massive stars will be shorter than that of random stars. This
A recursive algorithm for trees and forests
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.
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.
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...
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.
Böcker, Sebastian; Dührkop, Kai
2016-01-01
Untargeted metabolomics commonly uses liquid chromatography mass spectrometry to measure abundances of metabolites; subsequent tandem mass spectrometry is used to derive information about individual compounds. One of the bottlenecks in this experimental setup is the interpretation of fragmentation spectra to accurately and efficiently identify compounds. Fragmentation trees have become a powerful tool for the interpretation of tandem mass spectrometry data of small molecules. These trees are determined from the data using combinatorial optimization, and aim at explaining the experimental data via fragmentation cascades. Fragmentation tree computation does not require spectral or structural databases. To obtain biochemically meaningful trees, one needs an elaborate optimization function (scoring). We present a new scoring for computing fragmentation trees, transforming the combinatorial optimization into a Maximum A Posteriori estimator. We demonstrate the superiority of the new scoring for two tasks: both for the de novo identification of molecular formulas of unknown compounds, and for searching a database for structurally similar compounds, our method SIRIUS 3, performs significantly better than the previous version of our method, as well as other methods for this task. SIRIUS 3 can be a part of an untargeted metabolomics workflow, allowing researchers to investigate unknowns using automated computational methods.Graphical abstractWe present a new scoring for computing fragmentation trees from tandem mass spectrometry data based on Bayesian statistics. The best scoring fragmentation tree most likely explains the molecular formula of the measured parent ion.
Energy Technology Data Exchange (ETDEWEB)
Igartua Dora, D. V.; Monteoliva, S.
2009-07-01
The aim of the work was to assess basic wood density variations of Acacia melanoxylon R.Br according to sample tree height, tree, and site. Twenty trees were selected from four sites in Buenos Aires Province, Argentine. Wood density was determined over two disc samples at four tree height (base, breast height, 30% and 50% of total tree height). According to determined ages, some trees were divided into two groups according to age (26-32 years and 9-12 years) and data were analyzed with an analysis of variance according to mixed model where tree was the random effect. Trees represent 74 % of total random variance. Within tree, axial tendency of wood density was to decrease from the base toward breast height and then its value was stable to the top. This was consistent across all sites and age groups. Forest resource growing at Los Tuelches site presented the highest basic wood density. (Author) 40 refs.
Espinosa Aldama, Mariana
2015-04-01
The gravity apple tree is a genealogical tree of the gravitation theories developed during the past century. The graphic representation is full of information such as guides in heuristic principles, names of main proponents, dates and references for original articles (See under Supplementary Data for the graphic representation). This visual presentation and its particular classification allows a quick synthetic view for a plurality of theories, many of them well validated in the Solar System domain. Its diachronic structure organizes information in a shape of a tree following similarities through a formal concept analysis. It can be used for educational purposes or as a tool for philosophical discussion.
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...
Tree-growth analyses to estimate tree species' drought tolerance
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
A bijection between phylogenetic trees and plane oriented recursive trees
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.
Big trees, old trees, and growth factor tables
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...
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.
Alós-Ferrer, Carlos; Ritzberger, Klaus
2003-01-01
Abstract: The traditional model of sequential decision making, for instance, in extensive form games, is a tree. Most texts define a tree as a connected directed graph without loops and a distinguished node, called the root. But an abstract graph isnot a domain for decision theory. Decision theory perceives of acts as functions from states to consequences. Sequential decisions, accordingly, get conceptualized by mappings from sets of states to sets of consequences. Thus, the question arises w...
Visualisation of Regression Trees
Brunsdon, Chris
2007-01-01
he regression tree [1] has been used as a tool for exploring multivariate data sets for some time. As in multiple linear regression, the technique is applied to a data set consisting of a contin- uous response variable y and a set of predictor variables { x 1 ,x 2 ,...,x k } which may be continuous or categorical. However, instead of modelling y as a linear function of the predictors, regression trees model y as a series of ...
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 at...... 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....
DEFF Research Database (Denmark)
Schmidt, Lars Holger
Forest tree improvement encompasses a number of scientific and technical areas like floral-, reproductive- and micro-biology, genetics breeding methods and strategies, propagation, gene conservation, data analysis and statistics, each area with a comprehensive terminology. The terms selected...... for definition here are those most frequently used in tree improvement literature. Clonal propagation is included in the view of the great expansion of that field as a means of mass multiplication of improved material....
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
Anatomy of the Pythagoras' Tree
Teia, Luis
2016-01-01
The architecture of nature can be seen at play in a tree: no two are alike. The Pythagoras' tree behaves just as a "tree" in that the root plus the same movement repeated over and over again grows from a seed, to a plant, to a tree. In human life, this movement is termed cell division. With triples, this movement is a geometrical and…
Forest Service (USDA), Washington, DC.
Provides information on state trees for each of the 50 states and the District of Columbia. Includes for each state: (1) year in which state tree was chosen; (2) common and scientific names of the tree; (3) arbor day observance; (4) address of state forester; and (5) drawings of the tree, leaf, and fruit or cone. (JN)
Attack Trees with Sequential Conjunction
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
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
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...
DEFF Research Database (Denmark)
Ruan, Jue; Li, Heng; Chen, Zhongzhong
2008-01-01
TreeFam (http://www.treefam.org) was developed to provide curated phylogenetic trees for all animal gene families, as well as orthologue and paralogue assignments. Release 4.0 of TreeFam contains curated trees for 1314 families and automatically generated trees for another 14,351 families. We have...... expanded TreeFam to include 25 fully sequenced animal genomes, as well as four genomes from plant and fungal outgroup species. We have also introduced more accurate approaches for automatically grouping genes into families, for building phylogenetic trees, and for inferring orthologues and paralogues....... The user interface for viewing phylogenetic trees and family information has been improved. Furthermore, a new perl API lets users easily extract data from the TreeFam mysql database....
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...
Random forest ensemble classification based fuzzy logic
Ben Ayed, Abdelkarim; Benhammouda, Marwa; Ben Halima, Mohamed; Alimi, Adel M.
2017-03-01
In this paper, we treat the supervised data classification, while using the fuzzy random forests that combine the hardiness of the decision trees, the power of the random selection that increases the diversity of the trees in the forest as well as the flexibility of the fuzzy logic for noise. We will be interested in the construction of a forest of fuzzy decision trees. Our system is validated on nine standard classification benchmarks from UCI repository and have the specificity to control some data, to reduce the rate of mistakes and to put in evidence more of hardiness and more of interoperability.
Identification of Fruit Tree Compositions in Public Parks Structure. Warsaw Case Study
Directory of Open Access Journals (Sweden)
Tabita Teodora Lisandru
2016-11-01
Full Text Available Fruit trees are essential components of different types of greenery, including not only private gardens but also historical and modern public parks and gardens of many other cities. The research was carried out in spring 2016 by visiting different parks. Fruit trees were identified in 22 public parks of Warsaw situated in different districts of the city and picked up randomly for preliminary study. Observations were made by photographic documentation and mapping of the fruit trees on park plans using GPS coordinates which were taken during the site visit and Google Earth maps. According to the observations, selected fruit trees compositions have been recognized in public parks of Warsaw. The compositional structures that have been observed consist of solitaire fruit trees, groups of trees (containing fruit trees, but mostly composed of fruit trees and ornamental shrubs and linear structures of fruit trees (rows and alleys. The results of the preliminary study show that the most frequent fruit tree compositions used in the structure of selected public parks of Warsaw represent groups of trees - groups that consist of fruit trees and different species of ornamental shrubs. The undertaken study confirmed that fruit trees planted in the public parks of Warsaw have a high compositional value. They play an important role in the spatial arrangement of the parks selected, but also define the scope and borders of the selected garden interiors and create attractive sites.
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 particular we do not require that S ends with a unique symbol. This corresponds to considering the more general definition of implicit or extended suffix trees. Such general suffix trees have many applications and are for example needed to allow efficient updates when suffix trees are built online. We prove...... that r is a suffix tree if and only if it is realized by a string S of length n - 1, and we give a linear-time algorithm for inferring S when the first letter on each edge is known. This generalizes the work of I et al....
The Future of Systematics: Tree Thinking without the Tree
Velasco, Joel D.
2012-01-01
Phylogenetic trees are meant to represent the genealogical history of life and apparently derive their justification from the existence of the tree of life and the fact that evolutionary processes are treelike. However, there are a number of problems for these assumptions. Here it is argued that once we understand the important role that phylogenetic trees play as models that contain idealizations, we can accept these criticisms and deny the reality of the tree while justifying the continued ...
The Inference of Gene Trees with Species Trees
Szöllősi, Gergely J.; Tannier, Eric; Daubin, Vincent; Boussau, Bastien
2015-01-01
This article reviews the various models that have been used to describe the relationships between gene trees and species trees. Molecular phylogeny has focused mainly on improving models for the reconstruction of gene trees based on sequence alignments. Yet, most phylogeneticists seek to reveal the history of species. Although the histories of genes and species are tightly linked, they are seldom identical, because genes duplicate, are lost or horizontally transferred, and because alleles can coexist in populations for periods that may span several speciation events. Building models describing the relationship between gene and species trees can thus improve the reconstruction of gene trees when a species tree is known, and vice versa. Several approaches have been proposed to solve the problem in one direction or the other, but in general neither gene trees nor species trees are known. Only a few studies have attempted to jointly infer gene trees and species trees. These models account for gene duplication and loss, transfer or incomplete lineage sorting. Some of them consider several types of events together, but none exists currently that considers the full repertoire of processes that generate gene trees along the species tree. Simulations as well as empirical studies on genomic data show that combining gene tree–species tree models with models of sequence evolution improves gene tree reconstruction. In turn, these better gene trees provide a more reliable basis for studying genome evolution or reconstructing ancestral chromosomes and ancestral gene sequences. We predict that gene tree–species tree methods that can deal with genomic data sets will be instrumental to advancing our understanding of genomic evolution. PMID:25070970
Rollón de Pinedo, Álvaro
2016-01-01
El presente Trabajo de Fin de Grado tiene como objetivo fundamental la realización de experimentos y simulaciones que permitan mejorar la comprensión que se posee de una de las herramientas estadísticas más potentes de las últimas décadas, especialmente en problemas de regresión y clasificación, los Random Forests. Los algoritmos de Bosques Aleatorios surgen como la evolución natural de los modelos estadísticos de árboles individuales de decisión, entre los cuales se pueden destacar dos pr...
Solution trees as a basis for game tree search
A. de Bruin (Arie); W.H.L.M. Pijls (Wim); A. Plaat (Aske)
1994-01-01
textabstractA game tree algorithm is an algorithm computing the minimax value of the root of a game tree. Many algorithms use the notion of establishing proofs that this value lies above or below some boundary value. We show that this amounts to the construction of a solution tree. We discuss the
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 ...
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 sessi...
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 complexi...
Schellhorn, Gerhard
2002-01-01
Formal fault tree semantics / G. Schellhorn, A. Thums, and W. Reif. - In: IDPT : Proceedings of the Sixth World Conference on Integrated Design and Process Technology : June 23 - 27, 2003, Pasadena, California / SDPS, Society for Design & Process Science. - 2002. - 1CD-ROM
Peter Bedker; Joseph O' Brien; Manfred Mielke
2012-01-01
The objective of pruning is to produce strong, healthy, attractive plants. By understanding how, when and why to prune, and by following a few simple principles, this objective can be achievedHow to Prune Trees (Revised 2012) Agency Publisher: Agriculture Dept., Forest Service, Northeastern Area State and Price forestry USA List Price:$4.00 Sale...
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
Department of Entomology Michigan State University
1998-01-01
This manual can help you identify and control damaging Christmas tree pests in the North Central region of the United States. Most of the information also applies to the northeastern states and to the southern portions of the Canadian Provinces that border these states. You do not have to be a pest specialist to use this information; we wrote the manual in everyday...
Baum, David A.; Offner, Susan
2008-01-01
Phylogenetic trees, which are depictions of the inferred evolutionary relationships among a set of species, now permeate almost all branches of biology and are appearing in increasing numbers in biology textbooks. While few state standards explicitly require knowledge of phylogenetics, most require some knowledge of evolutionary biology, and many…
J.C. Bioch (Cor); T. Petter; R. Potharst (Rob)
1997-01-01
textabstractEUR-FEW-CS-97-07 Title Monotone decision trees Author(s) R. Potharst J.C. Bioch T. Petter Abstract In many classification problems the domains of the attributes and the classes are linearly ordered. Often, classification must preserve this ordering: this is called monotone
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....
Certified Kruskal's Tree Theorem
Directory of Open Access Journals (Sweden)
Christian Sternagel
2014-07-01
Full Text Available This article presents the first formalization of Kurskal's tree theorem in aproof assistant. The Isabelle/HOL development is along the lines of Nash-Williams' original minimal bad sequence argument for proving the treetheorem. Along the way, proofs of Dickson's lemma and Higman's lemma, as well as some technical details of the formalization are discussed.
Directory of Open Access Journals (Sweden)
Pornwiwan Pothasin
Full Text Available Fig trees (Ficus are often ecologically significant keystone species because they sustain populations of the many seed-dispersing animals that feed on their fruits. They are prominent components of riparian zones where they may also contribute to bank stability as well as supporting associated animals. The diversity and distributions of riparian fig trees in deciduous and evergreen forests in Chiang Mai Province, Northern Thailand were investigated in 2010-2012. To record the diversity and abundance of riparian fig trees, we (1 calculated stem density, species richness, and diversity indices in 20×50 m randomly selected quadrats along four streams and (2 measured the distances of individual trees from four streams to determine if species exhibit distinct distribution patterns within riparian zones. A total of 1169 individuals (from c. 4 ha were recorded in the quadrats, representing 33 Ficus species (13 monoecious and 20 dioecious from six sub-genera and about 70% of all the species recorded from northern Thailand. All 33 species had at least some stems in close proximity to the streams, but they varied in their typical proximity, with F. squamosa Roxb. and F. ischnopoda Miq the most strictly stream-side species. The riparian forests in Northern Thailand support a rich diversity and high density of Ficus species and our results emphasise the importance of fig tree within the broader priorities of riparian area conservation. Plans to maintain or restore properly functioning riparian forests need to take into account their significance.
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.
RRT*-SMART: A Rapid Convergence Implementation of RRT*
Nasir, Jauwairia; Islam, Fahad; Malik, Usman; Ayaz, Yasar; Hasan, Osman; Khan, Mushtaq; Muhammad, Mannan Saeed
2013-01-01
Many sampling based algorithms have been introduced recently. Among them Rapidly Exploring Random Tree (RRT) is one of the quickest and the most efficient obstacle free path finding algorithm. Although it ensures probabilistic completeness, it cannot guarantee finding the most optimal path. Rapidly Exploring Random Tree Star (RRT*), a recently proposed extension of RRT, claims to achieve convergence towards the optimal solution thus ensuring asymptotic optimality along with probabilistic comp...
Comparison of decision tree methods for finding active objects
Zhao, Yongheng; Zhang, Yanxia
The automated classification of objects from large catalogs or survey projects is an important task in many astronomical surveys. Faced with various classification algorithms, astronomers should select the method according to their requirements. Here we describe several kinds of decision trees for finding active objects by multi-wavelength data, such as REPTree, Random Tree, Decision Stump, Random Forest, J48, NBTree, AdTree. All decision tree approaches investigated are in the WEKA package. The classification performance of the methods is presented. In the process of classification by decision tree methods, the classification rules are easily obtained, moreover these rules are clear and easy to understand for astronomers. As a result, astronomers are inclined to prefer and apply them, thus know which attributes are important to discriminate celestial objects. The experimental results show that when various decision trees are applied in discriminating active objects (quasars, BL Lac objects and active galaxies) from non-active objects (stars and galaxies), ADTree is the best only in terms of accuracy, Decision Stump is the best only considering speed, J48 is the optimal choice considering both accuracy and speed.
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. [Gavoill...
Training and Pruning Apple Trees
Marini, Richard P. (Richard Paul), 1952-
2009-01-01
Discusses the pruning and training of apple trees, placing emphasis on proper training of young trees to save time and the expense of future pruning, and to produce earlier profitable crops. Advises about the best techniques for pruning in relation to age of the apple tree.
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...
TAG: A tree-assisted gossip protocol for on-demand video streaming
Zhou, Ming
2005-01-01
While a tree topology is often advocated for overlay video streaming due to its scalability, it suffers from discontinuous playback under highly dynamic network environments. On the other hand, gossip protocols using random message dissemination, though robust, fail to meet the real-time constraints for streaming applications. In this master thesis, I proposed TAG, a Tree-Assisted Gossip protocol, which adopts a tree structure with time indexing to accommodate asynchronous requests, and an ef...
Greedy heuristics for minimization of number of terminal nodes in decision trees
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.
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
A deterministic model for the growth of non-conducting electrical tree structures
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 t...
Comparison of Greedy Algorithms for Decision Tree Optimization
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.
Contrasting natural regeneration and tree planting in fourteen North American cities
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...
root rot disease of five fruit tree seedlings in the nursery
African Journals Online (AJOL)
KAMALDEEN
out on the 5 fruit trees with the 10 isolated fungi. The 5 fruit tree seedlings were then potted in polypots filled with forest soil. The disease organisms were confirmed by. Koch's postulates. The experiment was laid out in a completely randomized design replicated three times. Fusarium oxysporum and Aspergillus flavus were ...
Tree species exhibit complex patterns of distribution in bottomland hardwood forests
Luben D Dimov; Jim L Chambers; Brian R. Lockhart
2013-01-01
& Context Understanding tree interactions requires an insight into their spatial distribution. & Aims We looked for presence and extent of tree intraspecific spatial point pattern (random, aggregated, or overdispersed) and interspecific spatial point pattern (independent, aggregated, or segregated). & Methods We established twelve 0.64-ha plots in natural...
Influence of tree spatial pattern and sample plot type and size on inventory
John-Pascall Berrill; Kevin L. O' Hara
2012-01-01
Sampling with different plot types and sizes was simulated using tree location maps and data collected in three even-aged coast redwood (Sequoia sempervirens) stands selected to represent uniform, random, and clumped spatial patterns of tree locations. Fixed-radius circular plots, belt transects, and variable-radius plots were installed by...
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 ...
Finding paths in tree graphs with a quantum walk
Koch, Daniel; Hillery, Mark
2018-01-01
We analyze the potential for different types of searches using the formalism of scattering random walks on quantum computers. Given a particular type of graph consisting of nodes and connections, a "tree maze," we would like to find a selected final node as quickly as possible, faster than any classical search algorithm. We show that this can be done using a quantum random walk, both through numerical calculations as well as by using the eigenvectors and eigenvalues of the quantum system.
Directory of Open Access Journals (Sweden)
Zhen Zhu
Full Text Available The fragmentation of production across countries has become an important feature of the globalization in recent decades and is often conceptualized by the term "global value chains" (GVCs. When empirically investigating the GVCs, previous studies are mainly interested in knowing how global the GVCs are rather than how the GVCs look like. From a complex networks perspective, we use the World Input-Output Database (WIOD to study the evolution of the global production system. We find that the industry-level GVCs are indeed not chain-like but are better characterized by the tree topology. Hence, we compute the global value trees (GVTs for all the industries available in the WIOD. Moreover, we compute an industry importance measure based on the GVTs and compare it with other network centrality measures. Finally, we discuss some future applications of the GVTs.
Appleton, Bonnie Lee, 1948-2012
2009-01-01
Few residential trees die of old age. Mechanical damage and improper tree care kill more trees than any insects or diseases. This publication shows 24 ways to void making the tree-damaging mistake. Few of these items alone would kill a tree, but multiple problems will certainly stress, and could eventually kill, a tree.
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.
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...
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.
Forrow, Aden; Woodhouse, Francis; Dunkel, Joern
Coherent, large scale dynamics in many nonequilibrium physical, biological, or information transport networks are driven by small-scale local energy input. We introduce and explore a generic model for compressible active flows on tree networks. In contrast to thermally-driven systems, active friction selects discrete states with only a small number of oscillation modes activated at distinct fixed amplitudes. This state selection interacts with graph topology to produce different localized dynamical time scales in separate regions of large networks. Using perturbation theory, we systematically predict the stationary states of noisy networks and find good agreement with a Bayesian state estimation based on a hidden Markov model applied to simulated time series data on binary trees. While the number of stable states per tree scales exponentially with the number of edges, the mean number of activated modes in each state averages 1 / 4 the number of edges. More broadly, these results suggest that the macroscopic response of active networks, from actomyosin force networks in cells to cytoplasmic flows, can be dominated by a significantly reduced number of modes, in stark contrast to energy equipartition in thermal equilibrium systems.
Tree species composition, structure and utilisation in Maruzi Hills ...
African Journals Online (AJOL)
The study investigated the tree species composition, vegetation structure and harvesting pattern to guide management of the Maruzi Hills Forest Reserve. Stratified random sampling was used to site six (100 m × 100 m) permanent sample plots in the woodland, bushland and grassland vegetation types identified in the ...
Arsenical poisoning of fruit trees
Energy Technology Data Exchange (ETDEWEB)
Headden, W.P.
1910-01-01
Corrosive arsenical poisoning attacks the tree at the crown, below the surface of the soil and usually involves the large roots also. Pear and apple trees are affected; the pear tree is, at least, as susceptible to the action of the arsenic as the apple tree. Some varieties of pears, as well as apples, seem more susceptible than others, but this is true only in a general way. The age of the tree at the time the first applications were made seems to have some effect upon the resisting power of the bark. The variety of soil may have some influence but it is not pronounced enough to be recognized with certainty. The first sign of trouble in the apple tree is an early ripening of the leaves, at least, one year before the death of the tree; in pear trees the foilage ripens early and assumes a deep purple color. The amount of arsenic present in the destroyed bark and in the woody tissues of such trees is as great as in cases in which it is known that arsenic was the cause of death. The trouble is very general throughout the state and occurs in all kinds of soils which fact eliminates the question of seepage and, to a large extent, that of alkalis. In the case of trees which have not been sprayed but which have been grown as fillers in sprayed orchards, the wood contained arsenic. This is true, too, of young trees grown in soil which contains arsenic. This shows that the arsenic may be taken up with the nitrient solutions. The fruit grown on such trees, apples and pears, contain arsenic and also the leaves. The fruit and leaves grow and are shed each season; this is not the case with the woody portions of the tree. Systemic poisoning is produced by this arsenic distributed throughout the tree, interfering with nutrition and growth of the three and in some cases causing its death.
Rate of tree carbon accumulation increases continuously with tree size
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.
Radiofrequency radiation injures trees around mobile phone base stations.
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/m2) showed no damage. Statistical analysis demonstrated that electromagnetic radiation from mobile phone masts is harmful for trees. These results are consistent with the fact that
SPRIT: Identifying horizontal gene transfer in rooted phylogenetic trees
Directory of Open Access Journals (Sweden)
Fredriksson Robert
2010-02-01
Full Text Available Abstract Background Phylogenetic trees based on sequences from a set of taxa can be incongruent due to horizontal gene transfer (HGT. By identifying the HGT events, we can reconcile the gene trees and derive a taxon tree that adequately represents the species' evolutionary history. One HGT can be represented by a rooted Subtree Prune and Regraft (RSPR operation and the number of RSPRs separating two trees corresponds to the minimum number of HGT events. Identifying the minimum number of RSPRs separating two trees is NP-hard, but the problem can be reduced to fixed parameter tractable. A number of heuristic and two exact approaches to identifying the minimum number of RSPRs have been proposed. This is the first implementation delivering an exact solution as well as the intermediate trees connecting the input trees. Results We present the SPR Identification Tool (SPRIT, a novel algorithm that solves the fixed parameter tractable minimum RSPR problem and its GPL licensed Java implementation. The algorithm can be used in two ways, exhaustive search that guarantees the minimum RSPR distance and a heuristic approach that guarantees finding a solution, but not necessarily the minimum one. We benchmarked SPRIT against other software in two different settings, small to medium sized trees i.e. five to one hundred taxa and large trees i.e. thousands of taxa. In the small to medium tree size setting with random artificial incongruence, SPRIT's heuristic mode outperforms the other software by always delivering a solution with a low overestimation of the RSPR distance. In the large tree setting SPRIT compares well to the alternatives when benchmarked on finding a minimum solution within a reasonable time. SPRIT presents both the minimum RSPR distance and the intermediate trees. Conclusions When used in exhaustive search mode, SPRIT identifies the minimum number of RSPRs needed to reconcile two incongruent rooted trees. SPRIT also performs quick approximations
Completely Independent Spanning Trees in (Partial k-Trees
Directory of Open Access Journals (Sweden)
Matsushita Masayoshi
2015-08-01
Full Text Available Two spanning trees T1 and T2 of a graph G are completely independent if, for any two vertices u and v, the paths from u to v in T1 and T2 are internally disjoint. For a graph G, we denote the maximum number of pairwise completely independent spanning trees by cist(G. In this paper, we consider cist(G when G is a partial k-tree.
Trees in the city: valuing street trees in Portland, Oregon
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...
Decoding the genomic tree of life.
Simonson, Anne B; Servin, Jacqueline A; Skophammer, Ryan G; Herbold, Craig W; Rivera, Maria C; Lake, James A
2005-05-03
Genomes hold within them the record of the evolution of life on Earth. But genome fusions and horizontal gene transfer (HGT) seem to have obscured sufficiently the gene sequence record such that it is difficult to reconstruct the phylogenetic tree of life. HGT among prokaryotes is not random, however. Some genes (informational genes) are more difficult to transfer than others (operational genes). Furthermore, environmental, metabolic, and genetic differences among organisms restrict HGT, so that prokaryotes preferentially share genes with other prokaryotes having properties in common, including genome size, genome G+C composition, carbon utilization, oxygen utilization/sensitivity, and temperature optima, further complicating attempts to reconstruct the tree of life. A new method of phylogenetic reconstruction based on gene presence and absence, called conditioned reconstruction, has improved our prospects for reconstructing prokaryotic evolution. It is also able to detect past genome fusions, such as the fusion that appears to have created the first eukaryote. This genome fusion between a deep branching eubacterium, possibly an ancestor of the cyanobacterium and a proteobacterium, with an archaeal eocyte (crenarchaea), appears to be the result of an early symbiosis. Given new tools and new genes from relevant organisms, it should soon be possible to test current and future fusion theories for the origin of eukaryotes and to discover the general outlines of the prokaryotic tree of life.
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.
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.
Preference Factoring for Stochastic Trees
Gordon Hazen
2000-01-01
Stochastic trees are extensions of decision trees that facilitate the modeling of temporal uncertainties. Their primary application has been to medical treatment decisions. It is often convenient to present stochastic trees in factored form, allowing loosely coupled pieces of the model to be formulated and presented separately. In this paper, we show how the notion of factoring can be extended as well to preference components of the stochastic model. We examine updateable-state utility, a fle...
Tree felling: a necessary evil
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...
Tree games with regular objectives
Directory of Open Access Journals (Sweden)
Marcin Przybyłko
2014-08-01
Full Text Available We study tree games developed recently by Matteo Mio as a game interpretation of the probabilistic μ-calculus. With expressive power comes complexity. Mio showed that tree games are able to encode Blackwell games and, consequently, are not determined under deterministic strategies. We show that non-stochastic tree games with objectives recognisable by so-called game automata are determined under deterministic, finite memory strategies. Moreover, we give an elementary algorithmic procedure which, for an arbitrary regular language L and a finite non-stochastic tree game with a winning objective L decides if the game is determined under deterministic strategies.
Making CSB + -Trees Processor Conscious
DEFF Research Database (Denmark)
Samuel, Michael; Pedersen, Anders Uhl; Bonnet, Philippe
2005-01-01
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 performan...... 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....
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...
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.
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.
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.
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.
A suffix tree or not a suffix tree?
DEFF Research Database (Denmark)
Starikovskaya, Tatiana; Vildhøj, Hjalte Wedel
2015-01-01
search. In this paper, we prove that τ is a suffix tree if and only if it is realized by a string S of length n-1, and we give a linear-time algorithm for inferring S when the first letter on each edge is known. This generalizes the work of I et al. (2014) [15]. [All rights reserved Elsevier].......In this paper we study the structure of suffix trees. Given an unlabeled tree τ on n nodes and suffix links of its internal nodes, we ask the question “Is τ a suffix tree?”, i.e., is there a string S whose suffix tree has the same topological structure as τ? We place no restrictions on S......, in particular we do not require that S ends with a unique symbol. This corresponds to considering the more general definition of implicit or extended suffix trees. Such general suffix trees have many applications and are for example needed to allow efficient updates when suffix trees are built online. Deciding...
DIF Trees: Using Classification Trees to Detect Differential Item Functioning
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…
Whole-tree canopy enclosures: why cage a tree?
Jerome F. Grant; Abdul Hakeem; Paris L. Lambdin; Gregory J. Wiggins; Rusty J. Rhea
2011-01-01
The use of whole-tree canopy enclosures (i.e., cages) is not a typical approach to assessing biological parameters and interactions in a forest setting. However, the successful application of this technology may enable researchers to better understand certain types of tree/organismal interactions.
Tree Size Comparison of Some Important Street Trees Growing at ...
African Journals Online (AJOL)
PROF HORSFALL
Trees found in the urban environment prevent solar radiation from heating buildings, cool the area through their evapotranspiration, reduce wind speed and reduce the need to use air-conditioning systems (Dimoudi and. Nikolopoulou, 2003). Urban conditions are known to affect tree growth. As the ecology of urban systems.
Directory of Open Access Journals (Sweden)
Xuemei Sun
2015-01-01
Full Text Available Degree constrained minimum spanning tree (DCMST refers to constructing a spanning tree of minimum weight in a complete graph with weights on edges while the degree of each node in the spanning tree is no more than d (d ≥ 2. The paper proposes an improved multicolony ant algorithm for degree constrained minimum spanning tree searching which enables independent search for optimal solutions among various colonies and achieving information exchanges between different colonies by information entropy. Local optimal algorithm is introduced to improve constructed spanning tree. Meanwhile, algorithm strategies in dynamic ant, random perturbations ant colony, and max-min ant system are adapted in this paper to optimize the proposed algorithm. Finally, multiple groups of experimental data show the superiority of the improved algorithm in solving the problems of degree constrained minimum spanning tree.
Localization of Discrete Time Quantum Walks on the Glued Trees
Directory of Open Access Journals (Sweden)
Yusuke Ide
2014-03-01
Full Text Available In this paper, we consider the time averaged distribution of discrete time quantum walks on the glued trees. In order to analyze the walks on the glued trees, we consider a reduction to the walks on path graphs. Using a spectral analysis of the Jacobi matrices defined by the corresponding random walks on the path graphs, we have a spectral decomposition of the time evolution operator of the quantum walks. We find significant contributions of the eigenvalues, ±1, of the Jacobi matrices to the time averaged limit distribution of the quantum walks. As a consequence, we obtain the lower bounds of the time averaged distribution.
Urban tree database and allometric equations
E. Gregory McPherson; Natalie S. van Doorn; Paula J. Peper
2016-01-01
Information on urban tree growth underpins models used to calculate the effects of trees on the environment and human well-being. Maximum tree size and other growth data are used by urban forest managers, landscape architects, and planners to select trees most suitable to the amount of growing space, thereby reducing costly future conflicts between trees and...
Generalized and synthetic regression estimators for randomized branch sampling
David L. R. Affleck; Timothy G. Gregoire
2015-01-01
In felled-tree studies, ratio and regression estimators are commonly used to convert more readily measured branch characteristics to dry crown mass estimates. In some cases, data from multiple trees are pooled to form these estimates. This research evaluates the utility of both tactics in the estimation of crown biomass following randomized branch sampling (...
PageRank in scale-free random graphs
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
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.
Tree physiology and bark beetles
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,...
Who pays for tree improvement?
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...
Looking/Learning Drawing: Trees.
Hurwitz, Al; Blume, Sharon
1985-01-01
Secondary students are asked to study and compare three reproductions--Van Gogh's "Grove of Cypresses," Da Vinci's "Study of a Tree," and Mondrian's "Tree II." The activity will help students develop their powers of observation and analysis, powers that can be applied to their own drawings. (RM)
Energy Technology Data Exchange (ETDEWEB)
Poulsen, G.
1983-01-01
In the tropics, a significant proportion of wood supplies is obtained from trees on farmland rather than from forest. Reliable estimates of wood fuel resources are difficult to obtain by conventional mensuration techniques since such trees are often subjected to regular heavy pruning and pollarding. Productive potential of hedgerows and other small scrub vegetation used for fuel is also difficult to measure.
Chain-Constrained Spanning Trees
Olver, N.K.; Zenklusen, R.
2013-01-01
We consider the problem of finding a spanning tree satisfying a family of additional constraints. Several settings have been considered previously, the most famous being the problem of finding a spanning tree with degree constraints. Since the problem is hard, the goal is typically to find a
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...
William B. Critchfield
1965-01-01
A hybrid pine developed in the course of forest-tree improvement research. by the U. S. Forest Service has caught the interest of Christmas tree growers. It is a hybrid between two races of lodgepole pine (Pinus contorta) produced at the Institute of Forest Genetics at Placerville, California, and has some desirable attributes for use as a Christmas...
Tree Hydraulics: How Sap Rises
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…
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...
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
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 relation to the so-called uniform infinite tree and results on the Hausdorff and spectral dimension of two-dimensional space-time obtained in B. Durhuus, T. Jonsson, J.F. Wheater, J. Stat. Phys. 139, 859 (2010) are briefly outlined. For the latter we discuss results on the absence of spontaneous...
Wehenkel, Christian; Brazão-Protázio, João Marcelo; Carrillo-Parra, Artemio; Martínez-Guerrero, José Hugo; Crecente-Campo, Felipe
2015-01-01
The very rare Mexican Picea chihuahuana tree community covers an area of no more than 300 ha in the Sierra Madre Occidental. This special tree community has been the subject of several studies aimed at learning more about the genetic structure and ecology of the species and the potential effects of climate change. The spatial distribution of trees is a result of many ecological processes and can affect the degree of competition between neighbouring trees, tree density, variability in size and distribution, regeneration, survival, growth, mortality, crown formation and the biological diversity within forest communities. Numerous scale-dependent measures have been established in order to describe spatial forest structure. The overall aim of most of these studies has been to obtain data to help design preservation and conservation strategies. In this study, we examined the spatial distribution pattern of trees in the P. chihuahuana tree community in 12 localities, in relation to i) tree stand density, ii) diameter distribution (vertical structure), iii) tree species diversity, iv) geographical latitude and v) tree dominance at a fine scale (in 0.25 ha plots), with the aim of obtaining a better understanding of the complex ecosystem processes and biological diversity. Because of the strongly mixed nature of this tree community, which often produces low population densities of each tree species and random tree fall gaps caused by tree death, we expect aggregated patterns in individual Picea chihuahuana trees and in the P. chihuahuana tree community, repulsive Picea patterns to other tree species and repulsive patterns of young to adult trees. Each location was represented by one plot of 50 x 50 m (0.25 ha) established in the centre of the tree community. The findings demonstrate that the hypothesis of aggregated tree pattern is not applicable to the mean pattern measured by Clark-Evans index, Uniform Angle index and Mean Directional index of the uneven-aged P
Directory of Open Access Journals (Sweden)
Christian Wehenkel
Full Text Available The very rare Mexican Picea chihuahuana tree community covers an area of no more than 300 ha in the Sierra Madre Occidental. This special tree community has been the subject of several studies aimed at learning more about the genetic structure and ecology of the species and the potential effects of climate change. The spatial distribution of trees is a result of many ecological processes and can affect the degree of competition between neighbouring trees, tree density, variability in size and distribution, regeneration, survival, growth, mortality, crown formation and the biological diversity within forest communities. Numerous scale-dependent measures have been established in order to describe spatial forest structure. The overall aim of most of these studies has been to obtain data to help design preservation and conservation strategies. In this study, we examined the spatial distribution pattern of trees in the P. chihuahuana tree community in 12 localities, in relation to i tree stand density, ii diameter distribution (vertical structure, iii tree species diversity, iv geographical latitude and v tree dominance at a fine scale (in 0.25 ha plots, with the aim of obtaining a better understanding of the complex ecosystem processes and biological diversity. Because of the strongly mixed nature of this tree community, which often produces low population densities of each tree species and random tree fall gaps caused by tree death, we expect aggregated patterns in individual Picea chihuahuana trees and in the P. chihuahuana tree community, repulsive Picea patterns to other tree species and repulsive patterns of young to adult trees. Each location was represented by one plot of 50 x 50 m (0.25 ha established in the centre of the tree community. The findings demonstrate that the hypothesis of aggregated tree pattern is not applicable to the mean pattern measured by Clark-Evans index, Uniform Angle index and Mean Directional index of the uneven
Getting Chemicals into Trees without Spraying
Kuhns, Michael
2011-01-01
Chemicals are applied to trees for many reasons. Insecticides repel or kill damaging insects, fungicides treat or prevent fungal diseases, nutrients and plant growth regulators affect growth, and herbicides kill trees or prevent sprouting after tree removal.
The Heritage of Nature: Heritage Trees
Zöhre Polat
2017-01-01
Heritage trees are naturel heritages. Heritage trees are typically a large, individual tree with unique value, which is considered irreplaceable. The major criteria for heritage tree designation are age, rarity, and size, as well as aesthetic, botanical, ecological, and historical value. Today many researcher’s focus on recording,, protection and management strategies of heritage trees. Counties have different strategies about heritage trees. The aims of the study are; (1) Preserving the cha...
Urban tree cover change in Detroit and Atlanta, USA, 1951-2010
Krista Merry; Jacek Siry; Pete Bettinger; J.M. Bowker
2014-01-01
We assessed tree cover using random points and polygons distributed within the administrative boundaries of Detroit, MI and Atlanta, GA. Two approaches were tested, a point-based approach using 1000 randomly located sample points, and polygon-based approach using 250 circular areas, 200 m in radius (12.56 ha). In the case of Atlanta, both approaches arrived at similar...
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...
Ensemble of randomized soft decision trees for robust classification
Indian Academy of Sciences (India)
G KISHOR KUMAR
τ + w/2 then it belongs to fuzzy block B2 called with a linguistic variable “tall”, otherwise it belongs to both fuzzy blocks “short” and “tall” with some fuzzy membership val- ues as shown in figure 1(b) where w is overlapping width of two fuzzy blocks “short” and “tall”. The fuzzy membership value can be calculated as follows.
The Heritage of Nature: Heritage Trees
Directory of Open Access Journals (Sweden)
Zöhre Polat
2017-08-01
Full Text Available Heritage trees are naturel heritages. Heritage trees are typically a large, individual tree with unique value, which is considered irreplaceable. The major criteria for heritage tree designation are age, rarity, and size, as well as aesthetic, botanical, ecological, and historical value. Today many researcher’s focus on recording,, protection and management strategies of heritage trees. Counties have different strategies about heritage trees. The aims of the study are; (1 Preserving the characteristics of being heritage trees, (2 Present suggestions for record, protection and management strategies of heritage trees in Turkey.
Disentangling the diversity of arboreal ant communities in tropical forest trees.
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.
Directory of Open Access Journals (Sweden)
Pete Bettinger
2015-04-01
Full Text Available This novel research investigated the use of a heuristic process to inform tree-level harvest decisions guided by the need to maximize the interspersion of tree species across a forest. In the heuristic process, a species mingling value for each tree was computed using both (1 neighbors that were simply of a different species than the reference tree and (2 neighbors that were uniquely different species from both the reference tree and other neighbors of the reference tree. The tree-level species mingling value was averaged for the stand, which was then subject to a maximization process. Constraints included residual tree density levels and minimum tree volume harvest levels. In two case studies, results suggest that the species mingling index at the stand level can be significantly increased over randomly allocated harvest decisions using the heuristic process described. In the case studies, we illustrate how this type of process can inform management decisions by suggesting the distance between residual trees of similar species given the initial stand structure and the objectives and constraints. The work represents a unique tree-level optimization approach that one day may be of value as new technologies are developed to map the location of individual trees in a timely and efficient manner.
Automated Generation of Attack Trees
DEFF Research Database (Denmark)
Vigo, Roberto; Nielson, Flemming; Nielson, Hanne Riis
2014-01-01
-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...... interesting quantitative problems, that can be solved through an encoding into Satisfiability Modulo Theories. The flexibility and effectiveness of the approach is demonstrated on the study of a national-scale authentication system, whose attack tree is computed thanks to a Java implementation...
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....
Phytoremediation with transgenic trees
Energy Technology Data Exchange (ETDEWEB)
Peuke, A.D.; Rennenberg, H. [Inst. fuer Forstbotanik und Baumphysiologie, Professur fuer Baumphysiologie, Freiburg im Breisgau (Germany)
2005-04-01
In the present paper actual trends in the use of transgenic trees for phytoremediation of contaminated soils are reviewed. In this context a current field trial in which transgenic poplars with enhanced GSH synthesis and hence elevated capacity for phytochelatin production are compared with wildtype plants for the removal of heavy metals at different levels of contamination and under different climatic conditions. The studies are carried out with grey poplar (Populus tremula x P. alba), wildtype plants and plants overexpressing the gene for {gamma}-glutamylcysteine synthetase (gshI) from E. coli in the cytosol. The expression of this gene in poplar leads to two- to four-fold enhanced GSH concentrations in the leaves. In greenhouse experiments under controlled conditions these transgenic poplars showed a high potential for uptake and detoxification of heavy metals and pesticides. This capacity is evaluated in field experiments. Further aims of the project are to elucidate (a) the stability of the transgene under field conditions and (b) the possibility of horizontal gene transfer to microorganisms in the rhizosphere. The results will help to assess the biosafety risk of the use of transgenic poplar for phytoremediation of soils. (orig.)
Implementing Municipal Tree Planting: Los Angeles Million-Tree Initiative
Pincetl, Stephanie
2010-02-01
Urban forests are increasingly being seen as an important infrastructure that can help cities remediate their environmental impacts. This work reports on the first steps in implementing a million tree program in Los Angeles and the ways such a biogenic—living—infrastructure has been approached. Numbers of studies have been done to quantify the benefits of urban forests, but little has been written on the process of implementing urban tree planting programs. The investigative methods were primarily qualitative, involving interviews, attending meetings and conducting literature reviews. Results indicate that multiple nonprofit and city agency programs are involved in planting and maintaining trees and this has required coordination among groups that here-to-fore were unaccustomed to having to collaborate. The main finding that emerge from this research is that the implementation of such a program in Los Angeles is more complicated than it may seem due to several interacting factors: the need to rely on multiple public and private organizations to put trees into the ground and to maintain them; coordination of these multiple efforts must be centralized, but requires a great deal of time and effort and maybe resisted by some of the partners; funding for planting and long term maintenance must be pieced together from multiple sources; acceptance of trees by residents varies by neighborhood as does tree canopy cover; appropriate nursery supply can be limited; the location of the program within the city administration is determined by who initiates the program.
URBAN TREE CLASSIFICATION USING FULL-WAVEFORM AIRBORNE LASER SCANNING
Directory of Open Access Journals (Sweden)
Zs. Koma
2016-06-01
Full Text Available Vegetation mapping in urban environments plays an important role in biological research and urban management. Airborne laser scanning provides detailed 3D geodata, which allows to classify single trees into different taxa. Until now, research dealing with tree classification focused on forest environments. This study investigates the object-based classification of urban trees at taxonomic family level, using full-waveform airborne laser scanning data captured in the city centre of Vienna (Austria. The data set is characterised by a variety of taxa, including deciduous trees (beeches, mallows, plane trees and soapberries and the coniferous pine species. A workflow for tree object classification is presented using geometric and radiometric features. The derived features are related to point density, crown shape and radiometric characteristics. For the derivation of crown features, a prior detection of the crown base is performed. The effects of interfering objects (e.g. fences and cars which are typical in urban areas on the feature characteristics and the subsequent classification accuracy are investigated. The applicability of the features is evaluated by Random Forest classification and exploratory analysis. The most reliable classification is achieved by using the combination of geometric and radiometric features, resulting in 87.5% overall accuracy. By using radiometric features only, a reliable classification with accuracy of 86.3% can be achieved. The influence of interfering objects on feature characteristics is identified, in particular for the radiometric features. The results indicate the potential of using radiometric features in urban tree classification and show its limitations due to anthropogenic influences at the same time.
Spanning Tree Based Attribute Clustering
DEFF Research Database (Denmark)
Zeng, Yifeng; Jorge, Cordero Hernandez
2009-01-01
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...
Decision trees in epidemiological research
National Research Council Canada - National Science Library
Ashwini Venkatasubramaniam; Julian Wolfson; Nathan Mitchell; Timothy Barnes; Meghan JaKa; Simone French
2017-01-01
.... 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...
Algorithms for Decision Tree Construction
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.
Hiemstra, J.A.; Schoenmaker-van der Bijl, E.; Tonneijck, A.E.G.; Hoffman, M.H.A.
2008-01-01
This brochure describes the underlying principles that form a basis for better-informed choices with regards to the management of trees and shrubs in cities and the design of functional planting schemes.
Gascuel, Olivier; Steel, Mike
2014-05-01
Predicting the ancestral sequences of a group of homologous sequences related by a phylogenetic tree has been the subject of many studies, and numerous methods have been proposed for this purpose. Theoretical results are available that show that when the substitution rates become too large, reconstructing the ancestral state at the tree root is no longer feasible. Here, we also study the reconstruction of the ancestral changes that occurred along the tree edges. We show that, that, depending on the tree and branch length distribution, reconstructing these changes (i.e., reconstructing the ancestral state of all internal nodes in the tree) may be easier or harder than reconstructing the ancestral root state. However, results from information theory indicate that for the standard Yule tree, the task of reconstructing internal node states remains feasible, even for very high substitution rates. Moreover, computer simulations demonstrate that for more complex trees and scenarios, this result still holds. For a large variety of counting, parsimony- and likelihood-based methods, the predictive accuracy of a randomly selected internal node in the tree is indeed much higher than the accuracy of the same method when applied to the tree root. Moreover, parsimony- and likelihood-based methods appear to be remarkably robust to sampling bias and model mis-specification.
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.
Objective consensus from decision trees.
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.
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...
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...
Leaché, Adam D.; Banbury, Barbara L.; Felsenstein, Joseph; de Oca, Adrián nieto-Montes; Stamatakis, Alexandros
2015-01-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
Directory of Open Access Journals (Sweden)
Ónodi Gábor
2016-06-01
Full Text Available This study was carried out in Hungary, in an old unmanaged riparian poplar-willow forest during the breeding seasons of 2014 and 2015. The occurrence of two invasive tree species, the green ash and boxelder, is significant in the study area, which influences negatively the populations of native riparian tree species in Central Europe. We studied Great-spotted Woodpecker nest sites in the presence of these invasive species. Throughout the study period, eight and twelve nesting cavity trees were mapped. Trees were recorded in 20-20 circular plots of 0.05 ha both for each mapped nest trees and random plots as well. Species, diameter at breast height and condition were recorded for each tree. Composition and diversity of nest site and random plots were compared. Distributions and preferences were calculated for nest tree use. Most of the recorded trees were invasive. Nest site plots had more native trees compared to random plots. Nest site showed higher diversity in terms of all three variables. Decayed and dead willow and white poplar hybrid trees were preferred for nesting. Diameter at breast height of nest trees was between 30-90 cm. Studies about cavity excavators in transformed habitats have high importance for nature conservation of riparian forests.
Christmas Tree Pest Manual, Third Edition
Steven Katovich; Deborah McCullough; Michael Ostry; Jill O’Donnell; Isabel Munck; Cliff Sadof
2014-01-01
Continuing mortality of red pine from an unknown cause has been observed in 30 to 40 year old plantations in southern and west central Wisconsin. A single tree or small group of trees die, followed by mortality of adjacent trees. These circular pockets of dead trees expand up to 0.3 acre per year.
Tight bounds for top tree compression
DEFF Research Database (Denmark)
Bille, Philip; Fernstrøm, Finn; Gørtz, Inge Li
2017-01-01
We consider compressing labeled, ordered and rooted trees using DAG compression and top tree compression. We show that there exists a family of trees such that the size of the DAG compression is always a logarithmic factor smaller than the size of the top tree compression (even for an alphabet...
Factors that influence Christmas tree sales
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...
tree composition and distribution in federal university
African Journals Online (AJOL)
Tersor
assessed tree species composition and distribution in Federal University of Agriculture Makurdi. .... Trees with DBH of. ≤ 10 cm were also considered as tree and were enumerated within the 10 x10 m subplots. Each of the trees encountered was assigned a class ..... impact compared to plantation and residential area.
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 ...... algorithm makes the method of refined Buneman trees computational competitive to methods based on neighbor joining....
Microwave sensing of tree trunks
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
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.
Sign-compute-resolve for random access
Goseling, Jasper; Stefanovic, Cedomir; Popovski, Petar
2014-01-01
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
pinktoe: Semi-automatic Traversal of Trees
Guy Nason
2005-01-01
Tree based methods in S or R are extremely useful and popular. For simple trees and memorable variables it is easy to predict the outcome for a new case using only a standard decision tree diagram. However, for large trees or trees where the variable description is complex the decision tree diagram is often not enough. This article describes pinktoe: an R package containing two tools to assist with the semiautomatic traversal of trees. The PT tool creates a widget for each node to be visited ...
Supporting medical decisions with vector decision trees.
Sprogar, M; Kokol, P; Zorman, M; Podgorelec, V; Yamamoto, R; Masuda, G; Sakamoto, N
2001-01-01
The article presents the extension of a common decision tree concept to a multidimensional - vector - decision tree constructed with the help of evolutionary techniques. In contrary to the common decision tree the vector decision tree can make more than just one suggestion per input sample. It has the functionality of many separate decision trees acting on a same set of training data and answering different questions. Vector decision tree is therefore simple in its form, is easy to use and analyse and can express some relationships between decisions not visible before. To explore and test the possibilities of this concept we developed a software tool--DecRain--for building vector decision trees using the ideas of evolutionary computing. Generated vector decision trees showed good results in comparison to classical decision trees. The concept of vector decision trees can be safely and effectively used in any decision making process.
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\
Localization transition of biased random walks on random networks.
Sood, Vishal; Grassberger, Peter
2007-08-31
We study random walks on large random graphs that are biased towards a randomly chosen but fixed target node. We show that a critical bias strength bc exists such that most walks find the target within a finite time when b > bc. For b infinity before hitting the target. The phase transition at b=bc is a critical point in the sense that quantities such as the return probability P(t) show power laws, but finite-size behavior is complex and does not obey the usual finite-size scaling ansatz. By extending rigorous results for biased walks on Galton-Watson trees, we give the exact analytical value for bc and verify it by large scale simulations.
MEASUREMENT OF WIND DRAG FORCES ON TREES
Hiroyoshi, SHI-IGAI; Toru, Maruyama; Professor, Institute of Engineering Mechanics, University of Tsukuba; Engineer, Nissei Jushi Kogyo
1988-01-01
Trees have a lot of effects on soil conservation at mountainous regions. However, they often trigger land slides or mud avalanches if they cannot resist against strong winds, since the fallen trees may dam up mud and water and that natural dam eventually collapses, which triggers landslides. We developed a technique to estimate the total mass of trees in vivo and evaluated the wind force which acts on trees under natural conditions. The evaluated wind drag coefficients of trees whose height i...
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
Understanding Boswellia papyrifera tree secondary metabolites through bark spectral analysis
Girma, Atkilt; Skidmore, Andrew K.; de Bie, C. A. J. M.; Bongers, Frans
2015-07-01
Decision makers are concerned whether to tap or rest Boswellia Papyrifera trees. Tapping for the production of frankincense is known to deplete carbon reserves from the tree leading to production of less viable seeds, tree carbon starvation and ultimately tree mortality. Decision makers use traditional experience without considering the amount of metabolites stored or depleted from the stem-bark of the tree. This research was designed to come up with a non-destructive B. papyrifera tree metabolite estimation technique relevant for management using spectroscopy. The concentration of biochemicals (metabolites) found in the tree bark was estimated through spectral analysis. Initially, a random sample of 33 trees was selected, the spectra of bark measured with an Analytical Spectral Device (ASD) spectrometer. Bark samples were air dried and ground. Then, 10 g of sample was soaked in Petroleum ether to extract crude metabolites. Further chemical analysis was conducted to quantify and isolate pure metabolite compounds such as incensole acetate and boswellic acid. The crude metabolites, which relate to frankincense produce, were compared to plant properties (such as diameter and crown area) and reflectance spectra of the bark. Moreover, the extract was compared to the ASD spectra using partial least square regression technique (PLSR) and continuum removed spectral analysis. The continuum removed spectral analysis were performed, on two wavelength regions (1275-1663 and 1836-2217) identified through PLSR, using absorption features such as band depth, area, position, asymmetry and the width to characterize and find relationship with the bark extracts. The results show that tree properties such as diameter at breast height (DBH) and the crown area of untapped and healthy trees were strongly correlated to the amount of stored crude metabolites. In addition, the PLSR technique applied to the first derivative transformation of the reflectance spectrum was found to estimate the
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.
David L. Sonderman
1979-01-01
A procedure is shown for measuring external tree characteristics that are important in determining the current and future quality of young hardwood trees. This guide supplements a precious study which describes the quality classification system for young hardwood trees
Totally optimal decision trees for Boolean functions
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.
Mapping tree density at a global scale.
Crowther, T W; Glick, H B; Covey, K R; Bettigole, C; Maynard, D S; Thomas, S M; Smith, J R; Hintler, G; Duguid, M C; Amatulli, G; Tuanmu, M-N; Jetz, W; Salas, C; Stam, C; Piotto, D; Tavani, R; Green, S; Bruce, G; Williams, S J; Wiser, S K; Huber, M O; Hengeveld, G M; Nabuurs, G-J; Tikhonova, E; Borchardt, P; Li, C-F; Powrie, L W; Fischer, M; Hemp, A; Homeier, J; Cho, P; Vibrans, A C; Umunay, P M; Piao, S L; Rowe, C W; Ashton, M S; Crane, P R; Bradford, M A
2015-09-10
The global extent and distribution of forest trees is central to our understanding of the terrestrial biosphere. We provide the first spatially continuous map of forest tree density at a global scale. This map reveals that the global number of trees is approximately 3.04 trillion, an order of magnitude higher than the previous estimate. Of these trees, approximately 1.39 trillion exist in tropical and subtropical forests, with 0.74 trillion in boreal regions and 0.61 trillion in temperate regions. Biome-level trends in tree density demonstrate the importance of climate and topography in controlling local tree densities at finer scales, as well as the overwhelming effect of humans across most of the world. Based on our projected tree densities, we estimate that over 15 billion trees are cut down each year, and the global number of trees has fallen by approximately 46% since the start of human civilization.
pinktoe: Semi-automatic Traversal of Trees
Directory of Open Access Journals (Sweden)
Guy P. Nason
2005-04-01
Full Text Available Tree based methods in S or R are extremely useful and popular. For simple trees and memorable variables it is easy to predict the outcome for a new case using only a standard decision tree diagram. However, for large trees or trees where the variable description is complex the decision tree diagram is often not enough. This article describes pinktoe: an R package containing two tools to assist with the semiautomatic traversal of trees. The PT tool creates a widget for each node to be visited in the tree that is needed to make a decision and permits the user to make decisions using radiobuttons. The pinktoe function generates a suite of HTML and Perl files that permit a CGI-enabled website to issue step-by-step questions to a user wishing to make a prediction using a tree.
Construction of an α-labeled tree from a given set of α-labeled trees
Directory of Open Access Journals (Sweden)
G. Sethuraman
2017-08-01
Full Text Available Inspired by the method of Koh et al. (1979 of combining known graceful trees to construct bigger graceful trees, a new class of graceful trees is constructed from a set of k known graceful trees, k≥2 in a specific way. In fact, each member of this new class of trees admits α-labeling, a stronger version of graceful labeling. Consequently, each member of this family of trees decomposes complete graphs and complete bipartite graphs.
DEFF Research Database (Denmark)
Martins, Bo; Forchhammer, Søren
1998-01-01
probabilities to an arithmetic coder. The conditional probabilities are estimated from co-occurrence statistics of past pixels, the statistics are stored in a tree. By organizing the code length calculations properly, a vast number of possible models (trees) reflecting different pixel orderings can...... be investigated within reasonable time prior to generating the code. A number of general-purpose coders are constructed according to this principle. Rissanen's (1989) one-pass algorithm, context, is presented in two modified versions. The baseline is proven to be a universal coder. The faster version, which...... 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...
Potential tree species for use in urban areas in temperate and oceanic climates
Directory of Open Access Journals (Sweden)
Miklas Scholz
2016-09-01
Full Text Available This study aims to assess the potential of trees for integration in urban development by evaluating the damage caused by trees in relation to various tree characteristics. Tree damage to permeable pavement systems and other urban structures such as impermeable pavements, kerbs, roads, retaining walls, footpaths, walls and buildings were assessed to identify the most suitable trees for the urban environment. One hundred square sites of 100 m × 100 m were randomly selected in Greater Manchester for this representative example case study to demonstrate the assessment methodology. Among tree species in this study, Acer platanoides L. (Norway maple occurred most frequently (17%; others were Tilia spp. L. (Lime; 16%, Fraxinus excelsior L. (common ash; 12%, Acer pseudoplatanus L. (sycamore; 10% and Prunus avium L. (wild cherry; 8%. The study concludes that 44% of the damage was to impermeable pavements and 22% to permeable pavements. Other damage to structures included kerbs (19%, retaining walls (5%, footpaths (4%, roads (3% and walls (3%. Concerning the severity of damage, 66% were moderate, 21% light and 19% severe. Aesculus hippocastanum L. (horse chestnut caused the greatest damage (59% expressed in percentage as a ratio of the tree number related to damage over the corresponding tree number that was found close to structures.
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.
Linking individual-tree and whole-stand models for forest growth and yield prediction
Directory of Open Access Journals (Sweden)
Quang V Cao
2014-10-01
Full Text Available Background Different types of growth and yield models provide essential information for making informed decisions on how to manage forests. Whole-stand models often provide well-behaved outputs at the stand level, but lack information on stand structures. Detailed information from individual-tree models and size-class models typically suffers from accumulation of errors. The disaggregation method, in assuming that predictions from a whole-stand model are reliable, partitions these outputs to individual trees. On the other hand, the combination method seeks to improve stand-level predictions from both whole-stand and individual-tree models by combining them. Methods Data from 100 plots randomly selected from the Southwide Seed Source Study of loblolly pine (Pinus taeda L. were used to evaluate the unadjusted individual-tree model against the disaggregation and combination methods. Results Compared to the whole-stand model, the combination method did not show improvements in predicting stand attributes in this study. The combination method also did not perform as well as the disaggregation method in tree-level predictions. The disaggregation method provided the best predictions of tree- and stand-level survival and growth. Conclusions The disaggregation approach provides a link between individual-tree models and whole-stand models, and should be considered as a better alternative to the unadjusted tree model.
EFFECT OF BORDERLINE TREES IN POPULATION PARAMETERS ESTIMATED BY VARIABLE SAMPLING AREA METHODS
Directory of Open Access Journals (Sweden)
Rodrigo Geroni Mendes Nascimento
2015-03-01
Full Text Available The objective of this research was to evaluate the effect of the borderline tree in the population parameters estimated by Bitterlich (1948, Prodan (1968 and Strand (1958 sampling methods. The database came from a census carried out in a fragment of Mixed Ombrophylous Montana Forest located in the Campus III, of Federal University of Parana, Curitiba-PR, Brazil. All trees with DBH ≥ 10 cm were measured, identified, georeferenced, and considered as possible plot center of the sampling units in each method. The sampling simulation was conducted with 185 randomly selected points for the estimation of N.ha-1, G.ha-1 and V.ha-1 to three different treatments: without the influence of borderline tree, count half borderline tree and count of partial borderline tree corrected by the P factor introduced by Péllico Netto (1994. Regardless of the method and the treatment used there was always an overestimation of N.ha-1. To estimate the basal area and volume per hectare, the Bitterlich method achieved the best results, followed by Strand and Prodan, respectively. Application of P factor in borderline trees did not cause a significant improvement in the population estimators compared with the estimates generated by borderline trees counted as half a tree or without its influence.
Attention trees and semantic paths
Giusti, Christian; Pieroni, Goffredo G.; Pieroni, Laura
2007-02-01
In the last few decades several techniques for image content extraction, often based on segmentation, have been proposed. It has been suggested that under the assumption of very general image content, segmentation becomes unstable and classification becomes unreliable. According to recent psychological theories, certain image regions attract the attention of human observers more than others and, generally, the image main meaning appears concentrated in those regions. Initially, regions attracting our attention are perceived as a whole and hypotheses on their content are formulated; successively the components of those regions are carefully analyzed and a more precise interpretation is reached. It is interesting to observe that an image decomposition process performed according to these psychological visual attention theories might present advantages with respect to a traditional segmentation approach. In this paper we propose an automatic procedure generating image decomposition based on the detection of visual attention regions. A new clustering algorithm taking advantage of the Delaunay- Voronoi diagrams for achieving the decomposition target is proposed. By applying that algorithm recursively, starting from the whole image, a transformation of the image into a tree of related meaningful regions is obtained (Attention Tree). Successively, a semantic interpretation of the leaf nodes is carried out by using a structure of Neural Networks (Neural Tree) assisted by a knowledge base (Ontology Net). Starting from leaf nodes, paths toward the root node across the Attention Tree are attempted. The task of the path consists in relating the semantics of each child-parent node pair and, consequently, in merging the corresponding image regions. The relationship detected in this way between two tree nodes generates, as a result, the extension of the interpreted image area through each step of the path. The construction of several Attention Trees has been performed and partial
ajansen; kwhitefoot; panteltje1; edprochak; sudhakar, the
2014-07-01
In reply to the physicsworld.com news story “How to make a quantum random-number generator from a mobile phone” (16 May, http://ow.ly/xFiYc, see also p5), which describes a way of delivering random numbers by counting the number of photons that impinge on each of the individual pixels in the camera of a Nokia N9 smartphone.
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....
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
Tree size comparison of some important street trees growing at ...
African Journals Online (AJOL)
The importance of trees in urban environment is now widely recognized as they cleanse the particulate air pollution and help to make cities and towns more agreeable places to dwell upon. A detailed survey was conducted to study the size of Alstonia scholaris, Azadirachta indica, Bombax ceiba, Cassia fistula, Eucalyptus ...
Water Transport in Trees--An Artificial Laboratory Tree
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…
SOFT TREE: Fault Tree Technique as Applied to Software. Revision.
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
DLRS: gene tree evolution in light of a species tree.
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).
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.
Directory of Open Access Journals (Sweden)
Hyontai Sug
2012-01-01
Full Text Available Random forests are known to be good for data mining of classification tasks, because random forests are robust for datasets having insufficient information possibly with some errors. But applying random forests blindly may not produce good results, and a dataset in the domain of rotogravure printing is one of such datasets. Hence, in this paper, some best classification accuracy based on clever application of random forests to predict the occurrence of cylinder bands in rotogravure printing is investigated. Since random forests could generate good results with an appropriate combination of parameters like the number of randomly selected attributes for each split and the number of trees in the forests, an effective data mining procedure considering the property of the target dataset by way of trial random forests is investigated. The effectiveness of the suggested procedure is shown by experiments with very good results.
Multivariate Exponential Survival Trees And Their Application to Tooth Prognosis
Fan, Juanjuan; Nunn, Martha E.; Su, Xiaogang
2009-01-01
SUMMARY This paper is concerned with developing rules for assignment of tooth prognosis based on actual tooth loss in the VA Dental Longitudinal Study. It is also of interest to rank the relative importance of various clinical factors for tooth loss. A multivariate survival tree procedure is proposed. The procedure is built on a parametric exponential frailty model, which leads to greater computational efficiency. We adopted the goodness-of-split pruning algorithm of LeBlanc and Crowley (1993) to determine the best tree size. In addition, the variable importance method is extended to trees grown by goodness-of-fit using an algorithm similar to the random forest procedure in Breiman (2001). Simulation studies for assessing the proposed tree and variable importance methods are presented. To limit the final number of meaningful prognostic groups, an amalgamation algorithm is employed to merge terminal nodes that are homogenous in tooth survival. The resulting prognosis rules and variable importance rankings seem to offer simple yet clear and insightful interpretations. PMID:21709804
‘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.
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
space of leaf-labeled trees. This tree-space is a geodesic metric space where any two trees are connected by a unique shortest path, which corresponds to a tree deformation. However, tree-space is not a manifold, and the usual strategy of performing statistical analysis in a tangent space and projecting...... onto tree-space is not available. Using tree-space and its shortest paths, a variety of statistical properties, such as mean, principal component, hypothesis testing and linear discriminant analysis can be defined. For some of these properties it is still an open problem how to compute them; others...... 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...
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.
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.
Enumeration of Ancestral Configurations for Matching Gene Trees and Species Trees.
Disanto, Filippo; Rosenberg, Noah A
2017-09-01
Given a gene tree and a species tree, ancestral configurations represent the combinatorially distinct sets of gene lineages that can reach a given node of the species tree. They have been introduced as a data structure for use in the recursive computation of the conditional probability under the multispecies coalescent model of a gene tree topology given a species tree, the cost of this computation being affected by the number of ancestral configurations of the gene tree in the species tree. For matching gene trees and species trees, we obtain enumerative results on ancestral configurations. We study ancestral configurations in balanced and unbalanced families of trees determined by a given seed tree, showing that for seed trees with more than one taxon, the number of ancestral configurations increases for both families exponentially in the number of taxa n. For fixed n, the maximal number of ancestral configurations tabulated at the species tree root node and the largest number of labeled histories possible for a labeled topology occur for trees with precisely the same unlabeled shape. For ancestral configurations at the root, the maximum increases with [Formula: see text], where [Formula: see text] is a quadratic recurrence constant. Under a uniform distribution over the set of labeled trees of given size, the mean number of root ancestral configurations grows with [Formula: see text] and the variance with ∼[Formula: see text]. The results provide a contribution to the combinatorial study of gene trees and species trees.
TreePOD: Sensitivity-Aware Selection of Pareto-Optimal Decision Trees.
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.
A. de Bruin (Arie); W.H.L.M. Pijls (Wim)
2003-01-01
textabstractThis paper deals with algorithms searching trees generated by two-person, zero-sum games with perfect information. The standard algorithm in this field is alpha-beta. We will discuss this algorithm as well as extensions, like transposition tables, iterative deepening and NegaScout.
storey and canopy tree species
African Journals Online (AJOL)
different tree species. The data presented here would therefore help in the planning and management of tropical forest reserves and development of management inteiventions to enhance forest productivity and ecological balance. Materials and methods. Study site. Kalinzu Forest Reserve is a tropical rain forest locate<.! in.
Protected Vertices in Motzkin trees
Van Duzer, Anthony
2017-01-01
In this paper we find recurrence relations for the asymptotic probability a vertex is $k$ protected in all Motzkin trees. We use a similar technique to calculate the probabilities for balanced vertices of rank $k$. From this we calculate upper and lower bounds for the probability a vertex is balanced and upper and lower bounds for the expected rank of balanced vertices.
Can Children Read Evolutionary Trees?
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…
Ecology: Drought and dead trees
Richard Birdsey; Yude. Pan
2011-01-01
Drought has emerged as a major threat to the world's forests. A study shows that tree mortality in Canada's boreal forests has increased by nearly 5% per yearmuch higher than expectedowing to water stress from regional warming.
Trees of Our National Forests.
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)…
Braude, Stan
2007-01-01
In this article, the author describes a short activity which introduces third- to fifth-grade students to animal classification. The Tree of Animal Life activity is a simple, sorting exercise that can help them see a bigger picture. The activity sets the stage for learning about animal taxonomy and introduces the characteristics of various animal…
Linguistics, Logic, and Finite Trees
Blackburn, P.; Meyer-Viol, W.
1993-01-01
A modal logic is developed to deal with finite ordered binary trees as they are used in (computational) linguistics. A modal language is introduced with operators for the 'mother of', 'first daughter of' and 'second daughter of' relations together with their transitive reflexive closures.
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...
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...
Purahong, Witoon; Durka, Walter; Fischer, Markus; Dommert, Sven; Schöps, Ricardo; Buscot, François; Wubet, Tesfaye
2016-11-01
Tree species identity and tree genotypes contribute to the shaping of soil microbial communities. However, knowledge about how these two factors influence soil ecosystem functions is still lacking. Furthermore, in forest ecosystems tree genotypes co-occur and interact with each other, thus the effects of tree genotypic diversity on soil ecosystem functions merit attention. Here we investigated the effects of tree species, tree genotypes and genotypic diversity levels, alongside soil physicochemical properties, on the overall and specific soil enzyme activity patterns. Our results indicate that tree species identity, tree genotypes and genotypic diversity level have significant influences on overall and specific soil enzyme activity patterns. These three factors influence soil enzyme patterns partly through effects on soil physicochemical properties and substrate quality. Variance partitioning showed that tree species identity, genotypic diversity level, pH and water content all together explained ~30% variations in the overall patterns of soil enzymes. However, we also found that the responses of soil ecosystem functions to tree genotypes and genotypic diversity are complex, being dependent on tree species identity and controlled by multiple factors. Our study highlights the important of inter- and intra-specific variations in tree species in shaping soil ecosystem functions in a subtropical forest.
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.
Felgitsch, Laura; Seifried, Teresa; Winkler, Philipp; Schmale, David, III; Grothe, Hinrich
2017-04-01
While the importance of heterogeneous ice nucleation in the atmosphere is known, we still know very little about the substances triggering these freezing events. Recent findings support the theory that biological ice nuclei (IN) exhibit the ability to play an important role in these processes. Huffman et al. (2013) showed a burst of biological IN over woodlands triggered by rain events. Birch pollen are known to release a high number of efficient IN if incubated in water (Pummer et al. 2012). Therefore birches are of interest in our research on this topic. Plants native to the timberline, such as birch trees, have to cope with very cold climatic conditions, rendering freezing avoidance impossible. These plants trigger freezing in their extracellular spaces to control the freezing process and avoid intracellular freezing, which would have lethal consequences. The plants hereby try to freeze at a temperature well above homogeneous freezing temperatures but still at temperatures low enough to not be effected by brief night frosts. To achieve this, IN are an important tool. The specific objective of our work was to study the potential sources and distribution of IN in birch trees. We collected leaves, fruit, bark, and trunk cores from a series of mature birch trees in Tyrol, Austria at different altitudes and sampling sites. We also collected samples from a birch tree in an urban park in Vienna, Austria. Our data show a sampling site dependence and the distribution of IN throughout the tree. Our data suggest that leaves, bark, and wood of birch can function as a source of IN, which are easily extracted with water. The IN are therefore not restricted to pollen. Hence, the amount of IN, which can be released from birch trees, is tremendous and has been underrated so far. Future work aims to elucidate the nature, contribution, and potential ecological roles of IN from birch trees in different habitats. Huffman, J.A., Prenni, A.J., DeMott, P.J., Pöhlker, C., Mason, R
Bayesian Evidence Framework for Decision Tree Learning
Chatpatanasiri, Ratthachat; Kijsirikul, Boonserm
2005-11-01
This work is primary interested in the problem of, given the observed data, selecting a single decision (or classification) tree. Although a single decision tree has a high risk to be overfitted, the induced tree is easily interpreted. Researchers have invented various methods such as tree pruning or tree averaging for preventing the induced tree from overfitting (and from underfitting) the data. In this paper, instead of using those conventional approaches, we apply the Bayesian evidence framework of Gull, Skilling and Mackay to a process of selecting a decision tree. We derive a formal function to measure `the fitness' for each decision tree given a set of observed data. Our method, in fact, is analogous to a well-known Bayesian model selection method for interpolating noisy continuous-value data. As in regression problems, given reasonable assumptions, this derived score function automatically quantifies the principle of Ockham's razor, and hence reasonably deals with the issue of underfitting-overfitting tradeoff.
Leader growth in Nordman fir christmas trees
DEFF Research Database (Denmark)
Christensen, Claus Jerram; Pedersen, Lars Bo
Leader Griowth in Nordman fir Christmas trees: Growth visualization and effects of fertilization, irrigation and drought......Leader Griowth in Nordman fir Christmas trees: Growth visualization and effects of fertilization, irrigation and drought...
International Tree Ring Data Bank (ITRDB)
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...
Tree rings and radiocarbon calibration
Energy Technology Data Exchange (ETDEWEB)
Barbetti, M. [University of Sydney, Sydney, NSW (Australia). NWG Macintosh Centre for Quaternary Dating
1999-11-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 refs., 1 tab., 1 fig.
Energy Technology Data Exchange (ETDEWEB)
Dotsenko, Viktor S [Landau Institute for Theoretical Physics, Russian Academy of Sciences, Moscow (Russian Federation)
2011-03-31
In the last two decades, it has been established that a single universal probability distribution function, known as the Tracy-Widom (TW) distribution, in many cases provides a macroscopic-level description of the statistical properties of microscopically different systems, including both purely mathematical ones, such as increasing subsequences in random permutations, and quite physical ones, such as directed polymers in random media or polynuclear crystal growth. In the first part of this review, we use a number of models to examine this phenomenon at a simple qualitative level and then consider the exact solution for one-dimensional directed polymers in a random environment, showing that free energy fluctuations in such a system are described by the universal TW distribution. The second part provides detailed appendix material containing the necessary mathematical background for the first part. (reviews of topical problems)
Using tree diversity to compare phylogenetic heuristics.
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.
Directory of Open Access Journals (Sweden)
Juha Hyyppa
2010-11-01
Full Text Available Climate change and rising temperatures have been observed to be related to the increase of forest insect damage in the boreal zone. The common pine sawfly (Diprion pini L. (Hymenoptera, Diprionidae is regarded as a significant threat to boreal pine forests. Defoliation by D. pini can cause severe growth loss and tree mortality in Scots pine (Pinus sylvestris L. (Pinaceae. In this study, logistic LASSO regression, Random Forest (RF and Most Similar Neighbor method (MSN were investigated for predicting the defoliation level of individual Scots pines using the features derived from airborne laser scanning (ALS data and aerial images. Classification accuracies from 83.7% (kappa 0.67 to 88.1% (kappa 0.76 were obtained depending on the method. The most accurate result was produced using RF with a combination of data from the two sensors, while the accuracies when using ALS and image features separately were 80.7% and 87.4%, respectively. Evidently, the combination of ALS and aerial images in detecting needle losses is capable of providing satisfactory estimates for individual trees.
Matula, Dominik
2013-01-01
The author summarizes some previous results concerning random triangles. He describes the Gaussian triangle and random triangles whose vertices lie in a unit n-dimensional ball, in a rectangle or in a general bounded convex set. In the second part, the author deals with an inscribed triangle in a triangle - let ABC be an equilateral triangle and let M, N, O be three points, each laying on one side of the ABC. We call MNO inscribed triangle (in an equi- laterral triangle). The median triangle ...
Mehta, Madan Lal
1990-01-01
Since the publication of Random Matrices (Academic Press, 1967) so many new results have emerged both in theory and in applications, that this edition is almost completely revised to reflect the developments. For example, the theory of matrices with quaternion elements was developed to compute certain multiple integrals, and the inverse scattering theory was used to derive asymptotic results. The discovery of Selberg's 1944 paper on a multiple integral also gave rise to hundreds of recent publications. This book presents a coherent and detailed analytical treatment of random matrices, leading
Universal scaling in the branching of the tree of life.
Directory of Open Access Journals (Sweden)
E Alejandro Herrada
Full Text Available Understanding the patterns and processes of diversification of life in the planet is a key challenge of science. The Tree of Life represents such diversification processes through the evolutionary relationships among the different taxa, and can be extended down to intra-specific relationships. Here we examine the topological properties of a large set of interspecific and intraspecific phylogenies and show that the branching patterns follow allometric rules conserved across the different levels in the Tree of Life, all significantly departing from those expected from the standard null models. The finding of non-random universal patterns of phylogenetic differentiation suggests that similar evolutionary forces drive diversification across the broad range of scales, from macro-evolutionary to micro-evolutionary processes, shaping the diversity of life on the planet.
TreeDyn: towards dynamic graphics and annotations for analyses of trees
Directory of Open Access Journals (Sweden)
Christen Richard
2006-10-01
Full Text Available Abstract Background Analyses of biomolecules for biodiversity, phylogeny or structure/function studies often use graphical tree representations. Many powerful tree editors are now available, but existing tree visualization tools make little use of meta-information related to the entities under study such as taxonomic descriptions or gene functions that can hardly be encoded within the tree itself (if using popular tree formats. Consequently, a tedious manual analysis and post-processing of the tree graphics are required if one needs to use external information for displaying or investigating trees. Results We have developed TreeDyn, a tool using annotations and dynamic graphical methods for editing and analyzing multiple trees. The main features of TreeDyn are 1 the management of multiple windows and multiple trees per window, 2 the export of graphics to several standard file formats with or without HTML encapsulation and a new format called TGF, which enables saving and restoring graphical analysis, 3 the projection of texts or symbols facing leaf labels or linked to nodes, through manual pasting or by using annotation files, 4 the highlight of graphical elements after querying leaf labels (or annotations or by selection of graphical elements and information extraction, 5 the highlight of targeted trees according to a source tree browsed by the user, 6 powerful scripts for automating repetitive graphical tasks, 7 a command line interpreter enabling the use of TreeDyn through CGI scripts for online building of trees, 8 the inclusion of a library of packages dedicated to specific research fields involving trees. Conclusion TreeDyn is a tree visualization and annotation tool which includes tools for tree manipulation and annotation and uses meta-information through dynamic graphical operators or scripting to help analyses and annotations of single trees or tree collections.
TreeDyn: towards dynamic graphics and annotations for analyses of trees.
Chevenet, François; Brun, Christine; Bañuls, Anne-Laure; Jacq, Bernard; Christen, Richard
2006-10-10
Analyses of biomolecules for biodiversity, phylogeny or structure/function studies often use graphical tree representations. Many powerful tree editors are now available, but existing tree visualization tools make little use of meta-information related to the entities under study such as taxonomic descriptions or gene functions that can hardly be encoded within the tree itself (if using popular tree formats). Consequently, a tedious manual analysis and post-processing of the tree graphics are required if one needs to use external information for displaying or investigating trees. We have developed TreeDyn, a tool using annotations and dynamic graphical methods for editing and analyzing multiple trees. The main features of TreeDyn are 1) the management of multiple windows and multiple trees per window, 2) the export of graphics to several standard file formats with or without HTML encapsulation and a new format called TGF, which enables saving and restoring graphical analysis, 3) the projection of texts or symbols facing leaf labels or linked to nodes, through manual pasting or by using annotation files, 4) the highlight of graphical elements after querying leaf labels (or annotations) or by selection of graphical elements and information extraction, 5) the highlight of targeted trees according to a source tree browsed by the user, 6) powerful scripts for automating repetitive graphical tasks, 7) a command line interpreter enabling the use of TreeDyn through CGI scripts for online building of trees, 8) the inclusion of a library of packages dedicated to specific research fields involving trees. TreeDyn is a tree visualization and annotation tool which includes tools for tree manipulation and annotation and uses meta-information through dynamic graphical operators or scripting to help analyses and annotations of single trees or tree collections.
ORIGINAL ARTICLE Shade Tree Selection and Management ...
African Journals Online (AJOL)
wonde
Abstract. There is a traditional practice of forest management in coffee producing communities in. Ethiopian moist Afromontane forests to increase coffee production. The practice involves removal of big canopy trees with excessive shade and selectively retaining specific tree species as preferred shade trees. This study was ...
Street tree structural differences and associated stormwater ...
Green infrastructure approaches leverage vegetation and soil to improve environmental quality. Municipal street trees are crucial components of urban green infrastructure because they provide stormwater interception benefits and other ecosystem services. Thus, it is important to understand the patterns and drivers of structural heterogeneity in urban street tree assemblages. In this study, we compared the forest structure of street trees across nine communities along both geographic and demographic gradients in metropolitan Cincinnati, Ohio, USA. Specifically, we used a two-part statistical model to compare both the proportion of sampled street segments containing zero trees, and basal area magnitude for street segments with trees. We made community-scale comparisons based on street tree management, socioeconomics, and geographic setting. Then, using modeled stormwater interception estimates from i-Tree Streets, we investigated the implications of heterogeneity in street tree assemblages for stormwater interception benefits. The forest structure of street trees varied across communities in relation to management practices, namely participation in the Tree City USA program. As a consequence of this structural difference, we observed a stark discrepancy in estimated stormwater interception between Tree City USA participants (128.7 m3/km street length) and non-participants (59.2 m3/km street length). While street tree assemblages did not vary by community poverty s
A practical alternative to single tree selection?
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...
Andrea C. Anulewicz; Deborah G. McCullough; Therese M. Poland; David Cappaert
2008-01-01
To date, use of girdled trap trees remain the most effective method employed by regulatory and resource management agencies for detecting low-density populations of emerald ash borer (EAB), Agrilus planipennis Fairmaire. Locating suitable trees can be difficult, and felling and debarking trap trees is expensive. Alternative options for EAB detection...
Sampling the quality of hardwood trees
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.
A composition theorem for decision tree complexity
Montanaro, Ashley
2013-01-01
We completely characterise the complexity in the decision tree model of computing composite relations of the form h = g(f^1,...,f^n), where each relation f^i is boolean-valued. Immediate corollaries include a direct sum theorem for decision tree complexity and a tight characterisation of the decision tree complexity of iterated boolean functions.
Mapping tree density at a global scale
Crowther, T.W.; Glick, H.B.; Covey, K.R.; Bettigole, C.; Maynard, D.S.; Thomas, S.M.; Smith, J.R.; Hintler, G.; Duguid, M.C.; Amatulli, G.; Hengeveld, G.M.; Nabuurs, G.J.
2015-01-01
The global extent and distribution of forest trees is central to our understanding of the terrestrial biosphere. We provide the first spatially continuous map of forest tree density at a global scale. This map reveals that the global number of trees is approximately 3.04 trillion, an order of
Induced chemical defences in Colophospermum mopane trees ...
African Journals Online (AJOL)
Induced chemical defences in Colophospermum mopane trees. DCJ Wessels, C van der Waal, WF de Boer. Abstract. A field experiment was conducted in which Mopane (Colophospermum mopane) trees were subjected to three different canopy treatments:felling of trees at a mean height of 0.7m above ground level, felling ...
The smallest Randic index for trees
Indian Academy of Sciences (India)
all edges uv of a graph G, where α is a real number and d(u) is the degree of the vertex u of G. In this paper, for any real number α = 0, the first three minimum general. Randic indices among trees are determined, and the corresponding extremal trees are characterized. Keywords. Extremal graph; tree; the general Randic ...
QDist—Quartet Distance Between Evolutionary Trees
DEFF Research Database (Denmark)
Mailund; Pedersen, Christian N. Storm
2004-01-01
QDist is a program for computing the quartet distance between two unrooted evolutionary trees, i.e. the number of quartet topology differences between the two trees, where a quartet topology is the topological subtree induced by four species. The implementation is based on an algorithm with running...... time O(n log² n), which makes it practical to compare large trees....
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...
Speeding Up Neighbour-Joining Tree Construction
DEFF Research Database (Denmark)
Brodal, Gerth Stølting; Fagerberg, Rolf; Mailund, Thomas
A widely used method for constructing phylogenetic trees is the neighbour-joining method of Saitou and Nei. We develope heuristics for speeding up the neighbour-joining method which generate the same phylogenetic trees as the original method. All heuristics are based on using a quad-tree to guide...
Maintaining Contour Trees of Dynamic Terrains
DEFF Research Database (Denmark)
Agarwal, Pankaj K.; Mølhave, Thomas; Revsbæk, Morten
2015-01-01
We study the problem of maintaining the contour tree T of a terrain Sigma, represented as a triangulated xy-monotone surface, as the heights of its vertices vary continuously with time. We characterize the combinatorial changes in T and how they relate to topological changes in Sigma. We present...... an augmented contour tree and a join/split tree....
National Tree Climbing Guide [2015 Electronic Edition
Jerry Berdeen; Burnham Chamberlain; Teryl Grubb; Art Henderson; Brock Mayo; Manfred Mielke; Kathryn Purcell; Dennis Ringnes; Marc Roberts; Donna Stubbs; Micah Thorning
2015-01-01
The Forest Service Tree Climbing Program provides direction that protects Forest Service employees while ascending, descending, and working aloft in trees by establishing national direction based on recognized industry standards, procedures and practices. Climbing and working in trees demands specialized equipment and skills. The potential for a serious injury or fatal...
Design of data structures for mergeable trees
DEFF Research Database (Denmark)
Georgiadis, Loukas; Tarjan, Robert Endre; Werneck, Renato Fonseca F.
2006-01-01
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation that merges two tree paths. In contrast to the standard problem, in which only one tree arc at a time changes, a sing...
Tree biomass in the North Central Region.
Gerhard K. Raile; Pamela J. Jakes
1982-01-01
Methods for calculating tree biomass are outlined, and the biomass on commercial forest land is estimated for 11 north-central states. Tree biomass in the North Central Region totals 3.6 billion tons, or 50 tons per commercial forest acre. For all species, total tree biomass is concentrated in growing-stock boles.
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
Per tree estimates with n-tree distance sampling: an application to increment core data
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...
Monitoring Million Trees LA: Tree performance during the early years and future benefits
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....
Random Response Forest for Privacy-Preserving Classification
Directory of Open Access Journals (Sweden)
Gábor Szűcs
2013-01-01
Full Text Available The paper deals with classification in privacy-preserving data mining. An algorithm, the Random Response Forest, is introduced constructing many binary decision trees, as an extension of Random Forest for privacy-preserving problems. Random Response Forest uses the Random Response idea among the anonymization methods, which instead of generalization keeps the original data, but mixes them. An anonymity metric is defined for undistinguishability of two mixed sets of data. This metric, the binary anonymity, is investigated and taken into consideration for optimal coding of the binary variables. The accuracy of Random Response Forest is presented at the end of the paper.
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.
Household Tree Planting in Tigrai, Northern Ethiopia: Tree Species, Purposes, and Determinants
Gebreegziabher, Zenebe; Mekonnen, Alemu; Kassie, Menale; Köhlin, Gunnar
2010-01-01
Trees have multiple purposes in rural Ethiopia, providing significant economic and ecological benefits. Planting trees supplies rural households with wood products for their own consumption, as well for sale, and decreases soil degradation. We used cross-sectional household-level data to analyze the determinants of household tree planting and explored the most important tree attributes or purpose(s) that enhance the propensity to plant trees. We set up a sample selection framework that simult...
Bothe, Oliver
2012-01-01
The ambiguity of temperature reconstructions is assessed using pseudo tree growth series in the virtual reality of two simulations of the climate of the last millennium. The simple, process-based Vaganov-Shashkin-Lite (VS-Lite) code calculates tree growth responses controlled by a limited number of climatic parameters. Growth limitation by different ambient climate conditions allows for possible nonlinearity and non-stationarity in the pseudo tree growth series. Statistical reconstructions of temperature are achieved from simulated tree growth for random selections of pseudo-proxy locations by simple local regression and composite plus scaling techniques to address additional ambiguities in paleoclimate reconstructions besides the known uncertainty and shortcomings of the reconstruction methods. A systematic empirical evaluation shows that the interrelations between simulated target and reconstructed temperatures undergo strong variations with possibly pronounced misrepresentations of temperatures. Thus (i) c...
Numerical study of a cylinder model of the diffusion MRI signal for neuronal dendrite trees
Van Nguyen, Dang; Grebenkov, Denis; Le Bihan, Denis; Li, Jing-Rebecca
2015-03-01
We study numerically how the neuronal dendrite tree structure can affect the diffusion magnetic resonance imaging (dMRI) signal in brain tissue. For a large set of randomly generated dendrite trees, synthetic dMRI signals are computed and fitted to a cylinder model to estimate the effective longitudinal diffusivity DL in the direction of neurites. When the dendrite branches are short compared to the diffusion length, DL depends significantly on the ratio between the average branch length and the diffusion length. In turn, DL has very weak dependence on the distribution of branch lengths and orientations of a dendrite tree, and the number of branches per node. We conclude that the cylinder model which ignores the connectivity of the dendrite tree, can still be adapted to describe the apparent diffusion coefficient in brain tissue.
[Phenology of the tree Sideroxylon capiri (Sapotaceae) at the tropical dry forest in Costa Rica].
Garcia, Elmer G; Di Stefano, José F
2005-01-01
From March 1996 until February 2000, an study about the phenology of the Tempisque tree [Sideroxylon capiri (A.DC.) Pittier] was made in the Tropical Dry Forest of the Barra Honda National Park (Costa Rica). Ten trees were chosen at random and their phenology was evaluated monthly during the first two years and every two months afterwards. Climatological data were also collected in situ. Trees change their foliage each year during the rainy season or at the beginning of the dry season. In contrast with other native species in forest, soil water deficit is not responsible for foliage change in S. capiri. Some elements that affect the process are photoperiod and herbivores. Unknown physiological mechanisms allow the tree to maintain foliage during the driest months (March and April). Flowering and fruiting may occur every year and in any season, but mostly in the dry season, with variability both among seasons and among individuals.
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...
Groups, graphs and random walks
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...
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.
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.
Hendricks, Katherine E; Christman, Mary; Roberts, Pamela D
2017-05-09
Citrus black spot (CBS) caused by Phyllosticta citricarpa, is the most recent introduction of an exotic citrus pathogen into Florida and has been a challenge to control to date. Understanding the dispersal pattern of the disease within affected groves is vital in developing effective control strategies to limit the spread of the disease. The spatial pattern of CBS-affected trees was studied in two commercial 'Valencia' orange groves over three consecutive citrus seasons. Cluster analyses based on nearest-neighbor distance (F, G and J-functions) and pairwise distances between points (Ripley's K function, Besag's L function and the pair correlation function, g) were used to test the hypothesis of complete spatial randomness (CSR) of CBS infected trees within the groves. In both groves, the hypothesis of CSR was rejected for all tests performed including quadrats testing (2 × 2 trees up to 10 × 10 trees). The relationship between tree age and disease was assessed at one experimental site. Citrus trees bearing fruit for the first time accounted for approximately 13% of trees positive for disease and were located within areas of heavy disease pressure. These findings support short distance movement of inoculum as the main spread of disease in the groves studied.
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.
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...
DEFF Research Database (Denmark)
Andersen, Esben Sloth
2002-01-01
. 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......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...... and their knowledge bases. The paper is inspired by molecular biology, where phylogenies of biological life are reconstructed by means of extremely rich genomic data and powerful computer algorithms. The paper suggests that input-output data can be used as a first source of reconstructing industrial systematics...
Tree structure-based bit-to-symbol mapping for multidimensional modulation format
Zhaoxi, Li; Yujuan, Si; Guijun, Hu
2017-06-01
Bit-to-symbol mapping is one of the key issues in multidimensional modulation. In an effort to resolve this issue, a tree structure based bit-to-symbol mapping scheme is proposed. By constructing a tree structure of constellation points, any neighboring constellation points become nearest-neighbor constellation points with minimum Euclidean distance, which in turn, changes the bit-to-symbol mapping problem in multidimensional signal modulation from random to orderly. Then, through the orderly distribution of labels, the minimum Hamming distance between the nearest neighboring constellation points is ensured, eventually achieving bit-to-symbol mapping optimization for multidimensional signals. Simulation analysis indicates that, compared with random search mapping, tree mapping can effectively improve the bit error rate performance of multidimensional signal modulation without multiple searching, reducing the computational cost.
Galtier, J; Hueber, F M
2001-01-01
A new anatomically preserved fern, discovered from the basalmost Carboniferous of Australia, shows a unique combination of very primitive anatomical characters (solid centrarch cauline protostele) with the elaboration of an original model of the arborescent habit. This plant possessed a false trunk composed of a repetitive branching system of very small stems, which established it as the oldest tree-fern known to date. The potential of this primitive zygopterid fern to produce such an unusual...
Anatomical modeling of the bronchial tree
Hentschel, Gerrit; Klinder, Tobias; Blaffert, Thomas; Bülow, Thomas; Wiemker, Rafael; Lorenz, Cristian
2010-02-01
The bronchial tree is of direct clinical importance in the context of respective diseases, such as chronic obstructive pulmonary disease (COPD). It furthermore constitutes a reference structure for object localization in the lungs and it finally provides access to lung tissue in, e.g., bronchoscope based procedures for diagnosis and therapy. This paper presents a comprehensive anatomical model for the bronchial tree, including statistics of position, relative and absolute orientation, length, and radius of 34 bronchial segments, going beyond previously published results. The model has been built from 16 manually annotated CT scans, covering several branching variants. The model is represented as a centerline/tree structure but can also be converted in a surface representation. Possible model applications are either to anatomically label extracted bronchial trees or to improve the tree extraction itself by identifying missing segments or sub-trees, e.g., if located beyond a bronchial stenosis. Bronchial tree labeling is achieved using a naïve Bayesian classifier based on the segment properties contained in the model in combination with tree matching. The tree matching step makes use of branching variations covered by the model. An evaluation of the model has been performed in a leaveone- out manner. In total, 87% of the branches resulting from preceding airway tree segmentation could be correctly labeled. The individualized model enables the detection of missing branches, allowing a targeted search, e.g., a local rerun of the tree-segmentation segmentation.
Meta-learning in decision tree induction
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...
The Shapley Value of Phylogenetic Trees
Haake, Claus-Jochen; Su, Francis Edward
2007-01-01
Every weighted tree corresponds naturally to a cooperative game that we call a "tree game"; it assigns to each subset of leaves the sum of the weights of the minimal subtree spanned by those leaves. In the context of phylogenetic trees, the leaves are species and this assignment captures the diversity present in the coalition of species considered. We consider the Shapley value of tree games and suggest a biological interpretation. We determine the linear transformation M that shows the dependence of the Shapley value on the edge weights of the tree, and we also compute a null space basis of M. Both depend on the "split counts" of the tree. Finally, we characterize the Shapley value on tree games by four axioms, a counterpart to Shapley's original theorem on the larger class of cooperative games.
On finding minimum-diameter clique trees
Energy Technology Data Exchange (ETDEWEB)
Blair, J.R.S. (Tennessee Univ., Knoxville, TN (United States). Dept. of Computer Science); Peyton, B.W. (Oak Ridge National Lab., TN (United States))
1991-08-01
It is well-known that any chordal graph can be represented as a clique tree (acyclic hypergraph, join tree). Since some chordal graphs have many distinct clique tree representations, it is interesting to consider which one is most desirable under various circumstances. A clique tree of minimum diameter (or height) is sometimes a natural candidate when choosing clique trees to be processed in a parallel computing environment. This paper introduces a linear time algorithm for computing a minimum-diameter clique tree. The new algorithm is an analogue of the natural greedy algorithm for rooting an ordinary tree in order to minimize its height. It has potential application in the development of parallel algorithms for both knowledge-based systems and the solution of sparse linear systems of equations. 31 refs., 7 figs.
Tree climbing and human evolution
Venkataraman, Vivek V.; Kraft, Thomas S.; Dominy, Nathaniel J.
2013-01-01
Paleoanthropologists have long argued—often contentiously—about the climbing abilities of early hominins and whether a foot adapted to terrestrial bipedalism constrained regular access to trees. However, some modern humans climb tall trees routinely in pursuit of honey, fruit, and game, often without the aid of tools or support systems. Mortality and morbidity associated with facultative arboreality is expected to favor behaviors and anatomies that facilitate safe and efficient climbing. Here we show that Twa hunter–gatherers use extraordinary ankle dorsiflexion (>45°) during climbing, similar to the degree observed in wild chimpanzees. Although we did not detect a skeletal signature of dorsiflexion in museum specimens of climbing hunter–gatherers from the Ituri forest, we did find that climbing by the Twa is associated with longer fibers in the gastrocnemius muscle relative to those of neighboring, nonclimbing agriculturalists. This result suggests that a more excursive calf muscle facilitates climbing with a bipedally adapted ankle and foot by positioning the climber closer to the tree, and it might be among the mechanisms that allow hunter–gatherers to access the canopy safely. Given that we did not find a skeletal correlate for this observed behavior, our results imply that derived aspects of the hominin ankle associated with bipedalism remain compatible with vertical climbing and arboreal resource acquisition. Our findings challenge the persistent arboreal–terrestrial dichotomy that has informed behavioral reconstructions of fossil hominins and highlight the value of using modern humans as models for inferring the limits of hominin arboreality. PMID:23277565
Tree-Species Classification in Subtropical Forests Using Airborne Hyperspectral and LiDAR Data
Directory of Open Access Journals (Sweden)
Xin Shen
2017-11-01
Full Text Available Accurate classification of tree-species is essential for sustainably managing forest resources and effectively monitoring species diversity. In this study, we used simultaneously acquired hyperspectral and LiDAR data from LiCHy (Hyperspectral, LiDAR and CCD airborne system to classify tree-species in subtropical forests of southeast China. First, each individual tree crown was extracted using the LiDAR data by a point cloud segmentation algorithm (PCS and the sunlit portion of each crown was selected using the hyperspectral data. Second, different suites of hyperspectral and LiDAR metrics were extracted and selected by the indices of Principal Component Analysis (PCA and the mean decrease in Gini index (MDG from Random Forest (RF. Finally, both hyperspectral metrics (based on whole crown and sunlit crown and LiDAR metrics were assessed and used as inputs to Random Forest classifier to discriminate five tree-species at two levels of classification. The results showed that the tree delineation approach (point cloud segmentation algorithm was suitable for detecting individual tree in this study (overall accuracy = 82.9%. The classification approach provided a relatively high accuracy (overall accuracy > 85.4% for classifying five tree-species in the study site. The classification using both hyperspectral and LiDAR metrics resulted in higher accuracies than only hyperspectral metrics (the improvement of overall accuracies = 0.4–5.6%. In addition, compared with the classification using whole crown metrics (overall accuracies = 85.4–89.3%, using sunlit crown metrics (overall accuracies = 87.1–91.5% improved the overall accuracies of 2.3%. The results also suggested that fewer of the most important metrics can be used to classify tree-species effectively (overall accuracies = 85.8–91.0%.
Tree height-diameter and yield functions for Gmelina arborea (roxb ...
African Journals Online (AJOL)
This study involved developments of models for predicting tree heights and stem volumes for Gmelina arborea stand at Edondon plantation in Obubra Local Government Area (LGA) of Cross Rivers State in southern Nigeria. Simple random sampling technique was adopted for plot location. Forty (40) 25 m × 25 m (0.16ha) ...
Residual stand damage from crop tree release felling operations in white oak stands
Jeffrey W. Stringer; Gary W. Miller; H. Clay Smith
1988-01-01
This study was conducted at the University of Kentucky's Robinson Forest located in Breathitt, Knott, and Perry counties in eastern Kentucky. Three treatments including two levels of croptree release, leaving 20 and 34 crop trees per acre, and a control treatment were replicated 4 times and randomly distributed among l.2 white oak (Quercus alba...
Nursery growth and biomass of the seedlings of nine tree species ...
African Journals Online (AJOL)
Four types of potting media, three of them mixed from different proportions (farm yard manure, forest soil, sand), and the local soil were compared. A factorial experiment was laid out in Randomized Complete Block Design. ANOVA on growth and biomass data were performed for nine tree species using the GLM procedure ...
Mineralization and N-use efficiency of tree legume prunings from ...
African Journals Online (AJOL)
The treatment combinations were laid out as a randomized complete blocks design. Mixtures of tree prunings with 2.5 t ha-1 maize stover increased maize N uptake and grain yield whereas 5 t ha-1 maize stover reduced maize N uptake and grain yield during the wetter season. Mixtures of Pea-R, Stover-1 or Stover-2 with ...
From transience to recurrence with Poisson tree frogs
Hoffman, Christopher; Johnson, Tobias; Junge, Matthew
2016-01-01
Consider the following interacting particle system on the $d$-ary tree, known as the frog model: Initially, one particle is awake at the root and i.i.d. Poisson many particles are sleeping at every other vertex. Particles that are awake perform simple random walks, awakening any sleeping particles they encounter. We prove that there is a phase transition between transience and recurrence as the initial density of particles increases, and we give the order of the transition up to a logarithmic...
Inferring rooted species trees from unrooted gene trees using approximate Bayesian computation.
Alanzi, Ayed R A; Degnan, James H
2017-11-01
Methods for inferring species trees from gene trees motivated by incomplete lineage sorting typically use either rooted gene trees to infer a rooted species tree, or use unrooted gene trees to infer an unrooted species tree, which is then typically rooted using one or more outgroups. Theoretically, however, it has been known since 2011 that it is possible to consistently infer the root of the species tree directly from unrooted gene trees without assuming an outgroup. Here, we use approximate Bayesian computation to infer the root of the species tree from unrooted gene trees assuming the multispecies coalescent model. It is hoped that this approach will be useful in cases where an appropriate outgroup is difficult to find and gene trees do not follow a molecular clock. We use approximate Bayesian computation to infer the root of the species tree from unrooted gene trees. This approach could also be useful when there is prior information that makes a small number of root locations plausible in an unrooted species tree. Copyright © 2017 Elsevier Inc. All rights reserved.
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.
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
Who Died, Where? Quantification of Drought-Induced Tree Mortality in Texas
Schwantes, A.; Swenson, J. J.; Johnson, D. M.; Domec, J. C.; Jackson, R. B.
2014-12-01
During 2011, Texas experienced a severe drought that killed millions of trees across the state. Drought-induced tree mortality can have significant ecological impacts and is expected to increase with climate change. We identify methods to quantify tree mortality in central Texas by using remotely sensed images before and after the drought at multiple spatial resolutions. Fine-scale tree mortality maps were created by classifying 1-m orthophotos from the National Agriculture Imagery Program. These classifications showed a high correlation with field estimates of percent canopy loss (RMSE = 2%; R2=0.9), and were thus used to calibrate coarser scale 30-m Landsat imagery. Random Forest, a machine learning method, was applied to obtain sub-pixel estimates of tree mortality. Traditional per-pixel classification techniques can map mortality of whole stands of trees (e.g. fire). However, these methods are often inadequate in detecting subtle changes in land cover, such as those associated with drought-induced tree mortality, which is often a widespread but scattered disturbance. Our method is unique, because it is capable of mapping death of individual canopies within a pixel. These 30-m tree mortality maps were then used to identify ecological systems most impacted by the drought and edaphic factors that control spatial distributions of tree mortality across central Texas. Ground observations coupled with our remote sensing analyses revealed that the majority of the mortality was Juniperus ashei. From a physiological standpoint this is surprising, because J. ashei is a drought-resistant tree. However, over the last century, this species has recently encroached into many areas previously dominated by grassland. Also, J. ashei tends to occupy landscape positions with lower available water storage, which could explain its high mortality rate. Predominantly tree mortality occurred in dry landscape positions (e.g. areas dominated by shallow soils, a low compound topographic
Cubic time algorithms of amalgamating gene trees and building evolutionary scenarios
2012-01-01
Background A long recognized problem is the inference of the supertree S that amalgamates a given set {Gj} of trees Gj, with leaves in each Gj being assigned homologous elements. We ground on an approach to find the tree S by minimizing the total cost of mappings αj of individual gene trees Gj into S. Traditionally, this cost is defined basically as a sum of duplications and gaps in each αj. The classical problem is to minimize the total cost, where S runs over the set of all trees that contain an exhaustive non-redundant set of species from all input Gj. Results We suggest a reformulation of the classical NP-hard problem of building a supertree in terms of the global minimization of the same cost functional but only over species trees S that consist of clades belonging to a fixed set P (e.g., an exhaustive set of clades in all Gj). We developed a deterministic solving algorithm with a low degree polynomial (typically cubic) time complexity with respect to the size of input data. We define an extensive set of elementary evolutionary events and suggest an original definition of mapping β of tree G into tree S. We introduce the cost functional c(G, S, f ) and define the mapping β as the global minimum of this functional with respect to the variable f, in which sense it is a generalization of classical mapping α. We suggest a reformulation of the classical NP-hard mapping (reconciliation) problem by introducing time slices into the species tree S and present a cubic time solving algorithm to compute the mapping β. We introduce two novel definitions of the evolutionary scenario based on mapping β or a random process of gene evolution along a species tree. Conclusions Developed algorithms are mathematically proved, which justifies the following statements. The supertree building algorithm finds exactly the global minimum of the total cost if only gene duplications and losses are allowed and the given sets of gene trees satisfies a certain condition. The mapping
Breakpoint Distance and PQ-Trees
Jiang, Haitao; Chauve, Cedric; Zhu, Binhai
The PQ-tree is a fundamental data structure that can encode large sets of permutations. It has recently been used in comparative genomics to model ancestral genomes with some uncertainty: given a phylogeny for some species, extant genomes are represented by permutations on the leaves of the tree, and each internal node in the phylogenetic tree represents an extinct ancestral genome, represented by a PQ-tree. An open problem related to this approach is then to quantify the evolution between genomes represented by PQ-trees. In this paper we present results for two problems of PQ-tree comparison motivated by this application. First, we show that the problem of comparing two PQ-trees by computing the minimum breakpoint distance among all pairs of permutations generated respectively by the two considered PQ-trees is NP-complete for unsigned permutations. Next, we consider a generalization of the classical Breakpoint Median problem, where an ancestral genome is represented by a PQ-tree and p permutations are given, with p ≥ 1, and we want to compute a permutation generated by the PQ-tree that minimizes the sum of the breakpoint distances to the p permutations. We show that this problem is Fixed-Parameter Tractable with respect to the breakpoint distance value. This last result applies both on signed and unsigned permutations, and to uni-chromosomal and multi-chromosomal permutations.
Random walks in a random environment
Indian Academy of Sciences (India)
R. Narasimhan (Krishtel eMaging) 1461 1996 Oct 15 13:05:22
Abstract. Random walks as well as diffusions in random media are considered. Methods are developed that allow one to establish large deviation results for both the 'quenched' and the 'averaged' case. Keywords. Large deviations; random walks in a random environment. 1. Introduction. A random walk on Zd is a stochastic ...
The dynamics of strangling among forest trees.
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
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.
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.
Rupp, Nichole A
2017-01-01
The novel portion of this project, Life in a Pear Tree, is a fictional autobiography that tells the story of the American author’s short time managing a London pub. To assist in understanding the experience, a fairy tale story is woven through the real life events, inviting the reader to question truth and fact, fantasy and reality. Chapter one of the accompanying critical portion provides a background of fairy tale stories and the issues with defining the term. It also introduces P.L. Traver...
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....
VC-dimension of univariate decision trees.
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.
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....... Conclusions: Our geographical coverage analysis shows that a wealth of easily accessible data exist on tree species occurrences worldwide, but regional gaps and coordinate errors are abundant. Thus, assessment of tree distributions will need accurate occurrence quality control protocols and key collaborations......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...
Random functions and turbulence
Panchev, S
1971-01-01
International Series of Monographs in Natural Philosophy, Volume 32: Random Functions and Turbulence focuses on the use of random functions as mathematical methods. The manuscript first offers information on the elements of the theory of random functions. Topics include determination of statistical moments by characteristic functions; functional transformations of random variables; multidimensional random variables with spherical symmetry; and random variables and distribution functions. The book then discusses random processes and random fields, including stationarity and ergodicity of random
Representing Autonomous Systems Self-Confidence through Competency Boundaries
2015-01-01
probabilistic road mapping and rapidly exploring random trees ( RRT )) are investigated for scenarios that could result in mission failure due to incomplete... RRT ). For RRTs , random nodes are generated and a branch is formed from the nearest node already on the tree and extends out towards the new random...node. The algorithm builds local paths from the new branches until a global solution is found. RRT * is an extension of RRT that continuously
On the structure of path-like trees
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.
DART: Dropouts meet Multiple Additive Regression Trees
Rashmi, K. V.; Gilad-Bachrach, Ran
2015-01-01
Multiple Additive Regression Trees (MART), an ensemble model of boosted regression trees, is known to deliver high prediction accuracy for diverse tasks, and it is widely used in practice. However, it suffers an issue which we call over-specialization, wherein trees added at later iterations tend to impact the prediction of only a few instances, and make negligible contribution towards the remaining instances. This negatively affects the performance of the model on unseen data, and also makes...
Multicast Tree Construction in Directed Networks
1996-01-01
an architecture for scalable interdomain multicast routing", in ACM SIGCOMM, September 1993 [2] B. Cain, S. Deering, and A. Thyagarajan, Internet ... internet There are two basic approaches to multicast tree construction. The first is a shared multicast tree [1] and the other is a source rooted tree... Internet Working Group, November 1988. [14] B. Waxman, "Routing of Multipoint Connections, " IEEE Selected Areas in Communications, December 1988.
Global situation for organic tree fruits
Granatstein, David; Kirby, Elisabeth; Ostenson, Harold; Willer, Helga
2016-01-01
Consumer demand for organic tree fruit products in Europe and North America, the dominant organic food markets, has spurred increases in organic area and production globally. From 2008–2013, the area of production grew 109%, 42%, and 53% for organic temperate tree fruits, citrus, and tropical/subtropical fruits, respectively, with much lower growth for total area (non-organic plus organic) in these categories. Most organic tree fruits represent approximately 1–2% of total production area for ...
Southern Pine Beetle Population Dynamics in Trees
Fred M. Stephen
2011-01-01
Successful mass attack of a pine tree by the southern pine beetle (SPB) results in the treeâs death and provides opportunity for colonization of the new phloem resource and reproduction by a new generation of SPBs plus hundreds of associated species of insects, mites, fungi, and nematodes. The within-tree portions of the SPB life history can be divided into component...
Sargsyan, Ori
2010-08-01
The general coalescent tree framework is a family of models for determining ancestries among random samples of DNA sequences at a nonrecombining locus. The ancestral models included in this framework can be derived under various evolutionary scenarios. Here, a computationally tractable full-likelihood-based inference method for neutral polymorphisms is presented, using the general coalescent tree framework and the infinite-sites model for mutations in DNA sequences. First, an exact sampling scheme is developed to determine the topologies of conditional ancestral trees. However, this scheme has some computational limitations and to overcome these limitations a second scheme based on importance sampling is provided. Next, these schemes are combined with Monte Carlo integrations to estimate the likelihood of full polymorphism data, the ages of mutations in the sample, and the time of the most recent common ancestor. In addition, this article shows how to apply this method for estimating the likelihood of neutral polymorphism data in a sample of DNA sequences completely linked to a mutant allele of interest. This method is illustrated using the data in a sample of DNA sequences at the APOE gene locus.
Combinatorics of distance-based tree inference.
Pardi, Fabio; Gascuel, Olivier
2012-10-09
Several popular methods for phylogenetic inference (or hierarchical clustering) are based on a matrix of pairwise distances between taxa (or any kind of objects): The objective is to construct a tree with branch lengths so that the distances between the leaves in that tree are as close as possible to the input distances. If we hold the structure (topology) of the tree fixed, in some relevant cases (e.g., ordinary least squares) the optimal values for the branch lengths can be expressed using simple combinatorial formulae. Here we define a general form for these formulae and show that they all have two desirable properties: First, the common tree reconstruction approaches (least squares, minimum evolution), when used in combination with these formulae, are guaranteed to infer the correct tree when given enough data (consistency); second, the branch lengths of all the simple (nearest neighbor interchange) rearrangements of a tree can be calculated, optimally, in quadratic time in the size of the tree, thus allowing the efficient application of hill climbing heuristics. The study presented here is a continuation of that by Mihaescu and Pachter on branch length estimation [Mihaescu R, Pachter L (2008) Proc Natl Acad Sci USA 105:13206-13211]. The focus here is on the inference of the tree itself and on providing a basis for novel algorithms to reconstruct trees from distances.
Morocco - Fruit Tree Productivity, Extension Component
Millennium Challenge Corporation — The emphasis of this performance evaluation is primarily on the economic and financial assessment of one specific activity of the Fruit Tree Productivity Project,...
Navigation and Tree Mapping in Orchards
Jæger-Hansen, Claes Lund; Griepentrog, Hans W.; Andersen, Jens Christian
2012-01-01
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 individu...
Ash basin reclamation with forest trees
Energy Technology Data Exchange (ETDEWEB)
Horton, J.H.; McMinn, J.W.
1977-09-01
An ash basin at the Savannah River Plant, Aiken, South Carolina is growing trees as well as, and with some species better than, a local soil. The basin contains ashes from a stoker-fed boiler and was last used about 12 years before the trees were planted. The concentrations of 24 chemical elements were measured in ashes, soil and trees. The concentrations of most of the chemical elements were higher in ashes than in soil; however, with a few exceptions, these elements were less available to the trees on ashes than to the trees on soil. The trees do not show any toxicity or deficiency symptoms, but the concentration of manganese in sycamore growing on ashes indicates a possible deficiency. No concentration of an element in trees appears to be high enough to be toxic to the trees. A longer period of study will be required to determine whether the ashes can produce commercial timber, but trees can be used to stabilize ash basins and improve their appearance.
Vessel tree extraction using locally optimal paths
DEFF Research Database (Denmark)
Lo, Pechin Chien Pau; van Ginneken, Bram; de Bruijne, Marleen
2010-01-01
This paper proposes a method to extract vessel trees by continually extending detected branches with locally optimal paths. Our approach uses a cost function from a multi scale vessel enhancement filter. Optimal paths are selected based on rules that take into account the geometric characteristics...... of the vessel tree. Experiments were performed on 10 low dose chest CT scans for which the pulmonary vessel trees were extracted. The proposed method is shown to extract a better connected vessel tree and extract more of the small peripheral vessels in comparison to applying a threshold on the output...
Making CSB+-Tree Processor Conscious
DEFF Research Database (Denmark)
Samuel, Michael; Pedersen, Anders Uhl; Bonnet, Philippe
2005-01-01
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 performan...... 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....
Fruit load governs transpiration of olive trees
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
Belowground carbon trade among tall forest trees
Klein, Tamir; Siegwolf, Rolf; Koerner, Christian
2016-04-01
Just imagine one tree could hand over large quantities of carbon to another tree. How would that change our thinking about carbon relations of forests, the single biggest biological C reservoir on earth? If such a tree-to-tree C shuttle would exist, it required a demand-supply gradient and a pipeline. Here we show that exactly this unthinkable does occur in overlapping root spheres of tall trees in a mixed temperate forest. Using canopy scale stable carbon isotope labelling applied from a construction crane, we demonstrate that carbon assimilated by spruce is traded over to neighbouring beech, larch, and pine in amounts so large that fine roots almost equilibrate the carbon source signature. The isotope mixing ratio indicated that the interspecific transfer accounted for 40% of the fine root carbon, which is ca. 280 kg ha-1 a-1. This is the first forest scale evidence of a large flux of carbon among mature trees from evolutionary distant taxa. Carbon transfer most likely occurred through common ectomycorrhiza networks, which also exhibited the labelled carbon signal. These observations indicate that while competition for resources (e.g. light, water, nutrients) is often considered the dominant tree-tree interaction in a forest, trees actually interact in more complex pathways including a massive carbon exchange.
Tree models for macroevolution and phylogenetic analysis.
Jones, Graham R
2011-12-01
It has long been recognized that phylogenetic trees are more unbalanced than those generated by a Yule process. Recently, the degree of this imbalance has been quantified using the large set of phylogenetic trees available in the TreeBASE data set. In this article, a more precise analysis of imbalance is undertaken. Trees simulated under a range of models are compared with trees from TreeBASE and two smaller data sets. Several simple models can match the amount of imbalance measured in real data. Most of them also match the variance of imbalance among empirical trees to a remarkable degree. Statistics are developed to measure balance and to distinguish between trees with the same overall imbalance. The match between models and data for these statistics is investigated. In particular, age-dependent (Bellman-Harris) branching process are studied in detail. It remains difficult to separate the process of macroevolution from biases introduced by sampling. The lessons for phylogenetic analysis are clearer. In particular, the use of the usual proportional to distinguishable arrangements (uniform) prior on tree topologies in Bayesian phylogenetic analysis is not recommended.
IMPACTS OF TREE HEIGHT-DBH ALLOMETRY ON LIDAR-BASED TREE ABOVEGROUND BIOMASS MODELING
National Research Council Canada - National Science Library
R. Fang
2016-01-01
.... However, lidar measurements are mainly related to tree vertical structure. Therefore, tree height-dbh allometric model residuals are expected to have a large impact on lidar-based AGB model performance...
Local biotic adaptation of trees and shrubs to plant neighbors
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
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.
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.
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.
Holliday, Jason A; Aitken, Sally N; Cooke, Janice E K; Fady, Bruno; González-Martínez, Santiago C; Heuertz, Myriam; Jaramillo-Correa, Juan-Pablo; Lexer, Christian; Staton, Margaret; Whetten, Ross W; Plomion, Christophe
2017-02-01
Forest trees are an unparalleled group of organisms in their combined ecological, economic and societal importance. With widespread distributions, predominantly random mating systems and large population sizes, most tree species harbour extensive genetic variation both within and among populations. At the same time, demographic processes associated with Pleistocene climate oscillations and land-use change have affected contemporary range-wide diversity and may impinge on the potential for future adaptation. Understanding how these adaptive and neutral processes have shaped the genomes of trees species is therefore central to their management and conservation. As for many other taxa, the advent of high-throughput sequencing methods is expected to yield an understanding of the interplay between the genome and environment at a level of detail and depth not possible only a few years ago. An international conference entitled 'Genomics and Forest Tree Genetics' was held in May 2016, in Arcachon (France), and brought together forest geneticists with a wide range of research interests to disseminate recent efforts that leverage contemporary genomic tools to probe the population, quantitative and evolutionary genomics of trees. An important goal of the conference was to discuss how such data can be applied to both genome-enabled breeding and the conservation of forest genetic resources under land use and climate change. Here, we report discoveries presented at the meeting and discuss how the ecological genomic toolkit can be used to address both basic and applied questions in tree biology. © 2016 John Wiley & Sons Ltd.
Data mining in psychological treatment research: a primer on classification and regression trees.
King, Matthew W; Resick, Patricia A
2014-10-01
Data mining of treatment study results can reveal unforeseen but critical insights, such as who receives the most benefit from treatment and under what circumstances. The usefulness and legitimacy of exploratory data analysis have received relatively little recognition, however, and analytic methods well suited to the task are not widely known in psychology. With roots in computer science and statistics, statistical learning approaches offer a credible option: These methods take a more inductive approach to building a model than is done in traditional regression, allowing the data greater role in suggesting the correct relationships between variables rather than imposing them a priori. Classification and regression trees are presented as a powerful, flexible exemplar of statistical learning methods. Trees allow researchers to efficiently identify useful predictors of an outcome and discover interactions between predictors without the need to anticipate and specify these in advance, making them ideal for revealing patterns that inform hypotheses about treatment effects. Trees can also provide a predictive model for forecasting outcomes as an aid to clinical decision making. This primer describes how tree models are constructed, how the results are interpreted and evaluated, and how trees overcome some of the complexities of traditional regression. Examples are drawn from randomized clinical trial data and highlight some interpretations of particular interest to treatment researchers. The limitations of tree models are discussed, and suggestions for further reading and choices in software are offered. PsycINFO Database Record (c) 2014 APA, all rights reserved.
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.
Stahl, Clément; Hérault, Bruno; Rossi, Vivien; Burban, Benoit; Bréchet, Claude; Bonal, Damien
2013-12-01
Though the root biomass of tropical rainforest trees is concentrated in the upper soil layers, soil water uptake by deep roots has been shown to contribute to tree transpiration. A precise evaluation of the relationship between tree dimensions and depth of water uptake would be useful in tree-based modelling approaches designed to anticipate the response of tropical rainforest ecosystems to future changes in environmental conditions. We used an innovative dual-isotope labelling approach (deuterium in surface soil and oxygen at 120-cm depth) coupled with a modelling approach to investigate the role of tree dimensions in soil water uptake in a tropical rainforest exposed to seasonal drought. We studied 65 trees of varying diameter and height and with a wide range of predawn leaf water potential (Ψpd) values. We confirmed that about half of the studied trees relied on soil water below 100-cm depth during dry periods. Ψpd was negatively correlated with depth of water extraction and can be taken as a rough proxy of this depth. Some trees showed considerable plasticity in their depth of water uptake, exhibiting an efficient adaptive strategy for water and nutrient resource acquisition. We did not find a strong relationship between tree dimensions and depth of water uptake. While tall trees preferentially extract water from layers below 100-cm depth, shorter trees show broad variations in mean depth of water uptake. This precludes the use of tree dimensions to parameterize functional models.
36 CFR 223.4 - Exchange of trees or portions of trees.
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...
Surface storage of rainfall in tree crowns: not all trees are equal
E. Gregory McPherson; Q. Xiao; Natalie van Doorn; P. Peper; E. Teach
2017-01-01
Urban forests can be an effective strategy for managing stormwater. The soil that supports tree growth acts like a reservoir that reduces runoff. The tree crown intercepts rainfall on leaves and stems and its evaporation reduces water reaching the ground below. Until now surface storage capacities have been studied only for forest trees. Based on forest research, green...
Tree architecture and life-history strategies across 200 co-occurring tropical tree species
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
Box-trees and R-trees with near-optimal query time
Agarwal, P.K.; Berg, M. de; Gudmundsson, J.; Hammar, M.; Haverkort, H.J.
2001-01-01
A box-tree is a bounding-volume hierarchy that uses axis-aligned boxes as bounding volumes. The query complexity of a box-tree with respect to a given type of query is the maximum number of nodes visited when answering such a query. We describe several new algorithms for constructing box-trees
MacFarlane, D.W.; Kuyah, S.; Mulia, R.; Dietz, J.; Muthuri, C.; Noordwijk, van M.
2014-01-01
Functional branch analysis (FBA) is a promising non-destructive alternative to the standard destructive method of tree biomass equation development. In FBA, a theoretical model of tree branching architecture is calibrated with measurements of tree stems and branches to estimate the coefficients of
How many trees are enough? Tree death and the urban canopy
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...
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.
The UniFrac significance test is sensitive to tree topology.
Lozupone, Catherine A; Knight, Rob
2015-07-07
Long et al. (BMC Bioinformatics 2014, 15(1):278) describe a "discrepancy" in using UniFrac to assess statistical significance of community differences. Specifically, they find that weighted UniFrac results differ between input trees where (a) replicate sequences each have their own tip, or (b) all replicates are assigned to one tip with an associated count. We argue that these are two distinct cases that differ in the probability distribution on which the statistical test is based, because of the differences in tree topology. Further study is needed to understand which randomization procedure best detects different aspects of community dissimilarities.
The history of Newton's apple tree
Keesing, R. G.
1998-05-01
This article contains a brief introduction to Newton's early life to put into context the subsequent events in this narrative. It is followed by a summary of accounts of Newton's famous story of his discovery of universal gravitation which was occasioned by the fall of an apple in the year 1665/6. Evidence of Newton's friendship with a prosperous Yorkshire family who planted an apple tree arbour in the early years of the eighteenth century to celebrate his discovery is presented. A considerable amount of new and unpublished pictorial and documentary material is included relating to a particular apple tree which grew in the garden of Woolsthorpe Manor (Newton's birthplace) and which blew down in a storm before the year 1816. Evidence is then presented which describes how this tree was chosen to be the focus of Newton's account. Details of the propagation of the apple tree growing in the garden at Woolsthorpe in the early part of the last century are then discussed, and the results of a dendrochronological study of two of these trees is presented. It is then pointed out that there is considerable evidence to show that the apple tree presently growing at Woolsthorpe and known as 'Newton's apple tree' is in fact the same specimen which was identified in the middle of the eighteenth century and which may now be 350 years old. In conclusion early results from a radiocarbon dating study being carried out at the University of Oxford on core samples from the Woolsthorpe tree lend support to the contention that the present tree is one and the same as that identified as Newton's apple tree more than 200 years ago. Very recently genetic fingerprinting techniques have been used in an attempt to identify from which sources the various 'Newton apple trees' planted throughout the world originate. The tentative result of this work suggests that there are two separate varieties of apple tree in existence which have been accepted as 'the tree'. One may conclude that at least some of
The universal tree of life: an update
Directory of Open Access Journals (Sweden)
Patrick eForterre
2015-07-01
Full Text Available Biologists used to draw schematic universal trees of life as metaphors illustrating the history of life. It is indeed a priori possible to construct an organismal tree connecting the three major domains of ribosome encoding organisms: Archaea, Bacteria and Eukarya, since they originated by cell division from LUCA. Several universal trees based on ribosomal RNA sequence comparisons proposed at the end of the last century are still widely used, although some of their main features have been challenged by subsequent analyses. Several authors have proposed to replace the traditional universal tree with a ring of life, whereas others have proposed more recently to include viruses as new domains. These proposals are misleading, suggesting that endosymbiosis can modify the shape of a tree or that viruses originated from the Last Universal Common ancestor (LUCA. I propose here an update version of the Carl Woese universal tree that includes several rooting for each domain and internal branching within domains that are supported by recent phylogenomic analyses of domain specific proteins. The tree is rooted between Bacteria and Arkarya, a new name proposed for the clade grouping Archaea and Eukarya. A consensus version, in which each of the three domains are unrooted, and a version in which eukaryotes emerged within archaea are also presented. This last scenario assumes the transformation of a modern domain into another, a controversial evolutionary pathway. Viruses are not indicated in these trees but are intrinsically present because they infect the tree from its roots to its leaves. Finally, I present a detailed tree of the domain Archaea, proposing the sub-phylum neo-euryarchaeota for the monophyletic group of euryarchaea containing DNA gyrase. These trees, that will be easily updated as new data become available, could be useful to discuss controversial scenarios regarding early life evolution.
Understanding the Scalability of Bayesian Network Inference Using Clique Tree Growth Curves
Mengshoel, Ole J.
2010-01-01
One of the main approaches to performing computation in Bayesian networks (BNs) is clique tree clustering and propagation. The clique tree approach consists of propagation in a clique tree compiled from a Bayesian network, and while it was introduced in the 1980s, there is still a lack of understanding of how clique tree computation time depends on variations in BN size and structure. In this article, we improve this understanding by developing an approach to characterizing clique tree growth as a function of parameters that can be computed in polynomial time from BNs, specifically: (i) the ratio of the number of a BN s non-root nodes to the number of root nodes, and (ii) the expected number of moral edges in their moral graphs. Analytically, we partition the set of cliques in a clique tree into different sets, and introduce a growth curve for the total size of each set. For the special case of bipartite BNs, there are two sets and two growth curves, a mixed clique growth curve and a root clique growth curve. In experiments, where random bipartite BNs generated using the BPART algorithm are studied, we systematically increase the out-degree of the root nodes in bipartite Bayesian networks, by increasing the number of leaf nodes. Surprisingly, root clique growth is well-approximated by Gompertz growth curves, an S-shaped family of curves that has previously been used to describe growth processes in biology, medicine, and neuroscience. We believe that this research improves the understanding of the scaling behavior of clique tree clustering for a certain class of Bayesian networks; presents an aid for trade-off studies of clique tree clustering using growth curves; and ultimately provides a foundation for benchmarking and developing improved BN inference and machine learning algorithms.
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.
Tree rings and the local environment
Kevin T. Smith
2011-01-01
The amount of wood produced by a tree each year depends on tree condition, genetic programming, and growing conditions. Wood is mature xylem, the result of inward cell divisions by the vascular cambium, the new cell generator located between the wood and the inner bark (phloem). In temperate climatic zones, where a spring and summer growing season alternates with...
Structure of an urban Christmas tree market
Thomas H. Pendleton; Lawrence D. Garrett; Lawrence D. Garrett
1973-01-01
The retail Christmas tree market in Winston-Salem, N.C., was studied 3 years. Types of retailers and their sales are described. Best sales were made by dealers who had lots on heavily traveled streets in business districts, had ample parking facilities, advertised, and displayed their trees well.
Alcohol co-production from tree crops
Energy Technology Data Exchange (ETDEWEB)
Seibert, M.; Folger, G.; Milne, T.
1982-06-01
A concept for the sustainable production of alcohol from fermentable substrates produced on an annual basis by the reproductive organs (pods, fruits, nuts, berries, etc.) of tree crops is presented. The advantages of tree-crop systems include suitability for use on marginal land, potential productivity equivalent to row crops, minimal maintenance and energy-input requirements, environmental compatibility, and the possibility of co-product production. Honeylocust, mesquite, and persimmon are examined as potential US tree-crop species. Other species not previously considered, including osage orange and breadfruit, are suggested as tree-crop candidates for North America and the tropical developing world, respectively. Fermentation of tree-crop organs and the economics of tree-crop systems are also discussed. Currently the greatest area of uncertainty lies in actual pod or fruit yields one can expect from large tree farms under real life conditions. However, ballpark ethanol yield estimates of from 880 to 3470 l hectare/sup -1/ (94 to 400 gal acre/sup -1/) justify further consideration of tree crop systems.
How Trees Help the Power Company!
King, Rik
1992-01-01
Proposes the utilization of graph theory to solve optimization problems. Defines the notion of spanning trees and presents two algorithms to determine optimization of a spanning tree. Discusses an example to connect towns by power transmission lines at minimum cost. (MDH)
Binary trees equipped with semivaluations | Pajoohesh ...
African Journals Online (AJOL)
Our interest in this lattice stems from its application to binary decision trees. Binary decision trees form a crucial tool for algorithmic time analysis. The lattice properties of Tn are studied and we show that every Tn has a sublattice isomorphic to Tn-1 and prove that Tn is generated by Tn-1. Also we show that the distance from ...
Tree-Like Partial Hamming Graphs
Directory of Open Access Journals (Sweden)
Gologranc Tanja
2014-02-01
Full Text Available Tree-like partial cubes were introduced in [B. Brešar, W. Imrich, S. Klavžar, Tree-like isometric subgraphs of hypercubes, Discuss. Math. Graph Theory, 23 (2003, 227-240] as a generalization of median graphs. We present some incorrectnesses from that article. In particular we point to a gap in the proof of the theorem about the dismantlability of the cube graph of a tree-like partial cube and give a new proof of that result, which holds also for a bigger class of graphs, so called tree-like partial Hamming graphs. We investigate these graphs and show some results which imply previously-known results on tree-like partial cubes. For instance, we characterize tree-like partial Hamming graphs and prove that every tree-like partial Hamming graph G contains a Hamming graph that is invariant under every automorphism of G. The latter result is a direct consequence of the result about the dismantlability of the intersection graph of maximal Hamming graphs of a tree-like partial Hamming graph.
Tree planting in the United States - 1998
R.J. Moulton; G. Hernandez
2000-01-01
This annual report summarizes tree planting, timber stand improvement, and nursery production activities across all ownerships of forest land in the United States. It includes State-by-State and ownership breakdowns, regional totals, as well as analysis of trends in the data. It does not include tree planting in urban and community environments. As far as we know, it...
tree composition and distribution in federal university
African Journals Online (AJOL)
Tersor
assessed tree species composition and distribution in Federal University of Agriculture Makurdi. Stratified and systematic sampling technique ... Data were analyzed using descriptive statistics. A total of 52 tree species in 48 genera and ..... characteristic? A comparative analysis of private, local and central government forest.
The "Ride for Russia" Tree Lichen Survey
Young, Simon
2013-01-01
The prevalence of nine indicator lichens found on trees in Northern Europe and Western Russia was used for monitoring air quality. The 4200 mile route of the survey went through eight countries. Surveys were carried out in cities, towns, countryside and forests, and along motorways. The author has conducted tree lichen surveys with pupils from…
Sprouting of dormant buds on border trees
G.R., Jr. Trimble; H. Clay Smith; H. Clay Smith
1970-01-01
As part of an evaluation of silvicultura1 systems used in managing Appalachian hardwoods, we are studying degrade of border trees surrounding harvest-cut openings made in the patch cutting and group selection systems. One facet of this research dealt with determining what portion of visually evident dormant buds on border tree boles sprouted when the openings were cut...
Market-based approaches to tree valuation
Geoffrey H. Donovan; David T. Butry
2008-01-01
A recent four-part series in Arborist News outlined different appraisal processes used to value urban trees. The final article in the series described the three generally accepted approaches to tree valuation: the sales comparison approach, the cost approach, and the income capitalization approach. The author, D. Logan Nelson, noted that the sales comparison approach...
Tools for valuing tree and park services
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,...
The First Darwinian Phylogenetic Tree of Plants.
Hoßfeld, Uwe; Watts, Elizabeth; Levit, Georgy S
2017-02-01
In 1866, the German zoologist Ernst Haeckel (1834-1919) published the first Darwinian trees of life in the history of biology in his book General Morphology of Organisms. We take a specific look at the first phylogenetic trees for the plant kingdom that Haeckel created as part of this two-volume work. Copyright © 2016 Elsevier Ltd. All rights reserved.
Tree chemistry database (version 1.0)
Linda H. Pardo; Molly Robin-Abbott; Natasha Duarte; Eric K. Miller
2005-01-01
The Tree Chemistry Database is a relational database of C, N, P, K, Ca, Mg, Mn, and Al concentrations in bole bark, bole wood, branches, twigs, and foliage. Compiled from data in 218 articles and publications, the database contains reported nutrient and biomass values for tree species in the Northeastern United States. Nutrient data can be sorted on parameters such as...
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...
Parallel Tree Projection Algorithm for Sequence Mining
2001-03-29
HPMA +00] was developed by extending the tree-projectionalgorithm [AAP00]. Even though, sequential association rule discovery algorithms based on tree...Kumar. Scalable parallel data mining for association rules. IEEETransactions on Knowledge and Data Eng. (accepted for publication), 1999.[ HPMA +00] J
A Fuzzy Neural Tree for Possibilistic Reliability
Ciftcioglu, O.
2008-01-01
An innovative neural fuzzy system is considered for possibilistic reliability using a neural tree structure with nodes of neuronal type. The total tree structure works effectively as a fuzzy logic system where the possibility theory plays important role with Gaussian possibility distribution at the
Hyperdominance in the Amazonian tree flora
Steege, ter H.; Pitman, C.A.; Sabatier, D.; Baraloto, C.; Salomão, R.P.; Guevara, J.E.; Phillips, O.L.; Castilho, C.V.; Magnusson, W.E.; Mollino, J.-F.; Stevenson Diaz, P.R.; Costa, F.; Emilio, T.; Levis, C.; Schietti, J.; Souza, P.; Alonso, A.; Dallmeier, F.; Duque Montoya, A.J.; Fernandez Piedade, M.T.; Maas, P.; Araujo-Murakami, A.; Arroyo, L.; Gribel, R.; Fine, P.V.A.; Peres, C.A.; Toledo, M.; Aymard, G.A.; Baker, T.R.; Cerón, C.; Engel, J.; Petronelli, P.; Henkel, T.W.; Stropp, J.; Zartman, C.E.; Daly, D.; Neill, D.; Silveira, M.; Ríos Paredes, M.; Chave, J.; de Andrade Lima Filho, D.; Hoffman, B.; Møller Jørgensen, P.; Fuentes, A.; Schöngart, J.; Cornejo Valverde, F.; Di Fiore, A.; Jimenez, E.M.; Peñuela Mora, M.C.; Phillips, J.F.; Rivas, G.; Andel, van T.R.; Zent, E.L.; Hildebrand, von P.; Malhi, Y.; Prieto, A.; Rudas, A.; Ruschell, A.; Silva, N.; Vos, V.; Zent, S.; Oliveira, A.A.; Wang, O.; Cano Schutz, A.; Gonzales, T.; Trindade Nascimento, M.; Ramirez-Angulo, H.; Sierra, R.; Tirado, M.; Umaña Medina, M.N.; Heijden, van der G.; Vela, C.I.A.; Vilanova Torre, E.; Young, K.R.; Vriesendorp, C.; Baider, C.; Balslev, H.; Ferreira, C.; Mesones, I.; Torres-Lezama, A.; Urrego Giraldo, L.E.; Zagt, R.; Alexiades, M.N.; Monteagudo, A.; Hernandez, L.; Huamantupa-Chuquimaco, I.; Millikes, W.; Palacios Cuenca, W.; Pauletto, D.; Valderrama Sandoval, E.; Valenzuela Gamarra, L.; Dexter, K.G.; Feeley, K.; Lopez-Gonzalez, G.; Núñez Vargas, P.; Silman, M.R.; Montero, J.C.; Feldpausch, T.R.; Honorio Coronado, E.N.; Killeen, T.J.; Mostacedo, B.; Vasquez, R.; Assis, R.L.; Terborgh, J.; Wittmann, F.; Andrade, A.; Laurance, W.F.; Laurance, S.G.W.; Marimon, B.S.; Marimon, B.-H. Jr.; Célia Guimarães Vieira, I.; Leão Amaral, I.; Brienen, R.; Castellanos, H.; Cárdenas López, D.; Duivenvoorden, J.F.; Mogollón, H.F.; Dionízia de Almeida Matos, F.; Dávila, N.; García-Villacorta, R.
2013-01-01
The vast extent of the Amazon Basin has historically restricted the study of its tree communities to the local and regional scales. Here, we provide empirical data on the commonness, rarity, and richness of lowland tree species across the entire Amazon Basin and Guiana Shield (Amazonia), collected
Temperature gradients assist carbohydrate allocation within trees.
Sperling, Or; Silva, Lucas C R; Tixier, Aude; Théroux-Rancourt, Guillaume; Zwieniecki, Maciej A
2017-06-12
Trees experience two distinct environments: thermally-variable air and thermally-buffered soil. This generates intra-tree temperature gradients, which can affect carbon metabolism and water transport. In this study, we investigated whether carbohydrate allocation within trees is assisted by temperature gradients. We studied pistachio (Pistacia integerrima) to determine: (1) temperature-induced variation in xylem sugar concentration in excised branches; (2) changes in carbon allocation in young trees under simulated spring and fall conditions; and (3) seasonal variability of starch levels in mature orchard trees under field conditions. We found that warm branches had less sugar in perfused sap than cold branches due to increasing parenchyma storage. Simulated spring conditions promoted allocation of carbohydrates from cold roots to warm canopy and explained why starch levels surged in canopies of orchard trees during early spring. This driving force of sugar transport is interrupted in fall when canopies are colder than roots and carbohydrate redistribution is compartmentalized. On the basis of these findings, we propose a new mechanistic model of temperature-assisted carbohydrate allocation that links environmental cues and tree phenology. This data-enabled model provides insights into thermal "fine-tuning" of carbohydrate metabolism and a warning that the physiological performance of trees might be impaired by climatic changes.
Environmental stress and whole-tree physiology
Peter L. Jr. Lorio
1993-01-01
Interactions among bark beetles, pathogens, and conifers constitute a triangle. Another triangle of interactions exist among the invading organism (bark beetles and pathogens), the trees, and the environment. How important, variable or constant, simple or complex, is the role of trees in these triangles? Understanding the wide range of interactions that take place...
Demography of threatened tree species in Vietnam
Chien, P.D.
2006-01-01
Demography of threatened tree species in Vietnam (Summary for the library) Effective conservation of threatened tree species requires information on natural dynamics and future prospects of populations of these species. Such information can be obtained from demographic studies. We investigated the
Galtier, J; Hueber, F M
2001-09-22
A new anatomically preserved fern, discovered from the basalmost Carboniferous of Australia, shows a unique combination of very primitive anatomical characters (solid centrarch cauline protostele) with the elaboration of an original model of the arborescent habit. This plant possessed a false trunk composed of a repetitive branching system of very small stems, which established it as the oldest tree-fern known to date. The potential of this primitive zygopterid fern to produce such an unusual growth form-without real equivalent among living plants-is related to the possession of two kinds of roots that have complementary functional roles: (i) large roots produced by stems with immediate positive geotropism, strongly adapted to mechanical support and water uptake from the soil; and (ii) small roots borne either on large roots or on petiole bases for absorbing humidity inside the false trunk.
Random fixed points and random differential inclusions
Directory of Open Access Journals (Sweden)
Nikolaos S. Papageorgiou
1988-01-01
Full Text Available In this paper, first, we study random best approximations to random sets, using fixed point techniques, obtaining this way stochastic analogues of earlier deterministic results by Browder-Petryshyn, KyFan and Reich. Then we prove two fixed point theorems for random multifunctions with stochastic domain that satisfy certain tangential conditions. Finally we consider a random differential inclusion with upper semicontinuous orientor field and establish the existence of random solutions.