Digital Commons Network^™

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, February 1990, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

//Ellpack: A Numerical Simulation Programming Environment For Parallel Mimd Machines, Elias N. Houstis, John R. Rice, N. P. Chrisochoides, H. C. Karathanasis, P. N. Papochiou, E. A. Vavalis, Ko Yang Wang

Department of Computer Science Technical Reports

No abstract provided.

An Abstract Data Model For The Idef0 Graphical Analysis Language, Gerald R. Morris, Thomas C. Hartrum, Mark A. Roth

AFIT Documents

IDEF₀ is the United States Air Force's ICAM (Integrated Computer Aided Manufacturing) Definition Method Zero graphical analysis language, a subset of Ross' Structured Analysis (SA) language. The language is also an excellent methodology for performing a requirements-phase analysis for any software development project. We present an abstract data model for IDEF₀ using entity-relationship diagrams. This model helps to mitigate some of the ambiguities inherent in IDEF₀. The model is divided into two parts representing the analysis data (the essential data model) and the graphical data (the drawing data model). This dual modeling approach allows for the …

Queueing Models Of Secondary Storage Devices, Edward G. Coffman

Department of Computer Science Technical Reports

No abstract provided.

Mapping Finite Element Graphs On Hypercubes, Yeh-Ching Chung, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

In parallel computing, it is important to map a parallel program onto a parallel computer such that the total execution time of a parallel program is minimized. In general, a parallel program and a parallel computer can be represented by a task graph (TG) and a processor graph (PG), respectively. For a TG, nodes represent tasks of a parallel program and edges denote the data communication needed between tasks. The weights associated with nodes and edges represent the computational load and communication cost, respectively. For a PG, nodes and edges denote processors and communication channels, respectively. By using the graph …

An Architecture For Distributed Multimedia Database Systems, P. B. Berra, C.Y.R. Chen, A. Ghafoor, C. C. Lin

Electrical Engineering and Computer Science - All Scholarship

In the past few years considerable demand for user oriented multimedia information systems has developed. These systems must provide a rich set of functionality so that new, complex, and interesting applications can be addressed. This places considerable importance on the management of diverse data types including text, images, audio and video. These requirements generate the need for a new generation of distributed heterogeneous multimedia database systems. In this paper we identify a set of functional requirements for a multimedia server considering database management, object synchronization and integration, and multimedia query processing. A generalization of the requirements to a distributed system …

Using Annotated C++, Marshall P. Cline, Doug Lea

Electrical Engineering and Computer Science - All Scholarship

A++ (‘‘Annotated C++’’) is both a formalism and a proposed CASE tool for annotating C++ code with object-oriented specifications, assertions, and related semantic information. Annotations provide programmers with a useful means for approaching class design, exceptions, correctness, standardization, software reusability and related issues in software engineering with C++. This paper shows how A++ provides arbitrarily fine granularity to the C++ type system, how it automates and streamlines exception testing, how it can aid in standardization of software components, and how it can safely remove redundant exception tests.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, January 1990, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A fourteen page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Arithmetic Classification Of Perfect Models Of Stratified Programs (Addendum), Krzysztof R. Apt, Howard A. Blair

Electrical Engineering and Computer Science - Technical Reports

RECURSION-FREE PROGRAMS The following section completes the analysis of arithmetic complexity of perfect models and has been inadvertently omitted in the previous version of the paper. We say that a general program P is recursion-free if in its dependency graph Dp there is no cycle. Clearly recursion-free programs form a subclass of stratified programs. Recursion-free programs form a very simple generalization of the class of hierarchical programs introduced in [C78]. Hierarchical programs satisfy an additional condition on variable occurrences in clauses that prevents floundering, i.e. a forced selection of a non-ground negative literal in an SLDNF- derivation. In this section …

Ua66/3/3 Journal Of The A. C. M., Wku Association For Computing Machinery

Student Organizations

Journal created by and about the WKU Association for Computing Machinery a student organization sponsored by WKU Computer Science.

Dawgs - A Distributed Compute Server Utilizing Idle Workstations, Henry Clark, Bruce M. Mcmillin

Computer Science Faculty Research & Creative Works

A collection of powerful workstations interconnected by a local area network can be utilized as compute servers when left idle by their owners. DAWGS allows users to submit jobs for execution on an idle workstation somewhere on a local area network. DAWGS uses a distributed scheduler and a bidding scheme to determine on which machine to run a process. DAWGS can properly redirect all the I/O of a remotely executing process and can checkpoint and then subsequently restart the process, even if the restart is on a different machine than the checkpoint. Our method is different from other work in …

A Simulation Testbed For Image Compression Algorithms, Andrew Francis Laine

All Computer Science and Engineering Research

This paper presents an overview of the design and development of a real-time (30 frames/sec) simulation testbed for evaluating and comparing image compression algorithms. The system was motivated by the need to visualize the performance of a novel compression algorithm when operating on moving pictures originating from "live" video sources. The simulation utilities are designed to exploit the parallelism of a Pixar Image Computer and high-throughput of a parallel disk assembly. The design of two key utilities are discussed: (1) A program to format precomputed four channel (RGBA) 256 X 256 color frames onto a parallel disk assembly. (2) A …

Grades - A Computer Based Score Management System For The Iigs, Charles Patrick Wahle

All Graduate Projects

This project involved the creation of an electronic gradebook designed to realistically meet the needs of classroom teachers. The computer source code was written in Pascal, a compiled language that allowed fast execution of any part of the program. The electronic gradebook called GradeS uses the graphic Desktop Intert'ace. It tracks up to 42 students per class, allowing up to 50 assignments per grading period. An unlimited number of classes can be stored on data disks. It produces four different types of whole class and individual student reports both on the screen and the printer. The project includes a report …

Adaptive Histogram Equalization, A Parallel Implementation, Charles W. Kurak Jr.

UNF Graduate Theses and Dissertations

Adaptive Histogram Equalization (AHE) has been recognized as a valid method of contrast enhancement. The main advantage of AHE is that it can provide better contrast in local areas than that achievable utilizing traditional histogram equalization methods. Whereas traditional methods consider the entire image, AHE utilizes a local contextual region.

However, AHE is computationally expensive, and therefore time-consuming. In this work two areas of computer science, image processing and parallel processing, are combined to produce an efficient algorithm. In particular, the AHE algorithm is implemented with a Multiple-Instruction-Multiple-Data (MIMD) parallel architecture. It is proposed that, as MIMD machines become more …

The Development Of An Expert System For The Diagnosis Of Diseases In Fibre And Dairy Goats, Tim S. Roberts

Theses: Doctorates and Masters

This thesis details the development of an expert system for the diagnosis of diseases in fibre and dairy goats. Divided into five sections, five appendices, and a bibliography, this thesis centres on the methods used to build the expert system: the decisions taken at the outset of, and during the course of, development; some of the problems encountered, and the solutions to those problems. A detailed appraisal is made of the development process and suggestions are made for future developments over similar domains (for example, the diagnosis of diseases in animals other than goats). Much emphasis is placed on three …

Educational Software Development Using Hypertext And Expert System Software Concepts, Siripong Malasri, Roger R. Easson

Journal of the Arkansas Academy of Science

This paper presents two computer software concepts: hypertext and expert systems; which are useful for educational software development. Good educational software enhances the learning process and offers opportunities for faculty to provide additional materials for independent studies, which would otherwise be impossible, due to the limited time and incredible growing rate of technological progress. The hypertext concept offers the students a non-linear learning style, while the expert system concept provides explanation facilities for students to probe the logic of the systems. Both approaches are extremely useful for educational software. With the proper tools, the courseware can be implemented easily and …

Impact Of Microprocessor Protected Mode Programming On Undergraduate Education N Engineering Technology, Robert L. Douglas

Journal of the Arkansas Academy of Science

No abstract provided.

Benchmarking Parallel Machines Via A Software Architecture, Srikanth Kambhatla, Jon Inouye, Jonathan Walpole

Computer Science Faculty Publications and Presentations

The diversity in parallel architectures and the programming styles induced thereof, make benchmarking of parallel machines a hard problem. Current benchmarking techniques are limited in applicability due to the issues of portability. We present a different approach to benchmarking parallel machines, which would make the resulting benchmarks portable, easy to use and widely applicable. The approach involves the use of a software architecture to mask the diversities of the underlying architectures. The benchmarks are based on the Linda Tuple Space, and is called BeLinda. In this report, we motivate the use of a software architecture, give a specification of the …

An Expert System To Convert Knowledge-Based Geological Engineering Systems Into Fortran, Ralph W. Wilkerson, Jill J. Cress

Computer Science Faculty Research & Creative Works

A knowledge-based geographic information system (KBGIS) for geological engineering map (GEM) production was developed in GoldWorks, an expert system development shell. Using this shell, the geological engineer is able to develop a rule base for a particular application that results in a valid GEM. However, this implementation failed as a practical production system due to the excessive execution time required to produce a GEM. To solve this problem, a conversion expert system was developed which accepted, as input, a KBGIS and produced, as output, the equivalent Fortran code. Two major objectives are accomplished as a result of this system: GEN …

Highland: A Graph-Based Parallel Processing Environment For Heterogeneous Local Area Networks, Ralph W. Wilkerson, Douglas E. Meyer

Computer Science Faculty Research & Creative Works

No abstract provided.

Distributed Evaluation Of An Iterative Function For All Object Pairs On A Simd Hypercube, Fikret Erçal

Computer Science Faculty Research & Creative Works

An efficient distributed algorithm for evaluating an iterative function on all pairwise combinations of C objects on an SIMD hypercube is presented. The algorithm achieves uniform load distribution and minimal, completely local interprocessor communication.

Performance Improvements For Fddi And Csma/Cd Protocols, David Earl Game

Computer Science Theses & Dissertations

The High-Performance Computing Initiative from the White House Office of Science and Technology Policy has defined 20 major challenges in science and engineering which are dependent on the solutions to a number of high-performance computing problems. One of the major areas of focus of this initiative is the development of gigabit rate networks to be used in environments such as the space station or a National Research and Educational Network (NREN).

The strategy here is to use existing network designs as building blocks for achieving higher rates, with the ultimate goal being a gigabit rate network. Two strategies which contribute …

Experimentation With Large-Grained Parallelism Using Local Area Networks, Ralph W. Wilkerson, Douglas E. Meyer

Computer Science Faculty Research & Creative Works

HIGHLAND, a distributed-memory parallel processing environment for heterogeneous local area networks, has been developed. Designed as both a teaching and a research tool, its purpose is to provide an effective mechanism by which a number of networked UNIX workstations, dissimilar in both vendor and performance, can be directly manipulated as a single, unified, multiprocessing system. Utilizing the MIT X-windows environment, HIGHLAND supports a highly interactive graphical interface through which a programmer can create, modify, and control complex systems of communicating processes

Pipelining Data Compression Algorithms, R. L. Bailey, R. Mukkamala

Computer Science Faculty Publications

Many different data compression techniques currently exist. Each has its own advantages and disadvantages. Combining (pipelining) multiple data compression techniques could achieve better compression rates than is possible with either technique individually. This paper proposes a pipelining technique and investigates the characteristics of two example pipelining algorithms. Their performance is compared with other well-known compression techniques.

Efficient Schemes To Evaluate Transaction Performance In Distributed Database Systems, R. Mukkamala, S. C. Bruell

Computer Science Faculty Publications

Database designers and researchers often need efficient schemes to evaluate transaction performance. In this paper, we chose two important performance measures: the average number of nodes accessed and the average number of data items accessed per node by a transaction in a distributed database system. We derive analytical expressions to evaluate these metrics. For general applicability, we consider partially replicated distributed database systems. Our first set of analytic results are closed-form expressions for these two measures. These are based on some fairly restrictive simplifying assumptions. When these assumptions are relaxed, no closed-form expressions exist for these averages. Hence, we develop …

Data Security: The Securing Of Computer Installations And Data Sets, Willy B. Kuehnle

Theses

No abstract provided.

A Statistical Theory Of Digital Circuit Testability, Sharad C. Seth, Vishwani D. Agrawal, Hassan Farhat

School of Computing: Faculty Publications

When test vectors are applied to a circuit, the fault coverage increases. The rate of increase, however, could be circuit dependent. A relation between the average fault coverage and circuit testability is developed in this paper. The statistical formulation allows computation of coverage for deterministic and random vectors. We discuss the following applications of this analysis: determination of circuit testability from fault simulation, coverage prediction from testability analysis, prediction of test length, and test generation by fault sampling.

Trellis-Coded Multidimensional Phase Modulation, S. S. Pietrobon, Robert H. Deng

Research Collection School Of Computing and Information Systems

A 2L-dimensional multiple phase-shift keyed (L×MPSK) signal set is obtained by forming the Cartesian product of L two-dimensional MPSK signal sets. A systematic approach to partitioning L×MPSK signal sets that is based on block coding is used. An encoder system approach is developed. It incorporates the design of a differential precoder, a systematic convolutional encoder, and a signal set mapper. Trellis-coded L×4PSK, L×8PSK, and L×16PSK modulation schemes are found for 1⩽L⩽4 and a variety of code rates and decoder complexities, many of which are fully transparent to discrete phase rotations of the signal set. The new codes achieve asymptotic coding …

Experimental Comparison Of Bidding And Drafting Load Sharing Protocols, Andrew Ross, Bruce M. Mcmillin

Computer Science Faculty Research & Creative Works

In recent years, a dramatic rise in the number of personal workstations interconnected via local area networks has occurred in the workplace. These can be organized as distributed computing systems. The combined computing power of these systems are often greater than mainframes of a decade ago, and usually less expensive. There is a growing interest in harnessing this often-underutilized power. Researchers are focusing their attention on remote execution of processes as one solution. An additional topic of research is to balance a workload among a series of computers. Remote execution is made possible because the distributed operating system provides migration …

Exclusive And Inclusive Decays Of B Mesons Into Ds Mesons, D. Bortoletto, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

We have studied the production of Ds mesons in the decays of B mesons at the Υ(4S) resonance. We report on the first observation of exclusive B-meson decays B->Ds−D*+, B→Ds−D+, and B→Ds−D0. We also present a new measurement of the branching ratio and the momentum spectrum for the inclusive decay B→DsX.