Filters: Department: "Computing, School of" School Or College: "College of Engineering" Collection: "ir_uspace" Format: "application/pdf"
| Creator | Title | Description | Subject | Date | ||
|---|---|---|---|---|---|---|
| 76 |
 |
Greenfield, Harvey | An application of computer graphics: two concurrent investigations within the medical field | The aim of this project is to apply new or recently developed computer graphic techniques to a particular discipline with the thought of broadening its research capabilities. The discipline chosen, that of medicine, has emphasis places on the area of hemodynamics. It is seen that computer graphics m... | Computer graphic techniques | 1971 |
| 77 |
 |
Keller, Robert M. | An approach to determinacy proofs | It is known that any parallel program graph composed of continuous operators itself represents a continuous function. In other words, the network is determinate in the sense that for a given input, the output is unique, independent of the timing of the constituent operators. This result is applied t... | Parallel program graph; Determinacy proofs | 1978 |
| 78 |
 |
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 |
| 79 |
 |
Keller, Robert M.; Lindstrom, Gary E. | An architecture for a loosely-coupled parallel processor | An architecture for a large (e. g. 1000 processor) parallel computer is presented. The processors are loosely-coupled, in the sense that communication among them is fully asynchronous, and each processor is generally not unduly delayed by any immediate need for specific data values. The network supp... | Loosely-coupled; Parallel processors | 1978 |
| 80 |
 |
Bruderlin, Beat | An axiomatic approach for solving geometric problems symbolically | This paper describes a new approach for solving geometric constraint problems and problems in geometry theorem proving. We developed a rewrite-rule mechanism operating on geometric predicates. Termination and completeness of the problem solving algorithm can be obtained through well foundedness and ... | Geometric constraint problems; Geometry theorem proving; Knuth-Bendix completion algorithm | 1990 |
| 81 |
 |
Willemsen, Peter; Gooch, Amy A. | An experimental comparison of perceived egocentric distance in real, image-based, and traditional virtual environment using direct walking tasks | In virtual environments, perceived egocentric distances are often underestimated when compared to the same distance judgments in the real world. The research presented in this paper explores two possible causes for this reduced distance perception in virtual environments: (1) real-time computer g... | Egocentric distances; Virtual environments | 2002-02-12 |
| 82 |
 |
Newman, William M. | An experimental display programming language for the PDP-10 computer | An experimental language for display programming, called DIAL, has been developed for the PDP-10 and the UNIVAC 1559 display. It is experimental in the sense that it was originally conceived as a means of testing out some ideas, and the best way to test them seemed to be to produce a language that ... | Display programming; DIAL; Display Algol | 1970 |
| 83 |
 |
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 |
| 84 |
 |
Khoche, Ajay | An extended cell set of self-timed designs | The high level synthesis approach described in [1] uses hopCP[2] language for behavioral descriptions. The behavioral specifications are then translated into Hop Flow Graphs (HFGs). The actions in the graph are then refined such that refined actions can be directly mapped onto asynchronous circuit b... | Self-timed designs; hopCP; Hop Flow Graphs; Asynchronous circuit blocks; Action-blocks | 1993 |
| 85 |
 |
Gopalakrishnan, Ganesh; Humphrey, Alan Parker; Derrick, Christopher Glade | An integration of dynamic MPI formal verification within eclipse PTP | Our research goals were to verify practical MPI programs for deadlocks, resource leaks, and assertion violations at the push of a button and be able to easily visualize the results. We also sought to integrate these capabilities with the Eclipse IDE via an Eclipse plug-in for the Parallel Tools Plat... | Verification; Graphical User Interfaces; Dynamic Interleaving Reduction; Message Passing; MPI; Multi-core; Eclipse Parallel Tools Platform; Trapeze Interactive Poster | 2010-03-15 |
| 86 |
 |
Bruderlin, Beat | An interactive N-Dimensional constraint system | In this paper, we present a graph-based approach to geometric constraint solving. Geometric primitives (points, lines, circles, planes, etc.) possess intrinsic degrees of freedom in their embedding space. Constraints reduce the degrees of freedom of a set of objects. A constraint graph is created wi... | Geometric constraint solving | 1994 |
| 87 |
 |
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 |
| 88 |
 |
Sikorski, Kris | An interior ellipsoid algorithm for fixed points | We consider the problem of approximating fixed points of non-smooth contractive functions with using of the absolute error criterion. In [12] we proved that the upper bound on the number of function evaluations to compute ?-approximations is 0(n3(In 1/? + In 1/1-q +In n)) in the worst case, where ... | Ellipsoid algorithm; Contractive functions; Fixed points | 1998 |
| 89 |
 |
Davis, Al | An introduction to asynchronous circuit design | The purpose of this monograph is to provide both an introduction to field of asynchronous digital circuit design and an overview of the practical state of the art in 1997. In the early days of digital circuit design, little distinction was made between synchronous and asynchronous circuits. However,... | Asynchronous circuit design | 1997 |
| 90 |
 |
Riloff, Ellen M. | An introduction to the Sundance and AutoSlog systems | This document describes the Sundance natural language processing system that has been developed at the University of Utah, as well as the AutoSlog and AutoSlog-TS extraction pattern learners that have been implemented on top of Sundance. Sundance is a shallow parser that also includes clause hand... | Sundance system; AutoSlog system; Extraction pattern learners | 2004-11-08 |
| 91 |
 |
Regehr, John | An isotach implementation for myrinet | An isotach network provides strong guarantees about message delivery order. We show that an isotach network can be implemented efficiently entirely in software, using commercial o-the-shelf hardware. This report describes that effort. Parts of this implementation could be performed much more efficie... | 1997-01-01 | |
| 92 |
 |
Gu, Jun | An optimal, parallel discrete relaxation algorithm and architecture (Revised January 1988 and August 1989) | A variety of problems in artificial intelligence, operations research, symbolic logic, pattern recognition and computer vision, and robot manipulation are special cases of the Consistent Labeling Problem (CLP). The Discrete Relaxation Algorithm (DRA) is an efficient computational technique to enfor... | Consistent Labeling Problem; CLP; Discrete Relaxation Algorithm; DRA | 1988 |
| 93 |
 |
Riloff, Ellen M. | Analyses for elucidating current question answering technology | In this paper, we take a detailed look at the performance of components of an idealized question answering system on two diff erent tasks: the TREC Question Answering task and a set of reading comprehension exams. We carry out three types of analysis: inherent properties of the data, feature analys... | TREC Question Answering task | 2001-12 |
| 94 |
 |
Carter, John B. | Analysis of avalanche's shared memory architecture | In this paper, we describe the design of the Avalanche multiprocessor's shared memory subsystem, evaluate its performance, and discuss problems associated with using commodity workstations and network interconnects as the building blocks of a scalable shared memory multiprocessor. Compared to other ... | Avalanche multiprocessor; Shared memory | 1997 |
| 95 |
 |
Sobh, Tarek M. | Analysis of tolerance for manufacturing geometric objects from sense data | In this work we address the problem of manufacturing machine parts from sense data. Constructing geometric models for the objects from sense data is the intermediate step in a reverse engineering manufacturing system. Sensors are usually inaccurate, providing uncertain sense information. We constr... | Manufacture | 1993 |
| 96 |
 |
Henderson, Thomas C. | Analysis of topographic maps for recreational purposes using decision trees | In this paper we describe a method for predicting the subjective quality of a new mountain bike route for a particular subject based on routes previously ridden and ranked by the subject. GPS tracks of the previously ridden routes are over laid on rasterized topographic maps and topographic features... | 2013-01-01 | |
| 97 |
 |
Yang, Yue; Gopalakrishnan, Ganesh; Lindstrom, Gary E.; Slind, Konrad Lee | Analyzing the Intel Itanium memory ordering rules using logic programming and SAT | We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constraints on execution traces, in an axiomatic style. A direct translation of the semantics to a constraint logic program... | Intel Itanium memory; Ordering rules; Sared memory; Consistency models | 2003 |
| 98 |
 |
Bargteil, Adam Wade | Animation of deformable bodies with quadratic bézier finite elements | In this article, we investigate the use of quadratic finite elements for graphical animation of deformable bodies.We consider both integrating quadratic elements with conventional linear elements to achieve a computationally efficient adaptive-degree simulation framework as well as wholly quadratic ... | 2014-01-01 | |
| 99 |
 |
Tasdizen, Tolga; Whitaker, Ross T. | Anisotropic diffusion of surface normals for feature preserving surface reconstruction | For 3D surface reconstruction problems with noisy and incomplete range data measured from complex scenes with arbitrary topologies, a low-level representation, such as level set surfaces, is used. Such surface reconstruction is typically accomplished by minimizing a weighted sum of data-model dis... | Anisotropic diffusion; Surface reconstruction | 2003-04-18 |
| 100 |
 |
Henderson, Thomas C. | Apparent symmetries in range data | A procedure for extracting symmetrical features from the output of a range scanner is described which is insensitive to sensor noise and robust with respect to object surface complexity. The acquisition of symmetry descriptors for rigid bodies from a range image was in this case motivated by the ne... | Symmetry descriptors; Range data; Range scanner; Dextrous manipulation systems | 1987 |