Browsing Department of Computer Science by Title
Now showing items 6382 of 94

An OCLbased verification approach to analyzing static properties of a UML model.
(20100623)There is a need for more rigorous analysis techniques that developers can use for verifying the critical properties in UML models. The UMLbased Specification Environment (USE) tool supports verification of invariants, ... 
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. 
Performance improvements to peertopeer file transfers using network coding.
(, 20130916)A common peertopeer 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 ... 
PGmeans: learning the number of clusters in data.
(20070319)We present a novel algorithm called PGmeans in this thesis. This algorithm is able to determine the number of clusters in a classical Gaussian mixture model automatically. PGmeans uses efficient statistical hypothesis ... 
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)This report gives one subgroup of each of the conjugacy classes of the subgroups of S7. 
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 ... 
ReviewbyFew or ReviewbyMany?
(20110513)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 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.