Now showing items 995-1014 of 1567

    • Online Monitoring of Distributed Systems Using Causal Event Patterns 

      Pramanik, Sukanta (University of Waterloo, 2014-08-11)
      Event monitoring and logging, that is, recording the communication events between processes, is a critical component in many highly reliable distributed systems. The event logs enable the identification of certain ...
    • Online Trace Reordering for Efficient Representation of Event Partial Orders 

      Sheikh, Muhammad Bilal (University of Waterloo, 2012-01-20)
      Distributed and parallel applications not only have distributed state but are often inherently non-deterministic, making them significantly more challenging to monitor and debug. Additionally, a significant challenge ...
    • OOMatch: Pattern Matching as Dispatch in Java 

      Richard, Adam (University of Waterloo, 2007-09-11)
      We present a new language feature, specified as an extension to Java. The feature is a form of dispatch, which includes and subsumes multimethods, but which is not as powerful as general predicate dispatch. It is, however, ...
    • Open Source Software Evolution and Its Dynamics 

      Wu, Jingwei (University of Waterloo, 2006)
      This thesis undertakes an empirical study of software evolution by analyzing open source software (OSS) systems. The main purpose is to aid in understanding OSS evolution. The work centers on collecting large quantities ...
    • OpenBSD Hardware Sensors — Environmental Monitoring and Fan Control 

      Murenin, Constantine Aleksandrovich (University of Waterloo, 2010-05-21)
      This thesis discusses the motivation, origin, history, design guidelines, API, the device drivers and userland utilities of the hardware sensors framework available in OpenBSD. The framework spans multiple utilities in ...
    • Optimal Path Queries in Very Large Spatial Databases 

      Zhang, Jie (University of Waterloo, 2005)
      Researchers have been investigating the optimal route query problem for a long time. Optimal route queries are categorized as either unconstrained or constrained queries. Many main memory based algorithms have been ...
    • Optimal Path-Decomposition of Tries 

      Daigle, Alexandre (University of Waterloo, 2016-05-16)
      In this thesis, we consider the path-decomposition representation of prefix trees. We show that given query probabilities for every word in the prefix tree, the heavy-path strategy produces the optimal trie with respect ...
    • Optimal Portfolio Execution Strategies: Uncertainty and Robustness 

      Moazeni, Somayeh (University of Waterloo, 2011-10-28)
      Optimal investment decisions often rely on assumptions about the models and their associated parameter values. Therefore, it is essential to assess suitability of these assumptions and to understand sensitivity of outcomes ...
    • Optimal Portfolio Selection Under the Estimation Risk in Mean Return 

      Zhu, Lei (University of Waterloo, 2008-01-17)
      This thesis investigates robust techniques for mean-variance (MV) portfolio optimization problems under the estimation risk in mean return. We evaluate the performance of the optimal portfolios generated by the min-max ...
    • Optimal Success Bounds for Single Query Quantum Algorithms Computing the General SUM Problem 

      Valtchev, Alexander (University of Waterloo, 2015-05-27)
      In this thesis the problem of computing the sum of a string of arbitrary finite length drawn from an arbitrary finite alphabet is treated. The resource considered is the number of queries to some oracle which hides the ...
    • Optimization for Image Segmentation 

      Tang, Meng (University of Waterloo, 2019-06-26)
      Image segmentation, i.e., assigning each pixel a discrete label, is an essential task in computer vision with lots of applications. Major techniques for segmentation include for example Markov Random Field (MRF), Kernel ...
    • Optimization Methods for Semi-Supervised Learning 

      Cheung, Edward (University of Waterloo, 2018-05-17)
      The goal of this thesis is to provide efficient optimization algorithms for some semi-supervised learning (SSL) tasks in machine learning. For many machine learning tasks, training a classifier requires a large amount of ...
    • Optimizing Differential Computation for Large-Scale Graph Processing 

      Sahu, Siddhartha (University of Waterloo, 2024-04-01)
      Diverse applications spanning areas such as fraud detection, risk assessment, recommendations, and telecommunications process datasets characterized by entities and their relationships. Graphs naturally emerge as the most ...
    • Optimizing Hierarchical Storage Management For Database System 

      Liu, Xin (University of Waterloo, 2014-06-17)
      Caching is a classical but effective way to improve system performance. To improve system performance, servers, such as database servers and storage servers, contain significant amounts of memory that act as a fast ...
    • Optimizing MPI Collective Operations for Cloud Deployments 

      AlSader, Zuhair (University of Waterloo, 2020-01-24)
      Cloud infrastructures are increasingly being adopted as a platform for high performance computing (HPC) science and engineering applications. For HPC applications, the Message-Passing Interface (MPI) is widely-used. Among ...
    • Option Pricing under Regime Switching (Analytical, PDE, and FFT Methods) 

      Akhavein Sohrabi, Mohammad Yousef (University of Waterloo, 2011-05-19)
      Although globally used in option pricing, the Black-Scholes model has not been able to reflect the evolution of stocks in the real world. A regime-switching model which allows jumps in the underlying asset prices and the ...
    • An Ordered Bag Semantics for SQL 

      Chinaei, Hamid R. (University of Waterloo, 2007-05-22)
      Semantic query optimization is an important issue in many contexts of databases including information integration, view maintenance and data warehousing and can substantially improve performance, especially in today's ...
    • Ordered Interval Routing Schemes 

      Ahmed, Mustaq (University of Waterloo, 2004)
      An <i>Interval Routing Scheme (IRS)</i> represents the routing tables in a network in a space-efficient way by labeling each vertex with an unique integer address and the outgoing edges at each vertex with disjoint ...
    • Ordering, Indexing, and Searching Semantic Data: A Terminology Aware Index Structure 

      Pound, Jeffrey (University of Waterloo, 2008-05-16)
      Indexing data for efficient search capabilities is a core problem in many domains of computer science. As applications centered around semantic data sources become more common, the need for more sophisticated indexing ...
    • The Ordinal Serial Encoding Model: Serial Memory in Spiking Neurons 

      Choo, Feng-Xuan (University of Waterloo, 2010-08-26)
      In a world dominated by temporal order, memory capable of processing, encoding and subsequently recalling ordered information is very important. Over the decades this memory, known as serial memory, has been extensively ...

      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