Browsing Mathematics (Faculty of) by Title
Now showing items 2881-2900 of 3012
-
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 ... -
UNiS: A User-space Non-intrusive Workflow-aware Virtual Network Function Scheduler
(University of Waterloo, 2019-01-16)Network Function Virtualization (NFV) has gained a significant research interest in both academia and industry since its inception in the late 2012. One of the key research issues in NFV is the development of systems for ... -
Unitary Correlation Sets and their Applications
(University of Waterloo, 2019-07-04)We relate Connes' embedding problem in operator algebras to the Brown algebra Unc(n), which is defined as the universal unital C*-algebra generated by the entries of an n x n unitary matrix. In particular, we show that the ... -
Universal bounds for positive matrix semigroups
(Polish Academy of Sciences, 2016)We show that any compact semigroup of positive n×n matrices is similar (via a positive diagonal similarity) to a semigroup bounded by n√. We give examples to show this bound is best possible. We also consider the effect ... -
Universal Database System Analysis for Insight and Adaptivity
(University of Waterloo, 2022-12-13)Database systems are ubiquitous; they serve as the cornerstone of modern application infrastructure due to their efficient data access and storage. Database systems are commonly deployed in a wide range of environments, from ... -
Universe Beyond Inflation and ΛCDM
(University of Waterloo, 2021-09-09)The current paradigm of universe, $\Lambda CDM$ model with an early phase of inflation, has been quite successful in describing our universe in a simple manner, yet matching well with the observational evidence. This model ... -
The Unobserved Waiting Customer Approximation
(Springer, 2021-06-02)We introduce a new approximation procedure to improve the accuracy of matrix analytic methods when using truncated queueing models to analyse infinite buffer systems. This is accomplished through emulating the presence of ... -
Unrestricted State Complexity Of Binary Operations On Regular And Ideal Languages
(Institut für Informatik, 2017-08-27)We study the state complexity of binary operations on regular languages over different alphabets. It is known that if L′m and Ln are languages of state complexities m and n, respectively, and restricted to the same alphabet, ...