Outlines various subtraction methods, such as the decomposition method, equal-addends method, and low-stress algorithm. Describes a subtraction method by addition of complements. Discusses the advantages and disadvantages of the method. (YP)

The application of operations research and computers is providing school bus routing and scheduling to five California counties. Illustrates the system requirements, steps for computerized calculations, a sample bus assignment report, and three data files. (MLF)

Develops a general computer algorithm to obtain a magic square having a number of rows that is a multiple of four. Presents a BASIC program and sample runs. (YP)

An extension of component analysis to longitudinal or cross-sectional data is presented. Components are derived under the restriction of invariant and/or stationary compositing weights. Multiple occasion and multiple group analyses, the computing algorithm, component pattern and structure matrices, and an example are discussed. (TJH)

Discusses the effect of including relevance data on the calculation of term discrimination values in bibliographic databases. Algorithms that calculate the ability of index terms to discriminate between relevant and non-relevant documents are described and tested. The results are discussed in terms of the relationship between term frequency and…

Reviews recent research into the use of hierarchic agglomerative clustering methods for document retrieval. The topics discussed include the calculation of interdocument similarities, algorithms used to implement clustering methods on large databases, validity testing of document hierarchies, appropriate search strategies, and other applications…

Describes the use of a highly parallel array processor for pattern matching operations in a bibliographic retrieval system. The discussion covers the hardware and software features of the processor, the pattern matching algorithm used, and the results of experimental tests of the system. (37 references) (Author/CLB)

Discussion of how to teach programming skills to novice programmers focuses on the use of a program animator that uses a copies model of recursion to teach the recursive function. Various mental models are reviewed; testing the recursion animator is described; and possibilities for further research are suggested. (12 references) (LRW)

Discusses the feasibility of building intelligent rule- or weight-based algorithms into general-purpose software for interactive thesaurus navigation. Previous research is surveyed; practical investigations in thesaurus navigation and query enhancement are described; and implications for automatic or intelligent thesaurus navigation are…

Call for reforming mathematics teaching has been sounded loudly and strongly. Change from teaching standard algorithms to having children invent their own methods requires major pedagogical shift. Teachers must trust students' inventiveness and ability to make sense of numerical situations, be committed to thinking and reasoning as cornerstone of…

Discusses the development of successful pricing algorithms for cooperative library automation projects. Highlights include desirable characteristics of pricing measures, including simplicity and the ability to allow for system growth; problems with transaction-based systems; and a review of the pricing strategies of seven library consortia.…

This paper focuses on similarities of optimal design of fixed-form tests, adaptive tests, and testlets within the framework of the general theory of optimal designs. A sequential design procedure is proposed that uses these similarities to obtain consistent estimates for the trait level distribution. (SLD)

Practical problems with multilevel techniques are discussed. These problems relate to terminology, computer programs employing different algorithms, and interpretations of the coefficients in either one or two steps. The usefulness of hierarchical linear models (HLMs) in common situations in educational research is explored. While elegant, HLMs…

The dynamic factor model proposed by P. C. Molenaar (1985) is exhibited, and a dynamic nonstationary factor model (DNFM) is constructed with latent factor series that have time-varying mean functions. The use of a DNFM is illustrated using data from a television viewing habits study. (SLD)

Describes algorithms used in the computer program LOGIMO for obtaining maximum likelihood estimates of the parameters in loglinear models. These algorithms are also useful for the analysis of loglinear item-response theory models. Presents modified versions of the iterative proportional fitting and Newton-Raphson algorithms. Simulated data…