101 - 125 of 937
Number of results to display per page
101 Semiannual technical report transformation of ADA programs into silicon (1 Sept. 1981- 28 Feb. 1982)This report summarizes the first six months work of the research project, "Transformation of Ada Programs into Silicon." Our project has five main objectives: 1. Develop and document elements of a transformation methodology for converting Ada programs, or program constructs, into VLSI systems which ...ADA programs; VLSI1982
102 Transformation of ADA programs into silicon (82 Mar. 1 - 82 Oct. 31)This report outlines the beginning steps taken in an integrated research effort toward the development of a methodology, and supporting systems, for transforming Ada programs, or program units, (directly) into corresponding VLSI systems. The time seems right to expect good results. The need is evide...Transformation; Silicon; Ada program units1982
103 The path programmable logic (PPL) user's manualThis manual describes the primitive NMOS path programmable logic cells currently in use at the University of Utah. It contains detailed descriptions, schematics and composite layout of all cells. Also included are PPL programming rules as well as layout design rules for each cell set.1982
104 TRACIS: transformations on Ada for circuit synthesis a report on the methodology for a silicon compilerThis report describes in detail, the ongoing design and implementation of a transformation system, for compiling specifications of integrated circuits into silicon. There are many levels in this process, and the area that we focus on produces target specifications of asynchronous and synchronous con...TRACIS; transformation system1983
105 Transparent interface between software and hardware versions of ADA compilation unitsThe Ada-to-Silicon project at Utah is developing a methodology (and associated software and hardware) for the high level testing of Ada compilation units that are represented as hardware components (circuitry). There are two motivations for this research.Ada-to-Silicon; ADA compilation units1983
106 A fault tolerant sensor schemeMulti-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 sensors1983
107 Pattern recognition in a multi-sensor environmentCurrent pattern recognition systems tend to operate on a single sensor, e.g., a camera. however. the need is now evident for pattern recognition systems which can operate in multi-sensor environments. For example, a robotics workstation may use range finders. cameras, tactile pads, etc. The Multi-se...Pattern recognition; Multi-sensor; Multi-sensor Kernel System; MKS1983
108 The key node method: a highly-parallel alpha-beta algorithmA 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 searching1983
109 Transformation of Ada program units into silicon (Fourth Semiannual technical report 83 Apr 1 - 83 Nov 15)This report, augmented with several appended papers and supplementary reports describes the most recent six months of work on the research project, "Transformation of Ada Programs into Silicon". This report is also the last of the series to be rendered under the current contact.Transformation; Ada program units; Silicon1983
110 Transforming an Ada program unit to silicon and verifying its behavior in an Ada environment: a first experimentMicroelectronics technology has advanced so rapidly and been so successful that we are new having to build large systems with a multitude of diverse, interacting components. Some components of these systems exhibit distinct architectures and may, in fact, be implemented following different choices o...Transformation; Ada program units; Silicon1983
111 Some experiments with the 3-D hough shape transformThe application of the Hough shape transform to the problem of the identification and localization of objects in 3-space is presented. The rotation-invariant Hough transform is defined which permits the determination of the geometric transformation from the model to the detected object. Given a samp...Hough shape transform1983
112 FUNLOG = functions + logic: a computational model integrating logic programming and functional programming (Rev. May 1983)Funlog, a computational model which attempts to integrate functional programming and logic programming is described. The model supports computations with infinite data structures without the introduction of complex control issues at the user-level. Control characteristics are improved as compared wi...FUNLOG; Functional programming; Logic programming1983
113 A category theoretic formalism for abstract interpretationWe 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 functions1984
114 Computer aided designThe report is based on the proposal submitted to the National Science Foundation in September 1981, as part of the Coordinated Experimental Computer Science Research Program. The sections covering the budget and biographical data on the senior research personnel have not been included. Also, the sec...1984
115 Shape matching of two-dimensional objectsIn this paper we present results in the areas of shape matching of nonoccluded and occluded two-dimensional objects. Shape matching is viewed as a "segment matching" problem. Unlike the previous work, the technique is based on a stochastic labeling procedure which explicitly maximizes a criterion ...Shape matching; Two-dimensional objects; Segment matching1984
116 An experimental system for computer aided geometric designThe 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 integration1984
117 Abstract interpretation and indeterminacyWe 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 operators1984
118 Simulation of CellsA self-timed cell set and library for the design of integrated circuits is presented. The cell set and library are two different cellular methods of designing integrated circuits. These have been incorporated to form a hybrid system which exploits the advantages provided by each. The cell set an...Self-timed; Cell set1984
119 MKS: a multisensor kernel systemThe multisensor kernel system (MKS) is presented as a means for multisensor integration and data acquisition. This system has been developed in the context of a robot work station equipped with various types of sensors utilizing three-dimensional laser range finder data and two-dimensional camera da...Multisensor kernel system; Spatial proximity graphs1984
120 Logical sensor systemsMulti-sensor systems require a coherent and efficient treatment of the information provided by the various sensors. We propose a framework the Logical Sensor Specification System, in which the sensors can be abstractly defined in terms of computational processes operating on the output from other se...Logical sensor systems; Multi-sensor systems; Multisensor systems; Logical Sensor Specification System1984
121 Representation and shape matching of 3-D objectsA three-dimensional scene analysis system for the shape matching of real world 3-D objects is presented. Various issues related to representation and modeling of 3-D objects are addressed. A new method for the approximation of 3-D objects by a set of planar faces is discussed. The major advantage of...3-D objects; Representation; Shape matching; Scene analysis system1984
122 Semantics of networks containing indeterminate operatorsWe discuss a denotational semantics for networks containing indeterminate operators. Our approach is based on modelling a networks by the set of all its possible behaviors. Our notion of behavior is a sequence of computational actions. The primitive computational action is an event: the appearance o...1984
123 Implementing multi-sensor systems in a functional languageWe 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 systems1984
124 Range data processing: representation of surfaces by edgesRepresentation of surfaces by edges is an important and integral part of a robust 3-D model based recognition scheme. Edges in a range image describe the intrinsic characteristics about the shape of the objects. In this paper we present three approaches for detecting edges in 3-D range data. The ap...Range data; Edges; Recognition scheme; 3-D1985
125 Arc and path consistency revisitedMackworth and Freuder have analyzed the time complexity of several constraint satisfaction algorithms [4]. We present here new algorithms for arc and path consistency and show that the arc consistency algorithm is optimal in time complexity and of the same order space complexity as the earlier algor...Arc consistency; Path consistency; Constraint satisfaction algorithms1985
101 - 125 of 937