Search (43 results, page 1 of 3)

  • × theme_ss:"Verteilte bibliographische Datenbanken"
  1. Dempsey, L.; Russell, R.; Kirriemur, J.W.: Towards distributed library systems : Z39.50 in a European context (1996) 0.05
    0.049402952 = product of:
      0.098805904 = sum of:
        0.098805904 = sum of:
          0.042221468 = weight(_text_:retrieval in 127) [ClassicSimilarity], result of:
            0.042221468 = score(doc=127,freq=2.0), product of:
              0.15791564 = queryWeight, product of:
                3.024915 = idf(docFreq=5836, maxDocs=44218)
                0.052204985 = queryNorm
              0.26736724 = fieldWeight in 127, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                3.024915 = idf(docFreq=5836, maxDocs=44218)
                0.0625 = fieldNorm(doc=127)
          0.056584436 = weight(_text_:22 in 127) [ClassicSimilarity], result of:
            0.056584436 = score(doc=127,freq=2.0), product of:
              0.18281296 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.052204985 = queryNorm
              0.30952093 = fieldWeight in 127, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.0625 = fieldNorm(doc=127)
      0.5 = coord(1/2)
    
    Abstract
    Z39.50 is an information retrieval protocol. It has generated much interest but is so far little deployed in UK systems and services. Gives a functional overview of the protocol itself and the standards background, describes some European initiatives which make use of it, and outlines various issues to do with its future use and acceptance. Z39.50 is a crucial building block of future distributed information systems but it needs to be considered alongside other protocols and services to provide useful applications
    Source
    Program. 30(1996) no.1, S.1-22
  2. Avrahami, T.T.; Yau, L.; Si, L.; Callan, J.P.: ¬The FedLemur project : Federated search in the real world (2006) 0.04
    0.037052214 = product of:
      0.07410443 = sum of:
        0.07410443 = sum of:
          0.0316661 = weight(_text_:retrieval in 5271) [ClassicSimilarity], result of:
            0.0316661 = score(doc=5271,freq=2.0), product of:
              0.15791564 = queryWeight, product of:
                3.024915 = idf(docFreq=5836, maxDocs=44218)
                0.052204985 = queryNorm
              0.20052543 = fieldWeight in 5271, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                3.024915 = idf(docFreq=5836, maxDocs=44218)
                0.046875 = fieldNorm(doc=5271)
          0.04243833 = weight(_text_:22 in 5271) [ClassicSimilarity], result of:
            0.04243833 = score(doc=5271,freq=2.0), product of:
              0.18281296 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.052204985 = queryNorm
              0.23214069 = fieldWeight in 5271, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.046875 = fieldNorm(doc=5271)
      0.5 = coord(1/2)
    
    Abstract
    Federated search and distributed information retrieval systems provide a single user interface for searching multiple full-text search engines. They have been an active area of research for more than a decade, but in spite of their success as a research topic, they are still rare in operational environments. This article discusses a prototype federated search system developed for the U.S. government's FedStats Web portal, and the issues addressed in adapting research solutions to this operational environment. A series of experiments explore how well prior research results, parameter settings, and heuristics apply in the FedStats environment. The article concludes with a set of lessons learned from this technology transfer effort, including observations about search engine quality in the real world.
    Date
    22. 7.2006 16:02:07
  3. Meiert, M.: Elektronische Publikationen an Hochschulen : Modellierung des elektronischen Publikationsprozesses am Beispiel der Universität Hildesheim (2006) 0.04
    0.037052214 = product of:
      0.07410443 = sum of:
        0.07410443 = sum of:
          0.0316661 = weight(_text_:retrieval in 5974) [ClassicSimilarity], result of:
            0.0316661 = score(doc=5974,freq=2.0), product of:
              0.15791564 = queryWeight, product of:
                3.024915 = idf(docFreq=5836, maxDocs=44218)
                0.052204985 = queryNorm
              0.20052543 = fieldWeight in 5974, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                3.024915 = idf(docFreq=5836, maxDocs=44218)
                0.046875 = fieldNorm(doc=5974)
          0.04243833 = weight(_text_:22 in 5974) [ClassicSimilarity], result of:
            0.04243833 = score(doc=5974,freq=2.0), product of:
              0.18281296 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.052204985 = queryNorm
              0.23214069 = fieldWeight in 5974, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.046875 = fieldNorm(doc=5974)
      0.5 = coord(1/2)
    
    Date
    1. 9.2006 13:22:15
    Source
    Effektive Information Retrieval Verfahren in Theorie und Praxis: ausgewählte und erweiterte Beiträge des Vierten Hildesheimer Evaluierungs- und Retrievalworkshop (HIER 2005), Hildesheim, 20.7.2005. Hrsg.: T. Mandl u. C. Womser-Hacker
  4. Nicholson, D.; Steele, M.: CATRIONA : a distributed, locally-oriented, Z39.50 OPAC-based approach to cataloguing the Internet (1996) 0.04
    0.037052214 = product of:
      0.07410443 = sum of:
        0.07410443 = sum of:
          0.0316661 = weight(_text_:retrieval in 603) [ClassicSimilarity], result of:
            0.0316661 = score(doc=603,freq=2.0), product of:
              0.15791564 = queryWeight, product of:
                3.024915 = idf(docFreq=5836, maxDocs=44218)
                0.052204985 = queryNorm
              0.20052543 = fieldWeight in 603, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                3.024915 = idf(docFreq=5836, maxDocs=44218)
                0.046875 = fieldNorm(doc=603)
          0.04243833 = weight(_text_:22 in 603) [ClassicSimilarity], result of:
            0.04243833 = score(doc=603,freq=2.0), product of:
              0.18281296 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.052204985 = queryNorm
              0.23214069 = fieldWeight in 603, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.046875 = fieldNorm(doc=603)
      0.5 = coord(1/2)
    
    Abstract
    The aims of CATRIONA were: (1) to investigate the requirements for developing procedures and applications for cataloguing and retrieval of networked resources, and (2) to explore the feasibility of a collaborative project to develop such applications and procedures and integrate them with existing library systems. The project established that a distributed catalogue of networked resources integrated with standard Z39.50 library system OPAC interfaces with information on hard-copy resources is already a practical proposition at a basic level. At least one Z39.50 OPAC client can search remote Z39.50 OPACs, retrieve USMARC records with URLs in 856$u, load a viewer like Netscape, and use it to retrieve and display the remotely held electronic resource on the local workstation. A follow-up project on related issues is being finalised.
    Source
    Cataloging and classification quarterly. 22(1996) nos.3/4, S.127-141
  5. Johnson, E.H.: Objects for distributed heterogeneous information retrieval (2000) 0.04
    0.036342062 = product of:
      0.072684124 = sum of:
        0.072684124 = sum of:
          0.037318856 = weight(_text_:retrieval in 6959) [ClassicSimilarity], result of:
            0.037318856 = score(doc=6959,freq=4.0), product of:
              0.15791564 = queryWeight, product of:
                3.024915 = idf(docFreq=5836, maxDocs=44218)
                0.052204985 = queryNorm
              0.23632148 = fieldWeight in 6959, product of:
                2.0 = tf(freq=4.0), with freq of:
                  4.0 = termFreq=4.0
                3.024915 = idf(docFreq=5836, maxDocs=44218)
                0.0390625 = fieldNorm(doc=6959)
          0.035365272 = weight(_text_:22 in 6959) [ClassicSimilarity], result of:
            0.035365272 = score(doc=6959,freq=2.0), product of:
              0.18281296 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.052204985 = queryNorm
              0.19345059 = fieldWeight in 6959, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.0390625 = fieldNorm(doc=6959)
      0.5 = coord(1/2)
    
    Abstract
    The success of the World Wide Web Shows that we can access, search, and retrieve information from globally distributed databases. lf a database, such as a library catalog, has some sort of Web-based front end, we can type its URL into a Web browser and use its HTML-based forms to search for items in that database. Depending an how well the query conforms to the database content, how the search engine interprets the query, and how the server formats the results into HTML, we might actually find something usable. While the first two issues depend an ourselves and the server, an the Web the latter falls to the mercy of HTML, which we all know as a great destroyer of information because it codes for display but not for content description. When looking at an HTML-formatted display, we must depend an our own interpretation to recognize such entities as author names, titles, and subject identifiers. The Web browser can do nothing but display the information. lf we want some other view of the result, such as sorting the records by date (provided it offers such an option to begin with), the server must do it. This makes poor use of the computing power we have at the desktop (or even laptop), which, unless it involves retrieving more records, could easily do the result Set manipulation that we currently send back to the server. Despite having personal computers wich immense computational power, as far as information retrieval goes, we still essentially use them as dumb terminals.
    Date
    22. 9.1997 19:16:05
  6. Xu, J.; Croft, W.B.: Topic-based language models for distributed retrieval (2000) 0.02
    0.023749575 = product of:
      0.04749915 = sum of:
        0.04749915 = product of:
          0.0949983 = sum of:
            0.0949983 = weight(_text_:retrieval in 38) [ClassicSimilarity], result of:
              0.0949983 = score(doc=38,freq=18.0), product of:
                0.15791564 = queryWeight, product of:
                  3.024915 = idf(docFreq=5836, maxDocs=44218)
                  0.052204985 = queryNorm
                0.60157627 = fieldWeight in 38, product of:
                  4.2426405 = tf(freq=18.0), with freq of:
                    18.0 = termFreq=18.0
                  3.024915 = idf(docFreq=5836, maxDocs=44218)
                  0.046875 = fieldNorm(doc=38)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Abstract
    Effective retrieval in a distributed environment is an important but difficult problem. Lack of effectiveness appears to have two major causes. First, existing collection selection algorithms do not work well on heterogeneous collections. Second, relevant documents are scattered over many collections and searching a few collections misses many relevant documents. We propose a topic-oriented approach to distributed retrieval. With this approach, we structure the document set of a distributed retrieval environment around a set of topics. Retrieval for a query involves first selecting the right topics for the query and then dispatching the search process to collections that contain such topics. The content of a topic is characterized by a language model. In environments where the labeling of documents by topics is unavailable, document clustering is employed for topic identification. Based on these ideas, three methods are proposed to suit different environments. We show that all three methods improve effectiveness of distributed retrieval
    Series
    The Kluwer international series on information retrieval; 7
    Source
    Advances in information retrieval: Recent research from the Center for Intelligent Information Retrieval. Ed.: W.B. Croft
  7. Callan, J.: Distributed information retrieval (2000) 0.02
    0.022623355 = product of:
      0.04524671 = sum of:
        0.04524671 = product of:
          0.09049342 = sum of:
            0.09049342 = weight(_text_:retrieval in 31) [ClassicSimilarity], result of:
              0.09049342 = score(doc=31,freq=12.0), product of:
                0.15791564 = queryWeight, product of:
                  3.024915 = idf(docFreq=5836, maxDocs=44218)
                  0.052204985 = queryNorm
                0.5730491 = fieldWeight in 31, product of:
                  3.4641016 = tf(freq=12.0), with freq of:
                    12.0 = termFreq=12.0
                  3.024915 = idf(docFreq=5836, maxDocs=44218)
                  0.0546875 = fieldNorm(doc=31)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Abstract
    A multi-database model of distributed information retrieval is presented, in which people are assumed to have access to many searchable text databases. In such an environment, full-text information retrieval consists of discovering database contents, ranking databases by their expected ability to satisfy the query, searching a small number of databases, and merging results returned by different databases. This paper presents algorithms for each task. It also discusses how to reorganize conventional test collections into multi-database testbeds, and evaluation methodologies for multi-database experiments. A broad and diverse group of experimental results is presented to demonstrate that the algorithms are effective, efficient, robust, and scalable
    Series
    The Kluwer international series on information retrieval; 7
    Source
    Advances in information retrieval: Recent research from the Center for Intelligent Information Retrieval. Ed.: W.B. Croft
  8. Croft, W.B.: Combining approaches to information retrieval (2000) 0.02
    0.022391316 = product of:
      0.04478263 = sum of:
        0.04478263 = product of:
          0.08956526 = sum of:
            0.08956526 = weight(_text_:retrieval in 6862) [ClassicSimilarity], result of:
              0.08956526 = score(doc=6862,freq=16.0), product of:
                0.15791564 = queryWeight, product of:
                  3.024915 = idf(docFreq=5836, maxDocs=44218)
                  0.052204985 = queryNorm
                0.5671716 = fieldWeight in 6862, product of:
                  4.0 = tf(freq=16.0), with freq of:
                    16.0 = termFreq=16.0
                  3.024915 = idf(docFreq=5836, maxDocs=44218)
                  0.046875 = fieldNorm(doc=6862)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Abstract
    The combination of different text representations and search strategies has become a standard technique for improving the effectiveness of information retrieval. Combination, for example, has been studied extensively in the TREC evaluations and is the basis of the "meta-search" engines used on the Web. This paper examines the development of this technique, including both experimental results and the retrieval models that have been proposed as formal frameworks for combination. We show that combining approaches for information retrieval can be modeled as combining the outputs of multiple classifiers based on one or more representations, and that this simple model can provide explanations for many of the experimental results. We also show that this view of combination is very similar to the inference net model, and that a new approach to retrieval based on language models supports combination and can be integrated with the inference net model
    Series
    The Kluwer international series on information retrieval; 7
    Source
    Advances in information retrieval: Recent research from the Center for Intelligent Information Retrieval. Ed.: W.B. Croft
  9. López Vargas, M.A.: "Ilmenauer Verteiltes Information REtrieval System" (IVIRES) : eine neue Architektur zur Informationsfilterung in einem verteilten Information Retrieval System (2002) 0.02
    0.022391316 = product of:
      0.04478263 = sum of:
        0.04478263 = product of:
          0.08956526 = sum of:
            0.08956526 = weight(_text_:retrieval in 4041) [ClassicSimilarity], result of:
              0.08956526 = score(doc=4041,freq=4.0), product of:
                0.15791564 = queryWeight, product of:
                  3.024915 = idf(docFreq=5836, maxDocs=44218)
                  0.052204985 = queryNorm
                0.5671716 = fieldWeight in 4041, product of:
                  2.0 = tf(freq=4.0), with freq of:
                    4.0 = termFreq=4.0
                  3.024915 = idf(docFreq=5836, maxDocs=44218)
                  0.09375 = fieldNorm(doc=4041)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
  10. Crestani, F.; Wu, S.: Testing the cluster hypothesis in distributed information retrieval (2006) 0.02
    0.02188012 = product of:
      0.04376024 = sum of:
        0.04376024 = product of:
          0.08752048 = sum of:
            0.08752048 = weight(_text_:retrieval in 984) [ClassicSimilarity], result of:
              0.08752048 = score(doc=984,freq=22.0), product of:
                0.15791564 = queryWeight, product of:
                  3.024915 = idf(docFreq=5836, maxDocs=44218)
                  0.052204985 = queryNorm
                0.554223 = fieldWeight in 984, product of:
                  4.690416 = tf(freq=22.0), with freq of:
                    22.0 = termFreq=22.0
                  3.024915 = idf(docFreq=5836, maxDocs=44218)
                  0.0390625 = fieldNorm(doc=984)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Abstract
    How to merge and organise query results retrieved from different resources is one of the key issues in distributed information retrieval. Some previous research and experiments suggest that cluster-based document browsing is more effective than a single merged list. Cluster-based retrieval results presentation is based on the cluster hypothesis, which states that documents that cluster together have a similar relevance to a given query. However, while this hypothesis has been demonstrated to hold in classical information retrieval environments, it has never been fully tested in heterogeneous distributed information retrieval environments. Heterogeneous document representations, the presence of document duplicates, and disparate qualities of retrieval results, are major features of an heterogeneous distributed information retrieval environment that might disrupt the effectiveness of the cluster hypothesis. In this paper we report on an experimental investigation into the validity and effectiveness of the cluster hypothesis in highly heterogeneous distributed information retrieval environments. The results show that although clustering is affected by different retrieval results representations and quality, the cluster hypothesis still holds and that generating hierarchical clusters in highly heterogeneous distributed information retrieval environments is still a very effective way of presenting retrieval results to users.
  11. Milanesi, C.: Möglichkeiten der Kooperation im Rahmen von Subject Gateways : das Euler-Projekt im Vergleich mit weiteren europäischen Projekten (2001) 0.02
    0.021219164 = product of:
      0.04243833 = sum of:
        0.04243833 = product of:
          0.08487666 = sum of:
            0.08487666 = weight(_text_:22 in 4865) [ClassicSimilarity], result of:
              0.08487666 = score(doc=4865,freq=2.0), product of:
                0.18281296 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.052204985 = queryNorm
                0.46428138 = fieldWeight in 4865, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.09375 = fieldNorm(doc=4865)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Date
    22. 6.2002 19:41:59
  12. Fuhr, N.: Towards data abstraction in networked information retrieval systems (1999) 0.02
    0.018471893 = product of:
      0.036943786 = sum of:
        0.036943786 = product of:
          0.07388757 = sum of:
            0.07388757 = weight(_text_:retrieval in 4517) [ClassicSimilarity], result of:
              0.07388757 = score(doc=4517,freq=2.0), product of:
                0.15791564 = queryWeight, product of:
                  3.024915 = idf(docFreq=5836, maxDocs=44218)
                  0.052204985 = queryNorm
                0.46789268 = fieldWeight in 4517, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.024915 = idf(docFreq=5836, maxDocs=44218)
                  0.109375 = fieldNorm(doc=4517)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
  13. CARMEN : Content Analysis, Retrieval und Metadata: Effective Networking (1999) 0.02
    0.018471893 = product of:
      0.036943786 = sum of:
        0.036943786 = product of:
          0.07388757 = sum of:
            0.07388757 = weight(_text_:retrieval in 5748) [ClassicSimilarity], result of:
              0.07388757 = score(doc=5748,freq=2.0), product of:
                0.15791564 = queryWeight, product of:
                  3.024915 = idf(docFreq=5836, maxDocs=44218)
                  0.052204985 = queryNorm
                0.46789268 = fieldWeight in 5748, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.024915 = idf(docFreq=5836, maxDocs=44218)
                  0.109375 = fieldNorm(doc=5748)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
  14. Subject retrieval in a networked environment : Proceedings of the IFLA Satellite Meeting held in Dublin, OH, 14-16 August 2001 and sponsored by the IFLA Classification and Indexing Section, the IFLA Information Technology Section and OCLC (2003) 0.02
    0.017628422 = product of:
      0.035256844 = sum of:
        0.035256844 = sum of:
          0.021110734 = weight(_text_:retrieval in 3964) [ClassicSimilarity], result of:
            0.021110734 = score(doc=3964,freq=8.0), product of:
              0.15791564 = queryWeight, product of:
                3.024915 = idf(docFreq=5836, maxDocs=44218)
                0.052204985 = queryNorm
              0.13368362 = fieldWeight in 3964, product of:
                2.828427 = tf(freq=8.0), with freq of:
                  8.0 = termFreq=8.0
                3.024915 = idf(docFreq=5836, maxDocs=44218)
                0.015625 = fieldNorm(doc=3964)
          0.014146109 = weight(_text_:22 in 3964) [ClassicSimilarity], result of:
            0.014146109 = score(doc=3964,freq=2.0), product of:
              0.18281296 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.052204985 = queryNorm
              0.07738023 = fieldWeight in 3964, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.015625 = fieldNorm(doc=3964)
      0.5 = coord(1/2)
    
    Content
    Enthält die Beiträge: Devadason, F.J., N. Intaraksa u. P. Patamawongjariya u.a.: Faceted indexing application for organizing and accessing internet resources; Nicholson, D., S. Wake: HILT: subject retrieval in a distributed environment; Olson, T.: Integrating LCSH and MeSH in information systems; Kuhr, P.S.: Putting the world back together: mapping multiple vocabularies into a single thesaurus; Freyre, E., M. Naudi: MACS : subject access across languages and networks; McIlwaine, I.C.: The UDC and the World Wide Web; Garrison, W.A.: The Colorado Digitization Project: subject access issues; Vizine-Goetz, D., R. Thompson: Towards DDC-classified displays of Netfirst search results: subject access issues; Godby, C.J., J. Stuler: The Library of Congress Classification as a knowledge base for automatic subject categorization: subject access issues; O'Neill, E.T., E. Childress u. R. Dean u.a.: FAST: faceted application of subject terminology; Bean, C.A., R. Green: Improving subject retrieval with frame representation; Zeng, M.L., Y. Chen: Features of an integrated thesaurus management and search system for the networked environment; Hudon, M.: Subject access to Web resources in education; Qin, J., J. Chen: A multi-layered, multi-dimensional representation of digital educational resources; Riesthuis, G.J.A.: Information languages and multilingual subject access; Geisselmann, F.: Access methods in a database of e-journals; Beghtol, C.: The Iter Bibliography: International standard subject access to medieval and renaissance materials (400-1700); Slavic, A.: General library classification in learning material metadata: the application in IMS/LOM and CDMES metadata schemas; Cordeiro, M.I.: From library authority control to network authoritative metadata sources; Koch, T., H. Neuroth u. M. Day: Renardus: Cross-browsing European subject gateways via a common classification system (DDC); Olson, H.A., D.B. Ward: Mundane standards, everyday technologies, equitable access; Burke, M.A.: Personal Construct Theory as a research tool in Library and Information Science: case study: development of a user-driven classification of photographs
    Footnote
    Rez. in: KO 31(2004) no.2, S.117-118 (D. Campbell): "This excellent volume offers 22 papers delivered at an IFLA Satellite meeting in Dublin Ohio in 2001. The conference gathered together information and computer scientists to discuss an important and difficult question: in what specific ways can the accumulated skills, theories and traditions of librarianship be mobilized to face the challenges of providing subject access to information in present and future networked information environments? The papers which grapple with this question are organized in a surprisingly deft and coherent way. Many conferences and proceedings have unhappy sessions that contain a hodge-podge of papers that didn't quite fit any other categories. As befits a good classificationist, editor I.C. McIlwaine has kept this problem to a minimum. The papers are organized into eight sessions, which split into two broad categories. The first five sessions deal with subject domains, and the last three deal with subject access tools. The five sessions and thirteen papers that discuss access in different domains appear in order of in creasing intension. The first papers deal with access in multilingual environments, followed by papers an access across multiple vocabularies and across sectors, ending up with studies of domain-specific retrieval (primarily education). Some of the papers offer predictably strong work by scholars engaged in ongoing, long-term research. Gerard Riesthuis offers a clear analysis of the complexities of negotiating non-identical thesauri, particularly in cases where hierarchical structure varies across different languages. Hope Olson and Dennis Ward use Olson's familiar and welcome method of using provocative and unconventional theory to generate meliorative approaches to blas in general subject access schemes. Many papers, an the other hand, deal with specific ongoing projects: Renardus, The High Level Thesaurus Project, The Colorado Digitization Project and The Iter Bibliography for medieval and Renaissance material. Most of these papers display a similar structure: an explanation of the theory and purpose of the project, an account of problems encountered in the implementation, and a discussion of the results, both promising and disappointing, thus far. Of these papers, the account of the Multilanguage Access to Subjects Project in Europe (MACS) deserves special mention. In describing how the project is founded an the principle of the equality of languages, with each subject heading language maintained in its own database, and with no single language used as a pivot for the others, Elisabeth Freyre and Max Naudi offer a particularly vivid example of the way the ethics of librarianship translate into pragmatic contexts and concrete procedures. The three sessions and nine papers devoted to subject access tools split into two kinds: papers that discuss the use of theory and research to generate new tools for a networked environment, and those that discuss the transformation of traditional subject access tools in this environment. In the new tool development area, Mary Burke provides a promising example of the bidirectional approach that is so often necessary: in her case study of user-driven classification of photographs, she user personal construct theory to clarify the practice of classification, while at the same time using practice to test the theory. Carol Bean and Rebecca Green offer an intriguing combination of librarianship and computer science, importing frame representation technique from artificial intelligence to standardize syntagmatic relationships to enhance recall and precision.
  15. Kunz, M.: Subject retrieval in distributed resources : a short review of recent developments (2003) 0.02
    0.015997129 = product of:
      0.031994257 = sum of:
        0.031994257 = product of:
          0.063988514 = sum of:
            0.063988514 = weight(_text_:retrieval in 1624) [ClassicSimilarity], result of:
              0.063988514 = score(doc=1624,freq=6.0), product of:
                0.15791564 = queryWeight, product of:
                  3.024915 = idf(docFreq=5836, maxDocs=44218)
                  0.052204985 = queryNorm
                0.40520695 = fieldWeight in 1624, product of:
                  2.4494898 = tf(freq=6.0), with freq of:
                    6.0 = termFreq=6.0
                  3.024915 = idf(docFreq=5836, maxDocs=44218)
                  0.0546875 = fieldNorm(doc=1624)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Abstract
    Subject-based retrieval in distributed resources is a current problem in online searches for bibliographic references. Building portals to similar resources is only the ferst step, the subsequent navigation via different search interfaces presents certain difficulties. To make retrieval easier it is necessary to adapt these different resources. Potential approaches (standardisation as opposed to "cross-walks") and methods (automated as opposed to intellectual effort) will be discussed. This includes a Brief appraisal of the future of work with multilingual terminology: - The "classical" approach (Multilingual Thesauri), - The "Internet" approach (linking) Recent developments in mono- and multilingual environments will be presented (MACS, CARMEN, Economics Crosswalk).
  16. Hakala, J.: Z39.50-1995: information retrieval protocol : an introduction to the standard and it's usage (1996) 0.01
    0.014927543 = product of:
      0.029855086 = sum of:
        0.029855086 = product of:
          0.05971017 = sum of:
            0.05971017 = weight(_text_:retrieval in 3340) [ClassicSimilarity], result of:
              0.05971017 = score(doc=3340,freq=4.0), product of:
                0.15791564 = queryWeight, product of:
                  3.024915 = idf(docFreq=5836, maxDocs=44218)
                  0.052204985 = queryNorm
                0.37811437 = fieldWeight in 3340, product of:
                  2.0 = tf(freq=4.0), with freq of:
                    4.0 = termFreq=4.0
                  3.024915 = idf(docFreq=5836, maxDocs=44218)
                  0.0625 = fieldNorm(doc=3340)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Abstract
    This article describes the Internet information retrieval protocol, Z39.50, and it's usage. The services of Z39.50 are depicted, as are some important terms related to the standard. A description of the OPAC Network in Europe (ONE), an important Z39.50 implementation project is included
  17. Dupuis, P.; Lapointe, J.: Developpement d'un outil documentaire à Hydro-Quebec : le Thesaurus HQ (1997) 0.01
    0.014146109 = product of:
      0.028292218 = sum of:
        0.028292218 = product of:
          0.056584436 = sum of:
            0.056584436 = weight(_text_:22 in 3173) [ClassicSimilarity], result of:
              0.056584436 = score(doc=3173,freq=2.0), product of:
                0.18281296 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.052204985 = queryNorm
                0.30952093 = fieldWeight in 3173, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.0625 = fieldNorm(doc=3173)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Source
    Argus. 26(1997) no.3, S.16-22
  18. Ashton, J.: ONE: the final OPAC frontier (1998) 0.01
    0.014146109 = product of:
      0.028292218 = sum of:
        0.028292218 = product of:
          0.056584436 = sum of:
            0.056584436 = weight(_text_:22 in 2588) [ClassicSimilarity], result of:
              0.056584436 = score(doc=2588,freq=2.0), product of:
                0.18281296 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.052204985 = queryNorm
                0.30952093 = fieldWeight in 2588, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.0625 = fieldNorm(doc=2588)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Source
    Select newsletter. 1998, no.22, Spring, S.5-6
  19. Lunau, C.D.: Z39.50: a critical component of the Canadian resource sharing infrastructure : implementation activities and results achieved (1997) 0.01
    0.014146109 = product of:
      0.028292218 = sum of:
        0.028292218 = product of:
          0.056584436 = sum of:
            0.056584436 = weight(_text_:22 in 3193) [ClassicSimilarity], result of:
              0.056584436 = score(doc=3193,freq=2.0), product of:
                0.18281296 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.052204985 = queryNorm
                0.30952093 = fieldWeight in 3193, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.0625 = fieldNorm(doc=3193)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Date
    3. 3.1999 17:22:57
  20. Burrows, T.: ¬The virtual catalogue : bibliographic access for the virtual library (1993) 0.01
    0.014146109 = product of:
      0.028292218 = sum of:
        0.028292218 = product of:
          0.056584436 = sum of:
            0.056584436 = weight(_text_:22 in 5286) [ClassicSimilarity], result of:
              0.056584436 = score(doc=5286,freq=2.0), product of:
                0.18281296 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.052204985 = queryNorm
                0.30952093 = fieldWeight in 5286, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.0625 = fieldNorm(doc=5286)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Date
    8.10.2000 14:47:22

Languages

  • e 29
  • d 13
  • f 1
  • More… Less…

Types

  • a 35
  • el 4
  • m 3
  • x 3
  • r 1
  • s 1
  • More… Less…

Classifications