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 20 of 193 for “"Tree-like"”.

  1. Fixed points in dendrites and tree-like continua

    Electronic Thesis or Dissertation

    alabama Repository record for Fixed points in dendrites and tree-like continua (opens in a new tab)

  2. Returning walks on groups with tree-like Schreier graphs

    … functions. Using complex analytic techniques like singularity analysis, asymptotic formulas for the number of closed walks of length n and winding number m can be derived. This is done by proving a local limit theorem in the case when all pᵢs are the same, which requires multiple steps, …

    ubc Repository record for Returning walks on groups with tree-like Schreier graphs (opens in a new tab) Download PDF for Returning walks on groups with tree-like Schreier graphs (opens in a new tab)

  3. Development of a Novel, Tree-Like Branching Continuum Robot with Variable Topology

    This thesis describes the design and physical realization of a novel branching continuum robot, aimed at inspection and cleaning operations in hard-to-reach environments at depths greater than human arm lengths. The design, based on a hybrid concentric-tube/tendon actuated continuum trunk core, …

    clemson Repository record for Development of a Novel, Tree-Like Branching Continuum Robot with Variable Topology (opens in a new tab)

  4. Tree-Like Spaces with the Fixed-Point Property, Realized as Inverse Limits of Special Finite Trees

    … particular the example by David Bellamy of the "tree-like" continuum that does not have the fixed-point property. We highlight some spaces with the fixed-point property that are between snake-like continua and Bellamy's example in their level of complexity. Specifically, we prove the fixed-point …

    ut-knoxville Repository record for Tree-Like Spaces with the Fixed-Point Property, Realized as Inverse Limits of Special Finite Trees (opens in a new tab)

  5. Effect of Symmetric Bifurcation Angles on Fluid Flow through Tree Like Flow Network of Varying Scale

    … of scales. The effect of scaling on a microscale tree-like flow network was examined in this work for a variety of bifurcation angles. At microscale, these tree-like networks could be utilized in the thermal management of electronic devices. At larger scales, these networks could be employed in …

    gsu Repository record for Effect of Symmetric Bifurcation Angles on Fluid Flow through Tree Like Flow Network of Varying Scale (opens in a new tab)

  6. Thermal transport in systems with hierarchical bifurcating geometries

    … heat transfer. If hierarchical bifurcating, or tree-like, geometries are considered, significant gains in the available surface area for heat transfer can be achieved as the geometric pattern is space-filling. As compared with parallel straight channel heat sinks, hierarchical bifurcating …

    alabama Repository record for Thermal transport in systems with hierarchical bifurcating geometries (opens in a new tab)

  7. Reasons for Hardness in QBF Proof Complexity

    … we prove a new lower bound technique for tree-like QBF proof systems. Lower bounds using this technique allows us to show a new separation between tree-like and dag-like systems. We give a characterisation of lower bounds for a large class of tree-like proof systems, in which such lower …

    whiterose Download PDF for Reasons for Hardness in QBF Proof Complexity (opens in a new tab)

  8. Easy instances for model checking

    … expressible in monadic second order logic over tree-like structures (structures with bounded tree-width) and first order logic over locally tree-like structures. The importance of the latter stems from the fact that structures of bounded valence, planar graphs and graphs with bounded crossing …

    freiburg-diss Repository record for Easy instances for model checking (opens in a new tab)

  9. On K-trees and Special Classes of K-trees

    The class of k-trees is defined recursively as follows: the smallest k-tree is the k-clique. If G is a graph obtained by attaching a vertex v to a k-clique in a k-tree, then G is also a k-tree. Trees, connected acyclic graphs, are k-trees for k = 1. We introduce a new parameter known as the shell …

    mississippi Repository record for On K-trees and Special Classes of K-trees (opens in a new tab)

  10. Structure vs. Properties Using Chemical Graph Theory

    … theory and its applications. We first look at tree-like polyphenyl systems, which form an important family of compounds in Chemistry, particularly in Material Science. The importance can be seen in LEDs, transmitters, and electronics. In recent years, many extremal results regarding such …

    gsu Repository record for Structure vs. Properties Using Chemical Graph Theory (opens in a new tab)

  11. Connectivity, tree-decompositions and unavoidable-minors

    … thesis introduces a refinement of the notion of tree-width. Tree-width is a measure of how “tree-like” a graph is. Essentially, a graph is tree-like if it can be decomposed across a collection of non-crossing vertex-separations into small pieces. In our variant, which we call k-tree-width, we …

    waterloo Repository record for Connectivity, tree-decompositions and unavoidable-minors (opens in a new tab)

  12. Theoretical investigations of semiflexible branched polymers

    … the study of chains, to arbitrary semiflexible tree-like polymers. As a further application of the discrete maximum entropy principle method, using a reduced variational approach, the behavior of semiflexible ring polymers was analyzed.

    freiburg-diss Repository record for Theoretical investigations of semiflexible branched polymers (opens in a new tab)

  13. Analytical and topological aspects of signatures

    … path can be completely characterized, up to tree-like deformation, by an algebraic object called the signature, tensor of all iterated integrals, of the path. It is clear that all tree-like deformation of the path would not change its topological features. For instance, the number of times a …

    oxford Repository record for Analytical and topological aspects of signatures (opens in a new tab)

  14. Large structures in dense directed graphs

    … graphs. Specifically, we investigate which large tree-like directed graphs are contained in all dense directed graphs of large order. More precisely, let T be an oriented tree of order n; among others, we establish the following results. (1) We obtain a sufficient condition which ensures every …

    birmingham Download PDF for Large structures in dense directed graphs (opens in a new tab)

  15. The Synthesis of Dendrimer and Their Application for Drug Delivery and as Haemoglobin Model for Artificial Blood

    Dendrimers are a class of highly branched, tree-like macromolecules that have garnered significant interest due to their unique structure and potential applications in various scientific fields. This section overviews dendrimers, their synthesis, properties, and applications. Dendrimers are …

    whiterose Download PDF for The Synthesis of Dendrimer and Their Application for Drug Delivery and as Haemoglobin Model for Artificial Blood (opens in a new tab)

  16. Blog comments classification using tree structured conditional random fields

    … is highly desirable. For this purpose, sites like Slashdot, where users volunteer to rate comments based on their informativeness, can be a great resource to build such automated system using supervised machine learning techniques. Our research concerns building an automatic comment …

    ubc Repository record for Blog comments classification using tree structured conditional random fields (opens in a new tab) Download PDF for Blog comments classification using tree structured conditional random fields (opens in a new tab)

Page 1 of 10