Filters: Collection:"ir_uspace" Year End:2012
| Creator | Title | Description | Subject | Date | ||
|---|---|---|---|---|---|---|
| 451 |  | Sutherland, James Clayton; Kerstein, Alan R.; Chen, Jaqueline H. | An evaluation of the one-dimensional turbulence model: comparison with direct numerical simulation of CO/H2 jets with extinction and reignition | Abstract A variant of the One-Dimensional Turbulence (ODT) model formulated in an Eulerian reference frame is applied to a planar nonpre mixed turbulent jet flame and results from the model prediction are compared with DNS data. The model employed herein solves the full set of conservation equation... | 2010 | |
| 452 |  | Mattis, Daniel C. | An expanded Luttinger model | This paper generalizes Luttinger's model by introducing curvature (d2ε (k) dk2 ≠ 0 ) into the kinetic energy. An exact solution for arbitrary interactions is still possible in principle, but it now requires disentangling the eigenvalue spectrum of an harmonic string of interacting boson fields at... | 2012-01-01 | |
| 453 |  | Durney, Carl H. | An experiment in using interactive computer graphics in teaching transient transmission-line theory | An interactive computer graphics routine was developed and used in teaching EE 553, Electromagnetic Fields, autumn quarter, 1969, in the Electrical Engineering Department of the University of Utah. The routine displayed the propagation of the voltage ave form produced by a step-function generator do... | 1970 | |
| 454 |  | 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 |
| 455 |  | 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 |
| 456 |  | 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 |
| 457 |  | 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 |
| 458 |  | Nielsen, Lewis T. | An identeification guide to the Mosquitoes of Utah | The first detailed report on the mosquito fauna of Utah was published by pees (1943). In this bulletin Rees reported the occurrence in the state of 31 species, representing 4 genera, and discussed their biology, distribution, life history and importance. Subsequent publications by Rees (1944), Rees ... | 1961-06 | |
| 459 | | Nielsen, Lewis T. | An identification guide to the mosquitoes of Utah | The first detailed report on the mosquito fauna of Utah was published by pees (1943). In this bulletin Rees reported the occurrence in the state of 31 s p e c ie s , representing 4 genera, and discussed their biology, distribution, life history and importance. Subsequent publications by Rees (1944),... | 1961-06 | |
| 460 |  | Myers, Chris J. | An improvement in partial order reduction using behavioral analysis | Efficacy of partial order reduction in reducing state space relies on adequate extraction of the independence relation among possible behaviors. However, traditional approaches by statically analyzing system model structures are often not able to reveal enough independence for reduction. To address ... | 2012-01-01 | |
| 461 |  | 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 |
| 462 |  | 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 |
| 463 |  | 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 |
| 464 |  | 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 |
| 465 |  | Warner, Homer R. | An Interlingua for Electronic Interchange of Medical Information: Using Fames to Map between Clinical Vocabularies | Biomedical Informatics | 1991 | |
| 466 |  | Berg, Cynthia A. | An interpersonal analysis of subjective social status and psychosocial risk | Subjective social status (SSS) predicts health independently of traditional measures of socio-economic status (SES; Adler et al., 2008; Cohen et al., 2008). Although interpersonal variables are known to be related to both SES and health (Gallo, Smith, & Cox, 2006) and might contribute to their assoc... | 2011-01-01 | |
| 467 |  | 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 |
| 468 |  | 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 |
| 469 |  | 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 | |
| 470 |  | Carter, John B. | An O(1) time complexity software barrier | As network latency rapidly approaches thousands of processor cycles and multiprocessors systems become larger and larger, the primary factor in determining a barrier algorithm?s performance is the number of serialized network latencies it requires. All existing barrier algorithms require at least ... | Network latency; Barrier algorithm; Time complexity software barrier | 2004 |
| 471 |  | Henderson, Thomas C. | An O(n) time discrete relaxation architecture for real-time processing of the consistent labeling problem | Discrete relaxation techniques have proven useful in solving a wide range of problems in digital signal and digital image processing, artificial intelligence, operations research, and machine vision. Much work has been devoted to finding efficient hardware architectures. This paper shows that a conv... | Discrete relaxation techniques | 1986 |
| 472 |  | Mathews, V. John | An optimal design procedure for intraband vector quantized subband coding | AbstTact- Subband coding with vector quantization is addressed in this paper. Forming the data vectors from both between and within the subbands is considered. The former of these two schemes is referred to as interband coding and the latter as intraband coding. Interband coder design is relatively ... | 1995 | |
| 473 |  | 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 |
| 474 |  | Warner, Homer R. | Analog Computer Analysis of Dispersion of Indicator in the Circulation | Biomedical Informatics | 1966 | |
| 475 |  | Gardner, Reed M. | Analog Computer Simulates Heart Response to Nerve Stimulation | Biomedical Informatics | 1961 |