Now showing items 363-382 of 3027

    • CLPush: Proactive Cache Transfers in NUMA Applications 

      Pathak, Gautam (University of Waterloo, 2023-09-26)
      Modern Non-Uniform Memory Access (NUMA) systems support a thread count of as much as 128 threads to support high performance applications. These systems usually employ a scalable cache-coherent directory mechanism to ensure ...
    • Clustering behaviour in networks with time delayed all-to-all coupling 

      Wang, Zhen (University of Waterloo, 2017-08-30)
      Networks of coupled oscillators arise in a variety of areas. Clustering is a type of oscillatory network behavior where elements of a network segregate into groups. Elements within a group oscillate synchronously, while ...
    • Clustering Dependencies over Relational Tables 

      Gao, Yuchen (University of Waterloo, 2016-01-22)
      Integrity constraints have proven to be valuable in the database field. Not only can they help schema design (functional dependencies, FDs [1][2]), they can also be used in query optimization (ordering dependencies, ODs ...
    • Clustering in the Presence of Noise 

      Haghtalab, Nika (University of Waterloo, 2013-08-26)
      Clustering, which is partitioning data into groups of similar objects, has a wide range of applications. In many cases unstructured data makes up a significant part of the input. Attempting to cluster such part of the data, ...
    • Coding Strip: A Tool for Supporting Interplay within Abstraction Ladder for Computational Thinking 

      Suh, Sangho (University of Waterloo, 2022-05-20)
      As technologies advance and play an increasingly larger role in our lives, computational thinking---the ability to understand computing concepts and procedures and their role in the tools we use---has become an important ...
    • Coefficient spaces arising from locally compact groups 

      Tanko, Zsolt (University of Waterloo, 2020-08-17)
      This thesis studies two disjoint topics involving coefficient spaces and algebras associated to locally compact groups. First, Chapter 3 investigates the connection between amenability and compactness conditions on locally ...
    • Coevolution Of Risk Perception, Sexual Behaviour, And Hiv Transmission In An Agent-Based Model 

      Tully, Stephen; Cojocaru, Monica; Bauch, Chris T. (Elsevier, 2013-11-21)
      Risk perception shapes individual behaviour, and is in turn shaped by the consequences of that behaviour. Here we explore this dynamics in the context of human immunodeficiency virus (HIV) spread. We construct a simplified ...
    • Coherent Beta Risk Measures for Capital Requirements 

      Wirch, Julia Lynn (University of Waterloo, 1999)
      This thesis compares insurance premium principles with current financial risk paradigms and uses distorted probabilities, a recent development in premium principle literature, to synthesize the current models for financial ...
    • Coherent delocalization in the light-matter interaction 

      Stritzelberger, Nadine (University of Waterloo, 2020-10-08)
      In this thesis, we study coherent delocalization in the light-matter interaction: we investigate how the coherent center of mass delocalization of a first quantized system affects its interaction with a second quantized ...
    • Coherent Distortion Risk Measures in Portfolio Selection 

      Feng, Ming Bin (University of Waterloo, 2011-08-30)
      The theme of this thesis relates to solving the optimal portfolio selection problems using linear programming. There are two key contributions in this thesis. The first contribution is to generalize the well-known linear ...
    • The Cohomology Ring of a Finite Abelian Group 

      Roberts, Collin (University of Waterloo, 2013-01-25)
      The cohomology ring of a finite cyclic group was explicitly computed by Cartan and Eilenberg in their 1956 book on Homological Algebra. It is surprising that the cohomology ring for the next simplest example, that of a ...
    • Cohort study design for illness-death processes with disease status under intermittent observation 

      Moon, Nathalie C.; Zeng, Leilei; Cook, Richard J. (Taylor & Francis, 2019-12-12)
      Cohort studies are routinely conducted to learn about the incidence or progression rates of chronic diseases. The illness-death model offers a natural framework for joint consideration of non-fatal events in the semi-competing ...
    • A Collapsing Method for Efficient Recovery of Optimal Edges 

      Hu, Mike (University of Waterloo, 2002)
      In this thesis we present a novel algorithm, <I>HyperCleaning*</I>, for effectively inferring phylogenetic trees. The method is based on the quartet method paradigm and is guaranteed to recover the best supported edges ...
    • Collective Dynamics of Large-Scale Spiking Neural Networks by Mean-Field Theory 

      Chen, Liang (University of Waterloo, 2024-05-31)
      The brain contains a large number of neurons, each of which typically has thousands of synaptic connections. Its functionality, whether function or dysfunction, depends on the emergent collective dynamics arising from the ...
    • Collision Finding with Many Classical or Quantum Processors 

      Jeffery, Stacey (University of Waterloo, 2011-08-31)
      In this thesis, we investigate the cost of finding collisions in a black-box function, a problem that is of fundamental importance in cryptanalysis. Inspired by the excellent performance of the heuristic rho method of ...
    • Coloring Algorithms for Graphs and Hypergraphs with Forbidden Substructures 

      Li, Yanjia (University of Waterloo, 2022-04-18)
      This thesis mainly focus on complexity results of the generalized version of the $r$-Coloring Problem, the $r$-Pre-Coloring Extension Problem and the List $r$-Coloring Problem restricted to hypergraphs and ordered graphs ...
    • Colouring Cayley Graphs 

      Chu, Lei (University of Waterloo, 2005)
      We will discuss three ways to bound the chromatic number on a Cayley graph. 1. If the connection set contains information about a smaller graph, then these two graphs are related. Using this information, we will ...
    • Colouring perfect graphs with bounded clique number 

      Chudnovsky, Maria; Lagoutte, Aurélie; Seymour, Paul; Spirkl, Sophie (Elsevier, 2017-01)
      A graph is perfect if the chromatic number of every induced subgraph equals the size of its largest clique, and an algorithm of Grötschel, Lovász, and Schrijver [9] from 1988 finds an optimal colouring of a perfect graph ...
    • Colouring Subspaces 

      Chowdhury, Ameerah (University of Waterloo, 2005)
      This thesis was originally motivated by considering vector space analogues of problems in extremal set theory, but our main results concern colouring a graph that is intimately related to these vector space analogues. ...
    • Combination of Chemotherapy and Antiangiogenic Therapies: A Mathematical Modelling Approach 

      Phipps, Colin (University of Waterloo, 2009-09-08)
      A brief introduction to cancer biology and treatment is presented with a focus on current clinical advances in the delivery of chemotherapy and antiangiogenic therapies. Mathematical oncology is then surveyed with summaries ...

      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