Filters: Collection: "ir_uspace"
| Creator | Title | Description | Subject | Date | ||
|---|---|---|---|---|---|---|
| 126 |
 |
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 |
| 127 |
 |
Boll, Steven F. | Application of the saber method for improved spectral analysis of noisy speech | A stand alone noise suppression algorithm is described for reducing the spectral effects of acoustically added noise in speech. A fundamental result is developed which shows that the spectral magnitude of speech plus noise can be effectively approximated as the sum of magnitudes of speech and noise.... | Noise suppression algorithm; SABER method | 1977 |
| 128 |
 |
Smith, Kent F. | Automatic rapid prototyping of semi-custom VLSI circuits using FPGAs | We describe a technique for translating semi-custom VLSI circuits automatically, integrating two design environments, into field programmable gate arrays (FPGAs) for rapid and inexpensive prototyping. The VLSI circuits are designed using a cell-matrix based environment that produces chips with densi... | Semi-custom; VLSI circuits | 1994 |
| 129 |
 |
Carter, Tony M. | Cascade: hardware for high/variable precision arithmetic | The Cascade hardware architecture for high/variable precision arithmetic is described. It uses a radix-16 redundant signed-digit number representation and directly supports single or multiple precision addition, subtraction, multiplication, division, extraction of the square root and computation... | 1989 | |
| 130 |
 |
Kessler, Robert R. | Compiling distributed C++ | Distributed C++ (DC++) is a language for writing parallel applications on loosely coupled distributed systems in C++. Its key idea is to extend the C++ class into 3 categories: gateway classes which act as communication and synchronization entry points between abstract processors, classes whose... | Distributed C++; DC++; Parallel applications | 1994 |
| 131 |
 |
Lindstrom, Gary E. | CONSIM: a converstional simulation language implemented through interpretive control self-modeling | This paper describes an implementation technique termed interpretive control self-modeling (ICSM) and outlines its application in the implementation of CONSIM, a prototype conversational simulation language. ICSM may be defined as the use of a higher-level programming language (HLL) to specify its o... | CONSIM; Converstional simulation language; Interpretive control self-modeling; ICSM | 1977 |
| 132 |
 |
Bruderlin, Beat | Constraint objects - integrating constraint definition and interaction | This paper describes the implementation of a new constraint-based technique for direct manipulation in interactive CAD, which will simplify the design process, especially in the early stages. We introduce so called Constraint Objects and Parameter Objects which constitute an object-oriented view on ... | Constraint objects; Parameter objects | 1992 |
| 133 |
 |
Tasdizen, Tolga; Whitaker, Ross T. | Cramer-Rao bounds for nonparametric surface reconstruction from range data | The Cramer-Rao error bound provides a fundamental limit on the expected performance of a statistical estimator. The error bound depends on the general properties of the system, but not on the specific properties of the estimator or the solution. The Cramer-Rao error bound has been applied to scal... | Cramer-Rao bounds; Error bounds; 3D reconstruction | 2003-04-18 |
| 134 |
 |
Zhang, Lixin | Description of functionality of the impulse memory controller | This document describes the functionality and control flow models for each component of the impulse main memory controller. | Impulse memory controller | 2001 |
| 135 |
 |
Stoller, Leigh B. | Direct deposit: a basic user-level protocol for carpet clusters? | This note describes the Direct Deposit Protocol (DDP), a simple protocol for multicomputing on a carpet cluster. This protocol is an example of a user-level protocol to be layered on top of the low-level, sender-based protocols for the Protocol Processing Engine. The protocol will be described in te... | Direct Deposit Protocol; DDP; Carpet clusters; Multicomputing; User-level protocol | 1995 |
| 136 |
 |
Henderson, Thomas C. | Explicit and persistent knowledge in engineering drawing analysis | Domain knowledge permeates all aspects of the engineering drawing analysis process, including understanding the physical processes operating on the medium (i.e., paper), the image analysis techniques, and the interpretation semantics of the structural layout and contents of the drawing. Additiona... | Engineering drawing analysis | 2003-10-10 |
| 137 |
 |
Henderson, Thomas C. | Implementing multi-sensor systems in a functional language | We discuss a methodology for configuring systems of sensors using a functional language. To date no such general methodology exists, and existing multi-sensor systems have been hand-crafted around a particular application. Our main point is that the use of abstraction and of functional language fe... | Multi-sensor systems; Multisensor systems | 1984 |
| 138 |
 |
Lindstrom, Gary E. | The key node method: a highly-parallel alpha-beta algorithm | A new parallel formulation of the alpha-beta algorithm for minimax game tree searching is presented. Its chief characteristic is incremental information sharing among subsearch processes in the form of "provisional" node value communication. Such "eager" communication can offer the double benefit of... | Key node method; Alpha-beta algorithm; Minimax; Game tree searching | 1983 |
| 139 |
 |
Weinstein, David | Lead field basis for FEM source localization | In recent years, significant progress has been made in the area of EEG/MEG source imaging. source imaging on simple spherical models has become increasingly efficient, with consistently reported accuracy of within 5mm. In contrast, source localization on realistic head models remains slow, with sub-... | FEM source localization; Source imaging; EEG; MEG | 1999 |
| 140 |
 |
Subrahmanyam, P.A. | Modeling of call - by - need and stream primitives using CCS | The semantics of an applicative language are presented using the algebraic primitives introduced in CCS. In particular, the language constructs modeled allow for nondeterminism, stream processing and demand driven (call by need) evaluation. | Applicative language; Semantics; Algebraic primitives; CCS | 1982 |
| 141 |
 |
Bruderlin, Beat | Robust boolean set operations for manifold solids bounded by planar and natural quadric surfaces | This paper describes our latest effort in robust solid modeling. An algorithm for set operations on solids bounded by planar and natural quadric surfaces, that handles all geometrically degenerate cases robustly, is described. We identify as the main reason for the lack of robustness in geometric m... | Robust solid modeling; Robust boolean set operations; Manifold solids | 1992 |
| 142 |
 |
Bruderlin, Beat | Sketching as a solid modeling tool | This paper describes 'Quick-sketch', a 2-d and 3d modeling tool for pen based computers. Users of this system define a model by simple pen strokes drawn directly on the screen of a pen-based PC. Lines, circles, arcs, or B-spline curves are automatically distinguished and interpreted from these strok... | Quick-sketch; Modeling tool; Pen based computers; Computer sketching | 1994 |
| 143 |
 |
Weinstein, David | Statistical analysis for FEM EEG source localization in realistic head models | Estimating the location and distribution of electric current sources within the brain from electroencephalographic (EEG) recordings is an ill-posed inverse problem. The ill-posed nature of the inverse EEG problem is due to the lack of a unique solution such that different configurations of sources c... | inverse EEG problem; FEM EEG; source localization | 2000 |
| 144 |
 |
Gopalakrishnan, Ganesh | Towards a formal model of shared memory consistency for intel itanium | We provide a simple formal model for ItaniumTM shared memory consistency [1, 2] covering a core set of instructions. Existing descriptions of Itanium shared memory consistency are based on an informal collection of ordering rules as well as several examples. Our operational model employs employs wid... | formal model; shared memory consistency; ItaniumTM; Itanium | 2001 |
| 145 |
 |
Wright, Kristin | Using reliable multicast for caching and collaboration within the world wide web | The World Wide Web has become an important medium for information dissemination. One model for synchronized information dissemination within the Web is webcasting in which data are simultaneously distributed to multiple destinations. The Web's traditional unicast client/server communication model su... | caching; collaboration | 1999 |
| 146 |
 |
Brunvand, Erik L. | A partial scan methodology for testing self-timed circuits | This paper presents a partial scan method for testing control sections of macromodule based self-timed circuits for stuck-at faults. In comparison with other proposed test methods for self-timed circuits, this technique offers better fault coverage than methods using self-checking techniques, and ... | 1995 | |
| 147 |
 |
George, Lal | An abstract machine for parallel graph reduction | An abstract machine suitable for parallel graph reduction on a shared memory multiprocessor is described. Parallel programming is plagued with subtle race conditions resulting in deadlock or fatal system errors. Due to the nondeterministic nature of program execution the utilization of resources ma... | Parallel graph reduction; Abstract machines | 1989 |
| 148 |
 |
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 |
| 149 |
 |
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 |
| 150 |
 |
Cohen, Elaine | Automatic sculptured five-axis milling with check surfaces | An approach to 5-axis milling of B-spline surfaces is presented. Within its domain, it provides better check surface handling than APT. The scheme for tool position generation is based on a B-spline curve refinement method and a set of criteria for tolerance control which allows the tool positions ... | B-spline surfaces; 5-axis milling; Tool paths | 1989 |