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 65 for “"Directed Graph"”.

  1. Inferring Undirected and Causally Directed Graph Structures from Multivariate Time Series

    … cortex of primates using a novel variation of undirected graph learning based on smoothness prior. In Part Two, we define and implement a novel spatiotemporal graph (STG) model for inferring causally directed graphs. Analysis of brain connectivity networks has a potential to advance our …

    claremont Repository record for Inferring Undirected and Causally Directed Graph Structures from Multivariate Time Series (opens in a new tab)

  2. Visualizing the conversation pathways of telephone linked care in a directed graph

    Telephone linked care (TLC) is a telehealth intervention that has been shown to be effective in a variety of clinical settings. TLC is an interactive computerized telephone system. The system 'speaks' to patients, asking them questions and understanding their responses. There is logic built into …

    mit Repository record for Visualizing the conversation pathways of telephone linked care in a directed graph (opens in a new tab)

  3. On the Existence of Knots and Links in the Complete Directed Graph on Six Vertices

    … Gordon published "Knots and Links in Spatial Graphs" in the Journal of Graph Theory. In this paper, Conway and Gordon proved that the complete graph on six vertices is intrinsically linked. That is, any embedding of the complete graph on six vertices contains at least one pair of disjoint …

    wfu Repository record for On the Existence of Knots and Links in the Complete Directed Graph on Six Vertices (opens in a new tab)

  4. An improved directed random walk framework for cancer classification using gene expression data

    … cancer classification by introducing an improved directed random walk (DRW) framework. This improved DRW framework is proposed to identify risk pathway while correctly predict the significant genes. It is named as significant directed walk (SDW) because of its ability to identify significant genes …

    uthm Repository record for An improved directed random walk framework for cancer classification using gene expression data (opens in a new tab)

  5. Eigenvalue Spacings of Transition Matrices Associated to Directed Graphs

    … Markov chains and explores their applications to directed graphs. We derive an explicit expression for the error term in the convergence theorem in terms of the eigenvalues of the transition matrix. This expression reveals that the convergence behaviour is governed not only by the spectral gap but …

    queens Repository record for Eigenvalue Spacings of Transition Matrices Associated to Directed Graphs (opens in a new tab)

  6. Intelligent Memory Management Heuristics

    … explore the use of statistical properties of the directed graph describing the set of live data to decide between garbage collection and heap expansion in a memory management algorithm combining the dynamic array represented heaps with a mark and sweep garbage collector to enhance its performance. …

    unt Repository record for Intelligent Memory Management Heuristics (opens in a new tab)

  7. Translating Data Flow Graphs to Architectures

    … language which is converted to a cyclic directed graph, called a data flow graph. Our design system takes this graph as input and translates it to an architecture and a control sequence which together realize the functional definition.

    uiuc Repository record for Translating Data Flow Graphs to Architectures (opens in a new tab)

  8. Automating journey fare calculation for transport for London

    … minimum distance. The algorithm operates on a directed graph model of the network. This thesis develops a method to structure the directed graph to capture the network's intricacies. Given a network and fare structure, the modified shortest path algorithm produces all path and fare information …

    mit Repository record for Automating journey fare calculation for transport for London (opens in a new tab)

  9. Stabilization via smooth partitions, transversality and graphs

    … edges. Stability is analyzed through the directed graph whose vertices are the subsets of the partition and whose arcs are consistent with the transversality. A strategy for the choice of partition is proposed using computable Pfaffian systems.

    ubc Repository record for Stabilization via smooth partitions, transversality and graphs (opens in a new tab)

  10. Relating Thompson's group V to graphs of groups and Hecke algebras

    … the first section, we take $\mathcal{G}$ to be a graph of groups, which acts on its universal cover, the Bass-Serre tree, by tree automorphisms. Brownlowe, Mundey, Pask, Spielberg and Thomas constructed a $C^*$-algebra for a graph of groups, writtten $C^*(\mathcal{G})$, which bears many …

    cambridge Repository record for Relating Thompson's group V to graphs of groups and Hecke algebras (opens in a new tab)

  11. Geometry Of Quivers

    <p>A quiver is a directed graph, but the term usually implies such a graph is being considered along with representations. These representations consist of vector spaces and linear transformations. We explore some the connections between quivers and geometric structures. To begin, we consider a …

    nodak Repository record for Geometry Of Quivers (opens in a new tab)

  12. Fast spectral primitives for directed graphs

    … linear time algorithms for a large class of directed graph problems including computing the stationary distribution of a Markov chain with only a logarithmic dependence on the mixing time. Our approach is based on developing new spectral tools for directed graphs, including the first …

    mit Repository record for Fast spectral primitives for directed graphs (opens in a new tab)

  13. Finite Generation of Ext-Algebras for Monomial Algebras

    The use of graphs in algebraic studies is ubiquitous, whether the graphs be finite or infinite, directed or undirected. Green and Zacharia have characterized finite generation of the cohomology rings of monomial algebras, and thereafter G. Davis determined a finite criteria for such generation in …

    vt Repository record for Finite Generation of Ext-Algebras for Monomial Algebras (opens in a new tab)

  14. Knitting with directed graphs

    … structures by their geometry separate from a directed graph description of their topology. This thesis presents an algorithm that can generate a natural, deformed two-dimensional layout of Knit Meshes as well as a conversion pipeline that converts written hand knitting instructions to and from …

    mit Repository record for Knitting with directed graphs (opens in a new tab)

  15. REALIZING TOURNAMENTS AS MODELS FOR K-MAJORITY VOTING

    <p>A <em>k</em>-majority tournament is a directed graph that models a <em>k</em>-majority voting scenario, which is realized by 2<em>k</em> - 1 rankings, called linear orderings, of the vertices in the tournament. Every <em>k</em>-majority voting scenario can be modeled by a tournament, but not …

    csusb Repository record for REALIZING TOURNAMENTS AS MODELS FOR K-MAJORITY VOTING (opens in a new tab)

  16. Decreasing Occlusion and Increasing Explanation in Interactive Visual Knowledge Discovery

    … overlap. Each n-D point is represented as a directed graph in SPC. It is shown that the FSP method simplifies pattern discovery in n-D data providing explainable rules in a visual form with significantly decrease of the cognitive load for analysis of n-D data. The computational experiments on …

    central-wash Repository record for Decreasing Occlusion and Increasing Explanation in Interactive Visual Knowledge Discovery (opens in a new tab)

  17. Complexity of Dyck-reachability in directed graphs

    We study the problem of Dyck-reachability in directed graphs de ned as follows: given a directed graph with edges labeled by either open or close parentheses, we claim that a vertex is Dyck-reachable from another if there is a path between these two vertices such that the string described by …

    uiuc Repository record for Complexity of Dyck-reachability in directed graphs (opens in a new tab)

  18. Aspects of inference for the Influence Model and related graphical models

    … in a variety of contexts. It consists of a directed graph of interacting sites whose Markov state transition probabilities depend on their present state and that of their neighbors. The major goals of this thesis are (1) to place the Influence Model in the broader framework of graphical …

    mit Repository record for Aspects of inference for the Influence Model and related graphical models (opens in a new tab)

  19. Visualization of Student Cohort Data With Sankey Diagrams via Web-Centric Technologies

    … a student cohort is represented as a weighted, directed, graph, where a vertex represents a distinct class status for a semester and each weighted edge represents the number of students moving between class statuses. To ease understanding, this graph is represented visually as a Sankey Diagram, …

    unm Repository record for Visualization of Student Cohort Data With Sankey Diagrams via Web-Centric Technologies (opens in a new tab)

  20. Controllability and Observability of a Large Scale Thermodynamical System via Connectability Approach

    … scale nonlinear dynamic thermal system using graph-theory. The novelty of this method is in adapting graph theory for nonlinear class and establishing a graphic condition that describes the necessary and sufficient terms for a nonlinear class system to be controllable and observable, which …

    denver Repository record for Controllability and Observability of a Large Scale Thermodynamical System via Connectability Approach (opens in a new tab)

Page 1 of 4