Search (1894 results, page 1 of 95)

0.1389289 = product of:
  0.2778578 = sum of:
    0.25281855 = weight(_text_:java in 1604) [ClassicSimilarity], result of:
      0.25281855 = score(doc=1604,freq=2.0), product of:
        0.46384227 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0658165 = queryNorm
        0.5450528 = fieldWeight in 1604, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0546875 = fieldNorm(doc=1604)
    0.025039254 = weight(_text_:und in 1604) [ClassicSimilarity], result of:
      0.025039254 = score(doc=1604,freq=2.0), product of:
        0.14597435 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.0658165 = queryNorm
        0.17153187 = fieldWeight in 1604, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.0546875 = fieldNorm(doc=1604)
  0.5 = coord(2/4)

Abstract

iQvoc is a new open source SKOS-XL vocabulary management tool developed by the Federal Environment Agency, Germany, and innoQ Deutschland GmbH. Its immediate purpose is maintaining and publishing reference vocabularies in the upcoming Linked Data cloud of environmental information, but it may be easily adapted to host any SKOS- XL compliant vocabulary. iQvoc is implemented as a Ruby on Rails application running on top of JRuby - the Java implementation of the Ruby Programming Language. To increase the user experience when editing content, iQvoc uses heavily the JavaScript library jQuery.

Theme

Konzeption und Anwendung des Prinzips Thesaurus

0.12693763 = product of:
  0.25387526 = sum of:
    0.21670161 = weight(_text_:java in 1181) [ClassicSimilarity], result of:
      0.21670161 = score(doc=1181,freq=2.0), product of:
        0.46384227 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0658165 = queryNorm
        0.46718815 = fieldWeight in 1181, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.046875 = fieldNorm(doc=1181)
    0.037173655 = weight(_text_:und in 1181) [ClassicSimilarity], result of:
      0.037173655 = score(doc=1181,freq=6.0), product of:
        0.14597435 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.0658165 = queryNorm
        0.25465882 = fieldWeight in 1181, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.046875 = fieldNorm(doc=1181)
  0.5 = coord(2/4)

Abstract

Als eines der Ergebnisse der 2007 zwischen BVB und KOBV geschlossenen strategischen Allianz konnte am 12. September 2011 Mable+, eine Java-gestützte OpenSource-Software zur automatischen Daten- und Fehleranalyse von Bibliothekskatalogen, veröffentlicht werden. Basierend auf dem MAB-Datenaustauschformat ermöglicht Mable+ die formale Prüfung von Katalogdaten verbunden mit einer statistischen Auswertung über die Verteilung der Felder. Dazu benötigt es einen MAB-Abzug des Katalogs im MAB2-Bandformat mit MAB2-Zeichensatz. Dieses Datenpaket wird innerhalb weniger Minuten analysiert. Als Ergebnis erhält man einen Report mit einer allgemeinen Statistik zu den geprüften Datensätzen (Verteilung der Satztypen, Anzahl der MAB-Felder, u.a.), sowie eine Liste gefundener Fehler. Die Software wurde bereits bei der Migration der Katalogdaten aller KOBV-Bibliotheken in den B3Kat erfolgreich eingesetzt. Auf der Projekt-Webseite http://mable.kobv.de/ findet man allgemeine Informationen sowie diverse Anleitungen zur Nutzung des Programms. Die Software kann man sich unter http://mable.kobv.de/download.html herunterladen. Derzeit wird ein weiterführendes Konzept zur Nutzung und Modifizierung der Software entwickelt.

0.08670966 = product of:
  0.34683865 = sum of:
    0.34683865 = weight(_text_:handling in 4939) [ClassicSimilarity], result of:
      0.34683865 = score(doc=4939,freq=6.0), product of:
        0.4128091 = queryWeight, product of:
          6.272122 = idf(docFreq=227, maxDocs=44421)
          0.0658165 = queryNorm
        0.84019136 = fieldWeight in 4939, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          6.272122 = idf(docFreq=227, maxDocs=44421)
          0.0546875 = fieldNorm(doc=4939)
  0.25 = coord(1/4)

Abstract

The Semantic Web has attracted much attention, both from academia and industry. An important role in research towards the Semantic Web is played by formalisms and technologies for handling uncertainty and/or vagueness. In this paper, I first provide some motivating examples for handling uncertainty and/or vagueness in the Semantic Web. I then give an overview of some own formalisms for handling uncertainty and/or vagueness in the Semantic Web.

0.06575283 = product of:
  0.13150565 = sum of:
    0.059988726 = weight(_text_:und in 314) [ClassicSimilarity], result of:
      0.059988726 = score(doc=314,freq=90.0), product of:
        0.14597435 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.0658165 = queryNorm
        0.41095388 = fieldWeight in 314, product of:
          9.486833 = tf(freq=90.0), with freq of:
            90.0 = termFreq=90.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.01953125 = fieldNorm(doc=314)
    0.07151692 = weight(_text_:handling in 314) [ClassicSimilarity], result of:
      0.07151692 = score(doc=314,freq=2.0), product of:
        0.4128091 = queryWeight, product of:
          6.272122 = idf(docFreq=227, maxDocs=44421)
          0.0658165 = queryNorm
        0.17324454 = fieldWeight in 314, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.272122 = idf(docFreq=227, maxDocs=44421)
          0.01953125 = fieldNorm(doc=314)
  0.5 = coord(2/4)

Content

Dieses Jahr bot uns bereits zahlreiche interessante Themen: von der Sacherschließung ausgehend schnupperten wir auch in benachbarte Arbeitsund Forschungsfelder und regten andererseits interessierte Zuhörer/-innen aus diesen Nachbargebieten dazu an, die Aspekte der Inhaltserschließung aus einem für sie relevanten Blickwinkel heraus näher kennenzulernen. Die beiden öffentlichen Kommissionssitzungen des ersten Halbjahres 2010 und das SE-Panel im Rahmen der ODOK´10 in Leoben stießen daher nicht nur im engeren Kreis der Sacherschließer/-innen sondern auch bei Titelaufnehmern/-innen und IT-Experten/-innen auf verdientes Interesse. Sämtliche Vortragsfolien und begleitendes Material sind auf der KofSE- Seite chronologisch zugänglich. Am 29. April traf sich in Wien zunächst der am Grazer Bibliothekartag ins Leben gerufene Arbeitskreis K-KONKORD zum zweiten Mal: wir hörten kurze Berichte über laufende Projektarbeiten und Masterthesen zum Thema Klassifikationen-Konkordanzen und beschlossen, bis zum nächsten Treffen im Herbst unsere bis dahin gesammelten "Mosaiksteine" nach und nach in einem gesonderten Bereich auf der KofSE-Seite innerhalb der VÖB-Homepage abzulegen. Danach begann die KofSE-Sitzung mit einem Kurzbericht von Kurt SCHAEFER aus der UB Wien über seinen unmittelbar davor liegenden Besuch beim EDUG-Meeting 2010 in Alexandria. Nicht nur seine noch ganz vom ägyptischen Klima "aufgeheizten" und durch eine Bilderfolge lebendig dokumentierten Reiseeindrücke sondern v. a. die erste Zusammenfassung aktueller Trends innerhalb der wachsenden europäischen DDC- Community waren - spontan mitkommentiert von Karin Kleiber (Sekretärin der European Dewey Users Group, EDUG) und ebenso spontan ergänzt von Lars Svensson, der mit einer Telekonferenzschaltung von Deutschland aus an dem Meeting teilgenommen hatte - diesmal ein höchst aktueller Einstieg ins Thema Klassifikation. Darauf folgten zwei Gastvorträge:
Lars SVENSSON von der Deutschen Nationalbibliothek, Frankfurt am Main gab seinem spannenden Vortrag über ein laufendes praxisorientiertes DNB-Projekt den Titel Panta rei: Die Versionierung der DDC - Probleme, Anforderungen und mögliche Lösungen. Einen kurzen Abschlussbericht über das mit diesem praktischen Lösungsansatz zu erzielende, möglicherweise adäquate IT-Handling von laufenden inhaltlichen Anpassungen der Klassifikation selbst - das Editorial Policy Committee (EPC) der DDC reagiert auf neue Bedürfnisse, LoC und OCLC führen passende Benennungen ein und adaptieren Klassen - sowie von durch die Nutzung unterschiedlicher DDC-Fremddaten entstehenden inhomogenen Gemengelagen dürfen wir im kommenden Frühjahr für die VÖB-Mitteilungen erwarten. Naoka WERR von der UB Regensburg präsentierte unter dem Titel RVK 2010 authentisch den aktuellen Stand und die zukünftigen Entwicklungen im Dienstleistungsportfolio dieser so weit verbreiteten Aufstellungssystematik und stellte sich gleichzeitig auch der neuen und etwas heiklen Kostenfrage. Sie erläuterte die geplante neue Vorgehensweise des RVK-Teams in Regensburg gegenüber den RVK-Anwenderbibliotheken und zeigte sich für nötige Anpassungen der vermehrt auch aus Österreich hinzutretenden Anwender im Rahmen des bewährten und relativ unkomplizierten redaktionellen Procederes aufgeschlossen. Der kleinen RVK-Community stand sie am Nachmittag im Anschluss an die gemeinsame Roundtable-Diskussion noch geduldig für aktuelle Fragen zur Verfügung. Wolfram SEIDLER von der UB Wien moderierte den Runden Tisch am Nachmittag. Er geleitete die diskussionsfreudigen Teilnehmer/-innen souverän aber unaufdringlich durch das zukunftsträchtige Thema Klassifikationen und Semantic Web, und viele haben aus diesem - wörtlich gemeinten - Kreis Anregungen mitgenommen, die dazu verleiten werden, am Ball zu bleiben und auf die Entwicklungen im Semantic Web in Zukunft aufgeschlossener, also konstruktiv statt skeptisch, mit einem Wort sachkundiger zu reagieren. Gelegenheit dazu sollte sich schon im September, nämlich bei unserem Themenvormittag rund um Sacherschließung und Linked Data, einem neuen Forschungsfeld vor dem Hintergrund des Semantic Web, bieten.
Die zweite KofSE-Veranstaltung in diesem Jahr fand am 17. Juni in Wien statt und hatte den Charakter eines Tagesseminars, das aus vier Vorträgen von zwei überaus kompetenten Expertinnen sowie einem kleinen Workshop bestand. Heidrun WIESENMÜLLER von der Hochschule der Medien, Stuttgart (Stellvertretende Leiterin der Expertengruppe Sacherschließung, EGSE) machte uns zunächst mit den theoretischen Grundlagen der FRBR vertraut und bereitete am Nachmittag die RDA praktisch für uns auf. Esther SCHEVEN von der Deutschen Nationalbibliothek, Frankfurt am Main (Leiterin der EGSE) referierte am Vormittag über das theoretische Modell der FRSAD, das der schon bisher in der SWD praktizierten Terminologiearbeit nicht widerspricht, brachte uns nachmittags das bereits weit gediehene Konzept für die GND (Gemeinsame Normdatei) nahe und lud schließlich noch zu einigen praktischen Übungen mit Datensätzen im künftigen GND-Format ein. Besonders was die Zusammenführung von Körperschaftsansetzungen aus GKD und SWD betrifft, dürfte der Prozess noch recht spannend bleiben. Kein Wunder also, dass an diesem Tag auch zahlreiche Formalerschließer/-innen bei uns zu Gast waren, was nicht nur in den Fragerunden nach jedem Vortragsteil sondern auch in den Pausengesprächen die immer wichtiger werdenden Kontakte über die Grenzen bisheriger Arbeitsfelder hinweg durchaus förderte. "Grenzüberschreitendes" Interesse planten wir auch für das SE-Panel bei der ODOK´10 in Leoben am Donnerstagvormittag, 23. September mit ein. Dort gestalteten wir erstmals einen Themenvormittag mit jungen Informationswissenschaftlern rund um Linked Data und Sacherschließung und kombinierten die Auswirkungen dieses neuen Forschungsgebiets mit einem Ausblick auf bevorstehende Änderungen in der SE-Praxis der Deutschen Nationalbibliothek. Im Anschluss daran luden wir die zahlreichen Teil-nehmer/-innen zu einer regen Diskussion ein.
Zunächst führte Bernhard HASLHOFER vom Department of Distributed and Multimedia Systems, Universität Wien, behutsam in die Thematik Linked Data als Perspektive für die bibliothekarische Inhaltserschließung ein. Dann stellte Lars SVENSSON von der Deutschen Nationalbibliothek, Frankfurt am Main die uns vertrauten Normdateien SWD, GKD und PND als Linked Data vor und erläuterte deren bisher erreichten Stand und Perspektiven. Auch DDC-Deutsch und die Ergebnisse aus dem CrissCross-Projekt sind bereits jetzt "open linked" verfügbar. Steffen HENNICKE vom Institut für Bibliotheks- und Informationswissenschaft der Humboldt-Universität Berlin stellte in seinem mit Gemälden als Beispiele sehr anschaulich gestalteten Vortrag "Linked Data und semantische Suchfunktionalitäten in Europeana besonders den Nutzen eines so genannten "Semantic Data Layer", also der semantischen Datenschicht, die heterogene Objektmetadaten kontextualisiert, dar und zeigte wie und warum Search & Retrieval in einer derartigen Informationsarchitektur funktionieren. Im ersten Vortrag nach der Pause mit dem Titel Freie Katalogdaten und Linked Data, rückte Adrian POHL vom Hochschulbibliothekszentrum des Landes Nordrhein-Westfalen (hbz), Köln dann die wichtige Komponente Linked "Open" Data mit der lizenzrechtlichen Seite von im Web frei verfügbaren bibliographischen Daten in unseren Fokus. Außerdem berücksichtigte er, dass viele Aleph-Anwender/-innen im Auditorium saßen und erläuterte die praktischen Probleme beim regelmäßigen Export von Daten aus dem Verbundkatalog. Schließlich stellte er laufende und zukünftige Linked-Open-Data-Projekte des hbz vor, in denen - teilweise in Kooperation mit der DNB - eine Basisinfrastruktur für Bibliotheken im Semantic Web entwickelt werden soll. Ulrike JUNGER, Leiterin der Inhaltserschließung an beiden Standorten der Deutschen Nationalbibliothek, Leipzig und Frankfurt am Main, holte uns wieder in die Realität des Sacherschließungsalltags zurück und stellte in ihrem Vortrag Automatisierung in der Inhaltserschließung - neue Ansätze in der Deutschen Nationalbibliothek konkrete Planungen und Aktivitäten der DNB für automatische Erschließungsverfahren vor. Im Bereich der Netzpublikationen wurde die traditionelle, intellektuell durchgeführte verbale und klassifikatorische Inhalterschließung seit Anfang 2010 eingestellt und soll durch automatische Verfahren ersetzt werden. Derzeit wird insbesondere die Vergabe von DDC-Sachgruppen und Schlagwörtern erprobt. In die bisher vorliegenden Testergebnisse beider Verfahren erhielten wir kurz Einblick. Wenig überraschend schnitten dabei Fächer wie Medizin am günstigsten ab. Schon 2012 könnten solche Verfahren in DNB zur Anwendung kommen."

Source

Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 63(2010) H.3/4, S.95-99

0.057213537 = product of:
  0.22885415 = sum of:
    0.22885415 = weight(_text_:handling in 925) [ClassicSimilarity], result of:
      0.22885415 = score(doc=925,freq=2.0), product of:
        0.4128091 = queryWeight, product of:
          6.272122 = idf(docFreq=227, maxDocs=44421)
          0.0658165 = queryNorm
        0.5543825 = fieldWeight in 925, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.272122 = idf(docFreq=227, maxDocs=44421)
          0.0625 = fieldNorm(doc=925)
  0.25 = coord(1/4)

0.054175403 = product of:
  0.21670161 = sum of:
    0.21670161 = weight(_text_:java in 3605) [ClassicSimilarity], result of:
      0.21670161 = score(doc=3605,freq=2.0), product of:
        0.46384227 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0658165 = queryNorm
        0.46718815 = fieldWeight in 3605, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.046875 = fieldNorm(doc=3605)
  0.25 = coord(1/4)

Abstract

For introductory information retrieval courses at the undergraduate and graduate level in computer science, information science and computer engineering departments. Written by a leader in the field of information retrieval, Search Engines: Information Retrieval in Practice, is designed to give undergraduate students the understanding and tools they need to evaluate, compare and modify search engines. Coverage of the underlying IR and mathematical models reinforce key concepts. The book's numerous programming exercises make extensive use of Galago, a Java-based open source search engine. SUPPLEMENTS / Extensive lecture slides (in PDF and PPT format) / Solutions to selected end of chapter problems (Instructors only) / Test collections for exercises / Galago search engine

0.054175403 = product of:
  0.21670161 = sum of:
    0.21670161 = weight(_text_:java in 4615) [ClassicSimilarity], result of:
      0.21670161 = score(doc=4615,freq=2.0), product of:
        0.46384227 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0658165 = queryNorm
        0.46718815 = fieldWeight in 4615, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.046875 = fieldNorm(doc=4615)
  0.25 = coord(1/4)

Abstract

Medical insurance fraud is common in many countries' medical insurance systems and represents a serious threat to the insurance funds and the benefits of patients. In this paper, we present an inference model of medical insurance fraud detection, based on a medical detection domain ontology that incorporates the knowledge base provided by the Medical Terminology, NKIMed, and Chinese Library Classification systems. Through analyzing the behaviors of irregular and fraudulent medical services, we defined the scope of the medical domain ontology relevant to the task and built the ontology about medical sciences and medical service behaviors. The ontology then utilizes Semantic Web Rule Language (SWRL) and Java Expert System Shell (JESS) to detect medical irregularities and mine implicit knowledge. The system can be used to improve the management of medical insurance risks.

0.04514617 = product of:
  0.18058468 = sum of:
    0.18058468 = weight(_text_:java in 4179) [ClassicSimilarity], result of:
      0.18058468 = score(doc=4179,freq=2.0), product of:
        0.46384227 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0658165 = queryNorm
        0.38932347 = fieldWeight in 4179, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0390625 = fieldNorm(doc=4179)
  0.25 = coord(1/4)

Abstract

In order to improve the organization of classical music information resources, we constructed a classical music recording ontology, on top of which we then designed an online classical music catalog. Our construction of the classical music recording ontology consisted of three steps: identifying the purpose, analyzing the ontology, and encoding the ontology. We identified the main classes and properties of the domain by investigating classical music recording resources and users' information needs. We implemented the ontology in the Web Ontology Language (OWL) using five steps: transforming the properties, encoding the transformed properties, defining ranges of the properties, constructing individuals, and standardizing the ontology. In constructing the online catalog, we first designed the structure and functions of the catalog based on investigations into users' information needs and information-seeking behaviors. Then we extracted classes and properties of the ontology using the Apache Jena application programming interface (API), and constructed a catalog in the Java environment. The catalog provides a hierarchical main page (built using the Functional Requirements for Bibliographic Records (FRBR) model), a classical music information network and integrated information service; this combination of features greatly eases the task of finding classical music recordings and more information about classical music.

0.04291015 = product of:
  0.1716406 = sum of:
    0.1716406 = weight(_text_:handling in 827) [ClassicSimilarity], result of:
      0.1716406 = score(doc=827,freq=2.0), product of:
        0.4128091 = queryWeight, product of:
          6.272122 = idf(docFreq=227, maxDocs=44421)
          0.0658165 = queryNorm
        0.41578686 = fieldWeight in 827, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.272122 = idf(docFreq=227, maxDocs=44421)
          0.046875 = fieldNorm(doc=827)
  0.25 = coord(1/4)

0.04291015 = product of:
  0.1716406 = sum of:
    0.1716406 = weight(_text_:handling in 1458) [ClassicSimilarity], result of:
      0.1716406 = score(doc=1458,freq=2.0), product of:
        0.4128091 = queryWeight, product of:
          6.272122 = idf(docFreq=227, maxDocs=44421)
          0.0658165 = queryNorm
        0.41578686 = fieldWeight in 1458, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.272122 = idf(docFreq=227, maxDocs=44421)
          0.046875 = fieldNorm(doc=1458)
  0.25 = coord(1/4)

Abstract

Helen Brownson was a federal government employee from 1942 to 1970. At a time when scientific data were becoming exceedingly hard to manage, Brownson was instrumental in coordinating national and international efforts for more efficient, cost-effective, and universal information exchange. Her most significant contributions to documentation/information science were during her years at the National Science Foundation's Office of Scientific Information. From 1951 to 1966, Brownson played a key role in identifying and subsequently distributing government funds toward projects that sought to resolve information-handling problems of the time: information access, preservation, storage, classification, and retrieval. She is credited for communicating the need for information systems and indexing mechanisms to have stricter criteria, standards, and evaluation methods; laying the foundation for present-day NSF-funded computational linguistics projects; and founding several pertinent documentation/information science publications including the Annual Review of Information Science and Technology.

0.04291015 = product of:
  0.1716406 = sum of:
    0.1716406 = weight(_text_:handling in 1839) [ClassicSimilarity], result of:
      0.1716406 = score(doc=1839,freq=2.0), product of:
        0.4128091 = queryWeight, product of:
          6.272122 = idf(docFreq=227, maxDocs=44421)
          0.0658165 = queryNorm
        0.41578686 = fieldWeight in 1839, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.272122 = idf(docFreq=227, maxDocs=44421)
          0.046875 = fieldNorm(doc=1839)
  0.25 = coord(1/4)

Abstract

Knowledge explosion in various fields during recent years has resulted in the creation of vast amounts of on-line scientific literature. Food Science &Technology (FST) is also an important subject domain where rapid developments are taking place due to diverse research and development activities. As a result, information storage and retrieval has become very complex and current information retrieval systems (IRs) are being challenged in terms of both adequate precision and response time. To overcome these limitations as well as to provide naturallanguage based effective retrieval, a suitable knowledge engineering framework needs to be applied to represent, share and discover information. Semantic web technologies provide mechanisms for creating knowledge bases, ontologies and rules for handling data that promise to improve the quality of information retrieval. Ontologies are the backbone of such knowledge systems. This paper presents a framework for semantic representation of a large repository of content in the domain of FST.

0.04291015 = product of:
  0.1716406 = sum of:
    0.1716406 = weight(_text_:handling in 2581) [ClassicSimilarity], result of:
      0.1716406 = score(doc=2581,freq=2.0), product of:
        0.4128091 = queryWeight, product of:
          6.272122 = idf(docFreq=227, maxDocs=44421)
          0.0658165 = queryNorm
        0.41578686 = fieldWeight in 2581, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.272122 = idf(docFreq=227, maxDocs=44421)
          0.046875 = fieldNorm(doc=2581)
  0.25 = coord(1/4)

Abstract

One of the key aspects of the approaching data-intensive science era is integration of data through interoperability of systems providing data products or visualisation and processing services. Far from being simple, interoperability requires robust and scalable e-infrastructures capable of supporting it. In this work we present the case of EPOS, a project for data integration in the field of Earth Sciences. We describe the design of its e-infrastructure and show its main characteristics. One of the main elements enabling the system to integrate data, data products and services is the metadata catalog based on the CERIF metadata model. Such a model, modified to fit into the general e-infrastructure design, is part of a three-layer metadata architecture. CERIF guarantees a robust handling of metadata, which is in this case the key to the interoperability and to one of the feature of the EPOS system: the possibility of carrying on data intensive science orchestrating the distributed resources made available by EPOS data providers and stakeholders.

0.04291015 = product of:
  0.1716406 = sum of:
    0.1716406 = weight(_text_:handling in 2748) [ClassicSimilarity], result of:
      0.1716406 = score(doc=2748,freq=2.0), product of:
        0.4128091 = queryWeight, product of:
          6.272122 = idf(docFreq=227, maxDocs=44421)
          0.0658165 = queryNorm
        0.41578686 = fieldWeight in 2748, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.272122 = idf(docFreq=227, maxDocs=44421)
          0.046875 = fieldNorm(doc=2748)
  0.25 = coord(1/4)

Abstract

Content analysis of scientific publications is a nontrivial task, but a useful and important one for scientific information services. In the Gutenberg era it was a domain of human experts; in the digital age many machine-based methods, e.g., graph analysis tools and machine-learning techniques, have been developed for it. Natural Language Processing (NLP) is a powerful machine-learning approach to semiautomatic speech and language processing, which is also applicable to mathematics. The well established methods of NLP have to be adjusted for the special needs of mathematics, in particular for handling mathematical formulae. We demonstrate a mathematics-aware part of speech tagger and give a short overview about our adaptation of NLP methods for mathematical publications. We show the use of the tools developed for key phrase extraction and classification in the database zbMATH.

0.04291015 = product of:
  0.1716406 = sum of:
    0.1716406 = weight(_text_:handling in 553) [ClassicSimilarity], result of:
      0.1716406 = score(doc=553,freq=2.0), product of:
        0.4128091 = queryWeight, product of:
          6.272122 = idf(docFreq=227, maxDocs=44421)
          0.0658165 = queryNorm
        0.41578686 = fieldWeight in 553, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.272122 = idf(docFreq=227, maxDocs=44421)
          0.046875 = fieldNorm(doc=553)
  0.25 = coord(1/4)

Abstract

This paper suggests writing a companion work to the Bourne and Hahn book, History of Online Information Services, 1963-1976 (2003), which would feature milestone improvements in subject access mechanisms developed over time. To provide a background for such a work, a 1976 paper by Meincke and Atherton is revisited wherein the concept of Knowledge Space is defined as "online mechanisms used for handling a user's knowledge level while a search was being formulated and processed." Research that followed in the 1980s and 1990s is linked together for the first time. Seven projects are suggested for current researchers to undertake so they can assess the utility of earlier research ideas that did not get a proper chance for development. It is just possible that they may have value and be found useful in today's information environment.

0.036116935 = product of:
  0.14446774 = sum of:
    0.14446774 = weight(_text_:java in 935) [ClassicSimilarity], result of:
      0.14446774 = score(doc=935,freq=2.0), product of:
        0.46384227 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0658165 = queryNorm
        0.31145877 = fieldWeight in 935, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.03125 = fieldNorm(doc=935)
  0.25 = coord(1/4)

Abstract

Purpose - This paper sets out to discuss the use of information extraction (IE), a natural language-processing (NLP) technique to assist "rich" semantic indexing of diverse archaeological text resources. The focus of the research is to direct a semantic-aware "rich" indexing of diverse natural language resources with properties capable of satisfying information retrieval from online publications and datasets associated with the Semantic Technologies for Archaeological Resources (STAR) project. Design/methodology/approach - The paper proposes use of the English Heritage extension (CRM-EH) of the standard core ontology in cultural heritage, CIDOC CRM, and exploitation of domain thesauri resources for driving and enhancing an Ontology-Oriented Information Extraction process. The process of semantic indexing is based on a rule-based Information Extraction technique, which is facilitated by the General Architecture of Text Engineering (GATE) toolkit and expressed by Java Annotation Pattern Engine (JAPE) rules. Findings - Initial results suggest that the combination of information extraction with knowledge resources and standard conceptual models is capable of supporting semantic-aware term indexing. Additional efforts are required for further exploitation of the technique and adoption of formal evaluation methods for assessing the performance of the method in measurable terms. Originality/value - The value of the paper lies in the semantic indexing of 535 unpublished online documents often referred to as "Grey Literature", from the Archaeological Data Service OASIS corpus (Online AccesS to the Index of archaeological investigationS), with respect to the CRM ontological concepts E49.Time Appellation and P19.Physical Object.

0.036116935 = product of:
  0.14446774 = sum of:
    0.14446774 = weight(_text_:java in 3301) [ClassicSimilarity], result of:
      0.14446774 = score(doc=3301,freq=2.0), product of:
        0.46384227 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0658165 = queryNorm
        0.31145877 = fieldWeight in 3301, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.03125 = fieldNorm(doc=3301)
  0.25 = coord(1/4)

Abstract

Analytico-synthetic and faceted classifications, such as Universal Decimal Classification (UDC) express content of documents with complex, pre-combined classification codes. Without classification authority control that would help manage and access structured notations, the use of UDC codes in searching and browsing is limited. Existing UDC parsing solutions are usually created for a particular database system or a specific task and are not widely applicable. The approach described in this paper provides a solution by which the analysis and interpretation of UDC notations would be stored into an intermediate format (in this case, in XML) by automatic means without any data or information loss. Due to its richness, the output file can be converted into different formats, such as standard mark-up and data exchange formats or simple lists of the recommended entry points of a UDC number. The program can also be used to create authority records containing complex UDC numbers which can be comprehensively analysed in order to be retrieved effectively. The Java program, as well as the corresponding schema definition it employs, is under continuous development. The current version of the interpreter software is now available online for testing purposes at the following web site: http://interpreter-eto.rhcloud.com. The future plan is to implement conversion methods for standard formats and to create standard online interfaces in order to make it possible to use the features of software as a service. This would result in the algorithm being able to be employed both in existing and future library systems to analyse UDC numbers without any significant programming effort.

0.03575846 = product of:
  0.14303385 = sum of:
    0.14303385 = weight(_text_:handling in 438) [ClassicSimilarity], result of:
      0.14303385 = score(doc=438,freq=2.0), product of:
        0.4128091 = queryWeight, product of:
          6.272122 = idf(docFreq=227, maxDocs=44421)
          0.0658165 = queryNorm
        0.34648907 = fieldWeight in 438, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.272122 = idf(docFreq=227, maxDocs=44421)
          0.0390625 = fieldNorm(doc=438)
  0.25 = coord(1/4)

Abstract

In both the popular press and scholarly research, digital information is persistently discussed in terms that imply its immateriality. In this characterization, the digital derives its power from its nature as a mere collection of 0s and 1s wholly independent from the particular media on which it is stored-hard drive, network wires, optical disk, etc.-and the particular signal carrier which encodes bits-variations of magnetic field, voltages, or pulses of light. This purported immateriality endows bits with considerable advantages: they are immune from the economics and logistics of analog media, and from the corruption, degradation, and decay that necessarily result from the handling of material carriers of information, resulting in a worldwide shift "from atom to bits" as captured by Negroponte. This is problematic: however immaterial it might appear, information cannot exist outside of given instantiations in material forms. But what might it mean to talk of bits as material objects? In this paper I argue that bits cannot escape the material constraints of the physical devices that manipulate, store, and exchange them. Such an analysis reveals a surprising picture of computing as a material process through and through.

0.03575846 = product of:
  0.14303385 = sum of:
    0.14303385 = weight(_text_:handling in 846) [ClassicSimilarity], result of:
      0.14303385 = score(doc=846,freq=2.0), product of:
        0.4128091 = queryWeight, product of:
          6.272122 = idf(docFreq=227, maxDocs=44421)
          0.0658165 = queryNorm
        0.34648907 = fieldWeight in 846, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.272122 = idf(docFreq=227, maxDocs=44421)
          0.0390625 = fieldNorm(doc=846)
  0.25 = coord(1/4)

Abstract

Ontologies have an important role in knowledge organization and information retrieval. Domain ontologies are composed of concepts represented by domain relevant terms. Existing approaches of ontology construction make use of statistical and linguistic information to extract domain relevant terms. The quality and the quantity of this information influence the accuracy of terminology extraction approaches and other steps in knowledge extraction and information retrieval. This paper proposes an approach for handling domain relevant terms from Arabic non-diacriticised semi-structured corpora. In input, the structure of documents is exploited to organize knowledge in a contextual graph, which is exploited to extract relevant terms. This network contains simple and compound nouns handled by a morphosyntactic shallow parser. The noun phrases are evaluated in terms of termhood and unithood by means of possibilistic measures. We apply a qualitative approach, which weighs terms according to their positions in the structure of the document. In output, the extracted knowledge is organized as network modeling dependencies between terms, which can be exploited to infer semantic relations. We test our approach on three specific domain corpora. The goal of this evaluation is to check if our model for organizing and exploiting contextual knowledge will improve the accuracy of extraction of simple and compound nouns. We also investigate the role of compound nouns in improving information retrieval results.

0.03575846 = product of:
  0.14303385 = sum of:
    0.14303385 = weight(_text_:handling in 1082) [ClassicSimilarity], result of:
      0.14303385 = score(doc=1082,freq=2.0), product of:
        0.4128091 = queryWeight, product of:
          6.272122 = idf(docFreq=227, maxDocs=44421)
          0.0658165 = queryNorm
        0.34648907 = fieldWeight in 1082, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.272122 = idf(docFreq=227, maxDocs=44421)
          0.0390625 = fieldNorm(doc=1082)
  0.25 = coord(1/4)

Abstract

This paper examines the current state of authority control development in Spanish university repositories. As a decade has now gone by since the initiation of the first projects for institutional repositories in Spain, it would seem a suitable time to draw attention to authority control, an element of the first rank in evaluating the consistency and integrity of systems for recovering bibliographic information. The work is focused on examining the implementation of authorities in twenty-six Spanish university repositories, taking into account the information provided by the standardization experts working in them. The study considers the responses of the coordinators for these digital collections using a set of analytic criteria set out in the study. The handling of authorities in the group of university repositories studied may be described as uneven. Greater interest may be observed in controlling author entries, with laxer solutions for authority control of subjects. It suggests the need to establish effective policies for the management of authorities by means of cooperative efforts permitting the building up of corpora of entries for authorities that would aid the processes of cataloguing, metadata creation, and information retrieval in systems based on syntactic and semantic interoperability in which manual intervention should be minimal.

0.03575846 = product of:
  0.14303385 = sum of:
    0.14303385 = weight(_text_:handling in 4223) [ClassicSimilarity], result of:
      0.14303385 = score(doc=4223,freq=2.0), product of:
        0.4128091 = queryWeight, product of:
          6.272122 = idf(docFreq=227, maxDocs=44421)
          0.0658165 = queryNorm
        0.34648907 = fieldWeight in 4223, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.272122 = idf(docFreq=227, maxDocs=44421)
          0.0390625 = fieldNorm(doc=4223)
  0.25 = coord(1/4)

Abstract

The aim of the study was to test whether query expansion by approximate string matching methods is beneficial in retrieval from historical newspaper collections in a language rich with compounds and inflectional forms (Finnish). First, approximate string matching methods were used to generate lists of index words most similar to contemporary query terms in a digitized newspaper collection from the 1800s. Top index word variants were categorized to estimate the appropriate query expansion ranges in the retrieval test. Second, the effectiveness of approximate string matching methods, automatically generated inflectional forms, and their combinations were measured in a Cranfield-style test. Finally, a detailed topic-level analysis of test results was conducted. In the index of historical newspaper collection the occurrences of a word typically spread to many linguistic and historical variants along with optical character recognition (OCR) errors. All query expansion methods improved the baseline results. Extensive expansion of around 30 variants for each query word was required to achieve the highest performance improvement. Query expansion based on approximate string matching was superior to using the inflectional forms of the query words, showing that coverage of the different types of variation is more important than precision in handling one type of variation.