Now showing items 238-257 of 2486

    • Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem 

      Yoshida, Kayo (University of Waterloo, 2009-01-22)
      The Boneh-Boyen signature scheme is a short signature scheme which is provably secure in the standard model under the q-Strong Diffie-Hellman (SDH) assumption. The primary objective of this thesis is to examine the ...
    • BotChase: Graph-Based Bot Detection Using Machine Learning 

      Abou Daya, Abbas (University of Waterloo, 2019-05-21)
      Bot detection using machine learning (ML), with network flow-level features, has been extensively studied in the literature. However, existing flow-based approaches typically incur a high computational overhead and do not ...
    • Bounded Control of the Kuramoto-Sivashinsky equation 

      Al Jamal, Rasha (University of Waterloo, 2013-10-25)
      Feedback control is used in almost every aspect of modern life and is essential in almost all engineering systems. Since no mathematical model is perfect and disturbances occur frequently, feedback is required. The design ...
    • Bounded Rationality Alters The Dynamics Of Paediatric Immunization Acceptance 

      Oraby, Tamer; Bauch, Chris T. (Nature Publishing Group, 2015-06-02)
      Interactions between disease dynamics and vaccinating behavior have been explored in many coupled behavior-disease models. Cognitive effects such as risk perception, framing, and subjective probabilities of adverse events ...
    • Bounds on Aggregate Assets 

      Jiang, Xiao (University of Waterloo, 2014-01-23)
      Aggregating financial assets together to form a portfolio, commonly referred to as "asset pooling", is a standard practice in the banking and insurance industries. Determining a suitable probability distribution for this ...
    • Bounds on Maximum Matchings in 1-Planar Graphs 

      Wittnebel, John (University of Waterloo, 2019-01-29)
      In this thesis, we study lower bounds on maximum matchings in 1-planar graphs. We expand upon the tools used for proofs of matching bounds in other classes of graphs as well as some original ideas in order to find these ...
    • Branched Covering Constructions and the Symplectic Geography Problem 

      Hughes, Mark Clifford (University of Waterloo, 2008-08-15)
      We apply branched covering techniques to construct minimal simply-connected symplectic 4-manifolds with small χ_h values. We also use these constructions to provide an alternate proof that for each s ≥ 0, there exists a ...
    • Brick Generation and Conformal Subgraphs 

      Kothari, Nishad (University of Waterloo, 2016-04-15)
      A nontrivial connected graph is matching covered if each of its edges lies in a perfect matching. Two types of decompositions of matching covered graphs, namely ear decompositions and tight cut decompositions, have played ...
    • BridgeSPA: A Single Packet Authorization System for Tor Bridges 

      Smits, Rob (University of Waterloo, 2012-01-10)
      Tor is a network designed for low-latency anonymous communications. Tor clients form circuits through relays that are listed in a public directory, and then relay their encrypted traffic through these circuits. This ...
    • Bridging Technical Spaces: Model Translation from TA to XMI and Back Again 

      Hildebrand, Kristina (University of Waterloo, 2006)
      There are many different techniques and notations for extracting architecturally interesting information from the source code of existing software systems. This process is known as reverse engineering. One current ...
    • Brownian Dynamics Simulation of Dusty Plasma: Comparison with Generalized Hydrodynamics 

      Upadhyaya, Nitin (University of Waterloo, 2010-04-14)
      Brownian dynamics (BD) simulation method has been widely used for studying problems in dispersed systems, such as polymer solutions, colloidal suspensions and more recently, complex (dusty) plasmas. The main problem addressed ...
    • BSML-mbeddr: Integrating Semantically Congurable State-Machine Models in a C Programming Environment 

      Luo, Zhaoyi; Atlee, Joanne M. (ACM, 2016-11)
      In model-driven engineering, developers express their solutions in domain-specific modelling languages (DSLs) that support domain-specific abstractions. Big-Step Modelling Languages (BSML) is a family of extended state-machine ...
    • Budget-Constrained Optimal Insurance with an Upper Limit on the Insurer's Exposure 

      Coke, Oma (University of Waterloo, 2021-01-13)
      This thesis studies the problem of budget-constrained optimal insurance indemnification when the insurer imposes an upper limit on disbursement. In balancing the trade-off between the cost of paying the insurance premium ...
    • Budget-constrained optimal insurance without the nonnegativity constraint on indemnities 

      Ghossoub, Mario (Elsevier, 2019-01)
      In a problem of Pareto-efficient insurance contracting (bilateral risk sharing) with expected-utility preferences, Gollier (1987) relaxes the nonnegativity constraint on indemnities and argues that the existence of a ...
    • Building a Better Tor Experimentation Platform from the Magic of Dynamic ELFs 

      Tracey, Justin (University of Waterloo, 2017-10-30)
      Tor is the most popular tool for providing online anonymity. It is used by journalists, activists, and privacy-conscious individuals to provide low-latency private access to the Internet. However, Tor’s specific design and ...
    • Building a Framework for High-performance In-memory Message-Oriented Middleware 

      Hoang, Huy (University of Waterloo, 2019-11-28)
      Message-Oriented Middleware (MOM) is a popular class of software used in many distributed applications, ranging from business systems and social networks to gaming and streaming media services. As workloads continue to ...
    • Building a larger class of graphs for efficient reconfiguration of vertex colouring 

      Merkel, Owen (University of Waterloo, 2020-05-13)
      A $k$-colouring of a graph $G$ is an assignment of at most $k$ colours to the vertices of $G$ so that adjacent vertices are assigned different colours. The reconfiguration graph of the $k$-colourings, $\mathcal{R}_k(G)$, ...
    • Building Efficient Software to Support Content Delivery Services 

      Cassell, Benjamin (University of Waterloo, 2019-08-28)
      Many content delivery services use key components such as web servers, databases, and key-value stores to serve content over the Internet. These services, and their component systems, face unique modern challenges. Services ...
    • Building Networks in the Face of Uncertainty 

      Gupta, Shubham (University of Waterloo, 2011-08-26)
      The subject of this thesis is to study approximation algorithms for some network design problems in face of uncertainty. We consider two widely studied models of handling uncertainties - Robust Optimization and Stochastic ...
    • Bulk Scattering Approximations for Collimated Light Transmitted through Paper 

      Chen, Tenn Francis (University of Waterloo, 2009-01-21)
      Paper is a complex fibrous material whose production involves substantial amounts of natural and industrial resources. To reduce its manufacturing costs, the pulp and paper industry often employs optical technology such ...

      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