Browsing Computer Science Technical Reports by Title
Now showing items 3857 of 76

The HyperLinear Package
(20091113)The HyperLinear package is the core of the hyperlinear simulation technique described in Reference 1. Given the specification of a Boolean function, the package will detect all partial and total symmetries and return the ... 
HyperSim
(20091113)This software package implements the simulation algorithm described in the tech report “Using GF(2) matrices in Simulation and Logic Synthesis” found in this archive. (http://hdl.handle.net/2104/5263). This package is part ... 
Improving the Learning Platform for the Leukocoria Detection Project
(20160831)ABSTRACT Improving the Learning Platform for the Leukocoria Detection Project James Boer, M.S. Mentor: Gregory J. Hamerly, Ph.D. In this paper we describe a new and signi cantly improved learning platform for the ... 
The Inversion Algorithm for Digital Simulation
(20091105)The Inversion Algorithm is an eventdriven algorithm, whose performance rivals or exceeds that of Levelized Compiled code simulation, even at activity rates of 50% or more. The Inversion Algorithm has several unique ... 
The InversionAlgorithm Software
(20091113)The software in this package implements four versions of the Inversion algorithm. Four executable files are produced.These executables are used in much the same way as the FHDL package, but only AND, OR, NAND, NOR, NOT, ... 
The ISCAS85 Benchmarks in FHDL Format
(20091113)The three files that constitute this tech report are ISCAS85.fhdl.zip, ISCAS85.InputVectors.zip, and ISCAS85.VectorGenerators.zip. The first file contains the 10 ISCAS85 benchmarks in FHDL format, plus the smoketest circuit ... 
The ISCAS89 Benchmarks in FHDL Format
(20091113)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. 
Matrix Representations of GF(p[superscript n]) over GF(p)
(20140131)We show that any nonsingular 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
(20090415)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 CompilerDevelopment Tool for Fast Keyword Recognition
(20091113)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
(20110913)The detailed design document covers the basic theory, related technique, and implementation details of the MovieOracle system. It first provides a highlevel 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)
(20130920)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
(20091113)This is the software described in the technical report “Two New Techniques for UnitDelay Compiled Simulation” available from this archive. This package is part of the FHDL system and must be installed in your FHDL directory. 
The PCSet Method Software Package
(20091113)This is the software described in the technical report “Two New Techniques for UnitDelay 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
(20130920)This report lists the primitive polynomials over GF(2) of degree 2 through 16. These polynomials were generated using a new matrixbased technique I invented. 
Primitive Polynomials for the Field GF(3): Degree 2 through Degree 11
(20130920)This report lists the primitive polynomials over GF(3) of degree 2 through 11. These polynomials were generated using a new matrixbased technique I invented. 
A Quick Algorithm for Identifying Conjugate Groups in GF(2)
(20090218)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
(20140623)Fueled by evergrowing 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)
(20130920)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)
(20130920)This report gives one subgroup of each of the conjugacy classes of the subgroups of S7.