Now showing items 865-884 of 1561

    • The Moderation of Contentious Content on Twitter 

      Hu, Wei (University of Waterloo, 2023-08-28)
      Retweeting posts is Twitter's most important feature, playing a vital role in enabling the platform to be a virtual town hall that fosters timely discussions. This attribute has been instrumental in drawing a younger, ...
    • A modular notation for monitoring network systems 

      Raghav, Prashant (University of Waterloo, 2015-07-15)
      Design of next generation network systems with predictable behavior in all situations poses a significant challenge. Monitoring of events happening at different points in a distributed environment can detect the occurrence ...
    • Monitoring and Enforcement of Safety Hyperproperties 

      Agrawal, Shreya (University of Waterloo, 2015-10-30)
      Certain important security policies such as information flow characterize system-wide behaviors and are not properties of individual executions. It is known that such security policies cannot be expressed in trace-based ...
    • Monoids and the State Complexity of the Operation root(<i>L</i>) 

      Krawetz, Bryan (University of Waterloo, 2004)
      In this thesis, we cover the general topic of state complexity. In particular, we examine the bounds on the state complexity of some different representations of regular languages. As well, we consider the state ...
    • Monolith: a monolithic pressure-viscosity-contact solver for strong two-way rigid-rigid rigid-fluid coupling 

      Takahashi, Tetsuya; Batty, Christopher (Association for Computing Machinery, 2020-11)
      We propose Monolith, a monolithic pressure-viscosity-contact solver for more accurately, robustly, and efficiently simulating non-trivial two-way interactions of rigid bodies with inviscid, viscous, or non-Newtonian liquids. ...
    • Monotone Numerical Methods for Nonlinear Systems and Second Order Partial Differential Equations 

      Amarala, Swathi (University of Waterloo, 2015-07-28)
      Multigrid methods are numerical solvers for partial differential equations (PDEs) that systematically exploit the relationship between approximate solutions on multiple grids to arrive at a solution whose accuracy is ...
    • Monotonicity Testing for Boolean Functions over Graph Products 

      Chen, Zhengkun (University of Waterloo, 2020-09-09)
      We establish a directed analogue of Chung and Tetali's isoperimetric inequality for graph products. We use this inequality to obtain new bounds on the query complexity for testing monotonicity of Boolean-valued functions ...
    • Morphing Parallel Graph Drawings 

      Spriggs, Michael John (University of Waterloo, 2007-05-23)
      A pair of straight-line drawings of a graph is called parallel if, for every edge of the graph, the line segment that represents the edge in one drawing is parallel with the line segment that represents the edge in the ...
    • Morse: Reducing the Feature Interaction Explosion Problem Using Subject Matter Knowledge as Abstract Requirements 

      Millet, Laure; Day, Nancy; Joyce, Jeffrey J. (IEEE, 2018-08)
      The feature interaction problem appears in many different kinds of complex systems, especially systems whose elements are created or maintained by separate entities - for example, a modern automobile that incorporates ...
    • Most Complex Non-returning Regular Languages 

      Brzozowski, Janusz; Davies, Sylvie (Springer, 2017-07-03)
      A regular language L is non-returning if in the minimal deterministic finite automaton accepting it there are no transitions into the initial state. Eom, Han and Jirásková derived upper bounds on the state complexity of ...
    • Most Complex Regular Ideal Languages 

      Liu, Bo Yang Victor; Davies, Sylvie; Brzozowski, Janusz (Discrete Mathematics and Theoretical Computer Science, 2016-10-17)
      A right ideal (left ideal, two-sided ideal) is a non-empty language $L$ over an alphabet $\Sigma$ such that $L=L\Sigma^*$ ($L=\Sigma^*L$, $L=\Sigma^*L\Sigma^*$). Let $k=3$ for right ideals, 4 for left ideals and 5 for ...
    • Most Complex Regular Right-Ideal Languages 

      Brzozowski, Janusz; Davies, Gareth (Springer, 2014)
      A right ideal is a language L over an alphabet Sigma that satisfies the equation L = L Sigma*. We show that there exists a sequence (Rn vertical bar n >= 3) of regular right-ideal languages, where R-n has n left quotients ...
    • MS/MS Spectrum Prediction for MHC-Associated Peptides with a Fine-Tuned Model 

      Li, Zhenbo (University of Waterloo, 2024-02-23)
      To improve the quality of spectral library search, several MS/MS spectrum predictors have been developed in the last decades. After success in various fields, deep learning techniques are adopted by MS/MS spectrum predictors ...
    • MT-MAG: Accurate and interpretable machine learning for complete or partial taxonomic assignments of metagenome-assembled genomes 

      Wanxin, Li (University of Waterloo, 2022-05-19)
      We propose MT-MAG, a novel machine learning-based software tool for the complete or partial hierarchically-structured taxonomic classification of metagenome-assembled genomes (MAGs). MT-MAG is capable of classifying large ...
    • Muddler: Using Oblivious RAM For A Privacy Preserving Location-Based Service 

      Mehmood, Danish (University of Waterloo, 2014-10-23)
      As smartphones become ever more prevalent, context aware applications are becoming increasingly popular. Location-based services such as Foursquare have been among the leaders of this trend. Some of the most popular ...
    • Multi-Agent Modeling of Risk-Aware and Privacy-Preserving Recommender Systems 

      Srivastava, Vishnu (University of Waterloo, 2017-04-25)
      Recent progress in the field of recommender systems has led to increases in the accuracy and significant improvements in the personalization of recommendations. These results are being achieved in general by gathering more ...
    • Multi-dimensional Interval Routing Schemes 

      Ganjali, Yashar (University of Waterloo, 2001)
      Routing messages between pairs of nodes is one of the most fundamental tasks in any distributed computing system. An Interval Routing Scheme (IRS) is a well-known, space-efficient routing strategy for routing messages ...
    • Multi-document Summarization System Using Rhetorical Information 

      Alliheedi, Mohammed (University of Waterloo, 2012-07-11)
      Over the past 20 years, research in automated text summarization has grown significantly in the field of natural language processing. The massive availability of scientific and technical information on the Internet, including ...
    • Multi-Master Replication for Snapshot Isolation Databases 

      Chairunnanda, Prima (University of Waterloo, 2013-06-21)
      Lazy replication with snapshot isolation (SI) has emerged as a popular choice for distributed databases. However, lazy replication requires the execution of update transactions at one (master) site so that it is relatively ...
    • Multi-Path Link Embedding for Survivability in Virtual Networks 

      Alam Khan, Md Mashrur (University of Waterloo, 2015-08-26)
      Internet applications are deployed on the same network infrastructure, yet they have diverse performance and functional requirements. The Internet was not originally designed to support the diversity of current applications. ...

      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