Now showing items 2493-2512 of 3012

    • Shortest Paths in Geometric Intersection Graphs 

      Skrepetos, Dimitrios (University of Waterloo, 2018-06-29)
      This thesis studies shortest paths in geometric intersection graphs, which can model, among others, ad-hoc communication and transportation networks. First, we consider two classical problems in the field of algorithms, ...
    • Sidon and Kronecker-like sets in compact abelian groups 

      Yang, Xu (University of Waterloo, 2019-06-07)
      Let $G$ be a compact abelian group and $\Ga$ be its discrete dual group. In this thesis we study various types of interpolation sets. A subset $E \subset \Ga$ is Sidon if every bounded function on $E$ can be interpolated ...
    • Sieve estimation in a Markov illness-death process under dual censoring 

      Cook, Richard J.; Boruvka, Audrey (Oxford Journals, 2016-02-29)
      Semiparametric methods are well-established for the analysis of a progressive Markov illness-death process observed up to a noninformative right censoring time. However often the intermediate and terminal events are ...
    • Sift: Achieving Resource-Efficient Consensus with RDMA 

      Kazhamiaka, Mikhail (University of Waterloo, 2019-04-30)
      Sift is a new consensus protocol for replicating state machines. It disaggregates CPU and memory consumption by creating a novel system architecture enabled by one-sided RDMA operations. We show that this system architecture ...
    • The Sigma-Delta Modulator as a Chaotic Nonlinear Dynamical System 

      Campbell, Donald O. (University of Waterloo, 2007-01-23)
      The sigma-delta modulator is a popular signal amplitude quantization error (or noise) shaper used in oversampling analogue-to-digital and digital-to-analogue converter systems. The shaping of the noise frequency spectrum ...
    • Signature Schemes in the Quantum Random-Oracle Model 

      Eaton, Edward (University of Waterloo, 2017-04-25)
      A signature scheme is a fundamental component in modern digital communication. It allows for authenticated messages, without which it would be nearly impossible to ensure security when using most modern technologies. ...
    • Significant Feature Clustering 

      Whissell, John (University of Waterloo, 2006)
      In this thesis, we present a new clustering algorithm we call <em>Significance Feature Clustering</em>, which is designed to cluster text documents. Its central premise is the mapping of raw frequency count vectors ...
    • Signing with Codes 

      Masárová, Zuzana (University of Waterloo, 2014-01-22)
      Code-based cryptography is an area of classical cryptography in which cryptographic primitives rely on hard problems and trapdoor functions related to linear error-correcting codes. Since its inception in 1978, the area ...
    • Signorini conditions for inviscid fluids 

      Gu, Yu (University of Waterloo, 2021-06-28)
      In this thesis, we present a new type of boundary condition for the simulation of inviscid fluids – the Signorini boundary condition. The new condition models the non-sticky contact of a fluid with other fluids or solids. ...
    • Similarity and Diversity in Information Retrieval 

      Akinyemi, John (University of Waterloo, 2012-04-30)
      Inter-document similarity is used for clustering, classification, and other purposes within information retrieval. In this thesis, we investigate several aspects of document similarity. In particular, we investigate the ...
    • Simple Convolutional Neural Networks with Linguistically-Annotated Input for Answer Selection in Question Answering 

      Sequiera, Royal (University of Waterloo, 2018-08-10)
      With the advent of deep learning methods, researchers have been increasingly preferring deep learning methods over decades-old feature-engineering-inspired work in Natural Language Processing (NLP). The research community ...
    • Simple Drawings of Kn from Rotation Systems 

      Sullivan, Matthew A. (University of Waterloo, 2021-10-06)
      A complete rotation system on n vertices is a collection of n cyclic permutations of the elements [n]\{i}, for i∈[n]. If D is a drawing of a labelled graph, then a rotation at vertex v is the cyclic ordering of the edges ...
    • A simple finite volume method for adaptive viscous liquids 

      Batty, Christopher; Houston, Ben (Association for Computing Machinery, 2011-08)
      We present the first spatially adaptive Eulerian fluid animation method to support challenging viscous liquid effects such as folding, coiling, and variable viscosity. We propose a tetrahedral node-based embedded finite ...
    • Simple Termination Criteria for Stochastic Gradient Descent Algorithm 

      Baghal, Sina (University of Waterloo, 2021-04-09)
      Stochastic gradient descent (SGD) algorithm is widely used in modern mathematical optimization. Because of its scalability and ease of implementation, SGD is usually preferred to other methods including the gradient descent ...
    • Simple Yet Effective Pseudo Relevance Feedback with Rocchio’s Technique and Text Classification 

      Liu, Yuqi (University of Waterloo, 2022-08-22)
      With the continuous growth of the Internet and the availability of large-scale collections, assisting users in locating the information they need becomes a necessity. Generally, an information retrieval system will process ...
    • A Simplified Method for Hedging Jump Diffusions 

      Xiao, Wenjie (University of Waterloo, 2010-12-23)
      Geometric Brownian Motion (GBM) and has been widely used in the Black Scholes option-pricing framework to model the return of assets. However, many empirical investigations show that market returns have higher peaks and ...
    • Simulated Overloading using Generic Functions in Scheme 

      Cox, Anthony (University of Waterloo, 1997)
      This thesis investigates extending the dynamically-typed, functional programming language Scheme, with simulated overloading in order to permit the binding of multiple, distributed defnitions to function names. Overloading ...
    • Simulating lake dynamics: the effects of bathymetry and bottom drag 

      Baglaenko, Anton (University of Waterloo, 2011-10-31)
      This work seeks, through numerical simulations as well as analysis, to derive from relatively simple models an intuitive understanding of the dynamics and behaviour of flow in lakes near the bottom boundary. The main body ...
    • Simulating Wintertime Lake Dynamics Using the MITgcm Ice Model 

      Walsh, Sarah (University of Waterloo, 2020-09-23)
      Lake Erie is an important source of drinking water, a location for recreational activities and a haven for unique ecosystems (e.g. Point Pelee). Recent research has suggested that some wintertime processes are significantly ...
    • Simulation of the Ferrofluid Interface 

      Honke, Michael (University of Waterloo, 2020-05-14)
      Ferrofluids were initially invented as an additive for rocket fuels. The commercial applications of ferrofluids have since expanded, and have become popularized as desktop toys as well as an art form. Since 1987, ferrofluid ...

      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