1 - 25 of 22
| Creator | Title | Description | Subject | Date | ||
|---|---|---|---|---|---|---|
| 1 |
 | Barsky, Brian A. | A description of several tools for the synchronization of concurrent processes | Concurrent processes are tasks which may be executed simultaneously. When several such processes have access to shared variables, it is necessary to establish some regimen to control this access. Several language tools for expressing various synchronization disciplines are presented. | Concurrent processes | 1980 |
| 2 |
 | Bhanu, Bir | 3-D model building for computer vision | This paper presents a Computer-Aided Geometric Design (CAGD) based approach for building 3-D models which can be used for the recognition of 3-D objects for industrial machine vision applications. The objects are designed using the Alpha_1 CAGD system developed at the University of Utah. A new metho... | CAGD; 3-D models; Machine vision | 1985 |
| 3 |
 | Sobh, Tarek M. | A dynamic framework for intelligent inspection | CAD (Computer Aided Design) typically involves the design, manufacture and inspection of a mechanical 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. We pr... | CAD; Discrete event dynamic systems; DEDS | 1992 |
| 4 |
 | Mecklenburg, Robert | A dossier driven persistent objects facility | We describe the design and implementation of a persistent object storage facility based on a dossier driven approach. Objects are characterized by dossiers which describe both their language defined and "extra-linguistic" properties. These dossiers are generated by a C+-f- preprocessor in concert ... | Persistent object storage facility; Dossier driven | 1994 |
| 5 |
 | Mathew, Binu K.; Davis, Al | A characterization of visual feature recognition | Natural human interfaces are a key to realizing the dream of ubiquitous computing. This implies that embedded systems must be capable of sophisticated perception tasks. This paper analyzes the nature of a visual feature recognition workload. Visual feature recognition is a key component of a numb... | Visual feature recognition; Human interfaces | 2003-09-03 |
| 6 |
 | Gopalakrishnan, Ganesh | A correctness criterion for asynchronous circuit validation and optimization | We propose a new relation C. called strong conformance in the context of Dill's trace theory, and define B Q A to be true exactly when B conforms to A and the success set of B contains the success set of A. When B C. A, module B operated in module A's maximal environment AM (i.e. B || AM) exhibits a... | Validation; Optimization | 1992 |
| 7 |
 | Gooch, Amy A.; Gooch, Bruce; Willemsen, Peter; Kniss, Joe; Riesenfeld, Richard F.; Shirley, Peter S. | 3D Line textures and the visualization of confidence in Architecture | This work introduces a technique for interactive walkthroughs of non-photorealistically rendered (NPR) scenes using 3D line primitives to define architectural features of the model, as well as indicate textural qualities. Line primitives are not typically used in this manner in favor of texture ma... | Presentation graphics; Interactive walkthroughs | 2007 |
| 8 |
 | Henderson, Thomas C. | A control paradigm for general purpose manipulation systems | Mechanical end effectors capable of dextrous manipulation are now a reality. Solutions to the high level control issues, however, have so far proved difficult to formulate. We propose a methodology for control which produces the functionality required for a general purpose manipulation system. It is... | Manipulation systems | 1987 |
| 9 |
 | Panangaden, Prakash | A category theoretic formalism for abstract interpretation | We present a formal theory of abstract interpretation based on a new category theoretic formalism. This formalism allows one to derive a collecting semantics which preserves continuity of lifted functions and for which the lifting functon is itself continuous. The theory of abstract interpretation i... | Formal theory; Theoretic formalism; Lifted functions | 1984 |
| 10 |
 | Brunvand, Erik L. | A correctness criterion for asynchronous circuit validation and optimization | In order to reason about the correctness of asynchronous circuit implementations and specifications, Dill has developed a variant of trace theory [1]. Trace theory describes the behavior of an asynchronous circuit by representing its possible executions as strings called "traces" A useful relatio... | Asynchronous circuits; Circuit optimizations; Formal verification of hardware; Trace theory; Asynchronous circuit validation | 1992 |
| 11 |
 | Brunvand, Erik L. | A cell set for self-timed design using actel FPGAs | Asynchronous or self-timed systems that do not rely on a global clock to keep system components synchronized can offer significant advantages over traditional clocked circuits in a variety of applications. However, these systems require that suitable self-timed circuit primitives are available for b... | Self-timed systems; Actel field programmable gate arrays; FPGA | 1991 |
| 12 |
 | Carter, John | A collective approach to harness idle resources | We propose a collective approach for harnessing the idle resources (cpu, storage, and bandwidth) of nodes (e.g., home desktops) distributed across the Internet. Instead of a purely peer-to-peer (P2P) approach, we organize participating nodes to act collectively using collective managers (CMs). Pa... | Idle resources; Computer nodes | 2008 |
| 13 |
 | Evans, John; Kessler, Robert R. | A communication-ordered task graph allocation algorithm | The inherently asynchronous nature of the data flow computation model allows the exploitation of maximum parallelism in program execution?? While this computational model holds great promise several problems must be solved in order to achieve a high degree of program performance?? The allocation... | Data flow computation model | 1992 |
| 14 |
 | Zhang, Lixin | A comparison of online superpage promotion mechanisms | The amount of data that a typical translation lookaside buffer (TLB) can map has not kept pace with the growth in cache sizes and application footprints. As a result, the cost of handling TLB misses limits the performance of an increasing number of applications. The use of superpages, multiple adjac... | Superpages; Translation lookaside buffer; TLB | 1999 |
| 15 |
 | Kessler, Robert R. | A communication-ordered task graph allocation algorithm | The inherently asynchronous nature of the data flow computation model allows the exploitation of maximum parallelism in program execution. While this computational model holds great promise, several problems must be solved in order to achieve a high degree of program performance. The allocation and ... | Task graph allocation algorithm | 1992 |
| 16 |
 | Henderson, Thomas C. | 2-D scene analysis using split-level relaxation | We present a new method for applying multiple semantic constraints based on discrete relaxation. A separate graph is maintained for each constraint relation and used in parallel to achieve a consistent labeling. This permits both local and global analysis without recourse to complete graphs. Here l... | Discrete relaxation; Split-level relaxation | 1985 |
| 17 |
 | Carter, John B. | A comparison of software and hardware synchronization mechanisms for distributed shared memory multiprocessors | Efficient synchronization is an essential component of parallel computing. The designers of traditional multiprocessors have included hardware support only for simple operations such as compare-and-swap and load-linked/store-conditional, while high level synchronization primitives such as locks, bar... | Hardware locks | 1996 |
| 18 |
 | Davis, Alan L. | A characterization of parallel systems | a taxonomy for parallel processing systems is presented which has some advantages over previous taxonomies. The taxonomy characterizes parallel processing systems using four parameters: topology, communication, granularity, and operation. These parameters and used repetitively in a hierarchical fash... | Parallel systems | 1980 |
| 19 |
 | Gopalakrishnan, Ganesh | A compositional model for synchronous VLSI systems | Currently available hardware specification languages have two serious deficiencies: (i) inadequate protocol definition capabilities; (ii) lack of a compositional model. We now explain these in more detail. | Very large scale integration; VLSI systems | 1987 |
| 20 |
 | McDirmid, Sean; Eide, Eric Norman; Hsieh, Wilson C. | A comparison of Jiazzi and AspectJ for feature-wise decomposition | Feature-wise decomposition is an important approach to building configurable software systems. Although there has been research on the usefulness of particular tools for featurewise decomposition, there are not many informative comparisons on the relative effectiveness of different tools. In this... | Jiazzi; AspectJ; Feature-wise decomposition | 2004-03-23 |
| 21 |
 | A distributed garbage collection algorithm | Concurrent Scheme extends the Scheme programming language, providing parallel program execution on a distributed network. The Concurrent Scheme environment requires a garbage collector to reclaim global objects; objects that exist in a portion of the global heap located on the node that created them... | Concurrent Scheme; Garbage collection algorithm | 1992 | |
| 22 |
 | Evans, John | A distributed object-oriented graphical programming system | This report presents the design of a distributed parallel object system (DPOS) and its implementation using a graphical editing interface. DPOS brings together concepts of object-oriented programming and graphical programming with aspects of modern functional languages. Programs are defined as netwo... | Distributed parallel object system; DPOS | 1990 |
1 - 25 of 22