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

Engineering Commons

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

Computer Sciences

PDF

Series

Institution
Keyword
Publication Year
Publication

Articles 4771 - 4800 of 4806

Full-Text Articles in Engineering

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 Computing and 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 …


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 …


Lexical Analysis Using Table Look-Up, Brian Keith Smith, Dominic Soda, George Winston Zobrist Feb 1986

Lexical Analysis Using Table Look-Up, Brian Keith Smith, Dominic Soda, George Winston Zobrist

Engineering Management and Systems Engineering Faculty Research & Creative Works

No abstract provided.


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 …


Finding Largest Empty Circles With Location Constraints, L Paul Chew, Robert L. Scot Drysdale Jan 1986

Finding Largest Empty Circles With Location Constraints, L Paul Chew, Robert L. Scot Drysdale

Computer Science Technical Reports

Let S be a set of n points in the plane and let CH(S) represent the convex hull of S. The Largest Empty Circle (LEC) problem is the problem of finding the largest circle centered with CH(S) such that no point of S lies within the circle. Shamos and Hoey (SH75) outlined an algorithm for solving this problem in time O(n log n) by first computing the Voronoi diagram, V(S), in time O(n log n), then using V(S) and CH(S) to compute the largest empty circle in time O(n). In a recent paper [Tou83], Toussaint pointed out some problems with …


The Pairwise Intersection Problem For Monotone Polygons, David B. Levine Jan 1986

The Pairwise Intersection Problem For Monotone Polygons, David B. Levine

Computer Science Technical Reports

Geometric intersection problems arise in a number of areas of computer science including graphics and VLSI design rule checking. Previous work has concentrated on solving the pairwise intersection problem for line segments and iso-oriented rectangles. This thesis extends that work by presenting efficient algorithms to solve the pairwise intersection problem for monotone polygons. For general segments, the problem has been solved in O(N+I)*logN) time using a sweeping line technique, where N is the number of segments and I is the number of intersections reported. We combine this technique with approaches taken to solve the iso-oriented rectangle problem to yield an …


Producing Software Using Tools In A Workstation Environment, Mark Sherman, Robert L. Scot Drysdale Jan 1986

Producing Software Using Tools In A Workstation Environment, Mark Sherman, Robert L. Scot Drysdale

Computer Science Technical Reports

We discuss how we taught students to build and use translation, interpretive, editing and monitoring tools in an undergraduate software engineering course. Students used the tools on low-cost workstations (Macintoshes) to build large, group projects. The students' projects used all available features of workstation environments, including graphics, windows, fonts, mice, networks, and sound generators. We found that 1) the use of tools increased student productivity, 2) a shift in a data structure and algorithm topics is needed to cover material relevant for workstation environments, 3) new topics in system design are required for a workstation environment, 4) traditional material can …


An Algorithm For Resource Allocation Requiring Low Overhead Communication, Ann Marks Jan 1986

An Algorithm For Resource Allocation Requiring Low Overhead Communication, Ann Marks

Computer Science Technical Reports

A heuristic algorithm for allocating resource units to sites in a distributed system is presented. Starting with a given allocation of sites, the algorithm performs a series of optimizations involving pairs of sites in an attempt to improve the worst pair-wise imbalance present in the system; termination occurs when no further improvement is possible. After outlining the general form of the algorithm, which effectively defines an entire family of algorithms, we present theoretical results that speak to the performance of the algorithm as measured in the number of optimizations that can be done, the amount of control communication required and …


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 …


Retrospective Data Filter, Richard J. Prengaman, Robert E. Thurber, Joe Phipps, Ronald I. Greenberg, Wai L. Hom, James F. Jaworski, Guy W. Riffle Oct 1985

Retrospective Data Filter, Richard J. Prengaman, Robert E. Thurber, Joe Phipps, Ronald I. Greenberg, Wai L. Hom, James F. Jaworski, Guy W. Riffle

Computer Science: Faculty Publications and Other Works

In a target detection communication system, apparatus and method for determining the presence of probable targets based on contacts (which can indicate the presence of a target, noise, chatter, or objects not of interest) detected within a predefined position sector or sectors over a specified number of scans. The position of each detected contact, as a contact of interest, is compared with the positions of contacts detected at previous times or scans. Velocity profiles indicate which previous contacts support the likelihood that the contact of interest represents a target having a velocity within a defined band. The likelihood, which can …


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/ …


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 …


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 …


Impacts Of Robotics And Flexible Manufacturing Technologies On Manufacturing Costs And Employment, Steven M. Miller Jan 1985

Impacts Of Robotics And Flexible Manufacturing Technologies On Manufacturing Costs And Employment, Steven M. Miller

Research Collection School Of Computing and Information Systems

The issues analyzed in this paper are the extent to which unit costs and production labor requirements might be reduced in manufacturing industries if there is more widespread use of industrial robots and flexible systems. The analysis is reported in detail in Miller (1983). These issues are analyzed from two different perspectives. The technological focus of the first perspective is narrowly confined to the use of robotic manipulators. It is assumed that robotic manipulators will be “retrofitted” into existing production facilities without making major changes in the organization of production within the factory, other than modifying individual work stations so …


An Image Processing Software Package For The Laser Scanning Phase Modulation Microscope, William J. Murray Jun 1984

An Image Processing Software Package For The Laser Scanning Phase Modulation Microscope, William J. Murray

Computer Science Technical Reports

This thesis documents the most recent effort to develop a user-friendly image processing software package for the Laser Scanning Phase Modulation Microscope (LSPMM). The LSPMM is composed of three integrated subsystems, the Laser Scanning (LS) system, the Phase Modulation (PM) system, and Digital Image Acquisition (DIA) system. Under the control of the image processing software, the DIA system can receive and store the digital image data, display the image on a monochrome monitor, and process the image to provide the microscopist with quantitative information regarding the image. The implementation of this image processing software package required the specification of a …


View-3 And Ada: Tools For Building Systems With Many Tasks, Ann Kratzer, Mark Sherman Mar 1984

View-3 And Ada: Tools For Building Systems With Many Tasks, Ann Kratzer, Mark Sherman

Dartmouth Scholarship

This paper discusses some useful features for tools that are intended to be used for developing systems with multiple tasks. We include a description of one tool that has been built, View-3. We also describe some problems that might be encountered when trying to fit this kind of tool into an APSE system.


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 Computing and 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 million …


Some Design Considerations For Picture Archiving And Communication Systems, J. R. Cox, G. J. Blaine, R. L. Hill, R. G. Jost, C. D. Shum Jan 1983

Some Design Considerations For Picture Archiving And Communication Systems, J. R. Cox, G. J. Blaine, R. L. Hill, R. G. Jost, C. D. Shum

All Computer Science and Engineering Research

Design considerations for picture archiving and communication systems are reviewed with special emphasis on those issues that differ from conventional network architectures. Design equations for three layers of a picture network are developed and discussed in the context of preliminary estimates of the flow of digital images between a multiplicity of picture sources, picture archives and picture viewing stations. Discussions of differences from conventional networks focuses on the local nature of the net, the availability of a wide-band transmission media with low error rates, the relative costliness of network equipment capable of taking advantage of the wide-band transmission media and …


Simulation Of Burley Tobacco Harvesting-Housing Systems, Ronald L. Bingner, Larry G. Wells, Thomas C. Bridges, George A. Duncan Jan 1982

Simulation Of Burley Tobacco Harvesting-Housing Systems, Ronald L. Bingner, Larry G. Wells, Thomas C. Bridges, George A. Duncan

Biosystems and Agricultural Engineering Faculty Publications

A computer model has been developed using systems analysis techniques to simulate the labor and equipment aspects of harvesting burley tobacco. By varying the parameters of the model the user can determine a harvesting and housing strategy based on labor and equipment availability.


Octal-Tree Spatial Sorting And Its Applications, Jeffrey L. Posdamer Jan 1982

Octal-Tree Spatial Sorting And Its Applications, Jeffrey L. Posdamer

All Computer Science and Engineering Research

An octal tree subdivision recursively divides a bounded three-dimensional volume into octanta about an internal division point. This scheme has been used to represent cellular or enumerated voxel models of solid objects. Given one or more sets of points sampled from the surface of a solid, an octal tree may be generated in which each leaf node contains m or less points. By specifying the tree traversal rule, the points are accessed in a sorted order. By defining m=3, a divide-and-conquer surface triangulation algorithm may be developed which does not require special sampling conditions (such as co-planarity) on subsets of …


Robotics And The Conservation Of Human Resources, Robert U. Ayres, Steven M. Miller Jan 1982

Robotics And The Conservation Of Human Resources, Robert U. Ayres, Steven M. Miller

Research Collection School Of Computing and Information Systems

Due to rapid expansion in the field of robotics, policy issues have arisen in regard to developing human skills to deal with the new technology and to deal with the obsolescent human skills which are the inevitable result of this growth pattern. Industrialists, educators, union leaders, and government officials must work cooperatively to insure that the coming changes are made with minimum disruption. Improved training methods and courses have to be developed for the skills needed to control, manage and supervise the new machines. Some of the ways in which this can be accomplished are through offering financial incentives for …


A Simulation Model For Assessing Alternate Strategies For Beef Production With Land, Energy And Economic Constraints, Otto J. Loewer, E. M. Smith, G. Benock, Thomas C. Bridges, Larry G. Wells, Nelson Gay, S. Burgess, L. Springate, David L. Debertin Jan 1981

A Simulation Model For Assessing Alternate Strategies For Beef Production With Land, Energy And Economic Constraints, Otto J. Loewer, E. M. Smith, G. Benock, Thomas C. Bridges, Larry G. Wells, Nelson Gay, S. Burgess, L. Springate, David L. Debertin

Biosystems and Agricultural Engineering Faculty Publications

A computer model has been developed to analyze alternate management strategies and energy and economic constraints. Daily production of beef animals and growing crops is simulated in response to prevailing conditions and system interactions using the GASP IV simulation language. Complete inventories of plant dry matter, animal status, production resources and economic net worth are maintained over the simulation period.


An Abstract Model Of Unstratified Database System, Takayuki D. Kimura, Jerome R. Cox Jr., Will D. Gillett Nov 1980

An Abstract Model Of Unstratified Database System, Takayuki D. Kimura, Jerome R. Cox Jr., Will D. Gillett

All Computer Science and Engineering Research

A semantic data model is introduced with the following capabilities: (1) Abstraction mechanisms for aggregation, generalization and classification, (2) Unstratified control of the database content, (3) Refined control of intentional and extensional information, and (4) Extensive semantic consistency checking. The basic features of the model are illustrated through a scenario of interactions between the user and the database system (using the proposed model) for constructing a simple database on technical publications.


Design Studies Suggested By An Abstract Model For Medical Information System, Jerome R. Cox Jr., Takayuki D. Kimura, P. Moore, Will D. Gillett, Mishell J. Stucki Sep 1980

Design Studies Suggested By An Abstract Model For Medical Information System, Jerome R. Cox Jr., Takayuki D. Kimura, P. Moore, Will D. Gillett, Mishell J. Stucki

All Computer Science and Engineering Research

We have developed a formal model of a database system that is unusual in that it has the ability to represent information about its own structure and to insure semantic consistency. The model distinguishes general laws from instances of events and objects, but many of its mechanisms serve both categories of information. The model form a substrate upon which an information structure appropriate to neonatology is being developed. Some example queries are shown and a design study for an associative memory suggested by the model is described briefly.