Cognitive load theory suggests that the manner in which information is presented can interfere with learning. For example, in studying equations with unfamiliar notations, a heavy extraneous cognitive load is generated because mental integration of notations and meanings is required. Discusses four experiments with high school students designed to…

Explains how to improve visual displays employed in school finance by examining a theoretical framework and applying it to the displays. Discusses and illustrates important display principles based on William Cleveland's ideas about decoding/encoding, length judgments, distance, detection, and superimposed curves; and Edward Tufte's work on data…

Presents an approach to automatic matching and linkage of citations between databases which applied 14 coding techniques and measured their effectiveness in terms of efficiency of retrieval of duplicates with minimal false hits, reliability, and performance. (EAM)

Discusses origins of Transborder Data Flows (TDFs) as an international problem in the early 1970s. Shows how technological development in telecommunications and networks has made regulation more complex and urgent. Recommends the internationalization of the Key Escrowed Encryption System (KEES) and the development of broad international TDF…

Results from a study involving 34 undergraduates supported the prediction from Paivo's dual coding theory (1986) that imaginal elaborations during lectures assist students' recall of both episodic and declarative information. The prediction that episodic memories would mediate retention of declarative information from the lecture was not…

Discusses the integration of Standard General Markup Language, Hypertext Markup Language, and MARC format to parse classified analytical bibliographies. Use of the resulting electronic knowledge constructs in local library systems as maps of a specified subset of resources is discussed, and an example is included. (LRW)

Results of two experiments involving 206 upper elementary school students supported the hypothesis that less-skilled readers suffer working memory deficits that contribute to comprehension problems independent of their problems in phonological coding. Results also suggest that constraints in an executive system may contribute to reading…

Describes the Text Encoding Initiative (TEI) project and the TEI header, which documents electronic text in a standard interchange format understandable to both librarian catalogers and nonlibrarian text encoders. The form and function of the TEI header is introduced, and its relationship to the MARC record is explained. (10 references) (KRN)

Describes a method for coding themes directly from audiotapes without transcription and issues and methods by which reliability can be established. A study of concerns of professionals being trained on 11 school-based support teams coded by 2 raters and based on 19 hours of audiotaped interviews illustrates the method. (SLD)

Examination of two-letter high-point code frequency tables of four Self-Directed Search samples and Holland's translation of occupational titles verified the fit of the circumplex model, supporting Holland's person-environment hypothesis. (SK)

Functional relations underlying map-passage learning were studied through the effects of structural hierarchy on recall for 80 undergraduates. Recall for passage content was greatest when content was at the top of the map and passage structures. Implications for instruction are discussed. (SLD)

Presents a new image compression algorithm that employs some of the most successful approaches to adaptive lossless compression to perform adaptive online (single pass) vector quantization with variable size codebook entries. Results of tests of the algorithm's effectiveness on standard test images are given. (12 references) (KRN)

Evaluates the performance of different methods of data compression coding in several situations. Huffman's code, arithmetic coding, fixed codes, fast approximations to arithmetic coding, and splay coding are discussed in terms of their speed, memory requirements, and proximity to optimal performance. Recommendations for the best methods of…

Presents two new algorithms for performing arithmetic coding without employing multiplication and discusses their implementation requirements. The first algorithm, suitable for an alphabet of arbitrary size, reduces the worst case excess length to under 0.8%. The second algorithm, suitable only for alphabets of less than 12 symbols, allows even…

Presents an inference algorithm that produces a weighted finite automata (WFA), in particular, the grayness functions of graytone images. Image-data compression results based on the new inference algorithm produces a WFA with a relatively small number of edges. Image-data compression results alone and in combination with wavelets are discussed.…