Now showing items 1116-1135 of 2985

    • Generalizations of the Gap Principle and the Thue-Siegel Principle, with Applications to Diophantine Equations 

      Mosunov, Anton (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 ...
    • Generalizations to Corrections of Measurement Error Effects for Dynamic Treatment Regimes 

      Spicker, Dylan (University of Waterloo, 2022-08-19)
      Measurement error is a pervasive issue in questions of estimation and inference. Generally, any data which are measured with error will render the results of an analysis which ignores this error unreliable. This is a ...
    • A Generalized Adversary Method for Quantum Query Complexity 

      Soiffer, Rory (University of Waterloo, 2022-05-20)
      Quantum query complexity measures the minimum number of queries a quantum algorithm needs to make to some input string to compute a function of that input. Query complexity models are widely used throughout quantum computing, ...
    • A Generalized Blending Scheme for Arbitrary Order of Continuity 

      Fang, Xiang (University of Waterloo, 2023-03-20)
      In this thesis, new templates and formulas of blending functions, schemes, and algorithms are derived for solving the scattered data interpolation problem. The resulting data fitting scheme interpolates the positions and ...
    • Generalized Complex Structures on Kodaira Surfaces 

      Hamilton, Jordan (University of Waterloo, 2014-08-05)
      In this thesis, we study generalized complex structures on Kodaira surfaces, which are non-K\"ahler surfaces that admit holomorphic symplectic structures. We show, in particular, that the moduli space of even-type generalized ...
    • Generalized GCDs as Applications of Vojta’s Conjecture 

      Pyott, Nolan (University of Waterloo, 2023-08-31)
      Starting with an analysis of the result that for any coprime integers a and b, and some ϵ > 0, we have eventually that gcd(a^n − 1,b^n − 1) < a^ϵn holds for all n, we are motivated to look for geometric reasons why this ...
    • The Generalized Method of Moments for Mixture and Mixed Models 

      Huang, Zhiyue (University of Waterloo, 2015-09-28)
      Mixture models can be found in a wide variety of statistical applications. However, undertaking statistical inference in mixture models, especially non-parametric mixture models, can be challenging. A general, or nonparametric, ...
    • Generalized Set and Graph Packing Problems 

      Romero, Jazmin (University of Waterloo, 2015-11-12)
      Many complex systems that exist in nature and society can be expressed in terms of networks (e.g., social networks, communication networks, biological networks, Web graph, among others). Usually a node represents an ...
    • Generalized Strategies for Path Integration using Neural Oscillators 

      Ji, Xiang (University of Waterloo, 2014-08-20)
      Path integration is a process by which an animal obtains its location by integrating its velocity over time. Evidence shows that path integration may contribute to certain neural activity patterns in the entorhinal cortex ...
    • Generalizing sampling theory for time-varying Nyquist rates using self-adjoint extensions of symmetric operators with deficiency indices (1,1) in Hilbert spaces 

      Hao, Yufang (University of Waterloo, 2011-09-30)
      Sampling theory studies the equivalence between continuous and discrete representations of information. This equivalence is ubiquitously used in communication engineering and signal processing. For example, it allows ...
    • Generating Functions for Hyperbolic Plane Tessellations 

      Xie, Jiale (University of Waterloo, 2017-08-28)
      For a hyperbolic plane tessellation there is a generating function with respect to the distance. This generating function is the same as the growth function of a group of isometries of hyperbolic plane that acts regularly ...
    • Generating patterns on clothing for seamless design 

      Kang, Clara (University of Waterloo, 2021-04-26)
      Symmetric patterns are used widely in clothing manufacture. However, the discontinuity of patterns at seams can disrupt the visual appeal of clothing. While it is possible to align patterns to conceal such pattern breaks, ...
    • Generating Radiosity Maps on the GPU 

      Moreno-Fortuny, Gabriel (University of Waterloo, 2005)
      Global illumination algorithms are used to render photorealistic images of 3D scenes taking into account both direct lighting from the light source and light reflected from other surfaces in the scene. Algorithms based ...
    • Generation and properties of random graphs and analysis of randomized algorithms 

      Gao, Pu (University of Waterloo, 2010-01-22)
      We study a new method of generating random $d$-regular graphs by repeatedly applying an operation called pegging. The pegging algorithm, which applies the pegging operation in each step, is a method of generating large ...
    • Generative Modeling with Neural Ordinary Differential Equations 

      Dockhorn, Tim (University of Waterloo, 2019-12-19)
      Neural ordinary differential equations (NODEs) (Chen et al., 2018) are ordinary differential equations (ODEs) with their dynamics modeled by neural networks. Continuous normalizing flows (CNFs) (Chen et al., 2018; Grathwohl ...
    • Generic Attacks on Hash Functions 

      Upadhyay, Jalaj (University of Waterloo, 2010-09-28)
      The subject of this thesis is a security property of hash functions, called chosen-target forced-prefix preimage (CTFP) resistance and the generic attack on this property, called the herding attack. The study of CTFP ...
    • Genetic Programming for the Evolution of Functions with a Discrete Unbounded Domain 

      Eastwood, Shawn (University of Waterloo, 2013-05-16)
      The idea of automatic programming using the genetic programming paradigm is a concept that has been explored in the work of Koza and several works since. Most problems attempted using genetic programming are finite in size, ...
    • Genus one partitions 

      Yip, Martha (University of Waterloo, 2006)
      We obtain a tight upper bound for the genus of a partition, and calculate the number of partitions of maximal genus. The generating series for genus zero and genus one rooted hypermonopoles is obtained in closed form ...
    • Geo-Phisher: The Design and Evaluation of Information Visualizations about Internet Phishing Trends 

      Zhang-Kennedy, Leah; Fares, Elias; Chiasson, Sonia; Biddle, Robert (IEEE, 2016-06)
      We designed an information visualization about phishing trends and phishing prevention for the general public to examine the effects of interactivity on information finding, user perceptions and security behaviour intentions, ...
    • Geodesic Convex Analysis of Group Scaling for the Paulsen Problem and the Tensor Normal Model 

      Ramachandran, Akshay (University of Waterloo, 2021-11-18)
      The framework of scaling problems has recently had much interest in the theoretical computer science community due to its variety of applications, from algebraic complexity to machine learning. In this thesis, our main ...

      UWSpace

      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