## Search

Now showing items 11-20 of 697

#### Nonlinear Dimensionality Reduction with Side Information

(University of Waterloo, 2006)

In this thesis, I look at three problems with important applications in data processing. Incorporating side information, provided by the user or derived from data, is a main theme of each of these problems. <br /><br ...

#### A Views-Based Design Framework for Web Applications

(University of Waterloo, 2002)

Web application design is a broad term that refers to any aspect of designing a Web application, including designing Web interfaces to data. There are a number of commercial software tools available that employ various ...

#### The Continuum Architecture: Towards Enabling Chaotic Ubiquitous Computing

(University of Waterloo, 2005)

Interactions in the style of the ubiquitous computing paradigm are possible today, but only in handcrafted environments within one administrative and technological realm. This thesis describes an architecture (called ...

#### Struts2JSF: Framework Migration in J2EE Using Framework Specific Modeling Languages

(University of Waterloo, 2007-05-16)

Java 2 Enterprise Edition is a portable, robust, scalable and secure platform for enterprise
software development based on Java technologies, and embraces open standards through
the Java Community Process (JCP). J2EE ...

#### A protocol for constructing a domain-specific ontology for use in biomedical information extraction using lexical-chaining analysis

(University of Waterloo, 2007-01-19)

In order to do more semantics-based information extraction, we require specialized domain models. We develop a hybrid approach for constructing such a domain-specific ontology, which integrates key concepts from the ...

#### Automated Landscape Painting in the Style of Bob Ross

(University of Waterloo, 2007-04-18)

This thesis presents a way of automatically generating a landscape painting in the artistic style of Bob Ross. First, a relatively simple, yet effective and versatile, painting model is presented. The brushes of the ...

#### Software Simulation of 5-Axis CNC Milling using Multidirectional Heightmaps

(University of Waterloo, 2010-09-22)

Machinists often simulate a part program to verify its correctness, since mistakes
can cause damage to the part, machine, oneself, or others. A popular approach for
part program simulation involves representing the stock ...

#### Homologous Gene Finding with a Hidden Markov Model

(University of Waterloo, 2007-01-12)

The homology search problem and the gene finding problem are two fundamental problems in bioinformatics. The homology search problem is to find the homologous regions of two biological sequences; the gene finding problem ...

#### On the Application of Photoacoustic Absorption Spectral Data to the Modeling of Leaf Optical Properties

(University of Waterloo, 2007-04-27)

Due to the importance of plants in the Earth's ecosystem, their photobiological responses have become the subject of extensive research in life sciences. Leaf optical models have been developed to assist in the analysis ...

#### Reconstruction and Visualization of Polyhedra Using Projections

(University of Waterloo, 2005)

Two types of problems are studied in this thesis: reconstruction and visualization of polygons and polyhedra. <br /><br /> Three problems are considered in reconstruction of polygons and polyhedra, given a set of projection characteristics. The first problem is to reconstruct a closed convex polygon (polyhedron) given the number of visible edges (faces) from each of a set of directions

**S**. The main results for this problem include the necessary and sufficient conditions for the existence of a polygon that realizes the projections. This characterization gives an algorithm to construct a feasible polygon when it exists. The other main result is an algorithm to find the maximum and minimum size of a feasible polygon for the given set**S**. Some special cases for non-convex polygons and for perspective projections are also studied. <br /><br /> For reconstruction of polyhedra, it is shown that when the projection directions are co-planar, a feasible polyhedron (i. e. a polyhedron satisfying the projection properties) can be constructed from a feasible polygon and vice versa. When the directions are covered by two planes, if the number of visible faces from each of the directions is at least four, then an algorithm is presented to decide the existence of a feasible polyhedron and to construct one, when it exists. When the directions see arbitrary number of faces, the same algorithm works, except for a particular sub-case. <br /><br /> A polyhedron is, in general, called equiprojective, if from any direction the size of the projection or the projection boundary is fixed, where the "size" means the number of vertices, edge, or faces. A special problem on reconstruction of polyhedra is to find all equiprojective polyhedra. For the case when the size is the number of vertices in the projection boundary, main results include the characterization of all equiprojective polyhedra and an algorithm to recognize them, and finding the minimum equiprojective polyhedra. Other measures of equiprojectivity are also studied. <br /><br /> Finally, the problem of efficient visualization of polyhedra under given constraints is considered. A user might wish to find a projection that highlights certain properties of a polyhedron. In particular, the problem considered is given a set of vertices, edges, and/or faces of a convex polyhedron, how to determine all projections of the polyhedron such that the elements of the given set are on the projection boundary. The results include efficient algorithms for both perspective and orthogonal projections, and improved adaptive algorithm when only edges are given and they form disjoint paths. A related problem of finding all projections where the given edges, faces, and/or vertices are not on the projection boundary is also studied....