WorldWideScience

Sample records for tree gomortega keule

  1. Flower and fruit production and insect pollination of the endangered Chilean tree, Gomortega keule in native forest, exotic pine plantation and agricultural environments Producción de flores y frutas y polinización por insectos de Gomortega keule en bosque nativo y en terrenos agrícolas, un árbol chileno en peligro de extinción

    Directory of Open Access Journals (Sweden)

    TONYA A LANDER

    2009-01-01

    Full Text Available This study was undertaken to discover whether patterns of flower and fruit production for Gomortega keule, an endangered Chilean tree, differ between exotic pine plantation, agricultural and native forest environments. A pilot study was also undertaken to identify the primary pollinators of G. keule. Although similar proportions of G. keule trees flowered in the agricultural and native forest áreas, more trees in the agricultural sites produced fruit compared to trees in the native forest sites. Flowering and fruiting of G. keule was extremely rare in the exotic pine plantations. Our data show that G. keule flowers are predominantly visited by syrphid flies in March-April, and that syrphids carry a greater proportion of G. keule pollen than the other insects collected. Native forest and low intensity agricultural systems appear to provide habitat in which syrphids forage and G. keule is able to produce fruit successfully, but exotic pine plantation does not; suggesting that a landscape made up of a mosaic of different landuse types is not necessarily inimical to the continued reproduction of G. keule, but that the combination and types of landuses and intensity of management must be carefully considered.El presente estudio fue realizado con el objetivo de establecer si los patrones de producción de flores y frutos de Gomortega keule (Gomortegaceae, un árbol chileno en peligro de extinción, son diferentes entre áreas de plantaciones de pinos exóticos, terrenos agrícolas y áreas de bosque nativo. También fue llevado a cabo un estudio piloto para identificar los principales polinizadores de G. keule. A pesar de que en tierras agrícolas y en áreas de bosque nativo floreció una proporción similar de árboles de G. keule, en zonas agrícolas fructificó una mayor proporción en comparación con los árboles de áreas de bosque nativo. La floración y fructificación de G. keule fue extremadamente rara en las áreas de plantaciones de

  2. KEUL METAR

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — METAR is a routine scheduled observation and is the primary observation code used in the United States to satisfy requirements for reporting surface meteorological...

  3. Trees

    Science.gov (United States)

    Al-Khaja, Nawal

    2007-01-01

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

  4. Flowering Trees

    Indian Academy of Sciences (India)

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

  5. Flowering Trees

    Indian Academy of Sciences (India)

    IAS Admin

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

  6. Flowering Trees

    Indian Academy of Sciences (India)

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

  7. Flowering Trees

    Indian Academy of Sciences (India)

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

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

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

  10. Tree Nut Allergies

    Science.gov (United States)

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

  11. Flowering Trees

    Indian Academy of Sciences (India)

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

  12. Flowering Trees

    Indian Academy of Sciences (India)

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

  13. Flowering Trees

    Indian Academy of Sciences (India)

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

  14. Flowering Trees

    Indian Academy of Sciences (India)

    user

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

  15. Flowering Trees

    Indian Academy of Sciences (India)

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

  16. Talking Trees

    Science.gov (United States)

    Tolman, Marvin

    2005-01-01

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

  17. Drawing Trees

    DEFF Research Database (Denmark)

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

    2018-01-01

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

  18. Flowering Trees

    Indian Academy of Sciences (India)

    Srimath

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

  19. Phylogenetic trees

    OpenAIRE

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

    2016-01-01

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

  20. Electron Tree

    DEFF Research Database (Denmark)

    Appelt, Ane L; Rønde, Heidi S

    2013-01-01

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

  1. Flowering Trees

    Indian Academy of Sciences (India)

    Srimath

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

  2. Flowering Trees

    Indian Academy of Sciences (India)

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

  3. Flowering Trees

    Indian Academy of Sciences (India)

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

  4. Flowering Trees

    Indian Academy of Sciences (India)

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

  5. Flowering Trees

    Indian Academy of Sciences (India)

    sriranga

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

  6. Flowering Trees

    Indian Academy of Sciences (India)

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

  7. Flowering Trees

    Indian Academy of Sciences (India)

    IAS Admin

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

  8. Flowering Trees

    Indian Academy of Sciences (India)

    user

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

  9. Flowering Trees

    Indian Academy of Sciences (India)

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

  10. Flowering Trees

    Indian Academy of Sciences (India)

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

  11. Flowering Trees

    Indian Academy of Sciences (India)

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

  12. Flowering Trees

    Indian Academy of Sciences (India)

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

  13. ~{owering 'Trees

    Indian Academy of Sciences (India)

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

  14. Tree Mortality

    Science.gov (United States)

    Mark J. Ambrose

    2012-01-01

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

  15. Flowering Trees

    Indian Academy of Sciences (India)

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

  16. Surface tree languages and parallel derivation trees

    NARCIS (Netherlands)

    Engelfriet, Joost

    1976-01-01

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

  17. Trees are good, but…

    Science.gov (United States)

    E.G. McPherson; F. Ferrini

    2010-01-01

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

  18. Modular tree automata

    DEFF Research Database (Denmark)

    Bahr, Patrick

    2012-01-01

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

  19. Simple street tree sampling

    Science.gov (United States)

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

    2015-01-01

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

  20. City of Pittsburgh Trees

    Data.gov (United States)

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

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

    Science.gov (United States)

    Fisler, Marie; Lecointre, Guillaume

    2013-01-01

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

  2. Urban tree growth modeling

    Science.gov (United States)

    E. Gregory McPherson; Paula J. Peper

    2012-01-01

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

  3. Keeping trees as assets

    Science.gov (United States)

    Kevin T. Smith

    2009-01-01

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

  4. Classification and regression trees

    CERN Document Server

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

    1984-01-01

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

  5. Fault tree handbook

    International Nuclear Information System (INIS)

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

    1981-01-01

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

  6. There's Life in Hazard Trees

    Science.gov (United States)

    Mary Torsello; Toni McLellan

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

  7. Covering tree with stars

    DEFF Research Database (Denmark)

    Baumbach, Jan; Guo, Jiong; Ibragimov, Rashid

    2015-01-01

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

  8. Trees and highway safety.

    Science.gov (United States)

    2011-03-01

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

  9. Decision-Tree Program

    Science.gov (United States)

    Buntine, Wray

    1994-01-01

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

  10. Minnesota's Forest Trees. Revised.

    Science.gov (United States)

    Miles, William R.; Fuller, Bruce L.

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

  11. D2-tree

    DEFF Research Database (Denmark)

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

    2015-01-01

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

  12. Covering tree with stars

    DEFF Research Database (Denmark)

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

    2013-01-01

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

  13. Winter Birch Trees

    Science.gov (United States)

    Sweeney, Debra; Rounds, Judy

    2011-01-01

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

  14. Total well dominated trees

    DEFF Research Database (Denmark)

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

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

  15. TreePics: visualizing trees with pictures

    Directory of Open Access Journals (Sweden)

    Nicolas Puillandre

    2017-09-01

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

  16. Spectra of chemical trees

    International Nuclear Information System (INIS)

    Balasubramanian, K.

    1982-01-01

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

  17. Refining discordant gene trees.

    Science.gov (United States)

    Górecki, Pawel; Eulenstein, Oliver

    2014-01-01

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

  18. The valuative tree

    CERN Document Server

    Favre, Charles

    2004-01-01

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

  19. Coded Splitting Tree Protocols

    DEFF Research Database (Denmark)

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

    2013-01-01

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

  20. Morocco - Fruit Tree Productivity

    Data.gov (United States)

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

  1. Are trees long-lived?

    Science.gov (United States)

    Kevin T. Smith

    2009-01-01

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

  2. Fragmentation of random trees

    International Nuclear Information System (INIS)

    Kalay, Z; Ben-Naim, E

    2015-01-01

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

  3. The tree BVOC index

    Science.gov (United States)

    J.R. Simpson; E.G. McPherson

    2011-01-01

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

  4. Tree growth visualization

    Science.gov (United States)

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

    2005-01-01

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

  5. Flowering T Flowering Trees

    Indian Academy of Sciences (India)

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

  6. Fault tree graphics

    International Nuclear Information System (INIS)

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

    1975-01-01

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

  7. Tree biology and dendrochemistry

    Science.gov (United States)

    Kevin T. Smith; Walter C. Shortle

    1996-01-01

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

  8. Individual tree control

    Science.gov (United States)

    Harvey A. Holt

    1989-01-01

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

  9. Trees and Climate Change

    OpenAIRE

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

    2017-01-01

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

  10. Structural Equation Model Trees

    Science.gov (United States)

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

    2013-01-01

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

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

  12. Environmental tritium in trees

    International Nuclear Information System (INIS)

    Brown, R.M.

    1979-01-01

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

  13. Generalising tree traversals and tree transformations to DAGs

    DEFF Research Database (Denmark)

    Bahr, Patrick; Axelsson, Emil

    2017-01-01

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

  14. A recursive algorithm for trees and forests

    OpenAIRE

    Guo, Song; Guo, Victor J. W.

    2017-01-01

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

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

  16. Skewed Binary Search Trees

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Moruz, Gabriel

    2006-01-01

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

  17. The gravity apple tree

    International Nuclear Information System (INIS)

    Aldama, Mariana Espinosa

    2015-01-01

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

  18. Visualizing phylogenetic tree landscapes.

    Science.gov (United States)

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

    2017-02-02

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

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

    NARCIS (Netherlands)

    Eilmann, B.; Rigling, A.

    2012-01-01

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

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

    Science.gov (United States)

    Kevin T. Smith

    2018-01-01

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

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

    OpenAIRE

    Prodinger, Helmut

    2017-01-01

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

  2. A Suffix Tree Or Not a Suffix Tree?

    DEFF Research Database (Denmark)

    Starikovskaya, Tatiana; Vildhøj, Hjalte Wedel

    2015-01-01

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

  3. NLCD 2001 - Tree Canopy

    Data.gov (United States)

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

  4. Trees for future forests

    DEFF Research Database (Denmark)

    Lobo, Albin

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

  5. Value tree analysis

    International Nuclear Information System (INIS)

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

    1985-01-01

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

  6. Multiscale singularity trees

    DEFF Research Database (Denmark)

    Somchaipeng, Kerawit; Sporring, Jon; Johansen, Peter

    2007-01-01

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

  7. Type extension trees

    DEFF Research Database (Denmark)

    Jaeger, Manfred

    2006-01-01

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

  8. Tree felling 2014

    CERN Multimedia

    2014-01-01

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

  9. Benefit-based tree valuation

    Science.gov (United States)

    E.G. McPherson

    2007-01-01

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

  10. Attack Trees with Sequential Conjunction

    NARCIS (Netherlands)

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

    2015-01-01

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

  11. Tree manipulation experiment

    Science.gov (United States)

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

    2012-12-01

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

  12. Steiner trees in industry

    CERN Document Server

    Du, Ding-Zhu

    2001-01-01

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

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

  14. Generic Ising trees

    DEFF Research Database (Denmark)

    Durhuus, Bergfinnur Jøgvan; Napolitano, George Maria

    2012-01-01

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

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

    Science.gov (United States)

    Chen, Wei-Hua; Lercher, Martin J

    2009-07-31

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

  16. A parallel buffer tree

    DEFF Research Database (Denmark)

    Sitchinava, Nodar; Zeh, Norbert

    2012-01-01

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

  17. Embedding complete ternary tree in hypercubes using AVL trees

    NARCIS (Netherlands)

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

    2008-01-01

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

  18. Portraits of Tree Families

    NARCIS (Netherlands)

    Balgooy, van M.M.J.

    1998-01-01

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

  19. P{owering 'Trees

    Indian Academy of Sciences (India)

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

  20. Programming macro tree transducers

    DEFF Research Database (Denmark)

    Bahr, Patrick; Day, Laurence E.

    2013-01-01

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

  1. Chapter 5 - Tree Mortality

    Science.gov (United States)

    Mark J. Ambrose

    2014-01-01

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

  2. A Universal Phylogenetic Tree.

    Science.gov (United States)

    Offner, Susan

    2001-01-01

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

  3. Base tree property

    Czech Academy of Sciences Publication Activity Database

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

    2015-01-01

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

  4. Multiquarks and Steiner trees

    International Nuclear Information System (INIS)

    Richard, Jean-Marc

    2010-01-01

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

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

  6. Selecting Landscape Plants: Shade Trees

    OpenAIRE

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

    2015-01-01

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

  7. Adjustable chain trees for proteins

    DEFF Research Database (Denmark)

    Winter, Pawel; Fonseca, Rasmus

    2012-01-01

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

  8. Introduction to fault tree analysis

    International Nuclear Information System (INIS)

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

    1975-01-01

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

  9. The Re-Think Tree.

    Science.gov (United States)

    Gear, Jim

    1993-01-01

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

  10. The Hopi Fruit Tree Book.

    Science.gov (United States)

    Nyhuis, Jane

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

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

  12. Inferences from growing trees backwards

    Science.gov (United States)

    David W. Green; Kent A. McDonald

    1997-01-01

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

  13. Genetic transformation of forest trees

    African Journals Online (AJOL)

    Admin

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

  14. TREE SELECTING AND TREE RING MEASURING IN DENDROCHRONOLOGICAL INVESTIGATIONS

    Directory of Open Access Journals (Sweden)

    Sefa Akbulut

    2004-04-01

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

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

    Science.gov (United States)

    Tennekes, Martijn; de Jonge, Edwin

    2014-12-01

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

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

    Science.gov (United States)

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

    2014-03-06

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

  17. Fault tree analysis

    International Nuclear Information System (INIS)

    1981-09-01

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

  18. Tree-level formalism

    International Nuclear Information System (INIS)

    Brandhuber, Andreas; Spence, Bill; Travaglini, Gabriele

    2011-01-01

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

  19. Tree Rings: Timekeepers of the Past.

    Science.gov (United States)

    Phipps, R. L.; McGowan, J.

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

  20. Wood for the trees

    Directory of Open Access Journals (Sweden)

    Rob Garbutt

    2013-10-01

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

  1. Recursive Trees for Practical ORAM

    Directory of Open Access Journals (Sweden)

    Moataz Tarik

    2015-06-01

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

  2. Mathematical foundations of event trees

    International Nuclear Information System (INIS)

    Papazoglou, Ioannis A.

    1998-01-01

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

  3. Making CSB + -Trees Processor Conscious

    DEFF Research Database (Denmark)

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

    2005-01-01

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

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

  5. (Almost) practical tree codes

    KAUST Repository

    Khina, Anatoly

    2016-08-15

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

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

    Science.gov (United States)

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

    2014-01-01

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

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

    Science.gov (United States)

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

    2016-05-01

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

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

    Science.gov (United States)

    G.H. Donovan; D.T. Butry

    2010-01-01

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

  9. Systolic trees and systolic language recognition by tree automata

    Energy Technology Data Exchange (ETDEWEB)

    Steinby, M

    1983-01-01

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

  10. Tree felling: a necessary evil

    CERN Multimedia

    CERN Bulletin

    2013-01-01

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

  11. Human decision error (HUMDEE) trees

    International Nuclear Information System (INIS)

    Ostrom, L.T.

    1993-01-01

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

  12. Phylogenetic trees and Euclidean embeddings.

    Science.gov (United States)

    Layer, Mark; Rhodes, John A

    2017-01-01

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

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

  14. The Steiner tree problem

    CERN Document Server

    Hwang, FK; Winter, P

    1992-01-01

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

  15. Genealogy and gene trees.

    Science.gov (United States)

    Rasmuson, Marianne

    2008-02-01

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

  16. Distributed Merge Trees

    Energy Technology Data Exchange (ETDEWEB)

    Morozov, Dmitriy; Weber, Gunther

    2013-01-08

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

  17. Visualizing Individual Tree Differences in Tree-Ring Studies

    Directory of Open Access Journals (Sweden)

    Mario Trouillier

    2018-04-01

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

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

    African Journals Online (AJOL)

    PROF HORSFALL

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

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

    Science.gov (United States)

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

    2013-11-01

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

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

    Science.gov (United States)

    Vaughn, Brandon K.; Wang, Qiu

    2010-01-01

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

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

    African Journals Online (AJOL)

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

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

    Science.gov (United States)

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

    2004-01-01

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

  3. Better trees through systematic breeding

    Science.gov (United States)

    Robert Z. Callaham

    1957-01-01

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

  4. Tree physiology and bark beetles

    Science.gov (United States)

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

    2015-01-01

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

  5. Tree Hydraulics: How Sap Rises

    Science.gov (United States)

    Denny, Mark

    2012-01-01

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

  6. Boosted decision trees and applications

    International Nuclear Information System (INIS)

    Coadou, Y.

    2013-01-01

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

  7. Who pays for tree improvement?

    Science.gov (United States)

    Tom D. Byram; E. M. Raley

    2011-01-01

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

  8. Mean-field lattice trees

    NARCIS (Netherlands)

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

    1999-01-01

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

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

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

  11. Decision trees in epidemiological research.

    Science.gov (United States)

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

    2017-01-01

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

  12. Totally optimal decision trees for Boolean functions

    KAUST Repository

    Chikalov, Igor; Hussain, Shahid; Moshkov, Mikhail

    2016-01-01

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

  13. Are There Infinite Irrigation Trees?

    Science.gov (United States)

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

    2006-08-01

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

  14. Maximum Gene-Support Tree

    Directory of Open Access Journals (Sweden)

    Yunfeng Shan

    2008-01-01

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

  15. Linking and Cutting Spanning Trees

    Directory of Open Access Journals (Sweden)

    Luís M. S. Russo

    2018-04-01

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

  16. Tree Ordination as Invented Tradition

    Directory of Open Access Journals (Sweden)

    Avery Morrow

    2012-01-01

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

  17. Tree Coding of Bilevel Images

    DEFF Research Database (Denmark)

    Martins, Bo; Forchhammer, Søren

    1998-01-01

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    1979-01-01

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

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

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

    Science.gov (United States)

    Eilmann, Britta; Rigling, Andreas

    2012-02-01

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

  1. TreeCluster: Massively scalable transmission clustering using phylogenetic trees

    OpenAIRE

    Moshiri, Alexander

    2018-01-01

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

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

    OpenAIRE

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

    2017-01-01

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

  3. Resummed tree heptagon

    Science.gov (United States)

    Belitsky, A. V.

    2018-04-01

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

  4. Random ancestor trees

    International Nuclear Information System (INIS)

    Ben-Naim, E; Krapivsky, P L

    2010-01-01

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

  5. Trees as metal scavengers

    International Nuclear Information System (INIS)

    Hallman, N.

    2000-01-01

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

  6. The Tree of Industrial Life

    DEFF Research Database (Denmark)

    Andersen, Esben Sloth

    2002-01-01

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

  7. Fremont Tree-Well Filter

    Science.gov (United States)

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

  8. Algorithms for Decision Tree Construction

    KAUST Repository

    Chikalov, Igor

    2011-01-01

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

  9. Decision tree modeling using R.

    Science.gov (United States)

    Zhang, Zhongheng

    2016-08-01

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

  10. Visualizing Contour Trees within Histograms

    DEFF Research Database (Denmark)

    Kraus, Martin

    2010-01-01

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

  11. Distance labeling schemes for trees

    DEFF Research Database (Denmark)

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

    2016-01-01

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

  12. Generic physical protection logic trees

    International Nuclear Information System (INIS)

    Paulus, W.K.

    1981-10-01

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

  13. Border trees of complex networks

    International Nuclear Information System (INIS)

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

    2008-01-01

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

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

  15. Objective consensus from decision trees

    International Nuclear Information System (INIS)

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

    2014-01-01

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

  16. Objective consensus from decision trees.

    Science.gov (United States)

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

    2014-12-05

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

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

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

  19. Factors that influence Christmas tree sales

    Science.gov (United States)

    Thomas H. Pendleton; Lawrence D. Garrett

    1970-01-01

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

  20. Critical wind speed at which trees break

    Science.gov (United States)

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

    2016-02-01

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

  1. Field guide to red tree vole nests

    Science.gov (United States)

    Damon B. Lesmeister; James K. Swingle

    2017-01-01

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

  2. Mitered fractal trees: constructions and properties

    NARCIS (Netherlands)

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

    2012-01-01

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

  3. Critical wind speed at which trees break.

    Science.gov (United States)

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

    2016-02-01

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

  4. Microwave sensing of tree trunks

    Science.gov (United States)

    Jezova, Jana; Mertens, Laurence; Lambot, Sebastien

    2015-04-01

    The main subject of this research is the observation of the inner part of living tree trunks using ground-penetrating radar (GPR). Trees are everyday part of human life and therefore it is important to pay attention to the tree conditions. The most obvious consequence of the poor tree condition is dead or injury caused by falling tree. The trunk internal structure is divided into three main parts: heartwood, sapwood and bark, which make this medium highly anisotropic and heterogeneous. Furthermore, the properties of the wood are not only specie-dependent but also depend on genetic and on environmental conditions. In urban areas the main problem for the stability of the trees relies in the apparition of decays provoked by fungi, insect or birds. This results in cavities or decreasing of the support capacity of the tree. GPR has proved itself to be a very powerful electromagnetic tool for non-destructive detection of buried objects. Since the beginning of the 20th century it has been used in several different areas (archaeology, landmine detection, civil engineering, ...). GPR uses the principle of the scattering of the electromagnetic waves that are radiated from a transmitting antenna. Then the waves propagate through the medium and are reflected from the object and then they are received by a receiving antenna. The velocity of the scattered signal is determined primarily by the permittivity of the material. The optimal functionality of the GPR was investigated using the numerical simulation tool gprMax2D. This tool is based on a Finite-Difference Time-Domain (FDTD) numerical model. Subsequently, the GPR functionality was tested using the laboratory model of a decayed tree trunk. Afterwards, the results and lessons learnt in the simplified tests will be used in the processing of the real data and will help to achieve deeper understanding of them. The laboratory model of the tree trunk was made by plastic or carton pipes and filled by sand. Space inside the model

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

    Directory of Open Access Journals (Sweden)

    M. Borowiecki

    2017-01-01

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

  6. A bicriterion Steiner tree problem on graph

    Directory of Open Access Journals (Sweden)

    Vujošević Mirko B.

    2003-01-01

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

  7. Tree Notation: an antifragile program notation

    OpenAIRE

    Yunits, Breck

    2017-01-01

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

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

    Science.gov (United States)

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

    2015-11-01

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

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

  10. Isoprene emission from Indian trees

    Science.gov (United States)

    Varshney, C. K.; Singh, Abhai Pratap

    2003-12-01

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

  11. Automated Generation of Attack Trees

    DEFF Research Database (Denmark)

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

    2014-01-01

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

  12. Drawing Contour Trees in the Plane.

    Science.gov (United States)

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

    2011-11-01

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

  13. Totally optimal decision trees for Boolean functions

    KAUST Repository

    Chikalov, Igor

    2016-07-28

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

  14. Integrated fault tree development environment

    International Nuclear Information System (INIS)

    Dixon, B.W.

    1986-01-01

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

  15. Interpreting the universal phylogenetic tree

    Science.gov (United States)

    Woese, C. R.

    2000-01-01

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

  16. Columnar apple tree named 'Moonlight'

    OpenAIRE

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

    2010-01-01

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

  17. Interpreting CNNs via Decision Trees

    OpenAIRE

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

    2018-01-01

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

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

    African Journals Online (AJOL)

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

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

    Science.gov (United States)

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

    2012-11-15

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

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

    Science.gov (United States)

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

    2011-01-01

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

  1. Integrating cyber attacks within fault trees

    International Nuclear Information System (INIS)

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

    2009-01-01

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

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

  3. On Tree-Based Phylogenetic Networks.

    Science.gov (United States)

    Zhang, Louxin

    2016-07-01

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

  4. Human action analysis with randomized trees

    CERN Document Server

    Yu, Gang; Liu, Zicheng

    2014-01-01

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

  5. Integrating cyber attacks within fault trees

    Energy Technology Data Exchange (ETDEWEB)

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

    2009-09-15

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

  6. Recursive algorithms for phylogenetic tree counting.

    Science.gov (United States)

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

    2013-10-28

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

  7. A Metric on Phylogenetic Tree Shapes.

    Science.gov (United States)

    Colijn, C; Plazzotta, G

    2018-01-01

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

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

    Science.gov (United States)

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

    2018-01-01

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

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

    Science.gov (United States)

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

    2011-06-01

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

  10. GumTree: Data reduction

    Energy Technology Data Exchange (ETDEWEB)

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

    2006-11-15

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

  11. Tree value conversion standards revisited

    Science.gov (United States)

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

    1991-01-01

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

  12. Induction of Ordinal Decision Trees

    NARCIS (Netherlands)

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

    2003-01-01

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

  13. Are there tides within trees?

    Science.gov (United States)

    Fisahn, Joachim

    2018-01-24

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

  14. Tree improvement and environmental forestry

    Science.gov (United States)

    Warren T. Doolittle

    1971-01-01

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

  15. Eucalyptus as a landscape tree

    Science.gov (United States)

    W. Douglas Hamilton

    1983-01-01

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

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

  17. Trees of Our National Forests.

    Science.gov (United States)

    Forest Service (USDA), Washington, DC.

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

  18. The Trees that surround us

    Science.gov (United States)

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

    2012-04-01

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

  19. Wellhead and tree standards updated

    International Nuclear Information System (INIS)

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

    1996-01-01

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

  20. The Tree of Life Project

    Science.gov (United States)

    Milbrath, Sherry

    2009-01-01

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

  1. GumTree: Data reduction

    International Nuclear Information System (INIS)

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

    2006-01-01

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

  2. Algorithms for Decision Tree Construction

    KAUST Repository

    Chikalov, Igor

    2011-01-01

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

  3. Can Children Read Evolutionary Trees?

    Science.gov (United States)

    Ainsworth, Shaaron; Saffer, Jessica

    2013-01-01

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

  4. Top tips from tree tops

    Science.gov (United States)

    Ornes, Stephen

    2018-04-01

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

  5. A distributed spanning tree algorithm

    DEFF Research Database (Denmark)

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

    1988-01-01

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

  6. International Tree Ring Data Bank (ITRDB)

    Data.gov (United States)

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

  7. Interactive wood combustion for botanical tree models

    KAUST Repository

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

    2017-01-01

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

  8. EDITORIAL Development Linkages between Tree Breeding ...

    African Journals Online (AJOL)

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

  9. Systolic automata for VLSI on balanced trees

    Energy Technology Data Exchange (ETDEWEB)

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

    1983-01-01

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

  10. Representing Boolean Functions by Decision Trees

    KAUST Repository

    Chikalov, Igor

    2011-01-01

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

  11. Computing Refined Buneman Trees in Cubic Time

    DEFF Research Database (Denmark)

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

    2003-01-01

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

  12. Understanding search trees via statistical physics

    Indian Academy of Sciences (India)

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

  13. Tree rings and radiocarbon calibration

    International Nuclear Information System (INIS)

    Barbetti, M.

    1999-01-01

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

  14. A Durable Flash Memory Search Tree

    OpenAIRE

    Clay III, James; Wortman, Kevin

    2012-01-01

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

  15. Using tree diversity to compare phylogenetic heuristics.

    Science.gov (United States)

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

    2009-04-29

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

  16. Locating a tree in a phylogenetic network

    OpenAIRE

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

    2010-01-01

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

  17. The transposition distance for phylogenetic trees

    OpenAIRE

    Rossello, Francesc; Valiente, Gabriel

    2006-01-01

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

  18. Animals and trees: food for thought

    Energy Technology Data Exchange (ETDEWEB)

    Openshaw, K.

    1979-01-01

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

  19. The national tree-list layer

    Science.gov (United States)

    Stacy A. Drury; Jason M. Herynk

    2011-01-01

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

  20. On Tree-Constrained Matchings and Generalizations

    NARCIS (Netherlands)

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

    2011-01-01

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

  1. Measuring and analyzing urban tree cover

    Science.gov (United States)

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

    1996-01-01

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

  2. Understanding the challenges of municipal tree planting

    Science.gov (United States)

    E.G. McPherson; R. Young

    2010-01-01

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

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

    African Journals Online (AJOL)

    philiph

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

  4. Sampling the quality of hardwood trees

    Science.gov (United States)

    Adrian M. Gilbert

    1959-01-01

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

  5. Locating a tree in a phylogenetic network

    NARCIS (Netherlands)

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

    2010-01-01

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

  6. Finding small equivalent decision trees is hard

    NARCIS (Netherlands)

    Zantema, H.; Bodlaender, H.L.

    2000-01-01

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

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

  8. Aspects of insertion in random trees

    NARCIS (Netherlands)

    Bagchi, Arunabha; Reingold, E.M.

    1982-01-01

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

  9. Coalescent methods for estimating phylogenetic trees.

    Science.gov (United States)

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

    2009-10-01

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

  10. Evaluating realized genetic gains from tree improvement.

    Science.gov (United States)

    J.B. St. Clair

    1993-01-01

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

  11. A practical alternative to single tree selection?

    Science.gov (United States)

    Gary W. Miller; H. Clay Smith

    1993-01-01

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

  12. Do you believe in palm trees?

    Science.gov (United States)

    Kevin T. Smith

    2013-01-01

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

  13. Carbon dynamics in trees: feast or famine?

    Science.gov (United States)

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

    2012-01-01

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

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

    NARCIS (Netherlands)

    Soliz Gamboa, C.C.

    2010-01-01

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

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

    Science.gov (United States)

    Thomas B. Lynch; Robert F. Wittwer

    2002-01-01

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

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

    DEFF Research Database (Denmark)

    Feragen, Aasa; Owen, Megan; Petersen, Jens

    2013-01-01

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

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

    Science.gov (United States)

    E. Gregory McPherson

    2014-01-01

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

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

    Science.gov (United States)

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

    2008-07-01

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

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

    OpenAIRE

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

    2009-01-01

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

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

    Science.gov (United States)

    2013-01-01

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

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

  2. Computer aided construction of fault tree

    International Nuclear Information System (INIS)

    Kovacs, Z.

    1982-01-01

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

  3. Air pollution and tree growth

    Energy Technology Data Exchange (ETDEWEB)

    Scurfield, G

    1960-01-01

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

  4. Spanning Tree Based Attribute Clustering

    DEFF Research Database (Denmark)

    Zeng, Yifeng; Jorge, Cordero Hernandez

    2009-01-01

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

  5. Carbon Sequestration by Urban Trees

    DEFF Research Database (Denmark)

    Fares, Silvano; Paoletti, Elena; Calfapietra, Carlo

    2017-01-01

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

  6. Chemicals from trees and shrubs

    Energy Technology Data Exchange (ETDEWEB)

    Halloran, G M

    1978-01-01

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

  7. Meta-learning in decision tree induction

    CERN Document Server

    Grąbczewski, Krzysztof

    2014-01-01

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

  8. Rooted triple consensus and anomalous gene trees

    Directory of Open Access Journals (Sweden)

    Schmidt Heiko A

    2008-04-01

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

  9. The stopping rules for winsorized tree

    Science.gov (United States)

    Ch'ng, Chee Keong; Mahat, Nor Idayu

    2017-11-01

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

  10. Nonbinary Tree-Based Phylogenetic Networks.

    Science.gov (United States)

    Jetten, Laura; van Iersel, Leo

    2018-01-01

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

  11. Deterministic Automata for Unordered Trees

    Directory of Open Access Journals (Sweden)

    Adrien Boiret

    2014-08-01

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

  12. Carbon-14 in tree rings

    International Nuclear Information System (INIS)

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

    1976-01-01

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

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

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

  15. Folding and unfolding phylogenetic trees and networks.

    Science.gov (United States)

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

    2016-12-01

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

  16. Fuzzy tree automata and syntactic pattern recognition.

    Science.gov (United States)

    Lee, E T

    1982-04-01

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

  17. The dynamics of strangling among forest trees.

    Science.gov (United States)

    Okamoto, Kenichi W

    2015-11-07

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

  18. ETE: a python Environment for Tree Exploration.

    Science.gov (United States)

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

    2010-01-13

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

  19. ETE: a python Environment for Tree Exploration

    Directory of Open Access Journals (Sweden)

    Gabaldón Toni

    2010-01-01

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

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

    DEFF Research Database (Denmark)

    Li, Heng; Coghlan, Avril; Ruan, Jue

    2006-01-01

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

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

  2. Optimal Monotone Drawings of Trees

    OpenAIRE

    He, Dayu; He, Xin

    2016-01-01

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

  3. Helping to increase tree crops

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1970-07-01

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

  4. Helping to increase tree crops

    International Nuclear Information System (INIS)

    1970-01-01

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

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

    Science.gov (United States)

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

    2018-04-01

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

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

    Science.gov (United States)

    Gou, Liang; Zhang, Xiaolong Luke

    2011-12-01

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

  7. VC-dimension of univariate decision trees.

    Science.gov (United States)

    Yildiz, Olcay Taner

    2015-02-01

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

  8. Geodesic atlas-based labeling of anatomical trees

    DEFF Research Database (Denmark)

    Feragen, Aasa; Petersen, Jens; Owen, Megan

    2015-01-01

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

  9. On the structure of path-like trees

    OpenAIRE

    Muntaner Batle, Francesc Antoni; Rius Font, Miquel

    2007-01-01

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

  10. The spectral dimension of random trees

    International Nuclear Information System (INIS)

    Destri, Claudio; Donetti, Luca

    2002-01-01

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

  11. Reconciliation with non-binary species trees.

    Science.gov (United States)

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

    2008-10-01

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

  12. Nonbinary tree-based phylogenetic networks

    OpenAIRE

    Jetten, Laura; van Iersel, Leo

    2016-01-01

    Rooted phylogenetic networks are used to describe evolutionary histories that contain non-treelike evolutionary events such as hybridization and horizontal gene transfer. In some cases, such histories can be described by a phylogenetic base-tree with additional linking arcs, which can for example represent gene transfer events. Such phylogenetic networks are called tree-based. Here, we consider two possible generalizations of this concept to nonbinary networks, which we call tree-based and st...

  13. Transforming phylogenetic networks: Moving beyond tree space

    OpenAIRE

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

    2016-01-01

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

  14. Tank waste remediation system architecture tree

    International Nuclear Information System (INIS)

    PECK, L.G.

    1999-01-01

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

  15. Tank waste remediation system architecture tree; TOPICAL

    International Nuclear Information System (INIS)

    PECK, L.G.

    1999-01-01

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

  16. Maintenance of carbohydrate transport in tall trees

    DEFF Research Database (Denmark)

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

    2017-01-01

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

  17. Breaking the fault tree circular logic

    International Nuclear Information System (INIS)

    Lankin, M.

    2000-01-01

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

  18. Modular representation and analysis of fault trees

    Energy Technology Data Exchange (ETDEWEB)

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

    1978-08-01

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

  19. Tritium concentrations in tree ring cellulose

    International Nuclear Information System (INIS)

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

    1989-01-01

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

  20. The space of ultrametric phylogenetic trees.

    Science.gov (United States)

    Gavryushkin, Alex; Drummond, Alexei J

    2016-08-21

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

  1. Creating ensembles of decision trees through sampling

    Science.gov (United States)

    Kamath, Chandrika; Cantu-Paz, Erick

    2005-08-30

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

  2. Fruit load governs transpiration of olive trees

    Science.gov (United States)

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

    2016-01-01

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

  3. Big data of tree species distributions

    DEFF Research Database (Denmark)

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

    2018-01-01

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

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

    Science.gov (United States)

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

    2016-12-01

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

  5. Computer aided fault tree synthesis

    International Nuclear Information System (INIS)

    Poucet, A.

    1983-01-01

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

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

    Science.gov (United States)

    1983-10-01

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

  7. Encoding phylogenetic trees in terms of weighted quartets.

    Science.gov (United States)

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

    2008-04-01

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

  8. Tree architecture and life-history strategies across 200 co-occurring tropical tree species

    NARCIS (Netherlands)

    Iida, Y.; Kohyama, T.S.; Kubo, T.; Kassim, A.R.; Poorter, L.; Sterck, F.J.; Potts, M.D.

    2011-01-01

    1. Tree architecture is thought to allow species to partition horizontal and vertical light gradients in the forest canopy. Tree architecture is closely related to light capture, carbon gain and the efficiency with which trees reach the canopy. Previous studies that investigated how light gradients

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

    Science.gov (United States)

    Mai, Uyen; Sayyari, Erfan; Mirarab, Siavash

    2017-01-01

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

  10. Forest FIRE and FIRE wood : tools for tree automata and tree algorithms

    NARCIS (Netherlands)

    Cleophas, L.G.W.A.; Piskorski, J.; Watson, B.W.; Yli-Jyrä, A.

    2009-01-01

    Pattern matching, acceptance, and parsing algorithms on node-labeled, ordered, ranked trees ('tree algorithms') are important for applications such as instruction selection and tree transformation/term rewriting. Many such algorithms have been developed. They often are based on results from such

  11. 36 CFR 223.4 - Exchange of trees or portions of trees.

    Science.gov (United States)

    2010-07-01

    ... 36 Parks, Forests, and Public Property 2 2010-07-01 2010-07-01 false Exchange of trees or portions of trees. 223.4 Section 223.4 Parks, Forests, and Public Property FOREST SERVICE, DEPARTMENT OF AGRICULTURE SALE AND DISPOSAL OF NATIONAL FOREST SYSTEM TIMBER General Provisions § 223.4 Exchange of trees or...

  12. How many trees are enough? Tree death and the urban canopy

    Science.gov (United States)

    Lara A. Roman

    2014-01-01

    Massive city tree planting campaigns have invigorated the urban forestry movement, and engaged politicians, planners, and the public in urban greening. Million tree initiatives have been launched in Los Angeles, CA; Denver, CO; New York City, NY; Philadelphia, PA, and other cities. Sacramento, CA even has a five million tree program. These...

  13. Atlas of United States Trees, Volume 2: Alaska Trees and Common Shrubs.

    Science.gov (United States)

    Viereck, Leslie A.; Little, Elbert L., Jr.

    This volume is the second in a series of atlases describing the natural distribution or range of native tree species in the United States. The 82 species maps include 32 of trees in Alaska, 6 of shrubs rarely reaching tree size, and 44 more of common shrubs. More than 20 additional maps summarize environmental factors and furnish general…

  14. Understanding recruitment failure in tropical tree species: Insights from a tree ring study

    NARCIS (Netherlands)

    Vlam, M.; Baker, P.J.; Bunyavejchewin, S.; Mohren, G.M.J.; Zuidema, P.A.

    2014-01-01

    Many tropical tree species have population structures that exhibit strong recruitment failure. While the presence of adult trees indicates that appropriate regeneration conditions occurred in the past, it is often unclear why small individuals are absent. Knowing how, when and where these tree

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

  16. Injective Labeled Oriented Trees are Aspherical

    OpenAIRE

    Harlander, Jens; Rosebrock, Stephan

    2012-01-01

    A labeled oriented tree is called injective if each generator occurs at most once as an edge label. We show that injective labeled oriented trees are aspherical. The proof relies on a new relative asphericity test based on a lemma of Stallings.

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

  18. Portraits of Non-Tree Families

    NARCIS (Netherlands)

    Balgooy, van M.M.J.

    2001-01-01

    This is the third and final volume of the series ‘Malesian Seed Plants’. It contains the ‘portraits’ of 124 non-tree families, i.e. families which are mainly herbaceous, climbing, shrubby, or trees with a stem diameter at breast height of less than 10 cm or a height of less than 10 m. Users of the

  19. Smoothed analysis of binary search trees

    NARCIS (Netherlands)

    Manthey, Bodo; Reischuk, Rüdiger

    2007-01-01

    Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform distribution is only logarithmic. The exact value is one of the best studied problems in average-case complexity. We

  20. Tools for valuing tree and park services

    Science.gov (United States)

    E.G. McPherson

    2010-01-01

    Arborists and urban foresters plan, design, construct, and manage trees and parks in cities throughout the world. These civic improvements create walkable, cool environments, save energy, reduce stormwater runoff, sequester carbon dioxide, and absorb air pollutants. The presence of trees and green spaces in cities is associated with increases in property values,...

  1. A coinductive calculus of binary trees

    NARCIS (Netherlands)

    A.M. Silva (Alexandra); J.J.M.M. Rutten (Jan)

    2007-01-01

    htmlabstractWe study the set T_A of infinite binary trees with nodes labelled in a semiring A from a coalgebraic perspective. We present coinductive definition and proof principles based on the fact that T_A carries a final coalgebra structure. By viewing trees as formal power series, we develop a

  2. Structure of an urban Christmas tree market

    Science.gov (United States)

    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.

  3. The production of homozygous tree material

    Science.gov (United States)

    Reinhard F. Stettler; George E. Howe

    1966-01-01

    Homozygous trees will never be the desired ultimate step in a forest tree improvement program. However, they will serve many purposes in forest genetics research: (1) in the detection of genetic markers; (2) in the isolation of traits under simple genetic control for the study of growth and differentiation phenomena; (3) as a tool as well as reference material in the...

  4. Improved Anonymity for Key-trees

    NARCIS (Netherlands)

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

    2013-01-01

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

  5. Sprouting of dormant buds on border trees

    Science.gov (United States)

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

  6. Exploring connections between trees and human health

    Science.gov (United States)

    Geoffrey Donovan; Marie. Oliver

    2014-01-01

    Humans have intuitively understood the value of trees to their physical and mental health since the beginning of recorded time. A scientist with the Pacific Northwest Research Station wondered if such a link could be scientifically validated. His research team took advantage of an infestation of emerald ash borer, an invasive pest that kills ash trees, to conduct a...

  7. Environmental stress and whole-tree physiology

    Science.gov (United States)

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

  8. Finiteness results for Abelian tree models

    NARCIS (Netherlands)

    Draisma, J.; Eggermont, R.H.

    2015-01-01

    Equivariant tree models are statistical models used in the reconstruction of phylogenetic trees from genetic data. Here equivariant refers to a symmetry group imposed on the root distribution and on the transition matrices in the model. We prove that if that symmetry group is Abelian, then the

  9. Finiteness results for Abelian tree models

    NARCIS (Netherlands)

    Draisma, J.; Eggermont, R.H.

    2012-01-01

    Equivariant tree models are statistical models used in the reconstruction of phylogenetic trees from genetic data. Here equivariant refers to a symmetry group imposed on the root distribution and on the transition matrices in the model. We prove that if that symmetry group is Abelian, then the

  10. Finiteness results for Abelian tree models

    NARCIS (Netherlands)

    Draisma, J.; Eggermont, R.H.

    2015-01-01

    Equivariant tree models are statistical models used in the reconstruction of phylogenetic trees from genetic data. Here equivariant§ refers to a symmetry group imposed on the root distribution and on the transition matrices in the model. We prove that if that symmetry group is Abelian, then the

  11. Pulp quality from small-diameter trees.

    Science.gov (United States)

    G.C. Myers; S. Kumar; R.R. Gustafson; R.J. Barbour; S.M. Abubakr

    1997-01-01

    Kraft and thermomechanical (TMP) pulps were prepared and evaluated from lodgepole pine and mixed Douglas-fir/western larch sawmill residue chips; lodgepole pine, Douglas-fir, and western larch submerchantable logs; and lodgepole pine, Douglas-fir, and western larch small trees and tops. Kraft pulp from small trees and tops was identical to that from submerchantable...

  12. FAT-miner: mining frequent attribute trees

    NARCIS (Netherlands)

    Knijf, de J.; Cho, Y.; Wainwright, R.L.; Haddad, H.; Shin, S.Y.; Koo, Y.W.

    2007-01-01

    Data that can conceptually be viewed as tree structures abounds in domains such as bio-informatics, web logs, XML databases and multi-relational databases. Besides structural information such as nodes and edges, tree structured data also often contains attributes, that represent properties of nodes.

  13. The "Ride for Russia" Tree Lichen Survey

    Science.gov (United States)

    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…

  14. Naive Fault Tree : formulation of the approach

    NARCIS (Netherlands)

    Rajabalinejad, M

    2017-01-01

    Naive Fault Tree (NFT) accepts a single value or a range of values for each basic event and returns values for the top event. This accommodates the need of commonly used Fault Trees (FT) for precise data making them prone to data concerns and limiting their area of application. This paper extends

  15. Market-based approaches to tree valuation

    Science.gov (United States)

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

  16. Grading sugar pine saw logs in trees.

    Science.gov (United States)

    John W. Henley

    1972-01-01

    Small limbs and small overgrown limbs cause problems when grading saw logs in sugar pine trees. Surface characteristics and lumber recovery information for 426 logs from 64 sugar pine trees were examined. Resulting modifications in the grading specification that allow a grader to ignore small limbs and small limb indicators do not appear to decrease the performance of...

  17. How early ferns became trees.

    Science.gov (United States)

    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.

  18. Genealogical Trees of Scientific Papers.

    Science.gov (United States)

    Waumans, Michaël Charles; Bersini, Hugues

    2016-01-01

    Many results have been obtained when studying scientific papers citations databases in a network perspective. Articles can be ranked according to their current in-degree and their future popularity or citation counts can even be predicted. The dynamical properties of such networks and the observation of the time evolution of their nodes started more recently. This work adopts an evolutionary perspective and proposes an original algorithm for the construction of genealogical trees of scientific papers on the basis of their citation count evolution in time. The fitness of a paper now amounts to its in-degree growing trend and a "dying" paper will suddenly see this trend declining in time. It will give birth and be taken over by some of its most prevalent citing "offspring". Practically, this might be used to trace the successive published milestones of a research field.

  19. Structure theorems for game trees.

    Science.gov (United States)

    Govindan, Srihari; Wilson, Robert

    2002-06-25

    Kohlberg and Mertens [Kohlberg, E. & Mertens, J. (1986) Econometrica 54, 1003-1039] proved that the graph of the Nash equilibrium correspondence is homeomorphic to its domain when the domain is the space of payoffs in normal-form games. A counterexample disproves the analog for the equilibrium outcome correspondence over the space of payoffs in extensive-form games, but we prove an analog when the space of behavior strategies is perturbed so that every path in the game tree has nonzero probability. Without such perturbations, the graph is the closure of the union of a finite collection of its subsets, each diffeomorphic to a corresponding path-connected open subset of the space of payoffs. As an application, we construct an algorithm for computing equilibria of an extensive-form game with a perturbed strategy space, and thus approximate equilibria of the unperturbed game.

  20. Tree and nontree multiparticle amplitudes

    International Nuclear Information System (INIS)

    Goldberg, H.; Vaughn, M.T.

    1991-01-01

    We examine the behavior of the connected n-point function in a zero-dimensional scalar theory (scrL=-1/2m 2 φ 2 -1/4λφ 4 ). The problematic n exclamation point(√λ ) n behavior for large n, previously found for tree graphs in scalar field theory, is again obtained in saddle-point approximation in this model. However, a similar behavior, n exclamation point[f(λ)] n , persists in the full theory, where f∼ √λ for λ→0, f∼λ -1/4 for λ much-gt 1. This behavior can be traced to the existence of zeros in the complex J plane of the generating functional Z(J), which in turn is controlled by the asymptotic behavior in |J| of Z(J) calculated in saddle-point approximation. The application of these results to field theory is discussed

  1. Stand conditions and tree characteristics affect quality of longleaf pine for red-cockaded woodpecker cavity trees

    Science.gov (United States)

    W.G. Ross; D.L. Kulhavy; R.N. Conner

    1997-01-01

    We measured resin flow of longleaf (Pinus palustris Mill.) pines in red-cockaded woodpecker (Picoides borealis Vieillot) clusters in the Angelina National Forest in Texas, and the Apalachicola National Forest in Florida. Sample trees were categorized as active cavity trees, inactive cavity trees and control trees. Sample trees were further...

  2. Fast Tree: Computing Large Minimum-Evolution Trees with Profiles instead of a Distance Matrix

    OpenAIRE

    N. Price, Morgan

    2009-01-01

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

  3. Language distance and tree reconstruction

    International Nuclear Information System (INIS)

    Petroni, Filippo; Serva, Maurizio

    2008-01-01

    Languages evolve over time according to a process in which reproduction, mutation and extinction are all possible. This is very similar to haploid evolution for asexual organisms and for the mitochondrial DNA of complex ones. Exploiting this similarity, it is possible, in principle, to verify hypotheses concerning the relationship among languages and to reconstruct their family tree. The key point is the definition of the distances among pairs of languages in analogy with the genetic distances among pairs of organisms. Distances can be evaluated by comparing grammar and/or vocabulary, but while it is difficult, if not impossible, to quantify grammar distance, it is possible to measure a distance from vocabulary differences. The method used by glottochronology computes distances from the percentage of shared 'cognates', which are words with a common historical origin. The weak point of this method is that subjective judgment plays a significant role. Here we define the distance of two languages by considering a renormalized edit distance among words with the same meaning and averaging over the two hundred words contained in a Swadesh list. In our approach the vocabulary of a language is the analogue of DNA for organisms. The advantage is that we avoid subjectivity and, furthermore, reproducibility of results is guaranteed. We apply our method to the Indo-European and the Austronesian groups, considering, in both cases, fifty different languages. The two trees obtained are, in many respects, similar to those found by glottochronologists, with some important differences as regards the positions of a few languages. In order to support these different results we separately analyze the structure of the distances of these languages with respect to all the others

  4. Language distance and tree reconstruction

    Science.gov (United States)

    Petroni, Filippo; Serva, Maurizio

    2008-08-01

    Languages evolve over time according to a process in which reproduction, mutation and extinction are all possible. This is very similar to haploid evolution for asexual organisms and for the mitochondrial DNA of complex ones. Exploiting this similarity, it is possible, in principle, to verify hypotheses concerning the relationship among languages and to reconstruct their family tree. The key point is the definition of the distances among pairs of languages in analogy with the genetic distances among pairs of organisms. Distances can be evaluated by comparing grammar and/or vocabulary, but while it is difficult, if not impossible, to quantify grammar distance, it is possible to measure a distance from vocabulary differences. The method used by glottochronology computes distances from the percentage of shared 'cognates', which are words with a common historical origin. The weak point of this method is that subjective judgment plays a significant role. Here we define the distance of two languages by considering a renormalized edit distance among words with the same meaning and averaging over the two hundred words contained in a Swadesh list. In our approach the vocabulary of a language is the analogue of DNA for organisms. The advantage is that we avoid subjectivity and, furthermore, reproducibility of results is guaranteed. We apply our method to the Indo-European and the Austronesian groups, considering, in both cases, fifty different languages. The two trees obtained are, in many respects, similar to those found by glottochronologists, with some important differences as regards the positions of a few languages. In order to support these different results we separately analyze the structure of the distances of these languages with respect to all the others.

  5. Representing Boolean Functions by Decision Trees

    KAUST Repository

    Chikalov, Igor

    2011-01-01

    A Boolean or discrete function can be represented by a decision tree. A compact form of decision tree named binary decision diagram or branching program is widely known in logic design [2, 40]. This representation is equivalent to other forms, and in some cases it is more compact than values table or even the formula [44]. Representing a function in the form of decision tree allows applying graph algorithms for various transformations [10]. Decision trees and branching programs are used for effective hardware [15] and software [5] implementation of functions. For the implementation to be effective, the function representation should have minimal time and space complexity. The average depth of decision tree characterizes the expected computing time, and the number of nodes in branching program characterizes the number of functional elements required for implementation. Often these two criteria are incompatible, i.e. there is no solution that is optimal on both time and space complexity. © Springer-Verlag Berlin Heidelberg 2011.

  6. Molecular basis of angiosperm tree architecture.

    Science.gov (United States)

    Hollender, Courtney A; Dardick, Chris

    2015-04-01

    The architecture of trees greatly impacts the productivity of orchards and forestry plantations. Amassing greater knowledge on the molecular genetics that underlie tree form can benefit these industries, as well as contribute to basic knowledge of plant developmental biology. This review describes the fundamental components of branch architecture, a prominent aspect of tree structure, as well as genetic and hormonal influences inferred from studies in model plant systems and from trees with non-standard architectures. The bulk of the molecular and genetic data described here is from studies of fruit trees and poplar, as these species have been the primary subjects of investigation in this field of science. No claim to original US Government works. New Phytologist © 2014 New Phytologist Trust.

  7. Tree growth studies on uranium mill tailings

    International Nuclear Information System (INIS)

    Murray, D.R.; Turcotte, M.

    1982-01-01

    Coniferous trees planted in 1974 and deciduous species that have volunteered since 1970 on uranium mill tailings that had been stabilized to varying degrees using limestone and vegetation were evaluated. Their survival and growth rates were compared with those from other investigations. Competition for light appears to be a major contributor to mortality. Differences in soil moisture conditions under a tree stand as compared to those under a grass sward are potentially significant enough to affect the tailings hydrology and effluent contamination. Recommendations include planting seeds of deciduous species or deciduous and coniferous seedlings on strips of freshly disturbed tailings. The disturbed strips would provide reduced competition for the initial year and assist in tree survival. The planting of block stands of coniferous or deciduous trees would be useful for evaluating the hydrological impact of the trees as compared to the present grass sward

  8. Timing-Driven-Testable Convergent Tree Adders

    Directory of Open Access Journals (Sweden)

    Johnnie A. Huang

    2002-01-01

    Full Text Available Carry lookahead adders have been, over the years, implemented in complex arithmetic units due to their regular structure which leads to efficient VLSI implementation for fast adders. In this paper, timing-driven testability synthesis is first performed on a tree adder. It is shown that the structure of the tree adder provides for a high fanout with an imbalanced tree structure, which likely contributes to a racing effect and increases the delay of the circuit. The timing optimization is then realized by reducing the maximum fanout of the adder and by balancing the tree circuit. For a 56-b testable tree adder, the optimization produces a 6.37%increase in speed of the critical path while only contributing a 2.16% area overhead. The full testability of the circuit is achieved in the optimized adder design.

  9. Interactive wood combustion for botanical tree models

    KAUST Repository

    Pirk, Sören

    2017-11-22

    We present a novel method for the combustion of botanical tree models. Tree models are represented as connected particles for the branching structure and a polygonal surface mesh for the combustion. Each particle stores biological and physical attributes that drive the kinetic behavior of a plant and the exothermic reaction of the combustion. Coupled with realistic physics for rods, the particles enable dynamic branch motions. We model material properties, such as moisture and charring behavior, and associate them with individual particles. The combustion is efficiently processed in the surface domain of the tree model on a polygonal mesh. A user can dynamically interact with the model by initiating fires and by inducing stress on branches. The flames realistically propagate through the tree model by consuming the available resources. Our method runs at interactive rates and supports multiple tree instances in parallel. We demonstrate the effectiveness of our approach through numerous examples and evaluate its plausibility against the combustion of real wood samples.

  10. Phylogenetic search through partial tree mixing

    Science.gov (United States)

    2012-01-01

    Background Recent advances in sequencing technology have created large data sets upon which phylogenetic inference can be performed. Current research is limited by the prohibitive time necessary to perform tree search on a reasonable number of individuals. This research develops new phylogenetic algorithms that can operate on tens of thousands of species in a reasonable amount of time through several innovative search techniques. Results When compared to popular phylogenetic search algorithms, better trees are found much more quickly for large data sets. These algorithms are incorporated in the PSODA application available at http://dna.cs.byu.edu/psoda Conclusions The use of Partial Tree Mixing in a partition based tree space allows the algorithm to quickly converge on near optimal tree regions. These regions can then be searched in a methodical way to determine the overall optimal phylogenetic solution. PMID:23320449

  11. Success tree method of resources evaluation

    International Nuclear Information System (INIS)

    Chen Qinglan; Sun Wenpeng

    1994-01-01

    By applying the reliability theory in system engineering, the success tree method is used to transfer the expert's recognition on metallogenetic regularities into the form of the success tree. The aim of resources evaluation is achieved by means of calculating the metallogenetic probability or favorability of the top event of the success tree. This article introduces in detail, the source, principle of the success tree method and three kinds of calculation methods, expounds concretely how to establish the success tree of comprehensive uranium metallogenesis as well as the procedure from which the resources evaluation is performed. Because this method has not restrictions on the number of known deposits and calculated area, it is applicable to resources evaluation for different mineral species, types and scales and possesses good prospects of development

  12. Radioecological investigations on tree rings of spruce

    International Nuclear Information System (INIS)

    Haas, G.; Mueller, A.

    1995-01-01

    Tree ring analysis contributes essentially to the explanation of physiological and element-specific transport phenomena in trees. After the accident in Chernobyl the behaviour of Cs-134 and Cs-137 in trees is most informative for the prediction of the future development of the distribution of these elements. In this study the uptake and the long term behaviour of Cs-134, Cs-137, Pb-210, Ra-226, Ra-228, K-40, Th-228, Th-230, Th-232, U-234 and U-238 in tree rings of spruce are examined by α- and γ-spectrometry. All samples are dried at 105C and ashed at 450C in a muffle furnace. The distributions found in the tree rings vary for different radionuclides. A soil profile from the spruce stand provides additional information

  13. Seeing the forest for the trees

    DEFF Research Database (Denmark)

    Ribbons, Relena Rose

    Tree species influence soils above and belowground communities through leaf litter and root inputs. Soil microbial communities can directly influence tree growth and development through processes such as decomposition of leaves, and indirectly through chemical transformation of nutrients in soils...... as an influence of altered C:N ratios due to leaf litter inputs. This thesis aims to document some of the mechanisms by which trees influence soil microbial communities and nitrogen cycling processes like gross and net ammonification and nitrification. This thesis also aims to determine the role of site nitrogen...... status on modulating those tree species effects. The effects of tree species on ammonification and nitrification rates in forest floors and mineral soils were explored, and related to functional genetic markers for ammonia-oxidation by archaea and bacteria (amoA AOA and AOB), bacterial denitrification...

  14. Track treeing mechanism and its application

    International Nuclear Information System (INIS)

    Li Boyang

    1993-01-01

    Based on electrostriction and fracture mechanics, experiment observation and data-processing, two models (restriction among tree tracks and induction of tree track onto stress concentrated spots) and factors (restriction and induction) are proposed; The existence of four types of plastic zone (spot-block pz, single crack isolate pz, transition from isolate to block pz and crack-block pz) and two types of annex (plastic zone and crack zone) are pointed out. The development regularities of Gp (diameter of plastic zone), G(diameter of tree track), S(tree track density) and total areal of tree track (SG 2 ) in two basic experiments (H=H+dH, H=Hc H-field strength) are described by using four basic formulae. (author)

  15. Tree agency and urban forest governance

    DEFF Research Database (Denmark)

    Konijnendijk, Cecil Cornelis

    2016-01-01

    governance also involving businesses and civic society. However, governance theory usually does not consider the role of non-human agency, which can be considered problematic due to, for example, the important role of urban trees in place making. The purpose of this paper is to provide further insight...... into the importance of considering tree agency in governance. Design/methodology/approach – Taking an environmental governance and actor network theory perspective, the paper presents a critical view of current urban forest governance, extending the perspective to include not only a wide range of human actors......, but also trees as important non-human actors. Findings – Urban forest governance has become more complex and involves a greater range of actors and actor networks. However, the agency of trees in urban forest governance is seldom well developed. Trees, in close association with local residents, create...

  16. Design of data structures for mergeable trees

    DEFF Research Database (Denmark)

    Georgiadis, Loukas; Tarjan, Robert Endre; Werneck, Renato Fonseca F.

    2006-01-01

    merge operation can change many arcs. In spite of this, we develop a data structure that supports merges and all other standard tree operations in O(log2 n) amortized time on an n-node forest. For the special case that occurs in the motivating application, in which arbitrary arc deletions...... are not allowed, we give a data structure with an O(log n) amortized time bound per operation, which is asymptotically optimal. The analysis of both algorithms is not straightforward and requires ideas not previously used in the study of dynamic trees. We explore the design space of algorithms for the problem......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 single...

  17. Barking up the wrong tree: injuries due to falls from trees in Solomon Islands.

    Science.gov (United States)

    Negin, Joel; Vizintin, Pavle; Houasia, Patrick; Martiniuk, Alexandra L C

    2014-12-11

    To investigate tree-related injuries in Solomon Islands by the types of trees involved, who is affected and the types of injuries caused. Descriptive case series of all cases of injuries related to trees presenting to the National Referral Hospital in Honiara from 1994 to 2011. Data were collected by the attending clinician using a Trauma Epidemiology form, which provides information on age, sex, cause of injury and type of fracture. Number of injuries by tree type, sex and age. Of the 7651 injuries in the database, 1107 (14%) were caused by falls from trees. Falls from coconut trees led to the highest number of injuries, followed by falls from mango, guava, apple and nut trees. Overall, 85% of injuries occurred in individuals aged trees, 77% of patients were aged tree types. Overall, 71% of injuries occurred among males. Of all injuries, 92% were fractures, 3% were dislocations and 5% were non-fracture, non-dislocation injuries. The arm (including wrist, elbow and hand) was the most common location of injury across all tree types. Distal radius fractures in the forearm were particularly common, as were ulna fractures. While mangos and guavas are undeniably delicious, the quest for their flesh can be hazardous. Children will always climb trees, but the search for food among children in lower-income settings may lead to higher rates of injury.

  18. New perspectives on the ecology of tree structure and tree communities through terrestrial laser scanning.

    Science.gov (United States)

    Malhi, Yadvinder; Jackson, Tobias; Patrick Bentley, Lisa; Lau, Alvaro; Shenkin, Alexander; Herold, Martin; Calders, Kim; Bartholomeus, Harm; Disney, Mathias I

    2018-04-06

    Terrestrial laser scanning (TLS) opens up the possibility of describing the three-dimensional structures of trees in natural environments with unprecedented detail and accuracy. It is already being extensively applied to describe how ecosystem biomass and structure vary between sites, but can also facilitate major advances in developing and testing mechanistic theories of tree form and forest structure, thereby enabling us to understand why trees and forests have the biomass and three-dimensional structure they do. Here we focus on the ecological challenges and benefits of understanding tree form, and highlight some advances related to capturing and describing tree shape that are becoming possible with the advent of TLS. We present examples of ongoing work that applies, or could potentially apply, new TLS measurements to better understand the constraints on optimization of tree form. Theories of resource distribution networks, such as metabolic scaling theory, can be tested and further refined. TLS can also provide new approaches to the scaling of woody surface area and crown area, and thereby better quantify the metabolism of trees. Finally, we demonstrate how we can develop a more mechanistic understanding of the effects of avoidance of wind risk on tree form and maximum size. Over the next few years, TLS promises to deliver both major empirical and conceptual advances in the quantitative understanding of trees and tree-dominated ecosystems, leading to advances in understanding the ecology of why trees and ecosystems look and grow the way they do.

  19. Interactive Tree Of Life v2: online annotation and display of phylogenetic trees made easy.

    Science.gov (United States)

    Letunic, Ivica; Bork, Peer

    2011-07-01

    Interactive Tree Of Life (http://itol.embl.de) is a web-based tool for the display, manipulation and annotation of phylogenetic trees. It is freely available and open to everyone. In addition to classical tree viewer functions, iTOL offers many novel ways of annotating trees with various additional data. Current version introduces numerous new features and greatly expands the number of supported data set types. Trees can be interactively manipulated and edited. A free personal account system is available, providing management and sharing of trees in user defined workspaces and projects. Export to various bitmap and vector graphics formats is supported. Batch access interface is available for programmatic access or inclusion of interactive trees into other web services.

  20. Cache-Oblivious Search Trees via Binary Trees of Small Height

    DEFF Research Database (Denmark)

    Brodal, G.S.; Fagerberg, R.; Jacob, R.

    2002-01-01

    We propose a version of cache oblivious search trees which is simpler than the previous proposal of Bender, Demaine and Farach-Colton and has the same complexity bounds. In particular, our data structure avoids the use of weight balanced B-trees, and can be implemented as just a single array......, and range queries in worst case O(logB n + k/B) memory transfers, where k is the size of the output.The basic idea of our data structure is to maintain a dynamic binary tree of height log n+O(1) using existing methods, embed this tree in a static binary tree, which in turn is embedded in an array in a cache...... oblivious fashion, using the van Emde Boas layout of Prokop.We also investigate the practicality of cache obliviousness in the area of search trees, by providing an empirical comparison of different methods for laying out a search tree in memory....

  1. An efficient and extensible approach for compressing phylogenetic trees

    KAUST Repository

    Matthews, Suzanne J; Williams, Tiffani L

    2011-01-01

    Background: Biologists require new algorithms to efficiently compress and store their large collections of phylogenetic trees. Our previous work showed that TreeZip is a promising approach for compressing phylogenetic trees. In this paper, we extend

  2. Development of tree hollows in pedunculate oak (Quercus robur)

    OpenAIRE

    Ranius, Thomas; Niklasson, Mats; Berg, Niclas

    2009-01-01

    Many invertebrates, birds and mammals are dependent on hollow trees. For landscape planning that aims at persistence of species inhabiting hollow trees it is crucial to understand the development of such trees. In this study we constructed an individual-based simulation model to predict diameter distribution and formation of hollows in oak tree populations. Based on tree-ring data from individual trees, we estimated the ages when hollow formation commences for pedunculate oak (Quercus robur) ...

  3. Tree decline and the future of Australian farmland biodiversity

    OpenAIRE

    Fischer, Joern; Zerger, Andre; Gibbons, Phil; Stott, Jenny; Law, Bradley S.

    2010-01-01

    Farmland biodiversity is greatly enhanced by the presence of trees. However, farmland trees are declining worldwide, including in North America, Central America, and parts of southern Europe. We show that tree decline and its likely consequences are particularly severe in Australia's temperate agricultural zone, which is a threatened ecoregion. Using field data on trees, remotely sensed imagery, and a demographic model for trees, we predict that by 2100, the number of trees on an average farm...

  4. An efficient and extensible approach for compressing phylogenetic trees

    KAUST Repository

    Matthews, Suzanne J

    2011-01-01

    Background: Biologists require new algorithms to efficiently compress and store their large collections of phylogenetic trees. Our previous work showed that TreeZip is a promising approach for compressing phylogenetic trees. In this paper, we extend our TreeZip algorithm by handling trees with weighted branches. Furthermore, by using the compressed TreeZip file as input, we have designed an extensible decompressor that can extract subcollections of trees, compute majority and strict consensus trees, and merge tree collections using set operations such as union, intersection, and set difference.Results: On unweighted phylogenetic trees, TreeZip is able to compress Newick files in excess of 98%. On weighted phylogenetic trees, TreeZip is able to compress a Newick file by at least 73%. TreeZip can be combined with 7zip with little overhead, allowing space savings in excess of 99% (unweighted) and 92%(weighted). Unlike TreeZip, 7zip is not immune to branch rotations, and performs worse as the level of variability in the Newick string representation increases. Finally, since the TreeZip compressed text (TRZ) file contains all the semantic information in a collection of trees, we can easily filter and decompress a subset of trees of interest (such as the set of unique trees), or build the resulting consensus tree in a matter of seconds. We also show the ease of which set operations can be performed on TRZ files, at speeds quicker than those performed on Newick or 7zip compressed Newick files, and without loss of space savings.Conclusions: TreeZip is an efficient approach for compressing large collections of phylogenetic trees. The semantic and compact nature of the TRZ file allow it to be operated upon directly and quickly, without a need to decompress the original Newick file. We believe that TreeZip will be vital for compressing and archiving trees in the biological community. © 2011 Matthews and Williams; licensee BioMed Central Ltd.

  5. An efficient and extensible approach for compressing phylogenetic trees.

    Science.gov (United States)

    Matthews, Suzanne J; Williams, Tiffani L

    2011-10-18

    Biologists require new algorithms to efficiently compress and store their large collections of phylogenetic trees. Our previous work showed that TreeZip is a promising approach for compressing phylogenetic trees. In this paper, we extend our TreeZip algorithm by handling trees with weighted branches. Furthermore, by using the compressed TreeZip file as input, we have designed an extensible decompressor that can extract subcollections of trees, compute majority and strict consensus trees, and merge tree collections using set operations such as union, intersection, and set difference. On unweighted phylogenetic trees, TreeZip is able to compress Newick files in excess of 98%. On weighted phylogenetic trees, TreeZip is able to compress a Newick file by at least 73%. TreeZip can be combined with 7zip with little overhead, allowing space savings in excess of 99% (unweighted) and 92%(weighted). Unlike TreeZip, 7zip is not immune to branch rotations, and performs worse as the level of variability in the Newick string representation increases. Finally, since the TreeZip compressed text (TRZ) file contains all the semantic information in a collection of trees, we can easily filter and decompress a subset of trees of interest (such as the set of unique trees), or build the resulting consensus tree in a matter of seconds. We also show the ease of which set operations can be performed on TRZ files, at speeds quicker than those performed on Newick or 7zip compressed Newick files, and without loss of space savings. TreeZip is an efficient approach for compressing large collections of phylogenetic trees. The semantic and compact nature of the TRZ file allow it to be operated upon directly and quickly, without a need to decompress the original Newick file. We believe that TreeZip will be vital for compressing and archiving trees in the biological community.

  6. Users' manual for the FTDRAW (Fault Tree Draw) code

    International Nuclear Information System (INIS)

    Oikawa, Tetsukuni; Hikawa, Michihiro; Tanabe, Syuichi; Nakamura, Norihiro

    1985-02-01

    This report provides the information needed to use the FTDRAW (Fault Tree Draw) code, which is designed for drawing a fault tree. The FTDRAW code has several optional functions, such as the overview of a fault tree output, fault tree output in English description, fault tree output in Japanese description and summary tree output. Inputs for the FTDRAW code are component failure rate information and gate information which are filed out by a execution of the FTA-J (Fault Tree Analysis-JAERI) code system and option control data. Using the FTDRAW code, we can get drawings of fault trees which is easy to see, efficiently. (author)

  7. Cafts: computer aided fault tree analysis

    International Nuclear Information System (INIS)

    Poucet, A.

    1985-01-01

    The fault tree technique has become a standard tool for the analysis of safety and reliability of complex system. In spite of the costs, which may be high for a complete and detailed analysis of a complex plant, the fault tree technique is popular and its benefits are fully recognized. Due to this applications of these codes have mostly been restricted to simple academic examples and rarely concern complex, real world systems. In this paper an interactive approach to fault tree construction is presented. The aim is not to replace the analyst, but to offer him an intelligent tool which can assist him in modeling complex systems. Using the CAFTS-method, the analyst interactively constructs a fault tree in two phases: (1) In a first phase he generates an overall failure logic structure of the system; the macrofault tree. In this phase, CAFTS features an expert system approach to assist the analyst. It makes use of a knowledge base containing generic rules on the behavior of subsystems and components; (2) In a second phase the macrofault tree is further refined and transformed in a fully detailed and quantified fault tree. In this phase a library of plant-specific component failure models is used

  8. Decision Tree Technique for Particle Identification

    International Nuclear Information System (INIS)

    Quiller, Ryan

    2003-01-01

    Particle identification based on measurements such as the Cerenkov angle, momentum, and the rate of energy loss per unit distance (-dE/dx) is fundamental to the BaBar detector for particle physics experiments. It is particularly important to separate the charged forms of kaons and pions. Currently, the Neural Net, an algorithm based on mapping input variables to an output variable using hidden variables as intermediaries, is one of the primary tools used for identification. In this study, a decision tree classification technique implemented in the computer program, CART, was investigated and compared to the Neural Net over the range of momenta, 0.25 GeV/c to 5.0 GeV/c. For a given subinterval of momentum, three decision trees were made using different sets of input variables. The sensitivity and specificity were calculated for varying kaon acceptance thresholds. This data was used to plot Receiver Operating Characteristic curves (ROC curves) to compare the performance of the classification methods. Also, input variables used in constructing the decision trees were analyzed. It was found that the Neural Net was a significant contributor to decision trees using dE/dx and the Cerenkov angle as inputs. Furthermore, the Neural Net had poorer performance than the decision tree technique, but tended to improve decision tree performance when used as an input variable. These results suggest that the decision tree technique using Neural Net input may possibly increase accuracy of particle identification in BaBar

  9. Reconciliation of Gene and Species Trees

    Directory of Open Access Journals (Sweden)

    L. Y. Rusin

    2014-01-01

    Full Text Available The first part of the paper briefly overviews the problem of gene and species trees reconciliation with the focus on defining and algorithmic construction of the evolutionary scenario. Basic ideas are discussed for the aspects of mapping definitions, costs of the mapping and evolutionary scenario, imposing time scales on a scenario, incorporating horizontal gene transfers, binarization and reconciliation of polytomous trees, and construction of species trees and scenarios. The review does not intend to cover the vast diversity of literature published on these subjects. Instead, the authors strived to overview the problem of the evolutionary scenario as a central concept in many areas of evolutionary research. The second part provides detailed mathematical proofs for the solutions of two problems: (i inferring a gene evolution along a species tree accounting for various types of evolutionary events and (ii trees reconciliation into a single species tree when only gene duplications and losses are allowed. All proposed algorithms have a cubic time complexity and are mathematically proved to find exact solutions. Solving algorithms for problem (ii can be naturally extended to incorporate horizontal transfers, other evolutionary events, and time scales on the species tree.

  10. Urban tree effects on soil organic carbon.

    Directory of Open Access Journals (Sweden)

    Jill L Edmondson

    Full Text Available Urban trees sequester carbon into biomass and provide many ecosystem service benefits aboveground leading to worldwide tree planting schemes. Since soils hold ∼75% of ecosystem organic carbon, understanding the effect of urban trees on soil organic carbon (SOC and soil properties that underpin belowground ecosystem services is vital. We use an observational study to investigate effects of three important tree genera and mixed-species woodlands on soil properties (to 1 m depth compared to adjacent urban grasslands. Aboveground biomass and belowground ecosystem service provision by urban trees are found not to be directly coupled. Indeed, SOC enhancement relative to urban grasslands is genus-specific being highest under Fraxinus excelsior and Acer spp., but similar to grasslands under Quercus robur and mixed woodland. Tree cover type does not influence soil bulk density or C∶N ratio, properties which indicate the ability of soils to provide regulating ecosystem services such as nutrient cycling and flood mitigation. The trends observed in this study suggest that genus selection is important to maximise long-term SOC storage under urban trees, but emerging threats from genus-specific pathogens must also be considered.

  11. Nodal distances for rooted phylogenetic trees.

    Science.gov (United States)

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

    2010-08-01

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

  12. Topological and categorical properties of binary trees

    Directory of Open Access Journals (Sweden)

    H. Pajoohesh

    2008-04-01

    Full Text Available Binary trees are very useful tools in computer science for estimating the running time of so-called comparison based algorithms, algorithms in which every action is ultimately based on a prior comparison between two elements. For two given algorithms A and B where the decision tree of A is more balanced than that of B, it is known that the average and worst case times of A will be better than those of B, i.e., ₸A(n ≤₸B(n and TWA (n≤TWB (n. Thus the most balanced and the most imbalanced binary trees play a main role. Here we consider them as semilattices and characterize the most balanced and the most imbalanced binary trees by topological and categorical properties. Also we define the composition of binary trees as a commutative binary operation, *, such that for binary trees A and B, A * B is the binary tree obtained by attaching a copy of B to any leaf of A. We show that (T,* is a commutative po-monoid and investigate its properties.

  13. 14C concentrations in tree stems, 1

    International Nuclear Information System (INIS)

    Kikata, Yoji; Yonenobu, Hitoshi; Morishita, Fumio; Hattori, Yoshiaki; Marsoen, S.N.

    1993-01-01

    The 14 C concentrations in trees sampled at various latitudes were measured with a Tandetron Accelerator Mass Spectrometer at Nagoya University. The growing periods of the parts for 14 C measurements were estimated by the relationship between meteorological conditions and the appearance of anatomical features of annual rings such as false rings, latewood formation, and so on. The following results were obtained: 1. The latitude dependence of the 14 C variation is found in tree stems as well as in the atmosphere. 2. The 14 C concentrations in tree stems are almost equal to those in the atmosphere at the latitude where the tree had grown and at the time when the sampled section is formed. Therefore the 14 C concentrations in the atmosphere are estimated by those of the tree stems. 3. The time when the 14 C concentration in the tree showed its maximum value has difference of 1 - 2 years with that of the latitude where the tree had grown. 4. This phenomena seemed to be related closely with the mechanism of global mixing of 14 CO 2 produced by atmospheric nuclear weapon tests. This mechanism causes a time lag of 14 C variation between northern and southern hemisphere. (author)

  14. Human reliability analysis using event trees

    International Nuclear Information System (INIS)

    Heslinga, G.

    1983-01-01

    The shut-down procedure of a technologically complex installation as a nuclear power plant consists of a lot of human actions, some of which have to be performed several times. The procedure is regarded as a chain of modules of specific actions, some of which are analyzed separately. The analysis is carried out by making a Human Reliability Analysis event tree (HRA event tree) of each action, breaking down each action into small elementary steps. The application of event trees in human reliability analysis implies more difficulties than in the case of technical systems where event trees were mainly used until now. The most important reason is that the operator is able to recover a wrong performance; memory influences play a significant role. In this study these difficulties are dealt with theoretically. The following conclusions can be drawn: (1) in principle event trees may be used in human reliability analysis; (2) although in practice the operator will recover his fault partly, theoretically this can be described as starting the whole event tree again; (3) compact formulas have been derived, by which the probability of reaching a specific failure consequence on passing through the HRA event tree after several times of recovery is to be calculated. (orig.)

  15. Benefits of tree mixes in carbon plantings

    Science.gov (United States)

    Hulvey, Kristin B.; Hobbs, Richard J.; Standish, Rachel J.; Lindenmayer, David B.; Lach, Lori; Perring, Michael P.

    2013-10-01

    Increasingly governments and the private sector are using planted forests to offset carbon emissions. Few studies, however, examine how tree diversity -- defined here as species richness and/or stand composition -- affects carbon storage in these plantings. Using aboveground tree biomass as a proxy for carbon storage, we used meta-analysis to compare carbon storage in tree mixtures with monoculture plantings. Tree mixes stored at least as much carbon as monocultures consisting of the mixture's most productive species and at times outperformed monoculture plantings. In mixed-species stands, individual species, and in particular nitrogen-fixing trees, increased stand biomass. Further motivations for incorporating tree richness into planted forests include the contribution of diversity to total forest carbon-pool development, carbon-pool stability and the provision of extra ecosystem services. Our findings suggest a two-pronged strategy for designing carbon plantings including: (1) increased tree species richness; and (2) the addition of species that contribute to carbon storage and other target functions.

  16. Atmospheric carbon reduction by urban trees

    International Nuclear Information System (INIS)

    Nowak, D.J.

    1993-01-01

    Trees, because they sequester atmospheric carbon through their growth process and conserve energy in urban areas, have been suggested as one means to combat increasing levels of atmospheric carbon. Analysis of the urban forest in Oakland, California (21% tree cover), reveals a tree carbon storage level of 11·0 metric tons/hectare. Trees in the area of the 1991 fire in Oakland stored approximately 14,500 metric tons of carbon, 10% of the total amount stored by Oakland's urban forest. National urban forest carbon storage in the United States (28% tree cover) is estimated at between 350 and 750 million metric tons. Establishment of 10 million urban trees annually over the next 10 years is estimated to sequester and offset the production of 363 million metric tons of carbon over the next 50 years-less than 1% of the estimated carbon emissions in the United States over the same time period. Advantages and limitations of managing urban trees to reduce atmospheric carbon are discussed. 36 refs., 2 figs., 3 tabs

  17. Fruit load governs transpiration of olive trees.

    Science.gov (United States)

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

    2016-03-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. © The Author 2016. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

  18. Comprehensive decision tree models in bioinformatics.

    Directory of Open Access Journals (Sweden)

    Gregor Stiglic

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

  19. Comprehensive decision tree models in bioinformatics.

    Science.gov (United States)

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

    2012-01-01

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

  20. IcyTree: rapid browser-based visualization for phylogenetic trees and networks.

    Science.gov (United States)

    Vaughan, Timothy G

    2017-08-01

    IcyTree is an easy-to-use application which can be used to visualize a wide variety of phylogenetic trees and networks. While numerous phylogenetic tree viewers exist already, IcyTree distinguishes itself by being a purely online tool, having a responsive user interface, supporting phylogenetic networks (ancestral recombination graphs in particular), and efficiently drawing trees that include information such as ancestral locations or trait values. IcyTree also provides intuitive panning and zooming utilities that make exploring large phylogenetic trees of many thousands of taxa feasible. IcyTree is a web application and can be accessed directly at http://tgvaughan.github.com/icytree . Currently supported web browsers include Mozilla Firefox and Google Chrome. IcyTree is written entirely in client-side JavaScript (no plugin required) and, once loaded, does not require network access to run. IcyTree is free software, and the source code is made available at http://github.com/tgvaughan/icytree under version 3 of the GNU General Public License. tgvaughan@gmail.com. © The Author(s) 2017. Published by Oxford University Press.

  1. The ghosts of trees past: savanna trees create enduring legacies in plant species composition.

    Science.gov (United States)

    Stahlheber, Karen A; Crispin, Kimberly L; Anton, Cassidy; D'Antonio, Carla M

    2015-09-01

    Isolated trees in savannas worldwide are known to modify their local environment and interact directly with neighboring plants. Less is known about how related tree species differ in their impacts on surrounding communities, how the effects of trees vary between years, and how composition might change following loss of the tree. To address these knowledge gaps, we explored the following questions: How do savanna trees influence the surrounding composition of herbaceous plants? Is the influence of trees consistent across different species and years? How does this change following the death of the tree? We surveyed herbaceous species composition and environmental attributes surrounding living and dead evergreen and deciduous Quercus trees in California (USA) savannas across several years that differed in their total precipitation. Oak trees of all species created distinct, homogenous understory communities dominated by exotic grasses across several sites. The composition of the low-diversity understory communities showed less interannual variation than open grassland, despite a two-fold difference in precipitation between the driest and wettest year. Vegetation composition was correlated with variation in soil properties, which were strongly affected by trees. Oaks also influenced the communities beyond the edge of the crown, but this depended on site and oak species. Low-diversity understory communities persisted up to 43 years following the death of the tree. A gradual decline in the effect of trees on the physical, environment following death did not result in vegetation becoming more similar to open grassland over time. The presence of long-lasting legacies of past tree crowns highlights the difficulty of assigning control of the current distribution of herbaceous species in grassland to their contemporary environment.

  2. Using fuzzy arithmetic in containment event trees

    International Nuclear Information System (INIS)

    Rivera, S.S.; Baron, Jorge H.

    2000-01-01

    The use of fuzzy arithmetic is proposed for the evaluation of containment event trees. Concepts such as improbable, very improbable, and so on, which are subjective by nature, are represented by fuzzy numbers. The quantitative evaluation of containment event trees is based on the extension principle, by which operations on real numbers are extended to operations on fuzzy numbers. Expert knowledge is considered as state of the base variable with a normal distribution, which is considered to represent the membership function. Finally, this paper presents results of an example calculation of a containment event tree for the CAREM-25 nuclear power plant, presently under detailed design stage at Argentina. (author)

  3. 137Cs distribution in guava trees

    International Nuclear Information System (INIS)

    Mosquera, B.; Veiga, R.; Mangia, L.; Carvalho, C.; Estellita, L.; Uzeda, D.; Facure, A.; Violini, B.; Anjos, R.M.

    2004-01-01

    This paper presents results of 137 Cs concentration measured from a guava tree cultivated after the first decontamination work of one of the sites where the worst Brazilian radiological accident occurred. The present work aims to verify how the 137 Cs is transported and distributed along the tropical trees. Bi-dimensional analyses of the radial distribution of 137 Cs in the main trunk are also presented. Neither symmetrical nor homogeneous behaviors of the specific activity distribution in the tree rings were observed. (author)

  4. {sup 137}Cs distribution in guava trees

    Energy Technology Data Exchange (ETDEWEB)

    Mosquera, B.; Veiga, R.; Mangia, L.; Carvalho, C.; Estellita, L.; Uzeda, D.; Facure, A.; Violini, B.; Anjos, R.M. [Universidade Federal Fluminense, Niteroi, RJ (Brazil). Inst. de Fisica

    2004-09-15

    This paper presents results of {sup 137}Cs concentration measured from a guava tree cultivated after the first decontamination work of one of the sites where the worst Brazilian radiological accident occurred. The present work aims to verify how the {sup 137}Cs is transported and distributed along the tropical trees. Bi-dimensional analyses of the radial distribution of {sup 137}Cs in the main trunk are also presented. Neither symmetrical nor homogeneous behaviors of the specific activity distribution in the tree rings were observed. (author)

  5. Fault tree analysis for vital area identification

    International Nuclear Information System (INIS)

    Varnado, G.B.; Ortiz, N.R.

    1978-01-01

    This paper discusses the use of fault tree analysis to identify those areas of nuclear fuel cycle facilities which must be protected to prevent acts of sabotage that could lead to sifnificant release of radioactive material. By proper manipulation of the fault trees for a plant, an analyst can identify vital areas in a manner consistent with regulatory definitions. This paper discusses the general procedures used in the analysis of any nuclear facility. In addition, a structured, generic approach to the development of the fault trees for nuclear power reactors is presented along with selected results of the application of the generic approach to several plants

  6. Random tree growth by vertex splitting

    International Nuclear Information System (INIS)

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

    2009-01-01

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

  7. The decision tree approach to classification

    Science.gov (United States)

    Wu, C.; Landgrebe, D. A.; Swain, P. H.

    1975-01-01

    A class of multistage decision tree classifiers is proposed and studied relative to the classification of multispectral remotely sensed data. The decision tree classifiers are shown to have the potential for improving both the classification accuracy and the computation efficiency. Dimensionality in pattern recognition is discussed and two theorems on the lower bound of logic computation for multiclass classification are derived. The automatic or optimization approach is emphasized. Experimental results on real data are reported, which clearly demonstrate the usefulness of decision tree classifiers.

  8. IND - THE IND DECISION TREE PACKAGE

    Science.gov (United States)

    Buntine, W.

    1994-01-01

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

  9. Least Squares Methods for Equidistant Tree Reconstruction

    OpenAIRE

    Fahey, Conor; Hosten, Serkan; Krieger, Nathan; Timpe, Leslie

    2008-01-01

    UPGMA is a heuristic method identifying the least squares equidistant phylogenetic tree given empirical distance data among $n$ taxa. We study this classic algorithm using the geometry of the space of all equidistant trees with $n$ leaves, also known as the Bergman complex of the graphical matroid for the complete graph $K_n$. We show that UPGMA performs an orthogonal projection of the data onto a maximal cell of the Bergman complex. We also show that the equidistant tree with the least (Eucl...

  10. A review of pruning fruit trees

    Science.gov (United States)

    Zhang, L.; Koc, A. B.; Wang, X. N.; Jiang, Y. X.

    2018-05-01

    The focus of this review is to present the results of studies and articles about ways to prune fruit trees. Pruning should be done in late winter or early spring so that the infection risk can be significantly decreased. This review will also offer an overview of methods to prevent infections and speed up recovery on the trees. The following is an interpretation of why high-power ultrasonic assisted pruning in the fruits trees is needed and will elaborate on the efficiency, labor costs, and safety, as well as space, location, and some environmental issues.

  11. Algorithms for optimal dyadic decision trees

    Energy Technology Data Exchange (ETDEWEB)

    Hush, Don [Los Alamos National Laboratory; Porter, Reid [Los Alamos National Laboratory

    2009-01-01

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

  12. Diagnostic of dry rot in living trees

    International Nuclear Information System (INIS)

    Schaetzler, H.P.

    1978-01-01

    The γ-desorption method has been used in the early diagnosis of dry rot in trees. The attenuation of a 60 keV γ-beam ( 241 Am) has been measured on eleven healthy spruce disks. It is seen that early diagnostic of rotten trees is limited by natural density variation of the wood itself, but for a 95% confidence level that the wood is diseased, a tree must have an average of less than 0.59 g./cm 3 . (Auth/C.F.)

  13. Stratified B-trees and versioning dictionaries

    OpenAIRE

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

    2011-01-01

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

  14. Electroweak unification and tree unitarity

    International Nuclear Information System (INIS)

    Horejsi, J.

    1993-01-01

    The monograph is an unconventional introduction into the theory of unification of weak and electromagnetic interactions, which is conceptually different from the exposition presented in standard textbooks. A detailed explanation is given of the way to the standard model of electroweak interactions which is based on a straightforward application of the requirement of renormalizability of the perturbation series expansion. The procedure to derive the model is interesting as it demonstrates the necessity of introducing vector bosons and Yang-Mills type interactions and at least one elementary scalar boson to obtain a renormalizable theory of weak and electromagnetic interactions. The book is divided into 5 chapters: introduction, problems encountered in a Fermi type theory, the intermediate vector boson, electrodynamics of vector bosons, tree unitarity, and electroweak interactions. Each chapter is completed with exercise problems to be solved by the reader. The text is supplemented with a number of appendices. The monograph is aimed at undergraduate and postgraduate students as well as at physicists interested in the theory of elementary particles. (Z.J.)

  15. Heterogeneous Compression of Large Collections of Evolutionary Trees.

    Science.gov (United States)

    Matthews, Suzanne J

    2015-01-01

    Compressing heterogeneous collections of trees is an open problem in computational phylogenetics. In a heterogeneous tree collection, each tree can contain a unique set of taxa. An ideal compression method would allow for the efficient archival of large tree collections and enable scientists to identify common evolutionary relationships over disparate analyses. In this paper, we extend TreeZip to compress heterogeneous collections of trees. TreeZip is the most efficient algorithm for compressing homogeneous tree collections. To the best of our knowledge, no other domain-based compression algorithm exists for large heterogeneous tree collections or enable their rapid analysis. Our experimental results indicate that TreeZip averages 89.03 percent (72.69 percent) space savings on unweighted (weighted) collections of trees when the level of heterogeneity in a collection is moderate. The organization of the TRZ file allows for efficient computations over heterogeneous data. For example, consensus trees can be computed in mere seconds. Lastly, combining the TreeZip compressed (TRZ) file with general-purpose compression yields average space savings of 97.34 percent (81.43 percent) on unweighted (weighted) collections of trees. Our results lead us to believe that TreeZip will prove invaluable in the efficient archival of tree collections, and enables scientists to develop novel methods for relating heterogeneous collections of trees.

  16. Posbist fault tree analysis of coherent systems

    International Nuclear Information System (INIS)

    Huang, H.-Z.; Tong Xin; Zuo, Ming J.

    2004-01-01

    When the failure probability of a system is extremely small or necessary statistical data from the system is scarce, it is very difficult or impossible to evaluate its reliability and safety with conventional fault tree analysis (FTA) techniques. New techniques are needed to predict and diagnose such a system's failures and evaluate its reliability and safety. In this paper, we first provide a concise overview of FTA. Then, based on the posbist reliability theory, event failure behavior is characterized in the context of possibility measures and the structure function of the posbist fault tree of a coherent system is defined. In addition, we define the AND operator and the OR operator based on the minimal cut of a posbist fault tree. Finally, a model of posbist fault tree analysis (posbist FTA) of coherent systems is presented. The use of the model for quantitative analysis is demonstrated with a real-life safety system

  17. tree composition and distribution in federal university

    African Journals Online (AJOL)

    Tersor

    types. Data were analyzed using descriptive statistics. A total of 52 tree species in 48 ... the highest number of species, most of the species were juvenile species. ... sustainable use methods throughout Africa to ..... App. Biosc.67.5437-5448.

  18. Tree-grass interactions in savannas

    CSIR Research Space (South Africa)

    Scholes, RJ

    1997-01-01

    Full Text Available Savannas occur where trees and grasses interact to create a biome that is neither grassland nor forest. Woody and gramineous plants interact by many mechanisms, some negative (competition) and some positive (facilitation). The strength and sign...

  19. Multisites Coordination in Shared Multicast Trees

    National Research Council Canada - National Science Library

    Dommel, H-P; Garcia-Luna-Aceves, J. J

    1999-01-01

    .... The protocol supports Internet-wide coordination for large and highly interactive groupwork, relying on transmission of coordination directives between group members across a shared end-to-end multicast tree...

  20. Community assessment of tropical tree biomass

    DEFF Research Database (Denmark)

    Theilade, Ida; Rutishauser, Ervan; Poulsen, Michael K.

    2015-01-01

    Background REDD+ programs rely on accurate forest carbon monitoring. Several REDD+ projects have recently shown that local communities can monitor above ground biomass as well as external professionals, but at lower costs. However, the precision and accuracy of carbon monitoring conducted by local...... communities have rarely been assessed in the tropics. The aim of this study was to investigate different sources of error in tree biomass measurements conducted by community monitors and determine the effect on biomass estimates. Furthermore, we explored the potential of local ecological knowledge to assess...... measurement, with special attention given to large and odd-shaped trees. A better understanding of traditional classification systems and concepts is required for local tree identifications and wood density estimates to become useful in monitoring of biomass and tree diversity....

  1. Constructing phylogenetic trees using interacting pathways.

    Science.gov (United States)

    Wan, Peng; Che, Dongsheng

    2013-01-01

    Phylogenetic trees are used to represent evolutionary relationships among biological species or organisms. The construction of phylogenetic trees is based on the similarities or differences of their physical or genetic features. Traditional approaches of constructing phylogenetic trees mainly focus on physical features. The recent advancement of high-throughput technologies has led to accumulation of huge amounts of biological data, which in turn changed the way of biological studies in various aspects. In this paper, we report our approach of building phylogenetic trees using the information of interacting pathways. We have applied hierarchical clustering on two domains of organisms-eukaryotes and prokaryotes. Our preliminary results have shown the effectiveness of using the interacting pathways in revealing evolutionary relationships.

  2. Patterns of Storm Injury and Tree Response

    Science.gov (United States)

    Kevin Smith; Walter Shortle; Kenneth Dudzik

    2001-01-01

    The ice storm of January 1998 in the northeastern United States and adjacent Canada was an extreme example of severe weather that injures trees every year. Broken branches, split branch forks, and snapped stems are all examples of storm injury.

  3. RE-Powering’s Electronic Decision Tree

    Science.gov (United States)

    Developed by US EPA's RE-Powering America's Land Initiative, the RE-Powering Decision Trees tool guides interested parties through a process to screen sites for their suitability for solar photovoltaics or wind installations

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

  5. PRIA 3 Fee Determination Decision Tree

    Science.gov (United States)

    The PRIA 3 decision tree will help applicants requesting a pesticide registration or certain tolerance action to accurately identify the category of their application and the amount of the required fee before they submit the application.

  6. Steiner trees for fixed orientation metrics

    DEFF Research Database (Denmark)

    Brazil, Marcus; Zachariasen, Martin

    2009-01-01

    We consider the problem of constructing Steiner minimum trees for a metric defined by a polygonal unit circle (corresponding to s = 2 weighted legal orientations in the plane). A linear-time algorithm to enumerate all angle configurations for degree three Steiner points is given. We provide...... a simple proof that the angle configuration for a Steiner point extends to all Steiner points in a full Steiner minimum tree, such that at most six orientations suffice for edges in a full Steiner minimum tree. We show that the concept of canonical forms originally introduced for the uniform orientation...... metric generalises to the fixed orientation metric. Finally, we give an O(s n) time algorithm to compute a Steiner minimum tree for a given full Steiner topology with n terminal leaves....

  7. [Understory effects on overstory trees: A review.

    Science.gov (United States)

    Du, Zhong; Cai, Xiao Hu; Bao, Wei Kai; Chen, Huai; Pan, Hong Li

    2016-03-01

    Plant-plant interactions play a key role in regulating the composition and structure of communities and ecosystems. Studies of plant-plant interactions in forest ecosystems have traditionally concentrated on either tree-tree interactions or overstory species' impacts on understory plants. The possible effects of understory species on overstory trees have received less attention. We summarized the effects of understory species on soil physiological properties, soil fauna activities, leaf litter decomposition, and ecophysiology and growth of the overstory species. Then the effects of distur-bance on understory-overstory interactions were discussed. Finally, an ecophysiology-based concept model of understory effects on overstory trees was proposed. Understory removal experiments showed that the study area, overstory species age, soil fertility and understory species could significantly affect the understory-overstory interactions.

  8. Improving and Conserving Sahelian Fruits Trees

    DEFF Research Database (Denmark)

    Ouedraogo, Moussa

    Native Sahelian fruit trees are well known for their economic value and their nutritional importance for local populations. Their products are a source of income and a source of calories, vitamins, minerals and antioxidants, especially vital for children. Fruit trees are crucial for the people...... in West Africa Sahel during the food shortage period, lasting 6-8 months a year in this region. However, the availability of fruit trees is declining due to increased demographic pressure and climate variability (drought) that is occurring with increasing frequency and intensity. Besides compromising...... the availability of important resources for rural people, reduced abundance of target species can lead to loss of genetic variation within species, which again can reduce the capacity of trees and shrubs to adapt to environmental change and reduce the gain farmers can realize from selection. Parkia biglobosa...

  9. Fault tree analysis of a research reactor

    International Nuclear Information System (INIS)

    Hall, J.A.; O'Dacre, D.F.; Chenier, R.J.; Arbique, G.M.

    1986-08-01

    Fault Tree Analysis Techniques have been used to assess the safety system of the ZED-2 Research Reactor at the Chalk River Nuclear Laboratories. This turned out to be a strong test of the techniques involved. The resulting fault tree was large and because of inter-links in the system structure the tree was not modularized. In addition, comprehensive documentation was required. After a brief overview of the reactor and the analysis, this paper concentrates on the computer tools that made the job work. Two types of tools were needed; text editing and forms management capability for large volumes of component and system data, and the fault tree codes themselves. The solutions (and failures) are discussed along with the tools we are already developing for the next analysis

  10. Predicting Battle Outcomes with Classification Trees

    National Research Council Canada - National Science Library

    Coban, Muzaffer

    2001-01-01

    ... from the actual battlefield, The models built by using classification trees reveal that the objective variables alone cannot explain the outcome of battles, Relative factors, such as leadership, have deep...

  11. ORIGINAL ARTICLE Shade Tree Selection and Management ...

    African Journals Online (AJOL)

    wonde

    on their knowledge of the tree species attributes such as height, crown architecture, leaf size and ... foraging bees and Olea welwitschii (Knobl.) ..... reported in some Latin American countries ... to the introduced CBD-resistant genotypes.

  12. Dynamic travel time estimation using regression trees.

    Science.gov (United States)

    2008-10-01

    This report presents a methodology for travel time estimation by using regression trees. The dissemination of travel time information has become crucial for effective traffic management, especially under congested road conditions. In the absence of c...

  13. Solar and Wind Site Screening Decision Trees

    Science.gov (United States)

    EPA and NREL created a decision tree to guide state and local governments and other stakeholders through a process for screening sites for their suitability for future redevelopment with solar photovoltaic (PV) energy and wind energy.

  14. Environmental Fate of Emamectin Benzoate After Tree Micro Injection of Horse Chestnut Trees

    OpenAIRE

    Burkhard, Rene; Binz, Heinz; Roux, Christian A; Brunner, Matthias; Ruesch, Othmar; Wyss, Peter

    2014-01-01

    Emamectin benzoate, an insecticide derived from the avermectin family of natural products, has a unique translocation behavior in trees when applied by tree micro injection (TMI), which can result in protection from insect pests (foliar and borers) for several years. Active ingredient imported into leaves was measured at the end of season in the fallen leaves of treated horse chestnut (Aesculus hippocastanum) trees. The dissipation of emamectin benzoate in these leaves seems to be biphasic an...

  15. SILVA tree viewer: interactive web browsing of the SILVA phylogenetic guide trees

    OpenAIRE

    Beccati, Alan; Gerken, Jan; Quast, Christian; Yilmaz, Pelin; Glöckner, Frank Oliver

    2017-01-01

    Background Phylogenetic trees are an important tool to study the evolutionary relationships among organisms. The huge amount of available taxa poses difficulties in their interactive visualization. This hampers the interaction with the users to provide feedback for the further improvement of the taxonomic framework. Results The SILVA Tree Viewer is a web application designed for visualizing large phylogenetic trees without requiring the download of any software tool or data files. The SILVA T...

  16. Effects of nurse trees, spacing, and tree species on biomass production in mixed forest plantations

    DEFF Research Database (Denmark)

    Nord-Larsen, Thomas; Meilby, Henrik

    2016-01-01

    Growing concern about increasing concentrations of greenhouse gases in the atmosphere, and resulting global climate change, has spurred a growing demand for renewable energy. In this study, we hypothesized that a nurse tree crop may provide additional early yields of biomass for fuel, while...... was in most cases reduced due to competition. However, provided timely thinning of nurse trees, the qualitative development of the trees will allow for long-term timber production....

  17. Trees and networks before and after Darwin

    Directory of Open Access Journals (Sweden)

    Ragan Mark A

    2009-11-01

    Full Text Available Abstract It is well-known that Charles Darwin sketched abstract trees of relationship in his 1837 notebook, and depicted a tree in the Origin of Species (1859. Here I attempt to place Darwin's trees in historical context. By the mid-Eighteenth century the Great Chain of Being was increasingly seen to be an inadequate description of order in nature, and by about 1780 it had been largely abandoned without a satisfactory alternative having been agreed upon. In 1750 Donati described aquatic and terrestrial organisms as forming a network, and a few years later Buffon depicted a network of genealogical relationships among breeds of dogs. In 1764 Bonnet asked whether the Chain might actually branch at certain points, and in 1766 Pallas proposed that the gradations among organisms resemble a tree with a compound trunk, perhaps not unlike the tree of animal life later depicted by Eichwald. Other trees were presented by Augier in 1801 and by Lamarck in 1809 and 1815, the latter two assuming a transmutation of species over time. Elaborate networks of affinities among plants and among animals were depicted in the late Eighteenth and very early Nineteenth centuries. In the two decades immediately prior to 1837, so-called affinities and/or analogies among organisms were represented by diverse geometric figures. Series of plant and animal fossils in successive geological strata were represented as trees in a popular textbook from 1840, while in 1858 Bronn presented a system of animals, as evidenced by the fossil record, in a form of a tree. Darwin's 1859 tree and its subsequent elaborations by Haeckel came to be accepted in many but not all areas of biological sciences, while network diagrams were used in others. Beginning in the early 1960s trees were inferred from protein and nucleic acid sequences, but networks were re-introduced in the mid-1990s to represent lateral genetic transfer, increasingly regarded as a fundamental mode of evolution at least for

  18. Efficient chaining of seeds in ordered trees

    OpenAIRE

    Allali, Julien; Chauve, Cédric; Ferraro, Pascal; Gaillard, Anne-Laure

    2010-01-01

    International audience; We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent with respect to postfix order and ancestrality. This problem is a natural extension of a similar problem for sequences, and has applications in computational biology, such as mining a database of RNA secondary structures. For the chaining problem with a set of m constant size seeds, we describe...

  19. Transfer of radiocesium in the fruit tree

    International Nuclear Information System (INIS)

    Takata, Daisuke

    2013-01-01

    After Fukushima Nuclear Power Plant Accident (Mar. 2011), the author has investigated the transfer of radiocesium (rCs) mainly in peach trees under the actual and cultivating conditions in Fukushima and Tokyo areas, of which results are given with their discussion herein. There are 2 routes of the transfer through the root absorbing the soil rCs originally fallen on the ground and through the aboveground organs absorbing the directly attached rCs on them. The latter attachment includes one on the old branch and main stem existed before the Accident, and another, on the leaf, young shoot and fruit (pericarp) absent at the Accident. Experimental data of peach tree with/without a ground cover show that in the year of the Accident (2011), rCs transfer in the tree body through the aboveground organs was superior to that through the root, and this was also confirmed in the grape tree. Analysis with the imaging plate revealed that a quite high level of rCs was present in the outer thin layer of the bark and in the lenticel, which was conceived to be the possible route of transfer in the tree body. rCs levels on fresh organs like pericarp were lowered by rinsing, suggesting that the nuclide was movable on the old organs to be transferred in new ones. When the tree grown at the high dose area was dug up for its root to be rinsed and partly cut and then the tree was cultivated in non-contaminated soil, the newly shot root contained the higher level of rCs than the leaf, of which mechanism is under investigation. rCs transfer in the tree from the soil and space, and reverse distribution possibly occur: the both sides are to be further investigated qualitatively and quantitatively. (T.T.)

  20. Lateglacial environmental variability from Swiss tree rings

    DEFF Research Database (Denmark)

    Schaub, Matthias; Büntgen, Ulf; Kaiser, Klaus Felix

    2008-01-01

    Evidence of annually resolved environmental variations during the Allerød interstadial is presented using 81 fossil Scots pine tree-ring series from Gaenziloo and Landikon, near Zurich, Switzerland. The absolute age of the trees ranges between 11,920 and 10,610 14C BP, which was determined by wig...... and the gray-scale varve record from the Cariaco basin. Even though the amplitudes are not yet fully understood, similarities on decadal-to-centennial scales are apparent....

  1. Parallel object-oriented decision tree system

    Science.gov (United States)

    Kamath,; Chandrika, Cantu-Paz [Dublin, CA; Erick, [Oakland, CA

    2006-02-28

    A data mining decision tree system that uncovers patterns, associations, anomalies, and other statistically significant structures in data by reading and displaying data files, extracting relevant features for each of the objects, and using a method of recognizing patterns among the objects based upon object features through a decision tree that reads the data, sorts the data if necessary, determines the best manner to split the data into subsets according to some criterion, and splits the data.

  2. Genomics-assisted breeding in fruit trees

    OpenAIRE

    Iwata, Hiroyoshi; Minamikawa, Mai F.; Kajiya-Kanegae, Hiromi; Ishimori, Motoyuki; Hayashi, Takeshi

    2016-01-01

    Recent advancements in genomic analysis technologies have opened up new avenues to promote the efficiency of plant breeding. Novel genomics-based approaches for plant breeding and genetics research, such as genome-wide association studies (GWAS) and genomic selection (GS), are useful, especially in fruit tree breeding. The breeding of fruit trees is hindered by their long generation time, large plant size, long juvenile phase, and the necessity to wait for the physiological maturity of the pl...

  3. A Conceptual Tree of Laser Propulsion

    International Nuclear Information System (INIS)

    Pakhomov, Andrew V.; Sinko, John E.

    2008-01-01

    An original attempt to develop a conceptual tree for laser propulsion is offered. The tree provides a systematic view for practically all possible laser propulsion concepts and all inter-conceptual links, based on propellant phases and phase transfers. It also helps to see which fields of laser propulsion have been already thoroughly explored, where the next effort must be applied, and which paths should be taken with proper care or avoided entirely

  4. Current and potential tree locations in tree line ecotone of Changbai Mountains, Northeast China: the controlling effects of topography.

    Science.gov (United States)

    Zong, Shengwei; Wu, Zhengfang; Xu, Jiawei; Li, Ming; Gao, Xiaofeng; He, Hongshi; Du, Haibo; Wang, Lei

    2014-01-01

    Tree line ecotone in the Changbai Mountains has undergone large changes in the past decades. Tree locations show variations on the four sides of the mountains, especially on the northern and western sides, which has not been fully explained. Previous studies attributed such variations to the variations in temperature. However, in this study, we hypothesized that topographic controls were responsible for causing the variations in the tree locations in tree line ecotone of the Changbai Mountains. To test the hypothesis, we used IKONOS images and WorldView-1 image to identify the tree locations and developed a logistic regression model using topographical variables to identify the dominant controls of the tree locations. The results showed that aspect, wetness, and slope were dominant controls for tree locations on western side of the mountains, whereas altitude, SPI, and aspect were the dominant factors on northern side. The upmost altitude a tree can currently reach was 2140 m asl on the northern side and 2060 m asl on western side. The model predicted results showed that habitats above the current tree line on the both sides were available for trees. Tree recruitments under the current tree line may take advantage of the available habitats at higher elevations based on the current tree location. Our research confirmed the controlling effects of topography on the tree locations in the tree line ecotone of Changbai Mountains and suggested that it was essential to assess the tree response to topography in the research of tree line ecotone.

  5. MeshTree: A Delay optimised Overlay Multicast Tree Building Protocol

    OpenAIRE

    Tan, Su-Wei; Waters, A. Gill; Crawford, John

    2005-01-01

    We study decentralised low delay degree-constrained overlay multicast tree construction for single source real-time applications. This optimisation problem is NP-hard even if computed centrally. We identify two problems in traditional distributed solutions, namely the greedy problem and delay-cost trade-off. By offering solutions to these problems, we propose a new self-organising distributed tree building protocol called MeshTree. The main idea is to embed the delivery tree in a degree-bound...

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

    Directory of Open Access Journals (Sweden)

    Francisco José da Silva Neto

    2018-01-01

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

  7. Genomics-assisted breeding in fruit trees.

    Science.gov (United States)

    Iwata, Hiroyoshi; Minamikawa, Mai F; Kajiya-Kanegae, Hiromi; Ishimori, Motoyuki; Hayashi, Takeshi

    2016-01-01

    Recent advancements in genomic analysis technologies have opened up new avenues to promote the efficiency of plant breeding. Novel genomics-based approaches for plant breeding and genetics research, such as genome-wide association studies (GWAS) and genomic selection (GS), are useful, especially in fruit tree breeding. The breeding of fruit trees is hindered by their long generation time, large plant size, long juvenile phase, and the necessity to wait for the physiological maturity of the plant to assess the marketable product (fruit). In this article, we describe the potential of genomics-assisted breeding, which uses these novel genomics-based approaches, to break through these barriers in conventional fruit tree breeding. We first introduce the molecular marker systems and whole-genome sequence data that are available for fruit tree breeding. Next we introduce the statistical methods for biparental linkage and quantitative trait locus (QTL) mapping as well as GWAS and GS. We then review QTL mapping, GWAS, and GS studies conducted on fruit trees. We also review novel technologies for rapid generation advancement. Finally, we note the future prospects of genomics-assisted fruit tree breeding and problems that need to be overcome in the breeding.

  8. 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...... the search for the next pair of nodes to join, but di#er in the information stored in quad-tree nodes, the way the search is performed, and in the way the quad-tree is updated after a join. We empirically evaluate the performance of the heuristics on distance matrices obtained from the Pfam collection...... of alignments, and compare the running time with that of the QuickTree tool, a well-known and widely used implementation of the standard neighbour-joining method. The results show that the presented heuristics can give a significant speed-up over the standard neighbour-joining method, already for medium sized...

  9. Transforming phylogenetic networks: Moving beyond tree space.

    Science.gov (United States)

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

    2016-09-07

    Phylogenetic networks are a generalization of phylogenetic trees that are used to represent reticulate evolution. Unrooted phylogenetic networks form a special class of such networks, which naturally generalize unrooted phylogenetic trees. In this paper we define two operations on unrooted phylogenetic networks, one of which is a generalization of the well-known nearest-neighbor interchange (NNI) operation on phylogenetic trees. We show that any unrooted phylogenetic network can be transformed into any other such network using only these operations. This generalizes the well-known fact that any phylogenetic tree can be transformed into any other such tree using only NNI operations. It also allows us to define a generalization of tree space and to define some new metrics on unrooted phylogenetic networks. To prove our main results, we employ some fascinating new connections between phylogenetic networks and cubic graphs that we have recently discovered. Our results should be useful in developing new strategies to search for optimal phylogenetic networks, a topic that has recently generated some interest in the literature, as well as for providing new ways to compare networks. Copyright © 2016 Elsevier Ltd. All rights reserved.

  10. Tree-Based Unrooted Phylogenetic Networks.

    Science.gov (United States)

    Francis, A; Huber, K T; Moulton, V

    2018-02-01

    Phylogenetic networks are a generalization of phylogenetic trees that are used to represent non-tree-like evolutionary histories that arise in organisms such as plants and bacteria, or uncertainty in evolutionary histories. An unrooted phylogenetic network on a non-empty, finite set X of taxa, or network, is a connected, simple graph in which every vertex has degree 1 or 3 and whose leaf set is X. It is called a phylogenetic tree if the underlying graph is a tree. In this paper we consider properties of tree-based networks, that is, networks that can be constructed by adding edges into a phylogenetic tree. We show that although they have some properties in common with their rooted analogues which have recently drawn much attention in the literature, they have some striking differences in terms of both their structural and computational properties. We expect that our results could eventually have applications to, for example, detecting horizontal gene transfer or hybridization which are important factors in the evolution of many organisms.

  11. Cobalt accumulation and circulation by blackgum trees

    International Nuclear Information System (INIS)

    Thomas, W.A.

    1975-01-01

    Blackgum (Nyssa sylvatica Marsh.) trees accumulate far greater concentrations of cobalt in mature foliage than do other species on the same site (363 ppM in ash of blackgum, compared with about 3 ppM by mockernut hickory and about 1 ppM by red maple, tulip tree, and white oak). Cobalt concentrations in dormant woody tissues of blackgum also significantly exceed those in the other four species. Inoculation of six blackgums with 60 Co revealed that cobalt remains mobile in the trees for at least 3 years. Foliar concentrations of stable cobalt increase uniformly until senescence. In late August, foliage accounts for only 9 percent of total tree weight but 57 percent of total tree cobalt. Losses of cobalt from trees occur almost entirely by leaf abscission, and the loss rates of weight and cobalt from decomposing litter are similar. Retention of cobalt in the biologically active soil layers perpetuates zones of cobalt concentration created by this species in woodlands

  12. Tree structural and species diversities in Okwangwo Forest, Cross ...

    African Journals Online (AJOL)

    Tree species were grouped into abundance classes. A total of 125 tree species belonging to 36 families and 96 genera were recorded in the area with Margaleffs index of species richness of 2.2754. Most (99) of the tree species encountered were threatened/endangered, 23 species were rare with only 3 tree species ...

  13. In vitro propagation of katsura tree (Cercidiphyllum japonicum Sieb ...

    African Journals Online (AJOL)

    ajl5

    Katsura tree (Cercidiphyllum japonicum Sieb. Et Zucc) is a long-lived, deciduous, wind-pollinated tree with dimorphic leaves. It is valued as an ornamental or a shade tree for landscape and a commercially valuable tree. Conventional propagation through seeds and cutting is not sufficient to satisfy the progressive demand.

  14. Dissimilarity-based classification of anatomical tree structures

    DEFF Research Database (Denmark)

    Sørensen, Lauge; Lo, Pechin Chien Pau; Dirksen, Asger

    2011-01-01

    A novel method for classification of abnormality in anatomical tree structures is presented. A tree is classified based on direct comparisons with other trees in a dissimilarity-based classification scheme. The pair-wise dissimilarity measure between two trees is based on a linear assignment betw...

  15. Dissimilarity-based classification of anatomical tree structures

    DEFF Research Database (Denmark)

    Sørensen, Lauge Emil Borch Laurs; Lo, Pechin Chien Pau; Dirksen, Asger

    2011-01-01

    A novel method for classification of abnormality in anatomical tree structures is presented. A tree is classified based on direct comparisons with other trees in a dissimilarity-based classification scheme. The pair-wise dissimilarity measure between two trees is based on a linear assignment...

  16. Robust B+ -Tree-Based Indexing of Moving Objects

    DEFF Research Database (Denmark)

    Jensen, Christian Søndergaard; Tiesyte, Dalia; Tradisauskas, Nerius

    2006-01-01

    Bx-tree is based on the B+-tree and is relatively easy to integrate into an existing DBMS. However, the Bx-tree is sensitive to data skew. This paper proposes a new query processing algorithm for the Bx-tree that fully exploits the available data statistics to reduce the query enlargement...

  17. Los Angeles 1-Million tree canopy cover assessment

    Science.gov (United States)

    Gregory E. McPherson; James R. Simpson; Qingfu Xiao; Wu Chunxia

    2008-01-01

    The Million Trees LA initiative intends to chart a course for sustainable growth through planting and stewardship of trees. The purpose of this study was to measure Los Angeles's existing tree canopy cover (TCC), determine if space exists for 1 million additional trees, and estimate future benefits from the planting. High resolution QuickBird remote sensing data,...

  18. Urban tree mortality: a primer on demographic approaches

    Science.gov (United States)

    Lara A. Roman; John J. Battles; Joe R. McBride

    2016-01-01

    Realizing the benefits of tree planting programs depends on tree survival. Projections of urban forest ecosystem services and cost-benefit analyses are sensitive to assumptions about tree mortality rates. Long-term mortality data are needed to improve the accuracy of these models and optimize the public investment in tree planting. With more accurate population...

  19. West Virginia's big trees: setting the record straight

    Science.gov (United States)

    Melissa Thomas-Van Gundy; Robert. Whetsell

    2016-01-01

    People love big trees, people love to find big trees, and people love to find big trees in the place they call home. Having been suspicious for years, my coauthor and historian Rob Whetsell, approached me with a species identification challenge. There are several photographs of giant trees used by many people to illustrate the past forests of West Virginia,...

  20. Mimusops elengi L. (Bulletwood tree; Hindi: Bakul or Maulsari) of ...

    Indian Academy of Sciences (India)

    Mimusops elengi L. (Bulletwood tree; Hindi: Bakul or Maulsari) of Sapotaceae is a handsome evergreen tree with milky latex and tender vegetative parts covered with brown hairs. The tree is often cultivated in parks and as an avenue tree. The fascicled flowers are small, white and sweet-scented. The ovoid berries are ...

  1. Tree Hazards Recognition and Reduction in Recreation Sites

    Science.gov (United States)

    David W. Johnson

    1981-01-01

    Defective trees are potential hazards to people and property in recreation areas. Most reported tree failures within recreation sites in the Rocky Mountain Region occur in lodgepole pine. Defective root systems account for the greatest percentage of failures. External indicators of defects are used to identify trees that may fail. Some tree species, particularly aspen...

  2. Part 2: Conserving and Planting Trees at Development Sites

    Science.gov (United States)

    Karen Cappiella; Tom Schueler; Tiffany Wright

    2006-01-01

    This manual presents specific ways to enable developers, engineers or landscape architects to incorporate more trees into a development site. The proposed approach focuses on protecting existing trees, planting trees in storm water treatment practices, and planting trees in other open spaces at the development site. This manual introduces conceptual designs for storm...

  3. The importance of Ficus (Moraceae) trees for tropical forest restoration

    DEFF Research Database (Denmark)

    Cottee-Jones, H. Eden W.; Bajpai, Omesh; Chaudhary, Lal B.

    2016-01-01

    Forest restoration is an increasingly important tool to offset and indeed reverse global deforestation rates. One low cost strategy to accelerate forest recovery is conserving scattered native trees that persist across disturbed landscapes and which may act as seedling recruitment foci. Ficus trees...... restoration agents than other remnant trees in disturbed landscapes, and therefore the conservation of these trees should be prioritized....

  4. Succinct Representations of Binary Trees for Range Minimum Queries

    DEFF Research Database (Denmark)

    Davoodi, Pooya; Raman, Rajeev; Satti, Srinivasa

    2012-01-01

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

  5. "Growing trees backwards": Description of a stand reconstruction model

    Science.gov (United States)

    Jonathan D. Bakker; Andrew J. Sanchez Meador; Peter Z. Fule; David W. Huffman; Margaret M. Moore

    2008-01-01

    We describe an individual-tree model that uses contemporary measurements to "grow trees backward" and reconstruct past tree diameters and stand structure in ponderosa pine dominated stands of the Southwest. Model inputs are contemporary structural measurements of all snags, logs, stumps, and living trees, and radial growth measurements, if available. Key...

  6. Growing Greener Cities: A Tree-Planting Handbook.

    Science.gov (United States)

    Moll, Gary; Young, Stanley

    This step-by-step guide, developed by the Global ReLeaf organization, presents tree-planting advice and simple steps to organizing a successful community tree-planting and tree-care program. The text is divided into three parts. Part 1 introduces trees and discusses the role they play as components of the living urban environment. Distinctions are…

  7. Understanding Boswellia papyrifera tree secondary metabolites through bark spectral analysis

    NARCIS (Netherlands)

    Girma, A.; Skidmore, A.K.; Bie, de C.A.J.M.; Bongers, F.

    2015-01-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

  8. Legalization of Tree Doctor System and the Role of KSPP

    OpenAIRE

    Byeongjin Cha

    2017-01-01

    In December of 2016, ‘The Forest Protection Act’ was amended partly in The National Assembly and the socalled ‘Tree Doctor Act’ was promulgated. Tree Doctor Act will be enforced from June 28, 2018. Under the new Act, none other than ‘Tree Hospital’ can do disease and pest management work for trees in public living space. The only exclusive qualification for tree hospital is a ‘Tree Doctor’, the government registered license which is newly established by the Act. To become a tree doctor, he/sh...

  9. IMPACT OF Global Warming on Trees

    Energy Technology Data Exchange (ETDEWEB)

    Nasrullah Khan [COMSATS Institute of Information Technology, Islamabad (Pakistan); Naeem Abas [2Department of Electrical Engineering, University of Gujrat, Gujrat (Pakistan); Norman Mariun [University Putra Malaysia, Faculty of Engineering, UPM Serdang, Serdang (Malaysia)

    2008-09-30

    Trees store CO{sub 2}, drive food chain, produce oxygen and cause cooling effects through the transpiration process. However, increasing forests to cool the planet needs a lot of care regarding locations and types of trees. Initially it was thought that the city trees fight climate change but later it was found that only tropical trees do the best. Ozone absorption in soil affects its natural carbon sequestration capability. Interaction of plants and soil with changing atmosphere and climate is very complex and not yet understood. Some crops like cotton, wheat and rice are more productive in elevated CO{sub 2} but their response at high temperatures needs further studies (GWDTR, 1997-2007; ITGW, 1990-2008). Use of CO{sub 2} as input raw material in fuel cells might be a revolutionary innovation but there is a long way to go ahead. At this moment we can only start energy education to cope up the time to come. On average CO{sub 2} concentration has been increasing at rate of 2.25ppm/yr from 2004 to 2008 but later from 2007 to 2008 it has been found increasing exponentially at rate of 4ppm/yr. It continues to increase at this rate even after oil peaking then it might exceed 500ppm by 2040-2050. CO{sub 2} concentration in atmosphere was 280 ppm before industrial revolution and in last few centuries it has increased to 385 ppm at an average annual rate of 2 ppm. Weeds normally show poor response to high CO{sub 2} concentrations but crops, fruits and vegetables flourish well. Previous draught cycle was only three years long but recent draught cycle is much longer than earlier (IGWT, 1997-2008). However, few trees in the same constellation are still quite healthy and alive. Some trees were seen dead even close to water canals. Based on literature review and observations recorded in this study it is concluded that high CO{sub 2} induced heat wave (global warming) is responsible for helping beetles and wood ants to eat trees roots and stem to kill them by starvation. The

  10. Why do trees die? Characterizing the drivers of background tree mortality

    Science.gov (United States)

    Das, Adrian J.; Stephenson, Nathan L.; Davis, Kristin P.

    2016-01-01

    The drivers of background tree mortality rates—the typical low rates of tree mortality found in forests in the absence of acute stresses like drought—are central to our understanding of forest dynamics, the effects of ongoing environmental changes on forests, and the causes and consequences of geographical gradients in the nature and strength of biotic interactions. To shed light on factors contributing to background tree mortality, we analyzed detailed pathological data from 200,668 tree-years of observation and 3,729 individual tree deaths, recorded over a 13-yr period in a network of old-growth forest plots in California's Sierra Nevada mountain range. We found that: (1) Biotic mortality factors (mostly insects and pathogens) dominated (58%), particularly in larger trees (86%). Bark beetles were the most prevalent (40%), even though there were no outbreaks during the study period; in contrast, the contribution of defoliators was negligible. (2) Relative occurrences of broad classes of mortality factors (biotic, 58%; suppression, 51%; and mechanical, 25%) are similar among tree taxa, but may vary with tree size and growth rate. (3) We found little evidence of distinct groups of mortality factors that predictably occur together on trees. Our results have at least three sets of implications. First, rather than being driven by abiotic factors such as lightning or windstorms, the “ambient” or “random” background mortality that many forest models presume to be independent of tree growth rate is instead dominated by biotic agents of tree mortality, with potentially critical implications for forecasting future mortality. Mechanistic models of background mortality, even for healthy, rapidly growing trees, must therefore include the insects and pathogens that kill trees. Second, the biotic agents of tree mortality, instead of occurring in a few predictable combinations, may generally act opportunistically and with a relatively large degree of independence from

  11. Beyond Tree Throw: Wind, Water, Rock and the Mechanics of Tree-Driven Bedrock Physical Weathering

    Science.gov (United States)

    Marshall, J. A.; Anderson, R. S.; Dawson, T. E.; Dietrich, W. E.; Minear, J. T.

    2017-12-01

    Tree throw is often invoked as the dominant process in converting bedrock to soil and thus helping to build the Critical Zone (CZ). In addition, observations of tree roots lifting sidewalk slabs, occupying cracks, and prying slabs of rock from cliff faces have led to a general belief in the power of plant growth forces. These common observations have led to conceptual models with trees at the center of the soil genesis process. This is despite the observation that tree throw is rare in many forested settings, and a dearth of field measurements that quantify the magnitude of growth forces. While few trees blow down, every tree grows roots, inserting many tens of percent of its mass below ground. Yet we lack data quantifying the role of trees in both damaging bedrock and detaching it (and thus producing soil). By combing force measurements at the tree-bedrock interface with precipitation, solar radiation, wind speed, and wind-driven tree sway data we quantified the magnitude and frequency of tree-driven soil-production mechanisms from two contrasting climatic and lithologic regimes (Boulder and Eel Creek CZ Observatories). Preliminary data suggests that in settings with relatively thin soils, trees can damage and detach rock due to diurnal fluctuations, wind response and rainfall events. Surprisingly, our data suggests that forces from roots and trunks growing against bedrock are insufficient to pry rock apart or damage bedrock although much more work is needed in this area. The frequency, magnitude and style of wind-driven tree forces at the bedrock interface varies considerably from one to another species. This suggests that tree properties such as mass, elasticity, stiffness and branch structure determine whether trees respond to gusts big or small, move at the same frequency as large wind gusts, or are able to self-dampen near-ground sway response to extended wind forces. Our measurements of precipitation-driven and daily fluctuations in root pressures exerted on

  12. A support vector machine based test for incongruence between sets of trees in tree space

    Science.gov (United States)

    2012-01-01

    Background The increased use of multi-locus data sets for phylogenetic reconstruction has increased the need to determine whether a set of gene trees significantly deviate from the phylogenetic patterns of other genes. Such unusual gene trees may have been influenced by other evolutionary processes such as selection, gene duplication, or horizontal gene transfer. Results Motivated by this problem we propose a nonparametric goodness-of-fit test for two empirical distributions of gene trees, and we developed the software GeneOut to estimate a p-value for the test. Our approach maps trees into a multi-dimensional vector space and then applies support vector machines (SVMs) to measure the separation between two sets of pre-defined trees. We use a permutation test to assess the significance of the SVM separation. To demonstrate the performance of GeneOut, we applied it to the comparison of gene trees simulated within different species trees across a range of species tree depths. Applied directly to sets of simulated gene trees with large sample sizes, GeneOut was able to detect very small differences between two set of gene trees generated under different species trees. Our statistical test can also include tree reconstruction into its test framework through a variety of phylogenetic optimality criteria. When applied to DNA sequence data simulated from different sets of gene trees, results in the form of receiver operating characteristic (ROC) curves indicated that GeneOut performed well in the detection of differences between sets of trees with different distributions in a multi-dimensional space. Furthermore, it controlled false positive and false negative rates very well, indicating a high degree of accuracy. Conclusions The non-parametric nature of our statistical test provides fast and efficient analyses, and makes it an applicable test for any scenario where evolutionary or other factors can lead to trees with different multi-dimensional distributions. The

  13. TreeRipper web application: towards a fully automated optical tree recognition software

    Directory of Open Access Journals (Sweden)

    Hughes Joseph

    2011-05-01

    Full Text Available Abstract Background Relationships between species, genes and genomes have been printed as trees for over a century. Whilst this may have been the best format for exchanging and sharing phylogenetic hypotheses during the 20th century, the worldwide web now provides faster and automated ways of transferring and sharing phylogenetic knowledge. However, novel software is needed to defrost these published phylogenies for the 21st century. Results TreeRipper is a simple website for the fully-automated recognition of multifurcating phylogenetic trees (http://linnaeus.zoology.gla.ac.uk/~jhughes/treeripper/. The program accepts a range of input image formats (PNG, JPG/JPEG or GIF. The underlying command line c++ program follows a number of cleaning steps to detect lines, remove node labels, patch-up broken lines and corners and detect line edges. The edge contour is then determined to detect the branch length, tip label positions and the topology of the tree. Optical Character Recognition (OCR is used to convert the tip labels into text with the freely available tesseract-ocr software. 32% of images meeting the prerequisites for TreeRipper were successfully recognised, the largest tree had 115 leaves. Conclusions Despite the diversity of ways phylogenies have been illustrated making the design of a fully automated tree recognition software difficult, TreeRipper is a step towards automating the digitization of past phylogenies. We also provide a dataset of 100 tree images and associated tree files for training and/or benchmarking future software. TreeRipper is an open source project licensed under the GNU General Public Licence v3.

  14. Improved prediction of hardwood tree biomass derived from wood density estimates and form factors for whole trees

    Science.gov (United States)

    David W. MacFarlane; Neil R. Ver Planck

    2012-01-01

    Data from hardwood trees in Michigan were analyzed to investigate how differences in whole-tree form and wood density between trees of different stem diameter relate to residual error in standard-type biomass equations. The results suggested that whole-tree wood density, measured at breast height, explained a significant proportion of residual error in standard-type...

  15. Forest Management Intensity Affects Aquatic Communities in Artificial Tree Holes.

    Science.gov (United States)

    Petermann, Jana S; Rohland, Anja; Sichardt, Nora; Lade, Peggy; Guidetti, Brenda; Weisser, Wolfgang W; Gossner, Martin M

    2016-01-01

    Forest management could potentially affect organisms in all forest habitats. However, aquatic communities in water-filled tree-holes may be especially sensitive because of small population sizes, the risk of drought and potential dispersal limitation. We set up artificial tree holes in forest stands subject to different management intensities in two regions in Germany and assessed the influence of local environmental properties (tree-hole opening type, tree diameter, water volume and water temperature) as well as regional drivers (forest management intensity, tree-hole density) on tree-hole insect communities (not considering other organisms such as nematodes or rotifers), detritus content, oxygen and nutrient concentrations. In addition, we compared data from artificial tree holes with data from natural tree holes in the same area to evaluate the methodological approach of using tree-hole analogues. We found that forest management had strong effects on communities in artificial tree holes in both regions and across the season. Abundance and species richness declined, community composition shifted and detritus content declined with increasing forest management intensity. Environmental variables, such as tree-hole density and tree diameter partly explained these changes. However, dispersal limitation, indicated by effects of tree-hole density, generally showed rather weak impacts on communities. Artificial tree holes had higher water temperatures (on average 2°C higher) and oxygen concentrations (on average 25% higher) than natural tree holes. The abundance of organisms was higher but species richness was lower in artificial tree holes. Community composition differed between artificial and natural tree holes. Negative management effects were detectable in both tree-hole systems, despite their abiotic and biotic differences. Our results indicate that forest management has substantial and pervasive effects on tree-hole communities and may alter their structure and

  16. Urban trees and forests of the Chicago region

    Science.gov (United States)

    David J. Nowak; Robert E. III Hoehn; Allison R. Bodine; Daniel E. Crane; John F. Dwyer; Veta Bonnewell; Gary Watson

    2013-01-01

    An analysis of trees in the Chicago region of Illinois reveals that this area has about 157,142,000 trees with tree and shrub canopy that covers 21.0 percent of the region. The most common tree species are European buckthorn, green ash, boxelder, black cherry, and American elm. Trees in the Chicago region currently store about 16.9 million tons of carbon (61.9 million...

  17. Tree health and physiology in a changing environment

    Science.gov (United States)

    Walter C. Shortle; Kevin T. Smith; Rakesh Minocha; Subhash Minocha; Philip M. Wargo; Kristina A. Vogt

    2000-01-01

    A tree is a large, long-lived, perennial, compartmented, woody, shedding, walling plant. This definition is based on new tree biology concepts (Shigo, 1986a,b, 1991) and explains much about how mature trees function through their unique structure. When the tree begins its life, it is mostly leaf in mass (Fig. 7.la). As a tree grows in stature, it becomes mostly stem in...

  18. Univariate decision tree induction using maximum margin classification

    OpenAIRE

    Yıldız, Olcay Taner

    2012-01-01

    In many pattern recognition applications, first decision trees are used due to their simplicity and easily interpretable nature. In this paper, we propose a new decision tree learning algorithm called univariate margin tree where, for each continuous attribute, the best split is found using convex optimization. Our simulation results on 47 data sets show that the novel margin tree classifier performs at least as good as C4.5 and linear discriminant tree (LDT) with a similar time complexity. F...

  19. Benefits and costs of street trees in Lisbon

    Science.gov (United States)

    A.L. Soares; F.C. Rego; E.G. McPherson; J.R. Simpson; P.J. Peper; Q. Xiao

    2011-01-01

    It is well known that urban trees produce various types of benefits and costs. The computer tool i-Tree STRATUM helps quantify tree structure and function, as well as the value of some of these tree services in different municipalities. This study describes one of the first applications of STRATUM outside the U.S. Lisbon’s street trees are dominated by Celtis australis...

  20. Expressive Power of Tree and String Based Wrappers

    OpenAIRE

    Ikeda, Daisuke; Yamada, Yasuhiro; Hirokawa, Sachio

    2003-01-01

    There exist two types of wrappers: the string based wrapper such as the LR wrapper, and the tree based wrapper. A tree based wrapper designates extraction regions by nodes on the trees of semistructured documents. The tree based wrapper seems to be more powerful than the string based one. There exist, however, manyHTML documents on the Web such that a standard tree based wrapper fails to extract contents because they are structured by presentational tags, punctuation symbols, and white spaces...

  1. Stock Picking via Nonsymmetrically Pruned Binary Decision Trees

    OpenAIRE

    Anton Andriyashin

    2008-01-01

    Stock picking is the field of financial analysis that is of particular interest for many professional investors and researchers. In this study stock picking is implemented via binary classification trees. Optimal tree size is believed to be the crucial factor in forecasting performance of the trees. While there exists a standard method of tree pruning, which is based on the cost-complexity tradeoff and used in the majority of studies employing binary decision trees, this paper introduces a no...

  2. Preliminary hazard analysis using sequence tree method

    International Nuclear Information System (INIS)

    Huang Huiwen; Shih Chunkuan; Hung Hungchih; Chen Minghuei; Yih Swu; Lin Jiinming

    2007-01-01

    A system level PHA using sequence tree method was developed to perform Safety Related digital I and C system SSA. The conventional PHA is a brainstorming session among experts on various portions of the system to identify hazards through discussions. However, this conventional PHA is not a systematic technique, the analysis results strongly depend on the experts' subjective opinions. The analysis quality cannot be appropriately controlled. Thereby, this research developed a system level sequence tree based PHA, which can clarify the relationship among the major digital I and C systems. Two major phases are included in this sequence tree based technique. The first phase uses a table to analyze each event in SAR Chapter 15 for a specific safety related I and C system, such as RPS. The second phase uses sequence tree to recognize what I and C systems are involved in the event, how the safety related systems work, and how the backup systems can be activated to mitigate the consequence if the primary safety systems fail. In the sequence tree, the defense-in-depth echelons, including Control echelon, Reactor trip echelon, ESFAS echelon, and Indication and display echelon, are arranged to construct the sequence tree structure. All the related I and C systems, include digital system and the analog back-up systems are allocated in their specific echelon. By this system centric sequence tree based analysis, not only preliminary hazard can be identified systematically, the vulnerability of the nuclear power plant can also be recognized. Therefore, an effective simplified D3 evaluation can be performed as well. (author)

  3. The effect of contaminated groundwater on tree growth: A tree-ring analysis

    International Nuclear Information System (INIS)

    LeBlanc, D.C.; Loehle, C.

    1990-10-01

    A study was conducted on the effect of contaminated groundwater seepage on tree growth downslope from F- and H-Area seepage basins of the Savannah River Site. Trees in wetlands along Four Mile Creek began to show localized stress and mortality in the late 1970s. Extreme winter temperatures and high rainfall were ruled out as potential causal factors of tree stress. Drought was shown to affect trees in both contaminated and uncontaminated zones, but trees in uncontaminated areas exhibit better recovery after drought than trees in contaminated areas. Pollution-mediated alteration of soil acidity and aluminum, sodium, and heavy metal concentrations likely acted to predispose trees to decline, with severe drought acting as the trigger for decline initiation and tree death. Thus, a moderate pollution loading, not sufficient to cause visible damage of itself, may create conditions in which sudden, severe decline could result from natural stresses. This mechanism of forest decline is common, and should be considered in evaluations of the impact of pollution on wetland forest systems. 28 refs., 4 figs., 6 tabs

  4. EAB induced tree mortality impacts ecosystem respiration and tree water use in an experimental forest

    Science.gov (United States)

    Charles E. Flower; Douglas J. Lynch; Kathleen S. Knight; Miquel A. Gonzales-Meler

    2011-01-01

    The invasive emerald ash borer (Agrilus planipennis Fairmaire, EAB) has been spreading across the forest landscape of the Midwest resulting in the rapid decline of ash trees (Fraxinus spp.). Ash trees represent a dominant riparian species in temperate deciduous forests of the Eastern United States (USDA FIA Database). Prior...

  5. Above- and belowground responses to tree thinning depend on the treatment of tree debris

    Science.gov (United States)

    Suzanne M. Owen; Carolyn Hull Sieg; Catherine A. Gehring; Matthew A. Bowker

    2009-01-01

    Mechanical mastication is increasingly prescribed for wildfire mitigation, yet little is known about the ecological impacts of this fuels treatment. Mastication shreds trees into woodchips as an alternative to tree thinning and burning the resulting slash, which can create soil disturbances that favor exotic plants. Previous research on mastication has not...

  6. SILVA tree viewer: interactive web browsing of the SILVA phylogenetic guide trees.

    Science.gov (United States)

    Beccati, Alan; Gerken, Jan; Quast, Christian; Yilmaz, Pelin; Glöckner, Frank Oliver

    2017-09-30

    Phylogenetic trees are an important tool to study the evolutionary relationships among organisms. The huge amount of available taxa poses difficulties in their interactive visualization. This hampers the interaction with the users to provide feedback for the further improvement of the taxonomic framework. The SILVA Tree Viewer is a web application designed for visualizing large phylogenetic trees without requiring the download of any software tool or data files. The SILVA Tree Viewer is based on Web Geographic Information Systems (Web-GIS) technology with a PostgreSQL backend. It enables zoom and pan functionalities similar to Google Maps. The SILVA Tree Viewer enables access to two phylogenetic (guide) trees provided by the SILVA database: the SSU Ref NR99 inferred from high-quality, full-length small subunit sequences, clustered at 99% sequence identity and the LSU Ref inferred from high-quality, full-length large subunit sequences. The Tree Viewer provides tree navigation, search and browse tools as well as an interactive feedback system to collect any kinds of requests ranging from taxonomy to data curation and improving the tool itself.

  7. Legacy tree data: A national database of detailed tree measurements for volume, weight, and physical properties

    Science.gov (United States)

    P.J. Radtke; D.M. Walker; A.R. Weiskittel; J. Frank; J.W. Coulston; J.A. Westfall

    2015-01-01

    Forest mensurationists in the United States have expended considerable effort over the past century making detailed observations of trees’ dimensions. In recent decades efforts have focused increasingly on weights and physical properties. Work is underway to compile original measurements from past volume, taper, and weight or biomass studies for North American tree...

  8. Interspecific variation in tree seedlings establishment in canopy gaps in relation to tree density

    Energy Technology Data Exchange (ETDEWEB)

    Reader, R.J.; Bonser, S.P.; Duralia, T.E.; Bricker, B.D. [Guelph Univ., ON (Canada). Dept. of Botany

    1995-10-01

    We tested whether interspecific variation in tree seedling establishment in canopy gaps was significantly related to interspecific variation in tree density, for seven deciduous forest tree species (Quercus alba, Hamamelis virginiana, Acer rubrum, Sassafras albidum, Quercus rubra, Prunus serotina, Ostrya virginiana). For each species, seedling establishment was calculated as the difference in seedling density before experimental gap creation versus three years after gap creation. In each of the six experimentally-created gap types (33% or 66% removal of tree basal area from 0.01ha, 0.05ha or 0.20ha patches), differences in seedling establishment among species were significantly related to differences in their density in the tree canopy. A regression model with log{sub e} tree density as the independent variable accounted for between 93% and 98% of interspecific variation in seedling establishment. Our results provide empirical support for models of tree dynamics in gaps that assume seedling establishment depends on canopy tree density. 17 refs, 1 fig, 3 tabs

  9. Up in the tree--the overlooked richness of bryophytes and lichens in tree crowns.

    Directory of Open Access Journals (Sweden)

    Steffen Boch

    Full Text Available Assessing diversity is among the major tasks in ecology and conservation science. In ecological and conservation studies, epiphytic cryptogams are usually sampled up to accessible heights in forests. Thus, their diversity, especially of canopy specialists, likely is underestimated. If the proportion of those species differs among forest types, plot-based diversity assessments are biased and may result in misleading conservation recommendations. We sampled bryophytes and lichens in 30 forest plots of 20 m × 20 m in three German regions, considering all substrates, and including epiphytic litter fall. First, the sampling of epiphytic species was restricted to the lower 2 m of trees and shrubs. Then, on one representative tree per plot, we additionally recorded epiphytic species in the crown, using tree climbing techniques. Per tree, on average 54% of lichen and 20% of bryophyte species were overlooked if the crown was not been included. After sampling all substrates per plot, including the bark of all shrubs and trees, still 38% of the lichen and 4% of the bryophyte species were overlooked if the tree crown of the sampled tree was not included. The number of overlooked lichen species varied strongly among regions. Furthermore, the number of overlooked bryophyte and lichen species per plot was higher in European beech than in coniferous stands and increased with increasing diameter at breast height of the sampled tree. Thus, our results indicate a bias of comparative studies which might have led to misleading conservation recommendations of plot-based diversity assessments.

  10. Up in the Tree – The Overlooked Richness of Bryophytes and Lichens in Tree Crowns

    Science.gov (United States)

    Boch, Steffen; Müller, Jörg; Prati, Daniel; Blaser, Stefan; Fischer, Markus

    2013-01-01

    Assessing diversity is among the major tasks in ecology and conservation science. In ecological and conservation studies, epiphytic cryptogams are usually sampled up to accessible heights in forests. Thus, their diversity, especially of canopy specialists, likely is underestimated. If the proportion of those species differs among forest types, plot-based diversity assessments are biased and may result in misleading conservation recommendations. We sampled bryophytes and lichens in 30 forest plots of 20 m × 20 m in three German regions, considering all substrates, and including epiphytic litter fall. First, the sampling of epiphytic species was restricted to the lower 2 m of trees and shrubs. Then, on one representative tree per plot, we additionally recorded epiphytic species in the crown, using tree climbing techniques. Per tree, on average 54% of lichen and 20% of bryophyte species were overlooked if the crown was not been included. After sampling all substrates per plot, including the bark of all shrubs and trees, still 38% of the lichen and 4% of the bryophyte species were overlooked if the tree crown of the sampled tree was not included. The number of overlooked lichen species varied strongly among regions. Furthermore, the number of overlooked bryophyte and lichen species per plot was higher in European beech than in coniferous stands and increased with increasing diameter at breast height of the sampled tree. Thus, our results indicate a bias of comparative studies which might have led to misleading conservation recommendations of plot-based diversity assessments. PMID:24358373

  11. Up in the tree--the overlooked richness of bryophytes and lichens in tree crowns.

    Science.gov (United States)

    Boch, Steffen; Müller, Jörg; Prati, Daniel; Blaser, Stefan; Fischer, Markus

    2013-01-01

    Assessing diversity is among the major tasks in ecology and conservation science. In ecological and conservation studies, epiphytic cryptogams are usually sampled up to accessible heights in forests. Thus, their diversity, especially of canopy specialists, likely is underestimated. If the proportion of those species differs among forest types, plot-based diversity assessments are biased and may result in misleading conservation recommendations. We sampled bryophytes and lichens in 30 forest plots of 20 m × 20 m in three German regions, considering all substrates, and including epiphytic litter fall. First, the sampling of epiphytic species was restricted to the lower 2 m of trees and shrubs. Then, on one representative tree per plot, we additionally recorded epiphytic species in the crown, using tree climbing techniques. Per tree, on average 54% of lichen and 20% of bryophyte species were overlooked if the crown was not been included. After sampling all substrates per plot, including the bark of all shrubs and trees, still 38% of the lichen and 4% of the bryophyte species were overlooked if the tree crown of the sampled tree was not included. The number of overlooked lichen species varied strongly among regions. Furthermore, the number of overlooked bryophyte and lichen species per plot was higher in European beech than in coniferous stands and increased with increasing diameter at breast height of the sampled tree. Thus, our results indicate a bias of comparative studies which might have led to misleading conservation recommendations of plot-based diversity assessments.

  12. Values for rooted-tree and sink-tree digraphs games and sharing a river

    NARCIS (Netherlands)

    Khmelnitskaya, Anna Borisovna

    We introduce values for rooted-tree and sink-tree digraph games axiomatically and provide their explicit formula representation. These values may be considered as natural extensions of the lower equivalent and upper equivalent solutions for line-graph games studied in Brink, Laan, and Vasil'ev

  13. Why count trees? Volunteer motivations and experiences with tree monitoring in New York City

    Science.gov (United States)

    Michelle L. Johnson; Lindsay K. Campbell; Erika S. Svendsen; Philip. Silva

    2018-01-01

    Volunteer programs can benefit from a deeper understanding of the motivations and experiences of people engaged in citizen science. Research to date has studied motivations of citizen scientists and tree-planting volunteers. Less work has focused on tree-monitoring volunteers, a role that is rapidly increasing as more cities involve the public in monitoring the urban...

  14. "Trees and Things That Live in Trees": Three Children with Special Needs Experience the Project Approach

    Science.gov (United States)

    Griebling, Susan; Elgas, Peg; Konerman, Rachel

    2015-01-01

    The authors report on research conducted during a project investigation undertaken with preschool children, ages 3-5. The report focuses on three children with special needs and the positive outcomes for each child as they engaged in the project Trees and Things That Live in Trees. Two of the children were diagnosed with developmental delays, and…

  15. Whole-tree water transport scales with sapwood capacitance in tropical forest canopy trees.

    Science.gov (United States)

    F.C. Meinzer; S.A. James; G. Goldstein; D. Woodruff

    2003-01-01

    The present study examines the manner in which several whole-tree water transport properties scale with species specific variation in sapwood water storage capacity. The hypothesis that constraints on relationships between sapwood capacitance and other water relations characteristics lead to predictable scaling relationships between intrinsic capacitance and whole-tree...

  16. Phylogenetic tree reconstruction accuracy and model fit when proportions of variable sites change across the tree.

    Science.gov (United States)

    Shavit Grievink, Liat; Penny, David; Hendy, Michael D; Holland, Barbara R

    2010-05-01

    Commonly used phylogenetic models assume a homogeneous process through time in all parts of the tree. However, it is known that these models can be too simplistic as they do not account for nonhomogeneous lineage-specific properties. In particular, it is now widely recognized that as constraints on sequences evolve, the proportion and positions of variable sites can vary between lineages causing heterotachy. The extent to which this model misspecification affects tree reconstruction is still unknown. Here, we evaluate the effect of changes in the proportions and positions of variable sites on model fit and tree estimation. We consider 5 current models of nucleotide sequence evolution in a Bayesian Markov chain Monte Carlo framework as well as maximum parsimony (MP). We show that for a tree with 4 lineages where 2 nonsister taxa undergo a change in the proportion of variable sites tree reconstruction under the best-fitting model, which is chosen using a relative test, often results in the wrong tree. In this case, we found that an absolute test of model fit is a better predictor of tree estimation accuracy. We also found further evidence that MP is not immune to heterotachy. In addition, we show that increased sampling of taxa that have undergone a change in proportion and positions of variable sites is critical for accurate tree reconstruction.

  17. Tree-centered spot firing - a technique for prescribed burning beneath standing trees.

    Science.gov (United States)

    C. Phillip Weatherspoon; George A. Almond; Carl N. Skinner

    1989-01-01

    Prescribed burning beneath standing trees normally requires efforts to protect residual trees from excessive fire damage. Damage to both crowns and boles is strongly influenced by flame length, a fire characteristic functionally related to fireline intensity (Albini 1976). In a good prescribed burn, therefore, the prescription specifies desired or maximum flame lengths...

  18. Ghost-tree: creating hybrid-gene phylogenetic trees for diversity analyses.

    Science.gov (United States)

    Fouquier, Jennifer; Rideout, Jai Ram; Bolyen, Evan; Chase, John; Shiffer, Arron; McDonald, Daniel; Knight, Rob; Caporaso, J Gregory; Kelley, Scott T

    2016-02-24

    Fungi play critical roles in many ecosystems, cause serious diseases in plants and animals, and pose significant threats to human health and structural integrity problems in built environments. While most fungal diversity remains unknown, the development of PCR primers for the internal transcribed spacer (ITS) combined with next-generation sequencing has substantially improved our ability to profile fungal microbial diversity. Although the high sequence variability in the ITS region facilitates more accurate species identification, it also makes multiple sequence alignment and phylogenetic analysis unreliable across evolutionarily distant fungi because the sequences are hard to align accurately. To address this issue, we created ghost-tree, a bioinformatics tool that integrates sequence data from two genetic markers into a single phylogenetic tree that can be used for diversity analyses. Our approach starts with a "foundation" phylogeny based on one genetic marker whose sequences can be aligned across organisms spanning divergent taxonomic groups (e.g., fungal families). Then, "extension" phylogenies are built for more closely related organisms (e.g., fungal species or strains) using a second more rapidly evolving genetic marker. These smaller phylogenies are then grafted onto the foundation tree by mapping taxonomic names such that each corresponding foundation-tree tip would branch into its new "extension tree" child. We applied ghost-tree to graft fungal extension phylogenies derived from ITS sequences onto a foundation phylogeny derived from fungal 18S sequences. Our analysis of simulated and real fungal ITS data sets found that phylogenetic distances between fungal communities computed using ghost-tree phylogenies explained significantly more variance than non-phylogenetic distances. The phylogenetic metrics also improved our ability to distinguish small differences (effect sizes) between microbial communities, though results were similar to non

  19. Species trees for the tree swallows (Genus Tachycineta): an alternative phylogenetic hypothesis to the mitochondrial gene tree.

    Science.gov (United States)

    Dor, Roi; Carling, Matthew D; Lovette, Irby J; Sheldon, Frederick H; Winkler, David W

    2012-10-01

    The New World swallow genus Tachycineta comprises nine species that collectively have a wide geographic distribution and remarkable variation both within- and among-species in ecologically important traits. Existing phylogenetic hypotheses for Tachycineta are based on mitochondrial DNA sequences, thus they provide estimates of a single gene tree. In this study we sequenced multiple individuals from each species at 16 nuclear intron loci. We used gene concatenated approaches (Bayesian and maximum likelihood) as well as coalescent-based species tree inference to reconstruct phylogenetic relationships of the genus. We examined the concordance and conflict between the nuclear and mitochondrial trees and between concatenated and coalescent-based inferences. Our results provide an alternative phylogenetic hypothesis to the existing mitochondrial DNA estimate of phylogeny. This new hypothesis provides a more accurate framework in which to explore trait evolution and examine the evolution of the mitochondrial genome in this group. Copyright © 2012 Elsevier Inc. All rights reserved.

  20. Guideliness for system modeling: fault tree [analysis

    Energy Technology Data Exchange (ETDEWEB)

    Lee, Yoon Hwan; Yang, Joon Eon; Kang, Dae Il; Hwang, Mee Jeong

    2004-07-01

    This document, the guidelines for system modeling related to Fault Tree Analysis(FTA), is intended to provide the guidelines with the analyzer to construct the fault trees in the level of the capability category II of ASME PRA standard. Especially, they are to provide the essential and basic guidelines and the related contents to be used in support of revising the Ulchin 3 and 4 PSA model for risk monitor within the capability category II of ASME PRA standard. Normally the main objective of system analysis is to assess the reliability of system modeled by Event Tree Analysis (ETA). A variety of analytical techniques can be used for the system analysis, however, FTA method is used in this procedures guide. FTA is the method used for representing the failure logic of plant systems deductively using AND, OR or NOT gates. The fault tree should reflect all possible failure modes that may contribute to the system unavailability. This should include contributions due to the mechanical failures of the components, Common Cause Failures (CCFs), human errors and outages for testing and maintenance. This document identifies and describes the definitions and the general procedures of FTA and the essential and basic guidelines for reving the fault trees. Accordingly, the guidelines for FTA will be capable to guide the FTA to the level of the capability category II of ASME PRA standard.

  1. Potential sources of methylmercury in tree foliage

    International Nuclear Information System (INIS)

    Tabatchnick, Melissa D.; Nogaro, Géraldine; Hammerschmidt, Chad R.

    2012-01-01

    Litterfall is a major source of mercury (Hg) and toxic methylmercury (MeHg) to forest soils and influences exposures of wildlife in terrestrial and aquatic ecosystems. However, the origin of MeHg associated with tree foliage is largely unknown. We tested the hypothesis that leaf MeHg is influenced by root uptake and thereby related to MeHg levels in soils. Concentrations of MeHg and total Hg in deciduous and coniferous foliage were unrelated to those in soil at 30 urban and rural forested locations in southwest Ohio. In contrast, tree genera and trunk diameter were significant variables influencing Hg in leaves. The fraction of total Hg as MeHg averaged 0.4% and did not differ among tree genera. Given that uptake of atmospheric Hg 0 appears to be the dominant source of total Hg in foliage, we infer that MeHg is formed by in vivo transformation of Hg in proportion to the amount accumulated. - Highlights: ► Levels of methylmercury and total Hg in foliage were unrelated to those in soil. ► Methylmercury:total Hg ratio in leaves did not differ among nine tree genera. ► Hg in foliage varied inversely with trunk diameter, a proxy for respiration. ► Methylmercury in leaves may result from in vivo methylation of atmospheric Hg. - Methylmercury in tree foliage appears to result from in vivo methylation of mercury accumulated from the atmosphere.

  2. An improved spatial contour tree constructed method

    Science.gov (United States)

    Zheng, Yi; Zhang, Ling; Guilbert, Eric; Long, Yi

    2018-05-01

    Contours are important data to delineate the landform on a map. A contour tree provides an object-oriented description of landforms and can be used to enrich the topological information. The traditional contour tree is used to store topological relationships between contours in a hierarchical structure and allows for the identification of eminences and depressions as sets of nested contours. This research proposes an improved contour tree so-called spatial contour tree that contains not only the topological but also the geometric information. It can be regarded as a terrain skeleton in 3-dimention, and it is established based on the spatial nodes of contours which have the latitude, longitude and elevation information. The spatial contour tree is built by connecting spatial nodes from low to high elevation for a positive landform, and from high to low elevation for a negative landform to form a hierarchical structure. The connection between two spatial nodes can provide the real distance and direction as a Euclidean vector in 3-dimention. In this paper, the construction method is tested in the experiment, and the results are discussed. The proposed hierarchical structure is in 3-demintion and can show the skeleton inside a terrain. The structure, where all nodes have geo-information, can be used to distinguish different landforms and applied for contour generalization with consideration of geographic characteristics.

  3. Urban climate modifies tree growth in Berlin

    Science.gov (United States)

    Dahlhausen, Jens; Rötzer, Thomas; Biber, Peter; Uhl, Enno; Pretzsch, Hans

    2018-05-01

    Climate, e.g., air temperature and precipitation, differs strongly between urban and peripheral areas, which causes diverse life conditions for trees. In order to compare tree growth, we sampled in total 252 small-leaved lime trees ( Tilia cordata Mill) in the city of Berlin along a gradient from the city center to the surroundings. By means of increment cores, we are able to trace back their growth for the last 50 to 100 years. A general growth trend can be shown by comparing recent basal area growth with estimates from extrapolating a growth function that had been fitted with growth data from earlier years. Estimating a linear model, we show that air temperature and precipitation significantly influence tree growth within the last 20 years. Under consideration of housing density, the results reveal that higher air temperature and less precipitation led to higher growth rates in high-dense areas, but not in low-dense areas. In addition, our data reveal a significantly higher variance of the ring width index in areas with medium housing density compared to low housing density, but no temporal trend. Transferring the results to forest stands, climate change is expected to lead to higher tree growth rates.

  4. Guideliness for system modeling: fault tree [analysis

    International Nuclear Information System (INIS)

    Lee, Yoon Hwan; Yang, Joon Eon; Kang, Dae Il; Hwang, Mee Jeong

    2004-07-01

    This document, the guidelines for system modeling related to Fault Tree Analysis(FTA), is intended to provide the guidelines with the analyzer to construct the fault trees in the level of the capability category II of ASME PRA standard. Especially, they are to provide the essential and basic guidelines and the related contents to be used in support of revising the Ulchin 3 and 4 PSA model for risk monitor within the capability category II of ASME PRA standard. Normally the main objective of system analysis is to assess the reliability of system modeled by Event Tree Analysis (ETA). A variety of analytical techniques can be used for the system analysis, however, FTA method is used in this procedures guide. FTA is the method used for representing the failure logic of plant systems deductively using AND, OR or NOT gates. The fault tree should reflect all possible failure modes that may contribute to the system unavailability. This should include contributions due to the mechanical failures of the components, Common Cause Failures (CCFs), human errors and outages for testing and maintenance. This document identifies and describes the definitions and the general procedures of FTA and the essential and basic guidelines for reving the fault trees. Accordingly, the guidelines for FTA will be capable to guide the FTA to the level of the capability category II of ASME PRA standard

  5. Fast Image Texture Classification Using Decision Trees

    Science.gov (United States)

    Thompson, David R.

    2011-01-01

    Texture analysis would permit improved autonomous, onboard science data interpretation for adaptive navigation, sampling, and downlink decisions. These analyses would assist with terrain analysis and instrument placement in both macroscopic and microscopic image data products. Unfortunately, most state-of-the-art texture analysis demands computationally expensive convolutions of filters involving many floating-point operations. This makes them infeasible for radiation- hardened computers and spaceflight hardware. A new method approximates traditional texture classification of each image pixel with a fast decision-tree classifier. The classifier uses image features derived from simple filtering operations involving integer arithmetic. The texture analysis method is therefore amenable to implementation on FPGA (field-programmable gate array) hardware. Image features based on the "integral image" transform produce descriptive and efficient texture descriptors. Training the decision tree on a set of training data yields a classification scheme that produces reasonable approximations of optimal "texton" analysis at a fraction of the computational cost. A decision-tree learning algorithm employing the traditional k-means criterion of inter-cluster variance is used to learn tree structure from training data. The result is an efficient and accurate summary of surface morphology in images. This work is an evolutionary advance that unites several previous algorithms (k-means clustering, integral images, decision trees) and applies them to a new problem domain (morphology analysis for autonomous science during remote exploration). Advantages include order-of-magnitude improvements in runtime, feasibility for FPGA hardware, and significant improvements in texture classification accuracy.

  6. Arthropod diversity (Arthropoda on abandoned apple trees

    Directory of Open Access Journals (Sweden)

    Pavla Šťastná

    2013-01-01

    Full Text Available In 2010 and 2011, the occurrence of arthropods on apple trees without management was monitored near the village of Velké Bílovice, South Moravia, in two selected localities (an abandoned apple tree orchard and a road apple tree alley. Arthropods in tree tops were killed using deltamehtrin applied with a fogger (Puls Fog. Each collection always contained the material from 5 trees in each site. In 2010, three collections were performed (28/4, 20/5, and 9/7, two in 2011 (11/5 and 23/6. Representatives of eleven orders were captured. Of all the orders trapped, Coleoptera was represented most frequently, the Hymenoptera and Diptera followed. In the alley, individuals of the Coleoptera (34% were caught most frequently, the Hymenoptera (19.6% and Hemiptera (17.4% followed. In the orchard, the Coleoptera (41.4% was represented most frequently, followed by the Hymenoptera (21.9% and Diptera (15%. In both the environments, species with negative economic impact were recorded (e.g. Anthonomus pyri, Tatianaerhynchites aequatus, Cydia pomonella, Rhynchites bacchus. However, a greater number of pest antagonists were also found (Scambus pomorum, Coccinella septempunctata, Episyrphus balteatus, Pentatoma rufipes, Orius spp.. Some species were important in faunistic terms, as some critically endangered species were recorded (e.g. Dipoena erythropus, Cryptocephalus schaefferi, and the Plectochorus iwatensis species was recorded for the first time in the Czech Republic.

  7. Computer-aided Fault Tree Analysis

    International Nuclear Information System (INIS)

    Willie, R.R.

    1978-08-01

    A computer-oriented methodology for deriving minimal cut and path set families associated with arbitrary fault trees is discussed first. Then the use of the Fault Tree Analysis Program (FTAP), an extensive FORTRAN computer package that implements the methodology is described. An input fault tree to FTAP may specify the system state as any logical function of subsystem or component state variables or complements of these variables. When fault tree logical relations involve complements of state variables, the analyst may instruct FTAP to produce a family of prime implicants, a generalization of the minimal cut set concept. FTAP can also identify certain subsystems associated with the tree as system modules and provide a collection of minimal cut set families that essentially expresses the state of the system as a function of these module state variables. Another FTAP feature allows a subfamily to be obtained when the family of minimal cut sets or prime implicants is too large to be found in its entirety; this subfamily consists only of sets that are interesting to the analyst in a special sense

  8. Urban climate modifies tree growth in Berlin

    Science.gov (United States)

    Dahlhausen, Jens; Rötzer, Thomas; Biber, Peter; Uhl, Enno; Pretzsch, Hans

    2017-12-01

    Climate, e.g., air temperature and precipitation, differs strongly between urban and peripheral areas, which causes diverse life conditions for trees. In order to compare tree growth, we sampled in total 252 small-leaved lime trees (Tilia cordata Mill) in the city of Berlin along a gradient from the city center to the surroundings. By means of increment cores, we are able to trace back their growth for the last 50 to 100 years. A general growth trend can be shown by comparing recent basal area growth with estimates from extrapolating a growth function that had been fitted with growth data from earlier years. Estimating a linear model, we show that air temperature and precipitation significantly influence tree growth within the last 20 years. Under consideration of housing density, the results reveal that higher air temperature and less precipitation led to higher growth rates in high-dense areas, but not in low-dense areas. In addition, our data reveal a significantly higher variance of the ring width index in areas with medium housing density compared to low housing density, but no temporal trend. Transferring the results to forest stands, climate change is expected to lead to higher tree growth rates.

  9. Global tree network for computing structures enabling global processing operations

    Science.gov (United States)

    Blumrich; Matthias A.; Chen, Dong; Coteus, Paul W.; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Philip; Hoenicke, Dirk; Steinmacher-Burow, Burkhard D.; Takken, Todd E.; Vranas, Pavlos M.

    2010-01-19

    A system and method for enabling high-speed, low-latency global tree network communications among processing nodes interconnected according to a tree network structure. The global tree network enables collective reduction operations to be performed during parallel algorithm operations executing in a computer structure having a plurality of the interconnected processing nodes. Router devices are included that interconnect the nodes of the tree via links to facilitate performance of low-latency global processing operations at nodes of the virtual tree and sub-tree structures. The global operations performed include one or more of: broadcast operations downstream from a root node to leaf nodes of a virtual tree, reduction operations upstream from leaf nodes to the root node in the virtual tree, and point-to-point message passing from any node to the root node. The global tree network is configurable to provide global barrier and interrupt functionality in asynchronous or synchronized manner, and, is physically and logically partitionable.

  10. Carbon storage and sequestration by trees in VIT University campus

    Science.gov (United States)

    Saral, A. Mary; SteffySelcia, S.; Devi, Keerthana

    2017-11-01

    The present study addresses carbon storage and sequestration by trees grown in VIT University campus, Vellore. Approximately twenty trees were selected from Woodstockarea. The above ground biomass and below ground biomass were calculated. The above ground biomass includes non-destructive anddestructive sampling. The Non-destructive method includes the measurement of height of thetree and diameter of the tree. The height of the tree is calculated using Total Station instrument and diameter is calculated using measuring tape. In the destructive method the weight of samples (leaves) and sub-samples (fruits, flowers) of the tree were considered. To calculate the belowground biomass soil samples are taken and analyzed. The results obtained were used to predict the carbon storage. It was found that out of twenty tree samples Millingtonia hortensis which is commonly known as Cork tree possess maximum carbon storage (14.342kg/tree) and carbon sequestration (52.583kg/tree) respectively.

  11. Increasing tree cover in degrading landscapes

    DEFF Research Database (Denmark)

    Rahman, Syed Ajijur; Rahman, Md Faizar; Sunderland, Terry

    2014-01-01

    -functionality’. Two agroforestry models suitable for adoption by farmers have been identified. Multi-strata agroforestry, based on a fruit and timber tree canopy with vegetables and tuber species in the understorey, can be practiced in the shifting cultivation fields near settlements. Fruit and timber tree......Research was conducted in Alutilla Valley in eastern Bangladesh to identify the nature of existing agroforestry systems and to identify potential agroforestry models that could ameliorate currently degrading forest resources Data were collected through farmer participatory research and a structured......-based conservation agroforestry is well suited to manage large-scale biologically depleted landscapes. Both systems yield early financial returns, facilitating the change from shifting cultivation to multi-strata agroforestry or fruit and tree-based conservation agroforestry....

  12. On Tree Pattern Matching by Pushdown Automata

    Directory of Open Access Journals (Sweden)

    T. Flouri

    2009-01-01

    Full Text Available Tree pattern matching is an important operation in Computer Science on which a number of tasks such as mechanical theorem proving, term-rewriting, symbolic computation and non-procedural programming languages are based on. Work has begun on a systematic approach to the construction of tree pattern matchers by deterministic pushdown automata which read subject trees in prefix notation. The method is analogous to the construction of string pattern matchers: for given patterns, a non-deterministic pushdown automaton is created and then it is determinised. In this first paper, we present the proposed non-deterministic pushdown automaton which will serve as a basis for the determinisation process, and prove its correctness. 

  13. Induced mutation in tropical fruit trees

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    2009-05-15

    This publication is based on an FAO/IAEA coordinated research project (CRP) and provides insight into the application of induced mutation and in vitro techniques for the improvement of well known fruit trees such as citrus, mango, avocado and papaya, as well as more exotic fruit trees such as litchi, annona, jujube, carambola, pitanga and jaboticaba. The latter are of particular importance due to their adaptation to harsh environments and their high potential as basic food and micronutrient providers for populations in poorer and more remote regions. The findings of the CRP show that application of radiation induced mutation techniques in tropical and subtropical fruit trees can contribute to improving nutritional balance food security, and to enhancing the economic status of growers.

  14. Induced mutation in tropical fruit trees

    International Nuclear Information System (INIS)

    2009-05-01

    This publication is based on an FAO/IAEA coordinated research project (CRP) and provides insight into the application of induced mutation and in vitro techniques for the improvement of well known fruit trees such as citrus, mango, avocado and papaya, as well as more exotic fruit trees such as litchi, annona, jujube, carambola, pitanga and jaboticaba. The latter are of particular importance due to their adaptation to harsh environments and their high potential as basic food and micronutrient providers for populations in poorer and more remote regions. The findings of the CRP show that application of radiation induced mutation techniques in tropical and subtropical fruit trees can contribute to improving nutritional balance food security, and to enhancing the economic status of growers

  15. Phytoforensics—Using trees to find contamination

    Science.gov (United States)

    Wilson, Jordan L.

    2017-09-28

    The water we drink, air we breathe, and soil we come into contact with have the potential to adversely affect our health because of contaminants in the environment. Environmental samples can characterize the extent of potential contamination, but traditional methods for collecting water, air, and soil samples below the ground (for example, well drilling or direct-push soil sampling) are expensive and time consuming. Trees are closely connected to the subsurface and sampling tree trunks can indicate subsurface pollutants, a process called phytoforensics. Scientists at the Missouri Water Science Center were among the first to use phytoforensics to screen sites for contamination before using traditional sampling methods, to guide additional sampling, and to show the large cost savings associated with tree sampling compared to traditional methods. 

  16. TSkim: A tool for skimming ROOT trees

    International Nuclear Information System (INIS)

    Chamont, David

    2010-01-01

    Like many HEP researchers, the members of the Fermi collaboration have chosen to store their experiment data within ROOT trees. A frequent activity of such physicists is the tuning of selection criteria which define the events of interest, thus cutting and pruning the ROOT trees so to extract all the data linked to those specific physical events. It is rather straightforward to write a ROOT script to skim a single kind of data, for example the raw measurements of Fermi LAT detector. This proves to be trickier if one wants to process also some simulated or analysis data at the same time, because each kind of data is structured with its own rules for what concerns file names and sizes, tree names, identification of events, etc. TSkim has been designed to facilitate this task. Thanks to a user-defined configuration file which says where to find the run and event identifications in the different kind of trees, TSkim is able to collect all the tree elements which match a given ROOT cut. The tool will also help when loading the shared libraries which describe the experiment data, or when pruning the tree branches. Initially a pair of PERL and ROOT scripts, TSkim is today a fully compiled C++ application, enclosing our ROOT know-how and offering a panel of features going far beyond the original Fermi requirements. In this manuscript, we present TSkim concepts and key features, including a new kind of event list. Any collaboration using ROOT IO could profit from the use of this tool.

  17. Automated Decision Tree Classification of Corneal Shape

    Science.gov (United States)

    Twa, Michael D.; Parthasarathy, Srinivasan; Roberts, Cynthia; Mahmoud, Ashraf M.; Raasch, Thomas W.; Bullimore, Mark A.

    2011-01-01

    Purpose The volume and complexity of data produced during videokeratography examinations present a challenge of interpretation. As a consequence, results are often analyzed qualitatively by subjective pattern recognition or reduced to comparisons of summary indices. We describe the application of decision tree induction, an automated machine learning classification method, to discriminate between normal and keratoconic corneal shapes in an objective and quantitative way. We then compared this method with other known classification methods. Methods The corneal surface was modeled with a seventh-order Zernike polynomial for 132 normal eyes of 92 subjects and 112 eyes of 71 subjects diagnosed with keratoconus. A decision tree classifier was induced using the C4.5 algorithm, and its classification performance was compared with the modified Rabinowitz–McDonnell index, Schwiegerling’s Z3 index (Z3), Keratoconus Prediction Index (KPI), KISA%, and Cone Location and Magnitude Index using recommended classification thresholds for each method. We also evaluated the area under the receiver operator characteristic (ROC) curve for each classification method. Results Our decision tree classifier performed equal to or better than the other classifiers tested: accuracy was 92% and the area under the ROC curve was 0.97. Our decision tree classifier reduced the information needed to distinguish between normal and keratoconus eyes using four of 36 Zernike polynomial coefficients. The four surface features selected as classification attributes by the decision tree method were inferior elevation, greater sagittal depth, oblique toricity, and trefoil. Conclusions Automated decision tree classification of corneal shape through Zernike polynomials is an accurate quantitative method of classification that is interpretable and can be generated from any instrument platform capable of raw elevation data output. This method of pattern classification is extendable to other classification

  18. Rooting gene trees without outgroups: EP rooting.

    Science.gov (United States)

    Sinsheimer, Janet S; Little, Roderick J A; Lake, James A

    2012-01-01

    Gene sequences are routinely used to determine the topologies of unrooted phylogenetic trees, but many of the most important questions in evolution require knowing both the topologies and the roots of trees. However, general algorithms for calculating rooted trees from gene and genomic sequences in the absence of gene paralogs are few. Using the principles of evolutionary parsimony (EP) (Lake JA. 1987a. A rate-independent technique for analysis of nucleic acid sequences: evolutionary parsimony. Mol Biol Evol. 4:167-181) and its extensions (Cavender, J. 1989. Mechanized derivation of linear invariants. Mol Biol Evol. 6:301-316; Nguyen T, Speed TP. 1992. A derivation of all linear invariants for a nonbalanced transversion model. J Mol Evol. 35:60-76), we explicitly enumerate all linear invariants that solely contain rooting information and derive algorithms for rooting gene trees directly from gene and genomic sequences. These new EP linear rooting invariants allow one to determine rooted trees, even in the complete absence of outgroups and gene paralogs. EP rooting invariants are explicitly derived for three taxon trees, and rules for their extension to four or more taxa are provided. The method is demonstrated using 18S ribosomal DNA to illustrate how the new animal phylogeny (Aguinaldo AMA et al. 1997. Evidence for a clade of nematodes, arthropods, and other moulting animals. Nature 387:489-493; Lake JA. 1990. Origin of the metazoa. Proc Natl Acad Sci USA 87:763-766) may be rooted directly from sequences, even when they are short and paralogs are unavailable. These results are consistent with the current root (Philippe H et al. 2011. Acoelomorph flatworms are deuterostomes related to Xenoturbella. Nature 470:255-260).

  19. Understand the children's anger through tree drawing

    OpenAIRE

    増岡, 怜那; 高橋, 靖恵

    2006-01-01

    When small children (three to six years old) express their anger through inappropriate behavior or over reacting, most parents and other adults find this anger hard to deal with. That is because people see anger as a negative emotion. In actuality expressing anger can be a positive step in emotional development. In this study two kinds of tests were conducted on six years olds. The first test, [Tree drawing test] a drawing of a tree from each subject, was used to measure the individual's leve...

  20. Proactive data mining with decision trees

    CERN Document Server

    Dahan, Haim; Rokach, Lior; Maimon, Oded

    2014-01-01

    This book explores a proactive and domain-driven method to classification tasks. This novel proactive approach to data mining not only induces a model for predicting or explaining a phenomenon, but also utilizes specific problem/domain knowledge to suggest specific actions to achieve optimal changes in the value of the target attribute. In particular, the authors suggest a specific implementation of the domain-driven proactive approach for classification trees. The book centers on the core idea of moving observations from one branch of the tree to another. It introduces a novel splitting crite