- UVicSpace Home
- →
- Faculty of Engineering
- →
- Department of Computer Science
- →
- Theses (Computer Science)
- →
- Browsing Theses (Computer Science) by Submit Date
JavaScript is disabled for your browser. Some features of this site may not work without it.
Browsing Theses (Computer Science) by Submit Date
Now showing items 1-20 of 532
-
(2005-09-30)In this dissertation it is shown that abstract data types (ADTs) can be specified by the Classified Model (CM) specification language - a first-order Horn language with equality and sort "classification" assertations. It ...
-
(2005-10-28)ITPerl is a web authoring tool that enables users to add temporal features to intensional web pages. ITPerl adds temporal macros to IPerl, a Perl interface to the C++ intense library. ITPerl combines temporal and default ...
-
(2005-12-16)Consider the concept of the Utility Model [5]: the optimal allocation of resources of a server or network while meeting the absolute Quality of Service (QoS) requirements of users' multimedia sessions. Past algorithms and ...
-
(2006-09-27)Writing truly concurrent software is hard, scaling software to fully utilize hardware is one of the reasons why. One abstraction for increasing the scalability of systems software is clustered objects. Clustered objects ...
-
(2006-09-28)Many significant system extensions are hard to modularize. Consequently, their addition to a software system can jeopardize fundamental software engineering principles such as maintainability, understandability and ...
-
(2006-11-20)This dissertation explores a new approach to construct tools in the domain of reverse engineering. The approach uses already available software components -- such as off-the-shelf components and integrated development ...
-
(2007-06-11)An Euler diagram C = {c_1, c_2,..., c_n} is a collection of n simple closed curves (i.e., Jordan curves) that partition the plane into connected subsets, called regions, each of which is enclosed by a unique combination ...
-
(2007-06-27)Regular path queries (RPQ’s) are given by means of regular expressions and ask for matching patterns on labeled graphs. RPQ’s have recently received great attention in the context of semistructured data, which are data ...
-
(2007-07-05)Although theoretically practical algorithms for torus embedding exist, they have not yet been successfully implemented and their complexity may be prohibitive to their practicality. We describe a simple exponential algorithm ...
-
(2007-08-20)Regular path queries (RPQs), expressed as regular expressions over the alphabet of database edge-labels, are commonly used for guided navigation of graph databases. RPQs are the basic building block of almost all the query ...
-
(2007-08-22)We propose interval arithmetic and interval constraint algorithms for global optimization. Both of these compute lower and upper bounds of a function over a box, and return a lower and an upper bound for the global minimum. ...
-
(2007-08-22)Many of the failures and deficiencies of software projects can be attributed to the lack of effort exerted in addressing requirements in the early planning stages of software development. In multiple stakeholder development ...
-
(2007-08-24)This dissertation describes how state of the art computer music technology can be used to digitize, analyze, preserve and extend North Indian classical music performance. Custom built controllers, influenced by the Human ...
-
(2007-08-30)Application-dependent FPGA testing is performed to ensure that a particular user-defined application is implemented on fault-free areas of an FPGA. Applying this type of test technique leads to yield increases and cost ...
-
(2007-08-31)When considering Boolean switching functions with n input variables, there are 2^(2^n) possible functions that can be realized by enumerating all possible combinations of input values and arrangements of output values. As ...
-
(2007-09-10)In this thesis, we provide an implementation of prioritized queries using the Google SOAP Search API. These prioritized queries are generated from the parsing of valid prioritized constraint expressions (PCE). ...
-
(2007-12-17)Software must evolve over time or it becomes useless. Much of software production today is involved not in creating wholly new code from scratch but in maintaining and building upon existing code. Much of this code resides ...
-
(2007-12-22)Partial Redundancy Elimination (PRE) is a ubiquitous optimization used by compilers to remove repeated computations from programs. Speculative PRE (SPRE), which uses program profiles (statistics obtained from running a ...
-
(2008-04-01)This work addresses two areas of computational biology: automation of sequence processing and an assessment of the evidence for a hypothesized salmonid genome based on an analysis of a set of expressed sequence tags. Three ...
-
(2008-04-10)
Now showing items 1-20 of 532
Search UVicSpace
Browse
My Account
Help
