Search (1214 results, page 2 of 61)

0.08021012 = product of:
  0.32084048 = sum of:
    0.32084048 = weight(_text_:java in 2673) [ClassicSimilarity], result of:
      0.32084048 = score(doc=2673,freq=4.0), product of:
        0.4162321 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059060898 = queryNorm
        0.7708211 = fieldWeight in 2673, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0546875 = fieldNorm(doc=2673)
  0.25 = coord(1/4)

Abstract

The Wolverhampton Web Library (WWLib) is a WWW search engine that provides access to UK based information. The experimental version developed in 1995, was a success but highlighted the need for a much higher degree of automation. An interesting feature of the experimental WWLib was that it organised information according to DDC. Discusses the advantages of classification and describes the automatic classifier that is being developed in Java as part of the new, fully automated WWLib

0.07762815 = product of:
  0.3105126 = sum of:
    0.3105126 = weight(_text_:humanly in 287) [ClassicSimilarity], result of:
      0.3105126 = score(doc=287,freq=2.0), product of:
        0.57617193 = queryWeight, product of:
          9.755557 = idf(docFreq=6, maxDocs=44421)
          0.059060898 = queryNorm
        0.5389235 = fieldWeight in 287, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          9.755557 = idf(docFreq=6, maxDocs=44421)
          0.0390625 = fieldNorm(doc=287)
  0.25 = coord(1/4)

Abstract

Automatic document categorization is an important research problem in Information Science and Natural Language Processing. Many applications, including, Word Sense Disambiguation and Information Retrieval in large collections, can benefit from such categorization. This paper focuses on automatic categorization of documents from the biomedical literature into broad discipline-based categories. Two different systems are described and contrasted: CISMeF, which uses rules based on human indexing of the documents by the Medical Subject Headings (MeSH) controlled vocabulary in order to assign metaterms (MTs), and Journal Descriptor Indexing (JDI), based on human categorization of about 4,000 journals and statistical associations between journal descriptors (JDs) and textwords in the documents. We evaluate and compare the performance of these systems against a gold standard of humanly assigned categories for 100 MEDLINE documents, using six measures selected from trec_eval. The results show that for five of the measures performance is comparable, and for one measure JDI is superior. We conclude that these results favor JDI, given the significantly greater intellectual overhead involved in human indexing and maintaining a rule base for mapping MeSH terms to MTs. We also note a JDI method that associates JDs with MeSH indexing rather than textwords, and it may be worthwhile to investigate whether this JDI method (statistical) and CISMeF (rule-based) might be combined and then evaluated showing they are complementary to one another.

0.07762815 = product of:
  0.3105126 = sum of:
    0.3105126 = weight(_text_:humanly in 1955) [ClassicSimilarity], result of:
      0.3105126 = score(doc=1955,freq=2.0), product of:
        0.57617193 = queryWeight, product of:
          9.755557 = idf(docFreq=6, maxDocs=44421)
          0.059060898 = queryNorm
        0.5389235 = fieldWeight in 1955, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          9.755557 = idf(docFreq=6, maxDocs=44421)
          0.0390625 = fieldNorm(doc=1955)
  0.25 = coord(1/4)

Abstract

This paper develops an understanding of creativity to meet the requirements of the decision of the Supreme Court of the United States in Feist v. Rural (1991). The inclusion of creativity in originality, in a minimal degree of creativity, and in a creative spark below the level required for originality, is first established. Conditions for creativity are simultaneously derived. Clauses negatively implying creativity are then identified and considered. The clauses that imply creativity can be extensively correlated with conceptions of computability. The negative of creativity is then understood as an automatic mechanical or computational procedure or a so routine process that results in a highly routine product. Conversely, creativity invariantly involves a not mechanical procedure. The not mechanical is then populated by meaning, in accord with accepted distinctions, drawing on a range of discourses. Meaning is understood as a different level of analysis to the syntactic or mechanical and also as involving direct human engagement with meaning. As direct engagement with meaning, it can be connected to classic concepts of creativity, through the association of dissimilars. Creativity is finally understood as not mechanical human activity above a certain level of routinicity. Creativity is then integrated with a minimal degree of creativity and with originality. The level of creativity required for a minimal degree is identified as intellectual. The combination of an intellectual level with a sufficient amount of creativity can be read from the exchange values connected with the product of creative activity. Humanly created bibliographic records and indexes are then possible correlates to, or constituents of, a minimal degree of creativity. A four-stage discriminatory process for determining originality is then specified. Finally, the strength and value of the argument are considered.

0.07762815 = product of:
  0.3105126 = sum of:
    0.3105126 = weight(_text_:humanly in 4624) [ClassicSimilarity], result of:
      0.3105126 = score(doc=4624,freq=2.0), product of:
        0.57617193 = queryWeight, product of:
          9.755557 = idf(docFreq=6, maxDocs=44421)
          0.059060898 = queryNorm
        0.5389235 = fieldWeight in 4624, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          9.755557 = idf(docFreq=6, maxDocs=44421)
          0.0390625 = fieldNorm(doc=4624)
  0.25 = coord(1/4)

Abstract

In this paper, we propose a high-level analysis of the implications of big data for knowledge organisation (KO) and knowledge organisation systems (KOSs). We confront the current debates within the KO community about the relevance of universal bibliographic classifications and the thesaurus in the web with the ongoing discussions about the epistemological and methodological assumptions underlying data-driven inquiry. In essence, big data will not remove the need for humanly-constructed KOSs. However, ongoing transformations in knowledge production processes entailed by big data and Web 2.0 put pressure on the KO community to rethink the standpoint from which KOSs are designed. Essentially, the field of KO needs to move from laying down the apodictic (that which we know for all time) to adapting to the new world of social and natural scientific knowledge by creating maximally flexible schemas-faceted rather than Aristotelean classifications. KO also needs to adapt to the changing nature of output in the social and natural sciences, to the extent that these in turn are being affected by the advent of big data. Theoretically, this entails a shift from purely universalist and normative top-down approaches to more descriptive bottom-up approaches that can be inclusive of diverse viewpoints. Methodologically, this means striking the right balance between two seemingly opposing modalities in designing KOSs: the necessity on the one hand to incorporate automated techniques and on the other, to solicit contributions from amateurs (crowdsourcing) via Web 2.0 platforms.

0.06875153 = product of:
  0.27500612 = sum of:
    0.27500612 = weight(_text_:java in 4593) [ClassicSimilarity], result of:
      0.27500612 = score(doc=4593,freq=4.0), product of:
        0.4162321 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059060898 = 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.06481957 = product of:
  0.25927827 = sum of:
    0.25927827 = weight(_text_:java in 6851) [ClassicSimilarity], result of:
      0.25927827 = score(doc=6851,freq=2.0), product of:
        0.4162321 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059060898 = 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.06481957 = product of:
  0.25927827 = sum of:
    0.25927827 = weight(_text_:java in 171) [ClassicSimilarity], result of:
      0.25927827 = score(doc=171,freq=2.0), product of:
        0.4162321 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059060898 = 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.06481957 = product of:
  0.25927827 = sum of:
    0.25927827 = weight(_text_:java in 604) [ClassicSimilarity], result of:
      0.25927827 = score(doc=604,freq=2.0), product of:
        0.4162321 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059060898 = 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.06481957 = product of:
  0.25927827 = sum of:
    0.25927827 = weight(_text_:java in 2782) [ClassicSimilarity], result of:
      0.25927827 = score(doc=2782,freq=2.0), product of:
        0.4162321 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059060898 = 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.06481957 = product of:
  0.25927827 = sum of:
    0.25927827 = weight(_text_:java in 3078) [ClassicSimilarity], result of:
      0.25927827 = score(doc=3078,freq=2.0), product of:
        0.4162321 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059060898 = 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.06481957 = product of:
  0.25927827 = sum of:
    0.25927827 = weight(_text_:java in 4618) [ClassicSimilarity], result of:
      0.25927827 = score(doc=4618,freq=2.0), product of:
        0.4162321 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059060898 = 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.06481957 = product of:
  0.25927827 = sum of:
    0.25927827 = weight(_text_:java in 130) [ClassicSimilarity], result of:
      0.25927827 = score(doc=130,freq=2.0), product of:
        0.4162321 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059060898 = 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.06458362 = product of:
  0.12916724 = sum of:
    0.097229354 = weight(_text_:java in 55) [ClassicSimilarity], result of:
      0.097229354 = score(doc=55,freq=2.0), product of:
        0.4162321 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059060898 = 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.031937893 = weight(_text_:und in 55) [ClassicSimilarity], result of:
      0.031937893 = score(doc=55,freq=22.0), product of:
        0.13099112 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.059060898 = 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.05671712 = product of:
  0.22686848 = sum of:
    0.22686848 = weight(_text_:java in 729) [ClassicSimilarity], result of:
      0.22686848 = score(doc=729,freq=2.0), product of:
        0.4162321 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059060898 = 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.05671712 = product of:
  0.22686848 = sum of:
    0.22686848 = weight(_text_:java in 756) [ClassicSimilarity], result of:
      0.22686848 = score(doc=756,freq=2.0), product of:
        0.4162321 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059060898 = 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.05671712 = product of:
  0.22686848 = sum of:
    0.22686848 = weight(_text_:java in 3611) [ClassicSimilarity], result of:
      0.22686848 = score(doc=3611,freq=2.0), product of:
        0.4162321 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059060898 = 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.05671712 = product of:
  0.22686848 = sum of:
    0.22686848 = weight(_text_:java in 4287) [ClassicSimilarity], result of:
      0.22686848 = score(doc=4287,freq=2.0), product of:
        0.4162321 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059060898 = 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.05671712 = product of:
  0.22686848 = sum of:
    0.22686848 = weight(_text_:java in 658) [ClassicSimilarity], result of:
      0.22686848 = score(doc=658,freq=2.0), product of:
        0.4162321 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.059060898 = 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

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

Abstract

Written by the author of the best-selling 1001 really cool Web sites, this fun and informative book enables readers to take full advantage of the Web. More than a mere directory, it identifies and describes the best sites, guiding surfers to such innovations as VRML3-D and Java. Aside from downloads of Web browsers, Renehan points the way to free compilers and interpreters as well as free online access to major scientific journals

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

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.