CSC

Database query is becoming a common task in public access systems; touchscreens can provide an appealing interface for such a system. This paper explores three interfaces for constructing queries on alphabetic field values with a touchscreen interface; ...

This work explores data semantics issues necessary for designing an NL interface capable of dealing with incomplete NL queries. First, the notion of incomplete NL queries is clarified to conclude the necessity for enriching the data semantics component ...

In this paper we propose the integration of query optimization and program transformation technologies in a second generation optimizer generator called OG. The input to OG is a high-level specification of the strategy transformations done by each ...

The system partitioning problem in a partitionable mesh connected system (PMCS) is addressed. A two dimensional buddy system (2DBS) is proposed as a partitioning scheme for dynamic resource allocation in a PMCS. Allocation and reclamation algorithms and ...

An efficient dynamic graph traversal algorithm is used to identify non-conflicting requests and to allocate network resources in a dynamically partitionable bus network (DPBN). A special processor receives from the control computer of a partitionable ...

This paper proposes a new multicasting algorithm that allows for message transfer from the source to the multicasting destination by using routing in the source. The routing algorithm uses a tree of trunks and nodes from the source to the multicasting ...

In this paper the concept of the distance between graphs is applied to the problem of recognizing objects. An unknown object is represented by a graph H and from the data base of possible solutions {G₁, …, G_n} (also graphs) we select the graph G_i for ...

We present an Ο(N log² N) divide-and-conquer algorithm for solving the all pairs geographic nearest neighbor problem (GNN) for a set of N sites in the plane under any L_p metric, 1 ≤ p ≥ ∞. This algorithm uses the monotone matrix searching technique of ...

A parallel branch and bound algorithm that solves the asymmetric traveling salesman problem to optimality is described. The algorithm uses an assignment problem based lower bounding technique, subtour elimination branching rules, and a subtour patching ...

Two problems are associated with the seeking of good solutions to the find path problem (Find Path) in robotics. First, the use of artificial intelligence searching techniques is limited to the A^* algorithm. Secondly, simple and poor heuristics are ...

One of the variations of the Towers of Hanoi puzzle allows for p pegs, and for four pegs the solution to this variation is shown to have a simple structure which can be used to derive an iterative solution to the problem.

Design structure measures are example of a class of metrics that may be derived early on in a software project; they are useful indicators of design weaknesses - weaknesses which, if uncorrected, lead to problems of implementation, reliability and ...

There are many areas of investigation where it is necessary to model the structure and behavior of distributed programs. Many models exist, though most tend to focus on some particular aspect of program behavior. For many problems, such as task mapping ...

In this paper we describe an optimal fault-tolerant broadcasting algorithm in the presence of n-1 faulty processors in the hypercube multiprocessor. This algorithm takes log₂(N)+1 steps to broadcast the message to all other processors. Our broadcasting ...

Probability-one homotopy methods are a class of methods for solving nonlinear systems of equations that are globally convergent from an arbitrary starting point. The essence of all such algorithms is the construction of an appropriate homotopy map and ...

A key problem in designing a dataflow computer is to maintain a strong cooperation among the processors. This requires two types of communications among the processors which are commonly referred to as arbitration and distribution. The paper describes a ...

This paper presents a fundamental, direct, and powerful approach to the surface/surface intersection problem in CAD/CAM applications. The algorithm is designed and implemented in three steps: a) Preprocessing - locate the potentially intersecting ...

This paper describes an approach to the integration of logic and object programming where predicates, logic expressions, and a generalized search protocol that support Prolog-like reasoning are implemented as an integral part of an object-oriented ...

A major portion of the work and time involved in completing an incomplete set of reductions using an E-completion procedure such as the one described by Knuth and Bendix or its extension to associative-commutative equational theories as described by ...

Associated with each permutation P = [x(1),x(2), … ,x(N)] of N (ordered) objects is its inversion table I(P) = {y(1),y(2), … ,y(N)}, a sequence of non-negative integers such that y(1) = 0 and, for i > 1, y(i) is the number of terms in {x(1), x(2), … ,x(...

This paper studies parallel devices recognizing trace languages. We introduce a concept of an asynchronous automaton with ε-moves and show that for a given regularly defined trace language there exists a simple version of an asynchronous automaton with ...

Programmers modify software for many reasons. When a part of a software is modified, side-effects of the modification are propagated to other parts of the software. By correcting these side-effects automatically, the productivity and the reliability of ...

The ripple recompilation problem is caused by modifying one or more modules in an integrated set of modules, or it results from forming a new integrated set of modules. This problem could be significant if the modified modules are widely used in the ...

A new parallel architecture that is amenable to optical implementation is presented for massively data-parallel computing. The architecture is an SIMD model that exploits spatial parallelism and processes 2-D binary images as fundamental computational ...

Future parallel computing systems will require high speed communication, efficient synchronization primitives, and low overhead context switches for communicating and synchronizing instruction streams. These issues are developed with respect to I-...

A graph theoretical representation for a class of interconnection networks is suggested. The idea is based on a definition of orthogonal binary vectors and leads to a construction rule for a class of orthogonal graphs. An orthogonal graph is first ...

A practical approach to error recovery strategy for real-time multiagent environments is presented. In a dynamic domain, when things do not happen as a pre-generated plan has expected, parts of the plan should be recovered to cope with any unexpected ...