Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 4351 - 4380 of 4396

Full-Text Articles in Computer Engineering

Advanced Communications Systems, Jonathan S. Turner Aug 1987

Advanced Communications Systems, Jonathan S. Turner

All Computer Science and Engineering Research

The Advanced Communication Systems Project is concerned with new communication technologies that can support a wide range of different communication applications in the context of large public networks. Communications networks in common use today have been tailored to specific applications and while they perform their assigned functions well, they are difficult to adapt to new uses. There currently are no general purpose networks, rather there are telephone networks, low-speed data networks and cable television networks. As new communications applications proliferate, it becomes clear that in the long term, a more flexible communications infrastructure will be needed. The Integrated Services Digital ...


Prodb: An Experimental Generalized Database System User's Manual, Guillermo R. Simari Jun 1987

Prodb: An Experimental Generalized Database System User's Manual, Guillermo R. Simari

All Computer Science and Engineering Research

The following notes document in a succinct manner the use of the system PRODB. The system is still evolving and several new features are in the process of being added. PRODB is a prototype system that is being used as an exploration vehicle of the possible extensions to the relational model through logic programming. The system consists of a relational database system having a relational algebra type language as a query language. It is written in Prolog and it extends the capabilities of Prolog predicates with the relational algebra operators for handling the database structure. The database system currently provides ...


Belief Maintenance Systems: Initial Prototype Specification, Roseanne M. Fulcomer, William E. Ball, John P. Tadlock Jan 1987

Belief Maintenance Systems: Initial Prototype Specification, Roseanne M. Fulcomer, William E. Ball, John P. Tadlock

All Computer Science and Engineering Research

A fundamental need in future information systems is an effective method of accurately representing and monitoring dynamic, real-world situations inside a computer. Information is represented using an Extended Open World Assumption (EOWA), in which the data are explicitly true or false. Reasoning within the EOWA is done through the use of a dynamic dependency net which only represents those beliefs and justifications that are both currently valid and in current use. In this paper, we present definitions and uses of the EOWA and dynamic dependency net in our current research of developing a database with which we can use deductive ...


Impact Of Automation On Process Control Decision-Making, Steven M. Miller, Susan R. Bereiter Jan 1987

Impact Of Automation On Process Control Decision-Making, Steven M. Miller, Susan R. Bereiter

Research Collection School Of Information Systems

This paper investigates changes in the process control of a vehicle assembly plant which had been modernized from a principally manual procedure to one that uses programmable automation extensively. Process control is defined as the information flow and decision-making required to perform basic process operations. We investigate the effects of implementing a computer-integrated production system on the amount and types of process control decision-making and on the distribution of process control decision-making between humans and machines. After automation, the emphasis on decisions regarding product quality specifications increased and the emphasis on decisions related to flexibility in handling a variety of ...


Method And Apparatus For Division Pct:Ep0075745, Robert Iannucci, James Kleinsteiber Dec 1986

Method And Apparatus For Division Pct:Ep0075745, Robert Iannucci, James Kleinsteiber

Robert A Iannucci

No abstract provided.


High Performance Memory System Utilizing Pipelining Techniques Us:4685088, Robert Iannucci Dec 1986

High Performance Memory System Utilizing Pipelining Techniques Us:4685088, Robert Iannucci

Robert A Iannucci

No abstract provided.


Modeling And Animating Human Figures In A Cad Environment, Norman I. Badler Dec 1986

Modeling And Animating Human Figures In A Cad Environment, Norman I. Badler

Technical Reports (CIS)

With the widespread acceptance of three-dimensional modeling techniques, high-speed hardware, and relatively low-cost computation, modeling and animating one or more human figures for the purposes of design assessment, human factors, task simulation, and human movement understanding has become feasible outside the animation production house environment. This tutorial will address the state-of-the-art in human figure geometric modeling, figure positioning, figure animation, and task simulation.


A Unified Approach To Mixed-Mode Simulation, Roger D. Chamberlain, Mark A. Franklin Nov 1986

A Unified Approach To Mixed-Mode Simulation, Roger D. Chamberlain, Mark A. Franklin

All Computer Science and Engineering Research

This paper presents a unified approach to mixed-mode simulation. It investigates the algorithms for both logic and circuit simulation, considering their similarities and differences, and a general framework is presented for integrating the two algorithms in uniform manner. The time advance mechanisms and component functional evaluations of the algorithms are show to be similar in nature, and mechanisms for the translation of information represented uniquely in the two algorithms are given. The resulting integrated algorithms is capable of performing mixed-mode simulation, where a circuit is partitioned into discrete and continuous regions, and each region is simulated at the appropriate level ...


A Compiler For A Two-Dimensional Programming Language, Julie Wing Kam Choi Jul 1986

A Compiler For A Two-Dimensional Programming Language, Julie Wing Kam Choi

All Computer Science and Engineering Research

A visual programming language is presented. This language uses interactive graphics to convey notion such as subroutine, recursion, block structure, parallel and serial processing to school children. Currently the system is interpreter based. To overcome the inefficiency of the interpreter based system, a compiler is implemented for this language. This report gives an overview of the compiler and the details about the parser, semantic analyzer and the code generator. Finally, a performance comparison between the interpreter based system and the compiler based system is given.


Progressive Coding And Transmission Of Digital Diagnostic Pictures, Sharaf E. Elnahas, Kou-Hu Tsou, Jerome R. Cox, Rexford L. Hill, R. Gilbert Jost Jun 1986

Progressive Coding And Transmission Of Digital Diagnostic Pictures, Sharaf E. Elnahas, Kou-Hu Tsou, Jerome R. Cox, Rexford L. Hill, R. Gilbert Jost

All Computer Science and Engineering Research

In radiology, as a result if the increased utilization of digital imaging modalities, such as computed tomography (CT) and magnetic resonance imaging (MRI), over a third of the images produced in a typical radiology department are currently in digital form, and this percentage is steadily increasing, Image compression provides a means for the economical storage and efficient transmission of these diagnostic pictures. The level of coding distortion than can be accepted for clinical diagnosis purposes is not yet well-defined. In this paper we introduce some constraints on the design of existing transform codes in order to achieve progressive image transmission ...


Show And Tell User's Manual, Peter Mclain, Takayuki Dan Kimura Mar 1986

Show And Tell User's Manual, Peter Mclain, Takayuki Dan Kimura

All Computer Science and Engineering Research

The purpose of this report is to introduce essential features of the Show and Tell Language system to those computer users who are already familiar with some high-level programming language such as FORTRAN, BASIC or PASCAL. This manual is not intended for school children. Some familiarity with the Macintosh user interface and the MacPaint application program is assumed. It is also assumed that the Show and Tell application program disk and the Sample program are available to the reader. The basic programming concepts in Show and Tell are introduced in Chapter Three. The reader may find it easer to start ...


A Systolic Parsing Algorithm For A Visual Programming Language, Adam W. Bojanczyk, Takayuki Dan Kimura Mar 1986

A Systolic Parsing Algorithm For A Visual Programming Language, Adam W. Bojanczyk, Takayuki Dan Kimura

All Computer Science and Engineering Research

In this paper we consider a problem of parsing a two-dimensional visual programming language Show and Tell on a two-dimensional array of processors. A program in Show and Tell is a bit-mapped, two-dimensional pattern satisfying a certain set of grammatical rules. The pattern consists of partially ordered set of rectilinear boxes and arrows distributed over the space of nxn pixel area. The corresponding directed graph, the box graph, where boxes are nodes and arrows are directed edges, may not have a cycle in a Show and Tell program. The cycle detection is the most computationally intensive stage of the parsing ...


An Exact Analysis For Efficient Computation Of Random-Pattern Testability In Combinational Circuits, Sharad C. Seth, Bhargab B. Bhattacharya, Vishwani Agrawal Jan 1986

An Exact Analysis For Efficient Computation Of Random-Pattern Testability In Combinational Circuits, Sharad C. Seth, Bhargab B. Bhattacharya, Vishwani Agrawal

CSE Conference and Workshop Papers

Experimental evidence shows that low testability in a typical circuit is much more likely due to poor observability than poor controllability. Thus, from theoretical and practical standpoints, it is important to develop an accurate model for observability computation. One such model, in terms of supergates, is proposed in the first part of this paper thus complimenting our earlier work. It is now possible to obtain exact random-pattern testability for each line in a circuit.

The second part of the paper analyzes the supegate structure of a circuit from a graph theoretic viewpoint. Finding a supergate is related to determining the ...


Lsim User Manual, Roger D. Chamberlain Jan 1986

Lsim User Manual, Roger D. Chamberlain

All Computer Science and Engineering Research

Lsim is a gate/switch level digital logic similar. It enables users to model digital circuits both at the gate and switch level and incorporates features that support investigation of the simulation task itself. This user's manual describes the procedures used to specify a circuit to lsim and control the simulation of the circuit (i.e., specifying inputs vectors, running the simulation, and monitoring output signals).


Statistics On Logic Simulation, K. F. Wong, Mark A. Franklin, Roger D. Chamberlain, B. L. Shing Nov 1985

Statistics On Logic Simulation, K. F. Wong, Mark A. Franklin, Roger D. Chamberlain, B. L. Shing

All Computer Science and Engineering Research

The high costs associated with logic simulation of large VLSI based systems have led to the need for new computer architectures tailored to the simulation task. Such architecture have the potential for significant speedups over standard software based logic simulators. Several commercial simulation engines have been produced to satisfy need in this area. To properly explore the space of alternative simulation architectures, data is required on the simulation process itself. This paper presents a framework for such data gathering activity by first examining possible sources of speedup in the logic simulation task, examining the sort of data needed in the ...


Randomized Routing On Fat-Trees, Ronald I. Greenberg Oct 1985

Randomized Routing On Fat-Trees, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

Fat-trees are a class of routing networks for hardware-efficient parallel computation. This paper presents a randomized algorithm for routing messages on a fat-tree. The quality of the algorithm is measured in terms of the load factor of a set of messages to be routed, which is a lower bound on the time required to deliver the messages. We show that if a set of messages has load factor lambda on a fat-tree with n processors, the number of delivery cycles (routing attempts) that the algorithm requires is O(lambda+lgnlglgn) with probability 1-O(1/n). The ...


The Computer Graphics Scene In The United States, Norman I. Badler, Ingrid Carlbom Sep 1985

The Computer Graphics Scene In The United States, Norman I. Badler, Ingrid Carlbom

Technical Reports (CIS)

We briefly survey the major thrusts of computer graphics activities, examining trends and topics rather than offering a comprehensive survey of all that is happening. The directions of professional activities, hardware, software, and algorithms are outlined. Within hardware we examine workstations, personal graphics systems, high performance systems, and low level VLSI chips; within software, standards and interactive system design; within algorithms, visible surface rendering and shading, three-dimensional modeling techniques, and animation.

Note: This paper was presented at Eurographics'84 in Copenhagen, Denmark.


Appendices - Parametric Keyframe Interpolation Incorporating Kinetic Adjustment And Phrasing Control, Scott N. Steketee, Norman I. Badler Jul 1985

Appendices - Parametric Keyframe Interpolation Incorporating Kinetic Adjustment And Phrasing Control, Scott N. Steketee, Norman I. Badler

Technical Reports (CIS)

These are the unpublished appendices for the paper entitled, "Parametric Keyframe Interpolation Incorporating Kinetic Adjustment and Phrasing Control."


On The Probable Performance Of Graph Coloring Algorithms, Jonathan S. Turner Jun 1985

On The Probable Performance Of Graph Coloring Algorithms, Jonathan S. Turner

All Computer Science and Engineering Research

We define a natural probability distribution over the set of k-colorable graphs on n vertices and study the probable performance of several algorithms on graphs selected from this distribution. The main results are listed below. • We describe an algorithm to determine if a given n vertex graph is k-colorable, which runs in time O(n + m log k), where m is the number of edges. We show that this algorithm can successfully identify almost all random k-colorable graphs for constant or slowly growing values of k. • We show that an algorithm proposed by Brelas, and justified on experimental grounds can ...


Guide: Graphical User Interfaced Development Environment, Tamar E. Granor, Norman I. Badler May 1985

Guide: Graphical User Interfaced Development Environment, Tamar E. Granor, Norman I. Badler

Technical Reports (CIS)

GUIDE is an interactive graphical system for designing and generating graphical user interfaces. It provides flexibility to the system designer while minimizing the amount of code which the designer must write. The GUIDE methodology includes the notions of "tool," "task," and "context." GUIDE encourages designers to tailor their systems to individual users by inclusion of "user profiles," allowing different control paths based on the user's characteristics. GUIDE also provides a method for invoking application routines with parameters. Parameters may be based on user inputs and are computed at invocation time. Help messages are created along with the objects to ...


Collecting Data About Logic Simulation, Roger D. Chamberlain, Mark A. Franklin May 1985

Collecting Data About Logic Simulation, Roger D. Chamberlain, Mark A. Franklin

All Computer Science and Engineering Research

Design of high performance hardware and software based gate-switch level logic simulators requires knowledge about the logic simulation process itself. Unfortunately, little data is publically available concerning key aspects of this process. An example of this is the lack of published empirical measurements relating to the time distribution of events generated by such simulators. This paper presents a gate-switch level logic simulator lsim which is oriented towards the collection of data about the simulation process. The basic components of lsim are reviewed, and its relevant data gathering facilities are discussed. An example is presented which illustrates the use of lsim ...


Tempus: A System For The Design And Simulation Of Human Figures In A Task-Oriented Environment, Norman I. Badler, Jonathan Korein, James U. Korein, Gerald M. Radack, Lynne Shapiro Brotman Jan 1985

Tempus: A System For The Design And Simulation Of Human Figures In A Task-Oriented Environment, Norman I. Badler, Jonathan Korein, James U. Korein, Gerald M. Radack, Lynne Shapiro Brotman

Technical Reports (CIS)

A system called TEMPUS is outlined which is being developed to simulate graphically the task-oriented activities of several human agents in a three-dimensional environment. TEMPUS is a task simulation facility for the evaluation of complex workstations vis-a-vis the normal and emergency procedures they are intended to support and the types and number of individuals who must carry them out. TEMPUS allows a user to interactively:

  • Create on or more human figures which are correctly scaled according to a specific population, or which meet certain size constraints.
  • View the human figure in any of several graphical modes: stick figure, line or ...


Local Matching Of Surfaces Using Critical Points, Gerald Radack, Norman I. Badler May 1984

Local Matching Of Surfaces Using Critical Points, Gerald Radack, Norman I. Badler

Technical Reports (CIS)

The local matching problem on surfaces is: Given a pair of oriented surfaces in 3-space, find subsurfaces that are identical or complementary in shape. A heuristic method is presented for local matching that is intended for use on complex curved surfaces (rather than such surfaces as as cubes and cylinders).

The method proceeds as follows: (1) Find a small set of points-called "critical points" -on the two surfaces with the property that if p is a critical point and p matches q, then q is also a critical point. The critical points are taken to be local extrema of either ...


Generating Shadows With An Umbra And Penumbra, Lynne Shapiro, Norman I. Badler Jan 1984

Generating Shadows With An Umbra And Penumbra, Lynne Shapiro, Norman I. Badler

Technical Reports (CIS)

An algorithm for generating shadows with an umbra and penumbra due to distributed light sources is presented. The method used is based on the inclusion of the shadow volumes in the object data processed by a depth-buffer visible surface computation. The standard depth-buffer data structure is modified to allow the handling of shadows with a depth-buffer hidden surface algorithm. The algorithm involves breaking the light source up into a set of point sources and superimposing the shadows generated by each point source to obtain the final shadow.


The Computer Graphics Scene In The United States, Norman I. Badler, Ingrid Carlbom Jan 1984

The Computer Graphics Scene In The United States, Norman I. Badler, Ingrid Carlbom

Technical Reports (CIS)

We briefly survey the major thrusts of computer graphics activities, examining trends and topics rather than offering a comprehensive survey of all that is happening. The directions of professional activities, hardware, software, and algorithms are outlined. Within hardware we examine workstations, personal graphics systems, high performance systems, and low level VLSI chips; within software, standards and interactive system design; within algorithms, visible surface rendering and shading, three-dimensional modeling techniques, and animation.


Method And Apparatus For Division Employing Associative Memory Us:4466077, Robert Iannucci, James Kleinsteiber Dec 1983

Method And Apparatus For Division Employing Associative Memory Us:4466077, Robert Iannucci, James Kleinsteiber

Robert A Iannucci

No abstract provided.


Ads Formal Semantics, Takayuki Kimura Dec 1983

Ads Formal Semantics, Takayuki Kimura

All Computer Science and Engineering Research

Abstract Database System (ADS) is a data model developed for an enduring medical information system where frequent changes in the conceptual schema are anticipated and multi-level abstraction is required. The mechanism of abstraction in ADS is based on the abstraction operator of the lamba calculus. The formal semantics of a subset of the ADS model is presented using the denotational specification method.


Robotic Realities: Near Term Prospects And Problems, Robert U. Ayres, Steven M. Miller Nov 1983

Robotic Realities: Near Term Prospects And Problems, Robert U. Ayres, Steven M. Miller

Research Collection School Of Information Systems

Industrial robots are automation, but with a difference. Other machine tools are extensions of human capabilities, while robots are seen mainly as substitutes for human workers. Robots will find most of their industrial applications during the next decade or two in the metal-working sectors, where they will begin to displace semiskilled machine operatives in medium to large batch production operations. They cannot substitute for skilled machinists or other workers doing nonroutine jobs, or specialized, dedicated hard automation used in mass production. The current generation of robots, lacking sensory data processing and interpretation capabilities, can potentially replace up to 1.3 ...


Outline Of A Calculus Of Type Subsumption, Hassan Aït-Kaci Aug 1983

Outline Of A Calculus Of Type Subsumption, Hassan Aït-Kaci

Technical Reports (CIS)

This paper is a brief analysis of the notion of syntactic representation of types followed by a proposal of a formal calculus of type subsumption. The idea which is developed centers on the concept of indexed term, an extension of the definition of algebraic terms relaxing the fixed arity and fixed indexing constraints, and which allows term symbols to have some pre-order structure. It is shown that the structure on the set of symbols can be "homomorphically" extended to indexed terms to what is defined to be a subsumption ordering. Furthermore, when symbols have a lattice structure, this structure extends ...


Tempus: A System For The Design And Simulation Of Human Figures In A Task-Oriented Environment, Norman I. Badler, Jonathan Korein, James U. Korein, Gerald M. Radack, Lynne Shapiro, Carolyn Brown Jan 1983

Tempus: A System For The Design And Simulation Of Human Figures In A Task-Oriented Environment, Norman I. Badler, Jonathan Korein, James U. Korein, Gerald M. Radack, Lynne Shapiro, Carolyn Brown

Technical Reports (CIS)

A system called TEMPUS is outlined which is being developed to simulate graphically the task-oriented activities of several human agents in a three-dimensional environment. TEMPUS is a task simulation facility for the evaluation of complex workstations vis-a-vis the normal and emergency procedures they are intended to support and the types and number of individuals who must carry them out. TEMPUS allows a user to interactively:

* Create one or more human figures which are correctly scaled according to a specific population, or which meet certain size constraints.

* View the human figure in any of several graphical modes: stick figure, line or ...