|
|
Creator | Title | Description | Subject | Date |
276 |
|
Gopalakrishnan, Ganesh | Performance studies of PV: an On-the-fly model-checker for LTL-X featuring selective caching and partial order reduction | We present an enumerative model-checker PV that uses a new partial order reduction algorithm called Twophase. This algorithm does not use the in-stack check to implement the proviso, making the combination of Twophase with on-the-fly LTL-X model-checking based on nested depth-first search, as well a... | Model-checker; PV; Performance; On-the-fly; Partial order reduction algorithm;' Twophase | 2001 |
277 |
|
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 |
278 |
|
Gooch, Bruce; Reinhard, Erik | Perception-driven black-and-white drawings and caricatures | In this paper, we present a method for automatically creating black-and-white drawings of human faces from photographs. We then demonstrate new techniques for deforming these drawings to create caricatures intended to highlight and exaggerate facial features. A number of psychophysical studies we... | Caricatures; Human faces | 2002-01-22 |
279 |
|
Hansen, Charles D. | Volume Ray casting with peak finding and differential sampling | Direct volume rendering and isosurfacing are ubiquitous rendering techniques in scientific visualization, commonly employed in imaging 3D data from simulation and scan sources. Conventionally, these methods have been treated as separate modalities, necessitating different sampling strategies and ren... | | 2009-11 |
280 |
|
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 |
281 |
|
Keller, Robert M. | Semantics of networks containing indeterminate operators | We discuss a denotational semantics for networks containing indeterminate operators. Our approach is based on modelling a networks by the set of all its possible behaviors. Our notion of behavior is a sequence of computational actions. The primitive computational action is an event: the appearance o... | | 1984 |
282 |
|
Kirby, Robert Michael II | On the use of adjoint-based sensitivity estimates to control local mesh refinement | The goal of efficient and robust error control, through local mesh adaptation in the computational solution of partial differential equations, is predicated on the ability to identify in an a posteriori way those localized regions whose refinement will lead to the most significant reductions in the ... | Sensitivity; Adaptivity; Error estimation; hp-finite elements; Discrete adjoint; Mesh refinement | 2009 |
283 |
|
Brown, Bruce Eric | Modeling of solids for three-dimensional finite element analysis | The geometric modeling of solid objects is a major problem within the design analysis loop of the engineering design process. Models are analyzed by various computer programs to predict their performance. The format of each model is usually different for each analysis routine. The existence of sev... | Geometric modeling; Solid objects; Finite element analysis | 1977 |
284 |
|
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 |
285 |
|
Lindstrom, Gary E. | Modular language processors as framework completions | The conceptual and specificational power of denotational semantics for programming language design has been amply demonstrated. We report here on a language implementation method that is similarly semantically motivated, but is based upon object-oriented design principles, and results in flexible an... | Modular language processors; Denotational semantics; Framework completions | 1993 |
286 |
|
Henderson, Thomas C.; Sikorski, Christopher | Symmetry: a basis for sensorimotor reconstruction | Given a set of unknown sensors and actuators, sensorimotor reconstruction is achieved by exploiting relations between the sensor data and the actuator control data to determine sets of similar sensors, sets of similar actuators, necessary relations between them, as well as sensorimotor relations ... | sensorimotor reconstruction; sensor data; actuator control data | 2011 |
287 |
|
Brunvand, Erik L. | Self-timed circuits using DCVSL semi-bundled delay wrappers | We present a technique for generating robust self-timed completion signals for general dynamic datapath circuits. The wrapper circuit is based on our previous domino semi-bundled delay (SBD) circuits, but uses DCVSL circuits in the wrapper for higher performance. We describe the basic SBD-DCVSL... | | 2005 |
288 |
|
Lindstrom, Gary E. | Toward function-based distributed database systems | We discuss the suitability of a function-based (or "applicative") approach to the construction of distributed database systems. Certain aspects of applicative systems are immediatley appealing for this purpose (e.g. data oriented toward conceptual objects rather than toward particular representation... | Function-based; distributed database systems; applicative | 1982 |
289 |
|
Carter, John B. | Design of a parallel vector access unit for SDRAM memory systems | Parallel Vector Access is a technique that exploits the regularity of vector or stream accesses to perform them efficiently in parallel on a multi-bank memory system. The performance of applications that have vector accesses may be improved using a memory controller that performs scatter/gather oper... | Parallel vector access; SDRAM memory; Multi-bank memory system | 1999 |
290 |
|
Gopalakrishnan, Ganesh | Some recent asynchronous system design methodologies | We present an in-depth study of some techniques for asynchronous system design, analysis, and verification. After defining basic terminology, we take one simple example - a four-phase t o two-phase converter - and present its design using (a) classical flow-tables; (b) Signal Transition Graphs of [... | Asynchronous system design | 1990 |
291 |
|
Balasubramonian, Rajeev | Dynamically managing the communication-parallelism trade-off in future clustered processors | Clustered microarchitectures are an attractive alternative to large monolithic superscalar designs due to their potential for higher clock rates in the face of increasingly wire-delay-constrained process technologies. As increasing transistor counts allow an increase in the number of clusters, th... | Clustered architectures; Microarchitecture; Decentralized cache; Interconnects | 2003 |
292 |
|
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 |
293 |
|
Bruderlin, Beat | Moving into higher dimensions of geometric constraint solving | In this paper, we present an approach to geometric constraint solving, based on degree of freedom analysis. Any geometric primitive (point, line, circle, plane, etc.) possesses an intrinsic degree of freedom in its embedding space which is usually two or three dimensional. Constraints reduce the deg... | Geometric constraint solving | 1994 |
294 |
|
Gopalakrishnan, Ganesh | Formal specification of the virtual component interface standard in the unified modeling language | As part of our charge from the Virtual Sockets Interface Alliance we search for a notation in which standards documents can be precisely specified. We approach the specification for standard problem in the context of the Virtual Component Interface Standard. We propose six orthogonal axes of specifi... | Unified Modeling Language | 2001 |
295 |
|
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 |
296 |
|
Zhang, Lixin | UVSIM user manual: version 0.1 | This document describes UVSIM?the UltraViolet Simulator. UVSIM is an execution-driven simulator modeling the Ultraviolet system, SGI?s entry in DARPA?s HPCS Initiative. | UVSIM; user manual; UltraViolet Simulator; execution-driven simulator; DARPA; HPCS Initiative | 2003-03-13 |
297 |
|
Cohen, Elaine | Feature-based process planning for CNC machining | Today CNC machining is used successfully to provide program-driven medium lot size manufacturing. The range of applicability of CNC machining should be greater: For small lot sizes such as prototyping or custom products, these machines should provide quick turnaround and flexible production schedul... | CNC machining | 1998 |
298 |
|
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 |
299 |
|
Sikorski, Kris | Selected fixed point problems and algorithms | We present a new version of the almost optimal Circumscribed Ellipsoid Algorithm (CEA) for approximating fixed points of nonexpanding Lipschitz functions. We utilize the absolute and residual error criteria with respect to the second norm. The numerical results confirm that the CEA algorithm is m... | Fixed point problems; Optimal algorithms; Nonlinear equations; Ellipsoid algorithm; Computational complexity. | 2007 |
300 |
|
Sutherland, Karen T. | The stability of geometric inference in location determination | Geometric inference is widely used in computer vision, but very little attention has been given to the question of how geometric properties affect the resulting errors in the inferences made. This thesis addresses the problem of the stability of geometric inference in determining locations with a go... | Geometric inference; Location determination | 1994 |