NotesFAQContact Us
Collection
Advanced
Search Tips
Showing all 6 results Save | Export
Peer reviewed Peer reviewed
Burton, Hilary D. – Information Processing and Management, 1988
Defines and discusses bibliometrics, particularly as carried out in automated systems. The specific requirements to which data should conform to support bibliometric analysis are detailed and explained, and the Intelligent Gateway of the Lawrence Livermore National Laboratory is described. (15 references) (Author/CLB)
Descriptors: Automation, Bibliometrics, Data Analysis, Data Processing
Peer reviewed Peer reviewed
Martella, G.; Gobbi, G. – Information Processing and Management, 1981
Proposes a microprocessor-based architecture that makes large use of parallelism both in processing and in retrieval operations. The proposed system consists of three functional blocks: the query processor, simple query executers, and the answer composer. Twenty-one references are listed. (FM)
Descriptors: Data Processing, Information Retrieval, Information Systems, Microcomputers
Peer reviewed Peer reviewed
McAllister, Caryl – Information Processing and Management, 1975
Presents an inexpensive search system which would be very easy to adapt to a library's data processing requirements and would give a smaller library the opportunity to go on-line. (Author/PF)
Descriptors: Costs, Data Processing, Facsimile Transmission, Information Retrieval
Peer reviewed Peer reviewed
Rybinski, Henryk; Szymanski, Boleslaw – Information Processing and Management, 1981
Discusses the multilevel information system (MLIS), a retrieval system that integrates functions typical for database management systems and retrieval-oriented systems and provides several levels of data accessing, each developed for a different class of users. Twenty-two sources are cited. (FM)
Descriptors: Computer Programs, Data Processing, Flow Charts, Information Retrieval
Peer reviewed Peer reviewed
Cooper, David; Lynch, Michael F. – Information Processing and Management, 1984
Suggests new method of external distribution called tree partitioning that involves use of binary tree to split incoming file into successively smaller partitions for internal sorting. Number of disc accesses during a tree-partitioning sort were calculated in simulation using files extracted from British National Bibliography catalog files. (19…
Descriptors: Classification, Comparative Analysis, Computer Software, Data Processing
Peer reviewed Peer reviewed
Reddi, Arumalla V. – Information Processing and Management, 1983
Analyzes computer terminal memory performance in terms of overflow probability and average queueing delay, and presents new method to derive a closed expression for data arrivals with Erlangly distributed interarrival times and an approach to derive steady state probability expressions of the terminal memory content process. Twenty references are…
Descriptors: Computer Storage Devices, Data Processing, Graphs, Information Networks