|
|
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 |
 | 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 |
6 |
 | 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 |
7 |
 | 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 |
8 |
 | 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 |
9 |
 | 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 |
10 |
 | 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 |
11 |
 | 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 |
12 |
 | 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 |
13 |
 | 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 |
14 |
 | Bennion, Scott Thomas | A method of solution for hydrodynamics and radiation diffusion as a multi-material problem in one dimension | | Multi-material problem | 1971 |
15 |
 | 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 |
16 |
 | 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 |
17 |
 | 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 |
18 |
 | 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 |
19 |
 | 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 |
20 |
 | 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 |
21 |
 | 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 |
22 |
 | 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 |
23 |
 | 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 |
24 |
 | 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 |
25 |
 | 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 |