Now showing items 44-63 of 74

  • 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, ...
  • 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 ...
  • 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.
  • 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. ...
  • A Search Strategy Using a Hamming-Distance Oracle 

    Maurer, Peter M. (2009-08-04)
    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 ...
  • The Shadow Algorithm Software Package 

    Maurer, Peter M. (2009-11-13)
    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.
  • The Shadow Algorithm: A Scheduling Technique for Both Compiled and Interpreted Simulation 

    Maurer, Peter M. (2009-11-05)
    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 ...
  • The Subgroups of S3 in Cycle Form 

    Maurer, Peter M. (2012-01-19)
    This technical report lists all subgroups of S3 in cycle form.
  • The Subgroups of S4 in Cycle Form 

    Maurer, Peter M. (2012-01-19)
    This technical report lists all subgroups of S4, the symmetric group of degree 4. Subgroups are listed in cycle form using the integers 0, 1, 2, and 3.
  • The Subgroups of S5 in Cycle Form 

    Maurer, Peter M. (2012-01-19)
    This technical report lists all subgroups of S5 in cycle form, using the integers 0-4.
  • The Subgroups of S6 in Cycle Form 

    Maurer, Peter M. (2012-01-19)
    This technical report lists all subgroups of S6 in cycle form using the integers 0-5.