# Browsing Computer Science Department Technical Reports by Issue Date

Now showing items 1-20 of 1187

• #### A Two-Stage Iteration for Solving Nearly Uncoupled Markov Chains ﻿

(1995-02-06)
This paper is concerned with an iteration for determining the steady-state probability vector of a nearly uncoupled Markov Chain. The states of these chains can be partitioned into aggregates with low probabilities of ...
• #### Invariant Subspaces and Capital Punishment (A Participatory Paper) ﻿

(1995-02-06)
The notion of invariant subspaces is useful in a number of theoretical and practical applications. In this paper we give an elementary treatment of invariant subspaces that stresses their connection with simple eigenvalues ...
• #### An Iterative Method for Solving Linear Inequalities ﻿

(1995-02-06)
This paper describes and analyzes a method for finding nontrivial solutions of the inequality $Ax \geq 0$, where $A$ is an $m \times n$ matrix of rank $n$. The method is based on the observation that a certain function ...
• #### Hypothesis Testing with Errors in the Variables ﻿

(1995-02-06)
In this paper we give reason to hope that errors in regression variables are not as harmful as one might expect. Specifically, we will show that although the errors can change the values of the quantities one computes in ...
• #### A Study of File Manipulation by Novices Using Commands vs. Direct Manipulation ﻿

(1995-04-13)
There are three basic interactive styles of control in human interfaces with computers: command, menu, and direct manipulation. In the past few years, these three styles have become the subject of many studies. However, ...
• #### Guide to Opportunities in Volunteer Archaeology Case study of the use of a hypertext system in a museum exhibit ﻿

(1998-10-15)
This case study shows how a hypertext system was used in a traveling exhibit of the Smithsonian Institution. The database about archaeology was constructed by a professor and students of the history department of the ...
• #### High Performance Spatial Indexing for Parallel I/O and Centralized Architectures ﻿

(1998-10-15)
Recently, spatial databases have attracted increasing interest in the database field. Because of the volume of the data with which they deal with, the performance of spatial database systems' is important. The R-tree ...
• #### On the Early History of the Singular Value Decomposition ﻿

(1998-10-15)
This paper surveys the contributions of five mathematicians\,---\,Eugenio Beltrami (1835--1899), Camille Jordan (1838--1921), James Joseph Sylvester (1814--1897), Erhard Schmidt (1876--1959), and Hermann Weyl (1885--1955 ...
• #### Direction-of-Arrival Estimation Using the Rank-Revealing URV Decomposition ﻿

(1998-10-15)
Appeared in Proceedings of ACASSP-91. An algorithm for updating the null space of a matrix is described. The algorithm is based on a new decomposition, called the URV decomposition, which can be updated in $O(N^2)$ and ...
• #### A Conceptual Framework for Text Filtering Process ﻿

(1998-10-15)
This report develops a conceptual framework for text filtering practice and research, and reviews present practice in the field. Text filtering is an information seeking process in which documents are selected from a ...
• #### Synthesizing Protocol Specifications from Service Specifications in Timed Extended Finite State Machines ﻿

(1998-10-15)
We propose a specification model and present a method to algorithmically derive a protocol specification from a service specification based on the model. Unlike the previous models based on finite state machines, the ...
• #### On the Area of Overlap of Translated Polygons ﻿

(1998-10-15)
(Also cross-referenced as CAR-TR-699) Given two simple polygons P and Q in the plane and a translation vector t E R2, the area-oJ-overlap function of P and Q is the function Ar(t) = Area(P n (t + Q)), where t + Q denotes ...
• #### Putting Visualization to Work -- ProgramFinder for Youth Placement ﻿

(1998-10-15)
The Human-Computer Interaction Laboratory (HCIL) and the Maryland Department of Juvenile Justice (DJJ) have been working together to develop the ProgramFinder, a tool for choosing programs for a troubled youth from drug ...
• #### Automated Discovery of Self-Replicating Structures in Cellular Space Automata Models ﻿

(1998-10-15)
This thesis demonstrates for the first time that it is possible to automatically discover self-replicating structures in cellular space automata models rather than, as has been done in the past, to design them manually. ...
• #### Vision and Action ﻿

(1998-10-15)
(Also cross-referenced as CAR-TR-722) Our work on Active Vision has recently focused on the computational modelling of navigational tasks, where our investigations were guided by the idea of approaching vision for ...
• #### Probe Based Recognition of Targets in Infrared Images ﻿

(1998-10-15)
(Also cross-referenced as CAR-TR-693) A probe based approach is used to recognize objects in a cluttered background using an infrared imager. A probe is a simple mathematical function which operates locally on image grey ...
• #### Identifying Aggregates in Hypertext Structures ﻿

(1998-10-15)
Hypertext systems are being used in many applications because of their flexible structure and the great browsing freedom they give to diverse communities of users. However, this same freedom and flexibility is the cause ...
• #### The Virtual Microscope ﻿

(1998-10-15)
We present the design of the Virtual Microscope, a software system employing a client/server architecture to provide a realistic emulation of a high power light microscope. We discuss several technical challenges related ...
• #### Optimization within a Unified Transformation Framework ﻿

(1998-10-15)
Programmers typically want to write scientific programs in a high level language with semantics based on a sequential execution model. To execute efficiently on a parallel machine, however, a program typically needs ...
• #### Load Balancing for Parallel Loops in Workstation Clusters ﻿

(1998-10-15)
Load imbalance is a serious impediment to achieving good performance in parallel processing. Global load balancing schemes are not adequately manage to balance parallel tasks generated from a single application. Dynamic ...