Digital Commons Network^™

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 …

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 …

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 …

Computer Use In The Warren County Riii School District: A Proposal For The Implementation Of A Computer Lab Program In The Elementary School, Debbie Reese

Theses

A problem faced by many schools in the 1980s is how to approach computer ir1struction in the elementary grades. Schools have moved into a new technological realm with the advent of the modern microcomputer. The focus of this project was to investigate current trends in computer education in the elementary grades in respect to computer placement within the schools and content of computer education programs. The paper addresses, specifically, the lack of a computer program in the Warren County RIII School District and the rationale for developing a computer lab in the elementary school. An interim plan is also proposed, …

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

Department of Computer Science Technical Reports

No abstract provided.

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

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 …

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.

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

Department of Computer Science Technical Reports

No abstract provided.

Seth: A Quorum-Based Replicated Database System For Experimentation With Failures, Bharat Bhargava, Abdelsalam Helal, Jagannathan Srinivasan

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.

Topological Numbering Of Features On A Mesh (Cc-88-18), Mikhail J. Atallah, Susanne E. Hambrusch, Lynn E. Tewinkel

Department of Computer Science Technical Reports

No abstract provided.

(Probably) Optimal Solution To Some Problems Not Only On Graphs, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Estimating Lower Bounds On Buffer Sizes For A Packet Switch, Douglas E. Comer, Rajendra Yavatkar

Department of Computer Science Technical Reports

No abstract provided.

Automated Circuit Diagnosis Using First Order Logic Tools, Barbara Smith, Ralph W. Wilkerson, Gerald E. Peterson, Mcdonnell Douglas

Computer Science Faculty Research & Creative Works

While Numerous Diagnostic Expert Systems Have Been Successfully Developed in Recent Years, They Are Almost Uniformly based on Heuristic Reasoning Techniques (I.e., Shallow Knowledge) in the Form of Rules. This Paper Reports on an Automated Circuit Diagnostic Tool based on Reiter's Theory of Diagnosis. in Particular, this is a Theory of Diagnosis based on Deep Knowledge (I.e., Knowledge based on Certain Design Information) and using First Order Logic as the Representation Language. the Inference Mechanism Which is Incorporated as Part of the Diagnostic Tool is a Refutation based Theorem Prover using Rewriting Systems for Boolean Algebra Developed by Hsiang. Consequently, …

Using The Bat: A Six Dimensional Mouse For Object Placement, Colin Ware, Danny R. Jessome

Center for Coastal and Ocean Mapping

Placement in space is inherently six dimensional. An object can be translated in x, y and z cartesian coordinates, and it can be rotated about three axes to change its orientation. A six dimensional sensor I\I(/S conj/gured as a one button six dimensional mouse (which we call a bat) and interfaced with an IRIS workstation thus creating an environment for investigating the problems of object placement. A sojiware workbench was built which allows the manipulation of hierarchical scenes displayed on a monitor. The features of the workbench are described together with experiences using the bat in a variety of interaction …

Interface Structures I: Abstract Structures For Computing About Physical Objects, Chandrajit Bajaj, Dayne Dyksen, Christoph M. Hoffmann, Elias N. Houstis, John T. Korb

Department of Computer Science Technical Reports

No abstract provided.

Graph And Directed Graph Augmentation Problems, Zhuguo Mo

Dissertations

No abstract provided.

Implementing Ray Tracing Algorithm In Parallel Environment, Tjah Jadi

Dissertations and Theses

Ray tracing is a very popular rendering algorithm in the field of computer graphics because it can generate highly-realistic images from three-dimensional models. Unfortunately, the computational cost is very expensive. To speed up the rendering process we present both static and dynamic scheduling (balancing) strategies for a multiprocessor system. Hence, the load balancing among the processors is the most important problem in parallel processing. The implementation of the algorithm is based on a modified octree structure.

Dynamics Of Knowledge Processing In Parallel Systems, Abhijit Chaundhury, Dan C. Marinescu, Andrew Whinston

Department of Computer Science Technical Reports

No abstract provided.

Machine Learning: A Critique Of Research Efforts And Suggested Research Strategy, William S. Davis, David B. Murrell

Department of Computer Science Technical Reports

No abstract provided.

Robust Replication Control Using Primary Copy Method, Niraj K. Sharma

Department of Computer Science Technical Reports

No abstract provided.

The Problem Of Accuracy And Robustness In Geometric Computation, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

Applying Algebraic Geometry To Surface Intersection Evaluation, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

Locating Distributed Information, Craig E. Wills

Department of Computer Science Technical Reports

No abstract provided.

Service Execution In A Distributed Environment (Thesis), Craig E. Wills

Department of Computer Science Technical Reports

No abstract provided.