Now showing items 1600-1619 of 2605

    • On Efficient Semidefinite Relaxations for Quadratically Constrained Quadratic Programming 

      Ding, Yichuan (University of Waterloo, 2007-05-18)
      Two important topics in the study of Quadratically Constrained Quadratic Programming (QCQP) are how to exactly solve a QCQP with few constraints in polynomial time and how to find an inexpensive and strong relaxation bound ...
    • On Enumerative Structures in Quantum Field Theory 

      Mahmoud, Ali (University of Waterloo, 2020-07-13)
      This thesis addresses a number of enumerative problems that arise in the context of quantum field theory and in the process of renormalization. In particular, the enumeration of rooted connected chord diagrams is further ...
    • On estimands arising from misspecified semiparametric rate-based analysis of recurrent episodic conditions 

      Lee, Jooyoung; Cook, Richard J. (Wiley, 2019-11-10)
      Marginal rate-based analyses are widely used for the analysis of recurrent events in clinical trials. In many areas of application, the events are not instantaneous but rather signal the onset of a symptomatic episode ...
    • On Eulerian orientations of even-degree hypercubes 

      Levit, Maxwell; Chandran, L. Sunil; Cheriyan, Joseph (Elsevier, 2018-09-01)
      It is well known that every Eulerian orientation of an Eulerian 2k-edge connected (undirected) graph is strongly k-edge connected. A long-standing goal in the area is to obtain analogous results for other types of connectivity, ...
    • On Excluded Minors for Even Cut Matroids 

      Pivotto, Irene (University of Waterloo, 2007-01-22)
      In this thesis we will present two main theorems that can be used to study minor minimal non even cut matroids. Given any signed graph we can associate an even cut matroid. However, given an even cut matroid, there are ...
    • On Finding Large Cliques when the Chromatic Number is close to the Maximum Degree 

      MacDonald, Colter (University of Waterloo, 2021-12-23)
      We prove that every graph G with chromatic number χ(G) = ∆(G) − 1 and ∆(G) ≥ 66 contains a clique of size ∆(G) − 17. Our proof closely parallels a proof from Cranston and Rabern, who showed that graphs with χ = ∆ and ∆ ≥ ...
    • On Fine-Grained Access Control for XML 

      Zhuo, Donghui (University of Waterloo, 2003)
      Fine-grained access control for XML is about controlling access to XML documents at the granularity of individual elements or attributes. This thesis addresses two problems related to XML access controls. The first is ...
    • On First Passage Time Related Problems for Some Insurance Risk Processes 

      Wang, Zijia (University of Waterloo, 2022-05-13)
      For many decades, the study of ruin theory has long been one of the central topics of interest in insurance risk management. Research in this area has largely focused on analyzing the insurer’s solvency risk, which is ...
    • On fixed points of self maps of the free ball 

      Shamovich, Eli (Elsevier, 2018-07-01)
      In this paper, we study the structure of the fixed point sets of noncommutative self maps of the free ball. We show that for such a map that fixes the origin the fixed point set on every level is the intersection of the ...
    • On Geometric Drawings of Graphs 

      Arroyo Guevara, Alan Marcelo (University of Waterloo, 2018-04-18)
      This thesis is about geometric drawings of graphs and their topological generalizations. First, we study pseudolinear drawings of graphs in the plane. A pseudolinear drawing is one in which every edge can be extended ...
    • On Geometric Range Searching, Approximate Counting and Depth Problems 

      Afshani, Peyman (University of Waterloo, 2008-09-24)
      In this thesis we deal with problems connected to range searching, which is one of the central areas of computational geometry. The dominant problems in this area are halfspace range searching, simplex range searching ...
    • On Hopf Ore Extensions and Zariski Cancellation Problems 

      Huang, Hongdi (University of Waterloo, 2020-04-29)
      In this thesis, we investigate Ore extensions of Hopf algebras and the Zariski Cancellation problem for noncommutative rings. In particular, we improve upon the existing conditions for when $T=R[x; \sigma, \delta]$ is a ...
    • On imprecision in statistical theory 

      Shum, Marco Yan Shing (University of Waterloo, 2022-01-06)
      This thesis provides an exploration of the interplay between imprecise probability and statistics. Mathematically, one may summarise this relationship as how (Bayesian) sensitivity analysis involving a set of (prior) models ...
    • On Improving Distributed Pregel-like Graph Processing Systems 

      Han, Minyang (University of Waterloo, 2015-07-24)
      The considerable interest in distributed systems that can execute algorithms to process large graphs has led to the creation of many graph processing systems. However, existing systems suffer from two major issues: (1) ...
    • On Infinitesimal Inverse Spectral Geometry 

      dos Santos Lobo Brandao, Eduardo (University of Waterloo, 2011-09-27)
      Spectral geometry is the field of mathematics which concerns relationships between geometric structures of manifolds and the spectra of canonical differential operators. Inverse Spectral Geometry in particular concerns ...
    • On Integrating Failure Localization with Survivable Design 

      He, Wei (University of Waterloo, 2013-05-22)
      In this thesis, I proposed a novel framework of all-optical failure restoration which jointly determines network monitoring plane and spare capacity allocation in the presence of either static or dynamic traffic. The ...
    • On moments and related quantities in insurance surplus analysis 

      Lee, Wing Yan (University of Waterloo, 2014-08-15)
      In risk theory, the time to ruin is one of the central quantities. The Laplace transform, density and moments of the time to ruin have been studied by many authors under different risk model assumptions. The Gerber-Shiu ...
    • On multiple random locations of stationary processes 

      Matheson, Daniel (University of Waterloo, 2019-01-18)
      We generalize the concept of intrinsic location functionals to accommodate n=2 random locations, which we combine together in either sets or vectors. For the set-valued case of "intrinsic multiple-location functionals" we ...
    • On Optimizing Traffic Distribution for Clusters of Network Intrusion Detection and Prevention Systems 

      Le, Anh (University of Waterloo, 2008-09-02)
      To address the overload conditions caused by the increasing network traffic volume, recent literature in the network intrusion detection and prevention field has proposed the use of clusters of network intrusion detection ...
    • On Pairing-Based Signature and Aggregate Signature Schemes 

      Knapp, Edward (University of Waterloo, 2009-01-21)
      In 2001, Boneh, Lynn, and Shacham presented a pairing-based signature scheme known as the BLS signature scheme. In 2003, Boneh, Gentry, Lynn, and Shacham presented the first aggregate signature scheme called the BGLS ...

      UWSpace

      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages