Imagine a student using an intelligent tutoring system. A researcher records the correctness and time of each of your attempts at solving a math problem, nothing more. With no names, no birth dates, no connections to the school, you would think it impossible to track the answers back to the class. Yet, class sections have been identified with no…

Blockchain has emerged as a transformative technology, from its beginning as the basis of cryptocurrencies to wider applications in areas such as property registration and insurance due to its characteristic as a distributed ledger which can remove the need for a trusted third party to facilitate transaction. This spread of the technology to new…

Information and communication technology are well known rapid growing industry in this decade. That is nearly the same as fast as growth in costs in education. Therefore, many people have been forced to find alternative ways to meet their education needs. Innovations of distance education create a new way to provide learning content, unlimited…

This paper presents a model for conducting Internet of Things (IoT) classes based on a web-service oriented cloud platform. The goal of the designed model is to provide university students with knowledge about IoT concepts, possibilities, and business models, and allow them to develop basic system prototypes using general-purpose microdevices and…

Federal agencies are increasingly using electronic means to create, exchange, and store information, and in doing so, they frequently create federal records: that is, information, in whatever form, that documents government functions, activities, decisions, and other important transactions. As the volume of electronic information grows, so does…

Discusses the adaptive compression of computer files of numerical data whose statistical properties are not given in advance. A new lossless coding method for this purpose, which utilizes Adelson-Velskii and Landis (AVL) trees, is proposed. The method is effective to any word length. Its application to the lossless compression of gray-scale images…

Examines two models to study the consequences for coding efficiency of sample fluctuations, a specific type of error in the statistics on which data compression codes are based. The possibility that random fluctuation can be exploited for data compression is discussed. (six references) (KRN)

Describes a method for compressing tomographic images obtained using Positron Emission Tomography (PET) and Magnetic Resonance (MR) by applying transform compression using all available dimensions. This takes maximum advantage of redundancy of the data, allowing significant increases in compression efficiency and performance. (13 references) (KRN)

Discusses a flexible, high performance subband coding system. Residual vector quantization is discussed as a basis for coding subbands, and subband decomposition and bit allocation issues are covered. Experimental results showing the quality achievable at low bit rates are presented. (13 references) (KRN)

The preservation of digital data for the long term presents a variety of challenges from technical to social and organizational. The technical challenge is to ensure that the information, generated today, can survive long term changes in storage media, devices, and data formats. This paper presents a novel approach to the problem. It distinguishes…

Proposes a scheme of hierarchical piecewise linear approximation as an adaptive image pyramid. A progressive image coder comes naturally from the proposed image pyramid. The new pyramid is semantically more powerful than regular tessellation but syntactically simpler than free segmentation. This compromise between adaptability and complexity…

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…

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…