Browsing Mathematics (Faculty of) by Title
Now showing items 1485-1504 of 2994
-
Linearization Methods in Time Series Analysis
(University of Waterloo, 2011-09-30)In this dissertation, we propose a set of computationally efficient methods based on approximating/representing nonlinear processes by linear ones, so-called linearization. Firstly, a linearization method is introduced for ... -
Linearized Stability of Partial Differential Equations with Application to Stabilization of the Kuramoto--Sivashinsky Equation
(Society for Industrial and Applied Mathematics, 2018-01-05)Linearization is a useful tool for analyzing the stability of nonlinear differential equations. Unfortunately, the proof of the validity of this approach for ordinary differential equations does not generalize to all ... -
Linearizing Contextual Multi-Armed Bandit Problems with Latent Dynamics
(University of Waterloo, 2022-02-10)In many real-world applications of multi-armed bandit problems, both rewards and observed contexts are often influenced by confounding latent variables which evolve stochastically over time. While the observed contexts and ... -
Linearly-dense classes of matroids with bounded branch-width
(University of Waterloo, 2017-09-27)Let $M$ be a non-empty minor-closed class of matroids with bounded branch-width that does not contain arbitrarily large simple rank-$2$ matroids. For each non-negative integer $n$ we denote by $ex(n)$ the size of the ... -
The Linkage Problem for Group-labelled Graphs
(University of Waterloo, 2009-09-24)This thesis aims to extend some of the results of the Graph Minors Project of Robertson and Seymour to "group-labelled graphs". Let $\Gamma$ be a group. A $\Gamma$-labelled graph is an oriented graph with its edges labelled ... -
Linking Alloy with SMT-based Finite Model Finding
(University of Waterloo, 2021-01-28)Alloy is a well-known declarative language for modelling systems early in the development process. Currently, it uses the Kodkod library as its back-end for finite model finding (finding instances of the model by determining ... -
List 3-Coloring Graphs with No Induced P6+rP3
(Springer Nature, 2021-01-01)For an integer t, we let Pt denote the t-vertex path. We write H+G for the disjoint union of two graphs H and G, and for an integer r and a graph H, we write rH for the disjoint union of r copies of H. We say that a graph ... -
List 3-coloring Pt-free graphs with no induced 1-subdivision of K1,s
(Elsevier, 2020-11)Let s and t be positive integers. We use Pt to denote the path with t vertices and K1,s to denote the complete bipartite graph with parts of size 1 and s respectively. The one-subdivision of K1,s is obtained by replacing ... -
List Coloring Some Classes of 1-Planar Graphs
(University of Waterloo, 2021-12-23)In list coloring we are given a graph G and a list assignment for G which assigns to each vertex of G a list of possible colors. We wish to find a coloring of the vertices of G such that each vertex uses a color from its ... -
List colouring hypergraphs and extremal results for acyclic graphs
(University of Waterloo, 2008-05-21)We study several extremal problems in graphs and hypergraphs. The first one is on list-colouring hypergraphs, which is a generalization of the ordinary colouring of hypergraphs. We discuss two methods for determining the ... -
Lithium-Ion battery SOC estimation
(University of Waterloo, 2017-01-23)Lithium-ion batteries are frequently used in Hybrid electric vehicles (HEVs), which are taking the place of gas-engine vehicles. An important but not measurable quantity in HEVs is the amount of charge remaining in the ... -
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, ...