A digital computer is characterized by the instruction set it executes. Each machine instruction is a bit pattern which is to be interpreted by the central processing unit CPU. The traditional way to interpret a machine instruction is to use random hardware. A contemporary approach is to install a program...
The need for and problems related to string processing are
discussed and a definition of the term "string" is derived. A
brief review of some existing string processing systems leads
to the presentation of a design for a string processing extension
to the programming language Pascal. A rationale for the...
Technological advances of the last three decades have caused an enormous increase in the amount of published and unpublished information generated by our society. This inflation has created the need for improved information management systems. Existing systems are inadequate primarily because they are discipline-oriented and lack the flexibility that is...
Tree systems are used in syntactic pattern recognition for
describing two-dimensional patterns. We extend results on tree
automata with the introduction of the subtree-invariant equivalence
relation R. R relates two trees when the appearance of one implies the
appearance of the other in similar trees. A new state minimizing
algorithm...
In this work we propose a computer based approach by means of
which the decision maker in Bendel State, Nigeria, can best be assisted
in the formulation of policies related to land use.
In Chapter I we briefly discuss the role of the computer in
planning and state the problem....
The information processing industry is one of the fastest growing, and most dynamic industries on the scientific as well as business scene, today. Progress in designing and applying computing systems has out raced progress in evaluating their performance. In order to circumvent this trend, there should be a simultaneous development...
This paper describes an investigation of a matrix algebraic method to determine isomorphism in pairs of undirected graphs. The method is described in some detail. The theoretical as well as the practical difficulties are given. It is shown that the method works for some cases. When the adjacency matrix of...
A new system called sequential/parallel matrix grammars
for two-dimensional pattern processing is introduced and studied.
Miscellaneous language operations such as union, catenation (row
and column), Kleene's closure (row and column) and substitutions
are investigated. The equivalence of sequential/parallel matrix
languages and finite-turn repetitive checking automata is established.
Hierarchies for both...
In analyses of multivariate data, a classification of the data into related groups is frequently desired. This is generally referred to as the clustering problem. It has been studied in detail and many clustering algorithms exist. Most of these algorithms, however, require experimenting with the actual data before satisfactory results...
Contemporary database systems are used in a variety of business applications requiring rapid retrieval of online data. When records contain unique information indexed by a single key, the retrieval operation can be simplified. However, when added generality and flexibility is needed, inverted files and sophisticated data models result in a...
This paper compares three classes of algorithms for finding
Hamiltonian circuits in graphs. Two of the classes are exhaustive
search procedures and this study finds them to have an exponential
dependence on the size of the graph. The third class of algorithms,
based on Warnsdorff's rule, is found to be...
This paper describes a Lesson Generating System for CAI, which, by relieving the course author from the burden of programming, provides an efficient means for developing courseware to augment classroom instruction.
The paper describes research on the representation of knowledge. The goal is to develop a formalism which can be used for the testing of hypotheses on the nature of human understanding and as a foundation or artificial intelligence programs. The ideas expressed herein are implemented in a program which converses...
MARLA is a collection of FORTRAN routines which
implements the Shannon-type-chess program with alphabeta
cutoffs occurring dynamically. Board positions
are updated incrementally. Also involved in position
analysis is a production system which models the human
chess player's advice-taking, theme, and chess learning
in a general sense. Interfacing these two sections,...
Interval arithmetic is applied to the problem of obtaining
rigorous solutions to integral equations on a computer. The
integral equations considered are the linear Fredholm equation of
the second kind and the nonlinear Urysohn equation. Techniques are
presented which enable the computer to find an approximate
solution, prove the existence...
The concept of a process is often used in connection with operations
of parts of a computer system. This thesis discusses processes
in terms of their use as representations of a physical object or system.
Five primitives are introduced as operators for allowing processes
to be run in a piecemeal...
The FLEX/REFLEX paradigm is applied to the description of a computer program system. The paradigm is shown to be relevant and appropriate to computer program systems and to advantageously display and structure the general hierarchical characteristics of computer program systems. Program systems characterized in the paradigm are described both holistically...
A cost reduction analysis is performed by coordinating
the exchange of LANDSAT (formerly ERTS) data between a CDC
3300 and a PDP8/L minicomputer. The LANDSAT data is displayed
on a 4002 Tektronix terminal by means of a grayscale output.
Large amounts of data and number manipulation are processed
in the...
A review of current computer performance and evaluation techniques reveals a lack of an acceptable analytic tool for optimal computer system performance and evaluation. A generalized approach to the formulation of a third generation computer system model is proposed. The approach is used to optimize computer resource utilization and to...
In this thesis we introduce alpha and beta tree acceptors,
generalizations of tree automata. The alpha tree acceptors recognize
a tree by final symbol and the beta tree acceptors by final state. We
show that alpha and beta tree acceptors recognize the same sets of
Gorn trees and demonstrate that...
A radix 2n non-restoring division algorithm is described. The
algorithm is designed to be compatible with hardware multiprecision
multiplication methods currectly used in high speed digital computers.
This enables the use of the same hardware, with only changes in
control logic, to be used to implement both multiplication and
division....
The design of checking experiments for sequential machines
which do not initially have a distinguishing sequence is investigated.
Improvem,Jnts are suggested to an existing method for
augmenting the output logic so that the machine acquires homogeneous
distinguishing sequences. To indicate how the procedure
may be implemented on a computer, elements...
The well-known local adjustment algorithm for training a
threshold logic unit, TLU, is extended to a local adjustment
algorithm for training a network of TLUs Computer simulations
show that the extension is unsatisfactory.
A new logic for a committee of TLUs, called modified veto logic,
and a local adjustment algorithm...
Specifications for a simulation language capable of modeling
fuzzy systems are presented. Actions occurring in the running
model are to be displayed on a graphics terminal in the .form of
modified E-nets. The concept of partial execution of predicates
is introduced in connection with the underlying continuously valued
logic. Fuzzy...
This thesis describes a syntax-directed compiler-compiler
called COMCOM which has been implemented by the author on the CDC
3300 under the OS-3 operating system. The theory and terminology
of the parsing method and compiler-compilers in general are briefly
discussed. COMCOM uses Floyd's operator precedence bottom-up
parsing technique which avoids backup...
This paper continues exploration in the area of
programming for parallel computers. The appendix to the
paper contains an extensive survey of the literature related
to parallel computers and parallel programming techniques.
The paper itself presents a new approach to solving
the Laplace equation on a. parallel computer. A new...
The project herein described, presents the results of an investigation
in the relatively new and expanding field of computer stimulated
learning machines for use in pattern recognition.
A learning machine, one that benefits from its past experience
was devised in computer program form. It may be described as a
Piecewise-Linear,...
COMPLOT is a versatile set of plot drivers designed to be used
on a Tekterminal, Calcomp, or Hewlett Packard plotter in a time-sharing
environment. Although the hardware aspects of each plotting
device are quite different, COMPLOT allows the plotting devices to
be treated as if they were the same.
The purpose of this paper is to discuss some of the theory of Boolean matrices and apply this theory to construct contact networks by using algebraic methods.
The first section of this paper (Chapter I to III) describes Boolean algebra and its properties, the theory of Boolean matrices, and the...
The material in this paper is divided into the following four chapters for convenience. Chapter 1 explains, how the idea of fault testing changed from testing the machine instructions to testing the hardware in logic circuits. Chapters 2, 3 and 4 present the different approaches considered, namely:
1. Path sensitizing...