Browsing Mathematics (Faculty of) by Title
Now showing items 2874-2893 of 3013
-
Type-Aware Optimizations with Imperfect Types
(University of Waterloo, 2024-05-10)JavaScript, a programming language originally designed for web browsers, has become ubiquitous, experiencing adoption across multiple platforms. Its dynamic type system and prototype-based object orientation are well-known ... -
UCAnDoModels: A Context-based Model Editor for Editing and Debugging UML Class and State-Machine Diagrams
(ACM/IEEE, 2019-09)Practitioners face cognitive challenges when using model editors to edit and debug UML models, which make them reluctant to adopt modelling. To assist practitioners in their modelling tasks, we have developed effective ... -
Unavoidable Minors of Large 5-Connected Graphs
(University of Waterloo, 2016-08-24)This thesis shows that, for every positive integer $n \geq 5$, there exists a positive integer $N$ such that every $5-$connected graph with at least $N$ vertices has a minor isomorphic to one of thirty explicitly defined ... -
Unbiased Statistical Estimation and Valid Confidence Intervals Under Differential Privacy
(University of Waterloo, 2022-07-13)We present a method for producing unbiased parameter estimates and valid confidence intervals under the constraints of differential privacy, a formal framework for limiting individual information leakage from sensitive ... -
Unconditionally Secure Cryptography: Signature Schemes, User-Private Information Retrieval, and the Generalized Russian Cards Problem
(University of Waterloo, 2013-05-23)We focus on three different types of multi-party cryptographic protocols. The first is in the area of unconditionally secure signature schemes, the goal of which is to provide users the ability to electronically sign ... -
Unconventional Applications of Compiler Analysis
(University of Waterloo, 2011-08-30)Previously, compiler transformations have primarily focused on minimizing program execution time. This thesis explores some examples of applying compiler technology outside of its original scope. Specifically, ... -
Under-Ice Fluid Dynamics in Freshwater Lakes: Implications for Ecology in a Changing Climate
(University of Waterloo, 2021-08-24)An abundance of evidence exists to support the notion of annual winter blooms of phytoplankton, particularly diatoms, persistent in the surface waters of freshwater lakes located in temperate and boreal climatic zones. ... -
Understanding and Efficiently Servicing HTTP Streaming Video Workloads
(University of Waterloo, 2016-09-28)Live and on-demand video streaming has emerged as the most popular application for the Internet. One reason for this success is the pragmatic decision to use HTTP to deliver video content. However, while all web servers ... -
Understanding and Enhancing CDCL-based SAT Solvers
(University of Waterloo, 2018-08-02)Modern conflict-driven clause-learning (CDCL) Boolean satisfiability (SAT) solvers routinely solve formulas from industrial domains with millions of variables and clauses, despite the Boolean satisfiability problem being ... -
Understanding Minimax Optimization in Modern Machine Learning
(University of Waterloo, 2021-07-21)Recent years has seen a surge of interest in building learning machines through adversarial training. One type of adversarial training is through a discriminator or an auxiliary classifier, such as Generative Adversarial ... -
Understanding Mode and Modality Transfer in Unistroke Gesture Input
(University of Waterloo, 2021-10-22)Unistroke gestures are an attractive input method with an extensive research history, but one challenge with their usage is that the gestures are not always self-revealing. To obtain expertise with these gestures, interaction ... -
Understanding NUMA Effects on Memory Allocation and Reclamation
(University of Waterloo, 2023-04-21)Memory management in multicore systems is a well studied area. Many approaches to memory management have been developed and tuned with specific hardware architectures in mind, capitalizing on hardware characteristics to ... -
Understanding Programmers' Working Context by Mining Interaction Histories
(University of Waterloo, 2013-05-06)Understanding how software developers do their work is an important first step to improving their productivity. Previous research has generally focused either on laboratory experiments or coarsely-grained industrial case ... -
Unfolding and Reconstructing Polyhedra
(University of Waterloo, 2006)This thesis covers work on two topics: unfolding polyhedra into the plane and reconstructing polyhedra from partial information. For each topic, we describe previous work in the area and present an array of new research ... -
A Unified Simplicial Model for Mixed-Dimensional and Non-Manifold Deformable Elastic Objects
(ACM, 2019-07)We present a unified method to simulate deformable elastic bodies consisting of mixed-dimensional components represented with potentially non-manifold simplicial meshes. Building on well-known simplicial rod, shell, and ... -
A Uniform Formal Approach to Business and Access Control Models, Policies and their Combinations
(University of Waterloo, 2012-07-26)Access control represents an important part of security in software systems, since access control policies determine which users of a software system have access to what objects and operations and under what constraints. ... -
Uniform Generation of Graphical Realizations of Joint Degree Matrices
(University of Waterloo, 2023-09-21)In this thesis, we introduce JDM_GEN, an algorithm designed to uniformly generate graphical realizations of a given joint degree matrix. Amanatidis and Kleer previously employed an MCMC-based method to address this ... -
Uniform Mixing of Quantum Walks and Association Schemes
(University of Waterloo, 2013-09-26)In recent years quantum algorithms have become a popular area of mathematical research. Farhi and Gutmann introduced the concept of a quantum walk in 1998. In this thesis we investigate mixing properties of continuous-time ... -
Uniform Mixing on Cayley Graphs over Z_3^d
(University of Waterloo, 2014-05-22)This thesis investigates uniform mixing on Cayley graphs over Z_3^d. We apply Mullin's results on Hamming quotients, and characterize the 2(d+2)-regular connected Cayley graphs over Z_3^d that admit uniform mixing at time ... -
Uniqueness and Complexity in Generalised Colouring
(University of Waterloo, 2003)The study and recognition of graph families (or graph properties) is an essential part of combinatorics. Graph colouring is another fundamental concept of graph theory that can be looked at, in large part, as the recognition ...