Browsing Department of Computer Science by Title
Now showing items 7392 of 92

A Search Strategy Using a HammingDistance Oracle
(20090804)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
(20091113)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
(20091105)The shadow algorithm is an eventdriven unitdelay 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 threadedcode ... 
Studies of active information in search.
(2010)A search process is an attempt to locate a solution to a problem, such as an optimization problem, where the space is usually too large to exhaustively sample. In order to investigate this idea this work looks a three ... 
The Subgroups of S3 in Cycle Form
(20120119)This technical report lists all subgroups of S3 in cycle form. 
The Subgroups of S4 in Cycle Form
(20120119)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
(20120119)This technical report lists all subgroups of S5 in cycle form, using the integers 04. 
The Subgroups of S6 in Cycle Form
(20120119)This technical report lists all subgroups of S6 in cycle form using the integers 05. 
The Super Symmetric Representations of S4 in GL3(2)
(20130920)This report gives all conjugacy classes of the super symmetric groups HR3 and VR3 
Super Symmetry
(20130920)Super symmetry is a type of matrixbased symmetry that extends the concept of total symmetry. Super symmetric functions are “even more symmetric” than totally symmetric functions. Even if a function is not super ... 
ThreeValued Simulation with the Inversion Algorithm
(20091105)The Inversion Algorithm is an eventdriven logic simulation technique that is competitive with Levelized Compiled Code Simulation. Previous versions of the Inversion Algorithm have been limited to purely binary simulation. ... 
TOKDEC: A Tool for Compiler Debugging
(20091113)TOKDEC is a tool that helps create compiler debugging code by converting numeric tokens into character strings. It is meant to be used with the output of the “yacc” preprocessor. 
Two New Techniques for UnitDelay Compiled Simulation
(20091105)The PCset method and the parallel technique are two methods for generating compiled unitdelay simulations of acyclic circuits. The PCset method analyzes the network, determines the set of potential change times for each ... 
"Twoway" obliviousness in general aspectoriented modeling.
(20081001)A key problem in software development is producing systems that are maintainable even as the concerns at play evolve. Aspectoriented programming (AOP) seeks to foster maintainability by isolating the speciﬁcations of ... 
Unit Delay Scheduling for the Inversion Algorithm
(20091105)The Inversion Algorithm is an event driven algorithm whose performance meets or exceeds that of Levelized Compiled Code simulation, even when the activity rate is unrealistically high. Existing implementations of the ... 
A Universal Symmetry Detection Algorithm
(20130920)Research on symmetry detection focuses on identifying and detecting new types of symmetry. We present an algorithm that is capable of detecting any type of permutation based symmetry, including many types for which there ... 
Using GF(2) matrices in Simulation and Logic Synthesis
(20090123)GF(2) matrices are matrices of ones and zeros under modulo 2 arithmetic. Like the GF(2) polynomials used in error detection and correction, they have many potential uses in Electronic Design Automation (EDA). Nonsingular ... 
Using GF2 Matrices to Simplify Boolean Logic
(20090123)Conventional logic simplification can be couched in terms of singular GF(2) matrices. The advantage to doing this is that different matrices can be used to combine terms that are separated by a Hamming distance greater ... 
Using the Connlib Package to Obtain Parsed Netlist Data
(20091105)The connlib package can be used to obtain parsed netlist data from “.ckt” files. These files must be created using the Functional Hardware Description Language FHDL. This data can be used in any way you choose. The ISCAS85 ... 
Why is Symmetry So Hard?
(20110513)The problem of detecting virtually any type of symmetry is shown to be coNPcomplete. We start with totally symmetric functions, then extend the result to partially symmetric functions, then to more general cofactor ...