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 “"graph theoretic method"”.

  1. Trust, transforms, and control flow: A graph-theoretic method to verifying source and binary control flow equivalence

    … that trust by comparing the control flow graphs (CFGs) for a piece of source code to the corresponding CFG for the disassembled binary. This is done by putting the source CFG through a series of program functionality preserving transforms that implement different control structure compiler …

    iastate Repository record for Trust, transforms, and control flow: A graph-theoretic method to verifying source and binary control flow equivalence (opens in a new tab)

  2. Optimistic Partitioned Operation in Distributed Database Systems (Network Partitioning, Replicated Data, Consistency, Recovery, Fault-Tolerance)

    … an automatic conflict detection and resolution method based on serialization graphs has been proposed in the literature. It has been argued that the graph-theoretic method can be attractive for certain applications.

    uiuc Repository record for Optimistic Partitioned Operation in Distributed Database Systems (Network Partitioning, Replicated Data, Consistency, Recovery, Fault-Tolerance) (opens in a new tab)

  3. A strong Dixmier-Moeglin equivalence for quantum Schubert cells and an open problem for quantum Plücker coordinates

    … coordinates it contains. Presented here is a graph-theoretic method for answering this question. This may be useful for providing a full description of the inclusions between the torus-invariant prime ideals of the quantum Grassmannian and may lead to a proof that quantum Grassmannians satisfy …

    kent Download PDF for A strong Dixmier-Moeglin equivalence for quantum Schubert cells and an open problem for quantum Plücker coordinates (opens in a new tab)

  4. Learning deep representations for robotics applications

    … in computer vision tasks. First, a novel graph theoretic method for statistical shape analysis, called Compositional Hierarchy of Parts (CHOP), was proposed. The method utilises line-based features as its building blocks for the representation of shapes. A deep, multi-layer vocabulary is …

    birmingham Download PDF for Learning deep representations for robotics applications (opens in a new tab)

  5. Graph-theoretic Sensitivity Analysis of Dynamic Systems

    The main focus of this research is to use graph-theoretic formulations to develop an automated algorithm for the generation of sensitivity equations. The idea is to combine the benefits of direct differentiation with that of graph-theoretic formulation. The primary deliverable of this work is the …

    waterloo Repository record for Graph-theoretic Sensitivity Analysis of Dynamic Systems (opens in a new tab)

  6. Texton finding and lattice creation for near-regular texture

    … image, and lattice creation using both an ad-hoc method and a graph-theoretic method. The problem of finding textons within an image is addressed using correlation. A texton selected by the user is correlated with the image and points of high correlation are extracted using non-maximal …

    sask Repository record for Texton finding and lattice creation for near-regular texture (opens in a new tab)

  7. Automated Topology Synthesis and Optimization of Hybrid Electric Vehicle Powertrains

    … gearset, and five-speed discrete gearbox. The Graph Theoretic Method was used to generate the powertrain models. The powertrain models were comprised of steady-state equations in symbolic form. An optimal control strategy is required to fairly compare the different topologies because a …

    waterloo Repository record for Automated Topology Synthesis and Optimization of Hybrid Electric Vehicle Powertrains (opens in a new tab)

  8. CONSTRUCTING GRAPHS FOR INTERCONNECTION NETWORK TOPOLOGIES

    … we concentrate on developing a new construction method for generating topologies. We begin our work by examining the properties of good topologies and by providing a survey of current topologies used for interconnection networks. We then move on to develop a graph-theoretic method of constructing …

    nus Repository record for CONSTRUCTING GRAPHS FOR INTERCONNECTION NETWORK TOPOLOGIES (opens in a new tab) Download file for CONSTRUCTING GRAPHS FOR INTERCONNECTION NETWORK TOPOLOGIES (opens in a new tab)

  9. Number theoretic methods and their significance in computer science, information theory, combinatorics, and geometry

    In this dissertation, I introduce some number theoretic methods and discuss their intriguing applications to a variety of problems in computer science, information theory, combinatorics, and geometry. First, using properties of Ramanujan sums and of the discrete Fourier transform of arithmetic …

    uvic Repository record for Number theoretic methods and their significance in computer science, information theory, combinatorics, and geometry (opens in a new tab)

  10. Methods for analysis and planning of modern distribution systems

    … flows, unlike traditional linearized power flow methods. Further, the model presented in this dissertation is non-iterative, direct, and involves no convergence issues even with ill-condition systems. We test the proposed model on several distribution systems and has found to perform with speed …

    msu Repository record for Methods for analysis and planning of modern distribution systems (opens in a new tab)