A clustering algorithm which is tree-like in structure, and is based on user queries, is presented. It is compared to some existing algorithms and is found to be superior. (Author)

An algorithmic language (ALGAMS) was proposed by the group on programing automation for medium type machines. The language is a subset of ALGOL-60. The paper discusses the syntax and semantics of ALGAMS. (Author/GO)

Most optimization problems of any degree of complexity must be solved using a computer. In the teaching of dynamic programing courses, it is often desirable to use a computer in problem solution. The solution process involves conceptual formulation and computational Solution. Generalized computer codes for dynamic programing problem solution…

Pitch-synchronous, time-domain operation on digitized waveforms of human speech produces artificial changes in prosodic parameters, especially fundamental frequency and rhythm. Pitch of voiced segments is raised or lowered by an algorithm which truncates or "pads," respectively, each pitch period in the stored vector by an appropriate…

This study has investigated some pattern recognition capabilities of devices consisting of arrays of cooperating elements acting in parallel. The problem of recognizing straight lines in general position on the quadratic lattice has been completely solved by applying parallel acting algorithms to a special code for lines on the lattice. The…

Six control structures are used in teaching a college Fortran programing course: (1) simple sequences of instruction without any control statement, (2) IF-THEN selection, (3) IF-THEN-ELSE selection, (4) definite loop, (5) indefinite loop, and (6) generalized IF-THEN-ELSE case structure. Outlines, instead of flowcharts, are employed for algorithm…

This article is a tutorial on writing a simulator--the example used is a casino. The nontechnical, step by step approach is designed to enable even non-programmers to understand the design of such a simulation. (Author)

The general characteristics of algorithms are outlined and related to instructional applications. Major issues and research questions are discussed. (Author/STS)

An algorithm and associated FORTRAN-77 computer subroutine are described for computing Goodman and Kruskal's tau-b statistic along with the associated nonasymptotic probability value under the null hypothesis tau=O. (Author)

Latent class analysis is formulated as a problem of estimating parameters in a finite mixture distribution. The EM algorithm is used to find the maximum likelihood estimates, and the case of categorical variables with more than two categories is considered. (Author)

A new algorithm to obtain the least squares solution in common factor analysis is presented. It is based on the up-and-down Marquadt algorithm developed by the present authors. Experiments in the use of the algorithm under various conditions are discussed. (Author/JKS)

Presents a technique for the numerical inversion of Laplace Transforms and several examples employing this technique. Limitations of the method in terms of available computer word length and the effects of these limitations on approximate inverse functions are also discussed. (JN)

Reviews what information and software sciences have thus far accomplished in search for empirical regularities and laws and examines what theories have been developed to explain and account for regularities and laws. Specific laws and theories of information highlighted are those of Zipf, Bradford, Lotka, Mandelbrot, and Simon. (Forty references)…

Describes the process used to establish a new set of boundaries for school board subdistricts. (Author)