Information Retrieval List Digest 214 (May 23) URL = http://hegel.lib.ncsu.edu/stacks/serials/irld/irld-214 6.1 May 23, 1994 Volume XI, Number 21 Issue 214 ********************************************************** III. NOTICES A. Publications 1. ToC: Information Processing & Management, 30:5 IV. PROJECTS A. Abstracts 1. IR-Related Dissertation Abstracts C. Initiatives & Proposals 1. UK Arts & Humanities Data Service: Feasibility Study ********************************************************** III. NOTICES Fr: Lauren Levey Re: IP&M, 30:5, Table of Contents Volume 30, Number 5, 1994 Trends in . . . A Critical Review Contents Steven Frank 587 Cataloging Digital Geographic Data in the Information Infrastructure: A Literature and Technology Review Articles Ethel Auster 607 How Senior Managers Acquire and Use Chun Wei Choo Information in Environmental Scanning Stephanie W. Haas 619 Looking in Text Windows: Their Size Robert M. Losee, Jr. and Composition June P. Silvester 631 Machine-Aided Indexing at NASA Michael T. Genuardi Paul H. Klingbiel Liang Thow-Yick 647 The Basic Entity Model: A Fundamental Theoretical Model of Information and Information Processing George V. Meghabghab 663 INN: An Intelligent Negotiating Neural Dania B. Meghabghab Network for Information Systems: A Design Model Latha S. Colby 687 Concepts for Modeling and Querying Lawrence V. Saxton List-Structured Data Dirk Van Gucht W.M. Shaw 711 Retrieval Expectations, Cluster-Based Effectiveness, and Performance Standards in the CF Database Book Reviews Terence Eastwood 725 Expert Systems and Artificial Intelligence: An Information Manager's Guide by N. Ford Rebecca Green 726 Organizing Knowledge: An Introduction to Information Retrieval by J.E. Rowley William W. Oblitely 727 Bibliographic Access to Medieval and Renaissance Manuscripts: A Survey of Computerized Data Bases and Information Services by W.M. Stevens (Ed.) Amanda Spink 729 A Guide to Usability: Human Factors in Computing by J. Preece (Ed.) Norman Howden 729 Cases in Online Search Strategy by B.A. Shuman ********************************************************** IV. PROJECTS IV.A.1. Fr: Susanne M. Humphrey Re: Selected IR-Related Dissertation Abstracts The following are citations selected by title and abstract as being related to Information Retrieval (IR), resulting from a computer search, using BRS Information Technologies, of the Dissertation Abstracts Online database produced by University Microfilms International (UMI). Included are UMI order number, title, author, degree, year, institution; number of pages, one or more Dissertation Abstracts International (DAI) subject descriptors chosen by the author, and abstract. Unless otherwise specified, paper or microform copies of dissertations may be ordered from University Microfilms International, Dissertation Copies, Post Office Box 1764, Ann Arbor, MI 48106; telephone for U.S. (except Michigan, Hawaii, Alaska): 1-800-521-3042, for Canada: 1-800-268-6090. Price lists and other ordering and shipping information are in the introduction to the published DAI. An alternate source for copies is sometimes provided. Dissertation titles and abstracts contained here are published with permission of University Microfilms International, publishers of Dissertation Abstracts International (copyright by University Microfilms International), and may not be reproduced without their prior permission. AN University Microfilms Order Number ADG93-29095. AU LEE, JUI-TINE. TI EFFICIENT INDEXING OF SPATIAL OBJECTS IN OBJECT-ORIENTED DATABASES. IN University of Illinois at Urbana-Champaign Ph.D. 1993, 191 pages. SO DAI v54(05), SecB, pp2598. DE Computer Science. Geotechnology. AB The use of index structures can increase the performance of query processing. However, the index structures for standard databases are not suitable for the non-standard database applications such as geographical applications, CAD applications, VLSI designs and image processing. For non-standard databases, we need an index structure which preserves spatial neighborhood. In this thesis, we proposed two new access methods with improved performance: a projection method and a partition method. In the projection method, we project a spatial data object onto each axis. The projection of an object forms an interval in each dimension. Then, we organize the projection intervals in each dimension as a B-tree. To perform a query, we need to search each of the B-trees and find the set of possible candidates for the given query in each dimension. Then we compute the intersections of those possible candidate sets, which is the final result. In the partition method, if an object is not a point, the object is approximated by a bounding rectangle and then the bounding rectangle is transformed into a point in higher dimensions. The transformed points are organized as a directory tree. Instead of using one tree for each dimension like the projection method, the partition method builds up only one directory tree. All queries are performed against this directory tree. After introducing our two methods, we perform several experiments to compare our methods with other methods for spatial databases under arbitrary data distributions and various types of queries. AN University Microfilms Order Number ADG93-27302. AU TOROSLU, ISMAIL HAKKI. TI THE TRANSITIVE-CLOSURE QUERY: FORMS, ALGORITHMS AND PERFORMANCE EVALUATION. IN Northwestern University Ph.D. 1993, 131 pages. SO DAI v54(05), SecB, pp2605. DE Computer Science. AB First order predicate logic has been used to extend the traditional relational model for databases to create more intelligent database systems, which are called deductive databases. Deductive databases are powerful tools that can be used as knowledge-based systems or as expert system tools. One of the main features of deductive databases is their ability to define recursive views and to process queries on them directly. Therefore, developing efficient algorithms for the evaluation of recursive queries is a very important part of the research in deductive databases. Most recursive queries can be transformed into transitive closure problems. Therefore, the development of efficient transitive closure algorithms within the context of large database systems has recently attracted a large amount of research effort. In this thesis we study different forms of transitive closure problems in a deductive database context. We discuss previously developed transitive closure algorithms and suggest some new algorithms. Our simulation results show that some of our algorithms have much better performance than related previous algorithms. AN University Microfilms Order Number ADG93-21333. AU VAN DER MEYDEN, RONALD. TI THE COMPLEXITY OF QUERYING INDEFINITE INFORMATION: DEFINED RELATIONS, RECURSION AND LINEAR ORDER. IN Rutgers The State University of New Jersey - New Brunswick Ph.D. 1992, 209 pages. SO DAI v54(05), SecB, pp2606. DE Computer Science. AB This dissertation studies the computational complexity of answering queries in logical databases containing indefinite information arising from two sources: facts stated in terms of defined relations, and incomplete information about linearly ordered domains. First, we consider databases consisting of (1) a DATALOG program and (2) a description of the world in terms of the predicates defined by the program as well as the basic predicates. The query processing problem in such databases is related to issues in database theory, including view updates and DATALOG optimization, and also to the Artificial Intelligence problems of reasoning in circumscribed theories and skeptical abductive reasoning. If the program is non-recursive, the meaning of the database can be represented by Clark's Predicate Completion, and standard first order theorem proving technology may be used to evaluate queries. However, with recursive definitions such databases are intrinsically second order, and query processing is not even semi-decidable. Nevertheless, the basic queries, which do not contain defined predicates, are decidable. We show that under certain conditions querying this second order form of indefinite information is no more complex than querying indefinite information expressible in first order logic. We also consider the influence of negation and inequality on complexity. Next, we study databases containing basic atomic facts and facts asserting order relations between points in a linearly ordered domain. Incomplete information about a linearly ordered domain means that the data provide only a partial order, and a query answering requires reasoning about all the compatible linear orders. We show the complexity of this inference problem is in general intractable, but identify a variety of natural conditions under which queries may be answered in polynomial time. Finally, we consider the effect of combining the two sorts of indefinite information: we study databases containing facts defined using recursive rules with linear order constraints. Applications of such rules include reasoning about concurrent, repetitive actions. In general, even the basic queries are undecidable in this context, but by restricting definitions to a reasonable class, we are able to recapture decidability. Further, under a constraint of "bounded concurrency," query processing is in polynomial time. AN University Microfilms Order Number ADG93-29191. AU VRBSKY, SUSAN VLASTA. TI APPROXIMATE: A QUERY PROCESSOR THAT PRODUCES MONOTONICALLY IMPROVING APPROXIMATE ANSWERS. IN University of Illinois at Urbana-Champaign Ph.D. 1993, 145 pages. SO DAI v54(05), SecB, pp2606. DE Computer Science. AB For some applications, it may be better for a database to produce an approximate answer when it is not possible to produce an exact answer. We have designed and implemented a query processor, called APPROXIMATE, that makes approximate answers available if part of the database is unavailable or if there is not enough time to produce an exact answer. The accuracy of the approximate answers produced improves monotonically with the amount of data retrieved to produce the result. APPROXIMATE returns the exact answer if all of the needed data are available and if there is enough time to continue with the processing. The latest, best available approximate answer is returned if the user demands an answer before query processing is completed. The approximate query processing algorithm of APPROXIMATE works within a standard relational algebra framework. In this thesis, we present the approximation semantics of APPROXIMATE that serves as the basis for meaningful approximations to set-valued and single-valued queries, and the approximate query processing algorithm used by APPROXIMATE. APPROXIMATE uses an object-oriented view of the database. This view provides semantic information about the initial approximations to a query and information about which segments of the database can be retrieved. A distance function is defined to provide additional semantic support needed to compare the accuracies of approximate answers to the exact answer and information about the convergence of approximate answers. We describe the overhead incurred by this semantic support and present an implementation of APPROXIMATE. AN University Microfilms Order Number ADGNN-78764. AU VIENS, JACQUES. TI KEYWORD VISUAL ORGANIZER: TOWARDS A MULTI-DIMENSIONAL UTILIZATION OF KEYWORDS IN A KNOWLEDGE-BASED LEARNING ENVIRONMENT. IN University of Toronto (Canada) Ph.D. 1992, 178 pages. SO DAI v54(05), SecA, pp1662. DE Education, Curriculum and Instruction. IS ISBN: 0-315-78764-3. AB A Keyword Visual Organizer (KVO) interface was developed to serve educational and information storage and retrieval needs for a student-generated database. The interface was designed to provide access to important domain concepts, to create a graphic interface that presents keywords in meaningful contexts, and to improve technical problems related to keywording. KVO was used for 9 weeks with 31 grade 5/6 students who were asked to produce a collective hypermedia database on the subject "Early Man." Half the class (15 students randomly selected) used the new KVO interface while the other half (16 students) used the old keywording facilities (typing and alphabetical list). The impact of KVO was assessed on four variables; namely, Keyword Use, Note Writing, Off-Line Writing, and Student Attitudes. The most significant learning outcomes of KVO were: (a) words considered as important domain vocabulary were found more often in the KVO database; (b) KVO students produced a database indexed with more interconnected terms and student linkages, and better access to information; (c) more notes with new topic information were entered into the database served by KVO; (d) students used keyword searches more often with more important domain terms, demonstrating a more conceptual approach; and (e) the KVO subgroup developed more positive attitudes for the learning activity and subject area. The most significant indexing outcomes of KVO are that the technical problems related to keywording are reduced and the quality of indexing has improved. KVO is designed so that it can be adapted to a variety of collaborative and generative learning environments. AN University Microfilms Order Number ADG93-24968. AU DEEMER, MILTON LEWIS. TI MAKING THE DECISION: THE FACTORS THAT AFFECT THE DESIGN AND DEVELOPMENT OF ELECTRONIC EXHIBIT MEDIA IN SELECTED NATURAL HISTORY MUSEUMS. IN Northern Illinois University Ed.D. 1993, 342 pages. SO DAI v54(05), SecA, pp1770. DE Education, Technology. AB This study investigates the use of electronic media in natural history museums. It divides the problem into three areas: the decision-making structure, the personnel involved in the process and the factors that are considered by the participants. The study suggests the decision to use electronic media in a museum exhibit should be viewed as part of the total exhibit development process. This process is defined in a model derived from the existing literature and case study data. The model identifies the relationships between an exhibit's compositional elements--the philosophical basis or "approach", the organizing schema or "style" and the communication media or "mode". The relationships, in turn, reflect the exhibit's primary goals. A variety of concrete and abstract factors influence the exhibit's development process. The concrete factors include the project's cost, time, space and technology, all of which are readily apparent and easily measurable. Abstract factors, while easily overlooked, are equally influential. These include the museum's philosophy, internal and external political forces, the experience, attitudes and perceptions of the personnel involved in the decision and the decision-making process's structure. In order to account for the interplay between the design elements, and the concrete and abstract factors' influence, it is necessary to consider the decision process from a holistic point of view. This study divides the related literature in two parts, establishing a theoretical perspective on the subject, while discussing specific characteristics of electronic media. It subsequently investigates the decision-making process used in selecting electronic exhibit media at Cleveland Museum of Natural History, Field Museum of Natural History in Chicago, and Milwaukee Public Museum. To do so, it employs a multiple case study approach and relies upon data gathered from informants, documents and personal observation. This study concludes there is a need for a holistic exhibit development approach, that the various elements of the exhibit are interrelated and the exhibit development decision-making structure is more fluid than the literature suggests. The study also concludes a more formal development team is often more efficient in accomplishing its objective. In addition, the study indicates the roles of the team participants need not be reflective of the traditional museum staff positions. It is noted that clear concise goals and objectives are beneficial to exhibit development. In addition, even though the primary decision-makers may be a team, the decision to use electronic media is influenced by many individuals ranging from the top administrator to middle level management. ********** IV.C.1. Fr: Harold Short Re: UK Arts and Humanities Data Service: Feasibility Study U.K. ARTS AND HUMANITIES DATA SERVICE: FEASIBILITY STUDY The Information Services Sub-Committee (ISSC) of the Higher Education Funding Councils' Joint Information Systems Committee (JISC) is funding a feasibility study into the establishment of an Arts and Humanities Datacentre. It is intended that such a datacentre, which might in structure be highly distributed, would improve access to electronic resources in various formats, including text, image, and sound, and that it would encourage the use of electronic materials in teaching, learning and research. The creation of a datacentre for the Arts and Humanities has been recommended in a number of recent reports, including the Follett Report and the joint British Library / British Academy report _Information Technology in Humanities Scholarship_. The feasibility study is being carried out by Lou Burnard of the University of Oxford and Harold Short of King's College London, and is overseen by a Steering Group under the Chairmanship of Dr Richard Heseltine, Librarian of the University of Hull. In the course of the study it is hoped to consult as widely as possible within the Higher Education community, primarily in the United Kingdom, but also abroad. As a preliminary to this, a workshop was held at the British Academy at which an invited group of individuals with expert interests in this field discussed the proposal. Currently, a number of institutions and individuals known to have an interest are being approached directly, and paper and electronic versions of the workshop report are being made available as widely as possible. The report is available by anonymous ftp from: ota.ox.ac.uk in the directory ota/AHD (note case) under the fileame workshop.report. This message is being distributed on a number of mailing lists with the purpose of inviting comment, from anyone with Higher Education interests, on any of the issues being addressed in the feasibility study. Written submissions should be sent no later than 30 June to: AHDS@vax.ox.ac.uk The Workshop took as its key document the proposal originally submitted to the JISC, on the basis of which the present feasibility study was funded. This document may be obtained from either of the proposers: Lou Burnard Oxford Text Archive Oxford University Computing Services 13 Banbury Road Oxford OX2 6NN Email: lou@vax.ox.ac.uk Tel: 0865 273238 Fax: 0865 273275 Harold Short Computing Centre King's College London Strand London WC2R 2LS Email: h.short@bay.cc.kcl.ac.uk Tel: 071 873 2739 Fax: 071 836 1799. ********************************************************** IRLIST Digest is distributed from the University of California, Division of Library Automation, 300 Lakeside Drive, Oakland, CA. 94612-3550. Send subscription requests to: LISTSERV@UCOP.EDU Send submissions to IRLIST to: IR-L@UCOP.EDU Or send subscription requests and submissions to: NANCY.GUSACK@UCOP.EDU Editorial Staff: Clifford Lynch clifford.lynch@ucop.edu Nancy Gusack nancy.gusack@ucop.edu Mary Engle mary.engle@ucop.edu The IRLIST Archives is now set up for anonymous FTP, as well as via the LISTSERV. Using anonymous FTP via the host dla.ucop.edu, the files will be found in the directory pub/irl, stored in subdirectories by year (e.g., /pub/irl/1993). Using LISTSERV, send the message INDEX IR-L to LISTSERV@UCOP.EDU. To get a specific issue listed in the Index, send the message GET IR-L LOGYYMM, where YY is the year and MM is the numeric month in which the issue was mailed, to LISTSERV@UCOP.EDU. You will receive the issues for the entire month you have requested. These files are not to be sold or used for commercial purposes. Contact Nancy Gusack or Mary Engle for more information on IRLIST. THE OPINIONS EXPRESSED IN IRLIST DO NOT REPRESENT THOSE OF THE EDITORS OR THE UNIVERSITY OF CALIFORNIA. AUTHORS ASSUME FULL RESPONSIBILITY FOR THE CONTENTS OF THEIR SUBMISSIONS TO IRLIST.