A BASIC computer program is described which computes the Stuart-Maxwell test with its chi-square value and associate probability level. Following a significant chi-square test, the user has the option of performing multiple comparisons using McNemar's test for the significance of change. (Author)

This paper describes a set of four BASIC computer programs for computing the Rand index of cluster similarity. The routines calculate the unadjusted Rand Index; the separate routines are designed to handle problems of different sizes and alternate methods of data storage. (Author)

Describes a microcomputer-based string index format generated from concept networks using multiple search terms. Link weighting is highlighted as a method to decide which term appears first so the entry reflects the classification implied by the search specification. The computer software used for this system is briefly described. (Author/LRW)

Proposes that error rates in indexing using string index languages such as NEPHIS might be reduced at relatively low cost by having the indexer enter strings via a microcomputer system which could provide simple validation and feedback in the form of graphic displays of concept links. (Author/FM)

Describes a system that provides online access to holdings information for more than 4,500 journals on a single self-executing diskette. A brief discussion of data compression is offered, along with program listings in both BASIC and C. (MES)

A description of a Mokken test program to test the robustness of nonparametric Stochastic scales is presented. For each sample and the whole population, different scale statistics (both on scale and on item level) are computed recursively. A statistic T is presented for testing the robustness of the scales in the samples. (Author)

How set theory, combinatorics, probability, and the study of algorithms can be used in solving two problems is described in detail. Three computer programs are listed. (MNS)

How to use the electronic spreadsheet (e.g., VisiCalc) creatively is discussed, with computer printouts for a number of algorithms. (MNS)

Describes design and presents examples of industrial use of small expert systems and guidelines for choosing problems which lend themselves to small tool solutions. Use of microcomputer facilitated decision tables to diagnose and categorize people, things, and issues is suggested, and development of three decision table formats is described. (MBR)

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…

Describes the simulation of a nearest neighbor searching algorithm for document retrieval using a pool of microprocessors. Three techniques are described which allow parallel searching of a binary search tree as well as a PASCAL-based system, PASSIM, which can simulate these techniques. Fifty-six references are provided. (Author/LRW)

Four methods of filling a square using programing with Logo are presented, with comments on children's solutions. Analysis of the mathematical or programing concepts underlying a few simple algorithms is the focus. (MNS)

Described is a simple algorithm that can be used for the input, arithmetic manipulation, and output of large integers in their exact representations. Three BASIC programs are included that apply this method to the problem of multiplication of large integers, computation of factorials, and the generation of palindromic integers. (MNS)

Discussion of graph-drawing algorithms compares and evaluates five algorithms for generated automatic graphic display of sentence dependency structures that have been implemented in the TEXTNET text structure management system. Evaluation criteria are discussed, and a test of the algorithms with a database of newspaper articles is described. (16…

Presents algorithms for the simulation and motion display of the three basic kinematic devices: (1) four bar linkages; (2) the slider crank; and (3) the inverted slider crank mechanisms. The algorithms were implemented on a Commodore-VIC 20 microcomputer system with 6500 bytes of available memory. (Author/JN)