|
|
Creator | Title | Description | Subject | Date |
426 |
|
Jacobson, Hans | Application specific asynchronous microgengines for efficient high-level control | Despite the growing interest in asynchronous circuits, programmable asynchronous controllers based on the idea of microprogramming have not been actively pursued. Since programmable control is widely used in many commercial ASICs to allow late correction of design errors, to easily upgrade product ... | Asynchronous microgengines; Programmable asynchronous controllers | 1997 |
427 |
|
Jacobson, Hans; Gopalakrishnan, Ganesh | Application specific asynchronous microengines for efficient high-level control | Despite the growing interest in asynchronous circuits programmable asynchronous controllers based on the idea of microprogramming have not been actively pursued Since programmable control is widely used in many commercial ASICs to allow late correction of design errors to easily upgrade product f... | Asynchronous microengines | 1997 |
428 |
|
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 |
429 |
|
Henderson, Thomas C. | Visual target based wall pose estimation | We compare vision and sonar techniques for the recovery of wall pose. A vision algorithm is developed which is based on known target geometry, and a sonar technique based on a wedge model is described. | wall pose; vision algorithm; wedge model | 1997 |
430 |
|
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 |
431 |
|
Freire, Juliana | Beyond depth-first strategies: improving tabled logic programs through alternative scheduling | Tabled evaluation ensures termination for programs with finite models by keeping track of which subgoals have been called. Given several variant subgoals in an evaluation, only the fi rst one encountered will use program-clause resolution; the rest will resolve with the answers generated by the f... | Alternate scheduling; SLG-WAM; Tabled logic programs | 1998 |
432 |
|
Hibler, Michael J. | Interface and execution models in the fluke kernel | We have defined and implemented a new kernel API that makes every exported operation either fully interruptible and restartable, thereby appearing atomic to the user. To achieve interruptibility, all possible states in which a thread may become blocked for a "long" time are completely representable ... | Fluke kernel; Interruptibility | 1998 |
433 |
|
Beazley, David. M. | A wrapper generation tool for the creation of scriptable scientific applications | In recent years, there has been considerable interest in the use of scripting languages as a mechanism for controlling and developing scientific software. Scripting languages allow scientific applications to be encapsulated in an interpreted environment similar to that found in commercial scientific... | | 1998 |
434 |
|
Hansen, Charles D.; Parker, Steven G.; Johnson, Christopher R. | Integrated problem solving environment: the SCIRun computational steering system | SCIRun is a scientific programming environment that allows the interactive construction, debugging, and steering of large-scale scientific computations. We review related systems and introduce a taxonomy that explores different computational steering solutions, Considering these approaches, we discu... | SCIRun; Computational steering; Problem solving environment; Distributed computing | 1998 |
435 |
|
Riloff, Ellen M. | Empirical approach to conceptual case frame acquisition | Conceptual natural language processing systems usually rely on case frame instantiation to recognize events and role objects in text. But generating a good set of case frames for a domain is time-consuming, tedious, and prone to errors of omission. We have developed a corpus-based algorithm for a... | Conceptual case frame acquisition; Case frame instantiation; Corpus-based algorithm | 1998 |
436 |
|
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 |
437 |
|
Cohen, Elaine | Feature-based process planning for CNC machining | Today CNC machining is used successfully to provide program-driven medium lot size manufacturing. The range of applicability of CNC machining should be greater: For small lot sizes such as prototyping or custom products, these machines should provide quick turnaround and flexible production schedul... | CNC machining | 1998 |
438 |
|
Carter, John B. | AS-COMA: An adaptive hybrid shared memory Architecture | Scalable shared memory multiprocessors traditionally use either a cache coherent nonuniform memory access (CC-NUMA) or simple cache-only memory architecture (S-COMA) memory architecture. Recently, hybrid architectures that combine aspects of both CC-NUMA and S-COMA have emerged. In this paper, we pr... | AS-COMA; Hybrid shared memory | 1998 |
439 |
|
Carter, John B. | Design alternatives for shared memory multiprocessors | In this paper. we consider the design alternatives available for building the next generation DSM machine (e.g., the choice of memory architecture, network technology, and amount and location of per-node remote data cache). To investigate this design space, we have simulated six applications on a wi... | Shared memory multiprocessors | 1998 |
440 |
|
Riloff, Ellen M. | Case study in using linguistic phrases for text categorization on the WWW | Most learning algorithms that arc applied to text categorization problems rely on a bag-of-words document representation, i.e., each word occurring in the document is considered as a separate feature. In this paper, we investigate the use of linguistic phrases as input features for text categoriz... | Learning algorithms; Text categorization; Linguistic phrases; Information extraction patterns; AutoSlog-TS | 1998 |
441 |
|
Shirley, Peter S.; Parker, Steven G. | Single sample soft shadows | A simple extension to ray tracing is presented that creates visually plausible "soft" shadows with little extra computation. Although these soft shadows are approximate, they are robust and have penumbra widths that behave in a believable way, including accurate placement of singularities where penu... | Soft shadows; Ray tracing; Penumbra width; Image generation | 1998 |
442 |
|
Hibler, Michael J. | The flask security architecture: system support for diverse security policies | Operating systems must be flexible in their support for security policies, i.e., the operating system must provide sufficient mechanisms for supporting the wide variety of real-world security policies. Systems claiming to provide this support have failed to do so in two ways: they either fail to pro... | Flask; Security architecture | 1998 |
443 |
|
Weinstein, David | The analytic 3-D transform for the least-squared fit of three pairs of corresponding points | We derive the analytic transformation for minimizing the summed-squared-distance between three movable points in one three-space pose to three corresponding fixed points in another three-space pose. This change of basis is a general rigid-body transformation (translation and rotation), with the addi... | 3-D transform; summed-squared-distance; three movable points; Three-space | 1998 |
444 |
|
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 |
445 |
|
Nelson, Donald | Constraint Jacobians for constant-time inverse kinematics and assembly optimization | An algorithm for the constant-time solution of systems of geometric constraint equations is presented in this work. constraint equations and their Jacobians may be used in conjunction with other numerical methods to solve for a variety of kinematics, dynamics, and assembly optimization problems. The... | Constant-time; Inverse kinematics; Constraint Jacobians | 1998 |
446 |
|
Gopalakrishnan, Ganesh | Decomposing the proof of correctness of pipelined microprocessors | We present a systematic approach to decompose and incrementally build the proof of correctness of pipelined microprocessors. The central idea is to construct the abstraction function using completion functions, one per unfinished instruction, each of which specify the effect (on the observables) of ... | Pipelined microprocessors; Proof of correctness | 1998 |
447 |
|
Henderson, Thomas C.; Thompson, William B. | Smart sensor snow | We propose to deploy and exploit and large number of inexpensive sensors to obtain information or trigger actions over a wide geographic area. Sensors may be of diverse physical natures: acoustic, IR, seismic, chemical, magnetic, thermal, etc. We describe here three major issues: (1) sensor distribu... | Smart sensors | 1998 |
448 |
|
Carter, John; Susarla, Sai R. | Khazana An infrastructure for building distributed services | Essentially all distributed systems?? applications?? and services at some level boil down to the problem of man aging distributed shared state Unfortunately?? while the problem of managing distributed shared state is shared by many applications?? there is no common means of managing the data ... | Khazana; Distributed shared state | 1998 |
449 |
|
Shirley, Peter S.; Thompson, William B. | Visual glue | One key function of graphics systems is to present information about the 3-D structure of modeled environments. For real-time simulations, conveying a sense of contact between touching surfaces and relative position and motion between proximate objects is particularly critical. Neither stereo nor oc... | Visual glue; 3-D structure | 1998 |
450 |
|
Carter, John B. | Khazana an infrastructure for building distributed services | Essentially all distributed systems, applications and service at some level boil down to the problem of managing distributed shared state. Unfortunately, while the problem of managing distributed shared state is shared by man applications, there is no common means of managing the data - every applic... | Khazana; Distributed shared state | 1998 |