UScholar Works
 
Filters: Department: "Computing, School of" Collection: "ir_uspace"
176 - 200 of 957
Number of results to display per page
CreatorTitleDescriptionSubjectDate
176 Gopalakrishnan, GaneshImplementing functional programs using mutable abstract data typesWe study the following problem in this paper. Suppose we have a purely functional program that uses a set of abstract data types by invoking their operations. Is there an order of evaluation of the operations in the program that preserves the applicative order of evaluation semantics of the program...Functional programs; Mutable abstract data; Abstract data types1987
177 Hansen, Charles D.; Henderson, Thomas C.CAD-based roboticsWe describe an approach which facilitates and makes explicit the organization of the knowledge necessary to map robotic system requirements onto an appropriate assembly of algorithms, processors, sensor, and actuators. In order to achieve this mapping, several kinds of knowledge are needed. In this ...CAD-based robotics; CAD-based vision; CAGD System1987
178 Henderson, Thomas C.Apparent symmetries in range dataA procedure for extracting symmetrical features from the output of a range scanner is described which is insensitive to sensor noise and robust with respect to object surface complexity. The acquisition of symmetry descriptors for rigid bodies from a range image was in this case motivated by the ne...Symmetry descriptors; Range data; Range scanner; Dextrous manipulation systems1987
179 Smith, Kent F.PPL quick reference guide (CMOS)This work was supported in part by Defense Research Projects Agency under Contract Number DAAK1184K0017. All opinions, findings, conclusions or recommendations expressed in this document are those of the author(s) and do not necessarily reflect the view of DARPA.CMOS1987
180 Henderson, Thomas C.IKS: image kernel system users' manualIKS (for Image kernel System), is an image processing system, currently being used by the Computer Vision and Image Processing group at the University of Utah. IKS provides a convenient environment for reading, writing, and manipulating images. The system consists of two types of routines. First, t...Image kernel System; IKS1987
181 Henderson, Thomas C.Performance of arc consistency algorithms on the CRAYThe consistent labeling problem arises in high level computer vision when assigning semantic meaning to the regions of a n image. One of the drawbacks of this method is that it is rather slow. By using the consistency tests, node, arc and path consistency [9], the search space is drastically reduced...Arc consistency algorithms; CRAY supercomputer; Consistent labeling problem1987
182 Fujimoto, Richard M.Efficient instruction level simulation of computersA technique for creating efficient, yet highly accurate, instruction level simulation models of computers is described. In contrast to traditional approaches that use a software interpreter, this technique employs direct execution of application programs on the host computer. An assembly language pr...Simulation models1987
183 Lyche, TomA note on the Oslo algorithmThe Oslo algorithm is a recursive method for updating the B-spline representation of a curve or tensor product surface when extra knots are added. In the present note the derivation of this method is simplified.Oslo algorithm; B-spline; Curve product surface; Tensor product surface1987
184 Fujimoto, Richard M.A shared memory algorithm and proof for the alternative construct in CSPCommunicating Sequential Processes (CSP) is a paradigm for communication and synchronization among distributed processes. The alternative construct is a key feature of CSP that allows nondeterministic selection of one among several possible communicants. Previous algorithms for this construct assume...Shared memory algorithm; Communicating Sequential Processes; CSP1987
185 Fujimoto, Richard M.The roll back chip: hardware support for distributed simulation using time warpDistributed simulation offers an attractive means of meeting the high computational demands of discrete event simulation programs. The Time Warp mechanism has been proposed to ensure correct sequencing of events in distributed simulation programs without blocking processes unnecessarily. However, th...Roll back chip; Distributed simulation; Discrete event; Simulation programs; Time Warp mechanism1987
186 Bhanu, BirImplementation of a hierarchical control system on a BBN butterfly multiprocessor: initial studies and resultsThis report discusses the introductory work with implementing a parallel version of a hierarchical control system named CAOS (Control using Action Oriented Schemata) on the BBN Butterfly Multiprocessor. First, an overview of the BBN Butterfly and how the control system can utilize the parallel pro...Hierarchical control system; BBN Butterfly Multiprocessor; CAOS1987
187 Tinker, PeterManaging large address spaces effectively on the ButterflyThe BBN Butterfly? Parallel Processor is a commercially-available multiprocessor which uses a memory management strategy based on a segmentation of the available memory. Using all of the memory of the machine efficiently is difficult because of the need to change the memory mapping dynamically. This...BBN Butterfly Parallel Processor; Large address spaces1987
188 Hansen, Charles D.CAD-based computer vision: the automatic generation of recognition stragtegiesThree-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
189 Gu, JunAn 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; DRA1988
190 Mueller, Timothy I.Refinement estimation of B-spline curves and surfacesAn 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 tessellations1988
191 Hansen, Charles D.Efficient depth estimation using trinocular stereoWe 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; Stereovision1988
192 Henderson, Thomas C.; Meek, Sanford G.Task defined grasp force solutionsForce Control for dextrous manipulation has been approached algebraically with a great deal of success, however, the computational burden created when such approaches are applied to grasps consisting of many contacts is prohibitive. This paper describes a procedure which restricts the complexity of ...grasp force; dextrous manipulation1988
193 Gopalakrishnan, GaneshSpecification-driven design of custom hardware in HOPWe 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. Processes may be described both as a black-box and as a collection of interacting s...HOP; hardware systems; Structure; Behavior; Timing; custom hardware1988
194 Gu, JunFast structured design of VLSI circuitsWe believe that a structured, user-friendly, cost-effective tool for rapid implementation of VLSI circuits which encourages students to participate directly in research projects are the key components in digital integrated circuit (IC) education. In this paper, we introduce our VLSI education activ...VLSI circuits; Rapid implementation1988
195 Brandt, Richard C.Building databases for the computer-based memorization systemThe 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; CBMS1988
196 Carter, Tony M.Radix-16 signed-digit divisionFor 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 architecture1988
197 Gu, JunHow to search for millions of queensThe 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 algorithms1988
198 Gopalakrishnan, GaneshHOP: a process model for synchronous hardware semantics, and experiments in process compositionWe 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 semantics1988
199 Sikorski, KrisAsymptotic near optimality of the bisection methodThe 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 method1988
200 Gopalakrishnan, GaneshHOP: a process model for synchronous hardware systemsModules 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 systems1988
176 - 200 of 957