In order to better grasp the needs of library users and provide them with more accurate knowledge services, combining the characteristics of university libraries, this article applies library small data to personalized recommendation and proposes a small data fusion algorithm model for library personalized recommendation. This model combines the…

Describes research that examined the feasibility of automatically deriving name access points from machine readable title pages of English language monographs. An algorithm for automatic derivation is presented and results using the algorithm are compared to traditionally cataloged name access points. The implications for bibliographic standards…

Discusses the notion that knowledge grows exponentially and describes its growth mathematically by an exponential function. Growth patterns in subfields of knowledge or research areas are described citing related research. Interpretation of growth rate statistics and forecasts are included. Thirty-three references and statistics used for graphs…

Describes fast, dynamic update algorithms for document retrieval systems. B-trees are discussed; the M-B-T file directory structure is explained; insertions and deletions in inverted files are described; and performance evaluation is discussed. An appendix provides the formal definition of an M-B-T directory. (Contains 18 references.) (LRW)

Presents a relevance-feedback strategy that improves the effectiveness of information-retrieval systems based on back-propagation of the relevance of retrieved documents using an algorithm developed in a neural approach. Describes a neural information-retrieval model and reports results obtained with the algorithm in three different environments.…

A method for checking college students' completion of program and graduation requirements by computer is outlined. The procedure operates by having degree programs defined in tables and is simple enough to be achieved by junior program staff without the need for programmers and analysts. (MSE)

Presents a mathematical theory that can be used to define concentration places of objects within unordered classes. The application to research on the evolution of journals and subject areas is illustrated, and an online method of calculating concentration evolution is described. (1 references) (CLB)

Results of study investigating human memory organization in processing of computer programming languages indicate that algorithmic logic segments form a cognitive organizational structure in memory for programs. Statement indentation and internal program documentation did not enhance organizational process of recall of statements in five Fortran…

Describes design and presents examples of industrial use of small expert systems and guidelines for choosing problems which lend themselves to small tool solutions. Use of microcomputer facilitated decision tables to diagnose and categorize people, things, and issues is suggested, and development of three decision table formats is described. (MBR)

Describes a process of morpho-syntactic language analysis for information retrieval. Tree Structured Analytics (TSA) used for text representation is summarized; the matching process developed for such structures is outlined with an example appended; and experiments carried out to evaluate the effectiveness of TSA matching are discussed. (26…

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 an interpolation methodology that duplicates and improves the results of mathematical functional relationships useful for designing business enterprise simulations and argues that interpolation is effective over the entire range of production and sales activity. (six references) (EA)

Discusses term position as a search tactic in Boolean retrieval systems and describes ranked output systems that have used term weighting. The use of term proximity devices in ranked output systems is proposed, the algorithms used are explained, and a search experiment with a test collection is described. (19 references) (LRW)

Describes the simulation of a nearest neighbor searching algorithm for document retrieval using a pool of microprocessors. Three techniques are described which allow parallel searching of a binary search tree as well as a PASCAL-based system, PASSIM, which can simulate these techniques. Fifty-six references are provided. (Author/LRW)

The concept of Thai soundex system for name search as method of information retrieval is developed and evaluated by extending and modifying Odell and Russell soundex system to fit specific characteristics of Thai language. Thai consonants, letter codes, and evaluation of system in name file of 61,215 records are highlighted. (EJS)