Search (32 results, page 1 of 2)

0.032002483 = product of:
  0.048003722 = sum of:
    0.027719175 = weight(_text_:on in 603) [ClassicSimilarity], result of:
      0.027719175 = score(doc=603,freq=6.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.25253648 = fieldWeight in 603, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.046875 = fieldNorm(doc=603)
    0.020284547 = product of:
      0.040569093 = sum of:
        0.040569093 = weight(_text_:22 in 603) [ClassicSimilarity], result of:
          0.040569093 = score(doc=603,freq=2.0), product of:
            0.1747608 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04990557 = 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)
  0.6666667 = coord(2/3)

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

0.02822417 = product of:
  0.042336255 = sum of:
    0.01867095 = weight(_text_:on in 4866) [ClassicSimilarity], result of:
      0.01867095 = score(doc=4866,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.17010231 = fieldWeight in 4866, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4866)
    0.023665305 = product of:
      0.04733061 = sum of:
        0.04733061 = weight(_text_:22 in 4866) [ClassicSimilarity], result of:
          0.04733061 = score(doc=4866,freq=2.0), product of:
            0.1747608 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04990557 = queryNorm
            0.2708308 = fieldWeight in 4866, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4866)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

Information subject gateways provide targeted discovery services for their users, giving access to Web resources selected according to quality and subject coverage criteria. Information gateways recognise that they must collaborate on a wide range of issues relating to content to ensure continued success. This report is informed by discussion of content activities at the 1999 Imesh Workshop. The author considers the implications for subject based gateways of co-operation regarding coverage policy, creation of metadata, and provision of searching and browsing across services. Other possibilities for co-operation include working more closely with information providers, and diclosure of information in joint metadata registries

Date

22. 6.2002 19:38:54

0.010669115 = product of:
  0.032007344 = sum of:
    0.032007344 = weight(_text_:on in 6862) [ClassicSimilarity], result of:
      0.032007344 = score(doc=6862,freq=8.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.29160398 = fieldWeight in 6862, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.046875 = fieldNorm(doc=6862)
  0.33333334 = coord(1/3)

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

0.010669115 = product of:
  0.032007344 = sum of:
    0.032007344 = weight(_text_:on in 4694) [ClassicSimilarity], result of:
      0.032007344 = score(doc=4694,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.29160398 = fieldWeight in 4694, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.09375 = fieldNorm(doc=4694)
  0.33333334 = coord(1/3)

0.010058938 = product of:
  0.030176813 = sum of:
    0.030176813 = weight(_text_:on in 233) [ClassicSimilarity], result of:
      0.030176813 = score(doc=233,freq=4.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.27492687 = fieldWeight in 233, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0625 = fieldNorm(doc=233)
  0.33333334 = coord(1/3)

Abstract

This article discusses the emergence of distributed library services drawing on recent European initiatives to describe developments. It focuses on Z39.50-based services. It outlines a descriptive framework for such services and briefly introduces developments in other domains. Projects funded through the EU Telematics Application Programme are highlighted and some recent developments in U.K. higher education are introduced

0.009239726 = product of:
  0.027719175 = sum of:
    0.027719175 = weight(_text_:on in 38) [ClassicSimilarity], result of:
      0.027719175 = score(doc=38,freq=6.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.25253648 = fieldWeight in 38, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.046875 = fieldNorm(doc=38)
  0.33333334 = coord(1/3)

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

0.009015355 = product of:
  0.027046064 = sum of:
    0.027046064 = product of:
      0.054092128 = sum of:
        0.054092128 = weight(_text_:22 in 127) [ClassicSimilarity], result of:
          0.054092128 = score(doc=127,freq=2.0), product of:
            0.1747608 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04990557 = 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)
  0.33333334 = coord(1/3)

Source

Program. 30(1996) no.1, S.1-22

0.009015355 = product of:
  0.027046064 = sum of:
    0.027046064 = product of:
      0.054092128 = sum of:
        0.054092128 = weight(_text_:22 in 2588) [ClassicSimilarity], result of:
          0.054092128 = score(doc=2588,freq=2.0), product of:
            0.1747608 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04990557 = 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.33333334 = coord(1/3)

Source

Select newsletter. 1998, no.22, Spring, S.5-6

0.009015355 = product of:
  0.027046064 = sum of:
    0.027046064 = product of:
      0.054092128 = sum of:
        0.054092128 = weight(_text_:22 in 3193) [ClassicSimilarity], result of:
          0.054092128 = score(doc=3193,freq=2.0), product of:
            0.1747608 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04990557 = 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.33333334 = coord(1/3)

Date

3. 3.1999 17:22:57

0.009015355 = product of:
  0.027046064 = sum of:
    0.027046064 = product of:
      0.054092128 = sum of:
        0.054092128 = weight(_text_:22 in 5286) [ClassicSimilarity], result of:
          0.054092128 = score(doc=5286,freq=2.0), product of:
            0.1747608 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04990557 = 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.33333334 = coord(1/3)

Date

8.10.2000 14:47:22

0.008801571 = product of:
  0.026404712 = sum of:
    0.026404712 = weight(_text_:on in 2290) [ClassicSimilarity], result of:
      0.026404712 = score(doc=2290,freq=4.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.24056101 = fieldWeight in 2290, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2290)
  0.33333334 = coord(1/3)

Abstract

This paper proposes the integration of tools to provide unified access to remote and heterogeneous archives, the contents of which can be grouped under the same subject, and which have been integrated to allow the user to navigate and conduct thematic searches. The information sources are locally frequently modified, added to, and removed, therefore attention has been paid to the permanence of their references. Source interoperability is supported at language, protocol and schema levels. The architecture is based on a new common schema of the archives which is defined in new representation and query languages on the basis of an ontology to avoid misunderstanding and ambiguity.

0.0076997704 = product of:
  0.02309931 = sum of:
    0.02309931 = weight(_text_:on in 5591) [ClassicSimilarity], result of:
      0.02309931 = score(doc=5591,freq=6.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.21044704 = fieldWeight in 5591, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5591)
  0.33333334 = coord(1/3)

Abstract

Purpose - To explore the use of middleware to provide access to a virtual catalogue via Z39.50, allowing its integration with other services. To consider issues arising from the cross-database search process and the problem of interoperability between systems. Design/methodology/approach - Middleware was used to establish a Z39.50 server for an existing virtual union catalogue, InforM25. The Copac physical union catalogue was used to carry out cross-database search tests, investigating the value of query transformation by the middleware and illustrating many of the issues associated with interoperability in cross-database searching. Findings - The test results demonstrate the viability and benefits of using middleware to allow the integration of virtual catalogues with other services. The results also illustrate the range of issues affecting the performance of the virtual catalogue, with supporting evidence from the use of the Copac physical union catalogue for cross-database searching via Z39.50. In particular the discussion highlights the issue of semantic interoperability, as well as emphasising the value of centralised virtual catalogue support. Research limitations/implications - The research was limited to work on a specific virtual union catalogue, that is InforM25, but the results highlight issues with general relevance in the development of any virtual catalogue. The need for more work on response times in the virtual union catalogue is apparent, along with the related issue of result set post processing. Originality/value - This paper provides a practical demonstration of the issues important to those involved in making their local catalogue accessible to services, and individuals, outside their own institution, as well as those working on virtual union catalogue development.

0.0076997704 = product of:
  0.02309931 = sum of:
    0.02309931 = weight(_text_:on in 1193) [ClassicSimilarity], result of:
      0.02309931 = score(doc=1193,freq=6.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.21044704 = fieldWeight in 1193, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1193)
  0.33333334 = coord(1/3)

Abstract

This article describes two approaches for searching heterogeneous resources, which are explained as they are used in two corresponding existing systems-RIRS (Resource Integration Retrieval System) and HRUSP (Heterogeneous Resource Union Search Platform). On analyzing the existing systems, a possible framework-the MUSP (Multimetadata-Based Union Search Platform) is presented. Libraries now face a dilemma. On one hand, libraries subscribe to many types of database retrieval systems that are produced by various providers. The libraries build their data and information systems independently. This results in highly heterogeneous and distributed systems at the technical level (e.g., different operating systems and user interfaces) and at the conceptual level (e.g., the same objects are named using different terms). On the other hand, end users want to access all these heterogeneous data via a union interface, without having to know the structure of each information system or the different retrieval methods used by the systems. Libraries must achieve a harmony between information providers and users. In order to bridge the gap between the service providers and the users, it would seem that all source databases would need to be rebuilt according to a uniform data structure and query language, but this seems impossible. Fortunately, however, libraries and information and technology providers are now making an effort to find a middle course that meets the requirements of both data providers and users. They are doing this through resource integration.

0.0067615155 = product of:
  0.020284547 = sum of:
    0.020284547 = product of:
      0.040569093 = sum of:
        0.040569093 = weight(_text_:22 in 5271) [ClassicSimilarity], result of:
          0.040569093 = score(doc=5271,freq=2.0), product of:
            0.1747608 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04990557 = 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)
  0.33333334 = coord(1/3)

Date

22. 7.2006 16:02:07

0.0062868367 = product of:
  0.01886051 = sum of:
    0.01886051 = weight(_text_:on in 6470) [ClassicSimilarity], result of:
      0.01886051 = score(doc=6470,freq=4.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.1718293 = fieldWeight in 6470, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0390625 = fieldNorm(doc=6470)
  0.33333334 = coord(1/3)

Abstract

PhysNet offers online services that enable a physicist to keep in touch with the worldwide physics community and to receive all information he or she may need. In addition to being of great value to physicists, these services are practical examples of the use of modern methods of digital libraries, in particular the use of metadata harvesting. One service is PhysDoc. This consists of a Harvest-based online information broker- and gatherer-network, which harvests information from the local web-servers of professional physics institutions worldwide (mostly in Europe and USA so far). PhysDoc focuses on scientific information posted by the individual scientist at his local server, such as documents, publications, reports, publication lists, and lists of links to documents. All rights are reserved for the authors who are responsible for the content and quality of their documents. PhysDis is an analogous service but specifically for university theses, with their dual requirements of examination work and publication. The strategy is to select high quality sites containing metadata. We report here on the present status of PhysNet, our experience in operating it, and the development of its usage. To continuously involve authors, research groups, and national societies is considered crucial for a future stable service.

0.0062868367 = product of:
  0.01886051 = sum of:
    0.01886051 = weight(_text_:on in 4951) [ClassicSimilarity], result of:
      0.01886051 = score(doc=4951,freq=4.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.1718293 = fieldWeight in 4951, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4951)
  0.33333334 = coord(1/3)

Abstract

Purpose - To describe the process and results of the business-planning workpackage of The European Library (TEL) project, in which eight national libraries collaborated on a joint approach to access to their digital libraries. Design/methodology/approach - The methodology was in three parts: first, a literature review and the mapping of the partners' existing and planned digital products and services, then a structured interview or survey to determine the partners' business requirements from TEL, then a harmonization process, and finally the results were then combined with normal business planning elements to produce a mission and final business plan. Findings - Business planning for digital libraries has hitherto not been widely reported. The methodology proved to be an effective method of achieving mutual agreement among partners with widely different aims and characteristics. Eleven harmonized service aspirations were agreed and five categories of business aims. Research limitations/implications - Focused on the business aims of national libraries, but the methodology can be relevant to other collaborative projects. Together with the few existing other reports, this can form the basis for a new field of work. Practical implications - The work described led directly to the creation of an operational service, which will be open to all European national libraries. Originality/value - As far as is known, the first reporting of a collaborative international planning process for a digital library, and maybe the first multi-partner business plan between national libraries.

0.0062868367 = product of:
  0.01886051 = sum of:
    0.01886051 = weight(_text_:on in 984) [ClassicSimilarity], result of:
      0.01886051 = score(doc=984,freq=4.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.1718293 = fieldWeight in 984, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0390625 = fieldNorm(doc=984)
  0.33333334 = coord(1/3)

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.

0.0062868367 = product of:
  0.01886051 = sum of:
    0.01886051 = weight(_text_:on in 1154) [ClassicSimilarity], result of:
      0.01886051 = score(doc=1154,freq=4.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.1718293 = fieldWeight in 1154, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1154)
  0.33333334 = coord(1/3)

Abstract

Metasearch - also called parallel search, federated search, broadcast search, and cross-database search - has become commonplace in the information community's vocabulary. All speak to a common theme of searching and retrieving from multiple databases, sources, platforms, protocols, and vendors at the point of the user's request. Metasearch services rely on a variety of approaches including open standards (such as NISO's Z39.50 and SRU/SRW), proprietary programming interfaces, and "screen scraping." However, the absence of widely supported standards, best practices, and tools makes the metasearch environment less efficient for the metasearch provider, the content provider, and ultimately the end-user. To spur the development of widely supported standards and best practices, the National Information Standards Organization (NISO) sponsored a Metasearch Initiative in 2003 to enable: * metasearch service providers to offer more effective and responsive services, * content providers to deliver enhanced content and protect their intellectual property, and * libraries to deliver a simple search (a.k.a. "Google") that covers the breadth of their vetted commercial and free resources. The Access Management Task Group was one of three groups chartered by NISO as part of the Metasearch Initiative. The focus of the group was on gathering requirements for Metasearch authentication and access needs, inventorying existing processes, developing a series of formal use cases describing the access needs, recommending best practices given today's processes, and recommending and pursing changes to current solutions to better support metasearch applications. In September 2005, the group issued their final report and recommendation. This article summarizes the group's work and final recommendation.

0.00622365 = product of:
  0.01867095 = sum of:
    0.01867095 = weight(_text_:on in 3196) [ClassicSimilarity], result of:
      0.01867095 = score(doc=3196,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.17010231 = fieldWeight in 3196, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3196)
  0.33333334 = coord(1/3)

Abstract

The Nordic SR-net project started in 1991, with the aim to develop communications between university library systems and union catalogues in all five Nordic countries, based on the ISO protocol Search and Retrieve. The plan was to develop totally integrated solutions, where the use interface of the remote systems would be hidden, and users can use their own interfaces from their own home systems

0.00622365 = product of:
  0.01867095 = sum of:
    0.01867095 = weight(_text_:on in 31) [ClassicSimilarity], result of:
      0.01867095 = score(doc=31,freq=2.0), product of:
        0.109763056 = queryWeight, product of:
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.04990557 = queryNorm
        0.17010231 = fieldWeight in 31, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.199415 = idf(docFreq=13325, maxDocs=44218)
          0.0546875 = fieldNorm(doc=31)
  0.33333334 = coord(1/3)

Series

The Kluwer international series on information retrieval; 7