After a brief discussion of Pascal's triangle and description of four methods of hand construction, the author provides FORTRAN and BASIC programs for computer construction based on recursive definition. (SD)

THE OBJECTIVE OF THIS PROJECT WAS TO DEVISE AN ALGORITHM FOR A STEM RECOGNITION PROGRAM DESIGNED TO SEARCH FOR THE ROOT OF ANY HEBREW WORD AS WELL AS TO DETECT INNER CHANGES ON THE GIVEN ROOT. SUCH AN ALGORITHM COULD BE USED IN LIBRARY CATALOGING AND IN CREATING INDEXES AND CONCORDANCES OF TEXTS IN THE HEBREW LANGUAGE. IN THIS STUDY THE HEBREW…

Network Analysis is an observational system focusing on the relationships of individuals within a system--their subgroups, their leaders, and the frequency of their communications. The strength of relationships can be measured by examining the incidence and duration of intercommunications. Using data accumulated by questioning each member of the…

MLISP (meta-LISP) is a high level list-processing and symbol-manipulation language based on the programing language LISP (List Processor). MLISP programs are translated into LISP programs and then executed or compiled. MLISP exists for two purposes: (1) to facilitate the writing and understanding of LISP programs; (2) to remedy certain important…

A comprehensive system for transformational grammar has been designed and is being implemented on the IBM 360/67 computer. The system deals with the transformational model of syntax, along the lines of Chomsky's "Aspects of the Theory of Syntax." The major innovations include a full and formal description of the syntax of a transformational…

The Maryland Refutation Proof Procedure System (MRPPS) is an interactive experimental system intended for studying deductive search methods. Although the work is oriented towards question-answering, MRPPS provides a general problem solving capability. There are three major components within MRPPS. These are: (1) an inference system, (2) a search…

Presents a justification of the belief that science and art can be successfully combined. The computer's merits are viewed as a potential modelbuilder for the formalization of aesthetic concepts. The rest of the paper details recent and current research on such uses of the machine. (VT)

Following a discussion of derivative versus assignment indexing, use of roles, and concept behind Preserved Concept Indexing System, features of PERMDEX (microcomputer program to assist in creation of permuted printed index) are described including indexer input and prompts, the shunting algorithm, and sorting and printing routines. Fourteen…

The article is concerned with developing the Whitehead and Eldars algorithm for problems on more than one floor and an algorithm for the definition of circulation routes in computer-developed building plan arrangements. (Author)

Provides a solution method for the problem of finding an optimal traffic network in its simplest form where there are no congestion costs. (Author)

The program with extensive annotation is available in an unpublished dissertation (Schabert, 1970). (Authors)

A traditional question is whether or not computers shall ever think like humans. This question is redirected to a discussion of whether computers shall ever be truly creative. Creativity is defined and a program is described that is designed to complete creatively a series problem in mathematics. (MP)

There are many uses for the shortest path algorithm presented which are limited only by our ability to recognize when a problem may be converted into the shortest path in a graph representation. (Author/TG)