Now showing items 49-68 of 88

  • The ISCAS89 Benchmarks in FHDL Format 

    Maurer, Peter M. (2009-11-13)
    The .zip file contains each of the ISCAS89 Benchmarks in FHDL format. Also included is a random vector generator file for each circuit. (For what it’s worth.) The generators are written in the DGL language.
  • Java bytecode compilation for high-performance, platform-independent logical inference. 

    Arte, Ashish. (2006-05-11)
    Automated reasoning systems are powerful computer programs capable of solving complex problems. They are characterized as computationally intensive having high performance requirements. Very few reasoning systems have ...
  • Matrix Representations of GF(p[superscript n]) over GF(p) 

    Maurer, Peter M. (2014-01-31)
    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 ...
  • Metamorphic programming 

    Maurer, Peter M. (2009-04-15)
    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 ...
  • MKWHAT: A Compiler-Development Tool for Fast Keyword Recognition 

    Maurer, Peter M. (2009-11-13)
    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 ...
  • MovieOracle System 

    Yao, Yao (2011-09-13)
    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, ...
  • MultiKarma : a fully decentralized virtual multi-currency. 

    Allen, Jon D. (Jon Douglas) (, 2011-09-14)
    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 ...
  • The Number of Conjugates of the Standard Representation of Sn in the General Linear Group over GF(2) 

    Maurer, Peter M. (2013-09-20)
    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 ...
  • An OCL-based verification approach to analyzing static properties of a UML model. 

    Sun, Wuliang. (2010-06-23)
    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, ...
  • The Parallel Technique Software Package 

    Maurer, Peter M. (2009-11-13)
    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.
  • The PC-Set Method Software Package 

    Maurer, Peter M. (2009-11-13)
    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.
  • Performance improvements to peer-to-peer file transfers using network coding. 

    Kelley, Aaron A. (, 2013-09-16)
    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 ...
  • PG-means: learning the number of clusters in data. 

    Feng, Yu. (2007-03-19)
    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 ...
  • Primitive Polynomials for the Field GF(2): Degree 2 through Degree 16 

    Maurer, Peter M. (2013-09-20)
    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.
  • Primitive Polynomials for the Field GF(3): Degree 2 through Degree 11 

    Maurer, Peter M. (2013-09-20)
    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.
  • A Quick Algorithm for Identifying Conjugate Groups in GF(2) 

    Maurer, Peter M. (2009-02-18)
    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 ...
  • Recommendations Made Easy 

    Guinness, Darren; Karbasi, Paniz; Nazarov, Rovshen; Speegle, Greg (2014-06-23)
    Fueled by ever-growing data, the need to provide recommendations for consumers, and the considerable domain knowledge required to implement distributed large scale graph solutions we sought to provide recommendations for ...
  • The Representations of GF(8) in GL3(2) 

    Maurer, Peter M. (2013-09-20)
    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 ...
  • The Representations of GF(8) in GL3(2) 

    Maurer, Peter M. (2013-09-20)
    This report gives one subgroup of each of the conjugacy classes of the subgroups of S7.
  • Review-by-Few or Review-by-Many? 

    Maurer, Peter (2011-05-13)
    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. ...