Now showing items 2525-2544 of 2994

    • Software Simulation of Numerically Controlled Machining 

      Israeli, Gilad (University of Waterloo, 2006)
      The field of numerically controlled (NC) machining has long been interested with predicting and measuring the errors in machining. Creating a simulation of NC machining is one way of achieving this. This thesis ...
    • Solar Panel Anomaly Detection and Classification 

      Hu, Bo (University of Waterloo, 2012-05-17)
      The number of solar panels deployed worldwide has rapidly increased. Solar panels are often placed in areas not easily accessible. It is also difficult for panel owners to be aware of their operating condition. Many ...
    • Solving Geometric Problems in Space-Conscious Models 

      Chen, Yu (University of Waterloo, 2009-01-26)
      When dealing with massive data sets, standard algorithms may easily ``run out of memory''. In this thesis, we design efficient algorithms in space-conscious models. In particular, in-place algorithms, multi-pass algorithms, ...
    • Solving Hyperbolic PDEs using Accelerator Architectures 

      Rostrup, Scott (University of Waterloo, 2009-07-27)
      Accelerator architectures are used to accelerate the simulation of nonlinear hyperbolic PDEs. Three different architectures, a multicore CPU using threading, IBM’s Cell Processor, and Nvidia’s Tesla GPUs are investigated. ...
    • Solving mathematical problems on touch-based devices 

      Prosser, R. Mark (University of Waterloo, 2014-09-17)
      Research on the use of mobile touch-based devices for mathematics has not kept up with the increasing ubiquity of such machines. Building upon MathBrush, a pen-based system for the recognition of handwritten mathematics, ...
    • Solving Saddle Point Formulations of Linear Programs with Frank-Wolfe 

      Hough, Matthew (University of Waterloo, 2023-08-24)
      The problem of solving a linear program (LP) is ubiquitous in industry, yet in recent years the size of linear programming problems has grown and continues to do so. State-of-the-art LP solvers make use of the Simplex ...
    • Solving Traveling Salesman Problem With a non-complete Graph 

      Emami Taba, Mahsa Sadat (University of Waterloo, 2010-01-07)
      One of the simplest, but still NP-hard, routing problems is the Traveling Salesman Problem (TSP). In the TSP, one is given a set of cities and a way of measuring the distance between cities. One has to find the shortest ...
    • Some additive results in F_q[t] 

      Yamagishi, Shuntaro (University of Waterloo, 2015-08-27)
      We collected several results in integers of additive number theory and translated to results in F_q[t]. The results we collected are related to slim exceptional sets and the asymptotic formula in Waring's problem, a ...
    • Some aspects of Cantor sets 

      Ng, Ka Shing (University of Waterloo, 2014-03-28)
      For every positive, decreasing, summable sequence $a=(a_i)$, we can construct a Cantor set $C_a$ associated with $a$. These Cantor sets are not necessarily self-similar. Their dimensional properties and measures have been ...
    • Some Functional Equations Connected with the Utility of Gains and Losses 

      Titioura, Andrei (University of Waterloo, 2002)
      The behavioral properties shown by people when they make selections between different choices will be studied. Based on empirical and logical data a mathematical axiomatic model is built. D. Luce is a major ...
    • Some Mathematical Perspectives of Graph Neural Networks 

      Nguyen, Duy (University of Waterloo, 2022-05-12)
      Many real-world entities can be modelled as graphs, such as molecular structures, social networks, or images. Despite coming with such a great expressive power, the complex structure of graphs poses significant challenges ...
    • Some Models and Tests for Carryover Effects and Trends in Recurrent Event Processes 

      Cigsar, Candemir (University of Waterloo, 2010-09-30)
      Recurrent events experienced by individual units or systems occur in many fields. The main target of this thesis is to develop formal tests for certain features of recurrent event processes, and to discuss their properties. ...
    • Some Problems in Multiplicative and Additive Number Theory 

      Elma, Ertan (University of Waterloo, 2020-07-27)
      In this thesis, we obtain several results in number theory. Let $k\geqslant 1$ be a natural number and $\omega_k(n)$ denote the number of distinct prime factors of a natural number $n$ with multiplicity $k$. We estimate ...
    • Some results on binary forms and counting rational points on algebraic varieties 

      Xiao, Stanley Yao (University of Waterloo, 2016-08-17)
      In this thesis we study several problems related to the representation of integers by binary forms and counting rational points on algebraic varieties. In particular, we establish an asymptotic formula for $R_F(Z)$, the ...
    • Some Results on Multivariate Dependence Modeling 

      Wei, Yunran (University of Waterloo, 2015-01-14)
      The goal of this thesis is to solve some problems in dependence modeling. Under special assumptions, we use Tankov [2011]’s result to give sharp bounds on variance of the sum of two random variables with partial information ...
    • Some Stochastic Optimization Problems in Reinsurance and Insurance 

      Cao, Jingyi (University of Waterloo, 2021-01-12)
      Insurance, which hedges against the risk of a contingent loss, is an indispensable risk management tool for both institutions and individuals. Reinsurance, namely, a form of insurance accessible to insurers, helps limit ...
    • Some Theory and Applications of Probability in Quantum Mechanics 

      Ferrie, Christopher (University of Waterloo, 2012-07-19)
      This thesis investigates three distinct facets of the theory of quantum information. The first two, quantum state estimation and quantum process estimation, are closely related and deal with the question of how to estimate ...
    • Some Upper and Lower Bounds regarding Query Complexity 

      Liu, Rui Peng (University of Waterloo, 2017-08-29)
      Query complexity is one of the several notions of complexity de ned to measure the cost of algorithms. It plays an important role in demonstrating the quantum advantage, that quantum computing is faster than classical ...
    • Soteria: An Approach for Detecting Multi-Institution Attacks 

      Zabarah, Saif (University of Waterloo, 2023-01-02)
      We present Soteria, a data processing pipeline for detecting multi-institution attacks. Multi-institution attacks contact large number of potential targets looking for vulnerabilities that span multiple institutions. Soteria ...
    • Source Code Stylometry and Authorship Attribution for Open Source 

      Watson, Daniel (University of Waterloo, 2019-09-23)
      Public software repositories such as GitHub make transparent the development history of an open source software system. Source code commits, discussions about new features and bugs, and code reviews are stored and carefully ...

      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