Hickey, Thomas Butler 1947-

Research report prepared for OCLC on multidimensional mapping of libraries based on shared holdings in the OCLC Online Union Catalog by William E McGrath ( Book )
3 editions published in 1983 in English and held by 54 libraries worldwide

Research report on field, subfield, and indicator statistics in OCLC bibliographic records by Thomas Butler Hickey ( Book )
5 editions published in 1981 in English and held by 36 libraries worldwide

Research report on development of a probabilistic author search and matching technique for retrieval and creation of bibliographic records by Thomas Butler Hickey ( Book )
6 editions published between 1981 and 1982 in English and held by 28 libraries worldwide

Superimposed coding versus sequential and inverted files by Thomas Butler Hickey ( Book )
7 editions published between 1976 and 1977 in English and held by 26 libraries worldwide

Experiments with the IFLA functional requirements for bibliographic records (FRBR) by Thomas Butler Hickey ( Book )
1 edition published in 2002 in English and held by 3 libraries worldwide
OCLC is investigating how best to implement IFLA's Functional Requirements for Bibliographic Records (FRBR). As part of that work we have undertaken a series of experiments with algorithms to group existing bibliographic records into works and expressions. Working with both subsets of records and the whole WorldCat database, the algorithm we developed achieved reasonable success identifying all manifestations of a work.

Using the OAI-PMH--differently by Herbert van de Sompel ( Book )
1 edition published in 2003 in English and held by 3 libraries worldwide
The Open Archives Initiative's Protocol for Metadata Harvesting (OAI-PMH) was created to facilitate discovery of distributed resources. The OAI-PMH achieves this by providing a simple, yet powerful framework for metadata harvesting. Harvesters can incrementally gather records contained in OAI-PMH repositories and use them to create services covering the content of several repositories. The OAI-PMH has been widely accepted, and until recently, it has mainly been applied to make Dublin Core metadata about scholarly objects contained in distributed repositories searchable through a single user interface. This article describes innovative applications of the OAI-PMH that we have introduced in recent projects. In these projects, OAI-PMH concepts such as resource and metadata format have been interpreted in novel ways. The result of doing so illustrates the usefulness of the OAI-PMH beyond the typical resource discovery using Dublin Core metadata. Also, through the inclusion of XSL1 stylesheets in protocol responses, OAI-PMH repositories have been directly overlaid with an interface that allows users to navigate the contained metadata by means of a Web browser. In addition, through the introduction of PURL2 partial redirects, complex OAI-PMH protocol requests have been turned into simple URIs that can more easily be published and used in downstream applications.

Merging optical character recognition outputs for improved accuracy by John C Handley ( Book )
2 editions published between 1990 and 1991 in English and held by 2 libraries worldwide

Multidimensional mapping of libraries based on shared holdings in the OCLC online union catalog by William E McGrath ( Book )
3 editions published in 1983 in English and held by 2 libraries worldwide

Superimposed Coding Versus Sequential and Inverted Files ( Book )
2 editions published in 1977 in Undetermined and English and held by 2 libraries worldwide
The relative efficiency of three computer search algorithms was compared for searching large bibliographic files with Boolean search strategies. The sequential and inverted files represent the two most common file structures used today for bibliographic searching. Superimposed coding is an alternative that is becoming more attractive as the speed of computers improves. The superimposed search has a key associated with each record in the data base to act as a screen to eliminate the majority of records from further consideration. The keys are based on the bigrams and trigrams contained in the record, and are arranged in a linear file. The sequential search is a character by character scan of the entire file. This search is facilitated by constructing a finite state machine at the beginning of the search to match the search terms. The inverted file is fairly standard, except for the use of bit vectors to hold the postings of very common entries. A data base of 100,000 INSPEC records, from nine months of 1974, was used for testing the algorithms with 339 real-life search questions.

FRBR work-set algorithm by Thomas Butler Hickey ( Book )
1 edition published in 2005 in English and held by 2 libraries worldwide
"The research work-set algorithm generates an author/title key for each bibliographic record. These keys can then be used to bring work-sets together. The current algorithm ignores format so that the generated work-sets are sometimes at a higher level than a FRBR work." - p. 2.