CS Theses & Dissertations 2002

For 2002 graduation dates (in alphabetical order by last name):

IP multicast in MPLS networks
Chan, Siu Chi Faustina
URI : http://hdl.handle.net/2429/12041
Degree : Master of Science - MSc
Graduation Date : 2002-05

Evaluation of activation based software license enforcement
Afonin, Oleg
URI : http://hdl.handle.net/2429/12321
Degree : Master of Science - MSc
Graduation Date : 2002-11

A hierarchical fault-tolerance framework for Mobile Intelligent Agent Systems
Chen, Jian
URI : http://hdl.handle.net/2429/12049
Degree : Master of Science - MSc
Graduation Date : 2002-05

Rigid body simulation with contact and constraints
Cline, Michael
URI : http://hdl.handle.net/2429/12756
Degree : Master of Science - MSc
Graduation Date : 2002-11

Aspects of incremental programming
De Alwis, Brian Simon
URI : http://hdl.handle.net/2429/12021
Degree : Master of Science - MSc
Graduation Date : 2002-05

Mining for co-occurring motion trajectories:  sport analysis
Dimitrijevic, Maja
URI : http://hdl.handle.net/2429/12060
Degree : Master of Science - MSc
Graduation Date : 2002-05

Interactive directed exploration for mobile robots
Elinas, Pantelis
URI : http://hdl.handle.net/2429/12028
Degree : Master of Science - MSc
Graduation Date : 2002-05

A study of haptic icons
Enriquez, Mario
URI : http://hdl.handle.net/2429/12447
Degree : Master of Science - MSc
Graduation Date : 2002-11

Animation of reactive fluids
Gates, William Frank
URI : http://hdl.handle.net/2429/12986
Degree : Doctor of Philosophy – PhD

Graduation Date : 2002-05This thesis presents a general method for the integrated computer animation of the shape and shading of multiple reactive fluids in complex environments. This method advances the state of the art in fluid animation in three basic ways. First, it applies to a much larger class of fluid phenomena than previously addressed in computer graphics: both gases and liquids containing chemically reactive species. Second, it integrates a simple yet powerful procedural animation method for modelling both chemical and thermal reactions and their effects on the appearance and behaviour of simulated fluids. Third, and perhaps most significantly, it provides greater control: the desired flow can be specified at any location as well as the degree to which the simulation should be constrained to match it. We use the Navier-Stokes equations for incompressible flow as a general model of fluid motion and numerically solve these equations with finite differences on a fixed, uniform grid using techniques adapted from computational fluid dynamics for the specific requirements of computer animation. We illustrate the effectiveness of our method by applying it to a number of scenarios that would be difficult to animate using existing techniques.

Computational aspects of Escher tilings
Gethner, Ellen
URI : http://hdl.handle.net/2429/12987
Degree : Doctor of Philosophy - PhD
Graduation Date : 2002-05

At the heart of the ideas of the work of Dutch graphic artist M.C. Escher is the idea of automation. We consider one such problem that was inspired by some of his earlier and lesser known work [MWS96, Sc90, Sc97, Er76, Es86]. From a finite set of (possibly overlapping) connected regions within a unit square (Figure 1), is it possible to make a prototile with concatenated and colored copies of the original square tile (Figure 2), such that the pattern in the plane arising from tiling with the prototile • uniformly colors connected components, and • distinctly colors overlapping components (Figure 3)? The answer is yes, that such a prototile exists for any (suitably defined) design confined to a unit square. We present a proof of existence and an efficient (and implementable) algorithm to construct prototiles. Moreover, in the existence proof, it will become apparent that a prototile for a given design may not be unique (up to concatenation). In such a situation, there are infinitely many "measurably different" prototiles. The secret of each design is encoded by either one or infinitely many (number theoretic) lattices; we will show how to extract all possible lattices by using techniques from graph theory and graph algorithms. Finally, from a certain point of view, the prototiles that we construct are canonical. We begin an analysis of the canonical prototiles by making a connection from lattices to binary quadratic forms to class number.

Dependencies in the context of aspect-oriented programming
Gudmundson, Stephan Einar
URI : http://hdl.handle.net/2429/12067
Degree : Master of Science - MSc
Graduation Date : 2002-05

Measuring and comparing human walking motions for computer animation
Harrison, James Erwin
URI : http://hdl.handle.net/2429/16777
Degree : Master of Science - MSc
Graduation Date : 2002-05

Manipulation and resynthesis of environmental sounds with natural wavelet grains
Hoskinson, Reynald Antoine
URI : http://hdl.handle.net/2429/12104
Degree : Master of Science - MSc
Graduation Date : 2002-05

Probabilistic evidence combination for robust real time finger recognition and tracking
Jennings, Cullen Frishman
URI : http://hdl.handle.net/2429/13499
Degree : Doctor of Philosophy - PhD
Graduation Date : 2002-05

This thesis sets out a Bayesian approach to the robust combination of measurements from multiple sensors in different measurement spaces. Classical least squares optimization is used inside a sequential Monte Carlo approach to find the most likely local estimate. The local optimization speeds up the system, while the Monte Carlo approach improves robustness in finding the globally optimal solution. Models are simultaneously fit to all the sensor data. A statistical approach is taken to determine when inputs are failing and should be ignored. To demonstrate the overall approach described in this thesis, the 3D position and orientation of highly over-constrained models of deformable objects - fingers - are tracked. Accurate results are obtained by combining features of color and stereo range images. The multiple sources of information combined in this work include stereo range images, color segmentations, shape information and various constraints. The system is accurate and robust; it can continue to work even when one of the sources of information is completely failing. The system is practical in that it works in real time and can deal with complex moving backgrounds that have many edges, changing lighting, and other real world vision challenges.

Outliers and data mining: finding exceptions in data
Knorr, Edwin Max
URI : http://hdl.handle.net/2429/12783
Degree : Doctor of Philosophy - PhD
Graduation Date : 2002-05

Our thesis is that we can efficiently identify meaningful outliers in large, multidimensional datasets. In particular, we introduce and study the notion and utility of distance-based outliers (DB-outliers). First, we focus on outlier identification, and present nested-loop, index-based, and cell-based algorithms. For datasets that are mainly disk-resident, we present another version of the cell-based algorithm that guarantees at most 3 passes over a dataset. We provide experimental results showing that these cell-based algorithms are by far the best for 4 or fewer dimensions. Second, we focus on the computation of intensional knowledge, that is, we provide a description or an explanation of why an identified outlier is exceptional. We provide an algorithm to compute the "strongest" outliers in a dataset (i.e., outliers that are dominant for certain attributes or dimensions). Our notion of strongest outliers allows significant pruning to take place in the search tree. We also define the notion of "weak" outliers. With respect to the computation of intensional knowledge, we develop naive, semi-naive, and I/O optimized algorithms. The latter class of algorithms intelligently schedules I/O's, and achieves optimization via page sharing. Third, we focus on robust space transformations to achieve meaningful results when mining Ac-D datasets for Z?.B-outliers. Robust estimation is used to: (a) account for differences among attributes in scale, variability, and correlation, (b) account for the effects of outliers in the data, and (c) prevent undesirable masking and flooding during the search for outliers. We propose using a robust space transformation called the Donoho-Stahel estimator (DSE), and we show key properties of the DSE. Of particular importance to data mining applications involving large or dynamic datasets is the stability property, which says that in spite of frequent updates, the estimator does not: (a) change much, (b) lose its usefulness, or (c) require re-computation. We develop randomized algorithms and evaluate how well they perform empirically. The novel algorithm that we develop is called the Hybrid-Random algorithm, which can significantly outperform the other DSE algorithms for moderate-high levels of recall. Experimental results using real-world data are included to show the utility and efficiency of Di>-outiiers.

Behavioural Concern Modelling for Software Change Tasks
Lai, Albert
URI : http://hdl.handle.net/2429/12188
Degree : Master of Science - MSc
Graduation Date : 2002-05

A robust linear program solver for projectahedra
Laza, Marius Dorin
URI : http://hdl.handle.net/2429/12127
Degree : Master of Science - MSc
Graduation Date : 2002-05

Tracking the joints of articulated objects without an a priori shape model
Leonard, Simon
URI : http://hdl.handle.net/2429/12131
Degree : Master of Science - MSc
Graduation Date : 2002-05

Agent-based network management system
Luo, Huawen (Laura)
URI : http://hdl.handle.net/2429/13035
Degree : Master of Science - MSc
Graduation Date : 2002-11

Fast failure recovery in MPLS networks
Luo, Qingsheng (Robin)
URI : http://hdl.handle.net/2429/13034
Degree : Master of Science - MSc
Graduation Date : 2002-11

S-R-T division algorithms as dynamical systems
McCann, Mark
URI : http://hdl.handle.net/2429/12179
Degree : Master of Science - MSc
Graduation Date : 2002-05

GEA: a toolkit for gene expression analysis
Phan, Min
URI : http://hdl.handle.net/2429/13383
Degree : Master of Science - MSc
Graduation Date : 2002-11

Open Loop Pointing in Virtual Environment
Po, Barry Alan
URI : http://hdl.handle.net/2429/13382
Degree : Master of Science - MSc
Graduation Date : 2002-11

Inter-server Communication in the Mammoth File System
Pomkoski, Jody James
URI : http://hdl.handle.net/2429/13380
Degree : Master of Science - MSc
Graduation Date : 2002-11

QJBrowser - a query baased approach to explore concerns
Rajagopalan, Rajeswari
URI : http://hdl.handle.net/2429/13437
Degree : Master of Science - MSc
Graduation Date : 2002-11

Equalizing filter design for cross-talk cancellation
Ren, Jihong
URI : http://hdl.handle.net/2429/13450
Degree : Master of Science - MSc
Graduation Date : 2002-05

Random marks on paper: non-photorealistic rendering with small primitives
Secord, Adrian
URI : http://hdl.handle.net/2429/13431
Degree : Master of Science - MSc
Graduation Date : 2002-11

CNJ: a visual programming environment for constraint nets
Song, Fengguang
URI : http://hdl.handle.net/2429/13068
Degree : Master of Science - MSc
Graduation Date : 2002-11

Calibrating head-coupled virtual reality systems
Stevenson, Alexander
URI : http://hdl.handle.net/2429/12257
Degree : Master of Science - MSc
Graduation Date : 2002-05

A clique tree algorithm exploiting context specific independence
Tung, Leslie
URI : http://hdl.handle.net/2429/13264
Degree : Master of Science - MSc
Graduation Date : 2002-11

An XML-based tool for verification of multi-vendor MPLS router configuration
Wang, Hui (Wendy)
URI : http://hdl.handle.net/2429/13329
Degree : Master of Science - MSc
Graduation Date : 2002-11

An Introduction to Component Technology and Middleware
Wilkins, Matthew
Master’s essay available in print and online : http://bibrrs.library.ubc.ca:7108/vwebv/holdingsInfo?bibId=131824
Degree : Master of Science - MSc
Graduation Date : 2002-11

The online and offline properties of routing algorithms in MPLS
Wong, Serene Wing Hang
URI : http://hdl.handle.net/2429/13049
Degree : Master of Science - MSc
Graduation Date : 2002-11

Implementation of DAFS on the Linux platform
Xu, Yue (William)
URI : http://hdl.handle.net/2429/13052
Degree : Master of Science - MSc
Graduation Date : 2002-11

The shortest disjunctive normal forms of Boolean functions by reducing the number of arguments
Yung, Ho Sen
URI : http://hdl.handle.net/2429/12280
Degree : Master of Science - MSc
Graduation Date : 2002-05

MPI collective operations over Myrinet
Zhang, Qianfeng (Feng)
URI : http://hdl.handle.net/2429/13039
Degree : Master of Science - MSc
Graduation Date : 2002-05



Find us on Twitter

a place of mind, The University of British Columbia

 

ICICS/CS Building 201-2366 Main Mall
Vancouver, B.C. V6T 1Z4 Canada
Tel: 604-822-3061 | Fax: 604-822-5485
General: help@cs.ubc.ca
Undergrad program: undergrad-info@cs.ubc.ca
Graduate program: grad-info@cs.ubc.ca

Emergency Procedures | Accessibility | Contact UBC | © Copyright The University of British Columbia