Browsing Mathematics (Faculty of) by Title
Now showing items 1674-1693 of 2993
-
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 modified sliding-mode observer design with application to diffusion equation
(Taylor and Francis, 2018-02-27)In many physical systems, the system's full state cannot be measured. An observer is designed to reconstruct the state from measurements. Disturbances often contribute to the dynamics of the system, and the designed observer ... -
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 ... -
Modular relations of the Tutte symmetric function
(Elsevier, 2022-04)For a graph G, its Tutte symmetric function XBG generalizes both the Tutte polynomial TG and the chromatic symmetric function XG. We may also consider XB as a map from the t-extended Hopf algebra G[t] of labelled graphs ... -
Modularity and Structure in Matroids
(University of Waterloo, 2013-04-22)This thesis concerns sufficient conditions for a matroid to admit one of two types of structural characterization: a representation over a finite field or a description as a frame matroid. We call a restriction N of a ... -
Moment Polynomials for the Riemann Zeta Function
(University of Waterloo, 2009-01-21)In this thesis we calculated the coefficients of moment polynomials of the Riemann zeta function for k= 4, 5, 6...13 using cubic acceleration, which is an improved method from quadratic acceleration. We then numerically ... -
Moments of Random Quantum Circuits and Applications in Random Circuit Sampling
(University of Waterloo, 2021-12-23)Random quantum circuits and random circuit sampling (RCS) have recently garnered tremendous attention from all sub-fields of the quantum information community, especially after Google’s quantum supremacy announcement in ... -
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 ... -
Monte Carlo Simulation of Diffusion Magnetic Resonance Imaging
(University of Waterloo, 2020-01-16)The goal of this thesis is to describe, implement and analyse Monte Carlo (MC) algorithms for simulating the mechanism of diffusion magnetic resonance imaging (dMRI). As the inverse problem of mapping the sub-voxel ... -
The Mordell-Lang Theorem from the Zilber Dichotomy
(University of Waterloo, 2010-04-30)We present a largely self-contained exposition of Ehud Hrushovski's proof of the function field Mordell-Lang conjecture beginning from the Zilber Dichotomy for differentially closed fields and separably closed fields. Our ... -
A More Accurate Measurement Model for Fault-Tolerant Quantum Computing
(University of Waterloo, 2009-01-30)Aliferis, Gottesman and Preskill [1] reduce a non-Markovian noise model to a local noise model, under assumptions on the smallness of the norm of the system-bath interaction. They also prove constructively that given a ... -
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 ... -
Morphing planar triangulations
(University of Waterloo, 2014-06-09)A morph between two drawings of the same graph can be thought of as a continuous deformation between the two given drawings. A morph is linear if every vertex moves along a straight line segment from its initial position ... -
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 ... -
Mortality Prediction using Statistical Learning Approaches
(University of Waterloo, 2022-11-21)Longevity risk, as one of the major risks faced by insurers, has triggered a heated stream of research in mortality modeling among actuaries for effective design/pricing/risk management of insurance products. The idea of ... -
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 ...