326 - 350 of 5,163
Number of results to display per page
CreatorTitleDescriptionSubjectDate
326 Mathews, V. JohnAn efficient algorithm for lattice filter/predictorABSTRACT An efficient method for updating the lattice filter/predictor coefficients using the sign algorithm is introduced. The pertinent coefficients are updated using only the signs of the estimation errors at each stage. This method requires less number of multiplications than other adaptive la...1985
327 Warner, Homer R.An Evaluation of Radiosulfate as a Granulocyte Label in the DogBiomedical Informatics1966
328 Durney, Carl H.An experiment in using interactive computer graphics in teaching transient transmission-line theoryAn 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
329 Willemsen, Peter; Gooch, Amy A.An experimental comparison of perceived egocentric distance in real, image-based, and traditional virtual environment using direct walking tasksIn 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 environments2002-02-12
330 Newman, William M.An experimental display programming language for the PDP-10 computerAn 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 Algol1970
331 Riesenfeld, Richard F.; Smith, Kent F.An experimental system for computer aided geometric designThe 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 integration1984
332 Khoche, AjayAn extended cell set of self-timed designsThe 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-blocks1993
333 Nielsen, Lewis T.An identeification guide to the Mosquitoes of UtahThe 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
334 Nielsen, Lewis T.An identification guide to the mosquitoes of UtahThe 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
335 Bruderlin, BeatAn interactive N-Dimensional constraint systemIn 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 solving1994
336 Sikorski, KrisAn interior ellipsoid algorithm for fixed pointsWe 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 points1998
337 Warner, Homer R.An Interlingua for Electronic Interchange of Medical Information: Using Fames to Map between Clinical VocabulariesBiomedical Informatics1991
338 Davis, AlAn introduction to asynchronous circuit designThe 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 design1997
339 Riloff, Ellen M.An introduction to the Sundance and AutoSlog systemsThis 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 learners2004-11-08
340 Regehr, JohnAn isotach implementation for myrinetAn 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
341 Carter, John B.An O(1) time complexity software barrierAs 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 barrier2004
342 Henderson, Thomas C.An O(n) time discrete relaxation architecture for real-time processing of the consistent labeling problemDiscrete 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 techniques1986
343 Mathews, V. JohnAn optimal design procedure for intraband vector quantized subband codingAbstTact- 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
344 Gu, JunAn 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; DRA1988
345 Warner, Homer R.Analog Computer Analysis of Dispersion of Indicator in the CirculationBiomedical Informatics1966
346 Gardner, Reed M.Analog Computer Simulates Heart Response to Nerve StimulationBiomedical Informatics1961
347 Gardner, Reed M.Analog Computer Simulation of Heart ResponseBiomedical Informatics1961
348 Harrison, Reid R.; Myers, Chris J.; Schlegel, ChristianAnalog decoding of product codesA design approach is presented for soft-decision decoding of block product codes ("block turbo codes") using analog computation with MOS devices. Application of analog decoding to large code sizes is also considered with the introduction of serial analog interfaces and pipeline schedules.2001-01-11
349 Myers, Chris J.Analog decoding of product codesA design approach is presented for soft-decision decoding of block product codes ("block turbo codes") using analog computation with MOS devices. Application of analog decoding to large code sizes is also considered with the introduction of serial analog interfaces and pipeline schedules.2001
350 Myers, Chris J.; Harrison, Reid R.; Schlegel, ChristianAnalog decoding of product codesAbstract - A method is presented for analog softdecision decoding of block product codes (block turbo codes). Extrinsic information is exchanged as analog signals between component row and column decoders. The component MAP decoders use low-power analog computation in subthreshold CMOS circuits t...2002
326 - 350 of 5,163