Filters: Collection: "ir_uspace"
| Creator | Title | Description | Subject | Date | ||
|---|---|---|---|---|---|---|
| 226 |
 |
Gopalakrishnan, Ganesh | Verification of regular arrays by symbolic simulation | Many algorithms have an efficient hardware formulation as a regular array of cells, which can be implemented in VLSI as regular circuit structures. Bit-sliced microprocessors, pattern matching circuits, associative cache memories, Hue-grain systolic arrays, and embedded memory-with-logic structure... | Verification; regular arrays; symbolic simulation | 1991 |
| 227 |
 |
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 |
| 228 |
 |
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 |
| 229 |
 |
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 |
| 230 |
 |
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 |
| 231 |
 |
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 |
| 232 |
 |
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 |
| 233 |
 |
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 |
| 234 |
 |
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 |
| 235 |
 |
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 |
| 236 |
 |
Brown, Don R. | The design and implementation of partnet | PartNet is a federated database for providing interactive online access to mechanical parts catalogs. The data contained in the vendor's product database is exported to the federated database using a networkbased distributed database protocol. A Single coherent view of these vendor databases is pro... | 1995 | |
| 237 |
 |
Shirley, Peter S. | Direct Ray tracing of smoothed and displacement mapped triangles | We present an algorithm for ray tracing displacement maps that requires no additional storage over the base model. Displacement maps are rarely used in ray tracing due to the cost associated with storing and intersecting the displaced geometry. This is unfortunate because displacement maps allow the... | Ray tracing displacement maps | 2000 |
| 238 |
 |
Orr, Douglas B.; Mecklenburg, Robert; Hoogenboom, Peter J.; Lepreau, Jay | Dynamic program monitoring and transformation using the OMOS object server | In traditional monolithic operating systems the con?? straints of working within the kernel have limited the sophistication of the schemes used to manage exe?? cutable program images By implementing an exe?? cutable image loader as a persistent user??space pro?? gram we can extend system prog... | Program monitoring; OMOS object server | 1992 |
| 239 |
 |
Gopalakrishnan, Ganesh | Explicit-enumeration based verification made memory-efficient | We investigate techniques for reducing the memory requirements of a model checking tool employing explicit enumeration. Two techniques are studied in depth: (1) exploiting symmetries in the model, and (2) exploiting sequential regions in the model. The first technique resulted in a significant reduc... | Verification; Model checking tool; Memory-efficient | 1995 |
| 240 |
 |
Richardson, William F. | Fred: an architecture for a self-timed decoupled computer | Decoupled computer architectures provide an effective means of exploiting instruction level parallelism. Self-timed micropipeline systems are inherently decoupled due to the elastic nature of the basic FIFO structure, and may be ideally suited for constructing decoupled computer architectures. Fred ... | Decoupled computer; Fred | 1995 |
| 241 |
 |
Brunvand, Erik L. | Fred: an architecture for a self-timed decoupled computer | Decoupled computer architectures provide an effective means of exploiting instruction level parallelism. Selftimed micropipeline systems are inherently decoupled due to the elastic nature of the basic FIFO structure, and may be ideally suited for constructing decoupled computer architectures. Fred ... | 1996 | |
| 242 |
 |
Henderson, Thomas C. | Instrumented sensor system architecture | Sensor systems are becoming ubiquitous throughout society, yet their design, construction and operation is still more of an art than a science. In this paper, we define, develop, and apply a formal semantics for sensor systems that provides a theoretical framework for an integrated software architec... | Instrumented sensor system; Instrumented Logical Sensor Systems; ILSS | 1997 |
| 243 |
 |
Lefohn, Aaron; Kniss, Joe; Hansen, Charles D.; Whitaker, Ross T. | Interactive deformation and visualization of level set surfaces using graphics hardware | Deformable isosurfaces, implemented with level-set methods, have demonstrated a great potential in visualization for applications such as segmentation, surface process- ing, and surface reconstruction. Their usefulness has been limited, however, by two problems. First, 3D level sets are relativel... | Interactive deformation; Deformable isosurfaces; Level-set methods | 2003-04-16 |
| 244 |
 |
Stoller, Leigh B. | Message passing support in the Avalanche widget | Minimizing communication latency in message passing multiprocessing systems is critical. An emerging problem in these systems is the latency contribution costs caused by the need to percolate the message through the memory hierarchy (at both sending and receiving nodes) and the additional cost of ma... | Avalanche widget; Message passing; Cache coherence; Message copying; Cache miss rates; Computer memory | 1996 |
| 245 |
 |
Lindstrom, Gary E. | Migrating relational data to an OODB: strategies and lessions from a molecular biology experience | The growing maturity of OODB technology is causing many enterprises to consider migrating relational databases to OODBs. While data remapping is relatively straightforward, greater challenges lie in economically and non-invasively adapting legacy application software. We report on a genetics labora... | OODB; Relational data; Data migration | 1997 |
| 246 |
 |
Cohen, Elaine | Minimum distance queries for polygonal and parametric models | Calculation of the minimum distance to a geometric object or the minimum separation between objects is a fundamental problem that has application in a variety of arenas. Minimum separation queries for sculptured surfaces are believed particularly difficult, yet are increasingly important as modeli... | Minimum separation; Minimum distance; Virtual prototyping | 1997 |
| 247 |
 |
Shirley, Peter S. | Natural image statistics for computer graphics | The class of all natural images is an infinitely small fraction of all possible images. The structure of natural images can be statistically modeled, revealing striking regularities. The human visual system appears to be optimized to view natural images, as opposed to any possible image, and therefo... | Natural image | 2001 |
| 248 |
 |
Sobh, Tarek M.; Henderson, Thomas C. | Prototyping environment for robot manipulators | Developing an environment that enables optimal and flexible design of robot manipulators using reconfigurable links, joints, actuators, and sensors is an essential step for efficient robot design and prototyping. Such an environment should have the right "mix" of software and hardware components for... | Prototyping; Robot manipulators | 1994 |
| 249 |
 |
Henderson, Thomas C. | RobotShare: a framework for robot knowledge sharing | Knowledge representation is a traditional field in artificial intelligence. Researchers have developed various ways to represent and share information among intelligent agents. Agents that share resources, data, information, and knowledge perform better than agents working alone. However, previou... | RobotShare; Robot knowledge sharing | 2007 |
| 250 |
 |
Keller, Robert M. | Semantics of parallel program graphs | A denotational model for networks of parallel processes is presented which generalizes the work of Kahn by using alternative data types, e.g. Lisp-like operators on trees. It is shown that the ordering aspect of data types plays a central role in determining how much parallelism can be present. It i... | Parallel program graphs; Computer semantics; Denotational model | 1977 |