Physical Sciences and Mathematics Commons^™

A Simulation Of A Message Passing Protocol For A Network Of Transputers, Janice R. Glowacki

FIU Electronic Theses and Dissertations

With decreasing cost and size of processors and more sophisticated demands of computer users, it is becoming popular to execute programs in parallel on a distributed network. Processors communicate through shared memory or hard-wired links depending on the hardware and topology of the system. Simulation is an appropriate tool for the investigation of system throughput, and the projection of system behavior under various workloads.

In this paper is described the configuration and communication protocol of an INMOS Transputer network, and the construction, verification, and validation of a detailed simulation model for the network. Results obtained from the execution of the …

Implementing Educational Software And Evaluating Its Academic Effectiveness: Part I, Karen Jolicoeur, Dale E. Berger

CGU Faculty Publications and Research

Two major obstacles are responsible for the delay in getting good educational software into schools. First, software implementation is a complex process that many schools are simply not prepared to undertake. Second, there is very little empirical research available on the specific factors that make educational software effective, leaving it extremely difficult to separate good from poor quality software. We will describe a basic plan for implementing educational software into classrooms, incorporating a research design that permits educational researchers to measure the effectiveness of the software. Part I of this series of two articles presents a basic plan for implementing …

Relational Completeness Of Show And Tell Visual Programming Language, Takayuki Dan Kimura

All Computer Science and Engineering Research

In this paper we present the database applications of the Show and Tell Language (STL) and demonstrate the relational completeness of the language. STL is a visual programming language designed for novice computer users who are not familiar with keyboarding. A program can be constructed by using only a pointing device, except for textual data entry. A program can be constructed by using only a pointing device, except for textual data entry. Various programming concepts such as subroutine, iteration, recursion, concurrency, exception, and so forth are represented by two-dimensional graphic patterns and icons. The language is used to test the …

A Lower Bound On Embedding Tree Machines With Balanced Processor Utilization, Ajay K. Gupta, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.

Efficient Algorithms For Hybrid Data/Voice Transmissions, Andrzej Kusiuk, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Output-Sensitive Hidden Surface Elimination For Rectangles, Mikhail J. Atallah, Michael T. Goodrich

Department of Computer Science Technical Reports

No abstract provided.

A Formalism For Describing Data Distribution, Charles Koelbel

Department of Computer Science Technical Reports

No abstract provided.

Semi-Automatic Process Decomposition For Non-Shared Memory Machines, Charles Koelbel, Piyush Mehrotra

Department of Computer Science Technical Reports

No abstract provided.

Time-Varying Images: The Effect Of Finite Resolution On Uniqueness, Chia-Hoang Lee

Department of Computer Science Technical Reports

No abstract provided.

Analysis Of A Two Level Asynchronous Algorithm For Pdes, John R. Rice, Dan C. Marineseu

Department of Computer Science Technical Reports

No abstract provided.

An Optimal Parallel Algorithm For Preemptive Job Scheduling That Minimizes Maximum Lateness, Susan Rodger

Department of Computer Science Technical Reports

No abstract provided.

Composite Graph Coloring Algorithms And Applications, Stephen Hong Seng Yek, Billy E. Gillett

Computer Science Technical Reports

A vertex-composite graph is a graph that can have unequal chromaticities on its vertices. Vertex-composite graph coloring or composite graph coloring involves coloring each vertex of a composite graph with consecutive colors according to the vertex's chromaticity with no two vertices adjacent to one another having the same color(s).

New heuristic algorithms including the use of the saturation degree method have been developed in this research. All eleven heuristic algorithms including Clementson and Elphick algorithms were then tested using random composite graphs with five different chromaticity distributions. The best algorithm which uses the least average colors from the experiment is …

A User Guide To The Algorithm Mapper: A System For Modeling And Evaluating Parallel Applications/Architecture Pairs, C. E. Houstis, Elias N. Houstis, John R. Rice, S. M. Samartizis, D.L. Alexandrakis

Department of Computer Science Technical Reports

No abstract provided.

A Graph Browser With Zoom And Roam For Allegro Common Lisp, Steve B. Cousins, J. Andrew Fingerhut

All Computer Science and Engineering Research

This report describes an object-oriented tool that has been developed for viewing graphs on a Macintosh II computer using Allegro Common Lisp. The tool is useful for visualizing data which can be represented in tree or graph form. The graphs can be viewed for far away to get a global view, and from close up so that the labels on the vertices can be discerned. Scrolling can be performed at a nearly infinite number of resolutions, and a search feature makes it easy to find any node rapidly. Although the 'information space' on which the graph is logically plotted is …

A Parallel Distributed Approach To Parsing Natural Language Deterministically, Stan C. Kwasny

All Computer Science and Engineering Research

The Determinism Hypothesis (Marcus, 1980) has given rise to much debate. The hypothesis makes explicit the idea that Natural Language interpretation need not depend in any fundamental way on the use of pseudo-parallelism or backtracking. We are exploring the consequences of this hypothesis in attempting to develop approaches to parsing which integrates current work in parallel distributed adaptive networks. We follow the basic approach of "Wait-and-See" parsing (WASP) which has shown the Natural Language interpretation of all but some varieties of "garden-path" sentences can be deterministically performed using a stack, a buffer for sentence constituents, and partitioned packets of rules. …

Experimenal Evaluation Of Concurrent Checkpointing And Rollback-Recovery Algorithms, Bharat Bhargava, Pei-Jyun Leu, Shy-Renn Lian

Department of Computer Science Technical Reports

No abstract provided.

Planar Graph Decomposition And All Pairs Shortest Paths, Greg N. Frederickson

Department of Computer Science Technical Reports

No abstract provided.

Complete Sets Of Reductions Modulo A Class Of Equational Theories Which Generate Infinite Congruence Classes, Timothy B. Baird, Ralph W. Wilkerson

Computer Science Technical Reports

In this paper we present a generalization of the Knuth-Bendix procedure for generating a complete set of reductions modulo an equational theory. Previous such completion procedures have been restricted to equational theories which generate finite congruence classes. The distinguishing feature of this work is that we are able to generate complete sets of reductions for some equational theories which generate infinite congruence classes. In particular, we are able to handle the class of equational theories which contain the associative, commutative, and identity laws for one or more operators.

We first generalize the notion of rewriting modulo an equational theory to …

The Role Of Term Symmetry In E-Unification And E-Completion, Blayne E. Mayfield, Ralph W. Wilkerson

Computer Science Technical Reports

A major portion of the work and time involved in completing an incomplete set of reductions using an E-completion procedure such as the one described by Knuth and Bendix [070] or its extension to associative-commutative equational theories as described by Peterson and Stickel [PS81] is spent calculating critical pairs and subsequently testing them for coherence. A pruning technique which removes from consideration those critical pairs that represent redundant or superfluous information, either before, during, or after their calculation, can therefore make a marked difference in the run time and efficiency of an E-completion procedure to which it is applied.

The …

An Aeration Duct Design Model For Flat Grain Storage, Thomas C. Bridges, Douglas G. Overhults, Samuel G. Mcneill, G. M. White

Biosystems and Agricultural Engineering Faculty Publications

Traditionally most grain is stored in circular type bins which provide a convenient means for handling and management. With the excess grain production and government loan programs of the past few years, some producers have used rectangular structures and covered piles to complement their round storages. The recommended management practices used with round bins are still required in those alternative storages and may be more critical in obtaining a quality end product.

One such recommended practice used with round bins is aeration. This practice is used to maintain a uniform temperature in the grain mass, preventing condensation and "hot" spots …

A Conceptual Design Of A Catalogue Subsystem For A Student Advisory System, Claudette Captoria Browder Watson

Electronic Dissertations and Theses

At Southern University, students are assigned to faculty advisors with responsibilities for guiding the student in selecting courses to complete the requirements for a selected degree. Large departments with dynamic curricula changes encounter problems in ensuring that all students are properly advised in their respective degree programs. In an effort to address the advancement problem, an ad hoc University committee was named to study the problem and the findings and suggestions for enhancement were reported to the University administration. The Computer Science Department faculty wrote a proposal for an On-line Computerized Advisement System (CAAS) to address these problems which was …

A Conceptual Design Of A Catalogue Subsystem For A Student Advisory System, Claudette Captoria Browder Watson

Electronic Dissertations and Theses

At Southern University, students are assigned to faculty advisors with responsibilities for guiding the student in selecting courses to complete the requirements for a selected degree. Large departments with dynamic curricula changes encounter problems in ensuring that all students are properly advised in their respective degree programs. In an effort to address the advisement problem, an ad hoc University committee was named to study the problem and the findings and suggestions for enhancement were reported to the University administration. The Computer Science Department faculty wrote a proposal for an On-Line Computerized Academic Advisement System (CAAS) to address these problems which …

Scholarship Budget Forms And Reports System (Sbfars), Iris F. Glasper

Electronic Dissertations and Theses

The Department of Computer Science at Southern University is charged with the responsibility of processing and issuing scholarships to outstanding students for their academic excellence in the field of Computer Science. Scholarships supported by companies in industry are awarded only to qualified sophomores majoring in Computer Science. Departmental scholarships are awarded to qualified freshmen and upperclassmen majoring in Computer Science. The objective of SBFARS is to develop the forms to be used for processing scholarships, to generate reports, and to maintain a record of the funds available in each company's account. The problem with the existing procedure is that there …

Flows: Performance Guarantees In Best Effort Delivery Systems, Douglas E. Comer, Rajendra Yavatkar

Department of Computer Science Technical Reports

No abstract provided.

Atamm Multicomputer System Design, William Robert Tymchyshyn

Electrical & Computer Engineering Theses & Dissertations

The Algorithm To Architecture Mapping Model, or ATAMM, is a graph theoretic design methodology that has been created to resolve design and performance issues involved with concurrent processing. Petri-net marked graphs are used to represent the computational environment.

This thesis describes the development of a multicomputer system which will operate within the bounds specified by the ATAMM model. The system is first designed and implemented using the framework of standard multicomputer design theory. A validation is then performed by the comparison of the system's computational performance to results predicted by ATAMM. This validation is shown to be successful for three …

Dc-Free Coset Codes, Robert H. Deng, M. A. Herro

Research Collection School Of Computing and Information Systems

An upper bound on the bit-error probability (BEP) of a linear cyclic code over GF(2l) with hard-decision (HD) maximum-likelihood (ML) decoding on memoryless symmetric channels is derived. Performance results are presented for Reed-Solomon codes on GF(32), GF(64), and GF(128). Also, a union upper bound on the BEP of a linear cyclic code with either hard- or soft-decision ML decoding is developed, as well as the corresponding bounds for the extended code of a linear cyclic code. Using these bounds, which are tight at low bit error rate, the performance advantage of soft-decision (SD) ML and HD ML over bounded-distance (BD) …

A Generic Algorithm For Transaction Processing During Network Partitioning, Bharat Bhargava, Shirley Browne

Department of Computer Science Technical Reports

No abstract provided.

On The Maximum Queue Length With Applications To Data Structures: A Simple But Yet Asymptotically Exact Approach, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Three Experiments In Reliable Transaction Processing In Raid, Bharat Bhargava, Fady Lamaa, Pei-Jyun Leu, John Riedl

Department of Computer Science Technical Reports

No abstract provided.

Engineering The Object-Relation Database Model In O-Raid, Bharat Bhargava, Prasun Dewan, Stephen Leung

Department of Computer Science Technical Reports

No abstract provided.