Now showing items 1085-1104 of 3020

    • A Formalism for Visual Query Interface Design 

      Huo, Jiwen (University of Waterloo, 2009-01-15)
      The massive volumes and the huge variety of large knowledge bases make information exploration and analysis difficult. An important activity is data filtering and selection, in which both querying and visualization play ...
    • A Formalization of an Extended Object Model Using Views 

      Nova, Luis C. M. (University of Waterloo, 2000)
      Reuse of software designs, experience and components is essential to making substantial improvements in software productivity, development cost, and quality. However, the many facets of reuse are still rarely used in ...
    • Formalizing the Excluded Minor Characterization of Binary Matroids in the Lean Theorem Prover 

      Gusakov, Alena (University of Waterloo, 2024-01-23)
      A matroid is a mathematical object that generalizes the notion of linear independence of a set of vectors to an abstract independence of sets, with applications to optimization, linear algebra, graph theory, and algebraic ...
    • Formation Control of Multi-agent Systems via Impulsive Strategy 

      Liang, Zhanlue (University of Waterloo, 2023-09-08)
      Multi-agent systems (MASs) involving cooperative control problems such as consensus tracking of distributed networks, flocking control with obstacle avoidance, and attitude alignment have received a considerable amount of ...
    • FormlSlicer: A Model Slicing Tool for Feature-rich State-machine Models 

      Lai, Xiaoni (University of Waterloo, 2015-06-04)
      A model of the feature-oriented requirements of a software system usually contains a large number of non-trivial features; each feature may have unintended interactions with other features. It may be difficult to comprehend ...
    • Four-coloring P6-free graphs 

      Chudnovsky, Maria; Spirkl, Sophie; Zhong, Mingxian (Association for Computing Machinery, 2019)
      In this paper we present a polynomial time algorithm for the 4-COLORING PROBLEM and the 4-PRECOLORING EXTENSION problem restricted to the class of graphs with no induced six-vertex path, thus proving a conjecture of Huang. ...
    • The Fourier algebra of a locally trivial groupoid 

      Marti Perez, Laura Raquel (University of Waterloo, 2012-01-10)
      The goal of this thesis is to define and study the Fourier algebra A(G) of a locally compact groupoid G. If G is a locally compact group, its Fourier-Stieltjes algebra B(G) and its Fourier algebra A(G) were defined by ...
    • Fractional Imputation for Ordinal and Mixed-type Responses with Missing Observations 

      She, Xichen (University of Waterloo, 2017-01-12)
      This thesis addresses two essential aspects of large scale public-use data files involving ordinal and mixed-type responses with missing observations: (i) the creation of single complete data sets with imputation for missing ...
    • Fractional refinements of integral theorems 

      Moore, Benjamin (University of Waterloo, 2021-07-09)
      The focus of this thesis is to take theorems which deal with ``integral" objects in graph theory and consider fractional refinements of them to gain additional structure. A classic theorem of Hakimi says that for an ...
    • A Framework and Taxonomy of Videogame Playing Preferences 

      Fortes Tondello, Gustavo; Wehbe, Rina Renee; Orji, Rita; Ribeiro, Giovanni; Nacke, Lennart (Association for Computing Machinery, 2017-10-15)
      Player preferences for different gaming styles or game elements has been a topic of interest in human-computer interaction for over a decade. However, current models suggested by the extant literature are generally based ...
    • A Framework for Logical Structure Extraction from Software Requirements Documents 

      Rauf, Rehan (University of Waterloo, 2011-01-13)
      General purpose rich-text editors, such as MS Word are often used to author software requirements specifications. These requirements specifications contain many different logical structures, such as use cases, business ...
    • A Framework for Machine-Assisted Software Architecture Validation 

      Lichtner, Kurt (University of Waterloo, 2000)
      In this thesis we propose a formal framework for specifying and validating properties of software system architectures. The framework is founded on a model of software architecture description languages (ADLs) and uses ...
    • A Framework for Records Management in Relational Database Systems 

      Ataullah, Ahmed Ayaz (University of Waterloo, 2008-05-14)
      The problem of records retention is often viewed as simply deleting records when they have outlived their purpose. However, in the world of relational databases there is no standardized notion of a business record and its ...
    • A Framework for Resource Allocation in Time Critical Dynamic Environments Based on Social Welfare and Local Search and its Application to Healthcare 

      Shaft, Dean (University of Waterloo, 2014-02-14)
      This thesis provides an artificial intelligence approach for the problem of resource allocation in time-critical dynamic environments. Motivated by healthcare scenarios such as mass casualty incidents, we are concerned ...
    • A Framework for Software Component Interface Specification and Analysis 

      Hoyt, Matthew (University of Waterloo, 2001)
      Although markets are emerging for commercial off-the-shelf components (such as Sun JavaBeans), there are many barriers to widespread component adoption. This is due to the inherent `black-box' nature of software ...
    • A Framework for the Generation of Textures Representing Time-Dependent Changes in the Appearance of Dust Layers 

      Santos, Rebecca Linda Casinha (University of Waterloo, 2022-04-19)
      The perception of realism in computer generated images can be significantly enhanced by subtle visual cues. Among those, one can highlight the presence of dust on synthetic objects, which is often subject to temporal ...
    • Frameworks for Quantum Algorithms 

      Jeffery, Stacey (University of Waterloo, 2014-08-26)
      Due to the difficulty of constructing new quantum algorithms, frameworks that facilitate this construction are of great importance in quantum computing. These frameworks reduce the problem of coming up with a quantum ...
    • Free semigroup algebras and the structure of an isometric tuple 

      Kennedy, Matthew (University of Waterloo, 2011-06-28)
      An n-tuple of operators V=(V_1,…,V_n) acting on a Hilbert space H is said to be isometric if the corresponding row operator is an isometry. A free semigroup algebra is the weakly closed algebra generated by an isometric ...
    • FrictionalMonolith: A Monolithic Optimization-based Approach for Granular Flow with Contact-Aware Rigid-Body Coupling 

      Takahashi, Tetsuya; Batty, Christopher (Association for Computing Machinery, 2021)
      We propose FrictionalMonolith, a monolithic pressure-friction-contact solver for more accurately, robustly, and efficiently simulating two-way interactions of rigid bodies with continuum granular materials or inviscid ...
    • The Frobenius Problem in a Free Monoid 

      Xu, Zhi (University of Waterloo, 2009-08-21)
      Given positive integers c1,c2,...,ck with gcd(c1,c2,...,ck) = 1, the Frobenius problem (FP) is to compute the largest integer g(c1,c2,...,ck) that cannot be written as a non-negative integer linear combination of c1,c2,...,ck. ...

      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