Browsing Mathematics (Faculty of) by Title
Now showing items 1281-1300 of 3004
-
Implementation of the Metal Privileged Architecture
(University of Waterloo, 2020-08-31)The privileged architecture of modern computer architectures is expanded through new architectural features that are implemented in hardware or through instruction set extensions. These extensions are tied to particular ... -
Implementations of iterative algorithms in Hadoop and Spark
(University of Waterloo, 2014-07-29)Facing the challenges of large amounts of data generated by various companies (such as Facebook, Amazon, and Twitter), cloud computing frameworks such as Hadoop are used to store and process the Big Data. Hadoop, an open ... -
Implementing a Functional Language for Flix
(University of Waterloo, 2016-09-15)Static program analysis is a powerful technique for maintaining software, with applications such as compiler optimizations, code refactoring, and bug finding. Static analyzers are typically implemented in general-purpose ... -
Implementing Overloading and Polymorphism in Cforall
(University of Waterloo, 2003)The programming language Cforall extends the C language with, among other things, overloading, parametric polymorphism, and functions that can return multiple values from a single call. This thesis presents an outline ... -
Implementing the Castryck-Decru attack on SIDH with general primes
(University of Waterloo, 2024-01-09)With the rapid progress of quantum computers in recent years, efforts have been made to standardize new public-key cryptographic protocols which would be secure against them. One of the schemes in contention was Supersingular ... -
Implementing the Schoof-Elkies-Atkin Algorithm with NTL
(University of Waterloo, 2013-04-30)In elliptic curve cryptography, cryptosystems are based on an additive subgroup of an elliptic curve defined over a finite field, and the hardness of the Elliptic Curve Discrete Logarithm Problem is dependent on the order ... -
Implicit Loss of Surjectivity and Facial Reduction: Theory and Applications
(University of Waterloo, 2023-03-09)Facial reduction, pioneered by Borwein and Wolkowicz, is a preprocessing method that is commonly used to obtain strict feasibility in the reformulated, reduced constraint system. The importance of strict feasibility is ... -
Implied Volatility Modelling
(University of Waterloo, 2014-01-08)We propose extensions on calibrating the volatility surface through multi-factor regression models. The proposed models are back-tested against the historical S&P 500 prices during both the volatile and non-volatile periods ... -
Importance Sampling and Stratification for Copula Models
(Springer, 2018)An importance sampling approach for sampling from copula models is introduced. The proposed algorithm improves Monte Carlo estimators when the functional of interest depends mainly on the behaviour of the underlying random ... -
Importance Sampling and Stratification Techniques for Multivariate Models with Low-Dimentional Structures
(University of Waterloo, 2017-12-22)Many problems in finance and risk management involve the computation of quantities related to rare-event analysis. As many financial problems are high-dimensional, the quan- tities of interest rarely have analytical forms ... -
The Impress Context Store: A Coordination Framework for Context-Aware Systems
(University of Waterloo, 2006)The dream of weaving technology into our everyday fabric of life is recently being made possible by advances in ubiquitous computing and sensor technologies. Countless sensors of various sizes have made their way into ... -
An Improved Algorithm for Tor Circuit Scheduling
(University of Waterloo, 2010-07-08)Tor is a popular anonymity-preserving network, consisting of routers run by volunteers all around the world. It protects Internet users’ privacy by relaying their network traffic through a series of routers, thus concealing ... -
Improved approximation guarantees for lower-bounded facility location problem
(University of Waterloo, 2010-09-28)We consider the lower-bounded facility location (LBFL) problem (, also known as load-balanced facility location), which is a generalization of uncapacitated facility location (UFL) problem where each open facility is ... -
Improved Bayesian Network Structure Learning in the Model Averaging Paradigm
(University of Waterloo, 2023-01-10)A Bayesian network (BN) is a probabilistic graphical model with applications in knowledge discovery and prediction. Its structure can be learned from data using the well-known score-and-search approach, where a scoring ... -
Improved Diagnostics & Performance for Quantum Error Correction
(University of Waterloo, 2023-08-04)Building large scale quantum computers is one of the most exciting ventures being pursued by researchers in the 21st century. However, the presence of noise in quantum systems poses a major hindrance towards this ambitious ... -
Improved Model Poisoning Attacks and Defenses in Federated Learning with Clustering
(University of Waterloo, 2022-05-12)Federated Learning (FL) allows multiple participants to collaboratively train a deep learning model without sharing their private training data. However, due to its distributive nature, FL is vulnerable to various poisoning ... -
Improved Particle Filter Based Localization and Mapping Techniques
(University of Waterloo, 2008-04-28)One of the most fundamental problems in mobile robotics is localization. The solution to most problems requires that the robot first determine its location in the environment. Even if the absolute position is not necessary, ... -
Improved Scalability and Accuracy of Bayesian Network Structure Learning in the Score-and-Search Paradigm
(University of Waterloo, 2023-05-16)A Bayesian network is a probabilistic graphical model that consists of a directed acyclic graph (DAG), where each node is a random variable and attached to each node is a conditional probability distribution (CPD). A ... -
Improvements in the Accuracy of Pairwise Genomic Alignment
(University of Waterloo, 2010-04-16)Pairwise sequence alignment is a fundamental problem in bioinformatics with wide applicability. This thesis presents three new algorithms for this well-studied problem. First, we present a new algorithm, RDA, which aligns ... -
Improvements to Many-Sorted Finite Model Finding using SMT Solvers
(University of Waterloo, 2023-08-17)Formal modeling is a powerful tool in requirements engineering. By modeling a system before implementation, one can discover bugs before they appear in testing or production. Model finding (or instance finding) for a model ...