Browsing Mathematics (Faculty of) by Title
Now showing items 11751194 of 3015

Graph Morphing via Orthogonal Box Drawings
(University of Waterloo, 20231218)Abstract: A graph is a set of vertices, with some pairwise connections given by a set of edges. A graph drawing, such as a nodelink diagram, visualizes a graph with geometric features. One of the most common forms of a ... 
GraphBased Fracture Models for Rigid Body Explosions
(University of Waterloo, 2005)Explosions are one of the most powerful and devastating natural phenomena. The pressure front from the blast wave of an explosion can cause fracture of objects in its vicinity and create flying debris. In this thesis, ... 
GraphBased Mapping for Knowledge Transfer in General Game Playing
(University of Waterloo, 20240117)General game playing (GGP) is a field of reinforcement learning (RL) in which the rules of a game (i.e. the state and dynamics of an RL domain) are not specified until runtime. A GGP agent must therefore be able to play ... 
GraphBased SpatialTemporal Cluster Evolution: Representation, Analysis, and Implementation
(University of Waterloo, 20230828)Spatialtemporal data are information about realworld entities that exist in a location, the spatial dimension, and during a period of time, the temporal dimension. These realworld entities, such as vehicles, people, or ... 
Graphtheoretic Properties of Control Flow Graphs and Applications
(University of Waterloo, 20150825)This thesis deals with determining appropriate width parameters of control flow graphs so that certain computationally hard problems of practical interest become efficiently solvable. A wellknown result of Thorup states ... 
GraphTheoretic Techniques for Optimizing NISQ Algorithms
(University of Waterloo, 20240215)Entering the NISQ era, the search for useful yet simple quantum algorithms is perhaps of more importance now than it may ever be in the future. In place of quantum walks, the quantum Fourier transform, and asymptotic results ... 
GraphflowDB: Scalable Query Processing on GraphStructured Relations
(University of Waterloo, 20231002)Finding patterns over graphstructured datasets is ubiquitous and integral to a wide range of analytical applications, e.g., recommendation and fraud detection. When expressed in the highlevel query languages of database ... 
Graphical CSS Code Transformation Using ZX Calculus
(University of Waterloo, 20231221)In this work, we present a generic approach to transform CSS codes by building upon their equivalence to phasefree ZX diagrams. Using the ZX calculus, we demonstrate diagrammatic transformations between encoding maps ... 
The Graphs of HU+00E4ggkvist & Hell
(University of Waterloo, 20090119)This thesis investigates HU+00E4ggkvist & Hell graphs. These graphs are an extension of the idea of Kneser graphs, and as such share many attributes with them. A variety of original results on many different properties of ... 
Green’s Function for Poisson Equation in Layered NanoStructures including Graphene
(University of Waterloo, 20150504)The purpose of this thesis is to focus on the electrostatic properties of graphenebased nanostructures consisting of different materials, as well as their interactions with external electric charges, by solving the boundary ... 
Grey Level Visual Cryptography for General Access Structures
(University of Waterloo, 2002)Visual cryptography, first introduced by Naor and Shamir, allows a secret (black and white) image to be encoded and distributed to a set of participants such that certain predefined sets of participants may reconstruct the ... 
A Grouped Hamming Network
(University of Waterloo, 20100830)A distributed hash table (DHT) is a type of peertopeer (P2P) network that, like traditional hash tables, maps keys to values. Unlike traditional hash tables, however, the data is distributed across a network with each ... 
Gröbner Bases Theory and The Diamond Lemma
(University of Waterloo, 2006)Commutative Gröbner bases theory is well known and widely used. In this thesis, we will discuss thoroughly its generalization to noncommutative polynomial ring <em>k</em><<em>X</em>> which is also an associative free ... 
GRS: Combining Generation and Revision in Unsupervised Sentence Simplification
(University of Waterloo, 20220830)Text simplification is a task in the natural language processing field that alters a given text to reduce the structural and lexical complexity of the text while preserving the underlying meaning. We can classify existing ... 
Guidance Under Uncertainty: Employing a Mediator Framework in Bilateral IncompleteInformation Negotiations
(University of Waterloo, 20080924)Bilateral incompleteinformation negotiations of multiple issues present a difficult yet common negotiation problem that is complicated to solve from a mechanism design perspective. Unlike multilateral situations, where ... 
A guide to Fautomatic sets
(University of Waterloo, 20210908)A selfcontained introduction to the theory of Fautomatic sets is given. Building on [Bell, Moosa, Fsets and finite automata, Journal de théorie des nombres de Bordeaux, 2019], contributions are made to both the foundations ... 
Guided Testing of Concurrent Programs Using Value Schedules
(University of Waterloo, 20090929)Testing concurrent programs remains a difficult task due to the nondeterministic nature of concurrent execution. Many approaches have been proposed to tackle the complexity of uncovering potential concurrency bugs. ... 
H(div)conforming Discontinuous Galerkin Methods for Multiphase Flow
(University of Waterloo, 20210505)Computational fluid dynamics (CFD) is concerned with numerically solving and visualizing complex problems involving fluids with numerous engineering applications. Mathematical models are derived from basic governing ... 
Hcolouring Ptfree graphs in subexponential time
(Elsevier, 20190831)A graph is called Ptfree if it does not contain the path on t vertices as an induced subgraph. Let H be a multigraph with the property that any two distinct vertices share at most one common neighbour. We show that the ... 
H∞ optimal actuator location
(University of Waterloo, 20120517)There is often freedom in choosing the location of actuators on systems governed by partial differential equations. The actuator locations should be selected in order to optimize the performance criterion of interest. ...