|
|
Creator | Title | Description | Subject | Date |
| 201 |
 |
| An optimal, parallel discrete relaxation algorithm and architecture (Revised January 1988 and August 1989) | A variety of problems in artificial intelligence, operations research, symbolic logic, pattern recognition and computer vision, and robot manipulation are special cases of the Consistent Labeling Problem (CLP). The Discrete Relaxation Algorithm (DRA) is an efficient computational technique to enfor... | Consistent Labeling Problem; CLP; Discrete Relaxation Algorithm; DRA | 1988 |
| 202 |
 |
| Radix-16 signed-digit division | For use in the context of a linearly scalable arithmetic architecture supporting high/variable precision arithmetic operations (integer or fractional), a two-stage algorithm for fixed point, radix-16 signed-digit division is presented. The algorithm uses two limited precision radix-4 quotient digit ... | Radix-16; linearly scalable; arithmetic architecture | 1988 |
| 203 |
 |
| Efficient depth estimation using trinocular stereo | We present recent advancements in our passive trinocular stereo system. These include a technique for calibrating and rectifying in a very efficient and simple manner the triplets of images taken for trinocular stereovision systems. After the rectification of images, epipolar lines are parallel to t... | Trinocular stereo; Stereovision | 1988 |
| 204 |
 |
| Asymptotic near optimality of the bisection method | The bisection method is shown to possess the nearly best rate of convergence for infinitely differentiable functions having zeros of arbitrary multiplicity. If the multiplicity of zeros is bounded, methods are known which have asymptotically at least quadratic rate of convergence. | Bisection method | 1988 |
| 205 |
 |
| Building databases for the computer-based memorization system | The Computer-Based Memorization System (CBMS) consists of eight games used by students to memorize groups of related facts that are stored in an associative network. The instructional design is built into the games. Designing and implementing associative networks for the CBMS is very different from... | Computer-Based Memorization System; CBMS | 1988 |
| 206 |
 |
| Design and evaluation of the rollback chip: special purpose hardware for time warp | The Time Warp mechanism offers an elegant approach to attacking difficult clock synchronization problems that arise in applications such as parallel discrete event simulation. However, because Time Warp relies on a lookahead and rollback mechanism to achieve widespread exploitation of parallelism, t... | Rollback chip; Time Warp mechanism; Clock synchronization; Parallel discrete event simulation | 1988 |
| 207 |
 |
| How to search for millions of queens | The n-queens problem is a classical combinatorial problem in artificial intelligence (AI) area. Since its simplicity and regular structure, this problem has widely been chosen as a testbed to develop and benchmark new AI search problem-solving strategies in the AI community. Due to its inherent com... | Combinatorial problems; n-queens; Search algorithms | 1988 |
| 208 |
 |
| Refinement estimation of B-spline curves and surfaces | An algorithm for refinement estimation for B-spline curves is presented. The algorithm uses approximations to the curvature and arc length to decide how a curve should be refined. The algorithm can also be used to produce isoparametric curves or polygonal tessellations from a Bspline surface. | B-spline; Curves; Surfaces; Algorithm; Curvature; Arc length; Isoparametric curves; Polygonal tessellations | 1988 |
| 209 |
 |
| An annotated bibligraphy of multisensor integration | In this paper we give an annotated bibliography of the multisensor integration literature. | Multisensor integration; Bibligraphy | 1988 |
| 210 |
 |
| HOP: a process model for synchronous hardware semantics, and experiments in process composition | We present a language "Hardware viewed as Objects and Processes" (HOP) for specifying the structure, behavior, and timing of hardware systems. HOP embodies a simple process model for lock-step synchronous processes. An absproc specification written in HOP describes the externally observable behavior... | HOP; Synchronous hardware semantics | 1988 |
| 211 |
 |
| HOP: a process model for synchronous hardware systems | Modules in HOP are black-boxes that are understood and used only in terms of their interface. The interface consists of d a t a ports, events, and a protocol specification that uses events and asserts/queries values to / from ports. Events are realized as different combinations of control wires or... | HOP; Process models; Synchronous hardware systems | 1988 |
| 212 |
 |
| CAD-based computer vision: the automatic generation of recognition stragtegies | Three-dimensional model-based computer vision uses geometric models of objects and sensed data to recognize objects in a scene. Likewise, Computer Aided Design (CAD) systems are used to interactively generate three-dimensional models during these fields. Recently, the unification of CAD and vision s... | | 1988 |
| 213 |
 |
| Computing offsets and tool paths with Voronoi diagrams | In this paper we describe the use of Voronoi diagrams to generate offsets for planar regions bounded by circular arcs and line segments, and then use the generated offsets as tool paths for NC machining. Two methods are presented, each producing a different type of offset. One of them generates the ... | Voronoi diagrams | 1989 |
| 214 |
 |
| Automatic mesh analysis technique by knowledge-based system | The finite element analysis technique has been recognized as a very important tool to solve various engineering problems, such as structural analysis, heat transfer, and fluid dynamics. The key point to the technique is discretization of the domain of interest into many finite elements. A good resul... | Mesh analysis; Mesh generation algorithm | 1989 |
| 215 |
 |
| Abstract semantics for functional constraint programming | A denotational semantics is given for a lazy functional language with monotonic side-effects arising from the unification of singly-bound logical variables. The semantics is based on a Scott-style information system, which elegantly captures the notion of "constraint additin" inherent in unificati... | Abstract semantics | 1989 |
| 216 |
 |
| Cascade: a hardware alternative to bignums | The Cascade hardware architecture for high/variable precision arithmetic is described. It uses a radix-16 redundant signed-digit number representation and directly supports single or multiple precision addition, subtraction, multiplication, division, extraction of the square root and computation of ... | Cascade hardware; Bignums; Precision arithmetic | 1989 |
| 217 |
 |
| Translating concurrent programs into delay-insensitive circuits | Programs written in a subset of occam are automatically translated into delay-insensitive circuits using syntax-directed techniques. The resulting circuits are improved using semantics-preserving circuit-to-circuit transformations. Since each step of the translation process can be proven correct, th... | | 1989 |
| 218 |
 |
| Constant scallop height tool path generation | An approach for the automatic generation of constant scallop height tool paths is presented. An example is shown generated from a B-spline model, although it can be used with many types of sculptured surfaces. The approach utilizes surface subdivision techniques and a new algorithm for tool path gen... | Scallop height; Tool path generation; B-spline model | 1989 |
| 219 |
 |
| CAD-based 3-D object recognition | We propose an approach to 3-D object recognition using CAD-based geometry models for freeform surfaces. Geometry is modeled with rational B-splines by defining surface patches and then combining these into a volumetric model of the object. Characteristic features are then extracted from this model ... | Object recognition; Strategy trees; Geometric knowledge representation; Automatic feature selection | 1989 |
| 220 |
 |
| Hidden curve removal for free form surfaces | This paper describes a hidden curve algorithm specifically designed for sculptured surfaces. A technique is described to extract the visible curves for a given scene without the need to approximate the surface by polygons. This algorithm produces higher quality results than polygon based algorithms,... | Hidden curves; Free form surfaces; Sculptured surfaces | 1989 |
| 221 |
 |
| Logical behaviors | In this paper we describe an approach to high-level multisensor integration in t h e context of an autonomous mobile robot. Previous papers have described the development of t h e INRIA mobile robot subsystems: 1. sensor and actuator systems 2. distance and range analysis 3. feature extraction ... | Multisensor integration; 3-D environment descriptions | 1989 |
| 222 |
 |
| Implementation and characteristics of rule-based system for the finite element analysis | It it well known that the analysis of process for the finite element method is tedious and errorprone steps. Considering the importance of the task of engineering analyses, such as structural analysis, heat transfer, fluid flow simulation, and electromagnetic potential, many researchers have tried t... | finite element analysis; Rule-based system | 1989 |
| 223 |
 |
| Cell matrix methodologies for integrated circuit design | A class of integrated circuit design and implementation methodologies is described. These techniques are unique in that they simultaneously model both function and interconnect using cells. These cells are designed such that cell adjacency normally implies interconnection. The absence of an interco... | Integrated circuit design; Cell matrix | 1989 |
| 224 |
 |
| A tour of the worm | On the evening of November 2, 1988, a self-replicating program was released upon the Internet 1. This program (a worm) invaded VAX and Sun-3 computers running versions of Berkeley UNIX, and used their sources to attack still more computers2. Within the space of hours this program had spread aacross ... | Computer worm | 1989 |
| 225 |
 |
| An abstract machine for parallel graph reduction | An abstract machine suitable for parallel graph reduction on a shared memory multiprocessor is described. Parallel programming is plagued with subtle race conditions resulting in deadlock or fatal system errors. Due to the nondeterministic nature of program execution the utilization of resources ma... | Parallel graph reduction; Abstract machines | 1989 |
