Now showing items 1254-1273 of 1551

    • Sex differences in solute and water handling in the human kidney: Modeling and functional implications 

      Hu, Rui; McDonough, Alicia A.; Layton, Anita T. (Elsevier, 2021-06)
      The kidneys maintain homeostasis by controlling the amount of water and electrolytes in the blood. That function is accomplished by the nephrons, which transform glomerular filtrate into urine by a transport process mediated ...
    • SFour: A Protocol for Cryptographically Secure Record Linkage at Scale 

      Khurram, Muhammad Basit (University of Waterloo, 2019-09-23)
      The prevalence of various (and increasingly large) datasets presents the challenging problem of discovering common entities dispersed across disparate datasets. Solutions to the private record linkage problem (PRL) aim to ...
    • ShallowForest: Optimizing All-to-All Data Transmission in WANs 

      Tan, Hao (University of Waterloo, 2019-05-23)
      All-to-all data transmission is a typical data transmission pattern in both consensus protocols and blockchain systems. Developing an optimization scheme that provides high throughput and low latency data transmission can ...
    • Shape Modeling of Plant Leaves with Unstructured Meshes 

      Hong, Sung Min (University of Waterloo, 2005)
      The plant leaf is one of the most challenging natural objects to be realistically depicted by computer graphics due to its complex morphological and optical characteristics. Although many studies have been done on plant ...
    • Sharing Rewards Based on Subjective Opinions 

      Carvalho, Arthur (University of Waterloo, 2010-08-10)
      Fair division is the problem of dividing one or several goods among a set of agents in a way that satisfies a suitable fairness criterion. Traditionally studied in economics, philosophy, and political science, fair division ...
    • Shortest Path Queries in Very Large Spatial Databases 

      Zhang, Ning (University of Waterloo, 2001)
      Finding the shortest paths in a graph has been studied for a long time, and there are many main memory based algorithms dealing with this problem. Among these, Dijkstra's shortest path algorithm is one of the most commonly ...
    • 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, ...
    • 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 ...
    • 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 ...
    • 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 ...
    • 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 ...
    • 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 ...
    • 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 ...
    • Simultaneous Graph Representation Problems 

      Jampani, Krishnam Raju (University of Waterloo, 2011-02-18)
      Many graphs arising in practice can be represented in a concise and intuitive way that conveys their structure. For example: A planar graph can be represented in the plane with points for vertices and non-crossing curves ...
    • Simultaneously Embedding Planar Graphs at Fixed Vertex Locations 

      Gordon, Taylor (University of Waterloo, 2010-05-18)
      We discuss the problem of embedding planar graphs onto the plane with pre-specified vertex locations. In particular, we introduce a method for constructing such an embedding for both the case where the mapping from the ...
    • Single-Entity-Single-Relation Question Answering with Minimal Annotation 

      Peng, Zhongyu (University of Waterloo, 2016-08-24)
      We present a novel bag-of-words based approach that automatically constructs a semantic parsing based question answering (QA) system tailored to single-entity-single-relation questions. Given a large community QA pair ...
    • Single-pass stratified importance resampling 

      Ciklabakkal, Ege (University of Waterloo, 2022-09-08)
      Simulating the behavior of light to produce realistic images involves evaluation of difficult integrals. Monte Carlo integration is a general method to estimate such integrals and is therefore widely used in physically ...

      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