Search (1236 results, page 2 of 62)

0.080710694 = product of:
  0.32284278 = sum of:
    0.32284278 = weight(_text_:hardly in 2210) [ClassicSimilarity], result of:
      0.32284278 = score(doc=2210,freq=4.0), product of:
        0.507283 = queryWeight, product of:
          8.146119 = idf(docFreq=34, maxDocs=44421)
          0.062272966 = queryNorm
        0.63641554 = fieldWeight in 2210, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          8.146119 = idf(docFreq=34, maxDocs=44421)
          0.0390625 = fieldNorm(doc=2210)
  0.25 = coord(1/4)

Abstract

Traditionally, database indexing and book indexing have been looked upon as being quite distinct and have been kept apart in textbooks and teaching. The traditional borderline between both variations of indexing, however, should not conceal fundamental commonalities of the two approaches. For example, theausurus construction and usage, quite common in databases, has hardly been encountered in book indexing so far. Database indexing, on the other hand, has hardly made use of subheadings of the syntax-displaying type, quite common in book indexing. Most database users also prefer precombining vocabulary units and reject concept analysis. However, insisting on precombining descriptors in a large database vocabulary may, in the long run, well be destructive to the quality, of indexing and of the searches. A complementary approach is conceivable which provides both precombinations and analyzed subjects, both index language syntax and subheadings, and provides access to an information system via precombinations, without jeopardizing the manageability of the vocabulary. Such an approach causes considerable costs in input because it involves a great deal of intellectual work. On the other hand, much time and costs will be saved in the use of the system. In addition, such an approach would endow an information system with survival power

0.07863864 = product of:
  0.15727729 = sum of:
    0.020306699 = weight(_text_:und in 3788) [ClassicSimilarity], result of:
      0.020306699 = score(doc=3788,freq=8.0), product of:
        0.13811515 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.062272966 = queryNorm
        0.14702731 = fieldWeight in 3788, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.0234375 = fieldNorm(doc=3788)
    0.1369706 = weight(_text_:hardly in 3788) [ClassicSimilarity], result of:
      0.1369706 = score(doc=3788,freq=2.0), product of:
        0.507283 = queryWeight, product of:
          8.146119 = idf(docFreq=34, maxDocs=44421)
          0.062272966 = queryNorm
        0.27000827 = fieldWeight in 3788, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.146119 = idf(docFreq=34, maxDocs=44421)
          0.0234375 = fieldNorm(doc=3788)
  0.5 = coord(2/4)

Abstract

The dream of universal knowledge hardly started with the digital age. From the archives of Sumeria to the Library of Alexandria, humanity has long wrestled with information overload and management of intellectual output. Revived during the Renaissance and picking up pace in the Enlightenment, the dream grew and by the late nineteenth century was embraced by a number of visionaries who felt that at long last it was within their grasp. Among them, Paul Otlet stands out. A librarian by training, he worked at expanding the potential of the catalogue card -- the world's first information chip. From there followed universal libraries and reading rooms, connecting his native Belgium to the world -- by means of vast collections of cards that brought together everything that had ever been put to paper. Recognizing that the rapid acceleration of technology was transforming the world's intellectual landscape, Otlet devoted himself to creating a universal bibliography of all published knowledge. Ultimately totaling more than 12 million individual entries, it would evolve into the Mundaneum, a vast "city of knowledge" that opened its doors to the public in 1921. By 1934, Otlet had drawn up plans for a network of "electric telescopes" that would allow people everywhere to search through books, newspapers, photographs, and recordings, all linked together in what he termed a réseau mondial: a worldwide web. It all seemed possible, almost until the moment when the Nazis marched into Brussels and carted it all away. In Cataloging the World, Alex Wright places Otlet in the long continuum of visionaries and pioneers who have dreamed of unifying the world's knowledge, from H.G. Wells and Melvil Dewey to Ted Nelson and Steve Jobs. And while history has passed Otlet by, Wright shows that his legacy persists in today's networked age, where Internet corporations like Google and Twitter play much the same role that Otlet envisioned for the Mundaneum -- as the gathering and distribution channels for the world's intellectual output. In this sense, Cataloging the World is more than just the story of a failed entrepreneur; it is an ongoing story of a powerful idea that has captivated humanity from time immemorial, and that continues to inspire many of us in today's digital age.

BK

06.01 Geschichte des Informations- und Dokumentationswesens

Classification

06.01 Geschichte des Informations- und Dokumentationswesens

RSWK

Informations- und Dokumentationswissenschaft / Klassifikation / Katalogisierung / Geschichte 1900-1950

Subject

Informations- und Dokumentationswissenschaft / Klassifikation / Katalogisierung / Geschichte 1900-1950

0.07249063 = product of:
  0.28996253 = sum of:
    0.28996253 = weight(_text_:java in 4593) [ClassicSimilarity], result of:
      0.28996253 = score(doc=4593,freq=4.0), product of:
        0.43886918 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.062272966 = queryNorm
        0.6607038 = fieldWeight in 4593, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.046875 = fieldNorm(doc=4593)
  0.25 = coord(1/4)

Abstract

Presents a Guided tour system for the WWW, called Ariadne, which implements the ideas of trails and guided tours, originating from the hypertext field. Ariadne appears as a Java applet to the user and it stores guided tours in a database format separated from the WWW documents included in the tour. Itd main advantages are: an independent user interface which does not affect the layout of the documents being part of the tour, branching tours where the user may follow alternative routes, composition of existing tours into aggregate tours, overview map with indication of which parts of a tour have been visited an support for getting back on track. Ariadne is available as a research prototype, and it has been tested among a group of university students as well as casual users on the Internet

0.0684853 = product of:
  0.2739412 = sum of:
    0.2739412 = weight(_text_:hardly in 1787) [ClassicSimilarity], result of:
      0.2739412 = score(doc=1787,freq=2.0), product of:
        0.507283 = queryWeight, product of:
          8.146119 = idf(docFreq=34, maxDocs=44421)
          0.062272966 = queryNorm
        0.54001653 = fieldWeight in 1787, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.146119 = idf(docFreq=34, maxDocs=44421)
          0.046875 = fieldNorm(doc=1787)
  0.25 = coord(1/4)

Abstract

A new effectiveness measure ('usefulness measure') is proposed to circumvent the problems associated with the classical recall and precision measures. It is difficult to evaluate systems that filter extremly dynamic information; the determination of all relevant dodcuments in a real life collection is hardly affordable, and the specification of binary relevance assessments is often problematic. The new measure relies on an statistical approach with which two retrieval algorithms are compared. In contrast to the classical recall and precision measures, the new measure requires only relative judgments, and the reply of the retrieval system os compared directly with the information need of the user rather than with the query. The new measure has the added ability to determine an error probability that indicates haw stable the usefulness measure is. Using a test collection of abstracts from CACM, it is shown that our new measure is also capable of disclosing the effect of manually assigned descriptors and yields a results similar to that of the traditional recall and precision measures.

0.0684853 = product of:
  0.2739412 = sum of:
    0.2739412 = weight(_text_:hardly in 3539) [ClassicSimilarity], result of:
      0.2739412 = score(doc=3539,freq=2.0), product of:
        0.507283 = queryWeight, product of:
          8.146119 = idf(docFreq=34, maxDocs=44421)
          0.062272966 = queryNorm
        0.54001653 = fieldWeight in 3539, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.146119 = idf(docFreq=34, maxDocs=44421)
          0.046875 = fieldNorm(doc=3539)
  0.25 = coord(1/4)

Abstract

Since the quality of a library is not in the number of materials that are available, but in the number of materials that are actually utilized, this is what a material acquisitions operation should be concerned with. In support of this goal, the library management has been paying increased attention to the value of the usage data in support of a variety of managerial decisions. Although many approaches and research reports have been extensively used to help library material acquisitions, the knowledge contained in circulation databases has hardly ever been used to investigate in-depth how the acquired materials are being used. Thus, there may not be adequate indications on which the material acquisitions operation can rely when making decisions. This paper introduces a model based on knowledge discovery (KDBMLMA ) that embeds a circulation statistics mechanism and an association rule discovery mechanism to help derive the utilization of library material categories. A practical application case is presented and managerial implications discussed in this research.

0.0684853 = product of:
  0.2739412 = sum of:
    0.2739412 = weight(_text_:hardly in 1253) [ClassicSimilarity], result of:
      0.2739412 = score(doc=1253,freq=2.0), product of:
        0.507283 = queryWeight, product of:
          8.146119 = idf(docFreq=34, maxDocs=44421)
          0.062272966 = queryNorm
        0.54001653 = fieldWeight in 1253, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.146119 = idf(docFreq=34, maxDocs=44421)
          0.046875 = fieldNorm(doc=1253)
  0.25 = coord(1/4)

Abstract

A disparity seems to exist between the expectations that librarians have of education for the knowledge organization (KO) and what is taught in accredited master's programs across the United States and Canada. Analysis of official competencies, AUTOCAT discussion list postings, previous studies, and LIS curricula suggests that although many practitioners express this mismatch, the data reveal that KO competencies are hardly marginalized in curricula, and there is a large degree of consensus on what educators should and do offer. The analysis also indicates that there may be a "mismatch" in perception about the state of KO education and curricular offerings today within both the practitioner and educator communities.

0.0684853 = product of:
  0.2739412 = sum of:
    0.2739412 = weight(_text_:hardly in 311) [ClassicSimilarity], result of:
      0.2739412 = score(doc=311,freq=2.0), product of:
        0.507283 = queryWeight, product of:
          8.146119 = idf(docFreq=34, maxDocs=44421)
          0.062272966 = queryNorm
        0.54001653 = fieldWeight in 311, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.146119 = idf(docFreq=34, maxDocs=44421)
          0.046875 = fieldNorm(doc=311)
  0.25 = coord(1/4)

Abstract

Automatic content indexing is one of the innovations that are increasingly changing the way libraries work. In theory, it promises a cataloguing service that would hardly be possible with humans in terms of speed, quantity and maybe quality. The German National Library (DNB) has also recognised this potential and is increasingly relying on the automatic indexing of their catalogue content. The DNB took a major step in this direction in 2017, which was announced in two papers. The announcement was rather restrained, but the content of the papers is all the more explosive for the library community: Since September 2017, the DNB has discontinued the intellectual indexing of series Band H and has switched to an automatic process for these series. The subject indexing of online publications (series O) has been purely automatical since 2010; from September 2017, monographs and periodicals published outside the publishing industry and university publications will no longer be indexed by people. This raises the question: What is the quality of the automatic indexing compared to the manual work or in other words to which degree can the automatic indexing replace people without a signi cant drop in regards to quality?

0.068344824 = product of:
  0.2733793 = sum of:
    0.2733793 = weight(_text_:java in 6851) [ClassicSimilarity], result of:
      0.2733793 = score(doc=6851,freq=2.0), product of:
        0.43886918 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.062272966 = queryNorm
        0.62291753 = fieldWeight in 6851, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0625 = fieldNorm(doc=6851)
  0.25 = coord(1/4)

Abstract

This book provides a quick, concise guide to the issues surrounding the preparation of a well-designed, professional web site using HTML. Topics covered include: how to plan your web site effectively, effective use of hypertext, images, audio and video; layout techniques using tables and and list; how to use style sheets, font sizes and plans for mathematical equation make up. Integration of CGI scripts, Java and ActiveX into your web site is also discussed

0.068344824 = product of:
  0.2733793 = sum of:
    0.2733793 = weight(_text_:java in 171) [ClassicSimilarity], result of:
      0.2733793 = score(doc=171,freq=2.0), product of:
        0.43886918 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.062272966 = queryNorm
        0.62291753 = fieldWeight in 171, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0625 = fieldNorm(doc=171)
  0.25 = coord(1/4)

Abstract

Explains how the Intranet (in effect an Internet limited to the computer systems of a single organization) developed out of the Internet, and what its uses and advantages are. Focuses on the Intranet developed in the Glaxo Wellcome organization. Briefly discusses a number of technologies in development, e.g. Java, Real audio, 3D and VRML, and summarizes the issues involved in the successful development of the Intranet, that is, bandwidth, searching tools, security, and legal issues

0.068344824 = product of:
  0.2733793 = sum of:
    0.2733793 = weight(_text_:java in 604) [ClassicSimilarity], result of:
      0.2733793 = score(doc=604,freq=2.0), product of:
        0.43886918 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.062272966 = queryNorm
        0.62291753 = fieldWeight in 604, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0625 = fieldNorm(doc=604)
  0.25 = coord(1/4)

Abstract

Gives an overview of Web information system development. Discusses some basic concepts and technologies such as HTML, HTML FORM, CGI and Java, which are associated with developing WWW information systems. Further discusses the design and implementation of Virtual Travel Mart, a Web based end user oriented travel information system. Finally, addresses some issues in developing WWW information systems

0.068344824 = product of:
  0.2733793 = sum of:
    0.2733793 = weight(_text_:java in 2782) [ClassicSimilarity], result of:
      0.2733793 = score(doc=2782,freq=2.0), product of:
        0.43886918 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.062272966 = queryNorm
        0.62291753 = fieldWeight in 2782, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0625 = fieldNorm(doc=2782)
  0.25 = coord(1/4)

Abstract

Ameritech Library Services has released Dynix WebPac on NT, which provides access to a Dynix catalogue from any Java compatible Web browser. Users can place holds, cancel and postpone holds, view and renew items on loan and sort and limit search results from the Web. Describes some of the other features of Dynix WebPac

0.068344824 = product of:
  0.2733793 = sum of:
    0.2733793 = weight(_text_:java in 3078) [ClassicSimilarity], result of:
      0.2733793 = score(doc=3078,freq=2.0), product of:
        0.43886918 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.062272966 = queryNorm
        0.62291753 = fieldWeight in 3078, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0625 = fieldNorm(doc=3078)
  0.25 = coord(1/4)

Abstract

OCLC has announced that 6 library systems have completed field tests of the OCLC SiteSearch 4.0 suite of software, paving its way for release. Traces the beta site testing programme from its beginning in November 1997 and notes that OCLC SiteServer components have been written in Java programming language which will increase libraries' ability to extend the functionality of the SiteSearch software to create new features specific to local needs

0.068344824 = product of:
  0.2733793 = sum of:
    0.2733793 = weight(_text_:java in 4618) [ClassicSimilarity], result of:
      0.2733793 = score(doc=4618,freq=2.0), product of:
        0.43886918 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.062272966 = queryNorm
        0.62291753 = fieldWeight in 4618, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0625 = fieldNorm(doc=4618)
  0.25 = coord(1/4)

Abstract

Demonstrates a new method of providing networked computer assisted learning to avoid the pitfalls of traditional methods. This was achieved using Web pages enhanced with Java applets, MPEG video clips and Dynamic HTML

0.068344824 = product of:
  0.2733793 = sum of:
    0.2733793 = weight(_text_:java in 130) [ClassicSimilarity], result of:
      0.2733793 = score(doc=130,freq=2.0), product of:
        0.43886918 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.062272966 = queryNorm
        0.62291753 = fieldWeight in 130, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0625 = fieldNorm(doc=130)
  0.25 = coord(1/4)

Object

Java

0.06809605 = product of:
  0.1361921 = sum of:
    0.10251724 = weight(_text_:java in 55) [ClassicSimilarity], result of:
      0.10251724 = score(doc=55,freq=2.0), product of:
        0.43886918 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.062272966 = queryNorm
        0.23359407 = fieldWeight in 55, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0234375 = fieldNorm(doc=55)
    0.033674855 = weight(_text_:und in 55) [ClassicSimilarity], result of:
      0.033674855 = score(doc=55,freq=22.0), product of:
        0.13811515 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.062272966 = queryNorm
        0.24381724 = fieldWeight in 55, product of:
          4.690416 = tf(freq=22.0), with freq of:
            22.0 = termFreq=22.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.0234375 = fieldNorm(doc=55)
  0.5 = coord(2/4)

Content

"Fünf Jahre nach seiner Gründung ist Google zum Herz des weltweiten Computernetzes geworden. Mit seiner Konzentration aufs Wesentliche hat die Suchmaschine alle anderen Anbieter weit zurück gelassen. Aber Google kann viel mehr, als im Web nach Texten und Bildern zu suchen. Gesammelt und aufbereitet werden auch Beiträge in Diskussionsforen (Newsgroups), aktuelle Nachrichten und andere im Netz verfügbare Informationen. Wer sich beim "Googeln" darauf beschränkt, ein einziges Wort in das Suchformular einzutippen und dann die ersten von oft mehreren hunderttausend Treffern anzuschauen, nutzt nur einen winzigen Bruchteil der Möglichkeiten. Wie man Google bis zum letzten ausreizt, haben Tara Calishain und Rael Dornfest in einem bislang nur auf Englisch veröffentlichten Buch dargestellt (Tara Calishain/Rael Dornfest: Google Hacks", www.oreilly.de, 28 Euro. Die wichtigsten Praxistipps kosten als Google Pocket Guide 12 Euro). - Suchen mit bis zu zehn Wörtern - Ihre "100 Google Hacks" beginnen mit Google-Strategien wie der Kombination mehrerer Suchbegriffe und enden mit der Aufforderung zur eigenen Nutzung der Google API ("Application Programming Interface"). Diese Schnittstelle kann zur Entwicklung von eigenen Programmen eingesetzt werden,,die auf die Google-Datenbank mit ihren mehr als drei Milliarden Einträgen zugreifen. Ein bewussteres Suchen im Internet beginnt mit der Kombination mehrerer Suchbegriffe - bis zu zehn Wörter können in das Formularfeld eingetippt werden, welche Google mit dem lo-gischen Ausdruck "und" verknüpft. Diese Standardvorgabe kann mit einem dazwischen eingefügten "or" zu einer Oder-Verknüpfung geändert werden. Soll ein bestimmter Begriff nicht auftauchen, wird ein Minuszeichen davor gesetzt. Auf diese Weise können bei einer Suche etwa alle Treffer ausgefiltert werden, die vom Online-Buchhändler Amazon kommen. Weiter gehende Syntax-Anweisungen helfen ebenfalls dabei, die Suche gezielt einzugrenzen: Die vorangestellte Anweisung "intitle:" etwa (ohne Anführungszeichen einzugeben) beschränkt die Suche auf all diejenigen Web-Seiten, die den direkt danach folgenden Begriff in ihrem Titel aufführen. Die Computer von Google bewältigen täglich mehr als 200 Millionen Anfragen. Die Antworten kommen aus einer Datenbank, die mehr als drei Milliarden Einträge enthält und regelmäßig aktualisiert wird. Dazu Werden SoftwareRoboter eingesetzt, so genannte "Search-Bots", die sich die Hyperlinks auf Web-Seiten entlang hangeln und für jedes Web-Dokument einen Index zur Volltextsuche anlegen. Die Einnahmen des 1998 von Larry Page und Sergey Brin gegründeten Unternehmens stammen zumeist von Internet-Portalen, welche die GoogleSuchtechnik für ihre eigenen Dienste übernehmen. Eine zwei Einnahmequelle ist die Werbung von Unternehmen, die für eine optisch hervorgehobene Platzierung in den GoogleTrefferlisten zahlen. Das Unternehmen mit Sitz im kalifornischen Mountain View beschäftigt rund 800 Mitarbeiter. Der Name Google leitet sich ab von dem Kunstwort "Googol", mit dem der amerikanische Mathematiker Edward Kasner die unvorstellbar große Zahl 10 hoch 100 (eine 1 mit hundert Nullen) bezeichnet hat. Kommerzielle Internet-Anbieter sind sehr, daran interessiert, auf den vordersten Plätzen einer Google-Trefferliste zu erscheinen.
Da Google im Unterschied zu Yahoo oder Lycos nie ein auf möglichst viele Besuche angelegtes Internet-Portal werden wollte, ist die Suche in der Datenbank auch außerhalb der Google-Web-Site möglich. Dafür gibt es zunächst die "Google Toolbar" für den Internet Explorer, mit der dieser Browser eine eigene Leiste, für die Google-Suche erhält. Freie Entwickler bieten im Internet eine eigene Umsetzung: dieses Werkzeugs auch für den Netscape/ Mozilla-Browser an. Daneben kann ein GoogleSucheingabefeld aber auch auf die eigene WebSeite platziert werden - dazu sind nur vier Zei-len HTML-Code nötig. Eine Google-Suche zu starten, ist übrigens auch ganz ohne Browser möglich. Dazu hat das Unternehmen im Aprilvergangenen Jahres die API ("Application Programming Interface") frei gegeben, die in eigene Programme' eingebaut wird. So kann man etwa eine Google-Suche mit einer E-Mail starten: Die Suchbegriffe werden in die Betreff Zeile einer ansonsten leeren EMail eingetragen, die an die Adresse google@capeclear.com geschickt wird. Kurz danach trifft eine automatische Antwort-Mail mit den ersten zehn Treffern ein. Die entsprechenden Kenntnisse vorausgesetzt, können Google-Abfragen auch in Web-Services eingebaut werden - das sind Programme, die Daten aus dem Internet verarbeiten. Als Programmiertechniken kommen dafür Perl, PHP, Python oder Java in Frage. Calishain und Dornfest stellen sogar eine Reihe von abgedrehten Sites vor, die solche Programme für abstrakte Gedichte oder andere Kunstwerke einsetzen."

0.05980172 = product of:
  0.23920688 = sum of:
    0.23920688 = weight(_text_:java in 729) [ClassicSimilarity], result of:
      0.23920688 = score(doc=729,freq=2.0), product of:
        0.43886918 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.062272966 = queryNorm
        0.5450528 = fieldWeight in 729, 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=729)
  0.25 = coord(1/4)

Abstract

Discusses the development of Campus Wide Information Systems with reference to the work of Leuven University Library. A 4th phase can now be distinguished in the evolution of CWISs as they evolve towards Intranets. WWW technology is applied to organise a consistent interface to different types of information, databases and services within an institution. WWW servers now exist via which queries and query results are translated from the Web environment to the specific database query language and vice versa. The integration of Java will enable programs to be executed from within the Web environment. Describes each phase of CWIS development at KU Leuven

0.05980172 = product of:
  0.23920688 = sum of:
    0.23920688 = weight(_text_:java in 756) [ClassicSimilarity], result of:
      0.23920688 = score(doc=756,freq=2.0), product of:
        0.43886918 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.062272966 = queryNorm
        0.5450528 = fieldWeight in 756, 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=756)
  0.25 = coord(1/4)

Abstract

Describes 2 research projects aimed at studying the parallel issues of image and video indexing, information retrieval and manipulation: VisualSEEK, a content based image query system and a Java based WWW application supporting localised colour and spatial similarity retrieval; and CVEPS (Compressed Video Editing and Parsing System) which supports video manipulation with indexing support of individual frames from VisualSEEK and a hierarchical new video browsing and indexing system. In both media forms, these systems address the problem of heterogeneous unconstrained collections

0.05980172 = product of:
  0.23920688 = sum of:
    0.23920688 = weight(_text_:java in 3611) [ClassicSimilarity], result of:
      0.23920688 = score(doc=3611,freq=2.0), product of:
        0.43886918 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.062272966 = queryNorm
        0.5450528 = fieldWeight in 3611, 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=3611)
  0.25 = coord(1/4)

Abstract

Discusses various structural searching methods available on the Web. some databases such as the Brookhaven Protein Database use keyword searching which does not provide the desired substructure search capabilities. Others like CS ChemFinder and MDL's Chemscape use graphical plug in programs. Although plug in programs provide more capabilities, users first have to obtain a copy of the programs. Due to this limitation, Tripo's WebSketch and ACD Interactive Lab adopt a different approach. Using JAVA applets, users create and display a structure query of the molecule on the web page without using other software. The new technique is likely to extend itself to other electronic publications

0.05980172 = product of:
  0.23920688 = sum of:
    0.23920688 = weight(_text_:java in 4287) [ClassicSimilarity], result of:
      0.23920688 = score(doc=4287,freq=2.0), product of:
        0.43886918 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.062272966 = queryNorm
        0.5450528 = fieldWeight in 4287, 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=4287)
  0.25 = coord(1/4)

Abstract

Describes the work undertaken by the Wiliam Blake Archive, Virginia University, to document the metadata tools for handling digital images of illustrations accompanying Blake's work. Images are encoded in both JPEG and TIFF formats. Image Documentation (ID) records are slotted into that portion of the JPEG file reserved for textual metadata. Because the textual content of the ID record now becomes part of the image file itself, the documentary metadata travels with the image even it it is downloaded from one file to another. The metadata is invisible when viewing the image but becomes accessible to users via the 'info' button on the control panel of the Java applet

0.05980172 = product of:
  0.23920688 = sum of:
    0.23920688 = weight(_text_:java in 658) [ClassicSimilarity], result of:
      0.23920688 = score(doc=658,freq=2.0), product of:
        0.43886918 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.062272966 = queryNorm
        0.5450528 = fieldWeight in 658, 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=658)
  0.25 = coord(1/4)

Abstract

This paper describes a graphical interface for the navigation and construction of faceted thesauri that is based on formal concept analysis. Each facet of a thesaurus is represented as a mathematical lattice that is further subdivided into components. Users can graphically navigate through the Java implementation of the interface by clicking on terms that connect facets and components. Since there are many applications for thesauri in the knowledge representation field, such a graphical interface has the potential of being very useful