| | Creator | Title | Description | Subject | Date |
|---|
| 1 |  | Gopalakrishnan, Ganesh | The 'test model-checking' approach to the verification of formal memory models of multiprocessors | We offer a solution to the problem of verifying formal memory models of processors by com bining the strengths of model checking and a formal testing procedure for parallel machines We characterize the formal basis for abstracting the tests into test automata and associated memory rule safety p... | Formal memory models; Shared memory multiprocessors; Formal testing; Model; Checking | 1998 |
| 2 |  | Gopalakrishnan, Ganesh | The 'Test model-checking' approach to the verification of formal memory models of multiprocessors | We offer a solution to the problem of verifying formal memory models of processors by combining the strengths of model-checking and a formal testing procedure for parallel machines. We characterize the formal basis for abstracting the tests into test automata and associated memory rule safety proper... | Test Model-checking; Formal memory; Verification | 1998 |
| 3 |  | Henderson, Thomas C. | 2-D scene analysis using split-level relaxation | We present a new method for applying multiple semantic constraints based on discrete relaxation. A separate graph is maintained for each constraint relation and used in parallel to achieve a consistent labeling. This permits both local and global analysis without recourse to complete graphs. Here l... | Discrete relaxation; Split-level relaxation | 1985 |
| 4 |  | Bhanu, Bir | 3-D model building for computer vision | This paper presents a Computer-Aided Geometric Design (CAGD) based approach for building 3-D models which can be used for the recognition of 3-D objects for industrial machine vision applications. The objects are designed using the Alpha_1 CAGD system developed at the University of Utah. A new metho... | CAGD; 3-D models; Machine vision | 1985 |
| 5 |  | Gooch, Amy A.; Gooch, Bruce; Willemsen, Peter; Kniss, Joe; Riesenfeld, Richard F.; Shirley, Peter S. | 3D Line textures and the visualization of confidence in Architecture | This work introduces a technique for interactive walkthroughs of non-photorealistically rendered (NPR) scenes using 3D line primitives to define architectural features of the model, as well as indicate textural qualities. Line primitives are not typically used in this manner in favor of texture ma... | Presentation graphics; Interactive walkthroughs | 2007 |
| 6 |  | Myntti, Jeremy | 5 Photo Scanning Tips | Presentation on digitizing photographs at the RootsTech Conference, Salt Lake City, Utah. | Family history; Digital images; Photographs | 2019-02-28 |
| 7 |  | Erickson, John Owen | 50% Solution | Form: painting; Medium: oil and latex; Dimensions: 18 x 24" | Painting | 2008 |
| 8 |  | Poeppelmeier, Charles Christian | A boolean sum interpolation scheme to random data for computer aided geometric design | This thesis presents a new imterpolation function for randomly distributed data. The new interpolation function is capable of exactly reproducing quadratic surfaces. The new function is developed, through boolean sum theory, from Shepard's two dimensional interpolation functions and the Barnhill-Gre... | Computer-aided geometric design; CAGD; Barnhill-Gregory; Interpolation functions | 1975 |
| 9 |  | Panangaden, Prakash | A category theoretic formalism for abstract interpretation | We present a formal theory of abstract interpretation based on a new category theoretic formalism. This formalism allows one to derive a collecting semantics which preserves continuity of lifted functions and for which the lifting functon is itself continuous. The theory of abstract interpretation i... | Formal theory; Theoretic formalism; Lifted functions | 1984 |
| 10 |  | Brunvand, Erik L. | A cell set for self-timed design using actel FPGAs | Asynchronous or self-timed systems that do not rely on a global clock to keep system components synchronized can offer significant advantages over traditional clocked circuits in a variety of applications. However, these systems require that suitable self-timed circuit primitives are available for b... | Self-timed systems; Actel field programmable gate arrays; FPGA | 1991 |
| 11 |  | Davis, Alan L. | A characterization of parallel systems | a taxonomy for parallel processing systems is presented which has some advantages over previous taxonomies. The taxonomy characterizes parallel processing systems using four parameters: topology, communication, granularity, and operation. These parameters and used repetitively in a hierarchical fash... | Parallel systems | 1980 |
| 12 |  | Mathew, Binu K.; Davis, Al | A characterization of visual feature recognition | Natural human interfaces are a key to realizing the dream of ubiquitous computing. This implies that embedded systems must be capable of sophisticated perception tasks. This paper analyzes the nature of a visual feature recognition workload. Visual feature recognition is a key component of a numb... | Visual feature recognition; Human interfaces | 2003-09-03 |
| 13 |  | Chen, Yang; Regehr, John | A code size microbenchmark for C | Motivation ? No compilers could always generate smaller code than others ? Hand-optimized code is often hard to understand ? Programmers tend to write readable code and trust compilers generate fast and compact code for them ? There is a plenty of room for improving compiler optimizations Our ... | | |
| 14 |  | Carter, John | A collective approach to harness idle resources | We propose a collective approach for harnessing the idle resources (cpu, storage, and bandwidth) of nodes (e.g., home desktops) distributed across the Internet. Instead of a purely peer-to-peer (P2P) approach, we organize participating nodes to act collectively using collective managers (CMs). Pa... | Idle resources; Computer nodes | 2008 |
| 15 |  | Kessler, Robert R. | A communication-ordered task graph allocation algorithm | The inherently asynchronous nature of the data flow computation model allows the exploitation of maximum parallelism in program execution. While this computational model holds great promise, several problems must be solved in order to achieve a high degree of program performance. The allocation and ... | Task graph allocation algorithm | 1992 |
| 16 |  | Evans, John; Kessler, Robert R. | A communication-ordered task graph allocation algorithm | The inherently asynchronous nature of the data flow computation model allows the exploitation of maximum parallelism in program execution?? While this computational model holds great promise several problems must be solved in order to achieve a high degree of program performance?? The allocation... | Data flow computation model | 1992 |
| 17 |  | Jones, David T. | A comparative study of certain goblet cells | The origin of the primordial droplets has been rightly given the primary place in the study of secretion. Bowen has limited the term secretion to the actual synthesis of these droplets from cytoplasmic materials, which limitation we shall accept. The secondary problems in this field concern chieflly... | | 1937-06 |
| 18 |  | Mulaik, Dorothea De Muth | A comparative study of the urinogenital systems of an oviparous and two ovoviviparous species of the lizard genus sceloporus | In the comparative study of the urinogenital systems of the American lizards by Brooks (1906), all the species studied by him were oviparous. One of the genera, Sceloporus, is now known to contain ovoviviparous forms as well. The presence of both oviparity and ovoviviparity in the same genus suggest... | | 1946-11-20 |
| 19 |  | McDirmid, Sean; Eide, Eric Norman; Hsieh, Wilson C. | A comparison of Jiazzi and AspectJ for feature-wise decomposition | Feature-wise decomposition is an important approach to building configurable software systems. Although there has been research on the usefulness of particular tools for featurewise decomposition, there are not many informative comparisons on the relative effectiveness of different tools. In this... | Jiazzi; AspectJ; Feature-wise decomposition | 2004-03-23 |
| 20 |  | Brunvand, Erik L. | A comparison of modular self-timed design styles | State-machine sequencing methods in modular 2-phase and 4-phase asynchronous handshake control are compared. Design styles are discussed, and the sequencers are tested against each other using a medium-scale minicomputer test design implemented in FPGAs. Seven 4-phase sequencers are tested. In these... | Self-timed; State-machine sequencing; Asynchronous handshake control | 1995 |
| 21 |  | Zhang, Lixin | A comparison of online superpage promotion mechanisms | The amount of data that a typical translation lookaside buffer (TLB) can map has not kept pace with the growth in cache sizes and application footprints. As a result, the cost of handling TLB misses limits the performance of an increasing number of applications. The use of superpages, multiple adjac... | Superpages; Translation lookaside buffer; TLB | 1999 |
| 22 |  | Carter, John B. | A comparison of software and hardware synchronization mechanisms for distributed shared memory multiprocessors | Efficient synchronization is an essential component of parallel computing. The designers of traditional multiprocessors have included hardware support only for simple operations such as compare-and-swap and load-linked/store-conditional, while high level synchronization primitives such as locks, bar... | Hardware locks | 1996 |
| 23 |  | Gopalakrishnan, Ganesh | A compositional model for synchronous VLSI systems | Currently available hardware specification languages have two serious deficiencies: (i) inadequate protocol definition capabilities; (ii) lack of a compositional model. We now explain these in more detail. | Very large scale integration; VLSI systems | 1987 |
| 24 |  | Durney, Carl H. | A computer graphics method for solving transcendental equations | There are a number of ways to determine the values of x which satisfy the equation F(x)=0. (The case of interest here is that in which F i s a complex function of the complex variable x.) One way is to search for values of x which make Real (F(x)) and Imaginary (F(x)) both zero at the same time wher... | Transcendental equations | 1970 |
| 25 |  | 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 |
