Results 301 to 310 of about 2,574,979 (356)
Some of the next articles are maybe not open access.
2022
In Chapter 5, the authors take a broader view, locating in the song “Tree Tree Tree” Rogers’ long-standing interest in connections between people, places, animals, plants, and things. The song is used to show that children and parents are still connected, even when parents have to leave to go to work. The music is played by Yo-Yo Ma on the cello and by
Sara Lindey, Jason King
openaire +1 more source
In Chapter 5, the authors take a broader view, locating in the song “Tree Tree Tree” Rogers’ long-standing interest in connections between people, places, animals, plants, and things. The song is used to show that children and parents are still connected, even when parents have to leave to go to work. The music is played by Yo-Yo Ma on the cello and by
Sara Lindey, Jason King
openaire +1 more source
Using ggtree to Visualize Data on Tree‐Like Structures
Current Protocols in Bioinformatics, 2020Ggtree is an R/Bioconductor package for visualizing tree‐like structures and associated data. After 5 years of continual development, ggtree has been evolved as a package suite that contains treeio for tree data input and output, tidytree for tree data ...
Guangchuang Yu
semanticscholar +1 more source
Rooting Species Trees Using Gene Tree-Species Tree Reconciliation
2022Interpreting phylogenetic trees requires a root, which provides the direction of evolution and polarizes ancestor-descendant relationships. But inferring the root using genetic data is difficult, particularly in cases where the closest available outgroup is only distantly related, which are common for microbes.
Brogan J, Harris +5 more
openaire +2 more sources
Proof Tree Preserving Tree Interpolation
Journal of Automated Reasoning, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jürgen Christ, Jochen Hoenicke
openaire +3 more sources
2023
This book is a warning and a toolkit for the future of forest recovery. The book investigates the critical biological threats endangering tree species native to the forests of eastern North America, providing a needed focus on this plight. The book suggests that if we are to save our forests, the first step is to recognize the threats in front of us ...
openaire +1 more source
This book is a warning and a toolkit for the future of forest recovery. The book investigates the critical biological threats endangering tree species native to the forests of eastern North America, providing a needed focus on this plight. The book suggests that if we are to save our forests, the first step is to recognize the threats in front of us ...
openaire +1 more source
2017
This chapter considers the problem of counting trees. Every connected graph G has a spanning tree, that is, a connected acyclic subgraph containing all the vertices of G. If G has no cycles, it is its own unique spanning tree. If G has cycles, we can locate any cycle and delete one of its edges. Repeat this process until no cycle remains.
openaire +1 more source
This chapter considers the problem of counting trees. Every connected graph G has a spanning tree, that is, a connected acyclic subgraph containing all the vertices of G. If G has no cycles, it is its own unique spanning tree. If G has cycles, we can locate any cycle and delete one of its edges. Repeat this process until no cycle remains.
openaire +1 more source
2014 22nd International Conference on Pattern Recognition, 2014
We propose a new decision tree model, named the budding tree, where a node can be both a leaf and an internal decision node. Each bud node starts as a leaf node, can then grow children, but then later on, if necessary, its children can be pruned. This contrasts with traditional tree construction algorithms that only grows the tree during the training ...
Yıldız, Olcay Taner +2 more
openaire +2 more sources
We propose a new decision tree model, named the budding tree, where a node can be both a leaf and an internal decision node. Each bud node starts as a leaf node, can then grow children, but then later on, if necessary, its children can be pruned. This contrasts with traditional tree construction algorithms that only grows the tree during the training ...
Yıldız, Olcay Taner +2 more
openaire +2 more sources
Studia Logica, 2012
The paper is concerned with proof-theoretic aspects of the method of Socratic transformations. It is founded on inferential erotetic logic developed by Wiśniewski and based on the idea of solving logical problems by questioning. A question in this framework is formulated as a finite list of sequents with one formula in the succedent.
Leszczyńska-Jasion, Dorota +2 more
openaire +2 more sources
The paper is concerned with proof-theoretic aspects of the method of Socratic transformations. It is founded on inferential erotetic logic developed by Wiśniewski and based on the idea of solving logical problems by questioning. A question in this framework is formulated as a finite list of sequents with one formula in the succedent.
Leszczyńska-Jasion, Dorota +2 more
openaire +2 more sources
Fault trees, event trees and success trees
1993Fault-tree analysis was developed by H.A. Watson of the Bell Telephone Laboratories in 1961–2 as part of a US Air Force study contract for the Minuteman missile launch control system. Through the years it has proved to be a very valuable tool for the reliability evaluation of complex systems, such as nuclear power stations, chemical plants, wide-body ...
D. J. Sherwin, A. Bossche
openaire +1 more source
Intelligent Data Analysis, 1999
In this paper we present system Ltree for propositional supervised learning. Ltree is able to define decision surfaces both orthogonal and oblique to the axes defined by the attributes of the input space. This is done combining a decision tree with a linear discriminant by means of constructive induction.
Gama, João, Brazdil, Pavel
openaire +2 more sources
In this paper we present system Ltree for propositional supervised learning. Ltree is able to define decision surfaces both orthogonal and oblique to the axes defined by the attributes of the input space. This is done combining a decision tree with a linear discriminant by means of constructive induction.
Gama, João, Brazdil, Pavel
openaire +2 more sources