Filters: Department: "Computing, School of" School Or College: "College of Engineering" Collection: "ir_uspace"
| Creator | Title | Description | Subject | Date | ||
|---|---|---|---|---|---|---|
| 326 |
 |
Hansen, Charles D. | Fast stereoscopic images with ray-traced volume rendering | One of the drawbacks of standard volume rendering techniques is that it is often difficult to comprehend the three-dimensional structure of the volume from a single frame; this is especially true in cases where there is no solid surface. Generally, several frames must be generated and viewed sequent... | Volume rendering; Ray tracing; Stereoscopic images; Reprojection | 1994 |
| 327 |
 |
Gu, Jun | Fast structured design of VLSI circuits | We believe that a structured, user-friendly, cost-effective tool for rapid implementation of VLSI circuits which encourages students to participate directly in research projects are the key components in digital integrated circuit (IC) education. In this paper, we introduce our VLSI education activ... | VLSI circuits; Rapid implementation | 1988 |
| 328 |
 |
Kopta, Daniel M.; Kensler, Andrew Erin; Spjut, Josef Bo; Brunvand, Erik L.; Davis, Al | Fast, effective BVH updates for dynamic ray-traced scenes using tree rotations | Bounding volume hierarchies are a popular choice for ray tracing animated scenes due to the relative simplicity of refitting bounding volumes around moving geometry. However, the quality of such a refitted tree can degrade rapidly if objects in the scene deform or rearrange significantly as the ... | Ray tracing; Acceleration structures; Bounding volume hierarchies; Tree rotations; Dynamic scenes; Parallel update | 2011 |
| 329 |
 |
Riloff, Ellen M. | Feature subsumption for opinion analysis | Lexical features are key to many approaches to sentiment analysis and opinion detection. A variety of representations have been used, including single words, multi-word Ngrams, phrases, and lexicosyntactic patterns. In this paper, we use a subsumption hierarchy to formally define different types o... | Feature subsumption; Sentiment analysis; Opinion detection; Subsumption hierarchy | 2006 |
| 330 |
 |
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 |
| 331 |
 |
Thompson, William B. | Feature-based reverse engineering of mechanical parts | Reverse engineering of mechanical parts requires extraction of information about an instance of a particular part sufficient to replicate the part using appropriate manufacturing techniques. This is important in a wide variety of situations, since functioning CAD models are often unavailable or unus... | Mechanical parts | 1995 |
| 332 |
 |
Regehr, John | Finding and understanding bugs in C compilers | Compilers should be correct. To improve the quality of C compilers, we created Csmith, a randomized test-case generation tool, and spent three years using it to find compiler bugs. During this period we reported more than 325 previously unknown bugs to compiler developers. Every compiler we tested w... | 2011-01-01 | |
| 333 |
 |
Balasubramonian, Rajeev | First-order analysis of power overheads of redundant multi-threading | Redundant multi-threading (RMT) has been proposed as an architectural approach that efficiently detects and recovers from soft errors. RMT can impose non-trivial overheads in terms of power consumption. In this paper, we characterize some of the major factors that influence the power consumed by R... | Redundant multi-threading; RMT; Soft errors; Power overheads; Power consumption | 2006 |
| 334 |
 |
Hibler, Michael J. | The flask security architecture: system support for diverse security policies | Operating systems must be flexible in their support for security policies, i.e., the operating system must provide sufficient mechanisms for supporting the wide variety of real-world security policies. Systems claiming to provide this support have failed to do so in two ways: they either fail to pro... | Flask; Security architecture | 1998 |
| 335 |
 |
Henderson, Thomas C. | Flat surface reconstruction using sonar | A technique is given for the recovery of planar surfaces using two beam-spread sonar readings. If a single, planar surface gave rise to the two readings, then the method recovers the surface quite accurately. Simulation and experiment demonstrate the effectiveness of the technique and recommend its ... | Flat surfaces; Reconstruction; Two beam-spread; Sonar readings; Planar surfaces | 1996 |
| 336 |
 |
Susarla, Sai R.; Carter, John | Flexible consistency for wide area peer replication | The lack of a flexible consistency management solution hinders P2P implementation of applications involving updates, such as read-write file sharing, directory services, online auctions and wide area collaboration. Managing mutable shared data in a P2P setting requires a consistency solution that... | Wide area; Peer replication | 2004-11-18 |
| 337 |
 |
Freire, Juliana | Flexible infrastructure for gathering XML statistics and estimating query cardinality | A key component of XML data management systems is the result size estimator, which estimates the cardinalities of user queries. Estimated cardinalities are needed in a variety of tasks, including query optimization and cost-based storage design; and they can also be used to give users early feedba... | Query cardinality; StatiX++; XML schema | 2004 |
| 338 |
 |
Susarla, Sai R. | Flexible multi-policy scheduling based on CPU inheritance | Traditional processor scheduling mechanisms in operating systems are fairly rigid, often supporting only one fixed scheduling policy, or, at most, a few "scheduling classes" whose implementations are closely tied together in the OS kernel. This paper presents CPU inheritance scheduling, a novel p... | CPU inheritance | 1996 |
| 339 |
 |
Hansen, Charles D. | Flow charts: visualization of vector fields on arbitrary surfaces | We introduce a novel flow visualization method called Flow Charts, which uses a texture atlas approach for the visualization of flows defined over curved surfaces. In this scheme, the surface and its associated flow are segmented into overlapping patches, which are then parameterized and packed in ... | 2008-09 | |
| 340 |
 |
Pascucci, Valerio | Flow visualization with quantified spatial and temporal errors using edge maps | Robust analysis of vector fields has been established as an important tool for deriving insights from the complex systems these fields model. Traditional analysis and visualization techniques rely primarily on computing streamlines through numerical integration. The inherent numerical errors of such... | 2012-01-01 | |
| 341 |
 |
Morelli, Robert | Formal aspects of anonymity | We present a formal definition of anonymity in the context of concurrent processes. The definition is given in category theoretic terms. Moreover, the concept of a split cofibration is shown to both simplify the analysis of anonymity as well as to increase the framework's expressiveness. Because ... | Anonymity; Concurrent processes | 2002-01-15 |
| 342 |
 |
Gopalakrishnan, Ganesh | Formal methods for surviving the jungle of heterogeneous parallelism | The parallel programming community will soon be entering the ‘jungle' of heterogeneous hardware and software. Unfortunately, we are not adequately preparing future programmers (today's students) to cope with the many challenges of heterogeneous concurrency, especially in their ability to rigorousl... | 2012-01-01 | |
| 343 |
 |
Li, Guodong; Gopalakrishnan, Ganesh; Kirby, Robert Michael II | Formal specification of MPI 2.0: case study in specifying a practical concurrent programming API | We describe the rst formal speci cation of a non-trivial subset of MPI, the dominant communication API in high performance computing. Engineering a formal speci cation for a non-trivial concurrency API requires the right combination of rigor, executability, and traceability, while also serving a... | MPI 2.0 | 2009 |
| 344 |
 |
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 |
| 345 |
 |
Gopalakrishnan, Ganesh | Formalization and analysis of a solution to the PCI 2.1 bus transaction ordering problem: PVS files | The following PVS files are being put on our technical reports server and are available through anonymous FTP. Look for file "pci_pvs_files.tag.gz" in the TR directory. | Bus transaction; Ordering problem | 1999 |
| 346 |
 |
Yang, Yue; Gopalakrishnan, Ganesh; Lindstrom, Gary E. | Formalizing the Java Memory Model for multithreaded program correctness and optimization | Standardized language level support for threads is one of the most important features of Java. However, defining and understanding the Java Memory Model (JMM) has turned out to be a big challenge. Several models produced to date are not as easily comparable as first thought. Given the growing inte... | Java Memory Model; JMM; Multithreaded program | 2002-04-02 |
| 347 |
 |
Chatterjee, Prosenjit; Gopalakrishnan, Ganesh | Formally specifying memory consistency models and automatically generating executable specifications | Memory ordering properties of shared memory multiprocessors are more subtle and less well understood than cache coherence. These properties tend to be processor or platform specific and are not always formally specified. It is difficult to compare even those platforms whose memory ordering propert... | Computer memory; Memory consistency models; Memory ordering; Shared memory multiprocessors | 2001 |
| 348 |
 |
Richardson, William F. | The Fred VHDL Model | This is the companion document to my dissertation. It contains 47 pages of schematics, and 163 pages of VHDL code. It is pretty meaningless without the dissertation, and it only exists because I felt that I should archive this information somewhere. | 1995 | |
| 349 |
 |
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 |
| 350 |
 |
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 |