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 1065 for “"bipartite"”.

  1. On Bipartite Negation

    Bipartite negation is the phenomenon in which two negators output to one instance of semantic negation. In this thesis I present an analysis of bipartite negation in Sgaw Karen, Ojibwe, and French, using original data from the former two languages and data from existing sources for French. I show …

    umn Repository record for On Bipartite Negation (opens in a new tab)

  2. Causal Inference with Bipartite Designs

    Bipartite experiments have recently emerged as a focal point in causal inference. In these experiments, treatment is administered to one set of units, while outcomes of interest are gauged on a distinct set of units. Such experiments are especially valuable in scenarios where pronounced …

    temple Repository record for Causal Inference with Bipartite Designs (opens in a new tab)

  3. Edge-Transitive Bipartite Direct Products

    … showed that the direct product of connected, non-bipartite graphs is edge-transitive if and only if both factors are edge-transitive, and at least one is arc-transitive. However, little is known when the product is bipartite. This thesis extends this result (in part) for the case of bipartite …

    vcu Repository record for Edge-Transitive Bipartite Direct Products (opens in a new tab)

  4. Doubly Almost Bipartite Leonard Pairs

    … to two closely-related classes of objects: (i) bipartite Leonard pairs (BLPs) and (ii) almost bipartite Leonard pairs (ABLPs). Taking these as departure points, we will introduce a new class of object - doubly almost bipartite Leonard pairs (DABLPs). The primary aim of our work is to fully …

    portland-state Repository record for Doubly Almost Bipartite Leonard Pairs (opens in a new tab)

  5. From bipartite to multipartite entanglement

    … as it is possible to combine multiple bipartite sources to create multipartite resources. This thesis is a work presenting the basics of bipartite entanglement, especially the necessary building blocks required to make efficient, compatible, affordable and compact bipartite entanglement …

    calgary Repository record for From bipartite to multipartite entanglement (opens in a new tab)

  6. Variations of online bipartite matching

    The Online Bipartite Matching Problem is a well-studied problem in theoretical computer science that models several real-world applications including online investment, kidney transplantation, aviation security passenger screening, and enhanced Ebola entry screening. However, the original version …

    uiuc Repository record for Variations of online bipartite matching (opens in a new tab)

  7. FLUCTUATION THEOREM FOR QUANTUM BIPARTITE SYSTEMS

    … thermodynamic quantities in a quantum bipartite system. I explain the details of these theorems, such as fluctuation theorems and their corresponding thermodynamic equations. I also present an experimental realization of the theorems.

    nus Repository record for FLUCTUATION THEOREM FOR QUANTUM BIPARTITE SYSTEMS (opens in a new tab) Download file for FLUCTUATION THEOREM FOR QUANTUM BIPARTITE SYSTEMS (opens in a new tab)

  8. Deep Learning for Bipartite Assignment Problems

    … is a deep learning architecture called Deep Bipartite Assignments (DBA), which can automatically learn heuristics for a large class of assignment problems. The effectiveness of DBA is demonstrated on two NP-Hard problems: the weapon-target assignment problem and the multi-resource generalised …

    adelaide Repository record for Deep Learning for Bipartite Assignment Problems (opens in a new tab)

  9. Bipartite Quantum Walks and the Hamiltonian

    We study a discrete quantum walk model called bipartite walks via a spectral approach. A bipartite walk is determined by a unitary matrix U, i.e., the transition matrix of the walk. For every transition matrix U, there is a Hamiltonian H such that U = exp(iH). If there is a real skew-symmetric …

    waterloo Repository record for Bipartite Quantum Walks and the Hamiltonian (opens in a new tab)

  10. Active modules of bipartite metabolic network

    … the problem of identifying active modules of bipartite metabolic network. We devise a method of motif projection, and the extraction of clusters from active modules based on the concentration of active-motifs in the network. Our results reveal the existence of hierarchical structure. We model …

    birmingham Download PDF for Active modules of bipartite metabolic network (opens in a new tab)

  11. Restricted 2-factors in bipartite graphs

    … and polyhedral conditions for 2-factors in bipartite graphs and restricted 2-factors in bipartite graphs. We introduce a generalization of the necessary and sufficient condition for 4-restricted 2-factors in bipartite graphs to 2k-restricted 2-factors in bipartite graphs of a particular form.

    rice Repository record for Restricted 2-factors in bipartite graphs (opens in a new tab)

  12. Colored Saturation Parameters for Bipartite Graphs

    … subgraphs of edge-colored complete bipartite graphs. Specifically we provide bounds on the minimum size of these subgraphs for a variety of families of edge-colored bipartite graphs, including monochromatic matchings, rainbow matchings, and rainbow stars.

    rit Repository record for Colored Saturation Parameters for Bipartite Graphs (opens in a new tab)

  13. Bipartite Ramsey Numbers and Zarankiewicz Numbers

    The bipartite Ramsey number b(m, n) is the minimum b such that any 2-coloring of Kb,b results in a monochromatic Km,m subgraph in the first color or a monochromatic Kn,n subgraph in the second color. The Zarankiewicz number z(m, n; s, t) is the maximum size among Ks,t-free subgraphs of Km,n. In …

    rit Repository record for Bipartite Ramsey Numbers and Zarankiewicz Numbers (opens in a new tab)

  14. Bipartite Density of Generalized Petersen Graphs

    The bipartite density b(G) of a graph G with m edges is the maximum ratio [special characters omitted] where m0 is the number of edges in a bipartitesubgraph of G. In this study we determine the bipartite density of several classes of Generalized Petersen Graphs. These graphs are denoted by P(n, …

    mississippi Repository record for Bipartite Density of Generalized Petersen Graphs (opens in a new tab)

  15. Bipartite Double-Word Compare-and-Swap

    … research, we implement a lock-free linearizable bipartite double-word compare-and-swap operation. This operation can be used on its own as a restricted version of the double-word compare-and-swap operation. However, the most significant feature of our algorithm is that our design has the …

    calgary Repository record for Bipartite Double-Word Compare-and-Swap (opens in a new tab)

  16. Star bi-coloring of bipartite graphs

    Evaluation of the Jacobian is the most computationally expensive operation while solving a non-linear system. Knowledge of the sparsity pattern in advance reduces the computational cost. Bi-directional partitioning to determine non-zeroes in the sparse matrix works better than unidirectional …

    lethbridge Repository record for Star bi-coloring of bipartite graphs (opens in a new tab)

  17. Eigenstate entanglement in chaotic bipartite systems

    … unclear, how the subsystem structure of actual bipartite systems influences the entanglement. We investigate the effect of such a structure on the bipartite entanglement for eigenstates of time-periodically kicked Floquet systems. To this end, the expression for the eigenstate entanglement is …

    qucosa-diss

  18. Graph Neural Networks for Bipartite Graphs

    Bipartite graphs are a special type of graph data structure where vertices can be divided into two disjoint and independent sets, and each edge connects a vertex from one set to a vertex in the other set. They can be used to model many real-world applications such as user-item interaction networks, …

    unsw Repository record for Graph Neural Networks for Bipartite Graphs (opens in a new tab)

  19. Entanglement in a Bipartite Gaussian State

    To examine the loss of entanglement in a two-particle Gaussian system, we couple it to an environment and use the Non-Rotating Wave master equation to study the system's dynamics. We also present a derivation of this equation. We consider two di�fferent types of evolution. Under free evolution we …

    maynooth Download PDF for Entanglement in a Bipartite Gaussian State (opens in a new tab)

  20. Santa Claus, Machine Scheduling and Bipartite Hypergraphs

    … to clarify the discussion. Also discussed are bipartite hypergraphs, which correspond naturally to these problems, including a discussion of Haxell's Theorem for bipartite hypergraphs. Conditions for edge covering in bipartite hypergraphs are introduced and their implications investigated. The …

    waterloo Repository record for Santa Claus, Machine Scheduling and Bipartite Hypergraphs (opens in a new tab)

Page 1 of 54