Contribution: This research illuminates information entropy's efficacy as a pivotal educational tool in programming, enabling the precise quantification of algorithmic complexity and student abstraction levels for solving problems. This approach can provide students quantitative, comparative insights into the differences between optimal and…

Online discussion research has mainly been conducted using case methods. This article proposes a method for comparative analysis based on network metrics such as information entropy and global network efficiency as more holistic measures characterizing social learning group dynamics. We applied social learning optimization analysis of networks…

Discusses the minimum average codeword length coding under the constraint that the codewords are monotonically nondecreasing in length. Bounds on the average length of an optimal monotonic code are derived, and sufficient conditions are given such that algorithms for optimal alphabetic codes can be used to find the optimal monotonic code. (six…

Presents a model and experimental results of a new one-phase technique for compression text files that is a modification of the Ziv and Lempel compression scheme. The description includes the use of a subword dictionary that is periodically reorganized based on information theory and structural linguistics principles. (29 references) (Author/CLB)

Views information as residual or catalytic form of energy which regulates other forms of energy in natural and artificial systems. Parallel human information processing (production systems, algorithms, heuristics) and information measurement are discussed. Suggestions for future research in area of parallel information processing include a matrix…

Describes a detailed algorithm for fast text compression. Related to the PPM (prediction by partial matching) method, it simplifies the modeling phase by eliminating the escape mechanism and speeds up coding by using a combination of quasi-arithmetic coding and Rice coding. Details of the use of quasi-arithmetic code tables are given, and their…

Describes the design of optimal tree-structured vector quantizers that minimize the expected distortion subject to cost functions related to storage cost, encoding rate, or quantization time. Since the optimal design problem is intractable in most cases, the performance of a general design heuristic based on successive partitioning is analyzed.…

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)

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.…

Addresses problem of developing machine-based information system capable of indicating one document, out of a set of documents written in natural language, which shows maximal degree of homeosemy (relationship in meaning between two texts language-fragments ) toward natural language query. Linguistic aspects, information traces, trigrams,…

Analyzes the properties of genetic sequences that cause the failure of classical algorithms used for data compression. A lossless algorithm, which compresses the information contained in DNA and RNA sequences by detecting regularities such as palindromes, is presented. This algorithm combines substitutional and statistical methods and appears to…

Explores potential of mathematical theory of communication for information science and examines question of how to encode a message at time it is encountered for subsequent recall. Examples of problem, a prototype computer program and experiment, coding as embedding in associational nets, and nature of information are discussed. (Nine references.)…