|
|
Creator | Title | Description | Subject | Date |
1 |
|
Sobh, Tarek M.; Henderson, Thomas C. | A dynamic framwork for intelligent inspection | CAD Computer Aided Design typically involves the design manufacture and inspection of a me chanical part. The problem of reverse engineering is to take an existing mechanical part as the point of departure and to inspect or produce a design and perhaps a manufacturing process for the part. ... | CAD; Manufacture; Inspection; Intelligent inspection | 1992 |
2 |
|
Sobh, Tarek M.; Henderson, Thomas C. | A dynamic recursive structure for intelligent exploration | We suggest a new approach for inspection and reverse engineering applications. In particular, we investigate the use of discrete event dynamic systems (DEDS) to guide and control the active exploration and sensing of mechanical parts for industrial inspection and reverse engineering. We introduce dy... | Intelligent exploration; Discrete event dynamic systems; DEDS; Dynamic recursive finite state machines; DRFSM | 1992 |
3 |
|
Sobh, Tarek M.; Henderson, Thomas C. | A dynamic recursive structure for intelligent inspection | We suggest a new approach for inspection and reverse engineering applications. In particular we investigate the use of discrete event dynamic systems DEDS to guide and control the active exploration and sensing of mechanical parts for industrial inspection and reverse engineering?? We introduce... | Intelligent inspection; Discrete event dynamic systems; DEDS; Industrial inspection; Dynamic recursive structure | 1992 |
4 |
|
Whitaker, Ross T. | A fast iterative method for a class of Hamilton-Jacobi equations on parallel systems | In this paper we propose a novel computational technique, which we call the Fast Iterative Method (FIM), to solve a class of Hamilton- Jacobi (H-J) equations on massively parallel systems. The proposed method manages the list of active nodes and iteratively updates the solutions on those nodes u... | Fast Iterative Method; FIM; Parallel systems | 2007 |
5 |
|
Smith, Kent F. | A fast parallel squarer based on divide-and-conquer | Fast and small squarers are needed in many applications such as image compression. A new family of high performance parallel squarers based on the divide-and-conquer method is reported. Our main result was realizing the basis cases of the divide-and-conquer recursion by using optimized n-bit primiti... | Squarer; Parallel squarers; Divide-and-conquer; MOPS; CMOS | 1995 |
6 |
|
Henderson, Thomas C.; Hansen, Charles D. | A fault tolerant sensor scheme | Multi-sensor systems pose the problem of how to coherently and efficiently treat the data provided by the various sensors. However. the availability of greater numbers of sensors also broadens the ability to build fault tolerant sensor systems. We define a framework in which sensors can be abstractl... | Multi-sensor systems; Logical sensors | 1983 |
7 |
|
Lindstrom, Gary E. | A framework for module-based language processors | A system composed of interconnected modules is a module-based system. We present an object-oriented (0-0) framework for the development of processors for module-based systems, such as compilers for 0-0 languages, linkers/loaders, and tools for user/system libraries. We claim t h a t this framework,... | Language processors; Jigsaw; Module-based | 1993 |
8 |
|
Michell, Nick | A gallium arsenide mutual exclusion element | A mutual exclusion element is a key component in building asynchronous and self-timed circuits. As part of our effort to design high performance self-timed circuits, we have designed a mutual exclusion element in gallium arsenide. This circuit has been fabricated in a 1.2? process and tested. A test... | Mutual exclusion element; Self-timed circuits | 1993 |
9 |
|
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 |
10 |
|
Gopalakrishnan, Ganesh | A general compositional approach to verifying hierarchical cache coherence protocols | Modern chip multiprocessor (CMP) cache coherence protocols are extremely complex and error prone to design. Modern symbolic methods are unable to provide much leverage for this class of examples. In [1], we presented a method to verify hierarchical and inclusive versions of these protocols using ... | Hierarchical cache coherence protocols; Verification | 2006-11-26 |
11 |
|
Yang, Yue; Gopalakrishnan, Ganesh; Lindstrom, Gary E. | A generic operational memory model specification framework for multithreaded program verification | Given the complicated nature of modern architectural and language level memory model designs, it is vital to have a systematic ap- proach for specifying memory consistency requirements that can support verification and promote understanding. In this paper, we develop a spec- ification methodolog... | Multithreaded program verification | 2003 |
12 |
|
Lefohn, Aaron; Whitaker, Ross T. | A GPU-based, three-dimensional level set solver with curvature flow | Level set methods are a powerful tool for implicitly representing deformable surfaces. Since their inception, these techniques have been used to solve prob- lems in fields as varied as computer vision, scientific visualization, computer graphics and computational physics. With the power and flexi... | GPU-based; Level set solver | 2002-12-11 |
13 |
|
Sobh, Tarek M. | A graphical environment and applications for discrete event and hybrid systems in robotics and automation | In this paper we present an overview for the development of a graphical environment for simulating, analyzing, synthesizing, monitoring, and controlling complex discrete event and hybrid systems within the robotics, automation, and intelligent system domain. We start by presenting an overview of di... | Intelligent system domain; Graphical environment | 1994 |
14 |
|
Warnock, John E. | A hidden line algorithm for halftone picture representation | In exploring applications in computer graphics, one finds quickly that the representation of three dimensional objects in picture form is both a desirable and necessary capability. Applications dealing with any form of spatial design or with visual environment simulation need the ability to represen... | Halftone picture representation; Spatial design | 1968 |
15 |
|
Cohen, Elaine | A hole-filling algorithm for triangular meshes | Data obtained by scanning 3D models typically contains missing pieces and holes. These can be caused due to scanning artifacts or artifacts in the surface due to wear and tear. We provide a method based on the Moving Least Squares projection to fill holes in triangular meshes obtained during the ... | Hole-filling algorithm; Triangular meshes; 3D models; Scanning | 2004-12-20 |
16 |
|
Starkey, Mike | A lisp-based occam interpreter | The OCCAM programming language is an implementation of Communicating Sequential Processes and is used in a number of different areas. These areas usually require explicitly describing small-grain paralleslism. OCCAM programs formed by such descriptions can be tested for correctness by executing the... | Lisp-based; Occam interpreter | 1991 |
17 |
|
Bennion, Scott Thomas | A method of solution for hydrodynamics and radiation diffusion as a multi-material problem in one dimension | | Multi-material problem | 1971 |
18 |
|
Weinstein, David | A morphing algorithm for generating near optimal grids: applications in computational medicine | We apply morphing to t h e problem of generating the initial mesh for finite element simulations. This algorithm reduces mesh adaptation time by integrating physical and geometric constraints to provide a near optimal initial mesh. We apply this method to large-scale bioelectric field problems invol... | Morphing algorithm; Bioelectric field problems | 1994 |
19 |
|
Subrahmanyam, P.A. | A new approach to specifying and handling exceptions | An operation generally exhibits different patterns of behavior over different parts of its domain. Depending upon the context, such behavior may either be conceived of as "normal" or as an "exception." Thus, the behavior of an operation Is quite naturally characterized by the set of partial operatio... | Computer operations; Exceptions; Exception handling | 1980 |
20 |
|
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 |
21 |
|
Kirby, Robert Michael II; Johnson, Christopher R. | A new family of variational-form-based regularizers for reconstructing epicardial potentials from body-surface mapping | We propose a new family of regularizers for the inverse ECG problem, using a variational principle that underlies finite element approximation methods. As an alternative to traditional Tikhonov regularizers, the variational formulation has several advantages: 1)it enables a simple construction of ... | | 2010 |
22 |
|
Cohen, Elaine | A new local basis for designing with tensioned splines | Recently there has been a great deal of interest in the use of "tension" parameters to augment control mesh vertices as design handles for piecewise polynomials. A particular local cubic basis called p-splines, which has been termed a "generalization of B-splines", has been proposed as an appropriat... | Tensioned splines | 1985 |
23 |
|
Sikorski, Kris | A note on optimal algorithms for fixed points | We present a constructive lemma that we believe will make possible the design of nearly optimal 0(dlog | ) cost algorithms for computing eresidual approximations to the fixed points of d-dimensional nonexpansive mappings with respect to the infinity norm. This lemma is a generalization of a two-... | Fixed points; Constructive lemma | 2009 |
24 |
|
Lyche, Tom | A note on the Oslo algorithm | The Oslo algorithm is a recursive method for updating the B-spline representation of a curve or tensor product surface when extra knots are added. In the present note the derivation of this method is simplified. | Oslo algorithm; B-spline; Curve product surface; Tensor product surface | 1987 |
25 |
|
Sloan, Peter-Pike | A painterly approach to human skin | Rendering convincing human figures is one of the unsolved goals of computer graphics. Previous work has concentrated on modeling physics of human skin. We have taken a different approach. We are exploring techniques used by artists, specifically artists who paint air-brushed portraits. Our goal is t... | Human skin | 1999 |
26 |
|
Parke, Frederic Ira | A parametric model for human faces | This report presents a computer model for the representation of human faces. This three-dimensional, parametric model produces shaded facial images. The face, constructed of polygonal surfaces, is manipulated through the use of parameters which control interpolation, translation, rotation and scalin... | Parametric model; Human face | 1975 |
27 |
|
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 |
28 |
|
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 |
29 |
|
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 |
30 |
|
McDirmid, Sean; Hsieh, Wilson C. | A path-precise analysis for property synthesis | Recent systems such as SLAM, Metal, and ESP help programmers by automating reasoning about the correctness of temporal program properties. This paper presents a technique called property synthesis, which can be viewed as the inverse of property checking. We show that the code for some program pro... | Property synthesis; Property codes | 2003-12-01 |
31 |
|
Thompson, Cynthia A. | A personalized system for conversational recommendations | Increased computing power and theWeb have made information widely accessible. In turn, this has encouraged the development of recommendation systems that help users find items of interest, such as books or restaurants. Such systems are more useful when they personalize themselves to each user?s p... | Adaptive Place Advisor; Recommendation systems | 2002-06-26 |
32 |
|
Regehr, John | A practical logic framework for verifying safety properties of executables | We present a novel program logic, Lf , which is designed on top of a Hoare logic, but is simpler, more flexible and more scalable. Based on Lf , we develop a framework for automatically verifying safety properties of executables. It utilizes a whole-program interprocedural abstract interpretation to... | | 2011-01-01 |
33 |
|
Hansen, Charles D. | A practical workflow for making anatomical atlases for biological research | An anatomical atlas provides a detailed map for medical and biological studies of anatomy. These atlases are important for understanding normal anatomy and the development and function of structures, and for determining the etiology of congenital abnormalities. Unfortunately, for biologists, generat... | | 2012-01-01 |
34 |
|
Gouraud, Henri | A programmer's guide to PDP-10 euler | This manual describes the EULER language as implemented on the DEC PDP-10 computer. EULER is a block-structured language, similar to Algol-60 but simplified by omitting type declarations and by altering the way procedures are defined and called. PDP-10 EULER includes features for list-and array-mani... | EULER language | 1970 |
35 |
|
Watkins, Gary Scott | A real time visible surface algorithm | With the increasing use of computer graphics, a need is growing for a processor capable of displaying solid objects. Environmental simulation and architectural modeling are only two areas that would benefit from such a diplay processor. This dissertation describes an algorithm designed for such a ... | Surface algorithm | 1970 |
36 |
|
Kirby, Robert Michael | A scalable, efficient scheme for evaluation of stencil computations over unstructured meshes | Stencil computations are a common class of operations that appear in many computational scientific and engineering applications. Stencil computations often benefit from compile-time analysis, exploiting data-locality, and parallelism. Post-processing of discontinuous Galerkin (dG) simulation solutio... | | 2013-01-01 |
37 |
|
George, Lal | A scheduling strategy for shared memory multiprocessors | An efficient scheduling strategy for shared memory multiprocessors is described. The rapid dissemination of tasks to available procesors and ready queues is crucial to the performance of any parallel system. Such overheads determine the attainable speedup and performance of the system. Poor techniq... | Shared memory multiprocessors | 1990 |
38 |
|
Fujimoto, Richard M. | A shared memory algorithm and proof for the alternative construct in CSP | Communicating Sequential Processes (CSP) is a paradigm for communication and synchronization among distributed processes. The alternative construct is a key feature of CSP that allows nondeterministic selection of one among several possible communicants. Previous algorithms for this construct assume... | Shared memory algorithm; Communicating Sequential Processes; CSP | 1987 |
39 |
|
Baxter, Brent S. | A standard magnetic tape format for digital image exchange | This proposal describes a simple yet flexible magnetic tape format for exchanging digital image information. Multi-dimensional arrays of raster scan data are stored as sequential files, with descriptive information related to the sefiles stored in an initial directory file. Directory information is ... | Raster scan data | 1981 |
40 |
|
Henderson, Thomas C. | A study of Pierce's group generator | Pierce describes an approach to map learning with uninterpreted sensors and effectors. As part of that, he describes a sensor grouping generator operator that attempts to arrange similar sensors into groups. Here we review that work and place it in a more strenuous statistical validation framewor... | Pierce's group; Map learning; Sensor grouping generator | 2010 |
41 |
|
Henderson, Thomas C. | A survey of dextrous manipulation | The development of mechanical end effectors capable of dextrous manipulation is a rapidly growing and quite successful field of research. It has in some sense put the focus on control issues, in particular, how to control these remarkably humanlike manipulators to perform the deft movement that we t... | Dextrous manipulation | 1986 |
42 |
|
Berzins, Martin | A survey of high level frameworks in block-structured adaptive mesh refinement packages | Over the last decade block-structured adaptive mesh refinement (SAMR) has found increasing use in large, publicly available codes and frameworks. SAMR frameworks have evolved along different paths. Some have stayed focused on specific domain areas, others have pursued a more general functionality, p... | | 2014-01-01 |
43 |
|
Gopalakrishnan, Ganesh; Kirby, Robert Michael II | A survey of MPI related debuggers and tools | Message Passing Interface is a widely used standard in the High Performance and Scienti c Computing Community for writing programs that can exploit the capability of parallel platforms. However, the inherent complexity and the size of the communication standard have made it difficult for programm... | Message Passing Interface; MPI; Debuggers | 2007 |
44 |
|
Sobh, Tarek M. | A survey on sensor classifications for industrial applications | The importance of sensors in industrial applications is a result of the introduction of many robotics, automation, and intelligent control techniques into factory floors. Research and improvements need to be continuously performed to meet the challenges in automation and manufacturing applications i... | Sensor classifications; Industrial applications; Sensors | 1995 |
45 |
|
Gopalakrishnan, Ganesh | A symbolic partial order reduction algorithm for rule based transition systems | Partial order reductions are a class of methods that attempt to reduce the state space that must be explored to verify systems by explicit state enumeration. Partial order reduction algorithms have been successfully incorporated into tools such as Spin and VFSM-valid. However, current partial ord... | Partial order reductions; Partial order reduction algorithms; SAT solver; Rule based transition systems | 2003-12-01 |
46 |
|
Henderson, Thomas C. | A systolic array implementation of discrete relaxation algorithm | Discrete Relaxation techniques have proven useful in solving a wide range of problems in digital signal processing, artificial intelligence, machine vision, and VLSI engineering, etc. A conventional hardware design for an 8-label 8-object Discrete Relaxation Algorithm (DRA) requires three 4K memory... | Discrete Relaxation algorithm; Systolic array | 1986 |
47 |
|
Seeley, Donn | A tour of the worm | On the evening of November 2, 1988, a self-replicating program was released upon the Internet 1. This program (a worm) invaded VAX and Sun-3 computers running versions of Berkeley UNIX, and used their sources to attack still more computers2. Within the space of hours this program had spread aacross ... | Computer worm | 1989 |
48 |
|
Gopalakrishnan, Ganesh | A transformational approach to asynchronous high-level synthesis | Asynchronous high-level synthesis is aimed at transforming high level descriptions of algorithms into efficient asynchronous circuit implementations. This approach is attractive from the point of view of the flexibility it affords in performing high level program transformations on users' initial d... | High level synthesis tool; SHILPA | 1993 |
49 |
|
Cohen, Elaine | A triangulation-invariant method for anisotropic geodesic map computation on surface meshes | This paper addresses the problem of computing the geodesic distance map from a given set of source vertices to all other vertices on a surface mesh using an anisotropic distance metric. Formulating this problem as an equivalent control theoretic problem with Hamilton-Jacobi-Bellman partial different... | | 2012-01-01 |
50 |
|
Sobh, Tarek M.; Henderson, Thomas C. | A unifying framework for tolerance analysis in sensing, design, and manufacturing | In this work we address the problem of tolerance representation and analysis across the domains of industrial inspection using sensed data, CAD design, and manufacturing. Instead of using geometric primitives in CAD models to define and represent tolerances, we propose the use of stronger methods t... | Tolerance representation; Tolerance analysis; Industrial inspection; Sensed data; CAD design | 1994 |
51 |
|
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 |
52 |
|
Awasthi, Manu; Nellans, David W.; Sudan, Kshitij; Balasubramonian, Rajeev | ABP : predictor based management of DRAM row buffers | DRAM accesses are costly, especially in multicore systems. Future CMPs will run a mixed load of workloads/threads. Destructive interference at memory controller, spatio-temporal locality lost! DRAM row-buffer hits are least expensive, row-conflicts are most. Randomized memory access patterns re... | | 2010-10-06 |
53 |
|
Panangaden, Prakash | Abstract interpretation and indeterminacy | We present a semantic theory that allows us to discuss the semantics of indeterminate operators in a dataflow network. The assumption is made that the language in which the indeterminate operators are written has a construct that allows for the testing of availability of data on input lines. We then... | Semantics; Indeterminate operators | 1984 |
54 |
|
Lindstrom, Gary E. | Abstract semantics for functional constraint programming | A denotational semantics is given for a lazy functional language with monotonic side-effects arising from the unification of singly-bound logical variables. The semantics is based on a Scott-style information system, which elegantly captures the notion of "constraint additin" inherent in unificati... | Abstract semantics | 1989 |
55 |
|
Hansen, Charles D. | Accelerated isosurface extraction in time-varying fields | For large time-varying data sets, memory and disk limitations can lower the performance of visualization applications. Algorithms and data structures must be explicitly designed to handle these data sets in order to achieve more interactive rates. The Temporal Branch-on-Need Octree (T-BON) extends t... | Isosurfaces; Time-dependent scalar field visualization; Multiresolution methods; Octree; Bricking; Unstructured grid visualization; Out-of-core visualization | 2000 |
56 |
|
Callahan, Michael Wayne | Acoustic signal processing based on the short-time spectrum | The frequency domain representation of a time signal afforded by the Fourier transform is a powerful tool in acoustic signal processing. The usefulness of this representation is rooted in the mechanisms of sound production and perception. Many sources of sound exhibit normal modes or natural frequen... | Acoustic signal processing | 1976 |
57 |
|
Brunvand, Erik L. | ACT: A DFT tool for self-timed circuits | This paper presents a Design for Testability (DFT) tool called ACT (Asynchronous Circuit Testing) which uses a partial scan technique to make macro-module based selftimed circuits testable. The ACT tool is the first oFits kind for testing macro-module based self-timed circuits. ACT modifies design... | | 1997 |
58 |
|
Sobh, Tarek M. | Active inspection and reverse engineering | We propose a new design for inspection and reverse engineering environments. In particular, we investigate the use of discrete event dynamic systems (DEDS) to guide and control the active exploration and sensing of mechanical parts for industrial inspection and reverse engineering. We introduce dyn... | Discrete event dynamic systems; DEDS; Industrial inspection | 1993 |
59 |
|
Organick, Elliott I. | ADA to silicon transformations: the outline of a method | This report explores the contention that a high-order language specification of a machine (such as an Ada program) can be methodically transformed into a hardware representation of that machine. One series of well-defined steps through which such transformations can take place is presented in this i... | ADA program; High-order language specification | 1982 |
60 |
|
Carter, Tony M. | Ada-to-silicon compiler study (Final Report 30 Jan 85 - 30 Jun 86) | The vision of a system design environment in which both hardware and software components could be designed, tested, and executed was proffered by the late Dr. Elliott Organick1 in 1981. He was impressed by the objectiveness of Ada and the availability of an architecture (the Intel 432) which was sp... | ADA language | 1986 |
61 |
|
Berzins, Martin | Adaptive high-order discontinuous galerkin solution of elastohydrodynamic lubrication point contact problems | This paper describes an adaptive implementation of a high order Discontinuous Galerkin (DG) method for the solution of elastohydrodynamic lubrication (EHL) point contact problems. These problems arise when modelling the thin lubricating film between contacts which are under sufficiently high pressur... | | 2012-01-01 |
62 |
|
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 |
63 |
|
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 surface... | Freeform surface rendering; Isocurves | 1992 |
64 |
|
Henderson, Thomas C. | Agent-based engineering drawing analysis | Interpretation of paper drawings has received a good deal of attention over the last decade. Related areas such as direct interpretation of human drawings (HCI), search and indexing of graphics databases, and knowledge representation in the domain of graphics and drawing understanding have also s... | Interpretation; Human drawings; HCI; Graphic databases | 2002-02-04 |
65 |
|
Crow, Franklin C. | The aliasing problem in computer-synthesized shaded images | This paper describes work toward improving the quality of computer-synthesized shaded images. Current (practical) hidden-surface algorithms produce an image whose precision is strictly limited by the number of picture elements. Problems caused by this limitation are described and explained in the t... | aliasing problem; shaded images; hidden-surface algorithms | 1976 |
66 |
|
Lindstrom, Gary E. | Alpha-beta pruning on evolving game trees | The alpha-beta strategy is a widely used method for economizing on the size of game trees. Heretofore, its application has been limited to depth-first tree growth in recursive search functions. However, many modern game players use retentive (i.e. coroutine-based) control to achieve greater attentio... | Alpha-beta pruning; Game trees | 1979 |
67 |
|
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 |
68 |
|
George, Lal | An abstract machine for parallel graph reduction | An abstract machine for parallel graph reduction on a shared memory multiprocessor is described. This is intended primarily for normal order (lazy) evaluation of functional programs. It is absolutely essential in such a design to adapt an efficient sequential model since during execution under limit... | Parallel graph reduction | 1989 |
69 |
|
Subrahmanyam, P.A. | An algebraic formulation of seitz's weak conditions for self timed circuits | Two fairly intuitive conditions are given that serve to algebraically characterize Seitz's "weak conditions" for self timed circuits. It is shown that these two conditions embody the 12 temporal logic conditions (developed b y Owicki and Malachi) which are intended to express both the weak condition... | Seitz's weak conditions; Self-timed circuits | 1982 |
70 |
|
Shirley, Peter S. | An anisotropic phong light reflection model | We present a new BRDF model that attempts to combine the advantages of the various empirical models currently in use. In particular, it has intuitive parameters, is anisotropic, energy-conserving, reciprocal, has an appropriate non-Lambertian diffuse term, and is well-suited for use in a Monte Carlo... | BRDF model; Anisotropic; Phong light reflection model | 2000 |
71 |
|
Henderson, Thomas C. | An annotated bibligraphy of multisensor integration | In this paper we give an annotated bibliography of the multisensor integration literature. | Multisensor integration; Bibligraphy | 1988 |
72 |
|
Greenfield, Harvey | An application of computer graphics: two concurrent investigations within the medical field | The aim of this project is to apply new or recently developed computer graphic techniques to a particular discipline with the thought of broadening its research capabilities. The discipline chosen, that of medicine, has emphasis places on the area of hemodynamics. It is seen that computer graphics m... | Computer graphic techniques | 1971 |
73 |
|
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 |
74 |
|
Henderson, Thomas C. | An approach to three-dimensional scene databases | Current image database research is concerned for the most part with the encoding and processing of two-dimensional images. However, the most successful approach to computer vision is based on 3-dimensional information, organized as either stacks of 2-D images (e.g., the intrinsic images of Barrow an... | Image databases; Three-dimensional; Scene databases | 1987 |
75 |
|
Keller, Robert M.; Lindstrom, Gary E. | An architecture for a loosely-coupled parallel processor | An architecture for a large (e. g. 1000 processor) parallel computer is presented. The processors are loosely-coupled, in the sense that communication among them is fully asynchronous, and each processor is generally not unduly delayed by any immediate need for specific data values. The network supp... | Loosely-coupled; Parallel processors | 1978 |
76 |
|
Bruderlin, Beat | An axiomatic approach for solving geometric problems symbolically | This paper describes a new approach for solving geometric constraint problems and problems in geometry theorem proving. We developed a rewrite-rule mechanism operating on geometric predicates. Termination and completeness of the problem solving algorithm can be obtained through well foundedness and ... | Geometric constraint problems; Geometry theorem proving; Knuth-Bendix completion algorithm | 1990 |
77 |
|
Willemsen, Peter; Gooch, Amy A. | An experimental comparison of perceived egocentric distance in real, image-based, and traditional virtual environment using direct walking tasks | In 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 environments | 2002-02-12 |
78 |
|
Newman, William M. | An experimental display programming language for the PDP-10 computer | An 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 Algol | 1970 |
79 |
|
Riesenfeld, Richard F.; Smith, Kent F. | An experimental system for computer aided geometric design | The 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 integration | 1984 |
80 |
|
Khoche, Ajay | An extended cell set of self-timed designs | The 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-blocks | 1993 |
81 |
|
Gopalakrishnan, Ganesh; Humphrey, Alan Parker; Derrick, Christopher Glade | An integration of dynamic MPI formal verification within eclipse PTP | Our research goals were to verify practical MPI programs for deadlocks, resource leaks, and assertion violations at the push of a button and be able to easily visualize the results. We also sought to integrate these capabilities with the Eclipse IDE via an Eclipse plug-in for the Parallel Tools Plat... | Verification; Graphical User Interfaces; Dynamic Interleaving Reduction; Message Passing; MPI; Multi-core; Eclipse Parallel Tools Platform; Trapeze Interactive Poster | 2010-03-15 |
82 |
|
Bruderlin, Beat | An interactive N-Dimensional constraint system | In 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 solving | 1994 |
83 |
|
Gopalakrishnan, Ganesh | An interface aware guided search method for error-trace justification in large protocols | Many complex concurrent protocols that cannot be formally verified due to state explosion can often be formally verified by initially creating a collection of abstractions (overapproximations), and subsequently refining the overapproximated protocol in response to spurious counterexample traces. ... | Concurrent protocols; Verification; Error-trace justification | 2008 |
84 |
|
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 |
85 |
|
Davis, Al | An introduction to asynchronous circuit design | The 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 design | 1997 |
86 |
|
Riloff, Ellen M. | An introduction to the Sundance and AutoSlog systems | This 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 learners | 2004-11-08 |
87 |
|
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 |
88 |
|
Carter, John B. | An O(1) time complexity software barrier | As 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 barrier | 2004 |
89 |
|
Henderson, Thomas C. | An O(n) time discrete relaxation architecture for real-time processing of the consistent labeling problem | Discrete 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 techniques | 1986 |
90 |
|
Gu, Jun | An 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; DRA | 1988 |
91 |
|
Riloff, Ellen M. | Analyses for elucidating current question answering technology | In this paper, we take a detailed look at the performance of components of an idealized question answering system on two diff erent tasks: the TREC Question Answering task and a set of reading comprehension exams. We carry out three types of analysis: inherent properties of the data, feature analys... | TREC Question Answering task | 2001-12 |
92 |
|
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 |
93 |
|
Sobh, Tarek M. | Analysis of tolerance for manufacturing geometric objects from sense data | In this work we address the problem of manufacturing machine parts from sense data. Constructing geometric models for the objects from sense data is the intermediate step in a reverse engineering manufacturing system. Sensors are usually inaccurate, providing uncertain sense information. We constr... | Manufacture | 1993 |
94 |
|
Henderson, Thomas C. | Analysis of topographic maps for recreational purposes using decision trees | In this paper we describe a method for predicting the subjective quality of a new mountain bike route for a particular subject based on routes previously ridden and ranked by the subject. GPS tracks of the previously ridden routes are over laid on rasterized topographic maps and topographic features... | | 2013-01-01 |
95 |
|
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 |
96 |
|
Yang, Yue; Gopalakrishnan, Ganesh; Lindstrom, Gary E.; Slind, Konrad Lee | Analyzing the Intel Itanium memory ordering rules using logic programming and SAT | We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constraints on execution traces, in an axiomatic style. A direct translation of the semantics to a constraint logic program... | Intel Itanium memory; Ordering rules; Sared memory; Consistency models | 2003 |
97 |
|
Bargteil, Adam Wade | Animation of deformable bodies with quadratic bézier finite elements | In this article, we investigate the use of quadratic finite elements for graphical animation of deformable bodies.We consider both integrating quadratic elements with conventional linear elements to achieve a computationally efficient adaptive-degree simulation framework as well as wholly quadratic ... | | 2014-01-01 |
98 |
|
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 |
99 |
|
Henderson, Thomas C. | Apparent symmetries in range data | A procedure for extracting symmetrical features from the output of a range scanner is described which is insensitive to sensor noise and robust with respect to object surface complexity. The acquisition of symmetry descriptors for rigid bodies from a range image was in this case motivated by the ne... | Symmetry descriptors; Range data; Range scanner; Dextrous manipulation systems | 1987 |
100 |
|
Pulsipher, Dennis Carl | Application of adaptive noise cancellation to noise reduction in audio signals | The LMS adaptive noise cancellation algorithm has been applied to the removal of high-level white noise from audio signals. Simulations and actual acoustically recorded signals have been processed successfully, with excellent agreement between the results obtained from simulations and the results ob... | Noise cancellation; Noise reduction; White noise; LMS algorithm | 1979 |