Technical reports, manuscripts and photographs document the early history of the University of Utah Computer Science Department.
TO
Filters: Collection: "ir_computersa"
| Title | Description | Subject | Date | ||
|---|---|---|---|---|---|
| 51 |
 |
Geometric Hashing for Processing Complex Scenes | This work presents a new technique for handling many object interaction schemes developed using a graph theoretic approach. The interaction can be optical, as in ray tracing, or geometric, as in many body collision. Other problems solved by ray tracing, such as mass and volume calculation and viewin... | geometric hashing; object interaction; graph theory; ray tracing; many body collision | 1985 |
| 52 |
 |
First-Order Unification in Equational Theories and its Application to Logic Programming | This thesis studies first-order unification in equational theories, called E-unification, paying particular attention to complete unification algorithms for classes of equational theories. It also investigates how results and notions of E-unification can be applied to logic programming systems that ... | first-order unification; equational theory; logic programming; e-unification; semantic unification; dec-20; prolog | 1985 |
| 53 |
 |
On Representation and Discretization of Finite Element Analyses | The use of B-spline geometric representation and subdivision mechanism is explored for use in finite element analysis. On the representation issue, an attribute modelling technique is introduced to model the problem specification and the result interpretation. This modelling technique relies on the ... | finite element; b-spline; geometric representation; subdivision mechanism; planar domain; shell domain; solid domain | 1985 |
| 54 |
 |
Static inference in applicative languages | Static inference involves the compile-time analysis of programs, either with a view to optimizing program execution or ensuring that errors do not arise during program execution (e.g., type checking). We present a general framework for static inference of first-order applicative programs as well as ... | programming languages; computer science; static inference; applicative languages | 1985-03 |
| 55 |
 |
Implementation of SCMAID: A Microprogrammer's Assistant for Concurrent Soft Controlled Microarchitectures | The SCMaid has been implemented in a portable dialect of LISP called PSL which is a product of the Symbolic Computation Group at the University of Utah. Since PSL has been implemented on a wide variety of machines from microprocessors to the Cray-1, SCMaid can be run on a large number of systems. Th... | symbolic computation group; scmaid; psl; lisp | 1985-04 |
| 56 |
 |
KIT : an experimental solid modelling system | The purpose of this research is to develop an experimental environment for solid modelling which can provide a wide range of graphics primitives and operations toward making the modelling process more flexible The system can handle different types of representations and combine them with an extended... | computer graphics; KIT; solid modelling system | 1985-06 |
| 57 |
 |
Load balancing and fault tolerance in applicative systems | Applicative systems are promising candidates to achieve high performance computing through aggregation of processors. This dissertation studies two important issues in building scalable applicative systems: load balancing problem and fault tolerance.; A dynamic load balancing scheme is proposed for ... | computer architecture; load balancing; fault tolerance; computer science; applicative systems | 1985-08 |
| 58 |
 |
Optimization as Transformations: A Compiler Paradigm | This thesis describes the high-level transformation phase of a prototype PSL compiler. EPIC The transformations are separated into two classes: machine dependent code generation, and machine independent code optimization. The code generation phase transforms an intermediate representation of a progr... | PSL compiler; EPIC; machine dependent code generator ; machine independent code optimization | 1985-08 |
| 59 |
 |
Analysis of Functional Programs using Attribute Grammars | An attribute grammar combines the standard context-free grammar that defines the syntax of a programming language with attributes that define semantic aspects of the language. This information makes attribute grammars very useful for performing the semantic analysis of programs. Functional programmi... | programming languages, functional programs; attributed grammar | 1985-08 |
| 60 |
 |
Discrete B-Splines as an Approach to Computer Aided Geometric Design | Investigations have been made of many interesting problems deriving from the applications of discrete splines to the problems of computer aided geometric design. New theory and algorithms have been developed and support mechanisms based on the Oslo algorithm have been incorporated in order to help u... | 1985-09 | |
| 61 |
 |
Models for Stochastic Texture Generation | This work explores current models of textures for image synthesis and analysis, with an emphasis on generation of stochastic textures. Digital signal processing techniques are applied to create a general and robust model for the generation of stochastic textures. Martingale sequences are analyzed, a... | computer graphics; models of texture; image synthesis; image analysis; stochastic textures | 1985-12 |
| 62 |
 |
The Efficient Modeling of Processor Behavior and Performance | Simulation models of digital computers span a broad range of capabilities. At one end are drastically simplified models that are very efficient. At the other end are executable register transfer models with a typical simulation overhead of two or three orders of magnitude. The Simon Simulation and D... | computer simulation; microprocessors; direct execution simulation; computer performance models | 1985-12 |
| 63 |
 |
Approximating data with parametric B-splines for computer aided design | This thesis addresses some of the difficulties that can be encountered when approximation is used as a design tool. In many cases, it is most intuitive for a designer to specify points on or near a desired contour, and approximate them with a curve. Merely computing some approximation to a set of da... | computer graphics; computer-aided design; approximation theory; B-splines | 1985-12 |
| 64 |
 |
Modelling complex objects with generalized sweeps | Recently, constructive solid geometry (CSG) techniques have been generalized to include set operations on certain sculptured surface solid models. This advancement has reemphasized the need for modelling techniques that create vasod objects. The definition of a valid object is somewhat cumbersome in... | computer-aided design; computer graphics | 1985-12 |
| 65 |
 |
INSTED : an integrated structured tiling editor for very large scale integrated circuit design | This thesis presents the implementation details of an experimental, hierarchical, object-oriented, and user-friendly software system, developed to provide a portal to the use of a versatile integrated circuit design methodology, and a foundation for future design tools to build upon. Showcasing seve... | computer interfaces; integrated circuits; large scale integration; INSTED | 1986-06 |
| 66 |
 |
Resource allocation in an experimental LISP compiler | This thesis describes the design and implementation of a register allocation system for EPIC, an experimental LISP compiler. EPIC follows the Portable Standard LISP (PSL) philosophy of retargetability and parameter-passing through registers. Like many register allocators, this system accepts linear ... | compiling (electronic computers); LISP; EPIC; Experimental LISP compiler | 1986-08 |
| 67 |
 |
Automated Routing Tools for the PPL Design Methodology | A router, suitable to the needs of the PPL design methodology currently available at the Universsity of Uath, is described. The goal is to give the designer automatic routing capabilities, taking care of the often time consuming and messy aspect of point to point connection by hand, as is currently ... | PPL design methodology; automated routing tools; computers; computer programming; automatic routing capabilities; Magic [14]; PPL router; PPL design environment | 1986-08 |
| 68 |
 |
Synthesis, Verification and Optimization of Systolic Arrays | Systolic arrays are a class of parallel architectures consisting of regular interconnections of a very large number of simple processors, each one operating on a small part of the problem. They are typically designed to be used as back-end. special-purpose devices for computation-intensive processin... | computer architecture; systolic array; VLSI | 1986-12 |
| 69 |
 |
From Algebraic Specifications to Correct VLSI Systems | This dissertation presents a hardware design methodology in which hardware systems can be modeled as abstract data types and semi-automatically synthesized into VLSI circuits. The behavior of a module is specified at both the abstract and the realization levels, in a purely functional language, "Str... | VLSI circuits; computers | 1986-12 |
| 70 |
 |
Sisyphus, an environment for simulation | Sisyphus is an environment for the simulation of integrated circuits (ICs). It supports hierarchical simulation from the functional block level down to circuit analysis. Sisyphus develops a new hierarchical wire model (based on that of Sable) which facilitates the accurate simulation of incomplete d... | sisyphus; computer program language; computer programming; ICs | 1986-12 |
| 71 |
 |
Surface perturbations for texture mapping | This thesis present a new method of texture mapping which can be used in conjunction with the above techniques to improve textured images. The proposed method uses surface perturbations for texture mapping. Surface perturbations enhance traditional texture mapping techniques by allowing the texture ... | surface perturbations; texture mapping; computers | 1987-03 |
| 72 |
 |
Efficient evaluation of normal order through strictness information | Normal order functional languages (NOFLs) offer conceptual simplicity, expressive power and attractiveness for parallel execution. In NOFLs expressions are represented in a graphical form and transformed to the final answer using graph transformation rules. Until the G-machine project in Sweden, imp... | NOFL; strictness analysis; computers | 1987-03 |
| 73 |
 |
2D knowledge based vision system | A knowledge based approach to computer vision provides the needed flexibility for performing recognition and inspection of objects in a complex environment. A system is described which uses knowledge about the environment, sensors, and performance requirements to construct a functional configuration... | computers; visual system; 2-Dimensional; 2-D | 1987-07 |
| 74 |
 |
The design and implementation of an OR-parallel logic programming system | The research focus in OR-parallel logic programming is shifting rapidly from theoretical considerations and simulation on uniprocessors to implementation on true multiprocessors. This dissertation describes the design and implementation of such a system or OR-parallel Horn clause logic programs on t... | OR-parallel; computers | 1987-08 |
| 75 |
 |
Constraint kernels: constraints and dependencies in a geometric modeling system | This thesis describes the use of algebraic constraints and functional dependencies in the context of a geometric modeling system. | geometric modeling system; functional dependencies; algebraic constraints; computers | 1987-08 |