Browsing Mathematics (Faculty of) by Title
Now showing items 1926-1945 of 2993
-
On the Maintenance Costs of Formal Software Requirements Specification Written in the Software Cost Reduction and in the Real-time Unified Modeling Language Notations
(University of Waterloo, 2005)A formal specification language used during the requirements phase can reduce errors and rework, but formal specifications are regarded as expensive to maintain, discouraging their adoption. This work presents a ... -
On the Modelling of Hyperspectral Light and Skin Interactions and the Simulation of Skin Appearance Changes Due to Tanning
(University of Waterloo, 2016-01-07)The distinctive visual attributes of human skin are largely determined by its interactions with light across different spectral domains. Accordingly, the modelling of these interactions has been the object of extensive ... -
On the Modular Theory of von Neumann Algebras
(University of Waterloo, 2010-09-17)The purpose of this thesis is to provide an exposition of the \textit{modular theory} of von Neumann algebras. The motivation of the theory is to classify and describe von Neumann algebras which do not admit a trace, and ... -
On the Near-Optimality of List Scheduling Heuristics for Local and Global Instruction Scheduling
(University of Waterloo, 2006)Modern architectures allow multiple instructions to be issued at once and have other complex features. To account for this, compilers perform instruction scheduling after generating the output code. The instruction ... -
On the Number of Trials Needed to Obtain k Consecutive Successes
(Elsevier, 2021-04-30)A sequence of independent Bernoulli trials, each of which is a success with probability p, is conducted. For k ∈ Z+, let Xk be the number of trials required to obtain k consecutive successes. Using techniques from elementary ... -
On the Optical Monitoring of Anemia Severity Levels
(University of Waterloo, 2015-08-13)Anemia is a prevalent medical condition that seriously a ects millions of people all over the world. In many regions, not only its initial detection, but also its monitoring are hindered by the limited access to laboratory ... -
On the optimal CFL number of SSP methods for hyperbolic problems
(Elsevier, 2019-01-01)We show that the theory for strong stability preserving (SSP) time stepping methods employed with the method of lines-type discretizations of hyperbolic conservation laws may result in overly stringent time step restrictions. ... -
On the orientation of hypergraphs
(University of Waterloo, 2011-01-13)This is an expository thesis. In this thesis we study out-orientations of hypergraphs, where every hyperarc has one tail vertex. We study hypergraphs that admit out-orientations covering supermodular-type connectivity ... -
On the Polyhedral Lift-and-Project Rank Conjecture for the Fractional Stable Set Polytope
(University of Waterloo, 2008-01-16)In this thesis, we study the behaviour of Lovasz and Schrijver's lift-and-project operators N and N_0 while being applied recursively to the fractional stable set polytope of a graph. We focus on two related conjectures ... -
On the Power and Limitations of Shallow Quantum Circuits
(University of Waterloo, 2022-09-01)Constant-depth quantum circuits, or shallow quantum circuits, have been shown to exhibit behavior that is uniquely quantum. This thesis explores the power and limitations of constant-depth quantum circuits, in particular ... -
On the power of interleaved low-depth quantum and classical circuits
(University of Waterloo, 2022-09-26)Low-depth quantum circuits are a well-suited model for near-term quantum devices, given short coherence times and noisy gate operations, making it pivotal to examine their computational power. It was already known as early ... -
On the Properties and Structure of Bordered Words and Generalizations
(University of Waterloo, 2022-10-12)Combinatorics on words is a field of mathematics and theoretical computer science that is concerned with sequences of symbols called words, or strings. One class of words that are ubiquitous in combinatorics on words, ... -
On the Relation between Quantum Discord and Purified Entanglement
(University of Waterloo, 2013-08-30)In this thesis, I study bipartite discord between A and B in terms of the structure formed by the bipartite and tripartite entanglement found in the purified system ABC. I find that discord manifests itself only when there ... -
On the Relationship between Conjugate Gradient and Optimal First-Order Methods for Convex Optimization
(University of Waterloo, 2014-01-23)In a series of work initiated by Nemirovsky and Yudin, and later extended by Nesterov, first-order algorithms for unconstrained minimization with optimal theoretical complexity bound have been proposed. On the other hand, ... -
On the relationship between satisfiability and partially observable Markov decision processes
(University of Waterloo, 2018-09-26)Stochastic satisfiability (SSAT), Quantified Boolean Satisfiability (QBF) and decision-theoretic planning in finite horizon partially observable Markov decision processes (POMDPs) are all PSPACE-Complete problems. Since ... -
On the Relationship between Sum-Product Networks and Bayesian Networks
(University of Waterloo, 2015-06-08)Sum-Product Networks (SPNs), which are probabilistic inference machines, have attracted a lot of interests in recent years. They have a wide range of applications, including but not limited to activity modeling, language ... -
On the Relationship Between the Developer’s Perceptible Ethnicity and the Evaluation of Contributions in GitHub
(University of Waterloo, 2020-08-28)Context: Open Source Software (OSS) projects are typically the result of collective efforts performed by developers with different backgrounds. Although the quality of developers' contributions should be the only factor ... -
On the Representation Theory of Semisimple Lie Groups
(University of Waterloo, 2010-08-30)This thesis is an expository account of three central theorems in the representation theory of semisimple Lie groups, namely the theorems of Borel-Weil-Bott, Casselman-Osborne and Kostant. The first of these realizes all ... -
On the Role of Partition Inequalities in Classical Algorithms for Steiner Problems in Graphs
(University of Waterloo, 2006)The Steiner tree problem is a classical, well-studied, $\mathcal{NP}$-hard optimization problem. Here we are given an undirected graph $G=(V,E)$, a subset $R$ of $V$ of terminals, and non-negative costs $c_e$ for all ... -
On the roughness of paths and processes
(University of Waterloo, 2021-09-10)In recent years, a significant amount of the stochastic volatility literature has focused on modelling the ``roughness" or irregularity of the unobserved volatility time series and its effect on option pricing. In many ...