Explains transliteration and describes Greeklish, a Windows application that automatically produces English to Greek transliteration and back-transliteration (retransliteration), based on an algorithm with a table of associations between the two character sets. Describes how the table can be modified for personal preferences and discusses its…

Two Statistical Analysis System (SAS) macros are presented that perform the modified principal components approach of L. R. Tucker (1966) to modeling generalized learning curves analysis up to a rotation of the components. Three SAS macros are described that rotate the factor patterns to have characteristics Tucker considered desirable. (SLD)

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…

Describes a system that provides online access to holdings information for more than 4,500 journals on a single self-executing diskette. A brief discussion of data compression is offered, along with program listings in both BASIC and C. (MES)

In his early exposition of path analysis, Duncan (1966) noted that the method "provides a calculus for indirect effects." Despite the interest in indirect causal effects, most users treat them as if they are population parameters and do not test whether they are statistically significant. Sobel (1982) has recently derived the asymptotic…

An algorithm is presented for the best least-squares fitting correlation matrix approximating a given missing value or improper correlation matrix. The proposed algorithm is based on a solution for C. I. Mosier's oblique Procrustes rotation problem offered by J. M. F. ten Berge and K. Nevels (1977). It is shown that the minimization problem…

Homogeneity analysis, or multiple correspondence analysis, is usually applied to k separate variables. In this paper, it is applied to sets of variables by using sums within sets. The resulting technique is referred to as OVERALS. It uses the notion of optimal scaling, with transformations that can be multiple or single. The single transformations…

A description of a Mokken test program to test the robustness of nonparametric Stochastic scales is presented. For each sample and the whole population, different scale statistics (both on scale and on item level) are computed recursively. A statistic T is presented for testing the robustness of the scales in the samples. (Author)

Considers three powerful techniques--heuristics, context trees, and search via backward chaining--that a knowledge engineer might employ to develop an expert system to automate performance engineering, i.e., the branch of instructional technology that focuses on the problems of business and industry. (MBR)

A method for checking college students' completion of program and graduation requirements by computer is outlined. The procedure operates by having degree programs defined in tables and is simple enough to be achieved by junior program staff without the need for programmers and analysts. (MSE)

Discusses an algorithm for developing problem solving simulations using microcomputers, and describes both the components of the simulation algorithm and the user interface. Examples of simulation and programming methods are presented. (MBR)

How set theory, combinatorics, probability, and the study of algorithms can be used in solving two problems is described in detail. Three computer programs are listed. (MNS)

Built-in data structures are the registers and memory words where binary values are stored; hard-wired algorithms are the fixed rules, embodied in electronic logic circuits, by which stored data are interpreted as instructions to be executed. Various topics related to these two basic elements of every computer program are discussed. (JN)

Provides several algorithms that use extended precision methods to compute large factorials exactly. The programs are written in BASIC and PASCAL. The approach used for computing N considers how large N is, how the built-in limitation on exact integer representation can be bypassed, and how long it takes to compute N. (JN)

Presents an example of mathematics from an algorithmic point of view, with emphasis on the design and verification of this algorithm. The program involves finding roots for algebraic equations using the half-interval search algorithm. The program listing is included. (JN)