Browsing Computer Science by Title
Now showing items 846-865 of 1545
-
Modeling Trust in Multiagent Mobile Vehicular Ad-Hoc Networks through Enhanced Knowledge Exchange for Effective Travel Decision Making
(University of Waterloo, 2012-04-24)This thesis explores how to effectively model trust in the environment of mobile vehicular ad-hoc networks. We consider each vehicle’s travel path planning to be guided by an intelligent agent that receives traffic reports ... -
Modeling User Affect Using Interaction Events
(University of Waterloo, 2011-07-08)Emotions play a significant role in many human mental activities, including decision-making, motivation, and cognition. Various intelligent and expert systems can be empowered with emotionally intelligent capabilities, ... -
Modelling Acoustic Propagation with Dominant Paths
(University of Waterloo, 2014-12-15)Hearing is one of our major senses. In addition to being, arguably, our primary form of communication, it affects how we perceive the world around us. Accurate acoustic simulation can complement graphical simulation systems, ... -
Modelling Allostery using a Computational Analysis of Side-Chain Interactions
(University of Waterloo, 2022-09-30)Allostery refers to the regulation of protein activity arising from an effector molecule, such as a ligand, binding to a protein. The exact mechanisms that take place in allosteric regulation are still a source of debate ... -
Modelling and Analysis using Graph Transformation Systems
(University of Waterloo, 2010-11-01)Communication protocols, a class of critical systems, play an important role in industry. These protocols are critical because the tolerance for faults in these systems is low and it is highly desirable that these systems ... -
Modelling Chart Trajectories using Song Features
(University of Waterloo, 2019-08-23)Over the years, hit song science has been a controversial topic within music information retrieval. Researchers have debated whether an unbiased dataset can be constructed to model song performance in a meaningful way. ... -
Modelling, Design, and Control of Energy Systems: A Data-Driven Approach
(University of Waterloo, 2019-09-23)In 2018, nearly two-thirds of newly installed global power generation has come from renewable energy sources. Distributed installations of solar photovoltaic (PV) panels have been at the forefront of this global energy ... -
Models and Algorithms for Persistent Queries over Streaming Graphs
(University of Waterloo, 2022-08-17)It is natural to model and represent interaction data as graphs in a broad range of domains such as online social networks, protein interaction data, and e-commerce applications. A number of emerging applications require ... -
Models for Parallel Computation in Multi-Core, Heterogeneous, and Ultra Wide-Word Architectures
(University of Waterloo, 2013-04-26)Multi-core processors have become the dominant processor architecture with 2, 4, and 8 cores on a chip being widely available and an increasing number of cores predicted for the future. In addition, the decreasing costs ... -
The Moderation of Contentious Content on Twitter
(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
(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
(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>)
(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
(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
(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
(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
(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
(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
(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
(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 ...