Now showing items 2173-2192 of 2985

    • Proportionality and Fairness in Voting and Ranking Systems 

      Mehra, Kanav (University of Waterloo, 2023-08-18)
      Fairness through proportionality has received significant attention in recent social choice research, leading to the development of advanced tools, methods, and algorithms aimed at ensuring fairness in democratic institutions. ...
    • Protein De novo Sequencing 

      Wang, Rong (University of Waterloo, 2016-05-13)
      In the proteomic mass spectrometry field, peptide and protein identification can be classified into two categories: database search that relies on existing peptide and protein databases and de novo sequencing with no prior ...
    • Protein Loop Prediction by Fragment Assembly 

      Liu, Zhifeng (University of Waterloo, 2007-01-19)
      If the primary sequence of a protein is known, what is its three-dimensional structure? This is one of the most challenging problems in molecular biology and has many applications in proteomics. During the last three ...
    • Protein Structure Elastic Network Models and the Rank 3 Positive Semidefinite Matrix Manifold 

      Li, Xiao-Bo (University of Waterloo, 2019-01-09)
      This thesis is a contribution to the study of protein dynamics using elastic network models (ENMs). An ENM is an abstraction of a protein structure where inter-atomic interactions are assumed to be modelled by a Hookean ...
    • A protocol for constructing a domain-specific ontology for use in biomedical information extraction using lexical-chaining analysis 

      He, Xiaofen (University of Waterloo, 2007-01-19)
      In order to do more semantics-based information extraction, we require specialized domain models. We develop a hybrid approach for constructing such a domain-specific ontology, which integrates key concepts from the ...
    • The Prouhet-Tarry-Escott problem 

      Caley, Timothy (University of Waterloo, 2013-01-15)
      Given natural numbers n and k, with n>k, the Prouhet-Tarry-Escott (PTE) problem asks for distinct subsets of Z, say X={x_1,...,x_n} and Y={y_1,...,y_n}, such that x_1^i+...+x_n^i=y_1^i+...+y_n^i\] for i=1,...,k. ...
    • Providing Freshness for Cached Data in Unstructured Peer-to-Peer Systems 

      Forsyth, Simon William (University of Waterloo, 2013-04-17)
      Replication is a popular technique for increasing data availability and improving perfor- mance in peer-to-peer systems. Maintaining freshness of replicated data is challenging due to the high cost of update management. ...
    • Proving Properties of Fibonacci Representations via Automata Theory 

      Shan, Sonja Linghui (University of Waterloo, 2024-01-22)
      In this work, we introduce a novel framework for mechanically testing the completeness and unambiguity of Fibonacci-based representations via automata theory. We call a representation (or a number system) complete and ...
    • PRSONA: Private Reputation Supporting Ongoing Network Avatars 

      Gurtler, Stan (University of Waterloo, 2021-12-09)
      Trust and user-generated feedback have become increasingly vital to the normal functioning of the modern internet. However, deployed systems that currently incorporate such feedback do not guarantee users much in the way ...
    • PStorM: Profile Storage and Matching for Feedback-Based Tuning of MapReduce Jobs 

      Ead, Mostafa (University of Waterloo, 2013-01-02)
      The MapReduce programming model has become widely adopted for large scale analytics on big data. MapReduce systems such as Hadoop have many tuning parameters, many of which have a significant impact on performance. The map ...
    • PUPy: A Generalized, Optimistic Context Detection Framework 

      Rafuse, Matthew (University of Waterloo, 2021-04-28)
      In modern life, the usage of smart devices like smartphones and laptops that allow for access to information, communication with friends and colleagues and other indispensable services has become ubiquitous. People have ...
    • Pure Pairs VI. Excluding an Ordered Tree. 

      Scott, Alex; Seymour, Paul; Spirkl, Sophie (Society for Industrial and Applied Mathematics Journal on Discrete Mathematics, 2022-01)
      A pure pair in a graph G is a pair (Z1,Z2) of disjoint sets of vertices such that either every vertex in Z1 is adjacent to every vertex in Z2, or there are no edges between Z1 and Z2. With Maria Chudnovsky, we recently ...
    • Pure pairs. I. Trees and linear anticomplete pairs 

      Chudnovsky, Maria; Scott, Alex; Seymour, Paul; Spirkl, Sophie (Elsevier, 2020-12-02)
      The Erdős-Hajnal conjecture asserts that for every graph H there is a constant c > 0 such that every graph G that does not contain H as an induced subgraph has a clique or stable set of cardinality at least |G|c. In this ...
    • Pure pairs. II. Excluding all subdivisions of a graph 

      Chudnovsky, Maria; Scott, Alex; Seymour, Paul; Spirkl, Sophie (Springer Nature, 2021-06-01)
      We prove for every graph H there exists ɛ > 0 such that, for every graph G with |G|≥2, if no induced subgraph of G is a subdivision of H, then either some vertex of G has at least ɛ|G| neighbours, or there are two disjoint ...
    • Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs 

      Chudnovsky, Maria; Fox, Jacob; Scott, Alex; Seymour, Paul; Spirkl, Sophie (Wiley, 2020-11)
      A graph is H-free if it has no induced subgraph isomorphic to H, and |G| denotes the number of vertices of G. A conjecture of Conlon, Sudakov and the second author asserts that: - For every graph H, there exists ∈ > 0 ...
    • Purely top-down software rebuilding 

      Grosskurth, Alan (University of Waterloo, 2007-01-22)
      Software rebuilding is the process of deriving a deployable software system from its primitive source objects. A build tool helps maintain consistency between the derived objects and source objects by ensuring that all ...
    • A Puzzle-Based Synthesis Algorithm For a Triple Intersection of Schubert Varieties 

      Brown, Andrew Alexander Harold (University of Waterloo, 2010-01-29)
      This thesis develops an algorithm for the Schubert calculus of the Grassmanian. Specifically, we state a puzzle-based, synthesis algorithm for a triple intersection of Schubert varieties. Our algorithm is a reformulation ...
    • q-deformed LQG in three dimensional space-time 

      Pan, Qiaoyin (University of Waterloo, 2022-08-23)
      Loop quantum gravity (LQG) is a canonical, background-independent and non-perturbative approach to quantum gravity. This thesis is devoted to studying three-dimensional (3D) quantum gravity with a non-vanishing cosmological ...
    • Quadratic Hedging with Margin Requirements and Portfolio Constraints 

      Tazhitdinova, Alisa (University of Waterloo, 2010-04-28)
      We consider a mean-variance portfolio optimization problem, namely, a problem of minimizing the variance of the final wealth that results from trading over a fixed finite horizon in a continuous-time complete market in the ...
    • A quadratic programming approach to find faces in robust nonnegative matrix factorization 

      Ananthanarayanan, Sai Mali (University of Waterloo, 2017-08-29)
      Nonnegative matrix factorization (NMF) is a popular dimensionality reduction technique because it is easily interpretable and can discern useful features. For a given matrix M (dimension n x m) whose entries are nonnegative ...


      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