Auswahl der wissenschaftlichen Literatur zum Thema „Trees“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Trees" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Trees":
Jasmine, Jasmine, Pankaj Bhambri und Dr O. P. Gupta Dr. O.P. Gupta. „Analyzing the Phylogenetic Trees with Tree- building Methods“. Indian Journal of Applied Research 1, Nr. 7 (01.10.2011): 83–85. http://dx.doi.org/10.15373/2249555x/apr2012/25.
Sefidi, Kiomars, und Carolyn A. Copenheaver. „Tree-Related Microhabitats: A Comparison of Managed and Unmanaged Oriental Beech–Dominated Forests in Northern Iran“. Forest Science 66, Nr. 6 (24.08.2020): 747–53. http://dx.doi.org/10.1093/forsci/fxaa028.
Asbeck, Thomas, Christian Messier und Jürgen Bauhus. „Retention of tree-related microhabitats is more dependent on selection of habitat trees than their spatial distribution“. European Journal of Forest Research 139, Nr. 6 (07.07.2020): 1015–28. http://dx.doi.org/10.1007/s10342-020-01303-6.
Brower, Andrew V. Z. „Trees and more trees“. Cladistics 32, Nr. 2 (06.05.2015): 215–18. http://dx.doi.org/10.1111/cla.12122.
Alperin, J. L. „Trees and Brauer trees“. Discrete Mathematics 83, Nr. 1 (Juli 1990): 127–28. http://dx.doi.org/10.1016/0012-365x(90)90228-a.
Chaffey, N. J. „Popular trees, specialist trees“. New Phytologist 154, Nr. 3 (06.06.2002): 548–49. http://dx.doi.org/10.1046/j.1469-8137.2002.00434_3.x.
Steele, James, und Anne Kandler. „Language trees ≠ gene trees“. Theory in Biosciences 129, Nr. 2-3 (09.06.2010): 223–33. http://dx.doi.org/10.1007/s12064-010-0096-6.
Pollin, Burton R. „Kilmer's Trees and Asselineau's Trees“. Explicator 64, Nr. 3 (März 2006): 160–62. http://dx.doi.org/10.3200/expl.64.3.160-162.
Maddison, Wayne P. „Gene Trees in Species Trees“. Systematic Biology 46, Nr. 3 (01.09.1997): 523–36. http://dx.doi.org/10.1093/sysbio/46.3.523.
Azais, Romain, Guillaume Cerutti, Didier Gemmerle; und Florian Ingels. „treex: a Python package for manipulating rooted trees“. Journal of Open Source Software 4, Nr. 38 (24.06.2019): 1351. http://dx.doi.org/10.21105/joss.01351.
Dissertationen zum Thema "Trees":
Okoth, Isaac Owino. „Combinatorics of oriented trees and tree-like structures“. Thesis, Stellenbosch : Stellenbosch University, 2015. http://hdl.handle.net/10019.1/96860.
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.
Drinkwater, Kara M. „Trees“. VCU Scholars Compass, 2006. http://hdl.handle.net/10156/1907.
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.
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.
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.
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.
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.
Balakrishnan, Anantaram, Thomas L. Magnanti und 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.
Magnanti, Thomas L., und Laurence A. Wolsey. „Optimal Trees“. Massachusetts Institute of Technology, Operations Research Center, 1994. http://hdl.handle.net/1721.1/5122.
Prosser, Christopher Skinner 1978. „Two Trees“. Thesis, University of Oregon, 2010. http://hdl.handle.net/1794/11048.
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
Taylor, Paul Clifford. „Classification trees“. Thesis, University of Bath, 1990. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.306312.
Bücher zum Thema "Trees":
Williams, Nancy Noel. Trees, trees, trees. Washington, DC: Teaching Strategies, 2010.
Christle, Heather. The trees the trees. Portland, OR: Octopus Books, 2011.
Parsons, Sharon. Save trees plant trees. Christchurch, New Zealand: The Literacy Tower, 2014.
Bajaj, Y. P. S., 1936-, Hrsg. Trees. Berlin: Springer-Verlag, 1986.
Luna, R. K. Plantation trees. Dehra Dun, India: International Book Distributors, 1996.
Richardson, Joy. Trees. New York: F. Watts, 1993.
Coombes, Allen J. Trees. New York: Dorling Kindersley, Inc., 1992.
Finn, David. Trees. New York, NY: Ruder Finn Press, 2007.
Gates, Galen. Trees. New York: Pantheon Books, 1996.
Wetton, Molly. Trees. Guildford: Guildford Teachers Centre, 1985.
Buchteile zum Thema "Trees":
Sengupta, Saumyendra, und Carl Phillip Korobkin. „Trees and Tries“. In C++, 409–525. New York, NY: Springer New York, 1994. http://dx.doi.org/10.1007/978-1-4612-2636-9_8.
Mattheck, Gerhard Claus. „Introduction“. In Trees, 1–3. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-58207-3_1.
Mattheck, Gerhard Claus. „The Absolute Minimum of Mechanical Knowledge“. In Trees, 3–8. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-58207-3_2.
Mattheck, Gerhard Claus. „How the Tree Minimizes Its External Loading“. In Trees, 9–11. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-58207-3_3.
Mattheck, Gerhard Claus. „Even Load Distribution: The Hypothesis of Constant Stress on the Surface“. In Trees, 12–16. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-58207-3_4.
Mattheck, Gerhard Claus. „Mechanical Classification of Adaptive Growth“. In Trees, 16–20. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-58207-3_5.
Mattheck, Gerhard Claus. „Case Studies“. In Trees, 20–115. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-58207-3_6.
Mattheck, Gerhard Claus. „Conclusions“. In Trees, 116–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-58207-3_7.
Ioffe, Dmitry. „Extremality of the Disordered State for the Ising Model on General Trees“. In Trees, 3–14. Basel: Birkhäuser Basel, 1996. http://dx.doi.org/10.1007/978-3-0348-9037-3_1.
Benassi, Albert. „Arbres et Grandes Déviations“. In Trees, 135–40. Basel: Birkhäuser Basel, 1996. http://dx.doi.org/10.1007/978-3-0348-9037-3_10.
Konferenzberichte zum Thema "Trees":
Jawaharlal, Mariappan, Gustavo Vargas und Lorenzo Gutierrez. „The Plant Kingdom in Engineering Design: Learning to Design From Trees“. In ASME 2017 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/imece2017-72497.
Izza, Yacine, Alexey Ignatiev und Joao Marques-Silva. „On Tackling Explanation Redundancy in Decision Trees (Extended Abstract)“. In 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.
Baldereschi, Marzia. „2nd Meeting TRANSLATIONAL RESEARCH on STROKE (TREES)“. In 2nd Meeting TRANSLATIONAL RESEARCH on STROKE (TREES), herausgegeben von Benedetta Piccardi, Vanessa Palumbo, Cristina Sarti, Anna Letizia Allegra Mascaro, Emilia Conti und Alessandro Sodero. Frontiers Media SA, 2023. http://dx.doi.org/10.3389/978-2-88971-031-7.
Boitet, Ch, und Y. Zaharin. „Representation trees and string-tree correspondences“. In the 12th conference. Morristown, NJ, USA: Association for Computational Linguistics, 1988. http://dx.doi.org/10.3115/991635.991648.
Taynik, A., V. Barinov und V. Myglan. „SEARCH, PROTECTION AND MONITORING OF THE OLDEST TREES IN SOUTH“. In 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.
Narodytska, Nina, Alexey Ignatiev, Filipe Pereira und Joao Marques-Silva. „Learning Optimal Decision Trees with SAT“. In 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.
Shibasaki, Satoshi, und Hideki Aoyama. „Development of Wood Grain Pattern Design System“. In ASME 2009 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2009. http://dx.doi.org/10.1115/detc2009-87094.
Babenko, Maxim, Pawel Gawrychowski, Tomasz Kociumaka und Tatiana Starikovskaya. „Wavelet Trees Meet Suffix Trees“. In 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.
Jain, Varun, James Lennon und Harshita Gupta. „LSM-Trees and B-Trees“. In SIGMOD/PODS '19: International Conference on Management of Data. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3299869.3300097.
STRAUPE, Inga, und Līga LIEPA. „AN ASSESSMENT OF RETENTION TREES IN HYLOCOMIOSA FOREST TYPE IN SOUTHERN LATVIA“. In RURAL DEVELOPMENT. Aleksandras Stulginskis University, 2018. http://dx.doi.org/10.15544/rd.2017.111.
Berichte der Organisationen zum Thema "Trees":
Duguma, Lalisa, Peter Minang, Ermias Aynekulu, Sammy Carsan, Judith Nzyoka, Alagie Bah und 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.
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.
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.
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.
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.
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.
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.
Chamberlain, J. NTFPs from trees. Asheville, NC: U.S. Department of Agriculture, Forest Service, Southern Research Station, März 2021. http://dx.doi.org/10.2737/srs-su-144.
Chamberlain, J. NTFPs from trees. Asheville, NC: U.S. Department of Agriculture, Forest Service, Southern Research Station, März 2021. http://dx.doi.org/10.2737/srs-su-145.
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.