Now showing items 1742-1761 of 2993

    • Negative Quasi-Probability in the Context of Quantum Computation 

      Veitch, Victor (University of Waterloo, 2013-08-09)
      This thesis deals with the question of what resources are necessary and sufficient for quantum computational speedup. In particular, we study what resources are required to promote fault tolerant stabilizer computation to ...
    • Nested pessimistic transactions for both atomicity and synchronization in concurrent software 

      Chammah, Tarek (University of Waterloo, 2011-10-04)
      Existing atomic section interface proposals, thus far, have tended to only isolate transactions from each other. Less considered is the coordination of threads performing transactions with respect to one another. Synchronization ...
    • Network Bargaining: Creating Stability Using Blocking Sets 

      Steiner, David (University of Waterloo, 2012-01-20)
      Bargaining theory seeks to answer the question of how to divide a jointly generated surplus between multiple agents. John Nash proposed the Nash Bargaining Solution to answer this question for the special case of two agents. ...
    • Network centrality analysis of eye-gaze data in autism spectrum disorder 

      Sadria, Mehrshad; Karimi, Soroush; Layton, Anita T. (Elsevier, 2019-08)
      Individuals suffering from autism spectrum disorder (ASD) exhibit impaired social communication, the manifestations of which include abnormal eye contact and gaze. In this study, we first seek to characterize the spatial ...
    • A Network Integrated Design for Micro-scale Cloud Services 

      Abdel-hadi, Ashraf (University of Waterloo, 2022-05-25)
      We present Falcon, network-integrated scheduler for micro-scale services. Falcon follows a centralized scheduler design to achieve high scheduling efficiency and leverages modern programmable switches to lower the scheduling ...
    • Network Performance Improvements for Low-Latency Anonymity Networks 

      Al-Sabah, Mashael (University of Waterloo, 2013-04-22)
      While advances to the Internet have enabled users to easily interact and exchange information online, they have also created several opportunities for adversaries to prey on users’ private information. Whether the motivation ...
    • Network-Accelerated Linearizable Reads 

      Takruri, Hatem (University of Waterloo, 2019-08-07)
      This thesis present FLAIR, a novel approach for accelerating read operations in leader-based consensus protocols. FLAIR leverages the capabilities of the new generation of programmable switches to serve reads from follower ...
    • Network-accelerated Scheduling for Large Clusters 

      Kettaneh, Ibrahim (University of Waterloo, 2020-05-04)
      We explore a novel design approach for accelerating schedulers for large scale clusters. Our approach follows a centralized design and leverages the programmability of recent programmable switches to accelerating scheduling ...
    • NeuRA: Using Neural Networks to Improve WiFi Rate Adaptation 

      Khastoo, Shervin (University of Waterloo, 2020-09-04)
      Although a variety of rate adaptation algorithms have been proposed for 802.11 devices, sampling-based algorithms are preferred and used in practice because they only require frame loss information which is available on ...
    • A neural modelling approach to investigating general intelligence 

      Rasmussen, Daniel (University of Waterloo, 2010-08-06)
      One of the most well-respected and widely used tools in the study of general intelligence is the Raven's Progressive Matrices test, a nonverbal task wherein subjects must induce the rules that govern the patterns in an ...
    • Neural Text Generation from Structured and Unstructured Data 

      Shahidi, Hamidreza (University of Waterloo, 2019-08-28)
      A number of researchers have recently questioned the necessity of increasingly complex neural network (NN) architectures. In particular, several recent papers have shown that simpler, properly tuned models are at least ...
    • Nevanlinna-Pick Spaces and Dilations 

      Hartz, Michael Peter (University of Waterloo, 2016-07-12)
      The majority of this thesis is devoted to the study of Nevanlinna-Pick spaces and their multiplier algebras. These spaces are Hilbert function spaces in which a version of the Nevanlinna-Pick interpolation theorem from ...
    • New Convex Relaxations for the Maximum Cut and VLSI Layout Problems 

      Ferreira Fialho dos Anjos, Miguel Nuno (University of Waterloo, 2001)
      It is well known that many of the optimization problems which arise in applications are <I>hard</I>, which usually means that they are NP-hard. Hence much research has been devoted to finding <I>good</I> relaxations for ...
    • A New Addressing and Forwarding Architecture for the Internet 

      Guo, Cong (University of Waterloo, 2011-10-03)
      The current Internet routing and addressing architecture is facing a serious scalability problem. The default free zone (DFZ) routing table size grows at an increasing and potentially alarming rate. The Internet architecture ...
    • New Algorithms for Predicting Conformational Polymorphism and Inferring Direct Couplings for Side Chains of Proteins 

      Soltan Ghoraie, Laleh (University of Waterloo, 2015-08-20)
      Protein crystals populate diverse conformational ensembles. Despite much evidence that there is widespread conformational polymorphism in protein side chains, most of the xray crystallography data are modelled by single ...
    • New Approaches to Protein NMR Automation 

      Alipanahi Ramandi, Babak (University of Waterloo, 2011-11-16)
      The three-dimensional structure of a protein molecule is the key to understanding its biological and physiological properties. A major problem in bioinformatics is to efficiently determine the three-dimensional structures ...
    • New Approaches to Protein Structure Prediction 

      Li, Shuai Cheng (University of Waterloo, 2009-11-06)
      Protein structure prediction is concerned with the prediction of a protein's three dimensional structure from its amino acid sequence. Such predictions are commonly performed by searching the possible structures and ...
    • A New Class of Cycle Inequality for the Time-Dependent Traveling Salesman Problem 

      White, John Lincoln (University of Waterloo, 2010-09-29)
      The Time-Dependent Traveling Salesman Problem is a generalization of the well-known Traveling Salesman Problem, where the cost for travel between two nodes is dependent on the nodes and their position in the tour. Inequalities ...
    • New Design and Analysis Techniques for Post-Quantum Cryptography 

      Eaton, Edward (University of Waterloo, 2022-09-16)
      Due to the threat of scalable quantum computation breaking existing public-key cryptography, interest in post-quantum cryptography has exploded in the past decade. There are two key aspects to the mitigation of the quantum ...
    • A new framework for clustering 

      Zhou, Wu (University of Waterloo, 2010-04-07)
      The difficulty of clustering and the variety of clustering methods suggest the need for a theoretical study of clustering. Using the idea of a standard statistical framework, we propose a new framework for clustering. ...

      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