Browse by

Welcome to the Faculty of Mathematics community.

This community and it’s collections are organized using the University of Waterloo's Faculties and Academics structure. In this structure:

• Communities are Faculties or Affiliated Institutions
• Collections are Departments or Research Centres

Research outputs are organized by type (eg. Master Thesis, Article, Conference Paper).

New collections following this structure will be created UPON REQUEST .

Recent deposits

• Applying Fair Reward Divisions to Collaborative Work ﻿

(University of Waterloo, 2019-07-18)
Collaborative crowdsourcing tasks allow workers to solve more difficult problems than they could alone, but motivating workers in these tasks is complex. In this thesis, we study how to use payments to motivate groups of ...
• Constructing Cospectral and Comatching Graphs ﻿

(University of Waterloo, 2019-07-18)
The matching polynomial is a graph polynomial that does not only have interesting mathematical properties, but also possesses meaningful applications in physics and chemistry. For a simple graph, the matching polynomial ...
• Dynamic Personalization of Gameful Interactive Systems ﻿

(University of Waterloo, 2019-07-17)
Gameful design, the process of creating a system with affordances for gameful experiences, can be used to increase user engagement and enjoyment of digital interactive systems. It can also be used to create applications ...
• On some topics in Levy insurance risk models ﻿

(University of Waterloo, 2019-07-16)
Risk management has long been the central focus within actuarial science. There are various risks a typical actuarial company would look into, solvency risk being one of them. This falls under the scope of surplus analysis. ...
• Generalizations of the Gap Principle and the Thue-Siegel Principle, with Applications to Diophantine Equations ﻿

(University of Waterloo, 2019-07-16)
In this thesis we develop generalizations of two well-known principles from the theory of Diophantine approximation, namely the gap principle and the Thue-Siegel principle. Our results find their applications in the theory ...
• Correlation and Communication via a Quantum Field ﻿

(University of Waterloo, 2019-07-15)
We study the ability of qubit detectors to i) extract correlations from, and ii) transmit quantum information through, a quantum field. We start by perturbatively studying the harvesting of correlations from thermal and ...
• Computability Theory and Some Applications ﻿

(University of Waterloo, 2019-07-15)
We explore various areas of computability theory, ranging from applications in computable structure theory primarily focused on problems about computing isomorphisms, to a number of new results regarding the degree-theoretic ...
• Applications of Stochastic Gradient Descent to Nonnegative Matrix Factorization ﻿

(University of Waterloo, 2019-07-15)
We consider the application of stochastic gradient descent (SGD) to the nonnegative matrix factorization (NMF) problem and the unconstrained low-rank matrix factorization problem. While the literature on the SGD algorithm ...
• Unitary Correlation Sets and their Applications ﻿

(University of Waterloo, 2019-07-04)
We relate Connes' embedding problem in operator algebras to the Brown algebra Unc(n), which is defined as the universal unital C*-algebra generated by the entries of an n x n unitary matrix. In particular, we show that the ...
• A Statistical Response to Challenges in Vast Portfolio Selection ﻿

(University of Waterloo, 2019-07-04)
The thesis is written in response to emerging issues brought about by an increasing number of assets allocated in a portfolio and seeks answers to puzzling empirical findings in the portfolio management area. Over the ...
• Invariant manifold theory for impulsive functional differential equations with applications ﻿

(University of Waterloo, 2019-07-03)
The primary contribution of this thesis is a development of invariant manifold theory for impulsive functional differential equations. We begin with an in-depth analysis of linear systems, immersed in a nonautonomous ...
• Optimization for Image Segmentation ﻿

(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 ...
• Risk Management with Non-Convex and Non-Monotone Preferences ﻿

(University of Waterloo, 2019-06-24)
This thesis studies two types of problems, the theory of risk functionals and the risk sharing problem. We put a special focus on a class of non-monotone law-invariant risk functionals, called the signed Choquet integrals. The ...
• Model-Based Bayesian Sparse Sampling for Data Efficient Control ﻿

(University of Waterloo, 2019-06-24)
In this work, we propose a novel Bayesian-inspired model-based policy search algorithm for data efficient control. In contrast to other model-based approaches, our algorithm makes use of approximate Gaussian processes in ...
• Mitigator: Privacy policy compliance using Intel SGX ﻿

(University of Waterloo, 2019-06-19)
Privacy policies have been known to be hard to read and understand by internet users and yet users are obliged to accept these one-sided terms of usage of their data before they can effectively use websites. Although ...
• Approximation Constants for Closed Subschemes of Projective Varieties ﻿

(University of Waterloo, 2019-06-19)
Diophantine approximation is a branch of number theory with a long history, going back at least to the work of Dirichlet and Liouville in the 1840s. The innocent-looking question of how well an arbitrary real algebraic ...
• Fast Multi-Level Co-Clustering ﻿

(2013)
We present a new multilevel method for hierarchical co-clustering. The fast multilevel co-clustering method (FMCC) implements a bi-coarsening process on the bipartite graph induced by the feature matrix. It does so in a ...
• Degrees of Categoricity and the Isomorphism Problem ﻿

(University of Waterloo, 2019-06-12)
In this thesis, we study notions of complexity related to computable structures. We first study degrees of categoricity for computable tree structures. We show that, for any computable ordinal $\alpha$, there exists a ...
• Entity Matching and Disambiguation Across Multiple Knowledge Graphs ﻿

(University of Waterloo, 2019-06-10)
Knowledge graphs are considered an important representation that lie between free text on one hand and fully-structured relational data on the other. Knowledge graphs are a back-bone of many applications on the Web. With ...
• Theoretical foundations for efficient clustering ﻿

(University of Waterloo, 2019-06-07)
Clustering aims to group together data instances which are similar while simultaneously separating the dissimilar instances. The task of clustering is challenging due to many factors. The most well-studied is the high ...

UWSpace

University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883