Bibliographies thématiques / Trees

Littérature scientifique sur le sujet « Trees »

Auteur : Grafiati

Publié le 4 juin 2021

Mis à jour le 20 juillet 2024

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Sommaire

Articles de revues
Thèses
Livres
Chapitres de livres
Actes de conférences
Rapports d'organisations

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Trees ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "Trees"

Jasmine, Jasmine, Pankaj Bhambri et Dr O. P. Gupta Dr. O.P. Gupta. « Analyzing the Phylogenetic Trees with Tree- building Methods ». Indian Journal of Applied Research 1, n^o 7 (1 octobre 2011) : 83–85. http://dx.doi.org/10.15373/2249555x/apr2012/25.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Brower, Andrew V. Z. « Trees and more trees ». Cladistics 32, n^o 2 (6 mai 2015) : 215–18. http://dx.doi.org/10.1111/cla.12122.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Alperin, J. L. « Trees and Brauer trees ». Discrete Mathematics 83, n^o 1 (juillet 1990) : 127–28. http://dx.doi.org/10.1016/0012-365x(90)90228-a.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Chaffey, N. J. « Popular trees, specialist trees ». New Phytologist 154, n^o 3 (6 juin 2002) : 548–49. http://dx.doi.org/10.1046/j.1469-8137.2002.00434_3.x.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Steele, James, et Anne Kandler. « Language trees ≠ gene trees ». Theory in Biosciences 129, n^o 2-3 (9 juin 2010) : 223–33. http://dx.doi.org/10.1007/s12064-010-0096-6.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Pollin, Burton R. « Kilmer's Trees and Asselineau's Trees ». Explicator 64, n^o 3 (mars 2006) : 160–62. http://dx.doi.org/10.3200/expl.64.3.160-162.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Maddison, Wayne P. « Gene Trees in Species Trees ». Systematic Biology 46, n^o 3 (1 septembre 1997) : 523–36. http://dx.doi.org/10.1093/sysbio/46.3.523.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Azais, Romain, Guillaume Cerutti, Didier Gemmerle ; et Florian Ingels. « treex : a Python package for manipulating rooted trees ». Journal of Open Source Software 4, n^o 38 (24 juin 2019) : 1351. http://dx.doi.org/10.21105/joss.01351.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Bahendwar, Isha Ashish, Ruchit Purshottam Bhardwaj et Prof S. G. Mundada. « Amortized Complexity Analysis for Red-Black Trees and Splay Trees ». International Journal of Innovative Research in Computer Science & ; Technology 6, n^o 6 (novembre 2018) : 121–28. http://dx.doi.org/10.21276/ijircst.2018.6.6.2.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Jones, Joe, et Olcay Jones. « Trees ». Annals of Paediatric Rheumatology 3, n^o 2 (2014) : 46. http://dx.doi.org/10.5455/apr.062020140706.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Plus de sources

Thèses sur le sujet "Trees"

Okoth, Isaac Owino. « Combinatorics of oriented trees and tree-like structures ». Thesis, Stellenbosch : Stellenbosch University, 2015. http://hdl.handle.net/10019.1/96860.

Texte intégral

Résumé :

Thesis (PhD)--Stellenbosch University, 2015.
ENGLISH ABSTRACT : In this thesis, a number of combinatorial objects are enumerated. Du and Yin as well as Shin and Zeng (by a different approach) proved an elegant formula for the number of labelled trees with respect to a given in degree sequence, where each edge is oriented from a vertex of lower label towards a vertex of higher label. We refine their result to also take the number of sources (vertices of in degree 0) or sinks (vertices of out degree 0) into account. We find formulas for the mean and variance of the number of sinks or sources in these trees. We also obtain a differential equation and a functional equation satisfied by the generating function for these trees. Analogous results for labelled trees with two marked vertices, related to functional digraphs, are also established. We extend the work to count reachable vertices, sinks and leaf sinks in these trees. Among other results, we obtain a counting formula for the number of labelled trees on n vertices in which exactly k vertices are reachable from a given vertex v and also the average number of vertices that are reachable from a specified vertex in labelled trees of order n. In this dissertation, we also enumerate certain families of set partitions and related tree-like structures. We provide a proof for a formula that counts connected cycle-free families of k set partitions of {1, . . . , n} satisfying a certain coherence condition and then establish a bijection between these families and the set of labelled free k-ary cacti with a given vertex-degree distribution. We then show that the formula also counts coloured Husimi graphs in which there are no blocks of the same colour that are incident to one another. We extend the work to count coloured oriented cacti and coloured cacti. Noncrossing trees and related tree-like structures are also considered in this thesis. Specifically, we establish formulas for locally oriented noncrossing trees with a given number of sources and sinks, and also with given indegree and outdegree sequences. The work is extended to obtain the average number of reachable vertices in these trees. We then generalise the concept of noncrossing trees to find formulas for the number of noncrossing Husimi graphs, cacti and oriented cacti. The study is further extended to find formulas for the number of bicoloured noncrossing Husimi graphs and the number of noncrossing connected cycle-free pairs of set partitions.
AFRIKAANSE OPSOMMING : In hierdie tesis word ’n aantal kombinatoriese objekte geenumereer. Du en Yin asook Shin en Zeng (deur middel van ’n ander benadering) het ’n elegante formule vir die aantal geëtiketteerde bome met betrekking tot ’n gegewe ingangsgraadry, waar elke lyn van die nodus met die kleiner etiket na die nodus met die groter etiket toe georiënteer word. Ons verfyn hul resultaat deur ook die aantal bronne (nodusse met ingangsgraad 0) en putte (nodusse met uitgangsgraad 0) in ag te neem. Ons vind formules vir die gemiddelde en variansie van die aantal putte of bronne in hierdie bome. Ons bepaal verder ’n differensiaalvergelyking en ’n funksionaalvergelyking wat deur die voortbringende funksie van hierdie bome bevredig word. Analoë resultate vir geëtiketteerde bome met twee gemerkte nodusse (wat verwant is aan funksionele digrafieke), is ook gevind. Ons gaan verder voort deur ook bereikbare nodusse, bronne en putte in hierdie bome at te tel. Onder andere verkry ons ’n formule vir die aantal geëtiketteerde bome met n nodusse waarin presies k nodusse vanaf ’n gegewe nodus v bereikbaar is asook die gemiddelde aantal nodusse wat bereikbaar is vanaf ’n gegewe nodus. Ons enumereer in hierdie tesis verder sekere families van versamelingsverdelings en soortgelyke boom-vormige strukture. Ons gee ’n bewys vir ’n formule wat die aantal van samehangende siklus-vrye families van k versamelingsverdelings op {1, . . . , n} wat ’n sekere koherensie-vereiste bevredig, en ons beskryf ’n bijeksie tussen hierdie familie en die versameling van geëtiketteerde vrye k-êre kaktusse met ’n gegewe nodus-graad-verdeling. Ons toon ook dat hierdie formule ook gekleurde Husimi-grafieke tel waar blokke van dieselfde kleur nie insident met mekaar mag wees nie. Ons tel verder ook gekleurde georiënteerde kaktusse en gekleurde kaktusse. Nie-kruisende bome en soortgelyke boom-vormige strukture word in hierdie tesis ook beskou. On bepaal spesifiek formules vir lokaal georiënteerde nie-kruisende bome wat ’n gegewe aantal bronne en putte het asook nie-kruisende bome met gegewe ingangs- en uitgangsgraadrye. Ons gaan voort deur die gemiddelde aantal bereikbare nodusse in hierdie bome te bepaal. Ons veralgemeen dan die konsep van nie-kruisende bome en vind formules vir die aantal nie-kruisende Husimi-grafieke, kaktusse en georiënteerde kaktusse. Laastens vind ons ’n formule vir die aantaal tweegekleurde nie-kruisende Husimi-grafieke en die aantal nie-kruisende samehangende siklus-vrye pare van versamelingsverdelings.

Styles APA, Harvard, Vancouver, ISO, etc.

Drinkwater, Kara M. « Trees ». VCU Scholars Compass, 2006. http://hdl.handle.net/10156/1907.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Garton, Ian Spencer. « Concurrency in B-trees and tries : search and insert ». Thesis, McGill University, 2000. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=33400.

Texte intégral

Résumé :

Multiuser database systems require concurrency control in order to perform correctly. B-trees have become the standard data structure for storing indices that aid in data retrieval and there have been many algorithms published to enable concurrent operations for B-trees. Tries are another data structure useful for storing index data, particularly for text and spatial databases. Significant data compression can be achieved by using a trie to store index values. However, there have been no algorithms published to support concurrent trie operations.
We present algorithms that enable concurrent searches and inserts for tries with pointerless representation. We also measure the performance of our algorithms and compare with that of the best B-tree algorithms. In order to measure trie concurrency, we survey a number of studies that have been made for B-tree concurrency. Using these published studies, we build a simulation model to measure the concurrency of our algorithms.

Styles APA, Harvard, Vancouver, ISO, etc.

Hall, Justine Michelle. « Trees in towns : factors affecting the distribution of trees in high density residential areas of Greater Manchester ». Thesis, University of Manchester, 2010. https://www.research.manchester.ac.uk/portal/en/theses/trees-in-towns-factors-affecting-the-distribution-of-trees-in-high-density-residential-areas-of-greater-manchester(568b58f3-4524-4a8d-abba-2094c4e21567).html.

Texte intégral

Résumé :

The distribution of trees across urban areas of the UK has been shown to be uneven, with lower density residential areas containing many more trees and much higher tree cover than areas of higher density housing. However, in Greater Manchester, tree number within high density housing areas also varies substantially. This thesis sought to explore the reasons for this variation in tree cover, whether tree cover should be increased and if so, how. The research investigated a potential cause for the variation in number of trees and tree cover within high density housing areas – housing type – for the study area of western Greater Manchester. Eleven different types of high density housing were categorised and all high density housing within the study area was classified as one of these types. Within these housing types, the amount of tree cover was determined, along with the proportions of other surface types. The land uses where the trees were growing were also determined. Finally, the potential increases in tree cover were also calculated for each housing type by a simulated planting technique. Maximum surface temperatures and rainfall runoff were calculated using computer models, for both existing and potential tree cover in each housing type. It was found that urban tree cover varies from 1.6% in pre 1919 terraced housing that opens directly onto the road to 14.8% in 1960s walkway-style housing. Tree cover could theoretically be increased by at least 5% in all housing types, reducing maximum surface temperatures by at least 1°C. In housing types with less than 4% existing tree cover, maximum surface temperatures could be reduced by up to 4.5°C. The views of residents were determined using a postal questionnaire about urban trees sent to residents of 4 different types of street environment. Residents of all street types surveyed were very positive about urban trees; their attitudes were not affected by whether there are trees in their street or not. The vast majority of respondents considered trees important to their quality of life, and that cost to the council should not prevent tree planting. The views and practices around urban trees and greening by practitioners were determined by running a workshop and their recommendations to increase tree cover are presented. These include changes in funding to include money for tree maintenance after planting, the importance of a full tree inventory and innovative ways to raise funding for trees. The effectiveness of a community greening scheme at increasing tree cover was compared with two regeneration schemes. The community tree planting scheme was found to deliver tree planting much closer to the potential than regeneration schemes.

Styles APA, Harvard, Vancouver, ISO, etc.

Abu-Ata, Muad Mustafa. « Tree-Like Structure in Graphs and Embedability to Trees ». Kent State University / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=kent1397345185.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Bryant, David. « Building trees, hunting for trees, and comparing trees : theory and methods in phylogenetic analysis ». Thesis, University of Canterbury. Mathematics and Statistics, 1997. http://hdl.handle.net/10092/7914.

Texte intégral

Résumé :

Phylogenetics is the study and identification of evolutionary patterns and structures in nature; this thesis explores the mathematics of these structures. The basic objects of study are the leaf labelled tree and its substructures: quartets, splits, clusters and rooted triples, among others. We present fundamental theorems and characterisations, as well as efficient algorithms for a range of phylogenetic problems. It is often possible to deduce phylogenetic information not in the original data. We characterise an intriguing system of inference 'rules' that arise in this way, and prove that there exist rules of every order that cannot be reduced to lower order rules. We describe a polynomial time algorithm that extracts maximum weight bounded degree trees from a given binary character set. The algorithm enables compatibility analysis of large data sets, in this case the daunting "Out of Africa" human mtDNA sequences. Other applications include consensus, quartet puzzling and split decomposition. We accelerate the Minimum Evolution method with an optimal O(n²) time algorithm for calculating OLS edge lengths and fast algorithms for WLS and GLS edge lengths. We show how a Minimum Evolution tree can be efficiently extracted from a collection of splits. Consensus methods are surveyed, characterised and classified. A new intuitive consensus method for edge weighted trees is introduced, together with an efficient algorithm for constructing it. We present an algorithm for the Maximum Agreement Subtree problem that is based on rooted triples and is much simpler than existing algorithms. We also provide algorithms for obtaining agreement subtrees with the largest number of edges, rooted triples or quartets. Issues of complexity are discussed throughout the thesis, with several new NP-completeness results and a list of standard NP-complete phylogenetic problems.

Styles APA, Harvard, Vancouver, ISO, etc.

Balakrishnan, Anantaram, Thomas L. Magnanti et Prakash Mirchandani. « Heuristics, LPs, and Generalizations of Trees on Trees ». Massachusetts Institute of Technology, Operations Research Center, 1993. http://hdl.handle.net/1721.1/5377.

Texte intégral

Résumé :

We study a class of models, known as overlay optimization problems, with a "base" subproblem and an "overlay" subproblem, linked by the requirement that the overlay solution be contained in the base solution. In some telecommunication settings, a feasible base solution is a spanning tree and the overlay solution is an embedded Steiner tree (or an embedded path). For the general overlay optimization problem, we describe a heuristic solution procedure that selects the better of two feasible solutions obtained by independently solving the base and overlay subproblems, and establish worst-case performance guarantees on both this heuristic and a linear programming relaxation of the model. These guarantees depend upon worst-case bounds for the heuristics and linear programming relaxations of the unlinked base and overlay problems. Under certain assumptions about the cost structure and the optimality of the subproblem solutions, the performance guarantees for both the heuristic and linear programming relaxation of the combined overlay optimization model are 33%. We also develop heuristic and linear programming performance guarantees for specialized models, including a dual path connectivity model with a worst-case performance guarantee of 25%, and an uncapacitated multicommodity network design model with a worst-case performance guarantee (approximately) proportional to the square root of the number of commodities.

Styles APA, Harvard, Vancouver, ISO, etc.

Magnanti, Thomas L., et Laurence A. Wolsey. « Optimal Trees ». Massachusetts Institute of Technology, Operations Research Center, 1994. http://hdl.handle.net/1721.1/5122.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Prosser, Christopher Skinner 1978. « Two Trees ». Thesis, University of Oregon, 2010. http://hdl.handle.net/1794/11048.

Texte intégral

Résumé :

1 score (viii, 79 p.) A print copy of this thesis is available through the UO Libraries. Search the library catalog for the location and call number.
The Two Trees is a fifteen-minute musical composition for orchestra. Inspired by William Butler Yeats' poem of the same name, the piece depicts the images described by Yeats' poetic narrative through a double theme and variations form consisting of two contrasting themes that are related, one ascending and one descending. Each theme represents one of the two contrasting sections of the poem and is followed by a set of five variations for a total of ten. Since the rhyme scheme of each section of the poem is divided into five phrases of four lines, each musical variation corresponds to four lines of text.
Committee in Charge: David Crumb, Chair; Robert Kyr; Jack Boss

Styles APA, Harvard, Vancouver, ISO, etc.

Taylor, Paul Clifford. « Classification trees ». Thesis, University of Bath, 1990. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.306312.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Plus de sources

Livres sur le sujet "Trees"

Williams, Nancy Noel. Trees, trees, trees. Washington, DC : Teaching Strategies, 2010.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Parsons, Sharon. Save trees plant trees. Christchurch, New Zealand : The Literacy Tower, 2014.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Christle, Heather. The trees the trees. Portland, OR : Octopus Books, 2011.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Bajaj, Y. P. S., 1936-, dir. Trees. Berlin : Springer-Verlag, 1986.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Luna, R. K. Plantation trees. Dehra Dun, India : International Book Distributors, 1996.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Richardson, Joy. Trees. New York : F. Watts, 1993.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Coombes, Allen J. Trees. New York : Dorling Kindersley, Inc., 1992.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Finn, David. Trees. New York, NY : Ruder Finn Press, 2007.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Gates, Galen. Trees. New York : Pantheon Books, 1996.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Wetton, Molly. Trees. Guildford : Guildford Teachers Centre, 1985.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Plus de sources

Chapitres de livres sur le sujet "Trees"

Sengupta, Saumyendra, et Carl Phillip Korobkin. « Trees and Tries ». Dans C++, 409–525. New York, NY : Springer New York, 1994. http://dx.doi.org/10.1007/978-1-4612-2636-9_8.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Mattheck, Gerhard Claus. « Introduction ». Dans Trees, 1–3. Berlin, Heidelberg : Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-58207-3_1.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Mattheck, Gerhard Claus. « The Absolute Minimum of Mechanical Knowledge ». Dans Trees, 3–8. Berlin, Heidelberg : Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-58207-3_2.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Mattheck, Gerhard Claus. « How the Tree Minimizes Its External Loading ». Dans Trees, 9–11. Berlin, Heidelberg : Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-58207-3_3.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Mattheck, Gerhard Claus. « Even Load Distribution : The Hypothesis of Constant Stress on the Surface ». Dans Trees, 12–16. Berlin, Heidelberg : Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-58207-3_4.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Mattheck, Gerhard Claus. « Mechanical Classification of Adaptive Growth ». Dans Trees, 16–20. Berlin, Heidelberg : Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-58207-3_5.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Mattheck, Gerhard Claus. « Case Studies ». Dans Trees, 20–115. Berlin, Heidelberg : Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-58207-3_6.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Mattheck, Gerhard Claus. « Conclusions ». Dans Trees, 116–17. Berlin, Heidelberg : Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-58207-3_7.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Ioffe, Dmitry. « Extremality of the Disordered State for the Ising Model on General Trees ». Dans Trees, 3–14. Basel : Birkhäuser Basel, 1996. http://dx.doi.org/10.1007/978-3-0348-9037-3_1.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Benassi, Albert. « Arbres et Grandes Déviations ». Dans Trees, 135–40. Basel : Birkhäuser Basel, 1996. http://dx.doi.org/10.1007/978-3-0348-9037-3_10.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "Trees"

Jawaharlal, Mariappan, Gustavo Vargas et Lorenzo Gutierrez. « The Plant Kingdom in Engineering Design : Learning to Design From Trees ». Dans ASME 2017 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/imece2017-72497.

Texte intégral

Résumé :

A tree may be the earliest multifunctional structure, and wood is the oldest known engineering material. Yet, trees have no place in engineering education. If we view a tree from merely a mechanical or civil engineering perspective, engineering mechanics can be learned from the tree’s example. Trees have survived by adapting to the most difficult circumstances: heavy winds, rains, floods, droughts, earthquakes, mammal damage, human intervention, etc. The root system must be strong and flexible enough to support the tree’s entire structure from varying load conditions and to provide food storage and nutrient transfer. The stem system provides structural support for the tree’s above-the-ground parts and transfers water and nutrients from the roots through the network of thick-walled cells to other parts of the tree. Leaves produce food and form the surface area surrounding the tree. Leaves come in a variety of shapes and sizes. The tree’s crown, comprising branches, leaves, and reproductive elements, help the tree to catch more sunlight. It moves upward and outward to expose more of its leaves to direct sunlight for photosynthesis while maintaining physical balance on the earth. A tree’s lifecycle can span hundreds of years, despite its vulnerability to constantly changing loads throughout the day and throughout its life. In monsoon and windy seasons, trees endure extremely difficult fatigue-loading. Various parts of the tree and its stem are subjected to combined loading conditions: tension, compression, shear, bending, and torsion. Trees develop and adapt stress management strategies by adjusting their shapes to the type or level of stress they endure: they add more mass where more strength is needed, allows material to easily break off (or physiologically inactive) from locations where it is not necessary, design optimum shapes, and create variable notch radii for reducing stress concentration. But a tree is much more than a structural member. It provides food and shelter for wildlife. It absorbs atmospheric carbon dioxide and produces oxygen. It lowers air temperature and facilitates the water cycle. Structural analysis of a tree can benefit engineering students and practicing engineers alike. Furthermore, a deeper understanding of trees can help us to create multifunctional designs that are in a symbiotic relationship with other members in the system. In short, studying tree mechanics can help us to become better engineers. This paper presents our efforts to integrate trees into engineering curricula to teach mechanics ranging from equilibrium study to stress analysis. Students of statics, dynamics, the strength of materials, stress analysis, material science, design, etc., can benefit from learning about trees. This approach enables students to understand the complexities of real-world living systems, appreciate the genius of nature’s design, and develop methods for creating sustainable designs.

Styles APA, Harvard, Vancouver, ISO, etc.

Izza, Yacine, Alexey Ignatiev et Joao Marques-Silva. « On Tackling Explanation Redundancy in Decision Trees (Extended Abstract) ». Dans Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California : International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/779.

Texte intégral

Résumé :

Claims about the interpretability of decision trees can be traced back to the origins of machine learning (ML). Indeed, given some input consistent with a decision tree's path, the explanation for the resulting prediction consists of the features in that path. Moreover, a growing number of works propose the use of decision trees, and of other so-called interpretable models, as a possible solution for deploying ML models in high-risk applications. This paper overviews recent theoretical and practical results which demonstrate that for most decision trees, tree paths exhibit so-called explanation redundancy, in that logically sound explanations can often be significantly more succinct than what the features in the path dictates. More importantly, such decision tree explanations can be computed in polynomial-time, and so can be produced with essentially no effort other than traversing the decision tree. The experimental results, obtained on a large range of publicly available decision trees, support the paper's claims.

Styles APA, Harvard, Vancouver, ISO, etc.

Baldereschi, Marzia. « 2nd Meeting TRANSLATIONAL RESEARCH on STROKE (TREES) ». Dans 2nd Meeting TRANSLATIONAL RESEARCH on STROKE (TREES), sous la direction de Benedetta Piccardi, Vanessa Palumbo, Cristina Sarti, Anna Letizia Allegra Mascaro, Emilia Conti et Alessandro Sodero. Frontiers Media SA, 2023. http://dx.doi.org/10.3389/978-2-88971-031-7.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Boitet, Ch, et Y. Zaharin. « Representation trees and string-tree correspondences ». Dans the 12th conference. Morristown, NJ, USA : Association for Computational Linguistics, 1988. http://dx.doi.org/10.3115/991635.991648.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Taynik, A., V. Barinov et V. Myglan. « SEARCH, PROTECTION AND MONITORING OF THE OLDEST TREES IN SOUTH ». Dans Reproduction, monitoring and protection of natural, natural-anthropogenic and anthropogenic landscapes. FSBE Institution of Higher Education Voronezh State University of Forestry and Technologies named after G.F. Morozov, 2022. http://dx.doi.org/10.34220/rmpnnaal2021_54-58.

Texte intégral

Résumé :

The article presents the results of 20 years of research work of the "Siberian dendrochronological laboratory". The studies allowed us to collect information about old-age trees for the territory of South Siberia. As a result, two Siberian larch trees of maximum age (779 years - the tree currently growing, 1307 years - a dead tree) were found on the territory of South Siberia.

Styles APA, Harvard, Vancouver, ISO, etc.

Narodytska, Nina, Alexey Ignatiev, Filipe Pereira et Joao Marques-Silva. « Learning Optimal Decision Trees with SAT ». Dans Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California : International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/189.

Texte intégral

Résumé :

Explanations of machine learning (ML) predictions are of fundamental importance in different settings. Moreover, explanations should be succinct, to enable easy understanding by humans. Decision trees represent an often used approach for developing explainable ML models, motivated by the natural mapping between decision tree paths and rules. Clearly, smaller trees correlate well with smaller rules, and so one challenge is to devise solutions for computing smallest size decision trees given training data. Although simple to formulate, the computation of smallest size decision trees turns out to be an extremely challenging computational problem, for which no practical solutions are known. This paper develops a SAT-based model for computing smallest-size decision trees given training data. In sharp contrast with past work, the proposed SAT model is shown to scale for publicly available datasets of practical interest.

Styles APA, Harvard, Vancouver, ISO, etc.

Shibasaki, Satoshi, et Hideki Aoyama. « Development of Wood Grain Pattern Design System ». Dans ASME 2009 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2009. http://dx.doi.org/10.1115/detc2009-87094.

Texte intégral

Résumé :

Various approaches for generating woodgrain patterns using computer graphics have been proposed so far. However, the generation of various woodgrain patterns with conventional methods is difficult due to the need for the adjustment of numerous parameters to express a real woodgrain pattern. In this paper, a new mathematical approach for generating woodgrain patterns is proposed. Virtual trees are generated by simulating tree growing based on past actual weather information obtained from public organizations, and woodgrain patterns are then acquired by cutting the trunks of the virtual trees. In order to simulate tree growing, growth models of tree are constructed in consideration of dendrological characteristics and environmental conditions. Growth of tree is influenced by various environmental factors, such as sunlight, temperature, carbon dioxide concentration, wind, precipitation, soil nutrient, inclination of ground, survival amongst surrounding trees, etc. With this system, the growth model of trees is constructed based on precipitation, temperature, sunlight, and inclination of ground, which especially have strong effects on tree growth. With this approach, various types of virtual trees can be obtained by changing growth conditions such as period and location of growth without the need to reset complicated parameters of tree species, and then the virtual trees can be cut at arbitrary areas, thus allowing a variety of woodgrain patterns to be easily generated by one parameter setup.

Styles APA, Harvard, Vancouver, ISO, etc.

Babenko, Maxim, Pawel Gawrychowski, Tomasz Kociumaka et Tatiana Starikovskaya. « Wavelet Trees Meet Suffix Trees ». Dans Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA : Society for Industrial and Applied Mathematics, 2014. http://dx.doi.org/10.1137/1.9781611973730.39.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Jain, Varun, James Lennon et Harshita Gupta. « LSM-Trees and B-Trees ». Dans SIGMOD/PODS '19 : International Conference on Management of Data. New York, NY, USA : ACM, 2019. http://dx.doi.org/10.1145/3299869.3300097.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

STRAUPE, Inga, et Līga LIEPA. « AN ASSESSMENT OF RETENTION TREES IN HYLOCOMIOSA FOREST TYPE IN SOUTHERN LATVIA ». Dans RURAL DEVELOPMENT. Aleksandras Stulginskis University, 2018. http://dx.doi.org/10.15544/rd.2017.111.

Texte intégral

Résumé :

In Latvia the forest legislation requires that at least five living trees must be retained per hectare after clear-cutting. It is known that retention trees significantly increase the biodiversity in production forest landscape. After clear-cutting retention trees function as habitats for various lichens, mosses, insects, fungi and birds. Over time retention trees are incorporated into the young forests stand and provide presence of old trees, which is necessary for many endangered and rare species. After the death, these trees turn into coarse woody debris which is an essential habitat and feeding source for many taxa. However, the conservation and mortality of the retention trees has not been studied extensively because this approach has been established recently. The aim of this study was to evaluate development of the retention trees in Hylocomiosa type of forests in Southern Latvia. In total 12 young forest stands were surveyed in 2009 and 2015. The total area – 13.7 ha, on average forest stand size varies from 0.5 to 3.0 ha. All the studied sites were harvested in 2002, 2004, 2006 and 2008. All measurements of tree species, height, and diameter and defoliation class assessed and the status of tree (growing tree, coarse woody debris – snags, stems and downed logs) was indicated. Results show that after the studied period of seven years 24 retention trees died. Average level of the tree mortality is 15 %. The mortality level of Scots pine retention trees is 5.8 %, for aspen – 50 % and that for birch – 92.3 %. An average it is 8.5 green retention trees per 1 ha of young stand (22.9 m3 ha-1). On average 2.3 pieces coarse woody debris are per 1 ha of young stand (3.52 m3 ha-1), mostly - aspen wood (2.4 m3 ha-1). Woody debris of the young stands is divided to the first 4 decay levels according to classification (Stokland et al., 2001). 50 % of the listed woody debris is related to the 3rd decay level which means that woody debris is moderately decomposed.

Styles APA, Harvard, Vancouver, ISO, etc.

Rapports d'organisations sur le sujet "Trees"

Duguma, Lalisa, Peter Minang, Ermias Aynekulu, Sammy Carsan, Judith Nzyoka, Alagie Bah et Ramni Jamnadass. From Tree Planting to Tree Growing : Rethinking Ecosystem Restoration Through Trees. World Agroforestry Centre, 2020. http://dx.doi.org/10.5716/wp20001.pdf.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Chamberlain, J. NTFPs from trees. Asheville, NC : U.S. Department of Agriculture, Forest Service, Southern Research Station, 2020. http://dx.doi.org/10.2737/srs-su-137.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Chamberlain, J. NTFPs from trees. Asheville, NC : U.S. Department of Agriculture, Forest Service, Southern Research Station, 2020. http://dx.doi.org/10.2737/srs-su-138.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Chamberlain, J. NTFPs from trees. Asheville, NC : U.S. Department of Agriculture, Forest Service, Southern Research Station, 2020. http://dx.doi.org/10.2737/srs-su-139.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Chamberlain, J. NTFPs from trees. Asheville, NC : U.S. Department of Agriculture, Forest Service, Southern Research Station, 2020. http://dx.doi.org/10.2737/srs-su-140.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Chamberlain, J. NTFPs from trees. Asheville, NC : U.S. Department of Agriculture, Forest Service, Southern Research Station, 2020. http://dx.doi.org/10.2737/srs-su-141.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Chamberlain, J. NTFPs from trees. Asheville, NC : U.S. Department of Agriculture, Forest Service, Southern Research Station, 2020. http://dx.doi.org/10.2737/srs-su-142.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Chamberlain, J. NTFPs from trees. Asheville, NC : U.S. Department of Agriculture, Forest Service, Southern Research Station, mars 2021. http://dx.doi.org/10.2737/srs-su-144.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Chamberlain, J. NTFPs from trees. Asheville, NC : U.S. Department of Agriculture, Forest Service, Southern Research Station, mars 2021. http://dx.doi.org/10.2737/srs-su-145.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Chamberlain, J. NTFPs from trees. Asheville, NC : U.S. Department of Agriculture, Forest Service, Southern Research Station, 2021. http://dx.doi.org/10.2737/srs-su-147.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!