Discusses how performance technologists, or trainers, can provide more impact in reducing field performance deficiencies by gathering feedback from the field regarding training matters. A feedback generator is described that is expressed in terms of an algorithm and helps point to solutions to improve productivity. (LRW)

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)

Defines a set of algorithms providing the minimum amount of information necessary for computer generation of all forms in the German lexicon and detection of spelling errors, based on a method of compressing lexical information. (Author/CB)

Reviews the development of artificial intelligence systems and the mechanisms used, including knowledge representation, programing languages, and problem processing systems. Eleven books and 6 journals are listed as sources of information on artificial intelligence. (23 references) (CLB)

Presents a mathematical theory that can be used to define concentration places of objects within unordered classes. The application to research on the evolution of journals and subject areas is illustrated, and an online method of calculating concentration evolution is described. (1 references) (CLB)

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)

Circuits are described, with discussion on how to help students find the algorithms to solve a variety of problems involving circuits. (MNS)

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)

A possible method of derivation of prescriptions for solving problems, found in Babylonian cuneiform texts, is presented. It is a kind of "geometric algebra" based mainly on one figure and the manipulation of or within various areas and segments. (MNS)

Computational algorithms from American textbooks copyrighted prior to 1900 are presented--some that convey the concept, some just for special cases, and some just for fun. Algorithms for each operation with whole numbers are presented and analyzed. (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)

Shows that the rules of thumb for propagating significant figures through arithmetic calculations frequently yield misleading results. Also describes two procedures for performing this propagation more reliably than the rules of thumb. However, both require considerably more calculational effort than do the rules. (JN)

Presents a modification function for weights of descriptors for documents in fuzzy retrieval systems which includes some desirable properties that are lacking in the model proposed by Choros and Danilowicz in their study on relative indexing. (MBR)

Discusses properties of multiple attribute tree (MAT) and inverted file structures; establishes suitability of MAT data structure for bibliographic files using worst-case performance measures; provides arguments to establish MAT average case superiority; and proposes an efficient adaptation of MAT data structure to exploit special features of MAT…

Describes an algorithm used at the University of Ottawa to create examination schedules that are not only conflict free and minimize number of consecutive examinations for individual students, but provide for the scheduling of certain proper subsets of examinations into proper time slots and minimal overall number of consecutive examinations. (MBR)