Two sequences of activities were developed to provide instruction on the algorithms for addition and subtraction of two-digit numbers. In the integrated sequence (I) the mechanics of "carrying" and "borrowing" were treated as a single process "regrouping." In the sequential treatment (S) the addition algorithm was developed before the subtraction…

Two sequences of activities were developed to provide instruction on the algorithms for addition and subtraction of two-digit numbers. In the integrated sequence (I) the mechanics of "carrying" and "borrowing" were treated as a single process "regrouping." In the sequential treatment (S) the addition algorithm was developed before the subtraction…

Sketchcode is a metaprograming pseudo-language documentation technique intended to simplify the process of program writing and debugging for both high and low-level users. Helpful hints and examples for the use of the technique are included. (CMV)

A reproduction of a paper first issued in 1967. Algorithms are characterized as being a special kind of problem solving procedure which can be verbalized. (Author/STS)

A preliminary investigation of parameter estimation for planned incomplete data in educational research used an algorithm to estimate correlations for each of two sets of six variables, based on correlational data obtained from previous studies. The algorithm gave the estimator that is maximum likelihood for data with a multivariate normal…

The cross-validated classification accuracies of three predictor weighting strategies (least squares, ridge regression, and reduced rank) were compared under varying simulated data conditions for the two-group classification problem. Results were somewhat similar to previous findings with multiple regression when absolute rather than relative…

In negotiating to obtain a sample of records from a computer file, it is important to be able to present a simple program that will produce a representative and valid sample. This article describes two procedures: (1) an interval selection method; and (2) a random numbers file. (JAZ)

Describes a model for a front end query processor to deal with incomplete information in a database. The effectiveness of the processor in restricting the number of objects to be processed in a query and in aiding the interpretation of a query is discussed. (26 references) (Author/CLB)

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)

Describes an algorithm for the calculation of term discrimination values that may be used when the interdocument similarity measure used is the cosine coefficient and when the document representations have been weighted using one particular term weighting scheme. (7 references) (Author/CLB)

Linear ciphers, substitution ciphers, public-key cryptosystems, and trapdoor knapsacks are each discussed. (MNS)

A prescriptive theory of teaching based upon an information processing model of human functioning is outlined. Based on teaching functions, defined as necessary conditions of learning, a general teaching algorithm is presented and its use demonstrated. (Author/MT)

Using examples of data from the areas of information retrieval and of multivariate data analysis, six hierarchic clustering algorithms (single link, median, centroid, group average, complete link, Wards's) are examined and evaluated by using three proposed coefficients of hierarchic structure. Nine references are cited. (EJS)

The algo-heuristic theory is concerned with identifying unobservable cognitive processes and their unconscious component cognitive operations, including learning how to describe them algorithmically and heuristically, and how to devise specific instructional tools (algorithmic and heuristic) to develop cognitive processes much faster. (BW)

The implications of some major linguistic and semiotic concepts for the machine manipulation of natural language text are examined. It is proposed that the study of meaning should contribute to the development of sophisticated algorithms for machine indexing. (Author)