Filters: School Or College: "College of Engineering" Department: "Computing, School of" Collection: "ir_uspace" Format: "application/pdf"
| Creator | Title | Description | Subject | Date | ||
|---|---|---|---|---|---|---|
| 251 |
 |
Davis, Alan L. | Mathematical representation for VLSI arrays | This paper introduces a methodology for mapping algorithmic description into a concurrent implementation on silicon. This methodology can help in the solution of important problems using a new technique for the representation of highly parallel networks. This new approach for the representation of c... | VLSI arrays | 1980 |
| 252 |
 |
Hansen, Charles D. | Cluster-based interactive volume rendering with Simian | Commodity-based computer clusters offer a cost-effective alternative to traditional largescale, tightly coupled computers as a means to provide high-performance computational and visualization services. The Center for the Simulation of Accidental Fires and Explosions (C-SAFE) at the University of... | Volume rendering; Simian | 2003-09-03 |
| 253 |
 |
Organick, Elliott I.; Lindstrom, Gary E. | Transparent interface between software and hardware versions of ADA compilation units | The Ada-to-Silicon project at Utah is developing a methodology (and associated software and hardware) for the high level testing of Ada compilation units that are represented as hardware components (circuitry). There are two motivations for this research. | Ada-to-Silicon; ADA compilation units | 1983 |
| 254 |
 |
Balasubramonian, Rajeev | Interference aware cache designs for operating system execution | Large-scale chip multiprocessors will likely be heterogeneous. It has been suggested by several groups that it may be worthwhile to implement some cores that are specially tuned to execute common code patterns. One such common application that will execute on all future processors is of course the ... | Interference aware; Cache designs; Off-loading | 2009 |
| 255 |
 |
Lindstrom, Gary E. | Efficiency in nondeterministic control through non-forgetful backtracking | Nondeterministic (ND) control has long been used to express elegant solutions to complex search problems. Programs using ND control can be executed on conventional machines through a systematic examination of trial execution paths. Among the many approaches to the enumeration of these paths is backt... | Nondeterministic control; Non-forgetful backtracking; Search problems | 1977 |
| 256 |
 |
Weinstein, David | A morphing algorithm for generating near optimal grids: applications in computational medicine | We apply morphing to t h e problem of generating the initial mesh for finite element simulations. This algorithm reduces mesh adaptation time by integrating physical and geometric constraints to provide a near optimal initial mesh. We apply this method to large-scale bioelectric field problems invol... | Morphing algorithm; Bioelectric field problems | 1994 |
| 257 |
 |
Lindstrom, Gary E. | Modules as values in a persistent object store | We report on an object manager (OM) providing persistent implementations for C ++ classes. Our OM generalizes this problem to that of managing persistent modules, where the module concept is an abstract data type (ADT). This approach permits a powerful suite of module manipulation operations to be ... | Object manager; OM; Persistent object store | 1993 |
| 258 |
 |
Fujimoto, Richard M. | On synthesizing systolic arrays from recurrence equations with linear dependencies | We present a technique for synthesizing systolic architectures from Recurrence Equations. A class of such equations (Recurrence Equations with Linear Dependencies) is defined and and the problem of mapping such equations onto a two dimensional architecture is studied. We show that such a mapping is ... | Recurrence equations | 1986 |
| 259 |
 |
Wyman, Chris; Hansen, Charles D. | Penumbra maps | Generating soft shadows quickly is difficult. Few techniques have enough flexibility to interactively render soft shadows in scenes with arbitrarily complex occluders and receivers. This paper introduces the penumbra map, which extends current shadow map techniques to interactively approximate so... | Penumbra maps; Soft shadows; Shadow maps | 2003-04-23 |
| 260 |
 |
Riloff, Ellen M. | Corpus-based approach for building semantic lexicons | Semantic knowledge can be a great asset to natural language processing systems, but it is usually hand-coded for each application. Although some semantic information is available in general-purpose knowledge bases such as Word Net and Cyc, many applications require domain-specific lexicons that repr... | Corpus-based method; Semantic lexicons | 1997 |
| 261 |
 |
Hansen, Charles D. | Interactive volume rendering using multi-dimensional transfer functions and direct manipulation widgets | Most direct volume renderings produced today employ onedimensional transfer functions, which assign color and opacity to the volume based solely on the single scalar quantity which comprises the dataset. Though they have not received widespread attention, multi-dimensional transfer functions are a v... | Volume rendering; Volume visualization; Direct volume rendering; Multidimensional transfer functions; Direct manipulation widgets; Graphics hardware | 2001 |
| 262 |
 |
Carter, Tony M. | The set theory of arithmetic decomposition | The Set Theory of Arithmetic Decomposition is a method for designing complex addition/ subtraction circuits at any radix using strictly positional, sign-local number systems. The specification of an addition circuit is simply an equation that describes the inputs and the outputs as weighted digit se... | Arithmetic decomposition; Addition/ subtraction circuits | 1989 |
| 263 |
 |
Freire, Juliana | Designing information-preserving mapping schemes for XML | An XML-to-relational mapping scheme consists of a procedure for shredding XML documents into relational databases, a procedure for publishing databases back as documents, and a set of constraints the databases must satisfy. In previous work, we discussed two notions of information preservation for m... | Losslessness; Validation; Mapping scheme; Edge++; LILO; Lossless Inlining; Lossless Outlining; XML Schema | 2005 |
| 264 |
 |
Johnson, Christopher R. | Grid-enabling problem solving environments: a case study of SCIRun and NetSolve | Combining the functionality of NetSolve, a grid-based middleware solution, with SCIRun, a graphically-based problem solving environment (PSE), yields a platform for creating and executing grid-enabled applications. Using this integrated system, hardware and/or software resources not previously ac... | Grid computing; SCIRun; NetSolve; Problem solving environment; Numerical libraries; Parallel programming (Computer science) | 2001 |
| 265 |
 |
Slind, Konrad Lee | Emerging trends proceedings of the 17th International Conference on Theorem Proving in Higher Order Logics: TPHOLs 2004 | This volume constitutes the proceedings of the Emerging Trends track of the 17th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2004) held September 14-17, 2004 in Park City, Utah, USA. The TPHOLs conference covers all aspects of theorem proving in higher order logics ... | Theorem proving; Higher order logics | 2004-08 |
| 266 |
 |
Brunvand, Erik L. | Practical advances in asynchronous design | Recent practical advances in asynchronous circuit and system design have resulted in renewed interest by circuit designers. Asynchronous systems are being viewed as in increasingly viable alternative to globally synchronous system organization. This tutorial will present the current state of the art... | 1997 | |
| 267 |
 |
Dintelman, Sue Marie Thompson | Design and implementation of a relational data base system for a minicomputer | A data base system provides the advantages of centralized control of data including increased data independence. Design specifications for a low level relational data base interface are given in the form of a formal description which separates the implementation details from the description of the ... | Data base system | 1977 |
| 268 |
 |
Neff, Rick | Versatile interaction specification of tools and agents | Vista is a software infrastructure addressing the vexing problem of software tool interaction?especially how to get egocentric tools to work well together. Vista neither assumes nor requires that tools or tool-mediating agents understand a cooperative messaging protocol, only that they share some c... | Vista; software infrastructure; software tool interaction | 1994 |
| 269 |
 |
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 |
| 270 |
 |
Freire, Juliana; Silva, Claudio T. | VisMashup: streamlining the creation of custom visualization applications | Visualization is essential for understanding the increasing volumes of digital data. However, the process required to create insightful visualizations is involved and time consuming. Although several visualization tools are available, including tools with sophisticated visual interfaces, they are o... | VisMashup; Dataflow; Visualization systems; Mashups; Medleys | 2009-11 |
| 271 |
 |
Gopalakrishnan, Ganesh | Bounded transaction model checking | Industrial cache coherence protocol models often have too many reachable states, preventing full reachability analysis even for small model instances (number of processors, addresses, etc.). Several partial search debugging methods are, therefore, employed, including lossy state compression using... | Model checking; Reachability analysis | 2006-02-27 |
| 272 |
 |
Riesenfeld, Richard F.; Smith, Kent F. | An experimental system for computer aided geometric design | The main goal of this proposed level-of-effort project is to extend present capabilities in the area of Computer Aided Geometric Design (CAGD) and to develop custom VLSI support for some special geometric functions. | Computer aided geometric design; CAGD; VLSI; Very large scale integration | 1984 |
| 273 |
 |
Gopalakrishnan, Ganesh | A partial order reduction algorithm without the Proviso | This paper presents a partial order reduction algorithm, called Two phase, that preserves stutter free LTL properties. Two phase dramatically reduces the number of states visited compared to previous partial order reduction algorithms on most practical protocols. The reason can be traced to a step o... | Order reduction algorithm; Proviso step | 1998 |
| 274 |
 |
Freire, Juliana; Silva, Claudio T. | Simplifying the design of workflows for large-scale data exploration and visualization | Workflows and Computational Processes. Workflows are emerging as a paradigm for representing and managing complex computations - Simulations, data analysis, visualization, data integration. | 2008 | |
| 275 |
 |
Kessler, Robert R. | Visual threads: the benefits of multithreading in visual programming languages | After working with the CWave visual programming language, we discovered that many of our target domains required the ability to define parallel computations within a program. CWave has a strongly hierarchical model of computation, so it seemed like adding the ability to take a part of the hierarchy ... | Visual threads; multithreading; CWave | 1997 |