Computer Sciences Commons^™

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

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 …

Deterministic Linear Predictors For Bit Rate Improvement, Dhanvant H. Goradia

Electrical & Computer Engineering Theses & Dissertations

This thesis addresses the application of deterministic linear predictor s for telemetry based systems. Deterministic linear predictors are considered as a viable alternative to block transform coding in order to achieve bit rate reduction. A method of calculating the predictor coefficients of a deterministic linear predictor is presented. The system model is developed parametrically with respect to the bandwidth, polynomial order, signal class and predictor length. Two classes of signals, deterministic and random are analyzed and bounds on the performance of the deterministic linear predictor are established. A family of six pole Butterworth filters are used as presample filters in …

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

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

Engineering Management and Systems Engineering Faculty Research & Creative Works

No abstract provided.

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 …

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 …

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 …

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 …

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

School of Computing: 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

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

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

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 …

Design Of Multivariable Feedback Control Systems Via Spectral Assignment, Mohsen Marefat

Electrical & Computer Engineering Theses & Dissertations

During the past 15 year s significant advances have been made towards developing viable synthesis- techniques for multivariable feedback control systems. The entire aggregate of this theoretical work has been reviewed and consolidated. Diverse notations have been standardized into a single system. A two-step design philosophy for spectral assignment has been developed which first meets stability and time response requirements by assigning eigenvalues and eigenvector s and then provides for attainment of secondary objectives without significant deviation from the initial assignment. Finally, a computer-aided design package has been created to streamline the process of mathematical calculation and to allow users …

High Performance Switching Circuits For Vlsi, Ali Reza Feizi

Electrical & Computer Engineering Theses & Dissertations

Interconnection topology and device performance are of major concern in the design of LSI/VLSI systems, Pass networks are very suitable in this regard because of low power consumption, high density, and simple interconnection topology. A special type of pass networks called Binary Tree Structured (BTS) pass networks uses almost minimum number of transistors for the design of switching circuits. An algorithmic procedure is developed here for BTS pass networks which is very efficient in terms of both execution time and memory space. Based on these networks, the necessary and sufficient conditions are derived for the design of multiple-output pass networks. …

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

Analog Computer Simulation With Automatic Scaling By Digital Computer, Mark Anthony Motter

Electrical & Computer Engineering Theses & Dissertations

A computer-aided design approach for the simplification of analog computer simulation is presented. The simulation configuration consists of an EAI 2000 analog computer with serial communications link to a PDP — 11/24 digital computer. Under control of the PDP-11, the analog simulations are realized with appropriate time and magnitude scaling which adjusts the range of the simulation coefficients and prevents overloads of the analog components. The analog computer hardware configuration accommodates both stable plants up to eighth order and closed-loop systems up to tenth order. Cascade compensation is provided for the closed-loop systems.

The plant may be described by either …

Color Display Of Vowel Spectra As A Training Aid For The Deaf, Amir Jalali Jagharghi

Electrical & Computer Engineering Theses & Dissertations

The objective of this research was to develop a transformation for mapping speech parameters to color parameter. This transformation is done in real-time, and the resulting color parameter are continuously displayed on a color monitor. This visual speech display is to be used as a speech articulation training aid for the deaf. The conversion of speech acoustic signals into speech parameter was accomplished using special -purpose electronics. The real-time conversion of speech parameter to display parameter was controlled by an 8086/8088 microprocessor operating in an S-100 bus structure. The coefficients of the Karhunen-Loeve series expansion of speech power spectra were …

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

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 …

Computer Aided Simulation Of A Heating, Ventilating, And Air Conditioning System In A Building, Sunil Shrikrishna Kulkarni

Mechanical & Aerospace Engineering Theses & Dissertations

The Godwin Life Science Building on the Old Dominion University campus presents an interesting problem in terms of energy conservation. The building is the maximum energy resource consumer on the campus, having a criterion value of 234 KBtu/sq.ft-year (2657 MJoules/sq. rneter-year). A Simplified Energy Analysis Method (ASEAM) loads and systems computer program was used to simulate the building and its heating, ventilating, and air conditioning (HVAC) plant in order to understand the building's high annual energy resource consumption rate, and to devise ways to overcome it. The main goal was to assess and propose energy conservation improvements to the existing …

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 …

Design Of Infrasound-Detection System Via Adaptive Lmstde Algorithm, Camille S. Khalaf

Electrical & Computer Engineering Theses & Dissertations

A proposed solution to an aviation safety problem is based on passive detection of turbulent weather phenomena through their infrasonic emission. This thesis describes a system design that is adequate for detection and bearing evaluation of infrasounds. An array of four sensors, with the appropriate hardware, is used for the detection part. Bearing evaluation is based on estimates of time delays between sensor outputs. The generalized cross correlation (GCC), as the conventional time-delay estimation (TOE) method, is first reviewed. An adaptive TUt approach, using the least mean square (LMS) algorithm, is then discussed. A comparison between the two techniques is …

Suboptimal Algorithms For Improvement Of Pipeline Through Insertion Of Delays, Sukhamoy Som

Electrical & Computer Engineering Theses & Dissertations

Pipelining is now widely used in the design of high speed processors in order to overcome the intrinsic speed limitations imposed by the technology. For a good performance and avoidance of internal conflicts, the concurrent operations within different subunits of a pipeline architecture should be properly scheduled This scheduling problem is known to be intrinsically difficult" and a member of the "NP complete class of problems. The aim of this thesis is to develop heuristic suboptimal algorithms whose execution time is a polynomial function of the number of items to be scheduled. Insertion of delay is used as a basic …

Block Encoding Of Speech Spectral Principal Components, James R. Holland Jr.

Electrical & Computer Engineering Theses & Dissertations

A Karhunen-Loeve series expansion was used to block encode speech spectral principal components as a function of time. Each of ten principal components was first obtained as a linear combination of 2© speech spectral band energies. Using a fixed block length of 10 frames (0.128 s), the K-L basis vectors were computed separately for various speakers for each principal component. In all cases the resulting basis vectors were essentially a set of discrete cosine basis vectors. Synthesis of speech from the block encoded parameters showed that very little information is lost with up to 70% data reduction. The block encoding …

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

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

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

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 …