Computer Science
This is the collection for the University of Waterloo's Cheriton School of Computer Science .
Research outputs are organized by type (eg. Master Thesis, Article, Conference Paper).
Waterloo faculty, students, and staff can contact us or visit the UWSpace guide to learn more about depositing their research.
Recent deposits

WatchTrace: Design and Evaluation of an AtYourSide Gesture Paradigm
(University of Waterloo, 20171116)In this thesis, we present the exploration and evaluation of a gesture interaction paradigm performed with arms at rest at the side of one's body. This gesture stance is informed persisting challenges in midair arm gesture ... 
Syntactic Complexities of Six Classes of StarFree Languages
(OttovonGuerickeUniversit¨at Magdeburg, 2012)The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of regular languages is the maximal syntactic complexity of languages in that subclass, ... 
Quotient complexity of ideal languages
(Elsevier, 20130128)A language L over an alphabet Σ is a right (left) ideal if it satisfies L=LΣ∗ (L=Σ∗L). It is a twosided ideal if L=Σ∗LΣ∗, and an allsided ideal if L=Σ∗L, the shuffle of Σ∗ with L. Ideal languages are not only of interest ... 
Syntactic complexity of prefix, suffix, bifix, and factorfree regular languages
(Elsevier, 20120831)The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in ... 
Most Complex Regular Ideal Languages
(Discrete Mathematics and Theoretical Computer Science, 20161017)A right ideal (left ideal, twosided ideal) is a nonempty language $L$ over an alphabet $\Sigma$ such that $L=L\Sigma^*$ ($L=\Sigma^*L$, $L=\Sigma^*L\Sigma^*$). Let $k=3$ for right ideals, 4 for left ideals and 5 for ... 
Trust Region Methods for Training Neural Networks
(University of Waterloo, 20171109)Artificial feedforward neural networks (ffANNs) serve as powerful machine learning models for supervised classification problems. They have been used to solve problems stretching from natural language processing to ... 
Building a Better Tor Experimentation Platform from the Magic of Dynamic ELFs
(University of Waterloo, 20171030)Tor is the most popular tool for providing online anonymity. It is used by journalists, activists, and privacyconscious individuals to provide lowlatency private access to the Internet. However, Tor’s specific design and ... 
HybridPointing Touch: A Technique to Switch Between Absolute and Relative Pointing on Large Touch Screens
(University of Waterloo, 20171025)We extend Forlines et al.'s idea of mixed absolute and relative "HybridPointing" to large multitouch displays. In our bimanual "CursorTap" interaction technique, one hand triggers a kinaesthetic relative pointing mode while ... 
Straight Line Movement in Morphing and Pursuit Evasion
(University of Waterloo, 20171024)Piecewise linear structures are widely used to define problems and to represent simplified solutions in computational geometry. A piecewise linear structure consists of straightline or linear pieces connected together ... 
A spiking neural network of state transition probabilities in modelbased reinforcement learning
(University of Waterloo, 20171023)The development of the field of reinforcement learning was based on psychological studies of the instrumental conditioning of humans and other animals. Recently, reinforcement learning algorithms have been applied to ... 
Verifying Mutable Systems
(University of Waterloo, 20171023)Model checking has had much success in the verification of singleprocess and multiprocess programs. However, model checkers assume an immutable topology which limits the verification in several areas. Consider the security ... 
Halfway to Halfspace Testing
(University of Waterloo, 20171018)In this thesis I study the problem of testing halfspaces under arbitrary probability distributions, using only random samples. A halfspace, or linear threshold function, is a boolean function f : Rⁿ → {±1} defined as the ... 
Quotient Complexity of Bifix, Factor, and Subwordfree Regular Language
(Institute of Informatics: University of Szeged, 2014)A language $L$ is prefixfree if whenever words $u$ and $v$ are in $L$ and $u$ is a prefix of $v$, then $u=v$. Suffix, factor, and subwordfree languages are defined similarly, where by ``subword" we mean ``subsequence", ... 
Complexity of RightIdeal, PrefixClosed, and PrefixFree Regular Languages
(Institute of Informatics: University of Szeged, 2017)A language L over an alphabet E is prefixconvex if, for any words x, y, z is an element of Sigma*, whenever x and xyz are in L, then so is xy. Prefixconvex languages include rightideal, prefixclosed, and prefixfree ... 
Quotient Complexities of Atoms in Regular Ideal Languages
(Institute of Informatics: University of Szeged, 2015)A (left) quotient of a language L by a word w is the language w(1) L = {x vertical bar wx is an element of L}. The quotient complexity of a regular language L is the number of quotients of L; it is equal to the state ... 
The Positive and Negative Influence of Search Results on People's Decisions about the Efficacy of Medical Treatments
(ACM, 20171001)People regularly use web search engines to investigate the efficacy of medical treatments. Search results can contain documents that present incorrect information that contradicts current established medical understanding ... 
In Search Of Most Complex Regular Languages
(World Scientific Publishing, 20130901)Sequences (Ln vertical bar n >= k), called streams, of regular languages Ln are considered, where k is some small positive integer, n is the state complexity of Ln, and the languages in a stream differ only in the ... 
On The Complexity Of The Evaluation Of Transient Extensions Of Boolean Functions
(World Scientific Publishing, 20120101)Transient algebra is a multivalued algebra for hazard detection in gate circuits. Sequences of alternating 0's and 1's, called transients, represent signal values, and gates are modeled by extensions of boolean functions ... 
Quotient Complexity Of StarFree Languages
(World Scientific Publishing, 20120901)The quotient complexity, also known as state complexity, of a regular language is the number of distinct left quotients of the language. The quotient complexity of an operation is the maximal quotient complexity of the ... 
Complexity Of Atoms Of Regular Languages
(World Scientific Publishing, 20131101)The quotient complexity of a regular language L, which is the same as its state complexity the number of left quotients of L. An atom of a nonempty regular language L with n quotients is a nonempty intersection of the n ...