Now showing items 1674-1693 of 2745

    • The O'Nan-Scott Theorem for Finite Primitive Permutation Groups, and Finite Representability 

      Fawcett, Joanna (University of Waterloo, 2009-08-06)
      The O'Nan-Scott Theorem classifies finite primitive permutation groups into one of five isomorphism classes. This theorem is very useful for answering questions about finite permutation groups since four out of the five ...
    • Obedience-based Multi-Agent Cooperation for Sequential Social Dilemmas 

      Gupta, Gaurav (University of Waterloo, 2020-05-14)
      We propose a mechanism for achieving cooperation and communication in Multi-Agent Reinforcement Learning (MARL) settings by intrinsically rewarding agents for obeying the commands of other agents. At every timestep, agents ...

      Marcoux, Laurent W.; Radjavi, Heydar; Zhang, Yuanhang (Elsevier, 2020-12-15)
      Let n ∈ N, and consider Cn equipped with the standard inner product. Let A ⊆ L(Cn) be a unital algebra and P ∈ L(Cn) be an orthogonal projection. The space L := P ⊥A|ran P is said to be an off-diagonal corner of A, and L ...
    • Offset Surface Light Fields 

      Ang, Jason (University of Waterloo, 2003)
      For producing realistic images, reflection is an important visual effect. Reflections of the environment are important not only for highly reflective objects, such as mirrors, but also for more common objects such as ...
    • On 2-crossing-critical graphs with a V8-minor 

      Arroyo Guevara, Alan Marcelo (University of Waterloo, 2014-05-22)
      The crossing number of a graph is the minimum number of pairwise edge crossings in a drawing of a graph. A graph $G$ is $k$-crossing-critical if it has crossing number at least $k$, and any subgraph of $G$ has crossing ...
    • On a 2-class polling model with reneging and ki -limited service 

      Granville, Kevin; Drekic, Steve (Springer, 2018-06-18)
      This paper analyzes a 2-class, single-server polling model operating under a ki-limited service discipline with class-dependent switchover times. Arrivals to each class are assumed to follow a Poisson process with phase-type ...
    • On a general mixed priority queue with server discretion 

      Fajardo, Val Andrei; Drekic, Steve (Taylor & Francis, 2016-10-01)
      We consider a single-server queueing system which attends to N priority classes that are classified into two distinct types: (i) urgent: classes which have preemptive resume priority over at least one lower priority class, ...
    • On a Question of Wintner Concerning the Sequence of Integers Composed of Primes from a Given Set 

      Kim, Jeongsoo (University of Waterloo, 2007-09-27)
      We answer to a Wintner's question concerning the sequence of integers composed of primes from a given set. The results generalize and develop the answer to Wintner’s question due to Tijdeman.
    • On Achieving High Survivability in Virtualized Data Centers 

      Rabbani, Md Golam; Zhani, Mohamed Faten; Boutaba, Raouf (Institute of Electronics, Information and Communication Engineers, 2014-01-01)
      As businesses are increasingly relying on the cloud to host their services, cloud providers are striving to offer guaranteed and highly-available resources. To achieve this goal, recent proposals have advocated to offer ...
    • On Aharoni’s rainbow generalization of the Caccetta–Häggkvist conjecture 

      Hompe, Patrick; Pelikánová, Petra; Pokorná, Aneta; Spirkl, Sophie (Elsevier, 2021-05-01)
      For a digraph G and v is an element of V(G), let delta(+)(v) be the number of out-neighbors of v in G. The Caccetta-Haggkvist conjecture states that for all k >= 1, if G is a digraph with n = |V(G)| such that delta(+)(v) ...
    • On Algorithms, Separability and Cellular Automata in Quantum Computing 

      Cheung, Donny (University of Waterloo, 2007-09-26)
      In Part I of this thesis, we present a new model of quantum cellular automata (QCA) based on local unitary operations. We will describe a set of desirable properties for any QCA model, and show that all of these properties ...
    • On Amenability Properties and Coideals of Quantum Groups 

      Anderson-Sackaney, Benjamin (University of Waterloo, 2022-07-27)
      We study amenability type properties of locally compact quantum groups and subobjects of quantum groups realized as submodules of their von Neumann algebras. An important class of such subobjects are the coideals, which ...
    • On Asynchronous Interference Channels 

      Moshksar, Kamyar (University of Waterloo, 2016-11-15)
      In the first part of the thesis, a decentralized wireless network of separate transmitter-receiver pairs is studied where there is no central controller to assign the resources to the users and users do not explicitly ...
    • On Combinatorics, Integrability and Puzzles 

      Miller, Timothy (University of Waterloo, 2020-10-23)
      In the last decade, many old and new results in combinatorics have been shown using the theory of quantum integrable systems from particle physics. The key to solving such problems is the derivation of an underlying ...
    • On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures 

      Lee, Patrick (University of Waterloo, 2014-09-11)
      Many standard problems in computational geometry have been solved asymptotically optimally as far as comparison-based algorithms are concerned, but there has been little work focusing on improving the constant factors ...
    • On Convolution Squares of Singular Measures 

      Chan, Vincent (University of Waterloo, 2010-08-25)
      We prove that if $1 > \alpha > 1/2$, then there exists a probability measure $\mu$ such that the Hausdorff dimension of its support is $\alpha$ and $\mu*\mu$ is a Lipschitz function of class $\alpha-1/2$.
    • On Decoupling Concurrency Control from Recovery in Database Repositories 

      Yu, Heng (University of Waterloo, 2005)
      We report on initial research on the concurrency control issue of compiled database applications. Such applications have a repository style of architecture in which a collection of software modules operate on a common ...
    • On Design and Evaluation of High-Recall Retrieval Systems for Electronic Discovery 

      Roegiest, Adam (University of Waterloo, 2017-03-08)
      High-recall retrieval is an information retrieval task model where the goal is to identify, for human consumption, all, or as many as practicable, documents relevant to a particular information need. This thesis ...
    • On Diagonal Acts of Monoids 

      Gilmour, Andrew James (University of Waterloo, 2007-08-30)
      In this paper we discuss what is known so far about diagonal acts of monoids. The first results that will be discussed comprise an overview of some work done on determining whether or not the diagonal act can be finitely ...
    • 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 ...


      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