|
|
Creator | Title | Description | Subject | Date |
| 1 |
 |
Sobh, Tarek M.; Henderson, Thomas C. | A dynamic framwork for intelligent inspection | CAD Computer Aided Design typically involves the design manufacture and inspection of a me chanical part. The problem of reverse engineering is to take an existing mechanical part as the point of departure and to inspect or produce a design and perhaps a manufacturing process for the part. ... | CAD; Manufacture; Inspection; Intelligent inspection | 1992 |
| 2 |
 |
Sobh, Tarek M.; Henderson, Thomas C. | A dynamic recursive structure for intelligent exploration | We suggest a new approach for inspection and reverse engineering applications. In particular, we investigate the use of discrete event dynamic systems (DEDS) to guide and control the active exploration and sensing of mechanical parts for industrial inspection and reverse engineering. We introduce dy... | Intelligent exploration; Discrete event dynamic systems; DEDS; Dynamic recursive finite state machines; DRFSM | 1992 |
| 3 |
 |
Sobh, Tarek M.; Henderson, Thomas C. | A dynamic recursive structure for intelligent inspection | We suggest a new approach for inspection and reverse engineering applications. In particular we investigate the use of discrete event dynamic systems DEDS to guide and control the active exploration and sensing of mechanical parts for industrial inspection and reverse engineering?? We introduce... | Intelligent inspection; Discrete event dynamic systems; DEDS; Industrial inspection; Dynamic recursive structure | 1992 |
| 4 |
 |
Whitaker, Ross T. | A fast iterative method for a class of Hamilton-Jacobi equations on parallel systems | In this paper we propose a novel computational technique, which we call the Fast Iterative Method (FIM), to solve a class of Hamilton- Jacobi (H-J) equations on massively parallel systems. The proposed method manages the list of active nodes and iteratively updates the solutions on those nodes u... | Fast Iterative Method; FIM; Parallel systems | 2007 |
| 5 |
 |
Smith, Kent F. | A fast parallel squarer based on divide-and-conquer | Fast and small squarers are needed in many applications such as image compression. A new family of high performance parallel squarers based on the divide-and-conquer method is reported. Our main result was realizing the basis cases of the divide-and-conquer recursion by using optimized n-bit primiti... | Squarer; Parallel squarers; Divide-and-conquer; MOPS; CMOS | 1995 |
| 6 |
 |
Henderson, Thomas C.; Hansen, Charles D. | A fault tolerant sensor scheme | Multi-sensor systems pose the problem of how to coherently and efficiently treat the data provided by the various sensors. However. the availability of greater numbers of sensors also broadens the ability to build fault tolerant sensor systems. We define a framework in which sensors can be abstractl... | Multi-sensor systems; Logical sensors | 1983 |
| 7 |
 |
Lindstrom, Gary E. | A framework for module-based language processors | A system composed of interconnected modules is a module-based system. We present an object-oriented (0-0) framework for the development of processors for module-based systems, such as compilers for 0-0 languages, linkers/loaders, and tools for user/system libraries. We claim t h a t this framework,... | Language processors; Jigsaw; Module-based | 1993 |
| 8 |
 |
Michell, Nick | A gallium arsenide mutual exclusion element | A mutual exclusion element is a key component in building asynchronous and self-timed circuits. As part of our effort to design high performance self-timed circuits, we have designed a mutual exclusion element in gallium arsenide. This circuit has been fabricated in a 1.2? process and tested. A test... | Mutual exclusion element; Self-timed circuits | 1993 |
| 9 |
 |
Mathew, Binu K.; Davis, Al; Fang, Zhen | A Gaussian probability accelerator for SPHINX 3 | Accurate real-time speech recognition is not currently possible in the mobile embedded space where the need for natural voice interfaces is clearly important. The continuous nature of speech recognition coupled with an inherently large working set creates significant cache interference with other... | Speech recognition; SPHINX 3; Speech recognizers | 2003-07-22 |
| 10 |
 |
Gopalakrishnan, Ganesh | A general compositional approach to verifying hierarchical cache coherence protocols | Modern chip multiprocessor (CMP) cache coherence protocols are extremely complex and error prone to design. Modern symbolic methods are unable to provide much leverage for this class of examples. In [1], we presented a method to verify hierarchical and inclusive versions of these protocols using ... | Hierarchical cache coherence protocols; Verification | 2006-11-26 |
| 11 |
 |
Yang, Yue; Gopalakrishnan, Ganesh; Lindstrom, Gary E. | A generic operational memory model specification framework for multithreaded program verification | Given the complicated nature of modern architectural and language level memory model designs, it is vital to have a systematic ap- proach for specifying memory consistency requirements that can support verification and promote understanding. In this paper, we develop a spec- ification methodolog... | Multithreaded program verification | 2003 |
| 12 |
 |
Lefohn, Aaron; Whitaker, Ross T. | A GPU-based, three-dimensional level set solver with curvature flow | Level set methods are a powerful tool for implicitly representing deformable surfaces. Since their inception, these techniques have been used to solve prob- lems in fields as varied as computer vision, scientific visualization, computer graphics and computational physics. With the power and flexi... | GPU-based; Level set solver | 2002-12-11 |
| 13 |
 |
Sobh, Tarek M. | A graphical environment and applications for discrete event and hybrid systems in robotics and automation | In this paper we present an overview for the development of a graphical environment for simulating, analyzing, synthesizing, monitoring, and controlling complex discrete event and hybrid systems within the robotics, automation, and intelligent system domain. We start by presenting an overview of di... | Intelligent system domain; Graphical environment | 1994 |
| 14 |
 |
Warnock, John E. | A hidden line algorithm for halftone picture representation | In exploring applications in computer graphics, one finds quickly that the representation of three dimensional objects in picture form is both a desirable and necessary capability. Applications dealing with any form of spatial design or with visual environment simulation need the ability to represen... | Halftone picture representation; Spatial design | 1968 |
| 15 |
 |
Cohen, Elaine | A hole-filling algorithm for triangular meshes | Data obtained by scanning 3D models typically contains missing pieces and holes. These can be caused due to scanning artifacts or artifacts in the surface due to wear and tear. We provide a method based on the Moving Least Squares projection to fill holes in triangular meshes obtained during the ... | Hole-filling algorithm; Triangular meshes; 3D models; Scanning | 2004-12-20 |
| 16 |
 |
Starkey, Mike | A lisp-based occam interpreter | The OCCAM programming language is an implementation of Communicating Sequential Processes and is used in a number of different areas. These areas usually require explicitly describing small-grain paralleslism. OCCAM programs formed by such descriptions can be tested for correctness by executing the... | Lisp-based; Occam interpreter | 1991 |
| 17 |
 |
Bennion, Scott Thomas | A method of solution for hydrodynamics and radiation diffusion as a multi-material problem in one dimension | | Multi-material problem | 1971 |
| 18 |
 |
Weinstein, David | A morphing algorithm for generating near optimal grids: applications in computational medicine | We apply morphing to t h e problem of generating the initial mesh for finite element simulations. This algorithm reduces mesh adaptation time by integrating physical and geometric constraints to provide a near optimal initial mesh. We apply this method to large-scale bioelectric field problems invol... | Morphing algorithm; Bioelectric field problems | 1994 |
| 19 |
 |
Subrahmanyam, P.A. | A new approach to specifying and handling exceptions | An operation generally exhibits different patterns of behavior over different parts of its domain. Depending upon the context, such behavior may either be conceived of as "normal" or as an "exception." Thus, the behavior of an operation Is quite naturally characterized by the set of partial operatio... | Computer operations; Exceptions; Exception handling | 1980 |
| 20 |
 |
Bruderlin, Beat | A new approach to tolerance analysis | Tolerance analysis is seen as part of a more general problem, namely handling data with uncertainty. Uncertain geometric data arises when interpreting measured data, but also in solid modeling where floating point approximations are common, when representing design tolerances, or when dealing with l... | Tolerance analysis | 1994 |
| 21 |
 |
Kirby, Robert Michael II; Johnson, Christopher R. | A new family of variational-form-based regularizers for reconstructing epicardial potentials from body-surface mapping | We propose a new family of regularizers for the inverse ECG problem, using a variational principle that underlies finite element approximation methods. As an alternative to traditional Tikhonov regularizers, the variational formulation has several advantages: 1)it enables a simple construction of ... | | 2010 |
| 22 |
 |
Cohen, Elaine | A new local basis for designing with tensioned splines | Recently there has been a great deal of interest in the use of "tension" parameters to augment control mesh vertices as design handles for piecewise polynomials. A particular local cubic basis called p-splines, which has been termed a "generalization of B-splines", has been proposed as an appropriat... | Tensioned splines | 1985 |
| 23 |
 |
Sikorski, Kris | A note on optimal algorithms for fixed points | We present a constructive lemma that we believe will make possible the design of nearly optimal 0(dlog | ) cost algorithms for computing eresidual approximations to the fixed points of d-dimensional nonexpansive mappings with respect to the infinity norm. This lemma is a generalization of a two-... | Fixed points; Constructive lemma | 2009 |
| 24 |
 |
Lyche, Tom | A note on the Oslo algorithm | The 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 surface | 1987 |
| 25 |
 |
Sloan, Peter-Pike | A painterly approach to human skin | Rendering convincing human figures is one of the unsolved goals of computer graphics. Previous work has concentrated on modeling physics of human skin. We have taken a different approach. We are exploring techniques used by artists, specifically artists who paint air-brushed portraits. Our goal is t... | Human skin | 1999 |
| 26 |
 |
Parke, Frederic Ira | A parametric model for human faces | This report presents a computer model for the representation of human faces. This three-dimensional, parametric model produces shaded facial images. The face, constructed of polygonal surfaces, is manipulated through the use of parameters which control interpolation, translation, rotation and scalin... | Parametric model; Human face | 1975 |
| 27 |
 |
Gopalakrishnan, Ganesh | A partial order reduction algorithm without the Proviso | This paper presents a partial order reduction algorithm, called Two phase, that preserves stutter free LTL properties. Two phase dramatically reduces the number of states visited compared to previous partial order reduction algorithms on most practical protocols. The reason can be traced to a step o... | Order reduction algorithm; Proviso step | 1998 |
| 28 |
 |
Brunvand, Erik L. | A partial scan methodology for testing self-timed circuits | This paper presents a partial scan method for testing control sections of macromodule based self-timed circuits for stuck-at faults. In comparison with other proposed test methods for self-timed circuits, this technique offers better fault coverage than methods using self-checking techniques, and ... | | 1995 |
| 29 |
 |
Brunvand, Erik L. | A partial scan methodology for testing self-timed circuits | This paper presents a partial scan method for testing control sections of macromodule based self-timed circuits for stuck-at faults. In comparison with other proposed test methods for self-timed circuits, this technique offers better fault coverage than methods using self-checking techniques, and re... | Self-timed circuits; Testing | 1995 |
| 30 |
 |
McDirmid, Sean; Hsieh, Wilson C. | A path-precise analysis for property synthesis | Recent systems such as SLAM, Metal, and ESP help programmers by automating reasoning about the correctness of temporal program properties. This paper presents a technique called property synthesis, which can be viewed as the inverse of property checking. We show that the code for some program pro... | Property synthesis; Property codes | 2003-12-01 |
| 31 |
 |
Thompson, Cynthia A. | A personalized system for conversational recommendations | Increased computing power and theWeb have made information widely accessible. In turn, this has encouraged the development of recommendation systems that help users find items of interest, such as books or restaurants. Such systems are more useful when they personalize themselves to each user?s p... | Adaptive Place Advisor; Recommendation systems | 2002-06-26 |
| 32 |
 |
Regehr, John | A practical logic framework for verifying safety properties of executables | We present a novel program logic, Lf , which is designed on top of a Hoare logic, but is simpler, more flexible and more scalable. Based on Lf , we develop a framework for automatically verifying safety properties of executables. It utilizes a whole-program interprocedural abstract interpretation to... | | 2011-01-01 |
| 33 |
 |
Hansen, Charles D. | A practical workflow for making anatomical atlases for biological research | An anatomical atlas provides a detailed map for medical and biological studies of anatomy. These atlases are important for understanding normal anatomy and the development and function of structures, and for determining the etiology of congenital abnormalities. Unfortunately, for biologists, generat... | | 2012-01-01 |
| 34 |
 |
Gouraud, Henri | A programmer's guide to PDP-10 euler | This manual describes the EULER language as implemented on the DEC PDP-10 computer. EULER is a block-structured language, similar to Algol-60 but simplified by omitting type declarations and by altering the way procedures are defined and called. PDP-10 EULER includes features for list-and array-mani... | EULER language | 1970 |
| 35 |
 |
Watkins, Gary Scott | A real time visible surface algorithm | With the increasing use of computer graphics, a need is growing for a processor capable of displaying solid objects. Environmental simulation and architectural modeling are only two areas that would benefit from such a diplay processor. This dissertation describes an algorithm designed for such a ... | Surface algorithm | 1970 |
| 36 |
 |
Kirby, Robert Michael | A scalable, efficient scheme for evaluation of stencil computations over unstructured meshes | Stencil computations are a common class of operations that appear in many computational scientific and engineering applications. Stencil computations often benefit from compile-time analysis, exploiting data-locality, and parallelism. Post-processing of discontinuous Galerkin (dG) simulation solutio... | | 2013-01-01 |
| 37 |
 |
George, Lal | A scheduling strategy for shared memory multiprocessors | An efficient scheduling strategy for shared memory multiprocessors is described. The rapid dissemination of tasks to available procesors and ready queues is crucial to the performance of any parallel system. Such overheads determine the attainable speedup and performance of the system. Poor techniq... | Shared memory multiprocessors | 1990 |
| 38 |
 |
Fujimoto, Richard M. | A shared memory algorithm and proof for the alternative construct in CSP | Communicating 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; CSP | 1987 |
| 39 |
 |
Baxter, Brent S. | A standard magnetic tape format for digital image exchange | This proposal describes a simple yet flexible magnetic tape format for exchanging digital image information. Multi-dimensional arrays of raster scan data are stored as sequential files, with descriptive information related to the sefiles stored in an initial directory file. Directory information is ... | Raster scan data | 1981 |
| 40 |
 |
Henderson, Thomas C. | A study of Pierce's group generator | Pierce describes an approach to map learning with uninterpreted sensors and effectors. As part of that, he describes a sensor grouping generator operator that attempts to arrange similar sensors into groups. Here we review that work and place it in a more strenuous statistical validation framewor... | Pierce's group; Map learning; Sensor grouping generator | 2010 |
| 41 |
 |
Henderson, Thomas C. | A survey of dextrous manipulation | The development of mechanical end effectors capable of dextrous manipulation is a rapidly growing and quite successful field of research. It has in some sense put the focus on control issues, in particular, how to control these remarkably humanlike manipulators to perform the deft movement that we t... | Dextrous manipulation | 1986 |
| 42 |
 |
Berzins, Martin | A survey of high level frameworks in block-structured adaptive mesh refinement packages | Over the last decade block-structured adaptive mesh refinement (SAMR) has found increasing use in large, publicly available codes and frameworks. SAMR frameworks have evolved along different paths. Some have stayed focused on specific domain areas, others have pursued a more general functionality, p... | | 2014-01-01 |
| 43 |
 |
Gopalakrishnan, Ganesh; Kirby, Robert Michael II | A survey of MPI related debuggers and tools | Message Passing Interface is a widely used standard in the High Performance and Scienti c Computing Community for writing programs that can exploit the capability of parallel platforms. However, the inherent complexity and the size of the communication standard have made it difficult for programm... | Message Passing Interface; MPI; Debuggers | 2007 |
| 44 |
 |
Sobh, Tarek M. | A survey on sensor classifications for industrial applications | The importance of sensors in industrial applications is a result of the introduction of many robotics, automation, and intelligent control techniques into factory floors. Research and improvements need to be continuously performed to meet the challenges in automation and manufacturing applications i... | Sensor classifications; Industrial applications; Sensors | 1995 |
| 45 |
 |
Gopalakrishnan, Ganesh | A symbolic partial order reduction algorithm for rule based transition systems | Partial order reductions are a class of methods that attempt to reduce the state space that must be explored to verify systems by explicit state enumeration. Partial order reduction algorithms have been successfully incorporated into tools such as Spin and VFSM-valid. However, current partial ord... | Partial order reductions; Partial order reduction algorithms; SAT solver; Rule based transition systems | 2003-12-01 |
| 46 |
 |
Henderson, Thomas C. | A systolic array implementation of discrete relaxation algorithm | Discrete Relaxation techniques have proven useful in solving a wide range of problems in digital signal processing, artificial intelligence, machine vision, and VLSI engineering, etc. A conventional hardware design for an 8-label 8-object Discrete Relaxation Algorithm (DRA) requires three 4K memory... | Discrete Relaxation algorithm; Systolic array | 1986 |
| 47 |
 |
Seeley, Donn | 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 |
| 48 |
 |
Gopalakrishnan, Ganesh | A transformational approach to asynchronous high-level synthesis | Asynchronous high-level synthesis is aimed at transforming high level descriptions of algorithms into efficient asynchronous circuit implementations. This approach is attractive from the point of view of the flexibility it affords in performing high level program transformations on users' initial d... | High level synthesis tool; SHILPA | 1993 |
| 49 |
 |
Cohen, Elaine | A triangulation-invariant method for anisotropic geodesic map computation on surface meshes | This paper addresses the problem of computing the geodesic distance map from a given set of source vertices to all other vertices on a surface mesh using an anisotropic distance metric. Formulating this problem as an equivalent control theoretic problem with Hamilton-Jacobi-Bellman partial different... | | 2012-01-01 |
| 50 |
 |
Sobh, Tarek M.; Henderson, Thomas C. | A unifying framework for tolerance analysis in sensing, design, and manufacturing | In this work we address the problem of tolerance representation and analysis across the domains of industrial inspection using sensed data, CAD design, and manufacturing. Instead of using geometric primitives in CAD models to define and represent tolerances, we propose the use of stronger methods t... | Tolerance representation; Tolerance analysis; Industrial inspection; Sensed data; CAD design | 1994 |
| 51 |
 |
Beazley, David. M. | A wrapper generation tool for the creation of scriptable scientific applications | In recent years, there has been considerable interest in the use of scripting languages as a mechanism for controlling and developing scientific software. Scripting languages allow scientific applications to be encapsulated in an interpreted environment similar to that found in commercial scientific... | | 1998 |
| 52 |
 |
Awasthi, Manu; Nellans, David W.; Sudan, Kshitij; Balasubramonian, Rajeev | ABP : predictor based management of DRAM row buffers | DRAM accesses are costly, especially in multicore systems. Future CMPs will run a mixed load of workloads/threads. Destructive interference at memory controller, spatio-temporal locality lost! DRAM row-buffer hits are least expensive, row-conflicts are most. Randomized memory access patterns re... | | 2010-10-06 |
| 53 |
 |
Panangaden, Prakash | Abstract interpretation and indeterminacy | We present a semantic theory that allows us to discuss the semantics of indeterminate operators in a dataflow network. The assumption is made that the language in which the indeterminate operators are written has a construct that allows for the testing of availability of data on input lines. We then... | Semantics; Indeterminate operators | 1984 |
| 54 |
 |
Lindstrom, Gary E. | 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 |
| 55 |
 |
Hansen, Charles D. | Accelerated isosurface extraction in time-varying fields | For large time-varying data sets, memory and disk limitations can lower the performance of visualization applications. Algorithms and data structures must be explicitly designed to handle these data sets in order to achieve more interactive rates. The Temporal Branch-on-Need Octree (T-BON) extends t... | Isosurfaces; Time-dependent scalar field visualization; Multiresolution methods; Octree; Bricking; Unstructured grid visualization; Out-of-core visualization | 2000 |
| 56 |
 |
Callahan, Michael Wayne | Acoustic signal processing based on the short-time spectrum | The frequency domain representation of a time signal afforded by the Fourier transform is a powerful tool in acoustic signal processing. The usefulness of this representation is rooted in the mechanisms of sound production and perception. Many sources of sound exhibit normal modes or natural frequen... | Acoustic signal processing | 1976 |
| 57 |
 |
Brunvand, Erik L. | ACT: A DFT tool for self-timed circuits | This paper presents a Design for Testability (DFT) tool called ACT (Asynchronous Circuit Testing) which uses a partial scan technique to make macro-module based selftimed circuits testable. The ACT tool is the first oFits kind for testing macro-module based self-timed circuits. ACT modifies design... | | 1997 |
| 58 |
 |
Sobh, Tarek M. | Active inspection and reverse engineering | We propose a new design for inspection and reverse engineering environments. In particular, we investigate the use of discrete event dynamic systems (DEDS) to guide and control the active exploration and sensing of mechanical parts for industrial inspection and reverse engineering. We introduce dyn... | Discrete event dynamic systems; DEDS; Industrial inspection | 1993 |
| 59 |
 |
Organick, Elliott I. | ADA to silicon transformations: the outline of a method | This report explores the contention that a high-order language specification of a machine (such as an Ada program) can be methodically transformed into a hardware representation of that machine. One series of well-defined steps through which such transformations can take place is presented in this i... | ADA program; High-order language specification | 1982 |
| 60 |
 |
Carter, Tony M. | Ada-to-silicon compiler study (Final Report 30 Jan 85 - 30 Jun 86) | The vision of a system design environment in which both hardware and software components could be designed, tested, and executed was proffered by the late Dr. Elliott Organick1 in 1981. He was impressed by the objectiveness of Ada and the availability of an architecture (the Intel 432) which was sp... | ADA language | 1986 |
| 61 |
 |
Berzins, Martin | Adaptive high-order discontinuous galerkin solution of elastohydrodynamic lubrication point contact problems | This paper describes an adaptive implementation of a high order Discontinuous Galerkin (DG) method for the solution of elastohydrodynamic lubrication (EHL) point contact problems. These problems arise when modelling the thin lubricating film between contacts which are under sufficiently high pressur... | | 2012-01-01 |
| 62 |
 |
Cohen, Elaine | Adaptive isocurves based rendering for freeform surfaces | Freeform surface rendering is traditionally performed by approximating the surface with polygons and then rendering the polygons. This approach is extremely common because of the complexity in accurately rendering the surfaces directly. Recently, several papers presented methods to render surfaces ... | Freeform surface rendering; Isocurves | 1992 |
| 63 |
 |
Cohen, Elaine | Adaptive isocurves based rendering for freeform surfaces | Freeform surface rendering is traditionally performed by approximating the surface with polygons and then rendering the polygons This approach is extremely common because of the complexity in accurately rendering the surfaces directly Recently?? several papers presented methods to render surface... | Freeform surface rendering; Isocurves | 1992 |
| 64 |
 |
Henderson, Thomas C. | Agent-based engineering drawing analysis | Interpretation of paper drawings has received a good deal of attention over the last decade. Related areas such as direct interpretation of human drawings (HCI), search and indexing of graphics databases, and knowledge representation in the domain of graphics and drawing understanding have also s... | Interpretation; Human drawings; HCI; Graphic databases | 2002-02-04 |
| 65 |
 |
Crow, Franklin C. | The aliasing problem in computer-synthesized shaded images | This paper describes work toward improving the quality of computer-synthesized shaded images. Current (practical) hidden-surface algorithms produce an image whose precision is strictly limited by the number of picture elements. Problems caused by this limitation are described and explained in the t... | aliasing problem; shaded images; hidden-surface algorithms | 1976 |
| 66 |
 |
Lindstrom, Gary E. | Alpha-beta pruning on evolving game trees | The alpha-beta strategy is a widely used method for economizing on the size of game trees. Heretofore, its application has been limited to depth-first tree growth in recursive search functions. However, many modern game players use retentive (i.e. coroutine-based) control to achieve greater attentio... | Alpha-beta pruning; Game trees | 1979 |
| 67 |
 |
George, Lal | 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 |
| 68 |
 |
George, Lal | An abstract machine for parallel graph reduction | An abstract machine for parallel graph reduction on a shared memory multiprocessor is described. This is intended primarily for normal order (lazy) evaluation of functional programs. It is absolutely essential in such a design to adapt an efficient sequential model since during execution under limit... | Parallel graph reduction | 1989 |
| 69 |
 |
Subrahmanyam, P.A. | An algebraic formulation of seitz's weak conditions for self timed circuits | Two fairly intuitive conditions are given that serve to algebraically characterize Seitz's "weak conditions" for self timed circuits. It is shown that these two conditions embody the 12 temporal logic conditions (developed b y Owicki and Malachi) which are intended to express both the weak condition... | Seitz's weak conditions; Self-timed circuits | 1982 |
| 70 |
 |
Shirley, Peter S. | An anisotropic phong light reflection model | We present a new BRDF model that attempts to combine the advantages of the various empirical models currently in use. In particular, it has intuitive parameters, is anisotropic, energy-conserving, reciprocal, has an appropriate non-Lambertian diffuse term, and is well-suited for use in a Monte Carlo... | BRDF model; Anisotropic; Phong light reflection model | 2000 |
| 71 |
 |
Henderson, Thomas C. | An annotated bibligraphy of multisensor integration | In this paper we give an annotated bibliography of the multisensor integration literature. | Multisensor integration; Bibligraphy | 1988 |
| 72 |
 |
Greenfield, Harvey | An application of computer graphics: two concurrent investigations within the medical field | The aim of this project is to apply new or recently developed computer graphic techniques to a particular discipline with the thought of broadening its research capabilities. The discipline chosen, that of medicine, has emphasis places on the area of hemodynamics. It is seen that computer graphics m... | Computer graphic techniques | 1971 |
| 73 |
 |
Keller, Robert M. | An approach to determinacy proofs | It is known that any parallel program graph composed of continuous operators itself represents a continuous function. In other words, the network is determinate in the sense that for a given input, the output is unique, independent of the timing of the constituent operators. This result is applied t... | Parallel program graph; Determinacy proofs | 1978 |
| 74 |
 |
Henderson, Thomas C. | An approach to three-dimensional scene databases | Current image database research is concerned for the most part with the encoding and processing of two-dimensional images. However, the most successful approach to computer vision is based on 3-dimensional information, organized as either stacks of 2-D images (e.g., the intrinsic images of Barrow an... | Image databases; Three-dimensional; Scene databases | 1987 |
| 75 |
 |
Keller, Robert M.; Lindstrom, Gary E. | An architecture for a loosely-coupled parallel processor | An architecture for a large (e. g. 1000 processor) parallel computer is presented. The processors are loosely-coupled, in the sense that communication among them is fully asynchronous, and each processor is generally not unduly delayed by any immediate need for specific data values. The network supp... | Loosely-coupled; Parallel processors | 1978 |
| 76 |
 |
Bruderlin, Beat | An axiomatic approach for solving geometric problems symbolically | This paper describes a new approach for solving geometric constraint problems and problems in geometry theorem proving. We developed a rewrite-rule mechanism operating on geometric predicates. Termination and completeness of the problem solving algorithm can be obtained through well foundedness and ... | Geometric constraint problems; Geometry theorem proving; Knuth-Bendix completion algorithm | 1990 |
| 77 |
 |
Willemsen, Peter; Gooch, Amy A. | An experimental comparison of perceived egocentric distance in real, image-based, and traditional virtual environment using direct walking tasks | In virtual environments, perceived egocentric distances are often underestimated when compared to the same distance judgments in the real world. The research presented in this paper explores two possible causes for this reduced distance perception in virtual environments: (1) real-time computer g... | Egocentric distances; Virtual environments | 2002-02-12 |
| 78 |
 |
Newman, William M. | An experimental display programming language for the PDP-10 computer | An experimental language for display programming, called DIAL, has been developed for the PDP-10 and the UNIVAC 1559 display. It is experimental in the sense that it was originally conceived as a means of testing out some ideas, and the best way to test them seemed to be to produce a language that ... | Display programming; DIAL; Display Algol | 1970 |
| 79 |
 |
Riesenfeld, Richard F.; Smith, Kent F. | An experimental system for computer aided geometric design | The main goal of this proposed level-of-effort project is to extend present capabilities in the area of Computer Aided Geometric Design (CAGD) and to develop custom VLSI support for some special geometric functions. | Computer aided geometric design; CAGD; VLSI; Very large scale integration | 1984 |
| 80 |
 |
Khoche, Ajay | An extended cell set of self-timed designs | The high level synthesis approach described in [1] uses hopCP[2] language for behavioral descriptions. The behavioral specifications are then translated into Hop Flow Graphs (HFGs). The actions in the graph are then refined such that refined actions can be directly mapped onto asynchronous circuit b... | Self-timed designs; hopCP; Hop Flow Graphs; Asynchronous circuit blocks; Action-blocks | 1993 |
| 81 |
 |
Gopalakrishnan, Ganesh; Humphrey, Alan Parker; Derrick, Christopher Glade | An integration of dynamic MPI formal verification within eclipse PTP | Our research goals were to verify practical MPI programs for deadlocks, resource leaks, and assertion violations at the push of a button and be able to easily visualize the results. We also sought to integrate these capabilities with the Eclipse IDE via an Eclipse plug-in for the Parallel Tools Plat... | Verification; Graphical User Interfaces; Dynamic Interleaving Reduction; Message Passing; MPI; Multi-core; Eclipse Parallel Tools Platform; Trapeze Interactive Poster | 2010-03-15 |
| 82 |
 |
Bruderlin, Beat | An interactive N-Dimensional constraint system | In this paper, we present a graph-based approach to geometric constraint solving. Geometric primitives (points, lines, circles, planes, etc.) possess intrinsic degrees of freedom in their embedding space. Constraints reduce the degrees of freedom of a set of objects. A constraint graph is created wi... | Geometric constraint solving | 1994 |
| 83 |
 |
Gopalakrishnan, Ganesh | An interface aware guided search method for error-trace justification in large protocols | Many complex concurrent protocols that cannot be formally verified due to state explosion can often be formally verified by initially creating a collection of abstractions (overapproximations), and subsequently refining the overapproximated protocol in response to spurious counterexample traces. ... | Concurrent protocols; Verification; Error-trace justification | 2008 |
| 84 |
 |
Sikorski, Kris | An interior ellipsoid algorithm for fixed points | We consider the problem of approximating fixed points of non-smooth contractive functions with using of the absolute error criterion. In [12] we proved that the upper bound on the number of function evaluations to compute ?-approximations is 0(n3(In 1/? + In 1/1-q +In n)) in the worst case, where ... | Ellipsoid algorithm; Contractive functions; Fixed points | 1998 |
| 85 |
 |
Davis, Al | An introduction to asynchronous circuit design | The purpose of this monograph is to provide both an introduction to field of asynchronous digital circuit design and an overview of the practical state of the art in 1997. In the early days of digital circuit design, little distinction was made between synchronous and asynchronous circuits. However,... | Asynchronous circuit design | 1997 |
| 86 |
 |
Riloff, Ellen M. | An introduction to the Sundance and AutoSlog systems | This document describes the Sundance natural language processing system that has been developed at the University of Utah, as well as the AutoSlog and AutoSlog-TS extraction pattern learners that have been implemented on top of Sundance. Sundance is a shallow parser that also includes clause hand... | Sundance system; AutoSlog system; Extraction pattern learners | 2004-11-08 |
| 87 |
 |
Regehr, John | An isotach implementation for myrinet | An isotach network provides strong guarantees about message delivery order. We show that an isotach network can be implemented efficiently entirely in software, using commercial o-the-shelf hardware. This report describes that effort. Parts of this implementation could be performed much more efficie... | | 1997-01-01 |
| 88 |
 |
Carter, John B. | An O(1) time complexity software barrier | As network latency rapidly approaches thousands of processor cycles and multiprocessors systems become larger and larger, the primary factor in determining a barrier algorithm?s performance is the number of serialized network latencies it requires. All existing barrier algorithms require at least ... | Network latency; Barrier algorithm; Time complexity software barrier | 2004 |
| 89 |
 |
Henderson, Thomas C. | An O(n) time discrete relaxation architecture for real-time processing of the consistent labeling problem | Discrete relaxation techniques have proven useful in solving a wide range of problems in digital signal and digital image processing, artificial intelligence, operations research, and machine vision. Much work has been devoted to finding efficient hardware architectures. This paper shows that a conv... | Discrete relaxation techniques | 1986 |
| 90 |
 |
Gu, Jun | 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 |
| 91 |
 |
Riloff, Ellen M. | Analyses for elucidating current question answering technology | In this paper, we take a detailed look at the performance of components of an idealized question answering system on two diff erent tasks: the TREC Question Answering task and a set of reading comprehension exams. We carry out three types of analysis: inherent properties of the data, feature analys... | TREC Question Answering task | 2001-12 |
| 92 |
 |
Carter, John B. | Analysis of avalanche's shared memory architecture | In this paper, we describe the design of the Avalanche multiprocessor's shared memory subsystem, evaluate its performance, and discuss problems associated with using commodity workstations and network interconnects as the building blocks of a scalable shared memory multiprocessor. Compared to other ... | Avalanche multiprocessor; Shared memory | 1997 |
| 93 |
 |
Sobh, Tarek M. | Analysis of tolerance for manufacturing geometric objects from sense data | In this work we address the problem of manufacturing machine parts from sense data. Constructing geometric models for the objects from sense data is the intermediate step in a reverse engineering manufacturing system. Sensors are usually inaccurate, providing uncertain sense information. We constr... | Manufacture | 1993 |
| 94 |
 |
Henderson, Thomas C. | Analysis of topographic maps for recreational purposes using decision trees | In this paper we describe a method for predicting the subjective quality of a new mountain bike route for a particular subject based on routes previously ridden and ranked by the subject. GPS tracks of the previously ridden routes are over laid on rasterized topographic maps and topographic features... | | 2013-01-01 |
| 95 |
 |
Weinstein, David | The analytic 3-D transform for the least-squared fit of three pairs of corresponding points | We derive the analytic transformation for minimizing the summed-squared-distance between three movable points in one three-space pose to three corresponding fixed points in another three-space pose. This change of basis is a general rigid-body transformation (translation and rotation), with the addi... | 3-D transform; summed-squared-distance; three movable points; Three-space | 1998 |
| 96 |
 |
Yang, Yue; Gopalakrishnan, Ganesh; Lindstrom, Gary E.; Slind, Konrad Lee | Analyzing the Intel Itanium memory ordering rules using logic programming and SAT | We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constraints on execution traces, in an axiomatic style. A direct translation of the semantics to a constraint logic program... | Intel Itanium memory; Ordering rules; Sared memory; Consistency models | 2003 |
| 97 |
 |
Bargteil, Adam Wade | Animation of deformable bodies with quadratic bézier finite elements | In this article, we investigate the use of quadratic finite elements for graphical animation of deformable bodies.We consider both integrating quadratic elements with conventional linear elements to achieve a computationally efficient adaptive-degree simulation framework as well as wholly quadratic ... | | 2014-01-01 |
| 98 |
 |
Tasdizen, Tolga; Whitaker, Ross T. | Anisotropic diffusion of surface normals for feature preserving surface reconstruction | For 3D surface reconstruction problems with noisy and incomplete range data measured from complex scenes with arbitrary topologies, a low-level representation, such as level set surfaces, is used. Such surface reconstruction is typically accomplished by minimizing a weighted sum of data-model dis... | Anisotropic diffusion; Surface reconstruction | 2003-04-18 |
| 99 |
 |
Henderson, Thomas C. | Apparent symmetries in range data | A 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 systems | 1987 |
| 100 |
 |
Pulsipher, Dennis Carl | Application of adaptive noise cancellation to noise reduction in audio signals | The LMS adaptive noise cancellation algorithm has been applied to the removal of high-level white noise from audio signals. Simulations and actual acoustically recorded signals have been processed successfully, with excellent agreement between the results obtained from simulations and the results ob... | Noise cancellation; Noise reduction; White noise; LMS algorithm | 1979 |
| 101 |
 |
Boll, Steven F. | Application of the saber method for improved spectral analysis of noisy speech | A stand alone noise suppression algorithm is described for reducing the spectral effects of acoustically added noise in speech. A fundamental result is developed which shows that the spectral magnitude of speech plus noise can be effectively approximated as the sum of magnitudes of speech and noise.... | Noise suppression algorithm; SABER method | 1977 |
| 102 |
 |
Riesenfeld, Richard F. | The application of total positivity to computer aided curve and surface design | Of particular importance in an interactive curve and surface design system is the interface to the user. The mathematical model employed in the system must be sufficiently flexible for interaction between designer and machine to converge to a satisfactory result. The mathematical theory of Total Pos... | interactive curves; total positivity | 1979 |
| 103 |
 |
Jacobson, Hans; Gopalakrishnan, Ganesh | Application specific asynchronous microengines for efficient high-level control | Despite the growing interest in asynchronous circuits programmable asynchronous controllers based on the idea of microprogramming have not been actively pursued Since programmable control is widely used in many commercial ASICs to allow late correction of design errors to easily upgrade product f... | Asynchronous microengines | 1997 |
| 104 |
 |
Jacobson, Hans | Application specific asynchronous microgengines for efficient high-level control | Despite the growing interest in asynchronous circuits, programmable asynchronous controllers based on the idea of microprogramming have not been actively pursued. Since programmable control is widely used in many commercial ASICs to allow late correction of design errors, to easily upgrade product ... | Asynchronous microgengines; Programmable asynchronous controllers | 1997 |
| 105 |
 |
Venkatasubramanian, Suresh | Approximate Bregman near neighbors in sublinear time: beyond the triangle inequality | Bregman divergences are important distance measures that are used extensively in data-driven applications such as computer vision, text mining, and speech processing, and are a key focus of interest in machine learning. Answering nearest neighbor (NN) queries under these measures is very important i... | | 2012-01-01 |
| 106 |
 |
Henderson, Thomas C. | Arc and path consistency revisited | Mackworth and Freuder have analyzed the time complexity of several constraint satisfaction algorithms [4]. We present here new algorithms for arc and path consistency and show that the arc consistency algorithm is optimal in time complexity and of the same order space complexity as the earlier algor... | Arc consistency; Path consistency; Constraint satisfaction algorithms | 1985 |
| 107 |
 |
Wehrli, Robert | ARCAID: The ARChitects computer graphics AID | ARCAID?The ARChitect's Computer Graphics AID?is one part of a two-part research program at the University of Utah under the direction of David C. Evans. ARCAID is a specification for the organization of computer processes including data and procedures for the use of architects, engineers, and other... | ARCAID | 1970 |
| 108 |
 |
Balasubramonian, Rajeev | Architecting efficient interconnects for large caches with CACTI 6.0 | Efficiently executing multithreaded applications on future multicores will require fast intercore communication. Most of this communication happens via reads and writes to large shared caches in the memory hierarchy. Microprocessor performance and power will be strongly influenced by the long inter... | Interconnects; CACTI 6.0; Non-uniform cache architectures (NUCA) | 2008-01 |
| 109 |
 |
Davis, A.L. | The architecture of DDMl: a recursively structured data driven machine | An architecture for a highly modular, recursively structured class of machines is presented. DDMl is an instance of such a machine structure, and is capable of executing machine language programs which are data driven (data flow) nets. These nets may represent arbitrary amounts of concurrency as wel... | DDMl; machine structure; machine language programs | 1977 |
| 110 |
 |
Regehr, John | ARMor: fully verified software fault isolation | We have designed and implemented ARMor, a system that uses software fault isolation (SFI) to sandbox application code running on small embedded processors. Sandboxing can be used to protect components such as the RTOS and critical control loops from other, less-trusted components. ARMor guarantees m... | | 2011-01-01 |
| 111 |
 |
Gooch, Bruce; Reinhard, Erik; Moulding, Chris; Shirley, Peter S. | Artistic composition for image creation | Altering the viewing parameters of a 3D object results in computer graphics images of varying quality. One aspect of image quality is the composition of the image. While the esthetic properties of an image are subjective, some heuristics used by artists to create images can be approximated quanti... | Image creation; Image quality | 2000 |
| 112 |
 |
Shirley, Peter S.; Gooch, Bruce | Artistic vision: painterly rendering using computer vision techniques | We present a method that takes a raster image as input and produces a painting-like image composed of strokes rather than pixels. Unlike previous automatic painting methods, we attempt to keep the number of brush-stroke small. This is accomplished by first segmenting the image into features, finding... | Painting-like image; Raster image; Painterly rendering | 2000 |
| 113 |
 |
Carter, John B. | AS-COMA: An adaptive hybrid shared memory Architecture | Scalable shared memory multiprocessors traditionally use either a cache coherent nonuniform memory access (CC-NUMA) or simple cache-only memory architecture (S-COMA) memory architecture. Recently, hybrid architectures that combine aspects of both CC-NUMA and S-COMA have emerged. In this paper, we pr... | AS-COMA; Hybrid shared memory | 1998 |
| 114 |
 |
Carter, Tony M. | ASSASSIN : a CAD system for self-timed control-unit design | Many software systems exist for automatically implementing synchronous state machines . Presented is this paper is a software system -- ASSASSIN -- for the design and automatic layout of self-timed (or speed- independent) control units as integrated circuit modules. | ASSASSIN; Self-timed control units | 1982 |
| 115 |
 |
Sikorski, Kris | 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 |
| 116 |
 |
Gopalakrishnan, Ganesh | Asynchronous circuit verification using trace theory and CCS | We investigate asynchronous circuit verification using Dill's trace theory as well as Milner's CCS (as mechanized by the Concurrency Workbench). Trace theory is a formalism specifically designed for asynchronous circuit specification and verification. CCS is a general purpose calculus of communicat... | Trace theory; Verification; CCS | 1992 |
| 117 |
 |
Regehr, John | Atomicity and visibility in tiny embedded systems | Visibility is a property of a programming language's memory model that determines when values stored by one concurrent computation become visible to other computations. Our work exploits the insight that in nesC, a C-like language with explicit atomicity, the traditional way of ensuring timely visib... | | 2006-01-01 |
| 118 |
 |
Regehr, John | Augmented CPU reservations: towards predictable execution on general-purpose operating systems | One problem with performing soft real-time computations on general-purpose operating systems is that these OSs may spend significant amounts of time in the kernel instead of performing work on behalf of the application that is nominally scheduled: the OS effectively steals time from the running appl... | | 2001-01-01 |
| 119 |
 |
Zhu, Xiaohong | Automatic compensating cleanup operation | Today's part geometries are becoming ever more complex and require more accurate tool path to manufacture. Machining process efficiency is also a major consideration for designers as well as manufacturing engineers. Although the current advanced CAD/CAM systems have greatly improved the efficiency ... | Part geometries | 1989 |
| 120 |
 |
Gooch, Bruce; Shirley, Peter S. | Automatic image creation via artistic composition principles | Methods for choosing image parameters in both art and computer graphics are currently subjective. The choice of parameters results in images of varying quality. One aspect of image quality is the composition of the image. While the principles underlying composition are somewhat subjective, a portion... | Image parameters | 2000 |
| 121 |
 |
Lee, Hyo Jong | 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 |
| 122 |
 |
Shirley, Peter S.; Gooch, Bruce | Automatic painting with economized strokes | We present a method that takes a raster image as input and produces a painting-like image composed of strokes rather than pixels. Unlike previous automatic painting methods, we attempt to use very few brush-strokes. This is accomplished by first segmenting the image into features, finding the medial... | Raster image; Painting-like image; Automatic painting methods | 2000 |
| 123 |
 |
Brunvand, Erik L. | Automatic rapid prototyping of semi-custom VLSI circuits using actel FPGAs | Abstract : We describe a technique for translating semi-custom VLSI circuits automatically into field programmable gate arrays (FPGAs) for rapid prototyping to develop a system. Using an array multiplier as an example of this translation, the VLSI circuits are designed using a cell-matrix based envi... | | 1995 |
| 124 |
 |
Smith, Kent F. | Automatic rapid prototyping of semi-custom VLSI circuits using FPGAs | We describe a technique for translating semi-custom VLSI circuits automatically, integrating two design environments, into field programmable gate arrays (FPGAs) for rapid and inexpensive prototyping. The VLSI circuits are designed using a cell-matrix based environment that produces chips with densi... | Semi-custom; VLSI circuits | 1994 |
| 125 |
 |
Cohen, Elaine | Automatic sculptured five-axis milling with check surfaces | An approach to 5-axis milling of B-spline surfaces is presented. Within its domain, it provides better check surface handling than APT. The scheme for tool position generation is based on a B-spline curve refinement method and a set of criteria for tolerance control which allows the tool positions ... | B-spline surfaces; 5-axis milling; Tool paths | 1989 |
| 126 |
 |
Fuchs, Henry | The automatic sensing and analysis of 3-D surface points from visual scenes | Described are the design and implementation of a new range-measuring sensing device and an associated software algorithm for constructing surface descriptions of arbitrary three-dimensional objects from single or multiple views. The sensing device, which measures surface points from objects in its ... | Range-measuring; Sensing device | 1976 |
| 127 |
 |
Riloff, Ellen M. | Automatically constructing a dictionary for information extraction tasks | Knowledge-based natural language processing systems have achieved good success with certain tasks but they are often criticized because they depend on a domain-specific dictionary that requires a great deal of manual knowledge engineering. This knowledge engineering bottleneck makes knowledge-based ... | Information extraction; Dictionary construction; Knowledge-based systems; AutoSlog; Domain-specific dictionary | 1993 |
| 128 |
 |
Freire, Juliana | Automatically extracting form labels | We describe a machine-learning-based approach for extracting attribute labels from Web form interfaces. Having these labels is a requirement for several techniques that attempt to retrieve and integrate data that reside in online databases and that are hidden behind form interfaces, including schema... | Learning classifiers | 2008 |
| 129 |
 |
Riloff, Ellen M. | Automatically generating extraction patterns from untagged text | Many corpus-based natural language processing systems rely on text corpora that have been manually annotated with syntactic or semantic tags. In particular, all previous dictionary construction systems for information extraction have used an annotated training corpus or some form of annotated input... | Information extraction; Automatically generating; Extraction patterns; Untagged text; Corpus-based; AutoSlog-TS; AutoSlog system; MUC-4; Dictionary construction | 1996 |
| 130 |
 |
Davis, Al | Automating the design of embedded domain specific accelerators | Domain specific architecture (DSA) design currently involves a lengthy process that requires significant designer knowledge, experience, and time in arriving at a suitable code generator and architecture for the target application suite. Given the stringent time to market constraints and the dyna... | Domain specific architecture; Stall cycle analysis; SCA; Domain specific accelerators | 2008 |
| 131 |
 |
Sobh, Tarek M. | Autonomous Observation | We address the problem of observing an agent. We advocate a modeling approach for the visual system and its observer, where a discrete event dynamic system (DEDS) framework is developed and "events" are defined as ranges on parameter subsets. The dynamic recursive context for finite state machines (... | Observation; Manipulation process | 1992 |
| 132 |
 |
Sobh, Tarek M. | Autonomous observation | We address the problem of observing an agent?? We advocate a modeling approach for the visual system and its observer where a discrete event dynamic system DEDS framework is developed and events are de ned as ranges on parameter subsets?? The dynamic recursive context for nite state machine... | Autonomous observation | 1992 |
| 133 |
 |
Carter, John B. | The avalanche myrinet simulation package | This is a user manual for version 2.0 of the Myrinet simulation package. Users of the V2.0 package can specify arbitrary network topologies composed of Myrinet switches with different number of ports. For example, 4-port and 32-port switches can be used in a single system. Because the V2.0 model sup... | Avalanche Myrinet; Simulation Package; User manual; Myrinet switches; port switches | 1996 |
| 134 |
 |
Carter, John B. | The avalanche myrinet simulation package user manual for V2.0 | This is a user manual for Version 2.0 of the Myrinet simulation package Users of the V2.0 pack age can specify arbitrary network topologies composed of Myrinet switches with different number of ports For example port and 4-port switches can be used in a single system Because the V2.0 model suppor... | Avalanche Myrinet; Simulation Package; user manual; Myrinet switches; Port switches | 1996 |
| 135 |
 |
Carter, John B.; Davis, Al; Kuramkote, Ravindra; Stoller, Leigh B. | Avalanche: A communication and memory architecture for scalable parallel computing | As the gap between processor and memory speeds widens?? system designers will inevitably incorpo rate increasingly deep memory hierarchies to maintain the balance between processor and memory system performance At the same time?? most communication subsystems are permitted access only to main m... | Avalanche; Communication architecture; Memory architecture | 1995 |
| 136 |
 |
Carter, John B. | Avalanche: A communication and memory architecture for scalable parallel computing | As the gap between processor and memory speeds widens, system designers will inevitably incorporate increasingly deep memory hierarchies to maintain the balance between processor and memory system performance. At the same time, most communication subsystems are permitted access only to main memory ... | Avalanche; Computer memory; Memory architecture | 1995 |
| 137 |
 |
Stark, Michael M.; Martin, William; Cohen, Elaine; Lyche, Tom; Riesenfeld, Richard F. | B-splines for physically-based rendering | Although B-spline curves and surfaces have enjoyed a long established place in the graphics community as constructive modeling tools, the use of B-spline approximation techniques has received relatively little attention in rendering. In this work we explore the use of 4D and 5D tensor product B-s... | B-spline curves; Rendering algorithms | 2002-01-09 |
| 138 |
 |
Lindstrom, Gary E. | Backtracking in generalized control settings | Backtracking is a powerful conceptual and practical technique in programming. However, its application in general has been limited to global control over recursive programs. In this paper we explore through several examples the coherence and utility of applying backtracking in more general control s... | Backtracking | 1977 |
| 139 |
 |
Freire, Juliana | Beyond depth-first strategies: improving tabled logic programs through alternative scheduling | Tabled evaluation ensures termination for programs with finite models by keeping track of which subgoals have been called. Given several variant subgoals in an evaluation, only the fi rst one encountered will use program-clause resolution; the rest will resolve with the answers generated by the f... | Alternate scheduling; SLG-WAM; Tabled logic programs | 1998 |
| 140 |
 |
Freire, Juliana | Beyond depth-first: improving tabled logic programs through alternative scheduling strategies | Tabled evaluations ensure termination of logic programs with fi nite models by keeping track of which subgoals have been called Given several variant subgoals in an evaluation, only the fi rst one encountered will use program clause resolution the rest uses answer resolution This use of answer r... | Alternate scheduling; SLG-WAM; Tabled logic programs | 1996 |
| 141 |
 |
Hansen, Charles D. | Binary-swap and shear-warp volume renderer on the T3D | Large parallel machines give today's scientists the ability to compute very large simulations which may generate equally large data. Not only does having visualization tools on the parallel system allow the scientist to take advantage of the large memory to visualize the data, the processing power a... | Volume rendering; Binary-swap | 1995 |
| 142 |
 |
Hansen, Charles D. | Binary-swap volumetric rendering on the T3D | This paper presents a data distributed parallel raytraced volume rendering algorithm and its implementation on the CRI T3D. This algorithm distributes the data and the computational load to individual processing units to achieve fast and high-quality rendering of high-resolution data. The volume dat... | Volume rendering; Binary-swap; Ray tracing; Parallel rendering | 1995 |
| 143 |
 |
Johnson, Christopher R. | Biomedical visual computing: case studies and challenges | Advances in computational geometric modeling, imaging, and simulation let researchers build and test models of increasing complexity, generating unprecedented amounts of data. As recent research in biomedical applications illustrates, visualization will be critical in making this vast amount of data... | | 2012-01-01 |
| 144 |
 |
Gerpheide, George E. | Bit-driven logic: a style of digital logic for VLSI design | This memo describes a new style of low-level digital logic design called Bit-Driven Logic (BDL) which may prove attractive for the design of VLSI chips. BDL is an application of speed-independent, data-flow ideas to a very low level. It has the advantages of good locality, clockless operation, and... | Bit-Driven Logic; BDL; Digital logic design; VLSI chips | 1980 |
| 145 |
 |
Riloff, Ellen M. | Bootstrapping for text learning tasks | When applying text learning algorithms to complex tasks, it is tedious and expensive to hand-label the large amounts of training data necessary for good performance. This paper presents bootstrapping as an alternative approach to learning from large sets of labeled data. Instead of a large quantity ... | Bootstrapping; Text learning algorithms; Seed information | 1999 |
| 146 |
 |
Riloff, Ellen M. | Bootstrapping method for learning semantic lexicons using extraction pattern contexts | This paper describes a bootstrapping algorithm called Basilisk that learns high-quality semantic lexicons for multiple categories. Basilisk begins with an unannotated corpus and seed words for each semantic category, which are then bootstrapped to learn new words for each category. Basilisk hypothe... | Basilisk; Bootstrapping method; Semantic lexicons | 2002 |
| 147 |
 |
Hansen, Charles D. | Boundary aware reconstruction of scalar fields | In visualization, the combined role of data reconstruction and its classification plays a crucial role. In this paper we propose a novel approach that improves classification of different materials and their boundaries by combining information from the classifiers at the reconstruction stage. Our ap... | | 2014-01-01 |
| 148 |
 |
Gopalakrishnan, Ganesh | Bounded transaction model checking | Industrial cache coherence protocol models often have too many reachable states, preventing full reachability analysis even for small model instances (number of processors, addresses, etc.). Several partial search debugging methods are, therefore, employed, including lossy state compression using... | Model checking; Reachability analysis | 2006-02-27 |
| 149 |
 |
Freire, Juliana | Bridging the XML-relational divide with LegoDB: a demonstration | We present LegoDB, a cost-based XML storage mapping engine that automatically explores a space of possible XML-to-relational mappings and selects an efficient mapping for a given application. | LegoDB; Storage mappings | 2003 |
| 150 |
 |
Brandt, Richard C. | 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 |
| 151 |
 |
Starkey, Mike | C-RISC A C language reduced instruction set computer | This project is the implementation of a Reduced Instruction Set Computer (RISC) on a tiny chip. RISC technology is based on the idea that a small number of simple instructions can be used to create a fast, flexible computer. Our RISC uses this principle while staying within the confines of the tiny ... | RISC; C language | 1990 |
| 152 |
 |
Weinstein, David | Cache-rings for memory efficient isosurface construction | Processor speeds continue to increase at faster rates than memory speeds. As this performance gap widens, it becomes increasingly important to develop "memory-conscious" algorithms - programs that still optimize instruction count and algorithmic complexity, but that also integrate optimizations for ... | Processor speeds; Memory speeds; Computer memory; Cache-rings | 1997 |
| 153 |
 |
Hansen, Charles D.; Henderson, Thomas C. | 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 |
| 154 |
 |
Hansen, Charles D. | 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 |
| 155 |
 |
Hansen, Charles D.; Henderson, Thomas C. | CAD-based robotics | We 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 System | 1987 |
| 156 |
 |
Henderson, Thomas C.; Bhanu, Bir | CAGD based 3-D visual recognition | A coherent automated manufacturing system needs to include CAD/CAM, computer vision, and object manipulation. Currently, most systems which support CAD/CAM do not provide for vision or manipulation and similarly, vision and manipulation systems incorporate no explicit relation to CAD/CAM models. CAD... | Object manipulation; CAGD | 1985 |
| 157 |
 |
Hansen, Charles D.; Henderson, Thomas C. | CAGD based 3-D visual recognition | A coherent automated manufacturing system needs to include CAD/CAM, computer vision, and object manipulation. Currently, most systems which support CAD/CAM do not provide for vision or manipulation and similarly, vision and manipulation systems incorporate no explicit relation to CAD/CAM models. CAD... | Visual recognition; Computer Aided Geometric Design (CAGD) | 1986 |
| 158 |
 |
Hansen, Charles D.; Henderson, Thomas C. | CAGD-based computer vision | Three-dimensional model-based computer vision uses geometric models of objects and sensed data to recognize objects in a scene. Likewise, Computer Aided Geometric Design (CAGD) systems are used to interactively generate three-dimensional models during the design process. Despite this similarity, the... | Computer Aided Geometric Design (CAGD); CAD-based vision; Model based vision; Strategy trees; Geometric knowledge representation; Automatic feature selection | 1987 |
| 159 |
 |
Hansen, Charles D. | CAGD-based computer vision | Abstract-Three-dimensional model-based computer vision uses geometric models of objects and sensed data to recognize objects in a scene. Likewise, computer aided geometric design (CAGD) systems are used to interactively generate three-dimensional models during the design process. Despite this simil... | | 1989-11 |
| 160 |
 |
Henderson, Thomas C. | CAGD-based computer vision | Three-dimensional model-based computer vision uses geometric models of objects and sensed data to recognize objects in a scene. Likewise, Computer Aided Geometric Design (CAGD) systems are used to interactively generate three-dimensional models during the design process. Despite this similarity, t... | Computer Aided Geometric Design; CAGD | 1987 |
| 161 |
 |
Bhanu, Bir | CAOS an approach to robot control | Control systems which enable robots to behave intelligently is a major issue in todays process of automating factories. This thesis presents a hierarchical robot control system, a programming language for goal achievement, termed CAOS for Control using Action Oriented Schemata, with ideas taken fro... | Robot control system; CAOS; Control using Action Oriented Schemata | 1987 |
| 162 |
 |
Carter, Tony M. | 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 |
| 163 |
 |
Carter, Tony M. | Cascade: hardware for high/variable precision arithmetic | 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... | | 1989 |
| 164 |
 |
Regehr, John | The case for hierarchical schedulers with performance guarantees | | | 2000-01-01 |
| 165 |
 |
Gopalakrishnan, Ganesh | Case studies in symbolic model checking | The need to formally verify hardware and software systems before they are deployed the real world has been recognized for several decades now. This is especially true of concurrent systems that are even more difficult to debug than sequential systems. For example, many of the protocols that get emp... | Symbolic model checking; Hardware verification; Software verification | 1994 |
| 166 |
 |
Riloff, Ellen M. | Case study in using linguistic phrases for text categorization on the WWW | Most learning algorithms that arc applied to text categorization problems rely on a bag-of-words document representation, i.e., each word occurring in the document is considered as a separate feature. In this paper, we investigate the use of linguistic phrases as input features for text categoriz... | Learning algorithms; Text categorization; Linguistic phrases; Information extraction patterns; AutoSlog-TS | 1998 |
| 167 |
 |
Hansen, Charles D. | Case study of isosurface extraction algorithm performance | Isosurface extraction is an important and useful visualization method. Over the past ten years, the field has seen numerous isosurface techniques published, leaving the user in a quandary about which one should be used. Some papers have published complexity analysis of the techniques, yet empirical... | Isosurfaces; Contours | 2000 |
| 168 |
 |
Cates, Joshua E.; Whitaker, Ross T.; Jones, Greg M. | Case study: an evaluation of user-assisted hierarchical watershed segmentation | While level sets have demonstrated a great potential for 3D medical image segmentation, their usefulness has been limited by two problems. First, 3D level sets are relatively slow to compute. Second, their formulation usually entails several free parameters which can be very difficult to correctl... | Watershed segmentation; Brain tumor imaging | 2004-02-27 |
| 169 |
 |
Organick, Elliott I. | CASL - A language for automating the implementation of computer architectures | The computer Architecture Specification Language (CASL), described in this paper, is intended for use by computer architects CASL is a state machine description language especially useful for describing digital systems at the "register transfer" level and designed to meet the needs of the computer a... | Computer Architecture Specification Language | 1979 |
| 170 |
 |
Regehr, John | Cause reduction for quick testing | Abstract-In random testing, it is often desirable to produce a "quick test" - an extremely inexpensive test suite that can serve as a frequently applied regression and allow the benefits of random testing to be obtained even in very slow or oversubscribed test environments. Delta debugging is an alg... | | 2014-01-01 |
| 171 |
 |
Henderson, Thomas C. | CBCV: A CAD-based vision system | The CBCV system has been developed in order to provide the capability of automatically synthesizing executable vision modules for various functions like object recognition, pose determinaion, quality inspection, etc. A wide range of tools exist for both 2D and 3D vision, including not only software... | CBCV | 1990 |
| 172 |
 |
Carter, Tony M.; Smith, Kent F. | 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 |
| 173 |
 |
Akella, Venkatesh | CFSIM: A concurrent compiled-code functional simulator for hopCP | Control intensive ICs pose a significant challenge to the users of formal methods in designing hardware. These ICs have to support a wide variety of requirements including synchronous and asynchronous operations, polling and interrupt-driven modes of operation, multiple concurrent threads of executi... | CFSIM; Hardware design; hopCP | 1992 |
| 174 |
 |
Organick, Elliott I. | Characteristics of a functional programming language | A programming language kernel is presented where an algorithm is a function defined through a functional expression. The only data structure introduced is an object that may be an atom or a sequence of objects. A number of functional forms are defined, with a notation close to ordinary mathematical ... | | 1980 |
| 175 |
 |
Pascucci, Valerio | Characterization and modeling of PIDX parallel I/O for performance optimization | Parallel I/O library performance can vary greatly in re- sponse to user-tunable parameter values such as aggregator count, file count, and aggregation strategy. Unfortunately, manual selection of these values is time consuming and dependent on characteristics of the target machine, the underlying fi... | | 2013-01-01 |
| 176 |
 |
Balasubramonian, Rajeev | CHOP: adaptive filter-based DRAM caching for CMP server platforms | As manycore architectures enable a large number of cores on the die, a key challenge that emerges is the availability of memory bandwidth with conventional DRAM solutions. To address this challenge, integration of large DRAM caches that provide as much as 5× higher bandwidth and as low as 1/3rd of... | CHOP; DRAM caching; CMP server platforms; Manycore architectures; Hot page; Filter cache; Multi-core processors | 2010 |
| 177 |
 |
Kniss, Joe; Ikits, Milan; Lefohn, Aaron; Hansen, Charles D. | Closed-form approximations to the volume rendering integral with Gaussian transfer functions | In direct volume rendering, transfer functions map data points to optical properties such as color and opacity. We have found transfer functions based on the Gaussian primitive to be particularly useful for multivariate volumes, because they are simple and rely on a limited number of free paramet... | Volume rendering | 2003-07-25 |
| 178 |
 |
Hansen, Charles D. | Cluster-based interactive volume rendering with Simian | Commodity-based computer clusters offer a cost-effective alternative to traditional largescale, tightly coupled computers as a means to provide high-performance computational and visualization services. The Center for the Simulation of Accidental Fires and Explosions (C-SAFE) at the University of... | Volume rendering; Simian | 2003-09-03 |
| 179 |
 |
Lindstrom, Gary E. | Combinator evaluation of functional programs with logical variables | A technique is presented that brings logical variables into the scope of the well known Turner method for evaluating normal order functioned programs by S, K, I combinator graph reduction. This extension is illustrated by SASL+LV, an extension of Turner's language SASL in which general expressions s... | Functional programs; Logical variables; SASL+LV; Turner's language | 1987 |
| 180 |
 |
Hansen, Charles D. | Combined surface and volumetric occlusion shading | In this paper, a method for interactive direct volume rendering is proposed that computes ambient occlusion effects for visualizations that combine both volumetric and geometric primitives, specifically tube shaped geometric objects representing streamlines, magnetic field lines or DTI fiber tracts.... | | 2012-01-01 |
| 181 |
 |
Pascucci, Valerio | Combining in-situ and in-transit processing to enable extreme-scale scientific analysis | With the onset of extreme-scale computing, I/O constraints make it increasingly difficult for scientists to save a sufficient amount of raw simulation data to persistent storage. One potential solution is to change the data analysis pipeline from a post-process centric to a concurrent approach based... | | 2012-01-01 |
| 182 |
 |
Freire, Juliana | Combining scheduling strategies in tabled evaluations | Tabled evaluations ensure termination for Datalog programs by distinguishing calls to tabled subgoals. Given several variant subgoals in an evaluation, only the first (the generator) will use program clause resolution, the rest (consumers) must perform answer resolution using answers computed by th... | SLG; SLG-WAM; Tabling; Local scheduling; Batched scheduling | 1997 |
| 183 |
 |
Henderson, Thomas C. | Combining symbolic and numeric computation on the CRAY | It is now widely accepted that the CRAY supercomputers are very useful for large numeric applications, e.g., Finite Element Analysis, Fluid Dynamics, Image Processing, etc. Much work has been done to make them run efficiently on the CRAY. There has also been some effort to do symbolic computing (Al ... | CRAY supercomputers; Symbolic computation; Numeric computation | 1986 |
| 184 |
 |
Balasubramonian, Rajeev | Commit algorithms for scalable hardware transactional memory | In a hardware transactional memory system with lazy versioning and lazy conflict detection, the process of transaction commit can emerge as a bottleneck. For a large-scale distributed memory system, we propose novel algorithms to implement commit that are deadlock- and livelock-free and do not empl... | Commit algorithms; Scalable; Hardware; Transactional memory | 2007 |
| 185 |
 |
Gopalakrishnan, Ganesh; Kirby, Robert Michael II | The communication semantics of the message passing interface | The Message Passing Interface (MPI) standard is a natural language document that describes a software library for interprocess communication. Automatic reasoning about the reactive nature of programs communicating via MPI libraries is not possible without also analizing the library being used. Ma... | communication semantics; Message Passing Interface; MPI; natural language | 2006-10-31 |
| 186 |
 |
Zhao, Lu; Regehr, John | Comparing program logics for reasoning about safety properties | To prove memory write and controls transfers do not interfere with other programs in embedded systems. Hoare Logic with Bale Predicate; Hoare Logic with Separation Conjunction. | | 2010-10-06 |
| 187 |
 |
Kessler, Robert R. | Compiling distributed C++ | Distributed C++ (DC++) is a language for writing parallel applications on loosely coupled distributed systems in C++. Its key idea is to extend the C++ class into 3 categories: gateway classes which act as communication and synchronization entry points between abstract processors, classes whose... | Distributed C++; DC++; Parallel applications | 1994 |
| 188 |
 |
Sikorski, Kris | Complexity of computing topological degree of Lipschitz functions in n dimensions | We find lower and upper bounds on the complexity, comp(deg), of computing t h e topological degree of functions defined on the n-dimensional unit cube Cn, f : ?Cn Rn,n ? 2, which satisfy a Lipschitz condition with constant K and whose infinity norm at each point on t h e boundary of Cn is at least d... | Lipschitz functions | 1986 |
| 189 |
 |
Susarla, Sai R.; Carter, John | Composable consistency for large-scale peer replication | The lack of a flexible consistency management solution hinders P2P implementation of applications involving updates, such as directory services, online auctions and collaboration. Managing shared data in a P2P setting requires a consistency solution that can operate in a heterogenous network, sup... | P2P | 2003-11-14 |
| 190 |
 |
Lindstrom, Gary E. | Compositionally modular Scheme | We present a new module system for Scheme that supports a high degree of implementation reuse via module composition. The module system encourages breaking down a program into the smallest possible individually meaningful modules, and recomposing them using a powerful set of adaptation and combinat... | Module system | 1995 |
| 191 |
 |
Johnson, Christopher R.; Parker, Steven G.; Whitaker, Ross T.; Hansen, Charles D. | Computational field visualization | Today, scientists, engineers, and medical researchers routinely use computers to simulate complex physical phenomena. Such simulations present new challenges for computational scientists, including the need to effectively analyze and visualize complex three-dimensional data. As simulations become mo... | Volume rendering; Isosurface extraction; Ray tracing; Multi-field visualizations | 2001 |
| 192 |
 |
Henderson, Thomas C.; Sikorski, Christopher | Computational sensor networks | We propose Computational Sensor Networks as a methodology to exploit models of physical phenomena in order to better understand the structure of the sensor network. To do so, it is necessary to relate changes in the sensed variables (e.g., temperature) to the aspect of interest in the sensor netw... | Computational sensor networks | 2007 |
| 193 |
 |
Parker, Steven G.; Hansen, Charles D.; Johnson, Christopher R. | Computational steering and the SCIRun integrated problem solving environment | SCIRun is a problem solving environment that allows the interactive construction, debugging, and steering of large-scale scientific computations. We review related systems and introduce a taxonomy that explores different computational steering solutions. Considering these approaches, we discuss why ... | Computational steering; Problem solving environment; SCIRun; Volume rendering | 1997 |
| 194 |
 |
Riesenfeld, Richard F. | Computer aided design | The report is based on the proposal submitted to the National Science Foundation in September 1981, as part of the Coordinated Experimental Computer Science Research Program. The sections covering the budget and biographical data on the senior research personnel have not been included. Also, the sec... | | 1984 |
| 195 |
 |
Riesenfeld, Richard F. | Computer aided geometric design | This book contains the edited proceedings of the first International Conference on Computer Aided Geometric Design, an important new field that draws on the principles of computer science, mathematics, and geometric design. The list of contributors includes most of the leading researchers in the... | Computer aided geometric design | 1973 |
| 196 |
 |
Gouraud, Henri | Computer display of curved surfaces | This research describes a method for producing shaped pictures of curved surfaces. It uses a small polygon approximation of the surface to solve efficiently the nidden parts detection, and then computes the shading on each polygon in such a way that visual discontinuities between adjacent polygons d... | Curved surfaces; Computer display | 1971 |
| 197 |
 |
Fletcher, Preston Thomas; Moeller, John Henry; Phillips, Jeffrey; Venkatasubramanian, Suresh | Computing hulls in positive definite space | P(n): a Riemannian manifold Definition: symmetric positive-definite (n) (n) matrices Applications: Diffusion Tensor MRI (DT-MRI) Flow through voxel modeled in P(3) Elasticity Tensors Modeled by elements of P(6) Machine Learning Used in kernels Convex Hulls Data on P(n): Want to analyze... | | 2010-10-06 |
| 198 |
 |
Pascucci, Valerio | Computing morse-smale complexes with accurate geometry | Topological techniques have proven highly successful in analyzing and visualizing scientific data. As a result, significant efforts have been made to compute structures like the Morse-Smale complex as robustly and efficiently as possible. However, the resulting algorithms, while topologically consis... | | 2012-01-01 |
| 199 |
 |
Cohen, Elaine | 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 |
| 200 |
 |
Sobh, Tarek M.; Henderson, Thomas C. | Concurrent engineering and robot prototyping | This report addresses the theoretical basis for building a prototyping environment for electromechanical systems using concurrent engineering approach. In Designing a robot manipulator, as an example of electro-mechanical systems, the interaction between several modules (S/W, VLSI, CAD, CAM, Robotic... | Robot prototyping | 1993 |
