Sökning: "disjoint"

Visar resultat 1 - 5 av 33 avhandlingar innehållade ordet disjoint.

  1. 1. The Ndengeleko Language of Tanzania

    Detta är en avhandling från Göteborg : University of Gothenburg

    Författare :Eva-Marie Ström; Göteborgs universitet.; Gothenburg University.; [2013]
    Nyckelord :HUMANIORA; HUMANITIES; Ndengeleko; Bantu; Tanzania; Rufiji; phonology; morphology; morpho-phonology; endangered languages; grammar; linguistic description; spirantisation; animacy; conjoint; disjoint;

    Sammanfattning : This dissertation describes the Ndengeleko language of Tanzania, in particular the phonology and morphology in the noun and verb phrase. This Bantu language, spoken by approximately 72,000 people, has not been the subject of any previous linguistic study. LÄS MER

  2. 2. New Constructions for Competitive and Minimal-Adaptive Group Testing

    Detta är en avhandling från Chalmers University of Technology

    Författare :Azam Sheikh Muhammad; Chalmers tekniska högskola.; Chalmers University of Technology.; [2013]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; minimal-adaptive group testing; competitive group testing; competitive ratio; randomization; disjoint pools; strict group testing; exact bounds;

    Sammanfattning : Group testing (GT) was originally proposed during the World War II in an attempt to minimize the \emph{cost} and \emph{waiting time} in performing identical blood tests of the soldiers for a low-prevalence disease. Formally, the GT problem asks to find $d\ll n$ \emph{defective} elements out of $n$ elements by querying subsets (pools) for the presence of defectives. LÄS MER

  3. 3. Advances in Functional Decomposition: Theory and Applications

    Detta är en avhandling från Stockholm : KTH

    Författare :Andrés Martinelli; KTH.; SICS.; [2006]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TECHNOLOGY Information technology Computer science; TEKNIKVETENSKAP Informationsteknik Datavetenskap; computer science; electronic system design; Boolean decomposition; binary decision diagram; logic synthesis; graph algorithm;

    Sammanfattning : Functional decomposition aims at finding efficient representations for Boolean functions. It is used in many applications, including multi-level logic synthesis, formal verification, and testing. This dissertation presents novel heuristic algorithms for functional decomposition. LÄS MER

  4. 4. Cohomology of the moduli space of curves of genus three with level two structure

    Detta är en avhandling från Stockholm : Department of Mathematics, Stockholm University

    Författare :Olof Bergvall; Stockholms universitet.; [2014]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Algebraic geometry; Moduli space; Cohomology; Symplectic structure; Point count; matematik; Mathematics;

    Sammanfattning : In this thesis we investigate the moduli space M3[2] of curves of genus 3 equipped with a symplectic level 2 structure. In particular, we are interested in the cohomology of this space. We obtain cohomological information by decomposing M3[2] into a disjoint union of two natural subspaces, Q[2] and H3[2], and then making S7- resp. LÄS MER

  5. 5. Bilinear optimization in computational decision analysis

    Detta är en avhandling från Sundsvall : Mittuniversitetet

    Författare :Xiaosong Ding; Mittuniversitetet.; [2005]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; SOCIAL SCIENCES Statistics; computer and systems science Informatics; computer and systems science Computer and systems science; SAMHÄLLSVETENSKAP Statistik; data- och systemvetenskap Informatik; data- och systemvetenskap Data- och systemvetenskap;

    Sammanfattning : In real-life decision analysis, significant recognition has been given to theunrealistic expectation of numerically precise information. Many modernapproaches attempting to handle imprecision have focused more on representationand less on evaluation. LÄS MER