Filters: Collection: "ir_uspace"
| Creator | Title | Description | Subject | Date | ||
|---|---|---|---|---|---|---|
| 251 |
 |
Akella, Venkatesh | Testing two-phase transition signaling based self-timed circuits in a synthesis environment | The problem of testing self-timed circuits generated by an automatic synthesis system is studied. Two-phase transition signalling is assumed and the circuits are targetted for an asynchronous macromodule based implementation as in [?, ?, ?, ?]. The partitioning of the circuits into control blocks, ... | Testing; two-phase; transition signaling; self-timed circuits | 1993 |
| 252 |
 |
Gopalakrishnan, Ganesh | Timing constraints for high speed counterflow-clocked pipelining | With the escalation of clock frequencies and the increasing ratio of wire- to gate-delays, clock skew is a major problem to be overcome in tomorrow's high-speed VLSI chips. Also, with an increasing number of stages switching simultaneously comes the problem of higher peak power consumption. In our ... | Timing constraints; clock frequencies; clock skew; high-speed; VLSI chips; counterflow-clocked pipelining | 1995 |
| 253 |
 |
Evans, John; Kessler, Robert R. | Using utilization profiles in allocation and partitioning for multiproscessor systems | The problems of multiprocessor partitioning and program allocation are interdependent and critical to the performance of multiprocessor systems?? Minimizing resource partitions for parallel programs on partitionable multiprocessors facilitates greater processor utilization and throughput?? The pro... | utilization profiles; multiprocessor partitioning; program allocation | 1992 |
| 254 |
 |
Henderson, Thomas C. | A control paradigm for general purpose manipulation systems | Mechanical end effectors capable of dextrous manipulation are now a reality. Solutions to the high level control issues, however, have so far proved difficult to formulate. We propose a methodology for control which produces the functionality required for a general purpose manipulation system. It is... | Manipulation systems | 1987 |
| 255 |
 |
Mathew, Binu K.; Davis, Al; Fang, Zhen | A Gaussian probability accelerator for SPHINX 3 | Accurate real-time speech recognition is not currently possible in the mobile embedded space where the need for natural voice interfaces is clearly important. The continuous nature of speech recognition coupled with an inherently large working set creates significant cache interference with other... | Speech recognition; SPHINX 3; Speech recognizers | 2003-07-22 |
| 256 |
 |
Bruderlin, Beat | A new approach to tolerance analysis | Tolerance analysis is seen as part of a more general problem, namely handling data with uncertainty. Uncertain geometric data arises when interpreting measured data, but also in solid modeling where floating point approximations are common, when representing design tolerances, or when dealing with l... | Tolerance analysis | 1994 |
| 257 |
 |
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 re... | Self-timed circuits; Testing | 1995 |
| 258 |
 |
Cohen, Elaine | Adaptive isocurves based rendering for freeform surfaces | Freeform surface rendering is traditionally performed by approximating the surface with polygons and then rendering the polygons. This approach is extremely common because of the complexity in accurately rendering the surfaces directly. Recently, several papers presented methods to render surfaces ... | Freeform surface rendering; Isocurves | 1992 |
| 259 |
 |
Lindstrom, Gary E. | Compositionally modular Scheme | We present a new module system for Scheme that supports a high degree of implementation reuse via module composition. The module system encourages breaking down a program into the smallest possible individually meaningful modules, and recomposing them using a powerful set of adaptation and combinat... | Module system | 1995 |
| 260 |
 |
Cohen, Elaine | Constant scallop height tool path generation | An approach for the automatic generation of constant scallop height tool paths is presented. An example is shown generated from a B-spline model, although it can be used with many types of sculptured surfaces. The approach utilizes surface subdivision techniques and a new algorithm for tool path gen... | Scallop height; Tool path generation; B-spline model | 1989 |
| 261 |
 |
Thompson, William B. | Exploiting discontinuities in optical flow | Most optical flow estimation techniques have substantial difficulties dealing with flow discontinuities. Methods which simultaneously detect flow boundaries and use the detected boundaries to aid in flow estimation can produce significantly improved results. Current approaches to implementing these ... | Optical flow; Discontinuities | 1995 |
| 262 |
 |
Morelli, Robert | Formal aspects of anonymity | We present a formal definition of anonymity in the context of concurrent processes. The definition is given in category theoretic terms. Moreover, the concept of a split cofibration is shown to both simplify the analysis of anonymity as well as to increase the framework's expressiveness. Because ... | Anonymity; Concurrent processes | 2002-01-15 |
| 263 |
 |
Breznay, Ann Marie; Haas, Leslie M. | If you build it will they come? Services will make the difference in a portal | Abstract: Identifying and adding services to a library portal will add to its long term success in a market that pits libraries against commercial vendors like Google and Amazon.com. The current focus on portals has been on selecting collections and developing the basic functionality of the websi... | Web design; Functionality; Customization | 2005-10 |
| 264 |
 |
Lindstrom, Gary E. | Layered, server-based support for Object-Oriented application development | This paper advocates the idea that the physical modularity (file structure) of application components supported by conventional OS environments can be elevated to the level of logical modularity, which in turn can directly support application development in an object-oriented manner. We demonstrate ... | Object-Oriented application development | 1995 |
| 265 |
 |
Zhang, Lixin; Carter, John | Memory system support for image processing | Processor speeds are increasing rapidly, but memory speeds are not keeping pace. Image processing is an important application domain that is particularly impacted by this growing performance gap. Image processing algorithms tend to have poor memory locality because they access their data in a non-se... | Processor speeds; Memory system support; Memory speeds | 1999 |
| 266 |
 |
Lindstrom, Gary E. | Modularity meets inheritance | We "unbundle" several roles of classes in existing languages, by providing a suite of operators independently controlling such effects as combination, modification, encapsulation, name resolution, and sharing, all on the single notion of module. All module operators are forms of inheritance. Thus, ... | Modularity; Jigsaw computer tool | 1991 |
| 267 |
 |
Lindstrom, Gary E. | Our LIPS are sealed: interfacing logic and functional programming systems | We report on a technique for interfacing an untyped logic language to a statically poly morphically typed functional language Our key insight is that polymorphic types can be interpreted as "need to know" specifications on function arguments. This leads to a criterion for liberally yet safely invoki... | LIPS; Logic language; Functional language | 1992 |
| 268 |
 |
Gopalakrishnan, Ganesh | Partial order reduction without the proviso | In this paper, we present a new partial order reduction algorithm that can help reduce both space and time requirements of on-the-fly explicit enumeration based verifiers. The partial order reduction algorithms described in [God95, HP94, Pel94, Pel96] were observed to yield very little savings in ma... | Partial order reduction algorithms | 1996 |
| 269 |
 |
Reinhard, Erik; Stark, Michael M.; Shirley, Peter S. | Photographic tone reproduction for digital images | A classic photographic task is the mapping of the potentially high dynamic range of real world luminances to the low dynamic range of the photographic print. This tone reproduction problem is also faced by computer graphics practitioners who must map digital images to a low dynamic range print or... | Tone reproduction operator; Photographic tone | 2002-01-14 |
| 270 |
 |
Bruderlin, Beat | Robust regularized set operations on polyhedra | This paper describes a provably correct and robust implementation of regularized set operations on polyhedral objects. Although the algorithm described here does not assume manifold polyhedra and handles all possible degenerate cases, it turns out to be quite simple. The geometric operations and rel... | Robust regularized set operations | 1990 |
| 271 |
 |
Bruderlin, Beat | Robust solid modeling by avoiding redundancy for manifold objects in boundary representation | This paper describes a new approach to the robustness problem in solid modeling. We identify as t h e main cause of t h e lack of robustness that interdependent topological relations are derived from approximate data. Disregarding the interdependencies very likely violates basic properties, such as... | Robust solid modeling; Manifold objects; Boundary representation; Robustness problem | 1993 |
| 272 |
 |
Baker, Jason; Hsieh, Wilson C. | Runtime aspect weaving through metaprogramming | We describe an extension to the Java language, Handi-Wrap, that supports weaving aspects into code at runtime. Aspects in Handi-Wrap take the form of method wrappers, which allow aspect code to be inserted around method bodies like advice in AspectJ. Handi- Wrap offers several advantages over sta... | Metaprogramming; Runtime; Handi-Wrap | 2001 |
| 273 |
 |
Sikorski, Kris | Selected fixed point problems and algorithms | We present a new version of the almost optimal Circumscribed Ellipsoid Algorithm (CEA) for approximating fixed points of nonexpanding Lipschitz functions. We utilize the absolute and residual error criteria with respect to the second norm. The numerical results confirm that the CEA algorithm is m... | Fixed point problems; Optimal algorithms; Nonlinear equations; Ellipsoid algorithm; Computational complexity. | 2007 |
| 274 |
 |
Allen, Edgar S. | Sensory information processing (1 July 1975 - 31 December 1975) | In the previous semi-annual report a new method was described for removing blur from photographic images. Several experiments are described here illustrating the effect of adjusting the cutoff frequency of filters used in the restoration scheme. | Blur; Photographic images; Restoration scheme | 1977 |
| 275 |
 |
Gopalakrishnan, Ganesh | Static analysis techniques for the synthesis of efficient asynchronous circuits | In the context of deriving asynchronous circuits from high-level descriptions, determining whether two actions are potentially concurrent (overlapped execution) or serial (non-overlapped execution) has several advantages. This knowledge can be utilized to efficiently implement shared variables, sup... | Static analysis; Synthesis | 1991 |