Now showing items 21-40 of 1398

    • AddressWatcher: Automatic Memory Leak Fixing 

      Murali, Aniruddhan (University of Waterloo, 2021-12-17)
      Automatic bug fixing has become a promising direction over manual fixing of bugs. In this work, we focus on a specific bug: Memory Leaks. We propose an automatic approach to suggest memory leak fixes in C/C++ programs ...
    • ADMM for SDP Relaxation of GP 

      Sun, Hao (University of Waterloo, 2016-08-30)
      We consider the problem of partitioning the set of nodes of a graph G into k sets of given sizes in order to minimize the cut obtained after removing the k-th set. This is a variant of the well-known vertex separator ...
    • Advisor Networks and Referrals for Improved Trust Modelling in Multi-Agent Systems 

      Gorner, Joshua Mark (University of Waterloo, 2011-02-16)
      This thesis relates to the usage of trust modelling in multi-agent systems - environments in which there are interacting software agents representing various users (for example, buyers and sellers exchanging products and ...
    • The aesthetics of science fiction spaceship design 

      Kinnear, Kate (University of Waterloo, 2010-01-18)
      In this thesis, we present a detailed analysis of the conventions that appear in fictional spaceship design, including a discussion of their origins, their uses in emulating certain traits, and reasons these conventions ...
    • Affect Lexicon Induction For the Github Subculture Using Distributed Word Representations 

      Jiao, Yuwei (University of Waterloo, 2018-11-06)
      Sentiments and emotions play essential roles in small group interactions, especially in self-organized collaborative groups. Many people view sentiments as universal constructs; however, cultural differences exist in some ...
    • Affective and Human-Like Virtual Agents 

      Budnarain, Bhavendra (University of Waterloo, 2020-09-29)
      In Artificial Intelligence (AI) one of the technological goals is to build intelligent systems that not only perform human level tasks efficiently, but can also simulate and exhibit human-like behaviour. As the emphasis ...
    • Affective Sentiment and Emotional Analysis of Pull Request Comments on GitHub 

      Rishi, Deepak (University of Waterloo, 2017-12-15)
      Sentiment and emotional analysis on online collaborative software development forums can be very useful to gain important insights into the behaviors and personalities of the developers. Such information can later on be ...
    • An Affine Semi-Lagrangian Advection Method 

      Marcoux-Ouellet, Jade (University of Waterloo, 2019-01-08)
      In computer graphics, the standard semi-Lagrangian advection as in the work of Stam (1999) is a widespread unconditionally stable transport scheme used in incompressible fluid solvers. Due to its stability, which disconnects ...
    • Aggregation of Heterogeneous Anomaly Detectors for Cyber-Physical Systems 

      Dunne, Murray (University of Waterloo, 2019-01-07)
      Distributed, life-critical systems that bridge the gap between software and hardware are becoming an integral part of our everyday lives. From autonomous cars to smart electrical grids, such cyber-physical systems will ...
    • Agile Architecture Recovery 

      Svetinovic, Davor (University of Waterloo, 2002)
      Many software development projects start with an existing code base that has to be tightly integrated into a new system. In order to make a robust system that will achieve the desired business goals, developers must be ...
    • Aiding Human Discovery of Out-of-the-Moment Handwriting Recognition Errors 

      Stedman, Ryan (University of Waterloo, 2009-04-30)
      Handwriting recognizers frequently misinterpret digital ink input, requiring human verification of recognizer output to identify and correct errors, before the output of the recognizer can be used with any confidence int ...
    • Algebraic Analysis of Vertex-Distinguishing Edge-Colorings 

      Clark, David (University of Waterloo, 2006)
      Vertex-distinguishing edge-colorings (vdec colorings) are a restriction of proper edge-colorings. These special colorings require that the sets of edge colors incident to every vertex be distinct. This is a relatively ...
    • Algebraic and combinatorial aspects of incidence groups and linear system non-local games arising from graphs 

      Paddock, Connor (University of Waterloo, 2019-06-06)
      To every linear binary-constraint system (LinBCS) non-local game, there is an associated algebraic object called the solution group. Cleve, Liu, and Slofstra showed that a LinBCS game has a perfect quantum strategy if and ...
    • Algebraic characterization of multivariable dynamics 

      Ramsey, Christopher (University of Waterloo, 2009-03-26)
      Let X be a locally compact Hausdorff space along with n proper continuous maps σ = (σ1 , · · · , σn ). Then the pair (X, σ) is called a dynamical system. To each system one can associate a universal operator algebra called ...
    • The Algebraic Kirchberg--Phillips Conjecture for Leavitt Path Algebras 

      Hossain, Ehsaan (University of Waterloo, 2015-09-18)
      This essay is meant to be an exposition of the theory of Leavitt path algebras and graph C*-algebras, with an aim to discuss some current classification questions. These two classes of algebras sit on opposite sides of a ...
    • Algebraic Methods for Reducibility in Nowhere-Zero Flows 

      Li, Zhentao (University of Waterloo, 2007-09-25)
      We study reducibility for nowhere-zero flows. A reducibility proof typically consists of showing that some induced subgraphs cannot appear in a minimum counter-example to some conjecture. We derive algebraic proofs of ...
    • Algebraic Tori in Cryptography 

      Alexander, Nicholas Charles (University of Waterloo, 2005)
      Communicating bits over a network is expensive. Therefore, cryptosystems that transmit as little data as possible are valuable. This thesis studies several cryptosystems that require significantly less bandwidth than ...
    • An Algorithm for Stable Matching with Approximation up to the Integrality Gap 

      Tofigzade, Natig (University of Waterloo, 2020-07-10)
      In the stable matching problem we are given a bipartite graph G = (A ∪ B, E) where A and B represent disjoint groups of agents, each of whom has ordinal preferences over the members of the opposite group. The goal is to ...
    • Algorithm Substitution Attacks: Detecting ASAs Using State Reset and Making ASAs Asymmetric 

      Hodges, Philip (University of Waterloo, 2021-08-27)
      The field of cryptography has made incredible progress in the last several decades. With the formalization of security goals and the methods of provable security, we have achieved many privacy and integrity guarantees in ...
    • Algorithms and Design Principles for Rural Kiosk Networks 

      Guo, Shimin (University of Waterloo, 2007-09-19)
      The KioskNet project aims to provide extremely low-cost Internet access to rural kiosks in developing countries, where conventional access technologies, \eg\, DSL, CDMA and dial-up, are currently economically infeasible. ...


      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages