Digital Commons Network^™

Computer Viruses--A Form Of Artificial Life?, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

Super Linear Learning In Back Propagation Neural Nets, Barry L. Kalman

All Computer Science and Engineering Research

The important feature of this work is the combination of minimizing a function with desirable properties, using the conjugate gradient method (cgm). The method has resulted in significant improvements for both easy and difficult training tasks. Two major problems slow the rate at which large back propagation neural networks (bpnns) can be taught. First is the linear convergence of gradient descent used by modified steepest descent method (msdm). Second is the abundance of saddle points which occur because of the minimization of the sum of squared errors. This work offers a solution to both difficulties. The cgm which is super …

Modcad: A Graphic Predetermined Time Standards Software For The Ibm P.C., Raad A. Dawood

Masters Theses

MODCAD is a software program designed to give MODAPTS (MODular Arrangement of Predetermined Time Standards) the capability to generate workplace layouts that can be used in conjunction with the time study analysis. Software packages have been developed for MODAPTS such as MODAPTS Plus and Task Master that allow the user to input the predetermined codes of MODAPTS.

AutoCAD (a computer aided design software) is used to combine MODAPTS codes and workplace layout drawings in a single environment by customizing the standard AutoCAD menus and icons to include the MODAPTS codes and routines. AutoLisp (AutoCAD resident language) is used to write …

Parallel Implementation Of A Recursive Least Squares Neural Network Training Method On The Intel Ipsc/2, James Edward Steck, Bruce M. Mcmillin, K. Krishnamurthy, M. Reza Ashouri, Gary G. Leininger

Computer Science Faculty Research & Creative Works

An algorithm based on the Marquardt-Levenberg least-square optimization method has been shown by S. Kollias and D. Anastassiou (IEEE Trans. on Circuits Syst. vol.36, no.8, p.1092-101, Aug. 1989) to be a much more efficient training method than gradient descent, when applied to some small feedforward neural networks. Yet, for many applications, the increase in computational complexity of the method outweighs any gain in learning rate obtained over current training methods. However, the least-squares method can be more efficiently implemented on parallel architectures than standard methods. This is demonstrated by comparing computation times and learning rates for the least-squares method implemented …

Cascading Of Arithematic Coding Method With The Lzw Algorithm, Venkat R. Maram, Nageshwar R. Kadakuntla

Theses

Two known compression algorithms appropriate for communication are the LZW algorithm and the Arithmetic Coding method. Both algorithms are adaptive and require no extra communication from the encoder to the decoder. We present a scheme to cascade these algorithms into an adaptive algorithm which achieves higher compression ratio and is appropriate for communication.

Towards Stability Criteria For Multidimensional Distributed Systems: Buffered Aloha Case, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Software Validation Techniques : A Contrast Between Myers' And Hetzel's Techniques, Reyad I. Abukaker

Electronic Dissertations and Theses

This research work presents the contemporary testing methodologies of current state-of-the-art methodologies in software testing. Myers' and Hetzel's methodologies are the primary objectives of this research. The scope of this work is to contrast these two testing methodologies, through looking at their principles as well as their definitions of testing. The two definitions of testing differ substantially. Myers' philosophy deals with human psychology and economics as the primary factors in defining the test plans. Hetzel's philosophy is broad in that it looks at software testing in terms of "meeting requirements." However, Hetzel focuses toward "evaluating" and "measuring" a software system …

Monotone Logic Programming, Howard A. Blair, Allen Brown Jr., V. S. Subrahmanian

Electrical Engineering and Computer Science - Technical Reports

We propose a notion of an abstract logic. Based on this notion, we define abstract logic programs to be sets of sentences of an abstract logic. When these abstract logics possess certain logical properties (some properties considered are compactness, finitariness, and monotone consequence relations) we show how to develop a fixed-point, model-state-theoretic and proof theoretic semantics for such programs. The work of Melvin Fitting on developing a generalized semantics for multivalued logic programming is extended here to arbitrary abstract logics. We present examples to show how our semantics is robust enough to be applicable to various non-classical logics like temporal …

Korean Character Recognition Using Neural Networks, Jinhwan Koh, G. S. Moon, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

We present a neural-network approach for recognizing printed Korean characters. Our approach is based on a variant of the back-propagation algorithm. The results indicate that by transforming the character data into Hough space, we can achieve excellent recognition.

A Logic Grammar Foundation For Document Representation And Document Layout, Allen Brown Jr., Howard A. Blair

Electrical Engineering and Computer Science - Technical Reports

We present a powerful grammar-based paradigm for electronic document markup: coordinated definite clause translation grammars. This markup is of a declarative character, being, in effect, a collection of constraints on the logical and physical structure of documents. To the best of our knowledge, coordinated grammars and their parsers can accommodate all of the descriptive and layout processing functionality enjoyed by extant electronic markup languages. We describe an operational prototype that demonstrates the feasibility of a syntax-directed basis for formalizing and realizing document layout.

A Neural Network Simulator For The Connnection Machine, N. Asokan, Ravi V. Shankar, Chilukuri K. Mohan, Kishan Mehrotra, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

In this paper we describe the design, development, and performance of a neural network simulator for the Connection Machine (CM)3. The design of the simulator is based on the Rochester Connectionist Simulator(RCS). RCS is a simulator for connectionist networks developed at the University of Rochester. The CM simulator can be used as a stand-alone system or as a high-performance parallel back-end to RCS. In the latter case, once the network has been built by RCS, the high-performance parallel back-end system constructs an equivalent network on the CM processor array and executes it. The CM simulator facilitates the exploitation of the …

Dynamic Range Partitioning In Multiprocessor Database Implementations, Ophir Frieder

Electrical Engineering and Computer Science - Technical Reports

Multiprocessor implementation of the relational database operators has recently received great attention in literature [1-4, 8, 11]. As the complexity of implementing the relational operators rests on the inter-node communication patterns involved in an operation, greater research attention has been focused on Join algorithms. The Join traffic patterns subsume those of the remaining relational operators. To effectively exploit parallelism in bucket based join implementations, the domain of the joining attributes must be partitioned into equal subranges. That is, the processing of each subrange requires roughly the same amount of time. A skewed distribution of workload significantly hinders performance. As relations …

Forecasting Sunspot Numbers Using Neural Networks, Ming Li, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

A recurrent connectionist network has been designed to model sunspot data. Preliminary experimental work shows that the network can produce competitive results as compared to traditional autoregressive models. The method is not problem specific and could be applied to other problems in dynamical system modeling, recognition, prediction, and control fields. It is observed that statistical methods can be used to design an appropriate neural network architecture.

Optical Switching And Routing Architectures For Fiber-Optic Computer Communication Networks, Alok Choudhary, Salim Hariri, Wang Song, Partha Banerjee, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

Optical technology has become a significant part of communication networks. We propose an Optical Interface Message Processor (OPTIMP) that exploits high-bandwidth, parallelism, multi-dimensional capability, and high storage density offered by optics. The most time consuming operations such as switching and routing in communication networks are performed in optical domain in the proposed system. Our design does not suffer from the optical/electrical conversion bottlenecks and can perform switching and routing in the range of Gigabits/s. The proposed design can have significant impact in high-speed communication networks as well as high-speed interconnection networks for parallel computers. The source-destination (S-D) information from a …

Btc Test Methodology, Gaurav Garg

All Computer Science and Engineering Research

This paper describes the testing methodology for the Broadcast Translation Circuit. It covers logic simulation, timing simulation, and a single push-button test for the device. The document is intended to be a supplement to documents WUCS-89-52 and WUCS-90-19, which outline the design of the BTC in full details. The intent of a push-button test is to have a single test that causes the device to process every type of packets that it could receive. This would include various combination of RC and OP fields, a test that examines every table entry thoroughly, as well as a test of the parity …

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

BITs and PCs Newsletter

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

Strong Completeness Results For Paraconsistent Logic Programming, Howard A. Blair, V. S. Subrahmanian

Electrical Engineering and Computer Science - Technical Reports

In [6], we introduced a means of allowing logic programs to contain negations in both the head and the body of a clause. Such programs were called generally Horn programs (GHPs, for short). The model-theoretic semantics of GHPs were defined in terms of four-valued Belnap lattices [5]. For a class of programs called well-behaved programs, an SLD-resolution like proof procedure was introduced. This procedure was proven (under certain restrictions) to be sound (for existential queries) and complete (for ground queries). In this paper, we remove the restriction that programs be well-behaved and extend our soundness and completeness results to apply …

A Root Finding Algorithm For Parallel Architecture Machines, Stuti Moitra

Computer Science Theses & Dissertations

In this thesis a parallel algorithm for determining the zeros of any given analytic function is described. Parallelism is achieved by modifying the traditional bisection algorithm for architecture machines.

Given any user supplied function f(X), continuous on the interval A_o ≤ x ≤ B₀, and the tolerance of accuracy an algorithm of determining up to ten roots, with error of approximation less than or equal to tolerance, on parallel systems like Distributed Array Processor (OAP) and N-cube is considered.

A variation of the bisection method has been adapted for this purpose. At each level of iteration a …

Adaptability Experiments In The Raid Distributed Database System, Bharat Bhargava, Karl Friesen, Abdelsalam Helal, John Riedl

Department of Computer Science Technical Reports

No abstract provided.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, April 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.

The Equivalence Of Connectionist Energy Minimization And Propositional Calculus Satisfiability, Gadi Pinkas

All Computer Science and Engineering Research

Quadratic energy minimization is the essence of certain connectionist models. We define high order connectionist models to support the minimization of high order energy functions and we prove that high order energy functions are equivalent to quadratic ones. We show that the standard quadratic models can minimize high order functions using additional hidden units and we demonstrate trade-offs of size (number of hidden units), order of the model, and fan-out. We prove an equivalence between the problem of satisfiability in propositional calculus and the problem of minimization of energy functions. An energy function describes a Well Formed Formula (WFF) if …

Introductory Dataperfect® Instruction, Frances Jenson Larsen

Theses and Dissertations

The project should be used in a beginning computer class. These units contain projects from simple to complex. The first instructional unit uses a database that comes with the DataPerfect® program. The students build and manipulate a small database. Reports are prepared, and finally the students design an original database. These instructional units are intended to be used in a high school classroom with the DataPerfect® computer program. DataPerfect® is a copyrighted program marketed by WordPerfect Corporation of Orem, Utah.

Michigan Apple Pest Identifier And Manager Expert System, James R. Schalk

Masters Theses

The Michigan Apple Pest Identifier and Management System (MAPI) is a knowledge- based consultation software system. MAPI was designed to provide the user with the ability to identify insects which may harm the apples of Michigan orchards and to project occurrences of maximum adult emergence. A discussion of standard entomological and expert system concepts and the application of these concepts to the processing of information by the Michigan Apple Pest Identifier and Management System is presented. Future possible expansions of the system are suggested.

The Mapping Of A Colored Petri Net Model To An Ops5 Rule-Based Production System, Sally S. Lockwitz

Masters Theses

This paper defines a method by which the colored petri net model of a concurrent system may be mapped to an equivalent rule-based production system. The mapping method defined is an intuitive process which results in a production system that clearly represents the petri net model.

In order to demonstrate the effectiveness and correctness of this method, the colored petri net representation of a part of a flexible manufacturing system of the Renault Car Company is mapped to an equivalent Sierra OPS5 rule-based production system.

An overview of petri nets and rule-based production systems is presented, along with a brief …

Diagnostics Software For Concurrent Processing Computer Systems, Robert L. Jones Iii

Electrical & Computer Engineering Theses & Dissertations

Diagnostics software for analyzing ATAMM based concurrent processing systems is presented in this thesis. ATAMM (Algorithm to Architecture Mapping Model) is a new model developed by researchers at Old Dominion University and the NASA-Langley Research Center. ATAMM is capable of modeling the execution of large grain algorithms on distributed data flow architectures. Investigating a real or simulated ATAMM based system requires the aid of software tools. The software tool presented in this thesis can evaluate the behavior and performance of an ATAMM based system. The tool graphically portrays algorithm activities and processor activities. The tool's measurement capabilities indicate computing speed, …

The Fat-Pyramid: A Robust Network For Parallel Computation, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

This paper shows that a fat-pyramid of area Theta(A) built from processors of size lg A requires only O(lg^2 A) slowdown in bit-times to simulate any network of area A under very general conditions. Specifically, there is no restriction on processor size (amount of attached memory) or number of processors in the competing network, nor is the assumption of unit wire delay required. This paper also derives upper bounds on the slowdown required by a fat-pyramid to simulate a network of larger area in the case of unit wire delay.

Maintaining Transaction Consistency In Hddbss Using Quasi Serializable Executions, Weimin Du, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.

Maintaining Quasi Serializability In Hddbss, Weimin Du, Ahmed K. Elmagarmid, Won Kim

Department of Computer Science Technical Reports

No abstract provided.

Preserving Data Integrity In Hddbss Using Quasi Serializable Executions, Ahmed K. Elmagarmid, Weimin Du

Department of Computer Science Technical Reports

No abstract provided.

Critical Issues In Multidatabase Systems, Ahmed K. Elmagarmid, Marek Rusinkiewicz

Department of Computer Science Technical Reports

No abstract provided.