Browsing Mathematics (Faculty of) by Title
Now showing items 1285-1304 of 2745
-
The k-best paths in Hidden Markov Models. Algorithms and Applications to Transmembrane Protein Topology Recognition.
(University of Waterloo, 2009-08-26)Traditional algorithms for hidden Markov model decoding seek to maximize either the probability of a state path or the number of positions of a sequence assigned to the correct state. These algorithms provide only a ... -
A k-Conjugacy Class Problem
(University of Waterloo, 2007-09-07)In any group G, we may extend the definition of the conjugacy class of an element to the conjugacy class of a k-tuple, for a positive integer k. When k = 2, we are forming the conjugacy classes of ordered pairs, when k ... -
K-theory for C*-Algebras and for Topological Spaces
(University of Waterloo, 2015-04-27)K-theory is the study of a collection of abelian groups that are invariant to C*-algebras or to locally compact Hausdorff spaces. These groups are useful for distinguishing C*-algebras and topological spaces, and they are ... -
Kalman Filter Based Sensor Placement For Burgers Equation
(University of Waterloo, 2019-06-03)The algorithm used for determining sensor placement in this thesis will be based on the Kalman filter. This filter is very famous and its application are numerous - some examples include aircraft navigation, finance and ... -
Kernel Methods in Computer-Aided Constructive Drug Design
(University of Waterloo, 2009-05-14)A drug is typically a small molecule that interacts with the binding site of some target protein. Drug design involves the optimization of this interaction so that the drug effectively binds with the target protein while ... -
Key Compression for Isogeny-Based Cryptosystems
(University of Waterloo, 2016-04-21)We present a method for key compression in quantum-resistant isogeny-based cryptosystems, which reduces storage and transmission costs of per-party public information by a factor of two, with no effect on the security level ... -
Key establishment --- security models, protocols and usage
(University of Waterloo, 2008-07-30)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 ... -
KG-Pipeline: An Automated Knowledge Graph Generation Framework
(University of Waterloo, 2022-09-16)Knowledge Graphs (KGs) have many applications, specifically in information retrieval and question answering. Community projects are conducted for building large-scale KGs with crowdsourcing, but building KGs with this ... -
Kinematic Templates: Guiding Cursor Movement in End-User Drawing Tools
(University of Waterloo, 2009-08-26)This thesis presents kinematic templates, end-user 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, 2012-09-26)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, 2018-09-19)Motion planning problems involve determining appropriate control inputs to guide a system towards a desired endpoint. Sampling-based motion planning was developed as a technique for discretizing the state space of systems ... -
Knowledge Graph Imputation
(University of Waterloo, 2021-05-27)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, 2008-05-01)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 ... -
L1-Penalized Ordinal Regression and Bayesian Variable Selection for Linear Models with Multiple Responses
(University of Waterloo, 2015-05-20)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 ... -
Landowner Perceptions Of The Value Of Natural Forest And Natural Grassland In A Mosaic Ecosystem In Southern Brazil
(Springer, 2016-03-01)The forest-grassland 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 Lang-Trotter conjecture for Drinfeld modules
(University of Waterloo, 2011-08-22)In 1986, Gupta and Murty proved the Lang-Trotter conjecture in the case of elliptic curves having complex multiplication, conditional on the generalized Riemann hypothesis. That is, given a non-torsion point P∈E(ℚ), they ... -
Large Aperiodic Semigroups
(World Scientific Publishing, 2015-11-01)We search for the largest syntactic semigroups of star-free languages having n left quotients; equivalently, we look for the largest transition semigroups of aperiodic finite automata with n states. We first introduce ... -
Large eddy simulations and subgrid scale motions in stratified turbulence
(University of Waterloo, 2015-03-18)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, ... -
Large-Scale Emulation of Anonymous Communication Networks
(University of Waterloo, 2014-08-15)Tor is the most popular low-latency 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, 2022-09-29)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 ...