Search (25 results, page 2 of 2)

0.0018909799 = product of:
  0.0037819599 = sum of:
    0.0037819599 = product of:
      0.0075639198 = sum of:
        0.0075639198 = weight(_text_:a in 6105) [ClassicSimilarity], result of:
          0.0075639198 = score(doc=6105,freq=10.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.14243183 = fieldWeight in 6105, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0390625 = fieldNorm(doc=6105)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Die Deutsche Bibliothek, the Library of Congress, and OCLC Online Computer Library Center are jointly developing a virtual international authority file (VIAF) for personal names which links authority records from the world's national bibliographic agencies and will be made freely available on the Web. The goals of the project are to prove the viability of automatically linking authority records from different national authority files and to demonstrate its benefits. The authority and bibliographic files from the Library of Congress and Die Deutsche Bibliothek were used to create the initial VIAF which contains over six million names with over a half million links. A key aspect of the project was the development of automated name matching algorithms which use information from both authority records and the corresponding bibliographic records. The practicality of algorithmically linking the personal names between national authority files was demonstrated; seventy percent of the authority records for personal names common to both files were automatically linked with an error rate of less than one percent. The long-term goal of the VIAF project is to combine the authoritative names from many national libraries and other significant sources into a shared global authority service.

Language

a

0.001757696 = product of:
  0.003515392 = sum of:
    0.003515392 = product of:
      0.007030784 = sum of:
        0.007030784 = weight(_text_:a in 6108) [ClassicSimilarity], result of:
          0.007030784 = score(doc=6108,freq=6.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.13239266 = fieldWeight in 6108, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=6108)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Libraries have a large stake in search protocols because library systems are diverse yet library users need to access multiple sites without learning the search syntax of each site. This paper reviews and compares the relative advantages of several of the newest search protocols and query languages: Search via URL (SRU), OpenSearch, Contextual Query Language (CQL), and XQuery. The models for SRU and OpenSearch operations are described in order to explain differences in functionality - keyword search and simple data record return for OpenSearch and richer search with multiple format data return for SRU. The advantages of CQL are described along with possible complementary uses of the highly detailed and complex XQuery being developed for XML.

Language

a

0.001674345 = product of:
  0.00334869 = sum of:
    0.00334869 = product of:
      0.00669738 = sum of:
        0.00669738 = weight(_text_:a in 6106) [ClassicSimilarity], result of:
          0.00669738 = score(doc=6106,freq=4.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.12611452 = fieldWeight in 6106, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0546875 = fieldNorm(doc=6106)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Living Memory is an interdisciplinary project running for two years, which is realised in cooperation of several institutions. It aims at developing an information system for a digital collection of different types of visual resources and will combine classical methods of image indexing and retrieval with innovative approaches like content-based image retrieval and the use of topic maps for semantic searching and browsing. This work-in-progress-report outlines the aims of the project and present first results after the period of fifteen months.

Language

a

0.0016571716 = product of:
  0.0033143433 = sum of:
    0.0033143433 = product of:
      0.0066286866 = sum of:
        0.0066286866 = weight(_text_:a in 6109) [ClassicSimilarity], result of:
          0.0066286866 = score(doc=6109,freq=12.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.12482099 = fieldWeight in 6109, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.03125 = fieldNorm(doc=6109)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

This paper reviews the perceived threats to the future of cataloguing posed by the increasing volume of publications in all media, coupled with a resource base which is declining in real terms. It argues that cataloguing is more rather than less important in such an environment and considers some of the ways in which cataloguing will have to change in order to survive.
The purpose of this paper is to review the challenges confronting cataloguing as we have known it and to consider how these challenges might be confronted and whether they may be surmounted. The main focus of this paper is on cataloguing rather than the catalogue, although it is obviously difficult to separate one from the other. First of all, what does "cataloguing" mean? For the purposes of this paper I have adopted a broad definition incorporating the following activities: - description of the resource sufficient for purposes of identification and for differentiation from other similar resources - identification and control of access points - identification and control of relationships with other resources - subject analysis of the resource - assignment of subject indexing terms - assignment of classification numbers The challenges facing cataloguing are all too well known. In no particular order, the major challenges are: - Increasing inputs - New kinds of information resource - Competition from other mediation services. - Perception that cataloguing is high cost and offers poor value for money. - Fiscal constraints - Declining workforce This is a daunting list. We have a choice, we could, to paraphrase John Lennon, "Turn off our minds, relax and float down stream", until we retire, take voluntary redundancy, or retrain as marketing consultants; or, we can choose to confront these challenges and consider what they really mean for cataloguing.

Language

a

5.9197034E-4 = product of:
  0.0011839407 = sum of:
    0.0011839407 = product of:
      0.0023678814 = sum of:
        0.0023678814 = weight(_text_:a in 1054) [ClassicSimilarity], result of:
          0.0023678814 = score(doc=1054,freq=2.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.044588212 = fieldWeight in 1054, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.02734375 = fieldNorm(doc=1054)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Language

a