This approach to task analysis includes descriptions of (1) inputs, outputs, and jobs; (2) flow of materials and decisions between jobs; (3) inputs, major tasks, and outputs of each job; (4) sequence of steps for major tasks; (5) heuristics/algorithms for each sequence step; and (6) information needed to use heuristics algorithms. (EAO)

A previously developed program for the HP-41C programmable calculator is extended to handle models of differential and difference equations with multiple eigenvalues. How to obtain difference equation solutions via the Z transform is described. (MNS)

A technique for doing long division without the usual estimation difficulty is presented. It uses multiples of 2 combined with a recording technique. (MNS)

Describes a computer-assisted scheduling algorithm for college courses and faculty. The method considers such issues as availability of lecturers, preferred times for courses, and time conflicts. Samples of the schedules are included. (JJD)

The repetitious nature of music is thought to be very similar to the repetitious nature of computer algorithms. Subroutines are seen to be very effectively applied to music notation, through reducing repetitious entry and the amount of memory required to represent a musical score. Examples of subroutine use are provided. (MP)

Addresses the problem of systematic biases which affect the way that individuals construct and modify search queries on online retrieval systems, and suggests a searching algorithm that helps to avoid the effect of those biases. (FM)

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)

A method for solving inequalities of degree greater than one is described. (MK)

Early calculating methods and devices are discussed. These include finger products, the abacus, ancient multiplication algorithms, Napier's bones, and monograms. (MP)

A few examples are discussed of situations where some solution to writing a computer program for an algorithmic problem is immediately evident, but the best solution is some distance away. (MP)

This investigation concerns the repeated application of the rule "take the sum of the squares of the digits." (MP)

Described is a Fortran computer program for an alternative algorithm for Thurstone's pair comparisons method. This algorithm provides an improved capacity for handling indeterminate proportions of one and zero as well as untruncated estimates of population scale values. (Author/JKS)

Presents a computational study of children's acquisition of word-to-meaning mappings, approximates this task as a mathematical problem, and presents an algorithm for solving the problem, illustrating the algorithm's operation on a small example. Notes that computational simulations demonstrated the robustness of the algorithm and illustrated how…

Shows how to characterize language learning in a finite parameter space, such as in the "principles-and-parameters" approach, as a Markov structure. Explains how sample complexity varies with input distributions and learning regimes. Finds that a simple random-step algorithm always converges to the right target language and works faster than a…

Discussion of automated information services focuses on information classification and collaborative agents, i.e. intelligent computer programs. Highlights include multi-agent systems; distributed artificial intelligence; thesauri; document representation and classification; agent modeling; acquaintances, or remote agents discovered through…