Search (34 results, page 1 of 2)

0.027840534 = product of:
  0.06496125 = sum of:
    0.027029924 = weight(_text_:retrieval in 3194) [ClassicSimilarity], result of:
      0.027029924 = score(doc=3194,freq=2.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = queryNorm
        0.23394634 = fieldWeight in 3194, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3194)
    0.025746709 = weight(_text_:internet in 3194) [ClassicSimilarity], result of:
      0.025746709 = score(doc=3194,freq=2.0), product of:
        0.11276311 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.03819578 = queryNorm
        0.22832564 = fieldWeight in 3194, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3194)
    0.0121846115 = product of:
      0.036553834 = sum of:
        0.036553834 = weight(_text_:29 in 3194) [ClassicSimilarity], result of:
          0.036553834 = score(doc=3194,freq=2.0), product of:
            0.13436082 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.03819578 = queryNorm
            0.27205724 = fieldWeight in 3194, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3194)
      0.33333334 = coord(1/3)
  0.42857143 = coord(3/7)

Abstract

The State Library of Iowa, USA, received a Higher Education Act title II grant from the US Dept. of Education in 1994 to create a demonstration project of new library information technologies. Describes 2 interlinked components of the project: Web-based union catalogue development and statewide deployment of the ANSI/NISO Z39.50 standard for database search and retrieval. Z39.50 was chosen because of its ability to searching multiple remote databases in a single session and its common interface across a variety of implementations. Use of a distributed Z39.50 search makes the need for maintaining large union catalogues unnecessary

Source

Computers in libraries. 17(1997) no.10, S.27-29

Theme

Internet

0.024669115 = product of:
  0.086341895 = sum of:
    0.030891342 = weight(_text_:retrieval in 127) [ClassicSimilarity], result of:
      0.030891342 = score(doc=127,freq=2.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = 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.05545055 = product of:
      0.08317582 = sum of:
        0.04177581 = weight(_text_:29 in 127) [ClassicSimilarity], result of:
          0.04177581 = score(doc=127,freq=2.0), product of:
            0.13436082 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.03819578 = queryNorm
            0.31092256 = fieldWeight in 127, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.0625 = fieldNorm(doc=127)
        0.041400008 = weight(_text_:22 in 127) [ClassicSimilarity], result of:
          0.041400008 = score(doc=127,freq=2.0), product of:
            0.13375512 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03819578 = 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.6666667 = coord(2/3)
  0.2857143 = coord(2/7)

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

Date

3. 3.1999 17:29:59

Source

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

0.023823049 = product of:
  0.055587113 = sum of:
    0.023168506 = weight(_text_:retrieval in 603) [ClassicSimilarity], result of:
      0.023168506 = score(doc=603,freq=2.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = 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.022068607 = weight(_text_:internet in 603) [ClassicSimilarity], result of:
      0.022068607 = score(doc=603,freq=2.0), product of:
        0.11276311 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.03819578 = queryNorm
        0.1957077 = fieldWeight in 603, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.046875 = fieldNorm(doc=603)
    0.010350002 = product of:
      0.031050006 = sum of:
        0.031050006 = weight(_text_:22 in 603) [ClassicSimilarity], result of:
          0.031050006 = score(doc=603,freq=2.0), product of:
            0.13375512 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03819578 = 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.33333334 = coord(1/3)
  0.42857143 = coord(3/7)

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.020732546 = product of:
  0.07256391 = sum of:
    0.046817202 = weight(_text_:retrieval in 1624) [ClassicSimilarity], result of:
      0.046817202 = score(doc=1624,freq=6.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = 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.025746709 = weight(_text_:internet in 1624) [ClassicSimilarity], result of:
      0.025746709 = score(doc=1624,freq=2.0), product of:
        0.11276311 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.03819578 = queryNorm
        0.22832564 = fieldWeight in 1624, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1624)
  0.2857143 = coord(2/7)

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).

0.015666807 = product of:
  0.054833822 = sum of:
    0.032765217 = weight(_text_:retrieval in 3810) [ClassicSimilarity], result of:
      0.032765217 = score(doc=3810,freq=4.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = queryNorm
        0.2835858 = fieldWeight in 3810, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=3810)
    0.022068607 = weight(_text_:internet in 3810) [ClassicSimilarity], result of:
      0.022068607 = score(doc=3810,freq=2.0), product of:
        0.11276311 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.03819578 = queryNorm
        0.1957077 = fieldWeight in 3810, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.046875 = fieldNorm(doc=3810)
  0.2857143 = coord(2/7)

Abstract

The HILT High Level Thesaurus Project aims to study and report an the problern of cross-searching and browsing by subject across a range of communities, services, and service or resource types in the UK given the wide range of subject schemes and associated practices in place in the communities in question (Libraries, Museums, Archives, and Internet Services) and taking the international context into consideration. The paper reports an progess to date, focusing particularly an the inter-community consensus reached at a recent Stakeholder Workshop.

Source

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. Ed.: I.C. McIlwaine

0.014403056 = product of:
  0.050410695 = sum of:
    0.038226083 = weight(_text_:retrieval in 3608) [ClassicSimilarity], result of:
      0.038226083 = score(doc=3608,freq=4.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = queryNorm
        0.33085006 = fieldWeight in 3608, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3608)
    0.0121846115 = product of:
      0.036553834 = sum of:
        0.036553834 = weight(_text_:29 in 3608) [ClassicSimilarity], result of:
          0.036553834 = score(doc=3608,freq=2.0), product of:
            0.13436082 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.03819578 = queryNorm
            0.27205724 = fieldWeight in 3608, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3608)
      0.33333334 = coord(1/3)
  0.2857143 = coord(2/7)

Abstract

In this position paper we propose a document-centric middleware component called Living Documents to support context-aware information retrieval in distributed communities. A Living Document acts as a micro server for a document which contains computational services, a semi-structured knowledge repository to uniformly store and access context-related information, and finally the document's digital content. Our initial prototype of Living Documents is based an the concept of mobile agents and implemented in Java and XML.

Source

Gaining insight from research information (CRIS2002): Proceedings of the 6th International Conference an Current Research Information Systems, University of Kassel, August 29 - 31, 2002. Eds: W. Adamczak u. A. Nase

0.012960522 = product of:
  0.045361828 = sum of:
    0.0077228355 = weight(_text_:retrieval in 2789) [ClassicSimilarity], result of:
      0.0077228355 = score(doc=2789,freq=2.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = queryNorm
        0.06684181 = fieldWeight in 2789, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.015625 = fieldNorm(doc=2789)
    0.037638992 = weight(_text_:bibliothek in 2789) [ClassicSimilarity], result of:
      0.037638992 = score(doc=2789,freq=14.0), product of:
        0.15681393 = queryWeight, product of:
          4.1055303 = idf(docFreq=1980, maxDocs=44218)
          0.03819578 = queryNorm
        0.24002326 = fieldWeight in 2789, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          4.1055303 = idf(docFreq=1980, maxDocs=44218)
          0.015625 = fieldNorm(doc=2789)
  0.2857143 = coord(2/7)

Content

"... unter diesem Motto hat die Deutsche Bücherei Leipzig am 23. März 2004 auf dem Leipziger Kongress für Bibliothek und Information eine Vortragsreihe initiiert. Vorgestellt wurden Projekte, die sich im Spannungsfeld von Standardisierung und Heterogenität der Sacherschließung bewegen. Die Benutzer unserer Bibliotheken und Informationseinrichtungen stehen heute einer Fülle von Informationen gegenüber, die sie aus zahlreichen Katalogen und Fachdatenbanken abfragen können. Diese Recherche kann schnell zeitraubend werden, wenn der Benutzer mit verschiedenen Suchbegriffen und -logiken arbeiten muss, um zur gewünschten Ressource zu gelangen. Ein Schlagwort A kann in jedem der durchsuchten Systeme eine andere Bedeutung annehmen. Homogenität erreicht man klassisch zunächst durch Normierung und Standardisierung. Für die zwei traditionellen Verfahren der inhaltlichen Erschließung - der klassifikatorischen und der verbalen - haben sich in Deutschland verschiedene Standards durchgesetzt. Klassifikatorische Erschließung wird mit ganz unterschiedlichen Systemen betrieben. Verbreitet sind etwa die Regensburger Verbundklassifikation (RVK) oder die Basisklassifikation (BK). Von Spezial- und Facheinrichtungen werden entsprechende Fachklassifikationen eingesetzt. Weltweit am häufigsten angewandt ist die Dewey Decimal Classification (DDC), die seit 2003 ins Deutsche übertragen wird. Im Bereich der verbalen Sacherschließung haben sich, vor allem bei den wissenschaftlichen Universalbibliotheken, die Regeln für den Schlagwortkatalog (RSWK) durchgesetzt, durch die zugleich die Schlagwortnormdatei (SWD) kooperativ aufgebaut wurde. Daneben erschließen wiederum viele Spezial- und Facheinrichtungen mit selbst entwickelten Fachthesauri.
Neben die Pflege der Standards tritt als Herausforderung die Vernetzung der Systeme, um heterogene Dokumentenbestände zu verbinden. »Standardisierung muss von der verbleibenden Heterogenität her gedacht werden«." Diese Aufgaben können nur in Kooperation von Bibliotheken und Informationseinrichtungen gelöst werden. Die vorgestellten Projekte zeigen, wie dies gelingen kann. Sie verfolgen alle das Ziel, Informationen über Inhalte schneller und besser für die Nutzer zur Verfügung zu stellen. Fachliche Recherchen über mehrere Informationsanbieter werden durch die Heterogenität überwindende Suchdienste ermöglicht. Die Einführung der DDC im deutschen Sprachraum steht genau im Kern des Spannungsfeldes. Die DDC stellt durch ihren universalen Charakter nicht nur einen übergreifenden Standard her. Ihre Anwendung ist nur nutzbringend, wenn zugleich die Vernetzung mit den in Deutschland bewährten Klassifikationen und Thesauri erfolgt. Ziel des Projektes DDC Deutsch ist nicht nur eine Übersetzung ins Deutsche, die DDC soll auch in Form elektronischer Dienste zur Verfügung gestellt werden. Dr. Lars Svensson, Deutsche Bibliothek Frankfurt am Main, präsentierte anschaulichdie Möglichkeiten einer intelligenten Navigation über die DDC. Für die Dokumentenbestände Der Deutschen Bibliothek, des Gemeinsamen Bibliotheksverbundes (GBV) und der Niedersächsischen Staats- und Universitätsbibliothek Göttingen wurde prototypisch ein Webservice realisiert.
Dieses DDC-Tool ermöglicht den Zugriff auf lokale, mit DDC-erschlossene Titeldaten. Für einige bereits übersetzte DDC-Klassen kann mithilfe eines Browsers gearbeitet werden. Auch die gezielte verbale Suche nach DDC-Elementen ist möglich. Die Frage nach Aspekten, wie z. B. geografischen, soll durch getrennte Ablage der Notationselemente in den Titeldatensätzen ermöglicht werden. Schließlich lassen sich künftig auch integrierte Suchen über DDC und SWD oder andere Erschließungssysteme denken, um Literatur zu einem Thema zu finden. Das von Lars Svensson vorgestellte Retrieval-Interface bietet eine zentrale Lösung: nicht für jeden lokalen OPAC müssen eigene Suchstrukturen entwickelt werden, um auf DDC-Daten zugreifen zu können. Wie Datenbestände mit verschiedenen Erschließungen unter einer Oberfläche zusammengeführt werden und dabei die DDC als Meta-Ebene genutzt wird, das ist heute schon im Subject Gateway Renardus sichtbar." Der Renardus-Broker ermöglicht das Cross-Browsen und Cross-Searchen über verteilte Internetquellen in Europa. Für die Navigation über die DDC mussten zunächst Crosswalks zwischen den lokalen Klassifikationsklassen und der DDC erstellt werden. Das an der Universitätsbibliothek Regensburg entwickelte Tool CarmenX wurde dazu von der Niedersächsischen Staats- und Universitätsbibliothek Göttingen weiterentwickelt und ermöglicht den Zugriff auf die ver schiedenen Klassifikationssysteme. Über diese Entwicklungen berichtete Dr. Friedrich Geißelmann, Universitäsbibliothek Regensburg. Er leitete das CARMEN-Teilprojekt »Grosskonkordanzen zwischen Thesauri und Klassifikationen«, in dem das Werkzeug CarmenX entstand. In diesem CARMEN-Arbeitspaket erfolgten sowohl grundlegende methodische Untersuchungen zu Crosskonkordanzen als auch prototypische Umsetzungen in den Fachgebieten Mathematik, Physik und Sozialwissenschaften. Ziel war es, bei Recherchen in verteilten Datenbanken mit unterschiedlichen Klassifikationen und Thesauri von einem vertrauten System auszugehen und in weitere wechseln zu können, ohne genaue Kenntnis von den Systemen haben zu müssen. So wurden z. B. im Bereich Crosskonkordanzen zwischen Allgemein- und Fachklassifikationen die RVK und die Mathematical Subject Classification (MSC) und Physics and Astronomy Classification Scheme (PACS) ausgewählt.
Katja Heyke, Universitäts- und Stadtbibliothek Köln, und Manfred Faden, Bibliothek des HWWA-Instituts für Wirtschaftsforschung Hamburg, stellten ähnliche Entwicklungen für den Fachbereich Wirtschaftswissenschaften vor. Hier wird eine Crosskonkordanz zwischen dem Standard Thesaurus Wirtschaft (STW) und dem Bereich Wirtschaft der SWD aufgebaut." Diese Datenbank soll den Zugriff auf die mit STW und SWD erschlossenen Bestände ermöglichen. Sie wird dazu weitergegeben an die virtuelle Fachbibliothek EconBiz und an den Gemeinsamen Bibliotheksverbund. Die Crosskonkordanz Wirtschaft bietet aber auch die Chance zur kooperativen Sacherschließung, denn sie eröffnet die Möglichkeit der gegenseitigen Übernahme von Sacherschließungsdaten zwischen den Partnern Die Deutsche Bibliothek, Universitäts- und Stadtbibliothek Köln, HWWA und Bibliothek des Instituts für Weltwirtschaft Kiel. Am Beispiel der Wirtschaftswissenschaften zeigt sich der Gewinn solcher KonkordanzProjekte für Indexierer und Benutzer. Der Austausch über die Erschließungsregeln und die systematische Analyse der Normdaten führen zur Bereinigung von fachlichen Schwachstellen und Inkonsistenzen in den Systemen. Die Thesauri werden insgesamt verbessert und sogar angenähert. Die Vortragsreihe schloss mit einem Projekt, das die Heterogenität der Daten aus dem Blickwinkel der Mehrsprachigkeit betrachtet. Martin Kunz, Deutsche Bibliothek Frankfurt am Main, informierte über das Projekt MACS (Multilingual Access to Subject Headings). MACS bietet einen mehrsprachigen Zugriff auf Bibliothekskataloge. Dazu wurde eine Verbindung zwischen den Schlagwortnormdateien LCSH, RAMEAU und SWD erarbeitet. Äquivalente Vorzugsbezeichnungen der Normdateien werden intellektuell nachgewiesen und als Link abgelegt. Das Projekt beschränkte sich zunächst auf die Bereiche Sport und Theater und widmet sich in einer nächsten Stufe den am häufigsten verwendeten Schlagwörtern. MACS geht davon aus, dass ein Benutzer in der Sprache seiner Wahl (Deutsch, Englisch, Französisch) eine Schlagwortsuche startet, und ermöglicht ihm, seine Suche auf die affilierten Datenbanken im Ausland auszudehnen. Martin Kunz plädierte für einen Integrationsansatz, der auf dem gegenseitigen Respekt vor der Terminologie der kooperierenden Partner beruht. Er sprach sich dafür aus, in solchen Vorhaben den Begriff der Thesaurus föderation anzuwenden, der die Autonomie der Thesauri unterstreicht.

0.012345479 = product of:
  0.043209173 = sum of:
    0.032765217 = weight(_text_:retrieval in 3597) [ClassicSimilarity], result of:
      0.032765217 = score(doc=3597,freq=4.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = queryNorm
        0.2835858 = fieldWeight in 3597, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=3597)
    0.010443954 = product of:
      0.03133186 = sum of:
        0.03133186 = weight(_text_:29 in 3597) [ClassicSimilarity], result of:
          0.03133186 = score(doc=3597,freq=2.0), product of:
            0.13436082 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.03819578 = queryNorm
            0.23319192 = fieldWeight in 3597, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.046875 = fieldNorm(doc=3597)
      0.33333334 = coord(1/3)
  0.2857143 = coord(2/7)

Abstract

User demands to have access to complete and actual information about research may require integration of data from different CRISs. CRISs are rarely homogenous systems and problems of CRISs integration must be addressed from technological point of view. Implementation of CRIS providing access to heterogeneous data distributed among a number of CRISs is described. A few technologies - distributed databases, web services, semantic web are used for distributed CRIS to address different user requirements. Distributed databases serve to implement very efficient integration of homogenous systems, web services - to provide open access to research information, semantic web - to solve problems of integration semantically and structurally heterogeneous data sources and provide intelligent data retrieval interfaces. The problems of data completeness in distributed systems are addressed and CRIS-adequate solution for data completeness is suggested.

Source

Gaining insight from research information (CRIS2002): Proceedings of the 6th International Conference an Current Research Information Systems, University of Kassel, August 29 - 31, 2002. Eds: W. Adamczak u. A. Nase

0.011317904 = product of:
  0.039612662 = sum of:
    0.027304346 = weight(_text_:retrieval in 3951) [ClassicSimilarity], result of:
      0.027304346 = score(doc=3951,freq=4.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = queryNorm
        0.23632148 = fieldWeight in 3951, 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=3951)
    0.012308316 = product of:
      0.036924947 = sum of:
        0.036924947 = weight(_text_:29 in 3951) [ClassicSimilarity], result of:
          0.036924947 = score(doc=3951,freq=4.0), product of:
            0.13436082 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.03819578 = queryNorm
            0.2748193 = fieldWeight in 3951, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3951)
      0.33333334 = coord(1/3)
  0.2857143 = coord(2/7)

Abstract

Purpose - Biodiversity resources are inevitably digital and stored in a wide variety of formats by researchers or stakeholders. In Malaysia, although digitizing biodiversity data has long been stressed, the interoperability of the biodiversity data is still an issue that requires attention. This is because, when data are shared, the question of copyright occurs, creating a setback among researchers wanting to promote or share data through online presentations. To solve this, the aim is to present an approach to integrate data through wrapping of datasets stored in relational databases located on networked platforms. Design/methodology/approach - The approach uses tools such as XML, PHP, ASP and HTML to integrate distributed databases in heterogeneous formats. Five current database integration systems were reviewed and all of them have common attributes such as query-oriented, using a mediator-based approach and integrating a structured data model. These common attributes were also adopted in the proposed solution. Distributed Generic Information Retrieval (DiGIR) was used as a model in designing the proposed solution. Findings - A new database integration system was developed, which is user-friendly and simple with common attributes found in current integration systems.

Date

29. 8.2010 12:29:10

0.010265528 = product of:
  0.03592935 = sum of:
    0.027304346 = weight(_text_:retrieval in 6959) [ClassicSimilarity], result of:
      0.027304346 = score(doc=6959,freq=4.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = 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.008625003 = product of:
      0.025875006 = sum of:
        0.025875006 = weight(_text_:22 in 6959) [ClassicSimilarity], result of:
          0.025875006 = score(doc=6959,freq=2.0), product of:
            0.13375512 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03819578 = 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.33333334 = coord(1/3)
  0.2857143 = coord(2/7)

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

0.009929359 = product of:
  0.06950551 = sum of:
    0.06950551 = weight(_text_:retrieval in 38) [ClassicSimilarity], result of:
      0.06950551 = score(doc=38,freq=18.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = 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.14285715 = coord(1/7)

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

0.009576717 = product of:
  0.033518508 = sum of:
    0.023168506 = weight(_text_:retrieval in 5271) [ClassicSimilarity], result of:
      0.023168506 = score(doc=5271,freq=2.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = 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.010350002 = product of:
      0.031050006 = sum of:
        0.031050006 = weight(_text_:22 in 5271) [ClassicSimilarity], result of:
          0.031050006 = score(doc=5271,freq=2.0), product of:
            0.13375512 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03819578 = 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.33333334 = coord(1/3)
  0.2857143 = coord(2/7)

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

0.009458503 = product of:
  0.06620952 = sum of:
    0.06620952 = weight(_text_:retrieval in 31) [ClassicSimilarity], result of:
      0.06620952 = score(doc=31,freq=12.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = 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.14285715 = coord(1/7)

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

0.009361491 = product of:
  0.065530434 = sum of:
    0.065530434 = weight(_text_:retrieval in 6862) [ClassicSimilarity], result of:
      0.065530434 = score(doc=6862,freq=16.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = 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.14285715 = coord(1/7)

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

0.009147767 = product of:
  0.064034365 = sum of:
    0.064034365 = weight(_text_:retrieval in 984) [ClassicSimilarity], result of:
      0.064034365 = score(doc=984,freq=22.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = 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.14285715 = coord(1/7)

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.008800181 = product of:
  0.06160126 = sum of:
    0.06160126 = weight(_text_:bibliothek in 4952) [ClassicSimilarity], result of:
      0.06160126 = score(doc=4952,freq=6.0), product of:
        0.15681393 = queryWeight, product of:
          4.1055303 = idf(docFreq=1980, maxDocs=44218)
          0.03819578 = queryNorm
        0.39283025 = fieldWeight in 4952, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          4.1055303 = idf(docFreq=1980, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4952)
  0.14285715 = coord(1/7)

Content

"Die Nationalbibliotheken von Dänemark, Estland und Lettland haben mit Jahresbeginn den Teilnehmerkreis von »The European Library« (www.europeanlibrary.com) erweitert. Mit der Weiterentwicklung der Portalsoftware ist das Angebot schneller und zuverlässiger geworden. Die unter dem Namen "The Europcan Library," (TEL) im Spätherbst vergangenen Jahres gestartete Europäische Digitale Bibliothek wächst weiter. Bis Ende 2006 werden die Onlinekataloge und mehr als 200 Sammlungen von 2,3 europäischen Nationalbibliotheken über dieses Internetportal recherchierbar sein. Das Angebot wird sich damit innerhalb eines Jahres nahezu verdoppeln. The European library ermöglicht integrierte Suchanfragen über institutionelle und geografische Grenzen hinweg. Das in den umfangreichen Datenbeständen der Bibliotheken repräntierte kuIturelle Erbe Europas wird damit vom Schreibtisch aus zugänglich. Urheberrechtsfreie digitale Dokumente können direkt abgerufen werden. Teilnehmende Bibliotheken passen ihre Kataloge an die Metadaten- und Suchstandards der Europäischen Digitalen Bibliothek an und ermöglichen damit die katalog- und sammlurngsübergreifende Recherche. Für The European Library wurde eine neue Webtechnologie verwendet, mit der Portalfunktionen einfach und preiswert realisiert werden können. Die Software "Portal-in-the-Browser" (www.dlib.org/dlib/february04/vanveen/02vanveen.html) steht Interessenten frei zur Verfügung. Die Entwickler erhoffen eine Anwendung in weiteren kulturellen Bereichen und damit die mögliche Verknüpfung der verschiedenen Sektoren. Für das kommende Frühjahr ist eine Benutzerbefragung zur weiteren Verbesserung von The European library geplant."

0.007722836 = product of:
  0.05405985 = sum of:
    0.05405985 = weight(_text_:retrieval in 4517) [ClassicSimilarity], result of:
      0.05405985 = score(doc=4517,freq=2.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = 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.14285715 = coord(1/7)

0.0059447093 = product of:
  0.041612964 = sum of:
    0.041612964 = weight(_text_:internet in 1256) [ClassicSimilarity], result of:
      0.041612964 = score(doc=1256,freq=16.0), product of:
        0.11276311 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.03819578 = queryNorm
        0.36902997 = fieldWeight in 1256, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.03125 = fieldNorm(doc=1256)
  0.14285715 = coord(1/7)

Abstract

This article describes an approach for linking geographically distributed collections of metadata so that they are searchable as a single collection. We describe the infrastructure, which uses standard Internet protocols such as the Lightweight Directory Access Protocol (LDAP) and the Common Indexing Protocol (CIP), to distribute queries, return results, and exchange index information. We discuss the advantages of using linked collections of authoritative metadata as an alternative to using a keyword indexing search-engine for resource discovery. We examine other architectures that use metadata for resource discovery, such as Dienst/NCSTRL, the AHDS HTTP/Z39.50 Gateway, and the ROADS initiative. Finally, we discuss research issues and future directions of the project. The Internet Scout Project, which is funded by the National Science Foundation and is located in the Computer Sciences Department at the University of Wisconsin-Madison, is charged with assisting the higher education community in resource discovery on the Internet. To that end, the Scout Report and subsequent subject-specific Scout Reports were developed to guide the U.S. higher education community to research-quality resources. The Scout Report Signpost utilizes the content from the Scout Reports as the basis of a metadata collection. Signpost consists of more than 2000 cataloged Internet sites using established standards such as Library of Congress subject headings and abbreviated call letters, and emerging standards such as the Dublin Core (DC). This searchable and browseable collection is free and freely accessible, as are all of the Internet Scout Project's services.
As well developed as both the Scout Reports and Signpost are, they cannot capture the wealth of high-quality content that is available on the Internet. An obvious next step toward increasing the usefulness of our own collection and its value to our customer base is to partner with other high-quality content providers who have developed similar collections and to develop a single, virtual collection. Project Isaac (working title) is the Internet Scout Project's latest resource discovery effort. Project Isaac involves the development of a research testbed that allows experimentation with protocols and algorithms for creating, maintaining, indexing and searching distributed collections of metadata. Project Isaac's infrastructure uses standard Internet protocols, such as the Lightweight Directory Access Protocol (LDAP) and the Common Indexing Protocol (CIP) to distribute queries, return results, and exchange index or centroid information. The overall goal is to support a single-search interface to geographically distributed and independently maintained metadata collections.

0.005516311 = product of:
  0.038614176 = sum of:
    0.038614176 = weight(_text_:retrieval in 1193) [ClassicSimilarity], result of:
      0.038614176 = score(doc=1193,freq=8.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = queryNorm
        0.33420905 = fieldWeight in 1193, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1193)
  0.14285715 = coord(1/7)

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.0047772657 = product of:
  0.033440858 = sum of:
    0.033440858 = weight(_text_:retrieval in 1164) [ClassicSimilarity], result of:
      0.033440858 = score(doc=1164,freq=6.0), product of:
        0.11553899 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.03819578 = queryNorm
        0.28943354 = fieldWeight in 1164, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1164)
  0.14285715 = coord(1/7)

Abstract

The objective of the European Library (TEL) project [TEL] was to set up a co-operative framework and specify a system for integrated access to the major collections of the European national libraries. This has been achieved by successfully applying a new approach for search and retrieval via URLs (SRU) [ZiNG] combined with a new metadata paradigm. One aim of the TEL approach is to have a low barrier of entry into TEL, and this has driven our choice for the technical solution described here. The solution comprises portal and client functionality running completely in the browser, resulting in a low implementation barrier and maximum scalability, as well as giving users control over the search interface and what collections to search. In this article we will describe, step by step, the development of both the search and retrieval architecture and the metadata infrastructure in the European Library project. We will show that SRU is a good alternative to the Z39.50 protocol and can be implemented without losing investments in current Z39.50 implementations. The metadata model being used by TEL is a Dublin Core Application Profile, and we have taken into account that functional requirements will change over time and therefore the metadata model will need to be able to evolve in a controlled way. We make this possible by means of a central metadata registry containing all characteristics of the metadata in TEL. Finally, we provide two scenarios to show how the TEL concept can be developed and extended, with applications capable of increasing their functionality by "learning" new metadata or protocol options.