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...