UWSpace

UWSpace is the University of Waterloo’s institutional repository for the free, secure, and long-term home of research produced by faculty, students, and staff.

Depositing Theses/Dissertations or Research to UWSpace

Are you a Graduate Student depositing your thesis to UWSpace? See our Thesis Deposit Help and UWSpace Thesis FAQ pages to learn more.

Are you a Faculty or Staff member depositing research to UWSpace? See our Waterloo Research Deposit Help and Self-Archiving pages to learn more.

Photo by Waterloo staff

Communities in UWSpace

Select a community to browse its collections.

Recent Submissions

  • Thumbnail Image
    Item type: Item ,
    The Grail Papers
    (University of Waterloo, 1994-03) Raymond, Darrell; Wood, Derick
    Grail is a package for computing with finite-state machines and regular expressions, written in C++. Grail supports input and output of textual descriptions of automata and regular expressions, conversions between machines and regular expressions, and other operations. Grail can be used as a set of shell-callable processes, a library of functions, or as individual C++ classes. Version 2.0 of Grail supports parameterizable machines and expressions. This collection of papers includes a description of the history and design of Grail, a user's guide, a programmer's guide, and the main pages for each of Grail's filters.
  • Thumbnail Image
    Item type: Item ,
    Some numerical results on algorithms for Sturm-Liouville problems
    (University of Waterloo, 1994-01) Ji, Xingzhi R.
    For the numerical solution of Sturm-Liouville eigenvalue problems, finite difference methods and Prufer methods are two kinds of popular methods. However, the conditions under which each method is more efficient are not obvious. The experimental results reported in this paper show: (1) The relative efficiency of the methods depend on the desired accuracy; (2) Finite difference methods, with correction techniques, remain effective even for eigenvalues with higher oscillation number.
  • Thumbnail Image
    Item type: Item ,
    Parallel program and asynchronous circuit design
    (University of Waterloo, 1994-03-30) Ebergen, Jo C.; Segers, John; Benko, Igor
    Asynchronous circuit design is a beautiful application area for any formalism that can reason about parallelism. By means of two small, but challenging, exercises we illustrate the similarities and differences between parallel program and asynchronous circuit design. The exercises are simple to state and have many solutions, which are sometimes surprisingly efficient. They all illustrate many aspects of asynchronous circuit design. For each exercise we present several solutions, which are analyzed with respect to delay assumptions, safety, progress, and performance issues. We also mention some open problems.
  • Thumbnail Image
    Item type: Item ,
    Transaction scheduling in dynamic composite multidatase systems
    (University of Waterloo, 1994-03) Bradshaw, Dexter P.; Larson, Per-Ake; Slonim, Jacob
    Multidatabase systems based on a single monolithic multidatabase server are not realistic. Their performance and administration do not scale with increases in the radius of service or the number of component databases under their control. We propose that a composite multidatabase architecture that consists of multiple, possibly heterogeneous, peer multidatabase servers distributed on a communications network is inevitable. Global transactions should be able to span multiple multidatabase servers, sometimes forcing multidatabase servers to act as component database systems. Particular focus is given to the problem of guaranteeing the correct execution of interleaving global transactions across multiple multidatabase systems. Correctness is based on global serializability. Three algorithms for maintaining global serializability through transaction ordering during dynamic multidatabase composition are proposed. We examine the restrictions of these algorithms and the scalability of their performance.
  • Thumbnail Image
    Item type: Item ,
    Feature oriented composition of B-Spline surfaces
    (University of Waterloo, 1995-03) Barghiel, Cristin
    Detailed features are added to composite spline surfaces in a multi-layered fashion by means of an efficient displacement scheme. The feature orientation is arbitrary, and the underlying domains may be partially overlapping and non-linearly transformed. By mapping only the control vertices, defined as displacement vectors in a diffuse co-ordinate system, we can manipulate the pasted elements in real-time, independently or as a whole. The procedure, known as pasting, is more than a refinement instrument. It makes possible the rendering of a surface composition selectively, and this expedites the rendering process. It can be used to model surfaces by interactively changing displacement, control vertices, or the domain layout. Base surfaces may serve as sliding paths for pasted clusters whose shape and motion are determined by the underlying topography, resulting in an organic motion effect. Pasting also applies to higher-dimension entities, which may incorporate non-geometric components, such as colour, opacity or brightness.