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 47 for “"n-ary"”.

  1. Commutative n-ary Arithmetic

    … thesis introduces generalizations of standard binary multiplication to commutative n-ary operations based upon geometric construction and representation. This class of operations are constructed to preserve commutativity and identity so that binary multiplication is included as a special case, in …

    uno Repository record for Commutative n-ary Arithmetic (opens in a new tab)

  2. Polynomial Identities and Enveloping Algebras for n-ary Structures

    … the polynomial identities of alternating quaternary algebras structures, and the universal associative enveloping algebras of the (n+1)-dimensional n-Lie (Filippov) algebras, the 2-dimensional non-associative triple systems and the anti-Jordan triple system of n x n matrices. Firstly, we …

    sask Repository record for Polynomial Identities and Enveloping Algebras for n-ary Structures (opens in a new tab)

  3. Convex Hull Characterization of Special Polytopes in n-ary Variables

    … characterizes the convex hull of the set of n-ary vectors that are lexicographically less than or equal to a given such vector. A polynomial number of facets is shown to be sufficient to describe the convex hull. These facets generalize the family of cover inequalities for the binary case. They …

    clemson Repository record for Convex Hull Characterization of Special Polytopes in n-ary Variables (opens in a new tab)

  4. N-ary Cross-sentence Relation Extraction: From Supervised to Unsupervised Learning

    … extraction approaches focus on supervised binary intra-sentence relations, where the assumption is relations only exist between two entities within the same sentence. These approaches have two key limitations. First, binary intra-sentence relation extraction methods can not extract a relation …

    vt Repository record for N-ary Cross-sentence Relation Extraction: From Supervised to Unsupervised Learning (opens in a new tab)

  5. A N-ary sorting system using an Integrated Droplet-Digital Microfluidics (ID2M)

    … these techniques is that these are typically binary sorters – i.e. only relying on two sorting channels. This can limit the range of detecting rare events and to sort based on multiple conditions (i.e. more than two conditions). To alleviate this challenge, we have integrated droplet …

    concordia Download PDF for A N-ary sorting system using an Integrated Droplet-Digital Microfluidics (ID2M) (opens in a new tab)

  6. A N-ary sorting system using an Integrated Droplet-Digital Microfluidics (ID2M)

    … these techniques is that these are typically binary sorters – i.e. only relying on two sorting channels. This can limit the range of detecting rare events and to sort based on multiple conditions (i.e. more than two conditions). To alleviate this challenge, we have integrated droplet …

    concordia Download PDF for A N-ary sorting system using an Integrated Droplet-Digital Microfluidics (ID2M) (opens in a new tab)

  7. An Enumeration Problem for Sequences of n-ary Trees Arising from Algebraic Operads

    … enumeration problem for sequences of complete n-ary trees. Given the sequence of all complete n-ary plane trees with a given number of internal nodes (weight), in lexicographical order, we perform graftings with the basic n-ary tree to construct sets of sequences of trees of higher weight. …

    sask Repository record for An Enumeration Problem for Sequences of n-ary Trees Arising from Algebraic Operads (opens in a new tab)

  8. Generalizations of Quandles and their cohomologies

    … for these structures. We then introduce an n-ary generalization of the notion of quandles. We discuss a number of properties of these structures and provide a number of examples. Also discussed are methods of obtaining n-ary quandles through iteration of binary quandles, and obtaining binary …

    usf Repository record for Generalizations of Quandles and their cohomologies (opens in a new tab)

  9. View Integration Using the Entity-Relationship Model.:Available in 2 volumes.

    … to view integration have been developed: binary view integration which integrates a view at a time, and n-ary view integration which integrates all the views ‘simultaneously’. Further, prototypes of n-ary view integrators called the entity n-ary view integrator and the relationship n-ary view …

    aston Repository record for View Integration Using the Entity-Relationship Model.:Available in 2 volumes. (opens in a new tab) Download PDF for View Integration Using the Entity-Relationship Model.:Available in 2 volumes. (opens in a new tab)

  10. On the Number of Conjugates of Ternary Quasigroups

    <p>An n-ary quasigroup is a set together with an n-ary operation which is cancellative in every variable. To every permutation on n + 1 elements there is associated a conjugate quasigroup of the original quasigroup. The elements of both quasigroups are the same, but the conjugate n-ary operation is …

    mcmaster Repository record for On the Number of Conjugates of Ternary Quasigroups (opens in a new tab)

  11. Generic Matrix Manipulator System

    … called a coefficient set, as well as closed n-ary operations based on the coefficient set, called coefficient operators. Together the coefficient set and the coefficient operators form a basis. The defined coefficient operators can then further define operations on matrices. A basis and n-ary …

    brock Repository record for Generic Matrix Manipulator System (opens in a new tab)

  12. Quadratic Forms

    … of three quadratic polynomials. The primary interest will by with n-ary quadratic polynomials, called forms.

    unt Repository record for Quadratic Forms (opens in a new tab)

  13. Architectural Features of WCRC - A Data Base Computer

    … language, DBAL, is developed for the DBA. Two binary storage structures (Pseudo Canonical Partitions (PCP's - Options I and II) have been reported for storing the data at the internal level. They radically differ from the conventional n-ary relational storage structure. A machine oriented language …

    mcmaster Repository record for Architectural Features of WCRC - A Data Base Computer (opens in a new tab)

  14. Knowledge transfer techniques for dynamic environments

    … information in an existing hierarchical binary classifier is presented to rapidly construct a new classifier for a new but related classification problem. The knowledge transfer technique is augmented with active learning to efficiently update the classifier using far fewer data points than …

    texas Repository record for Knowledge transfer techniques for dynamic environments (opens in a new tab)

  15. Selector-based versus conditional-constraint-based value-flow analysis of programs

    … it is too conservative when analyzing n-ary functions, functions with rest arguments, and arity-overloaded functions (case-lambda). Flanagan's analysis can be extended to give more precise results, but at the cost of a high running time. We therefore conclude that this framework is not …

    rice Repository record for Selector-based versus conditional-constraint-based value-flow analysis of programs (opens in a new tab)

  16. Linearly repeatered communication systems using optical amplifiers

    … analysis. The results are also generalized for N-ary modulation schemes and systems having optical amplifiers as linear repeaters. Simple analytic formulae are derived for the maximum system gain of optical amplifiers systems for the following two cases: 1) Constant signal power at each amplifier. …

    vt Repository record for Linearly repeatered communication systems using optical amplifiers (opens in a new tab)

  17. Efficient Functional Programming using Linear Types: The Array Fragment

    … In this master thesis, we improve on the n-ary extension of LL by introducing a self-dual, sequential array operator with an aggregation function. We provide a functional interpretation of the resulting calculus, which forms the basis for a low-level code generator. We then illustrate the …

    chalmers Repository record for Efficient Functional Programming using Linear Types: The Array Fragment (opens in a new tab)

  18. Artificial intelligence driven framework for the structurization of free-text diagnostic reports

    … ontology-based knowledge representation, n-ary relations according to ontological patterns, and information entropy-based data mining approaches. Diagnostic reports are transformed to knowledge graphs (KGs) of relational triples for further analysis using computers. The goal is to facilitate …

    greece Repository record for Artificial intelligence driven framework for the structurization of free-text diagnostic reports (opens in a new tab)

Page 1 of 3