Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 10 of 10 for “"Rooted tree"”.
-
Veteran Teachers Are Like A Rooted Tree: Comprehensive Formal Mentoring as a Mitigating Factor for Stress, Burnout, and Attrition for K-8 Public School Veteran Teachers
<p>Teaching is known to be a highly stressful occupation. Experiences of prolonged stress can lead to teacher burnout and attrition. Veteran teacher attrition, primarily teacher migration, negatively impacts students with the greatest needs and does not address antecedent factors driving the …
-
A p-adic spectral triple
… On the technical level we utilize a weighted rooted tree obtained from a coarse grained approximation of the space combined with the forward derivative <em>D</em> on the tree. Our spectral triple satisfies the properties of a compact spectral metric space and the metric on the space of …
-
Probability theory on Galton-Watson trees
By a Galton-Watson tree T we mean an infinite rooted tree that starts with one node and where each node has a random number of children independently of the rest of the tree. In the first chapter of this thesis, we prove a conjecture made in [7] for Galton-Watson trees where vertices have bounded …
-
An Implementation-Based Exploration of HAPOD: Hierarchical Approximate Proper Orthogonal Decomposition
… the columns of S in blocks based on a predefined rooted tree of processors, concatenating the outputs from each stage to form the inputs for the next. However, depending on the selected parameter values and the properties of S, the performance of HAPOD may be no better than that of direct SVD. In …
-
Topics in the Generation of Ideals of Posets
… constructions of OCAs for level-regular rooted tree posets.
-
Impact Of Network Protocols On Data Center Applications
… center networks, which are organized in multi-rooted tree topologies, can lead to severe unfairness under many common traffic patterns. We term this phenomenon as the TCP Outcast problem. When a set of a large number of flows and another set of a small number of flows arrive at two input ports …
-
Component Trees For The Exploration Of Macromolecular Structures In Biology
… for understanding its function. A component tree is a topological and geometric image descriptor that captures information regarding the structure of an image based on the connected components determined by different grayness thresholds. This dissertation presents a novel interactive …
-
Properties of p-modulus on radially symmetric infinite trees
… effective resistance calculations on infinite trees are known to be related to the transience or recurrence of random walks on these trees. The goal of this dissertation is to extend the theory of p-modulus to the case of infinite trees. While many known results from finite graphs have analogs …
-
Information theory of random trees induced by stochastic grammars.
… done on the information theory of binary random rooted tree models in which every nonleaf vertex in a tree has exactly two children. Let α be a positive integer parameter > 2. The main contribution of this thesis is to extend the information theory results for binary random tree models to …
-
The structure of spaces of valuations and the local uniformization problem
… of Favre and Jonsson and Granja on the valuative tree. Favre and Jonsson prove that the set of all valuations centered at C[[x,y]] admits a tree structure, which they call the valuative tree. Granja extends this result to any two-dimensional regular local ring. In both works, the definition of …