Now showing items 1-20 of 794

    • Effcient Simulation of Message-Passing in Distributed-Memory Architectures 

      Demaine, Erik (University of Waterloo, 1996)
      In this thesis we propose a distributed-memory parallel-computer simulation system called PUPPET (Performance Under a Pseudo-Parallel EnvironmenT). It allows the evaluation of parallel programs run in a pseudo-parallel ...
    • Simulated Overloading using Generic Functions in Scheme 

      Cox, Anthony (University of Waterloo, 1997)
      This thesis investigates extending the dynamically-typed, functional programming language Scheme, with simulated overloading in order to permit the binding of multiple, distributed defnitions to function names. Overloading ...
    • Folding Orthogonal Polyhedra 

      Sun, Julie (University of Waterloo, 1999)
      In this thesis, we study foldings of orthogonal polygons into orthogonal polyhedra. The particular problem examined here is whether a paper cutout of an orthogonal polygon with fold lines indicated folds up into a simple ...
    • Static Conflict Analysis of Transaction Programs 

      Zhang, Connie (University of Waterloo, 2000)
      Transaction programs are comprised of read and write operations issued against the database. In a shared database system, one transaction program conflicts with another if it reads or writes data that another transaction ...
    • An Approximation Algorithm for Character Compatibility and Fast Quartet-based Phylogenetic Tree Comparison 

      Tsang, John (University of Waterloo, 2000)
      Phylogenetic analysis, or the inference of evolutionary history is done routinely by biologists and is one of the most important problems in systematic biology. In this thesis, we study two computational problems in ...
    • 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 Formalization of an Extended Object Model Using Views 

      Nova, Luis (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 ...
    • Hadez, a Framework for the Specification and Verification of Hypermedia Applications 

      Morales German, Daniel (University of Waterloo, 2000)
      In recent years, several methodologies for the development of hypermedia applications have been proposed. These methodologies are, primarily, guidelines to be followed during the design process. They also indicate what ...
    • Quantitative Testing of Probabilistic Phase Unwrapping Methods 

      Moran, Jodi (University of Waterloo, 2001)
      The reconstruction of a phase surface from the observed principal values is required for a number of applications, including synthetic aperture radar (SAR) and magnetic resonance imaging (MRI). However, the process of ...
    • 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 ...
    • Shortest Path Queries in Very Large Spatial Databases 

      Zhang, Ning (University of Waterloo, 2001)
      Finding the shortest paths in a graph has been studied for a long time, and there are many main memory based algorithms dealing with this problem. Among these, Dijkstra's shortest path algorithm is one of the most commonly ...
    • Modeling Protein Secondary Structure by Products of Dependent Experts 

      Cumbaa, Christian (University of Waterloo, 2001)
      A phenomenon as complex as protein folding requires a complex model to approximate it. This thesis presents a bottom-up approach for building complex probabilistic models of protein secondary structure by incorporating ...
    • A Scalable Partial-Order Data Structure for Distributed-System Observation 

      Ward, Paul (University of Waterloo, 2001)
      Distributed-system observation is foundational to understanding and controlling distributed computations. Existing tools for distributed-system observation are constrained in the size of computation that they can observe ...
    • COPIA: A New Software for Finding Consensus Patterns in Unaligned Protein Sequences 

      Liang, Chengzhi (University of Waterloo, 2001)
      Consensus pattern problem (CPP) aims at finding conserved regions, or motifs, in unaligned sequences. This problem is NP-hard under various scoring schemes. To solve this problem for protein sequences more efficiently,a ...
    • Topic-Oriented Collaborative Web Crawling 

      Chung, Chiasen (University of Waterloo, 2001)
      A <i>web crawler</i> is a program that "walks" the Web to gather web resources. In order to scale to the ever-increasing Web, multiple crawling agents may be deployed in a distributed fashion to retrieve web data ...
    • Automated Analysis of Unified Modeling Language (UML) Specifications 

      Tanuan, Meyer C. (University of Waterloo, 2001)
      The Unified Modeling Language (UML) is a standard language adopted by the Object Management Group (OMG) for writing object-oriented (OO) descriptions of software systems. UML allows the analyst to add class-level and ...
    • Multi-dimensional Interval Routing Schemes 

      Ganjali, Yashar (University of Waterloo, 2001)
      Routing messages between pairs of nodes is one of the most fundamental tasks in any distributed computing system. An Interval Routing Scheme (IRS) is a well-known, space-efficient routing strategy for routing messages ...
    • Folding and Unfolding 

      Demaine, Erik (University of Waterloo, 2001)
      The results of this thesis concern folding of one-dimensional objects in two dimensions: planar linkages. More precisely, a planar linkage consists of a collection of rigid bars (line segments) connected at their ...
    • Cache Oblivious Data Structures 

      Ohashi, Darin (University of Waterloo, 2001)
      This thesis discusses cache oblivious data structures. These are structures which have good caching characteristics without knowing Z, the size of the cache, or L, the length of a cache line. Since the structures do ...
    • Reliable Transport Performance in Mobile Environments 

      McSweeney, Martin (University of Waterloo, 2001)
      Expanding the global Internet to include mobile devices is an exciting area of current research. Because of the vast size of the Internet, and because the protocols in it are already widely deployed, mobile devices must ...

      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