Now showing items 2186-2205 of 3013

    • Promoting Honesty in Electronic Marketplaces: Combining Trust Modeling and Incentive Mechanism Design 

      Zhang, Jie (University of Waterloo, 2009-05-14)
      This thesis work is in the area of modeling trust in multi-agent systems, systems of software agents designed to act on behalf of users (buyers and sellers), in applications such as e-commerce. The focus is on developing ...
    • Prompt-tuning in Controlled Dialogue Generation 

      Liu, Runcheng (University of Waterloo, 2022-12-22)
      Recent years have witnessed a prosperous development of dialogue response generation since the advent of Transformer. Fine-tuning pretrained language models for different downstream tasks has become the dominant paradigm ...
    • Proof of the Kalai-Meshulam conjecture 

      Chudnovsky, Maria; Scott, Alex; Seymour, Paul; Spirkl, Sophie (Springer Nature, 2020-07-01)
      Let G be a graph, and let fG be the sum of (−1)∣A∣, over all stable sets A. If G is a cycle with length divisible by three, then fG = ±2. Motivated by topological considerations, G. Kalai and R. Meshulam [8] made the ...
    • ProofFrog: A Tool For Verifying Game-Hopping Proofs 

      Evans, Ross (University of Waterloo, 2024-04-15)
      Cryptographic proofs allow researchers to provide theoretical guarantees on the security that their constructions provide. A proof of security can completely eliminate a class of attacks by potential adversaries. Human ...
    • Properties of difference inclusions with computable reachable set 

      Fitzsimmons, Maxwell (University of Waterloo, 2023-12-13)
      Dynamical systems have important applications in science and engineering. For example, if a dynamical system describes the motion of a drone, it is important to know if the drone can reach a desired location; the dual ...
    • Properties of graphs with large girth 

      Hoppen, Carlos (University of Waterloo, 2008-01-24)
      This thesis is devoted to the analysis of a class of iterative probabilistic algorithms in regular graphs, called locally greedy algorithms, which will provide bounds for graph functions in regular graphs with ...
    • Properties of random graphs 

      Kemkes, Graeme (University of Waterloo, 2008-09-23)
      The thesis describes new results for several problems in random graph theory. The first problem relates to the uniform random graph model in the supercritical phase; i.e. a graph, uniformly distributed, on $n$ vertices and ...
    • Properties of Stable Matchings 

      Szestopalow, Michael Jay (University of Waterloo, 2010-12-17)
      Stable matchings were introduced in 1962 by David Gale and Lloyd Shapley to study the college admissions problem. The seminal work of Gale and Shapley has motivated hundreds of research papers and found applications in ...
    • Properties of Two-Dimensional Words 

      Smith, Taylor (University of Waterloo, 2017-04-21)
      Combinatorics on words in one dimension is a well-studied subfield of theoretical computer science with its origins in the early 20th century. However, the closely-related study of two-dimensional words is not as popular, ...
    • 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 ...

      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