Browsing Mathematics (Faculty of) by Title
Now showing items 1504-1523 of 3004
-
Live API Documentation
(University of Waterloo, 2014-07-23)Application Programming Interfaces (APIs) provide powerful abstraction mechanisms that enable complex functionality to be used by client programs. However, this abstraction does not come for free: understanding how to use ... -
Local and Cooperative Autonomous Vehicle Perception from Synthetic Datasets
(University of Waterloo, 2019-09-23)The purpose of this work is to increase the performance of autonomous vehicle 3D object detection using synthetic data. This work introduces the Precise Synthetic Image and LiDAR (PreSIL) dataset for autonomous vehicle ... -
The Local Chromatic Number
(University of Waterloo, 2014-01-23)A graph vertex colouring is called k-local if the number of colours used in the closed neighbourhood of each vertex is at most k. The local chromatic number of a graph is the smallest k for which the graph has a proper ... -
Local Graph Clustering Using l1-regularized PageRank Algorithms
(University of Waterloo, 2020-05-05)Local graph clustering methods are used to find small- and medium-scale clusters without traversing the graph. It has been shown that the combination of Approximate Personalized PageRank (APPR) algorithm and sweep method ... -
Local measurements in Relativistic Quantum Information: localization and signaling
(University of Waterloo, 2023-12-12)In this thesis, we study some foundational aspects of detector models in quantum field theory (QFT) related to signaling and localization, and we analyze certain frictions with relativistic causality. We characterize the ... -
Local Mixture Model in Hilbert Space
(University of Waterloo, 2010-01-26)In this thesis, we study local mixture models with a Hilbert space structure. First, we consider the fibre bundle structure of local mixture models in a Hilbert space. Next, the spectral decomposition is introduced in order ... -
Local Perspectives on Planar Colouring
(University of Waterloo, 2022-08-09)In 1994, Thomassen famously proved that every planar graph is 5-choosable, resolving a conjecture initially posed by Vizing and, independently, Erdos, Rubin, and Taylor in the 1970s. Later, Thomassen proved that every ... -
Local properties of graphs with large chromatic number
(University of Waterloo, 2022-08-31)This thesis deals with problems concerning the local properties of graphs with large chromatic number in hereditary classes of graphs. We construct intersection graphs of axis-aligned boxes and of lines in $\mathbb{R}^3$ ... -
Local Reasoning for Parameterized First Order Protocols
(University of Waterloo, 2019-08-14)First Order Logic (FOL) is a powerful reasoning tool for program verification. Recent work on Ivy shows that FOL is well suited for verification of parameterized distributed systems. However, specifying many natural objects, ... -
Local Structure for Vertex-Minors
(University of Waterloo, 2021-10-12)This thesis is about a conjecture of Geelen on the structure of graphs with a forbidden vertex-minor; the conjecture is like the Graph Minors Structure Theorem of Robertson and Seymour but for vertex-minors instead of ... -
Localising Information in Bandlimited Quantum Field Theory
(University of Waterloo, 2015-09-24)A deeply-held belief in fundamental physics is that interactions must happen locally. Despite the great success of local models, there are many indications that locality must be abandoned in a theory of quantum gravity. For ... -
The Logarithmic Derivative and Model-Theoretic Analysability in Differentially Closed Fields
(University of Waterloo, 2019-01-22)This thesis deals with internal and analysable types, mainly in the context of the stable theory of differentially closed fields. Two main problems are dealt with: the construction of types analysable in the constants with ... -
Lognormal Mixture Model for Option Pricing with Applications to Exotic Options
(University of Waterloo, 2012-08-23)The Black-Scholes option pricing model has several well recognized deficiencies, one of which is its assumption of a constant and time-homogeneous stock return volatility term. The implied volatility smile has been studied ... -
Long-term Average Cost in Featured Transition Systems
(ACM, 2016-09)A software product line is a family of software products that share a common set of mandatory features and whose individual products are differentiated by their variable (optional or alternative) features. Family-based ... -
Long-time behaviour of a coupled PDE model of high intensity focused ultrasound heating of biological tissue
(University of Waterloo, 2021-11-11)High Intensity Focused Ultrasound (HIFU) has emerged as a novel therapeutic modality, for the treatment of various cancers, that is gaining significant traction in clinical oncology. It is a cancer therapy that avoids many ... -
Longer Delays in Rehearsal-based Interfaces Increase Expert Use
(University of Waterloo, 2019-08-08)Rehearsal-based interfaces are designed to encourage a transition from novice to expert, but many users fail to make this transition. Most of these interfaces activate novice mode after a short delay, between 150 and 500ms. ... -
Longevity Risk Management: Models and Hedging Strategies
(University of Waterloo, 2019-04-17)Longevity risk management is becoming increasingly important in the pension and life insurance industries. The unexpected mortality improvements observed in recent decades are posing serious concerns to the financial ... -
Longitudinal Data Analysis with Composite Likelihood Methods
(University of Waterloo, 2012-08-10)Longitudinal data arise commonly in many fields including public health studies and survey sampling. Valid inference methods for longitudinal data are of great importance in scientific researches. In longitudinal studies, ... -
Loop Modeling in Proteins Using a Database Approach with Multi-Dimensional Scaling
(University of Waterloo, 2013-09-26)Modeling loops is an often necessary step in protein structure and function determination, even with experimental X-ray and NMR data. It is well known to be difficult. Database techniques have the advantage of producing ... -
Low-Rank Plus Sparse Decompositions of Large-Scale Matrices via Semidefinite Optimization
(University of Waterloo, 2023-05-19)We study the problem of decomposing a symmetric matrix into the sum of a low-rank symmetric positive semidefinite matrix and a tridiagonal matrix, and a relaxation which looks for symmetric positive semidefinite matrices ...