Designs for sequential sampling procedures that adapt to cumulative information are discussed. A familiar illustration is the play-the-winner rule in which there are two treatments; after a random start, the same treatment is continued as long as each successive subject registers a success. When a failure occurs, the other treatment is used until…

Useful programming tricks are suggested to allow the reduction of many equations and non-polynomial-like expressions and the subsequent application of the mathematical algorithms. (Author)

Monte Carlo procedures were used to investigate the properties of a nonmetric multidimensional scaling algorithm when used to scale an incomplete matrix of dissimilarities. Recommendations for users wishing to scale incomplete matrices are made. (Author/RC)

A modified method of regrouping the minuend for subtraction is described. This more flexible method decreases the number of steps in the subtraction process and in checking the regrouping. (SD)

The error-correcting algorithm described was constructed to examine subject headings in online catalog records for common errors such as omission, addition, substitution, and transposition errors, and to make needed changes. Essentially, the algorithm searches the authority file for a record whose primary key exactly matches the test key. If an…

This paper discusses several instructional issues, defines the benefits of algorithmic prescriptions, and examines their effectiveness and efficiency. An experimental study asked 77 undergraduates to master and utilize one of three forms of an algorithm: a prose discourse, a flowchart procedure, or a mastery-inducing flowchart technique. Also…

Addressing the problem of protecting confidential information and data stored in computer databases from access by unauthorized parties, this paper details coding schemes which present such astronomical work factors to potential code breakers that security breaches are hopeless in any practical sense. Two procedures which can be used to encode for…

This study of linguistic change is done within the "dynamic paradigm" of linguistic description, in which the strict dichotomy between diachronic and synchronic linguistics found in "static paradigms" is not maintained. The chief purpose here is to indicate how rate could be built into a linguistic description of sound change, such change being…

In generating sentences by means of a transformational grammar, it is necessary to analyze trees, testing for the presence or absence of various structures. This analysis occurs at two stages in the generation process--during insertion of lexical items (more precisely, in testing contextual features), and during the transformation process, when…

This report describes the initial evaluation of a text compression algorithm against computer assisted instruction (CAI) material. A review of some concepts related to statistical text compression is followed by a detailed description of a practical text compression algorithm. A simulation of the algorithm was programed and used to obtain…

Answers and examples are given to sixteen questions related to traditional ways of performing the operations of arithmetic. (MP)

An algorithm for item analysis in which item discrimination indices have been defined for the distractors as well as the correct answer is presented. Also, the concept of convergent and discriminant validity is applied to items instead of tests, and is discussed as an aid to item analysis. (Author/JKS)

This introductory article defines and delimits expert systems. The discussion covers the concepts of artificial intelligence, the components of an expert system, and the significance of expert systems when compared to more traditional decision making tools. (CLB)

Describes the use of PROLOG to program knowledge-based information retrieval systems, in which the knowledge contained in a document is translated into machine processable logic. Several examples of the resulting search process, and the program rules supporting the process, are given. (10 references) (CLB)