This is the University of Waterloo Research collection.

Waterloo faculty, students, and staff can contact us or visit the UWSpace guide to learn more about depositing their research.

NOTE: This collection does not include graduate Theses & Dissertations or Major Research Projects.

Recent deposits

  • LEVI: Exploring Possibilities for an Adaptive Board Game System 

    Tu, Joseph; Wang, Derrick; Durmanova, Ekaterina; Nacke, Lennart (Association for Computing Machinery, 2023-08-03)
    Visual impairment can create accessibility barriers for players in board games because information about the gameplay is often communicated through visuals. We present LEVI, a standalone adaptive board game system (ABGs) ...
  • Multimedia Showdown: A Comparative Analysis of Audio, Video and Avatar-Based Communication 

    Tu, Joseph; Grinberg, Arielle; Hancock, Mark; Nacke, Lennart (Association for Computing Machinery, 2023-08-03)
    Our new work culture relies heavily on online meetings and computer-mediated communication (CMC). However, making an online meeting engaging while keeping communication productive is a major challenge. We collected ...
  • TIGER: Tor Traffic Generator for Realistic Experiments 

    Lopes, Daniela; Castro, Daniel; Barradas, Diogo; Santos, Nuno (Workshop on Privacy in the Electronic Society, 2023-09-25)
    Tor is the most widely adopted anonymity network, helping safeguard the privacy of Internet users, including journalists and human rights activists. However, effective attacks aimed at deanonymizing Tor users' remains a ...
  • A First Look at Generating Website Fingerprinting Attacks via Neural Architecture Search 

    Singh, Prabhjot; Arun Naik, Shreya; Malekghaini, Navid; Barradas, Diogo; Limam, Noura (Workshop on Privacy in the Electronic Society, 2023-11-26)
    An adversary can use website fingerprinting (WF) attacks to breach the privacy of users who access the web through encrypted tunnels like Tor. These attacks have increasingly relied on the use of deep neural networks (DNNs) ...
  • Distributed Multi-Robot Coverage Control of Non-Convex Environments With Guarantees 

    Smith, Stephen L.; Asghar, Ahmad Bilal; Sadeghi Yengejeh, Armin (IEEE, 2022-09-28)
    In this article, we revisit the problem of distributed coverage with a fleet of robots in convex and nonconvex environments. In the majority of approaches for this problem, the environment is partitioned, each robot is ...
  • A Composite Rigid Double Cantilever Beam Specimen for Assessing the Traction–Separation Response of Mode I Delamination in Composite Laminates 

    Hartlen, Devon; Montesano, John; Cronin, Duane (Springer, 2023-01-16)
    Background Interlaminar delamination is a common damage mechanism in composite laminates that can lead to structural failure. Assessment using contemporary numerical modeling techniques requires delamination behavior as ...
  • Regression-based Monte Carlo Integration 

    Salaun, Corentin; Gruson, Adrien; Hua, Binh-Son; Hachisuka, Toshiya; Singh, Gurprit (Association for Computing Machinery, 2022-07)
    Monte Carlo integration is typically interpreted as an estimator of the expected value using stochastic samples. There exists an alternative interpretation in calculus where Monte Carlo integration can be seen as estimating ...
  • A Monte Carlo Method for Fluid Simulation 

    Rioux-Lavoie, Damien; Sugimoto, Ryusuke; Ozdemir, Tumay; Shimada, Naoharu H.; Batty, Christopher; Nowrouzezahrai, Derek; Hachisuka, Toshiya (Association for Computing Machinery, 2022-12)
    We present a novel Monte Carlo-based fluid simulation approach capable of pointwise and stochastic estimation of fluid motion. Drawing on the Feynman-Kac representation of the vorticity transport equation, we propose a ...
  • A Practical Walk-on-Boundary Method for Boundary Value Problems 

    Sugimoto, Ryusuke; Chen, Terry; Jiang, Yiti; Batty, Christopher; Hachisuka, Toshiya (Association for Computing Machinery, 2023-08)
    We introduce the walk-on-boundary (WoB) method for solving boundary value problems to computer graphics. WoB is a grid-free Monte Carlo solver for certain classes of second order partial differential equations. A similar ...
  • Prime Divisors of the Number of Rational Points on Elliptic Curves with Complex Multiplication 

    Liu, Yu-Ru (Wiley, 2005)
    Let E/Q be an elliptic curve. For a prime p of good reduction, let E(Fp) be the set of rational points defined over the finite field Fp. Denote by ω(#E(Fp)) the number of distinct prime divisors of #E(Fp). For an elliptic ...
  • Bounds on 10th moments of (x, x^3) for ellipsephic sets 

    Anderson, Theresa C.; Hu, Bingyang; Liu, Yu-Ru; Talmage, Alan (University of Waterloo, 2023)
    Let A be an ellipsephic set which satis es digital restrictions in a given base. Using the method developed by Hughes and Wooley, we bound the number of integer solutions to the system of equations X2 i=1 􀀀 x3i 􀀀 ...
  • Equidistribution of Polynomial Sequences in Function Fields, with Applications 

    Hoang Le, Thai; Liu, Yu-Ru; Wooley, Trevor D. (University of Waterloo, 2023)
    We provide a function field analog of Weyl's classical theorem on equidistribution of polynomial sequences. Our result covers the case in which the degree of the polynomial is greater than or equal to the characteristic ...
  • On the number of irreducible factors with a given multiplicity in function fields 

    Das, Sourabhashis; Elma, Ertan; Kuo, Wentang; Liu, Yu-Ru (Elsevier, 2023-12)
    Let k ≥ 1 be a natural number and f ∈ Fq[t] be a monic polynomial. Let ωk(f) denote the number of distinct monic irreducible factors of f with multiplicity k. We obtain asymptotic estimates for the first and the second ...
  • Sieve Methods in Random Graph Theory 

    Liu, Yu-Ru; Saunders, J.C. (Springer, 2023-04-03)
    In this paper, we apply the Turán sieve and the simple sieve developed by R. Murty and the first author to study problems in random graph theory. In particular, we obtain upper and lower bounds on the probability of a ...
  • Number of prime factors with a given multiplicity 

    Elma, Ertan; Liu, Yu-Ru (Cambridge University Press, 2022-03)
    Let k ⩾ 1 be a natural number and ωk (n) denote the number of distinct prime factors of a natural number n with multiplicity k. We estimate the first and second moments of the functions ωk with k ⩾ 1. Moreover, we prove ...
  • The shifted Turan sieve method on tournaments II 

    Kuo, Wentang; Liu, Yu-Ru; Ribas, Savio; Zhou, Kevin (Elsevier, 2021-12)
    In a previous work [5], we developed the shifted Turán sieve method on a bipartite graph and applied it to problems on cycles in tournaments. More precisely, we obtained upper bounds for the number of tournaments which ...
  • The Shifted Turan Sieve Method on Tournaments 

    Kuo, Wentang; Liu, Yu-Ru; Ribas, Savio; Zhou, Kevin (Cambridge University Press, 2019)
    Abstract. We construct a shi ed version of the Turán sieve method developed by R. Murty and the second author and apply it to counting problems on tournaments. More precisely, we obtain upper bounds for the number of ...
  • A Prime Analogue of Roth's Theorem in Function Fields 

    Liu, Yu-Ru; Spencer, Craig V. (Springer New York, 2015)
    Abstract. Let Fq[t] denote the polynomial ring over the nite eld Fq, and let PR denote the subset of Fq[t] containing all monic irreducible polynomials of degree R. For non-zero elements r = (r1; r2; r3) of Fq satisfying ...
  • Multidimensional Vinogradov-type Estimates in Function Fields 

    Kuo, Wentang; Liu, Yu-Ru; Zhao, Xiaomei (Cambridge University Press, 2014)
    Let Fq[t] denote the polynomial ring over the finite field Fq. We employ Wooley’s new efficient congruencing method to prove certain multidimensional Vinogradov-type estimates in Fq[t]. These results allow us to apply a ...
  • On sets of polynomials whose difference set contains no squares 

    Hoang Le, Thai; Liu, Yu-Ru (Institute of Mathematics: Polish Academy of Sciences, 2013)
    Let Fq[t] be the polynomial ring over the finite field Fq, and let GN be the subset of Fq[t] containing all polynomials of degree strictly less than N. Define D(N) to be the maximal cardinality of a set A⊆GN for which A−A ...

View more


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