Browsing Mathematics (Faculty of) by Title
Now showing items 1898-1917 of 3004
-
On Reconfiguration Problems: Structure and Tractability
(University of Waterloo, 2015-02-18)Given an n-vertex graph G and two vertices s and t in G, determining whether there exists a path and computing the length of the shortest path between s and t are two of the most fundamental graph problems. In the classical ... -
On Schnyder's Theorm
(University of Waterloo, 2010-08-20)The central topic of this thesis is Schnyder's Theorem. Schnyder's Theorem provides a characterization of planar graphs in terms of their poset dimension, as follows: a graph G is planar if and only if the dimension of ... -
On selfadjoint extensions of semigroups of partial isometries
(American Mathematical Society, 2016)Let S be a semigroup of partial isometries acting on a complex, infinite- dimensional, separable Hilbert space. In this paper we seek criteria which will guarantee that the selfadjoint semigroup T generated by S consists ... -
On Skin Cyanotic Appearances and Spectral Responses Elicited by Methemoglobinemia and Sulfhemoglobinemia
(University of Waterloo, 2018-07-13)Methemoglobinemia and sulfhemoglobinemia are potentially life-threatening blood disorders characterized by similar symptoms and markedly distinct treatment procedures. In this thesis, we investigate the causal relationship ... -
On Some Stochastic Optimal Control Problems in Actuarial Mathematics
(University of Waterloo, 2017-01-17)The event of ruin (bankruptcy) has long been a core concept of risk management interest in the literature of actuarial science. There are two major research lines. The first one focuses on distributional studies of some ... -
On some topics in Levy insurance risk models
(University of Waterloo, 2019-07-16)Risk management has long been the central focus within actuarial science. There are various risks a typical actuarial company would look into, solvency risk being one of them. This falls under the scope of surplus analysis. ... -
On Stability and Stabilization of Hybrid Systems
(University of Waterloo, 2015-12-23)The thesis addresses the stability, input-to-state stability (ISS), and stabilization problems for deterministic and stochastic hybrid systems with and without time delay. The stabilization problem is achieved by reliable, ... -
On symmetric intersecting families of vectors
(Cambridge University Press, 2021-11)A family of vectors in [k]n is said to be intersecting if any two of its elements agree on at least one coordinate. We prove, for fixed k ≥ 3, that the size of any intersecting subfamily of [k]n invariant under a transitive ... -
On the Application of Bandlimitation and Sampling Theory to Quantum Field Theory
(University of Waterloo, 2020-10-07)It is widely believed that combining the uncertainty principle with gravity will lead to an effective minimum length scale. A particular challenge is to specify this scale in a coordinate-independent manner so that covariance ... -
On the Application of Photoacoustic Absorption Spectral Data to the Modeling of Leaf Optical Properties
(University of Waterloo, 2007-04-27)Due to the importance of plants in the Earth's ecosystem, their photobiological responses have become the subject of extensive research in life sciences. Leaf optical models have been developed to assist in the analysis ... -
On the Automatic Coding of Text Answers to Open-ended Questions in Surveys
(University of Waterloo, 2021-01-13)Open-ended questions allow participants to answer survey questions without any constraint. Responses to open-ended questions, however, are more difficult to analyze quantitatively than close-ended questions. In this thesis, ... -
On the Bluish Appearance of Veins
(University of Waterloo, 2018-01-18)The bluish appearance of veins located immediately beneath the skin has long been a topic of interest for biomedical optics researchers. Despite this interest, a thorough identification of the specific optical processes ... -
On the Caching Schemes to Speed Up Program Reduction
(University of Waterloo, 2023-01-05)Program reduction is a highly practical, widely demanded technique to help debug language tools, such as compilers, interpreters and debuggers. Given a program P which exhibits a property ψ, conceptually, program reduction ... -
On The Circuit Diameters of Some Combinatorial Polytopes
(University of Waterloo, 2017-09-20)The combinatorial diameter of a polytope P is the maximum value of a shortest path between two vertices of P, where the path uses the edges of P only. In contrast to the combinatorial diameter, the circuit diameter of P ... -
On the Complexity of Reconfiguration of Clique, Cluster Vertex Deletion, and Dominating Set
(University of Waterloo, 2015-07-15)A graph problem P is a vertex-subset problem if feasible solutions for P consist of subsets of the vertices of a graph G. The st-connectivity problem for a vertex-subset problem P takes as input two feasible solutions ... -
On The Complexity Of The Evaluation Of Transient Extensions Of Boolean Functions
(World Scientific Publishing, 2012-01-01)Transient algebra is a multi-valued algebra for hazard detection in gate circuits. Sequences of alternating 0's and 1's, called transients, represent signal values, and gates are modeled by extensions of boolean functions ... -
On the Control of Active End-nodes in the Smart Grid
(University of Waterloo, 2015-08-11)The electrical grid has substantially changed in recent years due to the integration of several disruptive load and generation technologies into low-voltage distribution networks, which are meant to smarten it and improve ... -
On the Crossing Numbers of Complete Graphs
(University of Waterloo, 2006)In this thesis we prove two main results. The Triangle Conjecture asserts that the convex hull of any optimal rectilinear drawing of <em>K<sub>n</sub></em> must be a triangle (for <em>n</em> ≥ 3). We prove that, ... -
On the Data Quality of Remotely Sensed Forest Maps
(University of Waterloo, 2023-08-10)Accurate forest monitoring data are essential for understanding and conserving forest ecosystems. However, the remoteness of forests and the scarcity of ground truth make it hard to identify data quality issues. We present ... -
On The Density of Binary Matroids Without a Given Minor
(University of Waterloo, 2016-12-21)This thesis is motivated by the following question: how many elements can a simple binary matroid with no $\PG(t,2)$-minor have? This is a natural analogue of questions asked about the density of graphs in minor-closed ...