Browsing Mathematics (Faculty of) by Issue Date
Now showing items 41-60 of 2994
-
Autonomous Cooperating Web Crawlers
(University of Waterloo, 2002)A web crawler provides an automated way to discover web events ? creation, deletion, or updates of web pages. Competition among web crawlers results in redundant crawling, wasted resources, and less-than-timely discovery ... -
Some Functional Equations Connected with the Utility of Gains and Losses
(University of Waterloo, 2002)The behavioral properties shown by people when they make selections between different choices will be studied. Based on empirical and logical data a mathematical axiomatic model is built. D. Luce is a major ... -
Hamilton Paths in Generalized Petersen Graphs
(University of Waterloo, 2002)This thesis puts forward the conjecture that for <i>n</i> > 3<i>k</i> with <i>k</i> > 2, the generalized Petersen graph, <i>GP</i>(<i>n,k</i>) is Hamilton-laceable if <i>n</i> is even and <i>k</i> is odd, and it is ... -
Convergence Analysis of Generalized Primal-Dual Interior-Point Algorithms for Linear Optimization
(University of Waterloo, 2002)We study the zeroth-, first-, and second-order algorithms proposed by Tuncel. The zeroth-order algorithms are the generalization of the classic primal-dual affine-scaling methods, and have a strong connection with the ... -
Agile Architecture Recovery
(University of Waterloo, 2002)Many software development projects start with an existing code base that has to be tightly integrated into a new system. In order to make a robust system that will achieve the desired business goals, developers must be ... -
Digital Signature Scheme Variations
(University of Waterloo, 2002)A digital signature scheme is the process of signing an electronic message that can be transmitted over a computer network. Digital signatures provide message authentication that can be proved to a third party. With ... -
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 ... -
Selective Flooding in Ad Hoc Networks
(University of Waterloo, 2002)An ad hoc network is a collection of mobile wireless devices that cooperate with each other to route packets amongst themselves. The main difficulty in designing routing algorithms for such a network is the large number ... -
Probabilistic Program Analysis for Software Component Reliability
(University of Waterloo, 2002)Components are widely seen by software engineers as an important technology to address the "software crisis''. An important aspect of components in other areas of engineering is that system reliability can be estimated ... -
Volume Visualisation Via Variable-Detail Non-Photorealistic Illustration
(University of Waterloo, 2002)The rapid proliferation of 3D volume data, including MRI and CT scans, is prompting the search within computer graphics for more effective volume visualisation techniques. Partially because of the traditional association ... -
An Architecture for Geographically-Oriented Service Discovery on the Internet
(University of Waterloo, 2002)Most of the service discovery protocols available on the Internet are built upon its logical structure. This phenomenon can be observed frequently from the way in which they behave. For instance, Jini and SLP service ... -
Grey Level Visual Cryptography for General Access Structures
(University of Waterloo, 2002)Visual cryptography, first introduced by Naor and Shamir, allows a secret (black and white) image to be encoded and distributed to a set of participants such that certain predefined sets of participants may reconstruct the ... -
Applications of Bilinear Maps in Cryptography
(University of Waterloo, 2002)It was recently discovered by Joux [30] and Sakai, Ohgishi and Kasahara [47] that bilinear maps could be used to construct cryptographic schemes. Since then, bilinear maps have been used in applications as varied as ... -
Complex Bases, Number Systems and Their Application to Fractal-Wavelet Image Coding
(University of Waterloo, 2002)This thesis explores new approaches to the analysis of functions by combining tools from the fields of complex bases, number systems, iterated function systems (IFS) and wavelet multiresolution analyses (MRA). The ... -
Exploitation of Redundant Inverse Term Frequency for Answer Extraction
(University of Waterloo, 2002)An automatic question answering system must find, within a corpus,short factual answers to questions posed in natural language. The process involves analyzing the question, retrieving information related to the question, ... -
Continuous-time Quantum Algorithms: Searching and Adiabatic Computation
(University of Waterloo, 2002)One of the most important quantum algorithms is Grover's search algorithm [G96]. Quantum searching can be used to speed up the search for solutions to NP-complete problems e. g. 3SAT. Even so, the best known quantum ... -
Self-Dual Graphs
(University of Waterloo, 2002)The study of self-duality has attracted some attention over the past decade. A good deal of research in that time has been done on constructing and classifying all self-dual graphs and in particular polyhedra. We ... -
A Collapsing Method for Efficient Recovery of Optimal Edges
(University of Waterloo, 2002)In this thesis we present a novel algorithm, <I>HyperCleaning*</I>, for effectively inferring phylogenetic trees. The method is based on the quartet method paradigm and is guaranteed to recover the best supported edges ... -
Effects of Developmental Heuristics for Natural Language Learning
(University of Waterloo, 2003)Machine learning in natural language has been a widely pursued area of research. However, few learning techniques model themselves after human learning, despite the nature of the task being closely connected to human ... -
Uniqueness and Complexity in Generalised Colouring
(University of Waterloo, 2003)The study and recognition of graph families (or graph properties) is an essential part of combinatorics. Graph colouring is another fundamental concept of graph theory that can be looked at, in large part, as the recognition ...