Data repositories currently constitute essential programs within institutions. In fact, universities are the primary institutions that promote the creation, management and storage for the safekeeping of a variety of documents, data and/or projects. This work is carried out within the framework of institutional need and the application of knowledge…

This conceptual study uses dynamic systems theory (DST) and phenomenology as lenses to examine data privacy implications surrounding wearable devices that incorporate stakeholder, contextual and technical factors. Wearable devices can impact people's behaviour and sense of self, and DST and phenomenology provide complementary approaches for…

This study combines link grammar (LG) detector with N-grammar model to analyze and evaluate grammar in compositions. And then the composition level is judged through information entropy. Finally, the composition score is calculated based on the overall composition level and grammar weight. The experimental results show that the combined weight of…

Describes the advantages of using variable length equifrequent fragments as the language elements for compression coding of large data bases. (Author)

Described here is an efficient encoding procedure for Algorithmic Wiswesser Notation (ALWIN), using the Morgan labelling algorithm and the neighborhood relationship in a chemical graph. This procedure introduces a hierarchy to bring an order for the unique description of the chemical structure with a minimal computational effect. (Author)

The binary vector is suggested as an alternative to the usual method of storing document pointers in an inverted index file. (Author)

An algorithm is proposed to solve the problem of sequential indexing which does not use any grammatical or semantic analysis, but follows the principle of emulating human judgement by evaluation of machine-recognizable attributes of structured word assemblies. (Author)

The design of programs to search large document data bases is discussed with regard to the use of compression coding combined with adoption of word fragments as the basic language elements. An algorithm is described for determination of a set of almost equifrequent fragments. Its efficiency is tested. (23 references) (Author)

Presents three text compression methods of increasing power and evaluates each based on the trade-off between compression gain and processing time. The advantages of using hash coding for speed and optimal arithmetic coding to successor information for compression gain are discussed. (26 references) (Author/CLB)

An English summary is provided for the article which gives the opportunity to solve original problems in linguistics, mathematics and computing science as well as to design descriptive and typological methods in archaeology. (6 references) (Author/SJ)

Virtual scatter storage schemes are well suited dictionaries, having both rapid lookup and economy of storage. (MF)

Describes a system that provides online access to holdings information for more than 4,500 journals on a single self-executing diskette. A brief discussion of data compression is offered, along with program listings in both BASIC and C. (MES)

Introduces two distribution schemes that partition documents over multiple processors and the corresponding multiprocessor retrieval algorithms that match relevant documents to user queries. The suggested framework is based on a general purpose hypercube multicomputer architecture with a dedicated disk for each node. A timing analysis for the…

The benefits of utilizing text compression for CAI are evaluated, and an analysis of core storage, decoding, and CPU time are presented for the PDP-10 system. (RAO)

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)