Log in

Relevant bibliographies by topics / Tree / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Tree.

Dissertations / Theses on the topic 'Tree'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Tree.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Simmons, Mark Trevor. "Tree-grass and tree-tree interactions in a temperate savanna." Diss., Texas A&M University, 2003. http://hdl.handle.net/1969.1/1168.

Full text

Abstract:

Savannas comprise over one eighth of the world's land surface with some 50 Mha in North America alone. They are productive systems supporting a high level of both faunal and floral diversity and are of increasing socioeconomic importance. The maintenance and formation of savannas have been attributed to climate, soils, herbivory and fire. However, the reasons for the coexistence of trees and the grass layer have still to be determined. These two contrasting life forms create a complex of intra- and interspecific positive, negative, and neutral interactions, few of which have been quantified.

APA, Harvard, Vancouver, ISO, and other styles

2

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

Full text

Abstract:

Thesis (PhD)--Stellenbosch University, 2015.<br>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 s

APA, Harvard, Vancouver, ISO, and other styles

3

Creus, López Carles. "Tree automata with constraints and tree homomorphisms." Doctoral thesis, Universitat Politècnica de Catalunya, 2016. http://hdl.handle.net/10803/394077.

Full text

Abstract:

Automata are a widely used formalism in computer science as a concise representation for sets. They are interesting from a theoretical and practical point of view. This work is focused on automata that are executed on tree-like structures, and thus, define sets of trees. Moreover, we tackle automata that are enhanced with the possibility to check (dis)equality constraints, i.e., where the automata are able to test whether specific subtrees of the input tree are equal or different. Two distinct mechanisms are considered for defining which subtrees have to be compared in the evaluation of the co

APA, Harvard, Vancouver, ISO, and other styles

4

Mahoney, James Raymond. "Tree Graphs and Orthogonal Spanning Tree Decompositions." PDXScholar, 2016. http://pdxscholar.library.pdx.edu/open_access_etds/2944.

Full text

Abstract:

Given a graph G, we construct T(G), called the tree graph of G. The vertices of T(G) are the spanning trees of G, with edges between vertices when their respective spanning trees differ only by a single edge. In this paper we detail many new results concerning tree graphs, involving topics such as clique decomposition, planarity, and automorphism groups. We also investigate and present a number of new results on orthogonal tree decompositions of complete graphs.

APA, Harvard, Vancouver, ISO, and other styles

5

McCarthy, Meghan E. "THE LEMON TREE: MY TREE OF LIFE." CSUSB ScholarWorks, 2014. https://scholarworks.lib.csusb.edu/etd/49.

Full text

Abstract:

The Lemon Tree is a collection of poems that arose from my attempt to capture memories of influential experiences in growing up. The poems are written in prose blocks and move in and out of childlike and adult sensibilities, creating the disillusion of time and memory. The poems themselves are comments on the unreliability and limited scope of memory and compare remembrance to dreams. This suggests that time moves more fluidly than the waking world accepts. Through looking back, through prisms, the speaker remembers experiences that impacted her development as we follow her on a journey to com

APA, Harvard, Vancouver, ISO, and other styles

6

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Lieberman, Michael (Michael R. ). "Combining phrase-based and tree-to-tree translation." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/45635.

Full text

Abstract:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Includes bibliographical references (p. 39-40).<br>We present a novel approach to multi-engine machine translation, using a feature-based classification algorithm. Instead of just using language models, translation models, or internal confidence scores, we sought out other features that could be used to determine which of two tr

APA, Harvard, Vancouver, ISO, and other styles

8

Götze, Doreen. "Weighted Unranked Tree Automata over Tree Valuation Monoids." Doctoral thesis, Universitätsbibliothek Leipzig, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-221154.

Full text

Abstract:

Quantitative aspects of systems, like the maximal consumption of resources, can be modeled by weighted automata. The usual approach is to weight transitions with elements of a semiring and to define the behavior of the weighted automaton by mul- tiplying the transition weights along a run. In this thesis, we define and investigate a new class of weighted automata over unranked trees which are defined over valuation monoids. By turning to valuation monoids we use a more general cost model: the weight of a run is now determined by a global valuation function. Besides the binary cost functions im

APA, Harvard, Vancouver, ISO, and other styles

9

Cha, Kyoung-Choul. "Dream tree /." Online version of thesis, 1995. http://hdl.handle.net/1850/12139.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Collier, Samantha Noelle. "Silo tree." Thesis, University of Iowa, 2015. https://ir.uiowa.edu/etd/1573.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Wu, Li. "Distributed true string B-tree peer-to-peer overlay networks." Thesis, University of Ottawa (Canada), 2006. http://hdl.handle.net/10393/27197.

Full text

Abstract:

A fundamental problem that confronts P2P Internet applications is to efficiently locate the physical (IP) node that stores a particular data item. To tackle this application-level routing problem, this thesis proposes a new P2P overlay network, called Distributed True String B-tree (DTSBT) P2P overlay network. Unlike popular Distributed Hash Table (DHT)-based P2P overlay networks which use DHT as their core data structure, the DTSBT P2P overlay network employs a new data structure, DTSBT as its core data structure. A DTSBT is a hybrid distributed data structure, in which all peers' routing tab

APA, Harvard, Vancouver, ISO, and other styles

12

Choi, Myung Jin Ph D. Massachusetts Institute of Technology. "Trees and beyond : exploiting and improving tree-structured graphical models." Thesis, Massachusetts Institute of Technology, 2011. http://hdl.handle.net/1721.1/62888.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student submitted PDF version of thesis.<br>Includes bibliographical references (p. 169-179).<br>Probabilistic models commonly assume that variables are independent of each other conditioned on a subset of other variables. Graphical models provide a powerful framework for encoding such conditional independence stru

APA, Harvard, Vancouver, ISO, and other styles

13

King, Stuart. "Optimizations and applications of Trie-Tree based frequent pattern mining." Diss., Connect to online resource - MSU authorized users, 2006.

Find full text

Abstract:

Thesis (M. S.)--Michigan State University. Dept. of Computer Science and Engineering, 2006.<br>Title from PDF t.p. (viewed on June 19, 2009) Includes bibliographical references (p. 79-80). Also issued in print.

APA, Harvard, Vancouver, ISO, and other styles

14

Zhu, Sha (Joe). "Stochastic tree models and probabilistic modelling of gene trees of given species networks." Thesis, University of Canterbury. Department of Mathematics and Statistics, 2013. http://hdl.handle.net/10092/7944.

Full text

Abstract:

In the pre-genomic era, the relationships among species and their evolutionary histories were often determined by examining the fossil records. In the genomic era, these relationships are identified by analysing the genetic data, which also enables us to take a close-up view of the differences between the individual samples. Nevertheless, these relationships are often described by a tree-like structure or a network. In this thesis, we investigate some of the models that are used to describe these relationships. This thesis can be divided into two main parts. The first part focuses on investig

APA, Harvard, Vancouver, ISO, and other styles

15

SANTOS, ALEXANDRE JOSE DOS. "TREE-STRUCTURE SMOOTH TRANSITION VECTOR AUTOREGRESSIVE MODELS – STVAR-TREE." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2009. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=15888@1.

Full text

Abstract:

COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>Esta dissertação tem como objetivo principal introduzir uma formulação de modelo não-linear multivariado, a qual combina o modelo STVAR (Smooth Transition Vector Autoregressive) com a metodologia CART (Classification and Regression Tree) a fim de utilizá-lo para geração de cenários e de previsões. O modelo resultante é um Modelo Vetorial Auto-Regressivo com Transição Suave Estruturado por Árvores, denominado STVAR-Tree e tem como base o conceito de múltiplos regimes, definidos por árvore binária. A especificação do modelo é feita

APA, Harvard, Vancouver, ISO, and other styles

16

Cowan, Brooke A. (Brooke Alissa) 1972. "A tree-to-tree model for statistical machine translation." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/44689.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.<br>Includes bibliographical references (p. 227-234).<br>In this thesis, we take a statistical tree-to-tree approach to solving the problem of machine translation (MT). In a statistical tree-to-tree approach, first the source-language input is parsed into a syntactic tree structure; then the source-language tree is mapped to a target-language tree. This kind of approach has several advantages. For one, parsing the input generates valuable information about its meaning. In addition

APA, Harvard, Vancouver, ISO, and other styles

17

Teichmann, Markus. "Expressing Context-Free Tree Languages by Regular Tree Grammars." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-224756.

Full text

Abstract:

In this thesis, three methods are investigated to express context-free tree languages by regular tree grammars. The first method is a characterization. We show restrictions to context-free tree grammars such that, for each restricted context-free tree grammar, a regular tree grammar can be constructed that induces the same tree language. The other two methods are approximations. An arbitrary context-free tree language can be approximated by a regular tree grammar with a restricted pushdown storage. Furthermore, we approximate weighted context-free tree languages, induced by weighted linear non

APA, Harvard, Vancouver, ISO, and other styles

18

Yao, Chu. "Quad general tree drawing algorithm and general trees characterization : towards an environment for the experimental study on general tree drawing algorithms /." Full text available online, 2008. http://www.lib.rowan.edu/find/theses.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Goldman, Daniel A. "Multidimensional range searching using G-tree and B*-tree indexing." Diss., Online access via UMI:, 2005.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

20

Cambronero, Christoffer. "The Brownian tree." Thesis, Uppsala universitet, Matematisk statistik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-208571.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Fitzgerald, Caitlin Anne. "The Thorn Tree." Thesis, Boston College, 2007. http://hdl.handle.net/2345/376.

Full text

Abstract:

Thesis advisor: Thomas Kaplan-Maxfield<br>We remember childhood injustices for the rest of our lives. They are thorn-like memories, piercing and immediate, affecting us long after we have matured and moved on with our lives. The wounds of childhood have been written about by some of literature's greatest writers, including most notably James Joyce, in his masterpiece A Portrait of the Artist as a Young Man. In this creative work I try to investigate, through the voices of children, the role of wounds in the growing character of a child. Wounds both literal and metaphorical dominate the narrati

APA, Harvard, Vancouver, ISO, and other styles

22

George, Zachary J. Sir. "Beneath Cuoi's Tree." ScholarWorks@UNO, 2012. http://scholarworks.uno.edu/td/1589.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Phillips, Esther P. "Ghost Tree Social." FIU Digital Commons, 2013. http://digitalcommons.fiu.edu/etd/829.

Full text

Abstract:

GHOST TREE SOCIAL tells a coming out story of sorts. In terms of style, many of the poems are short, imagistic lyrics, though some are extended catalogues. Specific natural images—lakes, rivers, and snow—are often contrasted with cultural markers. The imagistic poems are thinking through the work of Sylvia Plath. The catalogue poems shift between diaristic, narrative, and critical modes, responding to the poetry of Elizabeth Bishop and the essays of Edouard Glissant. Voice-driven fragments disrupt the more traditional lyric poems. The fragments fall between formal lyrics like confetti from a g

APA, Harvard, Vancouver, ISO, and other styles

24

Rudd, Ralph. "Optimal tree methods." Master's thesis, University of Cape Town, 2014. http://hdl.handle.net/11427/8567.

Full text

Abstract:

Includes bibliographical references.<br>Although traditional tree methods are the simplest numerical methods for option pricing, much work remains to be done regarding their optimal parameterization and construction. This work examines the parameterization of traditional tree methods as well as the techniques commonly used to accelerate their convergence. The performance of selected, accelerated binomial and trinomial trees is then compared to an advanced tree method, Figlewski and Gao's Adaptive Mesh Model, when pricing an American put and a Down-And-Out barrier option.

APA, Harvard, Vancouver, ISO, and other styles

25

Pogson, Aimee L. "Tree Frog Madness." Bowling Green State University / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1245380440.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Rossin, Samuel. "Steiner Tree Games." Oberlin College Honors Theses / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=oberlin1464700445.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Mahonski, Christopher. "A TLAPALIZQUIXOCHITL TREE." VCU Scholars Compass, 2009. http://scholarscompass.vcu.edu/etd/1838.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Lee, William W. L. (William Wai Lam) Carleton University Dissertation Computer Science. "Tree editing algorithms." Ottawa, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

29

Carlsson, David. "Tree trunk image classifier : Image classification of trees using Collaboratory, Keras and TensorFlow." Thesis, Linnéuniversitetet, Institutionen för datavetenskap och medieteknik (DM), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-98698.

Full text

Abstract:

In the forestry industry tree trunks are currently classified manually. The object of this thesis is to answer whether it is possible to automate this using modern computer hardware and image-classification of tree-trunks using machine learning algorithms. The report concludes, based on results from controlled experiments that it is possible to achieve an accuracy above 90% across the genuses Birch, Pine and Spruce with a classification-time per tree shorter than 500 milli seconds. The report further compares these results against previous research and concludes that better results are probabl

APA, Harvard, Vancouver, ISO, and other styles

30

MacKinnon, Richard Kyle. "Seeing the forest for the trees: tree-based uncertain frequent pattern mining." Springer International Publishing, 2014. http://hdl.handle.net/1993/31059.

Full text

Abstract:

Many frequent pattern mining algorithms operate on precise data, where each data point is an exact accounting of a phenomena (e.g., I have exactly two sisters). Alas, reasoning this way is a simplification for many real world observations. Measurements, predictions, environmental factors, human error, &ct. all introduce a degree of uncertainty into the mix. Tree-based frequent pattern mining algorithms such as FP-growth are particularly efficient due to their compact in-memory representations of the input database, but their uncertain extensions can require many more tree nodes. I propose new

APA, Harvard, Vancouver, ISO, and other styles

31

Tong, Mei-ka Julie. "Tree planting and air quality in Hong Kong urban areas /." View the Table of Contents & Abstract, 2005. http://sunzi.lib.hku.hk/hkuto/record/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Larson, Heidi Elaine. ""Alchemy of Desire/Dead Man's Blues": To Tree Or Not To Tree." OpenSIUC, 2015. https://opensiuc.lib.siu.edu/theses/1768.

Full text

Abstract:

The subjects of grief and of the afterlife are ones that have been discussed and analyzed for centuries, with no conclusive answers as to where we go or how we should go on. In “Alchemy of Desire/ Dead Man’s Blues”, Caridad Svich continues this discussion through a narrative, centered around a group of women dealing with the aftermath of a loss. She uses the term alchemy as an allegory for one’s ability to transcend and transform, and in turn, come to know the meaning of life…and death. This paper serves as a documentation of the SIUC Theater Department’s process and results in bringing this c

APA, Harvard, Vancouver, ISO, and other styles

33

Biondi, Franco. "Development of a Tree-Ring Network for the Italian Peninsula." Tree-Ring Society, 1992. http://hdl.handle.net/10150/262358.

Full text

Abstract:

This article describes the analysis of tree-ring collections from standing trees of sixteen species at twenty sites distributed throughout the Italian Peninsula. Visual and numerical crossdating among ring widths allowed the computation of standard and residual tree-ring chronologies. Relationships among chronologies were identified by Spearman's coefficient of rank correlation, using Bonferroni's inequality to adjust significance level. The oldest living tree sampled to date is a 963-year old palebark pine (Pinus leucodermis Ant.) at Parco del Pollino. Individuals more than two centuries old

APA, Harvard, Vancouver, ISO, and other styles

34

Grissino-Mayer, Henri D. "An Updated List of Species Used in Tree-Ring Research." Tree-Ring Society, 1993. http://hdl.handle.net/10150/262378.

Full text

Abstract:

During the past 100 years, researchers have investigated the potential of hundreds of tree and shrub species for use in applications of tree-ring research. Although several lists of species known to crossdate have been published, investigated species that do not crossdate are rarely included despite the usefulness of this information for future research. This paper provides a list of the Latin and common names of 573 species that have been investigated in tree-ring research, information on species known to crossdate, and information on species with measurement and/or chronology data in the Int

APA, Harvard, Vancouver, ISO, and other styles

35

Bhattacharyya, Amalava, Valmore C. Jr LaMarche, and Malcolm K. Hughes. "Tree-Ring Chronologies from Nepal." Tree-Ring Society, 1992. http://hdl.handle.net/10150/262376.

Full text

Abstract:

Ten ring-width based chronologies from Nepal are described and the prospects for further dendroclimatic work there reviewed briefly. The initial results are encouraging, and more intensive subregional sampling is called for. All the cores examined showed distinct annual rings, and there was little evidence of double or missing rings, except juniper at some sites and in some Pinus roxburghii trees. Difficulty was encountered in dating Pinus wallichiana and Cupressus dumosa. Individual site chronologies of Cedros deodora, P. roxburghii and P. wallichiana were particularly promising, and of high

APA, Harvard, Vancouver, ISO, and other styles

36

Daciuk, Jan. "Perfect hashing tree automata." Universität Potsdam, 2008. http://opus.kobv.de/ubp/volltexte/2008/2716/.

Full text

Abstract:

We present an algorithm that computes a function that assigns consecutive integers to trees recognized by a deterministic, acyclic, finite-state, bottom-up tree automaton. Such function is called minimal perfect hashing. It can be used to identify trees recognized by the automaton. Its value may be seen as an index in some other data structures. We also present an algorithm for inverted hashing.

APA, Harvard, Vancouver, ISO, and other styles

37

Davies, Nicholas Tuatahi. "Reverse Engineering the Tree." Thesis, University of Canterbury. Forestry, 2014. http://hdl.handle.net/10092/9600.

Full text

Abstract:

The aim of this thesis was to investigate the typical radial pattern of density and microfibril angle within Pinus radiata with respect to structural stability. In order to investigate changes in mechanical stability with different radial patterns, first experimental work was carried out in order to obtain elastic constants, Poisson ratios and limits of proportionality for green corewood and outerwood, these values, a discussion on their accuracy and the implications of the values are included along with a comparison to previous literature. These constants were used to parametrise a finite ele

APA, Harvard, Vancouver, ISO, and other styles

38

Östlund, Klara. "The Tree House Project." Thesis, KTH, Arkitektur, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-168925.

Full text

Abstract:

To be truly rooted in my final degree project, I decided to go back to something that fascinated me as a child; To live among the trees. I remember trees standing out as individuals, as landmarks, and as architecture. Cultures all around the world displays importance in their relationship to trees, be it a source for shelter, food, symbolic references or playing as a child. This project explores the actual building process, when constructing something in a living tree. It turns into both a physical and mental challange. This project is divided into two main modes; (1) a research activity, and

APA, Harvard, Vancouver, ISO, and other styles

39

Curtin, Ryan Ross. "Improving dual-tree algorithms." Diss., Georgia Institute of Technology, 2015. http://hdl.handle.net/1853/54354.

Full text

Abstract:

This large body of work is entirely centered around dual-tree algorithms, a class of algorithm based on spatial indexing structures that often provide large amounts of acceleration for various problems. This work focuses on understanding dual-tree algorithms using a new, tree-independent abstraction, and using this abstraction to develop new algorithms. Stated more clearly, the thesis of this entire work is that we may improve and expand the class of dual-tree algorithms by focusing on and providing improvements for each of the three independent components of a dual-tree algorithm: the type o

APA, Harvard, Vancouver, ISO, and other styles

40

Lucas, Maree Eleanor. "Allocation in tree seedlings." Thesis, University of Edinburgh, 1998. http://hdl.handle.net/1842/12482.

Full text

Abstract:

The hypothesis that allocation between the main tree components is controlled by the relative uptake rates of carbon dioxide and nutrient was tested by growing one-year-old sycamore seedlings (<I>Acer pseudoplatanus</I> L.) at elevated and ambient CO<SUB>2</SUB> concentrations and at two nutrient addition rates which were modelled in accordance with a predicted optimal growth function. Elevated CO<SUB>2</SUB> concentration significantly increased the leaf dry mass but did not significantly change the dry mass of any other component. In contrast nutrient addition rate had large effects on all b

APA, Harvard, Vancouver, ISO, and other styles

41

Gibbons, Jeremy. "Algebras for tree algorithms." Thesis, University of Oxford, 1991. http://ora.ox.ac.uk/objects/uuid:50ed112d-411d-486f-8631-6064138f4bf7.

Full text

Abstract:

This thesis presents an investigation into the properties of various algebras of trees. In particular, we study the influence that the structure of a tree algebra has on the solution of algorithmic problems about trees in that algebra. The investigation is conducted within the framework provided by the Bird-Meertens formalism, a calculus for the construction of programs by equational reasoning from their specifications. We present three different tree algebras: two kinds of binary tree and a kind of general tree. One of the binary tree algebras, called "hip trees", is new. Instead of being bui

APA, Harvard, Vancouver, ISO, and other styles

42

Shuja, Aneela. "Under the Pomegranate Tree." ScholarWorks@UNO, 2013. http://scholarworks.uno.edu/td/1784.

Full text

Abstract:

Mina is a young girl in a rural village called Tobay in Pakistan when her only friend Dhaaga, a family servant around her age, suddenly leaves. After a betrayal by her father’s second, much younger wife, Mina starts her long journey. She becomes a prostitute in Heera Mandi, the famed red light district of Lahore, and unexpectedly finds friends in a nearby transvestite brothel. Mina suddenly ends up with her life in danger when she tries to take revenge on the man who ruined Dhaaga’s life. She gets help from a human rights lawyer and escapes to safety in America with a New Orleans cabbie, who s

APA, Harvard, Vancouver, ISO, and other styles

43

Hurdle, David A. "The Giving Tree Academy." Scholarship @ Claremont, 2017. http://scholarship.claremont.edu/cmc_theses/1457.

Full text

Abstract:

A proposal for a new preschool based in Pomona, California, targeted towards children from low-income backgrounds. Includes extensive research on preschool nationwide, the state of California, and in Pomona. Within the paper a new preschool curriculum and specific teacher practices are discussed. Intended as a model for a new school. or to be adapted for use in educational policy.

APA, Harvard, Vancouver, ISO, and other styles

44

Barros, Rodrigo Coelho. "Evolutionary model tree induction." Pontifícia Universidade Católica do Rio Grande do Sul, 2009. http://hdl.handle.net/10923/1687.

Full text

Abstract:

Made available in DSpace on 2013-08-07T18:43:36Z (GMT). No. of bitstreams: 1 000422461-Texto+Completo-0.pdf: 1656872 bytes, checksum: 4520cf1ef2435e86327deed3e89baed9 (MD5) Previous issue date: 2009<br>Model trees are a particular case of decision trees employed to solve regression problems, where the variable to be predicted is continuous. They have the advantage of presenting an interpretable output, helping the end-user to get more confidence in the prediction and providing the basis for the end-user to have new insight about the data, confirming or rejecting hypotheses previously formed.

APA, Harvard, Vancouver, ISO, and other styles

45

Shi, Weiwei. "Tree-Inspired Water Harvesting." Diss., Virginia Tech, 2020. http://hdl.handle.net/10919/97604.

Full text

Abstract:

In this work, we were motivated to develop novel devices for water harvesting inspired by natural trees, and to understand their collection efficiency and working principles. We accomplished that with scale-model and large-scale fog harps, floating leaves, and synthetic trees. Fluids mechanics, physics, and thermodynamics were applied to solve the problems and rationalize the results. Redwood-inspired fog harps were designed with stainless steel vertical wires, using 3D-printing and laser-cutting techniques. Fog harps always harvested more water than any of the meshes, tested both under heavy

APA, Harvard, Vancouver, ISO, and other styles

46

Case, Bonita. "The avocado pear tree." Master's thesis, University of Cape Town, 1999. http://hdl.handle.net/11427/22438.

Full text

Abstract:

For twenty years Elsie September has refused to visit her uncle, Hannie, a state patient at Valkenberg mental hospital. At her grandmother's insistence, she almost goes to see him one day, but she only gets as far as the building and cannot bring herself to go inside. Instead, she meets Shaun and, as a relationship develops, Elsie begins to tell him the stories of her childhood. But Elsie's relationship with Shaun is troubled and unbalanced. Before Elsie reaches the point in her narrative where she will explain why she refuses to see her uncle, she and Shaun part acrimoniously and he disappear

APA, Harvard, Vancouver, ISO, and other styles

47

Nigussie, Yared. "Tree ideals and algorithms /." The Ohio State University, 1999. http://rave.ohiolink.edu/etdc/view?acc_num=osu1488187049542378.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Fleischman, Kimberly Ann. "Sheep Hill Community Tree." VCU Scholars Compass, 2004. http://scholarscompass.vcu.edu/etd/1357.

Full text

Abstract:

An urban community is a fusion of new and old that is constantly changing. We understand better the plight of a community through raising awareness of its unique history and visual character. Linking individual and community experiences offers an opportunity for dialogue, especially as long-time residents and their new neighbors learn about their different pasts and explore their common future. Community building happens from within, when many individuals sharing common values create positive change.

APA, Harvard, Vancouver, ISO, and other styles

49

Özbakış, Başak Kuştepeli Alp. "Fibonacci Fractal Tree Antennas/." [s.l.]: [s.n.], 2004. http://library.iyte.edu.tr/tezler/master/elektrikveelektronikmuh/T000455.rar.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Liao, Chun-Chieh, and 廖俊傑. "Constrained Tree Inclusion on Ordered Trees." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/63164030771019230269.

Full text

Abstract:

碩士<br>國立暨南國際大學<br>資訊工程學系<br>97<br>Tree P is included in tree T, denoted as P ⊆ T, if and only P is isomorphic to T' where T' is derived from T through a sequence of node deletions. Tree inclusion problem is to determine if P ⊆ T or not. Constrained tree inclusion problem is a kind of tree inclusion problem with node deleted having degree one or two. It can be solved in polynomial time for both unordered and ordered trees. This problem first appeared in Gabriel Valiente's paper. His paper gives an algorithm in bottom-up strategy to solve the problem. The algorithm can be used in both ordered an

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!