Now showing items 1202-1221 of 2587

    • Jaeger’s Strong 3-Flow Conjecture for Graphs in Low Genus Surfaces 

      de Jong, Jamie (University of Waterloo, 2020-05-05)
      In 1972, Tutte posed the 3-Flow Conjecture: that all 4-edge-connected graphs have a nowhere zero 3-flow. This was extended by Jaeger et al. (1992) to allow vertices to have a prescribed, possibly non-zero difference (modulo ...
    • A Java Toolkit for Distributed Evaluation of Hypergeometric Series 

      Chughtai, Fawad (University of Waterloo, 2004)
      Hypergoemetric Series are very important in mathematics and come up regularly when dealing with the precise definitions of constants such as <i>e</i>, &pi; and Apery's constant &sigmaf;(3). The evaluation of such series ...
    • JITGNN: A Deep Graph Neural Network for Just-In-Time Bug Prediction 

      Keshavarz, Hossein (University of Waterloo, 2022-05-10)
      Just-In-Time (JIT) bug prediction is the problem of predicting software failure immediately after a change is submitted to the code base. JIT bug prediction is often preferred to other types of bug prediction (subsystem, ...
    • Join Cardinality Estimation Graphs: Analyzing Pessimistic and Optimistic Estimators Through a Common Lens 

      Chen, Jeremy Yujui (University of Waterloo, 2020-08-07)
      Join cardinality estimation is a fundamental problem that is solved in the query optimizers of database management systems when generating efficient query plans. This problem arises both in systems that manage relational ...
    • Juicy Haptic Design: Vibrotactile Embellishments Can Improve Player Experience in Games 

      Singhal, Tanay; Schneider, Oliver (ACM, 2021-05)
      Game designers and researchers employ a sophisticated language for producing great player experiences with concepts such as juici- ness, which refers to excessive positive feedback. However, much of their discourse excludes ...
    • The k-best paths in Hidden Markov Models. Algorithms and Applications to Transmembrane Protein Topology Recognition. 

      Golod, Daniil (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 

      Roberts, Collin (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 

      Xiao, Rui Philip (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 

      Zonov, Stanislav (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 

      Wong, William Wai Lun (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 

      Leonardi, Christopher (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 

      Ustaoglu, Berkant (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 ...
    • Kinematic Templates: Guiding Cursor Movement in End-User Drawing Tools 

      Fung, Richard Hai-Ping (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. 

      Rahul, Rahul (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 

      Larocque, Luc (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 

      Niknamian, Mohammadali (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 

      Jain, Lalit Kumar (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 

      Chang, Ya-Ting (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 

      Henderson, Kirsten A.; Reis, Mateus; Blanco, Carolina C.; Pillar, Valerio D.; Printes, Rodrigo C.; Bauch, Chris T.; Anand, Madhur (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 

      Tweedle, David (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 ...


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

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages