Search
Now showing items 21-30 of 2407
On the Prediction of Local Patterns in Cellular Automata.
(1986)
The class of deterministic one-dimensional cellular automata studied recently by Wolfram are considered. We represent a state of an automaton as a probability distribution of patterns of a fixed size. In this way information ...
On Cost-effectiveness of a Semijoin in Distributed Query Processing.
(1987)
The cost-effective reduction of relations by semijoins is the basis of the heuristic approach to distributed query processing. The cost-effectiveness of a semijoin was simply determined in the literature assuming that the ...
Information Theoretic Analysis for a General Queueing System at Equilibrium with Application to Queues in Tandem.
(1987)
In this paper, information theoretic inference methodology for system modeling is applied to estimate the probability distribution for the number of customers in a general, single server queueing system with infinite ...
Feedback Control for an Abstract Parabolic Equation.
(1986)
The abstract parabolic equation x = Ax (A sectionial) is marginally stable if the nullspace H_0 of A is non-trivial but e^(+A) is exponentially stable on a complement H_1. An example is u_t> = DELTA u with Neumann boundary ...
An Expert System for Electronics Design.
(1987)
After three years of development, the University of Maryland Reliability and Maintainability Computer Aided Design (RAMCAD) expert system for electronics has been implemented for on-site test and utilization. This paper ...
On the Stiffness of a Novel Six-DOF Parallel Minimanipulator
(1995)
The dimensionally-uniform Jacobian matrix of a novel three- limbed, six degree-of-freedom (DOF) minimanipulator is used to derive its dimensionally-uniform stiffness matrix.<P>The minimanipulator limbs are inextensible and ...
Parallel Algorithms for VLSI Layout.
(1989)
Efficient automatic layout tools are clearly essential for designing complex VLSI systems. Recent efforts have been directed toward developing parallel algorithms to handle the different subproblems involved in the layout ...
A Geometric Algorithm for Finding the Largest Milling Cutter
(2001)
In this paper, we describe a new geometric algorithm to determine the largest feasible cutter size for 2-D milling operations to be performed using a single cutter. In particular:1. We give a general definition of the ...
Implementing Large Production Systems in a DBMS Environment: Concepts and Algorithms.
(1987)
It has been widely recognized that many future database applications, including engineering processes, manufacturing and communications, will require some kind of rule based reasoning. It is conceivable that large knowledge ...
Trie Hashing with Controlled Load .
(1989)
Trie hashing is an access methods to primary key ordered dynamic files. The key address is computed through a trie. Key search needs usually one disk access since the trie may be in core and needs two accesses for very ...