Browsing Mathematics (Faculty of) by Title
Now showing items 14381457 of 3020

Key Compression for IsogenyBased Cryptosystems
(University of Waterloo, 20160421)We present a method for key compression in quantumresistant isogenybased cryptosystems, which reduces storage and transmission costs of perparty public information by a factor of two, with no effect on the security level ... 
Key establishment  security models, protocols and usage
(University of Waterloo, 20080730)Key establishment is the process whereby two or more parties derive a shared secret, typically used for subsequent confidential communication. However, identifying the exact security requirements for key establishment ... 
KGPipeline: An Automated Knowledge Graph Generation Framework
(University of Waterloo, 20220916)Knowledge Graphs (KGs) have many applications, specifically in information retrieval and question answering. Community projects are conducted for building largescale KGs with crowdsourcing, but building KGs with this ... 
Kinematic Templates: Guiding Cursor Movement in EndUser Drawing Tools
(University of Waterloo, 20090826)This thesis presents kinematic templates, enduser drawing tools that influence the mouse cursor's movement within specific areas of a digital canvas. Two types of kinematic templates influence the cursor's movement: ... 
Kinetic Modeling of Pyruvate Recycling Pathways in Pancreatic βCells.
(University of Waterloo, 20120926)A variety of signaling mechanisms are employed to maintain healthy levels of glucose in the blood stream. The hormone insulin is one of the primary regulators of glucose homeostasis. Insulin, which activates glucose ... 
Kinodynamic Planning with μCalculus Specifications
(University of Waterloo, 20180919)Motion planning problems involve determining appropriate control inputs to guide a system towards a desired endpoint. Samplingbased motion planning was developed as a technique for discretizing the state space of systems ... 
Knowledge Graph Imputation
(University of Waterloo, 20210527)Knowledge graphs are one of the most important resources of information in many applications such as question answering and social networks. These knowledge graphs however, are often far from complete as there are so many ... 
Koblitz's Conjecture for the Drinfeld Module
(University of Waterloo, 20080501)Let $E$ be an elliptic curve over the rationals without complex multiplication such that any elliptic curve $\mathbb{Q}$isogenous to $E$ has trivial $\mathbb{Q}$torsion. Koblitz conjectured that the number of primes less ... 
L1Penalized Ordinal Regression and Bayesian Variable Selection for Linear Models with Multiple Responses
(University of Waterloo, 20150520)Polychotomous ordinal response data are often analyzed by first introduce a latent continuous variable which can be modeled as an ordinary regression problem with the presence of covariates by using Markov chain Monte Carlo ... 
Laconic Evaluation of Branching Programs from the DiffieHellman Assumption
(University of Waterloo, 20240502)Secure twoparty computation (2PC) enables two parties to compute a function f on their joint inputs while keeping their inputs private. Laconic cryptography is a special type of 2PC in which this is done with asymptotically ... 
Landowner Perceptions Of The Value Of Natural Forest And Natural Grassland In A Mosaic Ecosystem In Southern Brazil
(Springer, 20160301)The forestgrassland mosaics of southern Brazil have been subject to many land use and policy changes over the decades. Like many grasslands around the world, the Campos grasslands are declining with few conservation efforts ... 
The LangTrotter conjecture for Drinfeld modules
(University of Waterloo, 20110822)In 1986, Gupta and Murty proved the LangTrotter conjecture in the case of elliptic curves having complex multiplication, conditional on the generalized Riemann hypothesis. That is, given a nontorsion point P∈E(ℚ), they ... 
Large Aperiodic Semigroups
(World Scientific Publishing, 20151101)We search for the largest syntactic semigroups of starfree languages having n left quotients; equivalently, we look for the largest transition semigroups of aperiodic finite automata with n states. We first introduce ... 
Large DatatoText Generation
(University of Waterloo, 20230516)This thesis presents a domaindriven approach to sports game summarization, a specific instance of large datatotext generation (DTG). We first address the data fidelity issue in the Rotowire dataset by supplementing ... 
Large eddy simulations and subgrid scale motions in stratified turbulence
(University of Waterloo, 20150318)Direct numerical and large eddy simulations (DNS $\&$ LES) of decaying and forced stratified turbulence are studied in this thesis. By defining a test filter scale $k_c$ in the horizontal and vertical directions separately, ... 
LargeScale Emulation of Anonymous Communication Networks
(University of Waterloo, 20140815)Tor is the most popular lowlatency anonymous communication system for the Internet, helping people to protect their privacy online and circumvent Internet censorship. Its low latency anonymity and distributed design ... 
A Las Vegas Algorithm for the Ordered Majority Problem
(University of Waterloo, 20220929)In this thesis, we study the majority problem using ordered comparisons under the Las Vegas randomized algorithm model. The majority problem asks whether a given set of n elements, each with some colour, has a colour which ... 
Latelumping backstepping control of partial differential equations
(Elsevier, 201902)We consider in this paper three different partial differential equations (PDEs) that can be exponentially stabilized using backstepping controllers. For implementation, a finitedimensional controller is generally needed. ... 
A Latent Health Factor Model for Estimating Estuarine Ecosystem Health
(University of Waterloo, 20090520)Assessment of the “health” of an ecosystem is often of great interest to those interested in monitoring and conservation of ecosystems. Traditionally, scientists have quantified the health of an ecosystem using multimetric ... 
Lattice Compression of Polynomial Matrices
(University of Waterloo, 20070501)This thesis investigates lattice compression of polynomial matrices over finite fields. For an m x n matrix, the goal of lattice compression is to find an m x (m+k) matrix, for some relatively small k, such that the ...