BEARdocs

Browsing Department of Computer Science by Title

DSpace/Manakin Repository

Browsing Department of Computer Science by Title

Sort by: Order: Results:

  • Maurer, Peter M.
    We show that any non-singular nxn matrix of order p[superscript n]-1 over GF(p) is a generator of a matrix representation of GF(p[superscript n]). We also determine the number of matrix representations of GF(p[superscript ...
  • Maurer, Peter M.
    Metamorphic programming is an effective tool for creating efficient and elegant solutions to many programming problems, at least once you get over the shock of seeing code that violates many of the accepted rules of good ...
  • Maurer, Peter M.
    Although compiler keywords can be recognized directly in LEX (or flex) these tools are rather slow. MKWHAT is a tool that can be used to generate a keyword recognizer that will recognize key words using a minimal number ...
  • Yao, Yao
    The detailed design document covers the basic theory, related technique, and implementation details of the MovieOracle system. It first provides a high-level system overview. Then it discusses the usage of Twitter API, ...
  • Allen, Jon D. (Jon Douglas) (, )
    Participant-based technologies enable users to contribute resources to a shared pool that in the aggregate provides valuable services, such as social networks, massive multiplayer online games, file exchange, etc. Such ...
  • Maurer, Peter M.
    This report determines the normalizer of the standard representation of Sn in the general linear group of nxn matrices over GF(2). The size of the normalizer is then used to determine the number of classes of conjugate ...
  • Sun, Wuliang.
    There is a need for more rigorous analysis techniques that developers can use for verifying the critical properties in UML models. The UML-based Specification Environment (USE) tool supports verification of invariants, ...
  • Maurer, Peter M.
    This is the software described in the technical report “Two New Techniques for Unit-Delay Compiled Simulation” available from this archive. This package is part of the FHDL system and must be installed in your FHDL directory.
  • Maurer, Peter M.
    This is the software described in the technical report “Two New Techniques for Unit-Delay Compiled Simulation” available from this archive. This package is part of the FHDL system and must be installed in your FHDL directory.
  • Kelley, Aaron A. (, )
    A common peer-to-peer approach to large data distribution is to divide the data into blocks. Peers will gather blocks from other peers in parallel. Problems with this approach are that each peer must know which blocks ...
  • Feng, Yu.
    We present a novel algorithm called PG-means in this thesis. This algorithm is able to determine the number of clusters in a classical Gaussian mixture model automatically. PG-means uses efficient statistical hypothesis ...
  • Maurer, Peter M.
    This report lists the primitive polynomials over GF(2) of degree 2 through 16. These polynomials were generated using a new matrix-based technique I invented.
  • Maurer, Peter M.
    This report lists the primitive polynomials over GF(3) of degree 2 through 11. These polynomials were generated using a new matrix-based technique I invented.
  • Maurer, Peter M.
    This report gives the details an algorithm for determining whether two matrix groups are conjugate to one another. Each group is designated by a pair of matrices that generate the group. The algorithm is able to determine ...
  • Maurer, Peter M.
    This report gives one subgroup of each of the conjugacy classes of the subgroups of S7.
  • Maurer, Peter M.
    As is well known (or should be well known) the finite field GF(2^k) can be represented in the general linear group of kxk matrices over GF(2). There are many such representations. This report gives the 8 representations ...
  • Maurer, Peter
    It’s clear that traditional forms of academic publication are rapidly becoming obsolete. It’s also clear that peer review is a seriously flawed process that could be much improved upon by modern methods of communication. ...
  • Maurer, Peter M.
    The objective of the algorithm described in this report is to optimally guess a hidden binary string based on queries to an oracle where the length of the string is known beforehand. A C++ version of the algorithm is given ...
  • Maurer, Peter M.
    The shadow algorithm is an event-driven unit-delay simulation technique that has been designed to take advantage of the instruction caches present in many of the latest workstations. The algorithm is based on the threaded-code ...
  • Maurer, Peter M.
    This is the software described in the technical report “The Shadow Algorithm: …” available from this archive. This package is part of the FHDL system and must be installed in your FHDL directory.

Search BEARdocs


Advanced Search

Browse

My Account

Statistics