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 9 of 9 for “"quotienting"”.

  1. Extending substitutability in composite services by allowing asynchronous communication

    … Pathak et al. apply a technique called quotienting to determine the portion of the composition's overall functionality that is satisfied by the original component. The quotienting operation yields the property that must be satisfied by a substitute for that component.</p> <p>While the …

    iastate Repository record for Extending substitutability in composite services by allowing asynchronous communication (opens in a new tab)

  2. HOPF ALGEBRA OF MULTIPLE POLYLOGARITHMS AND ASSOCIATED MIXED HODGE STRUCTURES

    … representing multiple polylogarithms. By quotienting products and functional relations, we get Lie coalgebras whose Chevalley-Eilenberg complexes are conjectured to compute rational and integral motivic cohomologies. We also associate one-forms to multiple polylogarithms, which exhibit …

    maryland Repository record for HOPF ALGEBRA OF MULTIPLE POLYLOGARITHMS AND ASSOCIATED MIXED HODGE STRUCTURES (opens in a new tab)

  3. Simulation-based simplification of omega-automata

    … introduce variants of this relation suited for quotienting of APA, and develop a simulation-based simplification algorithm for APA. We give a sketch of how to apply these results to a fragment of the modal mu-calculus.

    cau-kiel Repository record for Simulation-based simplification of omega-automata (opens in a new tab)

  4. Mathematical Theory and Algorithms for Scence Semantics in Robotics

    … sliding-window factor merging, variable quotienting, and overlap factors, together with a localized Iterated Conditional Modes (ICM) inference that updates only a small “focus” of recent variables in under 0.05 s per scan. Building on this pipeline, we address two fundamental tasks: (i) …

    penn Repository record for Mathematical Theory and Algorithms for Scence Semantics in Robotics (opens in a new tab)

  5. Universal moduli of sheaves over curves and moduli of flags of varieties via Geometric Invariant Theory

    … making use of a non-reductive analogue of quotienting-in-stages developed by Hoskins and Jackson.</p> <br> <p>The final main result is the existence of quasi-projective fine moduli spaces of Gieseker unstable torsion-free coherent sheaves of uniform rank 1 on a reducible projective curve …

    oxford Repository record for Universal moduli of sheaves over curves and moduli of flags of varieties via Geometric Invariant Theory (opens in a new tab)

  6. Parabolic Higgs bundles and the Deligne-Simpson Problem for loxodromic conjugacy classes in PU(n,1)

    … $U(1,1)$-Higgs bundle and a $U(n-1)$ bundle by quotienting out by the rank $n-1$ kernel of the Higgs field. In the case that the $U(1,1)$-Higgs bundle is of loxodromic type, this construction can be reversed, with the added consequence that the stability conditions of the resulting …

    maryland Repository record for Parabolic Higgs bundles and the Deligne-Simpson Problem for loxodromic conjugacy classes in PU(n,1) (opens in a new tab)

  7. Zn Orbifolds of Vertex Operator Algebras

    … at the level of reduced rings, that is, after quotienting by the nilradical. Using the strong generating set for H(2)Z3 , we will prove that this is the case in this example. More generally, if RVG and (RV)G become isomorphic as reduced rings, they must have the same Krull dimension. For …

    denver Repository record for Zn Orbifolds of Vertex Operator Algebras (opens in a new tab)

  8. Redukce velikosti konečných automatů pomocí SAT solveru

    Nedeterministické konečné automaty (NKA) jsou široce využívány v počítačové vědě, například v oblasti formálních jazyků pro reprezentaci regulárních jazyků, k monitorování vysokorychlostních sítí, rozpoznávání obrazu, modelování hardware, nebo dokonce v bioinformatice pro vyhledávání sekvencí …

    brno-tech Repository record for Redukce velikosti konečných automatů pomocí SAT solveru (opens in a new tab)

  9. Simulations and Antichains for Efficient Handling of Finite Automata

    Cílem této práce je vývoj technik umožňujících praktické využití nedeterministických konečných automatů, zejména nedeterministických stromových automatů. Jde zvláště o techniky pro redukci velikosti a testování jazykové inkluze, jež hrají zásadní roli v mnoha oblastech aplikace konečných automatů. …

    brno-tech Repository record for Simulations and Antichains for Efficient Handling of Finite Automata (opens in a new tab)