Now showing items 1052-1071 of 2745

    • Global Land Use Implications of Dietary Trends 

      Rizvi, Sarah; Pagnutti, Chris; Fraser, Evan; Bauch, Chris T.; Anand, Madhur (Cold Spring Harbor Laboratory, 2017-09-28)
      Global food security and agricultural land management represent two urgent and intimately related challenges that humans must face. We quantify the changes in the global agricultural land footprint if the world were to ...
    • Global land use implications of dietary trends 

      Rizvi, Sarah; Pagnutti, Chris; Fraser, Evan; Bauch, Chris T.; Anand, Madhur (PLOS One, 2018-08-08)
      Global food security and agricultural land management represent two urgent and intimately related challenges that humans must face. We quantify the changes in the global agricultural land footprint if the world were to ...
    • gLOP: A Cleaner Dirty Model for Multitask Learning 

      Rose, Rhiannon (University of Waterloo, 2014-08-22)
      Multitask learning (MTL) was originally defined by Caruana (1997) as "an approach to inductive transfer that improves learning for one task by using the information contained in the training signals of other related tasks". ...
    • Goldberg's conjecture is true for random multigraphs 

      Haxell, Penny; Krivelevich, Michael; Kronenberg, Gal (Elsevier, 2019-09)
      In the 70s, Goldberg, and independently Seymour, conjectured that for any multigraph G, the chromatic index χ′(G) satisfies χ′(G) ≤ max{∆(G)+1,⌈ρ(G)⌉}, where ρ(G) = max\{\frac {e(G[S])}{\lfloor|S|/2\rfloor} \mid S\subseteq ...
    • Gradual C Programming for Typed Lua 

      Turas, Rafi (University of Waterloo, 2019-01-22)
      The work presented in this thesis deals with the problem of enhancing the performance of dynamically-typed programming languages by integrating features from statically-typed programming languages. Statically-typed languages ...
    • A Gradual Non-Convexation Penalty Method for Minimizing VaR 

      Xi, Jiong (University of Waterloo, 2012-05-08)
      This thesis investigates the portfolio optimization problem using Value-at-Risk (VaR) as a risk measure, when m sample scenarios are given. Minimizing VaR of a portfolio is computationally difficult: it is non-convex, ...
    • Gradual Pluggable Typing in Java 

      Brotherston, Daniel, Scott (University of Waterloo, 2016-04-27)
      Gradual typing provides the ability to safely mix untyped or dynamically typed code with statically typed code while maintaining, within the statically typed portion, the guarantees claimed by the static typing. It is ...
    • Graph C*-algebras and the Abelian Core 

      Eifler, Kari (University of Waterloo, 2016-08-26)
      We may associate to a C*-algebra to the directed graph E by associating edges to partial isometries and vertices to pairwise orthogonal Hilbert spaces which satisfy some additional conditions. Such graph algebras were first ...
    • Graph Editing to a Given Neighbourhood Degree List is Fixed-Parameter Tractable 

      Subramanya, Vijay (University of Waterloo, 2016-10-26)
      Graph editing problems have a long history and have been widely studied, with applications in biochemistry and complex network analysis. They generally ask whether an input graph can be modified by inserting and deleting ...
    • Graph-Based Fracture Models for Rigid Body Explosions 

      Socha, Jessica (University of Waterloo, 2005)
      Explosions are one of the most powerful and devastating natural phenomena. The pressure front from the blast wave of an explosion can cause fracture of objects in its vicinity and create flying debris. In this thesis, ...
    • Graph-theoretic Properties of Control Flow Graphs and Applications 

      Kumar, Neeraj (University of Waterloo, 2015-08-25)
      This thesis deals with determining appropriate width parameters of control flow graphs so that certain computationally hard problems of practical interest become efficiently solvable. A well-known result of Thorup states ...
    • The Graphs of HU+00E4ggkvist & Hell 

      Roberson, David E. (University of Waterloo, 2009-01-19)
      This thesis investigates HU+00E4ggkvist & Hell graphs. These graphs are an extension of the idea of Kneser graphs, and as such share many attributes with them. A variety of original results on many different properties of ...
    • Green’s Function for Poisson Equation in Layered Nano-Structures including Graphene 

      Kang, Naijing (University of Waterloo, 2015-05-04)
      The purpose of this thesis is to focus on the electrostatic properties of graphene-based nanostructures consisting of different materials, as well as their interactions with external electric charges, by solving the boundary ...
    • Grey Level Visual Cryptography for General Access Structures 

      MacPherson, Lesley (University of Waterloo, 2002)
      Visual cryptography, first introduced by Naor and Shamir, allows a secret (black and white) image to be encoded and distributed to a set of participants such that certain predefined sets of participants may reconstruct the ...
    • A Grouped Hamming Network 

      Logan, Bryan (University of Waterloo, 2010-08-30)
      A distributed hash table (DHT) is a type of peer-to-peer (P2P) network that, like traditional hash tables, maps keys to values. Unlike traditional hash tables, however, the data is distributed across a network with each ...
    • Gröbner Bases Theory and The Diamond Lemma 

      Ge, Wenfeng (University of Waterloo, 2006)
      Commutative Gröbner bases theory is well known and widely used. In this thesis, we will discuss thoroughly its generalization to noncommutative polynomial ring <em>k</em><<em>X</em>> which is also an associative free ...
    • GRS: Combining Generation and Revision in Unsupervised Sentence Simplification 

      Dehghan, Mohammad (University of Waterloo, 2022-08-30)
      Text simplification is a task in the natural language processing field that alters a given text to reduce the structural and lexical complexity of the text while preserving the underlying meaning. We can classify existing ...
    • Guidance Under Uncertainty: Employing a Mediator Framework in Bilateral Incomplete-Information Negotiations 

      Shew, James (University of Waterloo, 2008-09-24)
      Bilateral incomplete-information negotiations of multiple issues present a difficult yet common negotiation problem that is complicated to solve from a mechanism design perspective. Unlike multilateral situations, where ...
    • A guide to F-automatic sets 

      Hawthorne, Christopher (University of Waterloo, 2021-09-08)
      A self-contained introduction to the theory of F-automatic sets is given. Building on [Bell, Moosa, F-sets and finite automata, Journal de théorie des nombres de Bordeaux, 2019], contributions are made to both the foundations ...
    • Guided Testing of Concurrent Programs Using Value Schedules 

      Chen, Jun (University of Waterloo, 2009-09-29)
      Testing concurrent programs remains a difficult task due to the non-deterministic nature of concurrent execution. Many approaches have been proposed to tackle the complexity of uncovering potential concurrency bugs. ...


      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