Describes a modified frequency-sensitive self-organization (FSO) algorithm for image data compression and the associated VLSI architecture. Topics discussed include vector quantization; VLSI neural processor architecture; detailed circuit implementation; and a neural network vector quantization prototype chip. Examples of images using the FSO…

Analyzes the amount of compression possible when arithmetic coding is used for text compression in conjunction with various input models. Algorithms are analyzed; modeling effects are considered; scaling is discussed; higher order models are examined, including prediction by partial matching; and coding effects are described. (34 references) (LRW)

Identifies four components of a good predictive lossless image compression method: (1) pixel sequence, (2) image modeling and prediction, (3) error modeling, and (4) error coding. Highlights include Laplace distribution and a comparison of the multilevel progressive method for image coding with the prediction by partial precision matching method.…

Presents new methods for compressing bit matrices in large information retrieval systems which exploit possible correlations between rows of words and columns of documents. Three encoding methods are tested and compared--Shannon-Fano, arithmetic, and Huffman--and an appendix discusses binomial coefficients. (20 references) (LRW)

Uses Kintsch's proposition-based construction-integration theory of discourse comprehension to detail the user coding operations that occur in each of the three subsystems (Perception, Comprehension, Application) in which users process an information retrieval systems (IRS) message. Describes an IRS device made up of two separate parts that enable…

Two accounts explain why studying pictures reduces false memories within the Deese-Roediger-McDermott paradigm (J. Deese, 1959; H. L. Roediger & K. B. McDermott, 1995). The impoverished relational-encoding account suggests that studying pictures interferes with the encoding of relational information, which is the primary basis for false memories…

Discusses the problems of compressing a large textual database for storage on CD-ROM. A text-compression algorithm is presented, new algorithms for compression of indices are described, and the ARTFL (American and French Research on the Treasury of the French Language) database is used as an example. (14 references) (LRW)

This paper examines the dual coding hypothesis, a model of the coding of visual and textual information, from the perspective of a mass media professional, such as a teacher, interested in accurately presenting both visual and textual material to a mass audience (i.e., students). It offers an extension to the theory, based upon the various skill…

The 4th International Conference on Educational Data Mining (EDM 2011) brings together researchers from computer science, education, psychology, psychometrics, and statistics to analyze large datasets to answer educational research questions. The conference, held in Eindhoven, The Netherlands, July 6-9, 2011, follows the three previous editions…