Search (1716 results, page 2 of 86)

0.09148239 = product of:
  0.36592957 = sum of:
    0.36592957 = weight(_text_:java in 2673) [ClassicSimilarity], result of:
      0.36592957 = score(doc=2673,freq=4.0), product of:
        0.47472697 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.067360975 = 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.088027805 = product of:
  0.17605561 = sum of:
    0.025626834 = weight(_text_:und in 4062) [ClassicSimilarity], result of:
      0.025626834 = score(doc=4062,freq=2.0), product of:
        0.14939985 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.067360975 = queryNorm
        0.17153187 = fieldWeight in 4062, 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=4062)
    0.15042877 = weight(_text_:here in 4062) [ClassicSimilarity], result of:
      0.15042877 = score(doc=4062,freq=2.0), product of:
        0.36196628 = queryWeight, product of:
          5.373531 = idf(docFreq=559, maxDocs=44421)
          0.067360975 = queryNorm
        0.4155878 = fieldWeight in 4062, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.373531 = idf(docFreq=559, maxDocs=44421)
          0.0546875 = fieldNorm(doc=4062)
  0.5 = coord(2/4)

Abstract

Until recently, most research an music information retrieval concentrated an monophonic music. Online Music Retrieval and Searching (OMRAS) is a threeyear project funded under the auspices of the JISC (Joint Information Systems Committee)/NSF (National Science Foundation) International Digital Library Initiative which began in 1999 and whose remit was to investigate the issues surrounding polyphonic music information retrieval. Here we outline the work OMRAS has achieved in pattern matching, document retrieval, and audio transcription, as weIl as some prototype work in how to implement these techniques into library systems.

Footnote

Beitrag in einem Themenheft zur Musikerschließung und zum Musikretrieval

0.088027805 = product of:
  0.17605561 = sum of:
    0.025626834 = weight(_text_:und in 879) [ClassicSimilarity], result of:
      0.025626834 = score(doc=879,freq=2.0), product of:
        0.14939985 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.067360975 = queryNorm
        0.17153187 = fieldWeight in 879, 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=879)
    0.15042877 = weight(_text_:here in 879) [ClassicSimilarity], result of:
      0.15042877 = score(doc=879,freq=2.0), product of:
        0.36196628 = queryWeight, product of:
          5.373531 = idf(docFreq=559, maxDocs=44421)
          0.067360975 = queryNorm
        0.4155878 = fieldWeight in 879, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.373531 = idf(docFreq=559, maxDocs=44421)
          0.0546875 = fieldNorm(doc=879)
  0.5 = coord(2/4)

Abstract

Thesaurus data structures and exchange formats (ways of tagging and encoding thesauri for transfer between computer applications) are discussed. Single- and multiple-user thesaurus software is functionally similar, apart from scale. Several lists of requirements for such software have been published, and important aspects are summarized here, including input, editing, output, and the interfaces used by indexers and searchers. The way in which thesaurus software may be extended to cover other types of controlled vocabularies is covered briefly, followed by issues that arise in management and updating of thesauri, including changes to collections of documents indexed by previous versions and the mapping and merging of thesauri to provide a common search interface.

Theme

Konzeption und Anwendung des Prinzips Thesaurus

0.07841348 = product of:
  0.31365392 = sum of:
    0.31365392 = weight(_text_:java in 4593) [ClassicSimilarity], result of:
      0.31365392 = score(doc=4593,freq=4.0), product of:
        0.47472697 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.067360975 = 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.07545241 = product of:
  0.15090482 = sum of:
    0.021965858 = weight(_text_:und in 5116) [ClassicSimilarity], result of:
      0.021965858 = score(doc=5116,freq=2.0), product of:
        0.14939985 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.067360975 = queryNorm
        0.14702731 = fieldWeight in 5116, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.046875 = fieldNorm(doc=5116)
    0.12893896 = weight(_text_:here in 5116) [ClassicSimilarity], result of:
      0.12893896 = score(doc=5116,freq=2.0), product of:
        0.36196628 = queryWeight, product of:
          5.373531 = idf(docFreq=559, maxDocs=44421)
          0.067360975 = queryNorm
        0.35621813 = fieldWeight in 5116, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.373531 = idf(docFreq=559, maxDocs=44421)
          0.046875 = fieldNorm(doc=5116)
  0.5 = coord(2/4)

Abstract

This paper describes a proposal for a new approach to thesaurus design and construction that could have significant implicantions for change in the way multilingual thesauri are handled and integrated with each other. The formula presented here has its origin in the work of the German Thesaurus Committee and has had input from a number of scientists and practitioners int he field. The emphasis is on the various types of relationships found among concepts, notiions and universals in languages. These relationships are analysed and refined beyond the approach taken in existing thesauri. This proposal is very much at the discussion stage and the author invites the assistance of interested readers through criticisms, discussion and dialogue. Applications of the proposed thesaurus are included and the major goal of this proposal is to provide the basis for improved desing and integration of multilingual thesauri

Theme

Konzeption und Anwendung des Prinzips Thesaurus

0.07545241 = product of:
  0.15090482 = sum of:
    0.021965858 = weight(_text_:und in 5467) [ClassicSimilarity], result of:
      0.021965858 = score(doc=5467,freq=2.0), product of:
        0.14939985 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.067360975 = queryNorm
        0.14702731 = fieldWeight in 5467, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.046875 = fieldNorm(doc=5467)
    0.12893896 = weight(_text_:here in 5467) [ClassicSimilarity], result of:
      0.12893896 = score(doc=5467,freq=2.0), product of:
        0.36196628 = queryWeight, product of:
          5.373531 = idf(docFreq=559, maxDocs=44421)
          0.067360975 = queryNorm
        0.35621813 = fieldWeight in 5467, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.373531 = idf(docFreq=559, maxDocs=44421)
          0.046875 = fieldNorm(doc=5467)
  0.5 = coord(2/4)

Abstract

This paper describes a proposal for a new approach to thesaurus design and construction that could have significant implications for change in the way multilingual thesauri are handled and integrated with each other. The formula presented here has its origin in the work of the German Thesaurus Committee and has had input from a number of scientists and practitioners in the field. The emphasis is on the various types of relationships found among concepts, notions and universals in languages. These relationships are analysed and refined beyond the approach taken in existing thesauri. This proposal is very much at the discussion stage and the author invites the assistance of interested readers through criticisms, discussion and dialogue. Applications of the proposed thesaurus are included and the major goal of this proposal is to provide the basis for improved design and integration of multilingual thesauri

Theme

Konzeption und Anwendung des Prinzips Thesaurus

0.07545241 = product of:
  0.15090482 = sum of:
    0.021965858 = weight(_text_:und in 241) [ClassicSimilarity], result of:
      0.021965858 = score(doc=241,freq=2.0), product of:
        0.14939985 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.067360975 = queryNorm
        0.14702731 = fieldWeight in 241, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.046875 = fieldNorm(doc=241)
    0.12893896 = weight(_text_:here in 241) [ClassicSimilarity], result of:
      0.12893896 = score(doc=241,freq=2.0), product of:
        0.36196628 = queryWeight, product of:
          5.373531 = idf(docFreq=559, maxDocs=44421)
          0.067360975 = queryNorm
        0.35621813 = fieldWeight in 241, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.373531 = idf(docFreq=559, maxDocs=44421)
          0.046875 = fieldNorm(doc=241)
  0.5 = coord(2/4)

Abstract

The intentionally ambiguous expression "Popular Music Browser" reflects the two main goals of this project, which started in 1998, at Sony Computer Science Laboratories. First, we are interested in human-centered issues related to browsing "Popular Music." Popular here means that the music accessed is distributed widely and known to many listeners. Second, we consider "popular browsing" of music, i.e., making music accessible to nonspecialists (music lovers) and allowing sharing of musical tastes and information within communities, departing from the usual, single-user view of digital libraries. This research project covers all areas of the musicto-listener chain, from music description, descriptor extraction from the music signal, or data mining techniques, similarity-based access, and novel music retrieval methods such as automatic sequence generation, and to user interface issues. This article describes the scientific and technical issues at stake and the results obtained, and is illustrated by prototypes developed within the European IST project Cuidado.

Footnote

Beitrag in einem Themenheft zur Musikerschließung und zum Musikretrieval

0.07545241 = product of:
  0.15090482 = sum of:
    0.021965858 = weight(_text_:und in 207) [ClassicSimilarity], result of:
      0.021965858 = score(doc=207,freq=2.0), product of:
        0.14939985 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.067360975 = queryNorm
        0.14702731 = fieldWeight in 207, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.046875 = fieldNorm(doc=207)
    0.12893896 = weight(_text_:here in 207) [ClassicSimilarity], result of:
      0.12893896 = score(doc=207,freq=2.0), product of:
        0.36196628 = queryWeight, product of:
          5.373531 = idf(docFreq=559, maxDocs=44421)
          0.067360975 = queryNorm
        0.35621813 = fieldWeight in 207, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.373531 = idf(docFreq=559, maxDocs=44421)
          0.046875 = fieldNorm(doc=207)
  0.5 = coord(2/4)

Abstract

References to printed documents made on the web are called web-to-print references. These printed documents then in turn receive web-to-print citations. Webto-print citations and web-to-print references are the topic of this article, in which we study the online impact of printed sources. Web-to-print citations are discussed from a structural point of view and a small-scale experiment related to web-to-print citations for local history journals is performed. The main research question in setting up this experiment concerns the possibility of using web-to-print citations as a substitute for classical citation indexes by gauging the importance, visibility and impact of journals in the humanities. Results show the importance of web bibliographies in the field, but, at least for what concerns the journals and the period studied here, the amount of received web-to-print citations is too small to draw general conclusions.

Source

Information - Wissenschaft und Praxis. 57(2006) H.8, S.422-426

0.07545241 = product of:
  0.15090482 = sum of:
    0.021965858 = weight(_text_:und in 1924) [ClassicSimilarity], result of:
      0.021965858 = score(doc=1924,freq=2.0), product of:
        0.14939985 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.067360975 = queryNorm
        0.14702731 = fieldWeight in 1924, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.046875 = fieldNorm(doc=1924)
    0.12893896 = weight(_text_:here in 1924) [ClassicSimilarity], result of:
      0.12893896 = score(doc=1924,freq=2.0), product of:
        0.36196628 = queryWeight, product of:
          5.373531 = idf(docFreq=559, maxDocs=44421)
          0.067360975 = queryNorm
        0.35621813 = fieldWeight in 1924, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.373531 = idf(docFreq=559, maxDocs=44421)
          0.046875 = fieldNorm(doc=1924)
  0.5 = coord(2/4)

Abstract

A thesaurus and an ontology provide a set of structured terms, phrases, and metadata, often in a hierarchical arrangement, that may be used to index, search, and mine documents. We describe the decisions that should be made when including a term, deciding whether a term should be subdivided into its subclasses, or determining which of more than one set of possible subclasses should be used. Based on retrospective measurements or estimates of future performance when using thesaurus terms in document ordering, decisions are made so as to maximize performance. These decisions may be used in the automatic construction of a thesaurus. The evaluation of an existing thesaurus is described, consistent with the decision criteria developed here. These kinds of user-focused decision-theoretic techniques may be applied to other hierarchical applications, such as faceted classification systems used in information architecture or the use of hierarchical terms in "breadcrumb navigation".

Theme

Konzeption und Anwendung des Prinzips Thesaurus

0.07545241 = product of:
  0.15090482 = sum of:
    0.021965858 = weight(_text_:und in 737) [ClassicSimilarity], result of:
      0.021965858 = score(doc=737,freq=2.0), product of:
        0.14939985 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.067360975 = queryNorm
        0.14702731 = fieldWeight in 737, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.046875 = fieldNorm(doc=737)
    0.12893896 = weight(_text_:here in 737) [ClassicSimilarity], result of:
      0.12893896 = score(doc=737,freq=2.0), product of:
        0.36196628 = queryWeight, product of:
          5.373531 = idf(docFreq=559, maxDocs=44421)
          0.067360975 = queryNorm
        0.35621813 = fieldWeight in 737, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.373531 = idf(docFreq=559, maxDocs=44421)
          0.046875 = fieldNorm(doc=737)
  0.5 = coord(2/4)

Abstract

Founded in 1931 by Otto Neugebauer as the printed documentation service "Zentralblatt für Mathematik und ihre Grenzgebiete", Zentralblatt MATH (ZBMATH) celebrates its 80th anniversary in 2011. Today it is the most comprehensive and active reference database in pure and applied mathematics worldwide. Many prominent mathematicians have been involved in this service as reviewers or editors and have, like all mathematicians, left their footprints in ZBMATH, in a long list of entries describing all of their research publications in mathematics. This book provides one review from each of the 80 years of ZBMATH. Names like Courant, Kolmogorov, Hardy, Hirzebruch, Faltings and many others can be found here. In addition to the original reviews, the book offers the authors' profiles indicating their co-authors, their favorite journals and the time span of their publication activities. In addition to this, a generously illustrated essay by Silke Göbel describes the history of ZBMATH.

0.07545241 = product of:
  0.15090482 = sum of:
    0.021965858 = weight(_text_:und in 2376) [ClassicSimilarity], result of:
      0.021965858 = score(doc=2376,freq=2.0), product of:
        0.14939985 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.067360975 = queryNorm
        0.14702731 = fieldWeight in 2376, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.046875 = fieldNorm(doc=2376)
    0.12893896 = weight(_text_:here in 2376) [ClassicSimilarity], result of:
      0.12893896 = score(doc=2376,freq=2.0), product of:
        0.36196628 = queryWeight, product of:
          5.373531 = idf(docFreq=559, maxDocs=44421)
          0.067360975 = queryNorm
        0.35621813 = fieldWeight in 2376, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.373531 = idf(docFreq=559, maxDocs=44421)
          0.046875 = fieldNorm(doc=2376)
  0.5 = coord(2/4)

Abstract

Thesauri are the most important tools for information and knowledge organization, and they undergo regular improvements according to the rapid development of new requirements and affordances of emerging information techniques. This paper attempts to integrate ontology into the conceptual organization scheme of thesauri and proposes a new solution to extend the functionality of thesauri based on ontological features, which is termed here as an onto-thesaurus. In this study, a prototype system named the Chinese Information Science and Information Service onto-thesaurus system (CIS&IS), was developed to analyze ontothesaurus with the category of information science and information service in the Chinese Topic Classification Dictionary with a two-stage approach. The first stage aims to define and construct the onto-thesaurus. The second stage aims to realize the evolution function of onto-thesaurus. The main purpose of this system was to achieve the function of self-learning and auto-evolution and to enable a much more effective conceptual retrieval by the newly proposed onto-thesaurus.

Theme

Konzeption und Anwendung des Prinzips Thesaurus

0.07545241 = product of:
  0.15090482 = sum of:
    0.021965858 = weight(_text_:und in 3694) [ClassicSimilarity], result of:
      0.021965858 = score(doc=3694,freq=2.0), product of:
        0.14939985 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.067360975 = queryNorm
        0.14702731 = fieldWeight in 3694, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.046875 = fieldNorm(doc=3694)
    0.12893896 = weight(_text_:here in 3694) [ClassicSimilarity], result of:
      0.12893896 = score(doc=3694,freq=2.0), product of:
        0.36196628 = queryWeight, product of:
          5.373531 = idf(docFreq=559, maxDocs=44421)
          0.067360975 = queryNorm
        0.35621813 = fieldWeight in 3694, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.373531 = idf(docFreq=559, maxDocs=44421)
          0.046875 = fieldNorm(doc=3694)
  0.5 = coord(2/4)

Abstract

Seekers of information in libraries either go through a librarian intermediary or they help themselves. When they go through librarians they must develop their questions through four levels of need, referred to here as the visceral, conscious, formalized, and compromised needs. In his pre-search interview with an information seeker the reference librarian attempts to help him arrive at an understanding of his 'compromised' need by determining: (1) the subject of his interest; (2) his motivation; (3) his personal characteristics; (4) the relationship of the inquiry to file organization; and (5) anticipated answers. The author contends that research is needed into the techniques of conducting this negotiation between the user and the reference librarian

Footnote

Vgl. auch in: Reference and information services: a reader. Ed.: B. Katz and A. Tarr. New York: Scarecrow Press 1978. Vgl. auch den Artikel zur Rezeption und Wirkung: Chang, Y.-W.: The influence of Taylor's paper, Question-Negotiation and Information-Seeking in Libraries. In: Information processing and management. 49(2013) no.5, S.983-994.

0.07392894 = product of:
  0.29571575 = sum of:
    0.29571575 = weight(_text_:java in 6851) [ClassicSimilarity], result of:
      0.29571575 = score(doc=6851,freq=2.0), product of:
        0.47472697 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.067360975 = 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.07392894 = product of:
  0.29571575 = sum of:
    0.29571575 = weight(_text_:java in 171) [ClassicSimilarity], result of:
      0.29571575 = score(doc=171,freq=2.0), product of:
        0.47472697 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.067360975 = 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.07392894 = product of:
  0.29571575 = sum of:
    0.29571575 = weight(_text_:java in 604) [ClassicSimilarity], result of:
      0.29571575 = score(doc=604,freq=2.0), product of:
        0.47472697 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.067360975 = 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.07392894 = product of:
  0.29571575 = sum of:
    0.29571575 = weight(_text_:java in 2782) [ClassicSimilarity], result of:
      0.29571575 = score(doc=2782,freq=2.0), product of:
        0.47472697 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.067360975 = 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.07392894 = product of:
  0.29571575 = sum of:
    0.29571575 = weight(_text_:java in 3078) [ClassicSimilarity], result of:
      0.29571575 = score(doc=3078,freq=2.0), product of:
        0.47472697 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.067360975 = 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.07392894 = product of:
  0.29571575 = sum of:
    0.29571575 = weight(_text_:java in 4618) [ClassicSimilarity], result of:
      0.29571575 = score(doc=4618,freq=2.0), product of:
        0.47472697 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.067360975 = 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.07392894 = product of:
  0.29571575 = sum of:
    0.29571575 = weight(_text_:java in 130) [ClassicSimilarity], result of:
      0.29571575 = score(doc=130,freq=2.0), product of:
        0.47472697 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.067360975 = 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.07365983 = product of:
  0.14731966 = sum of:
    0.110893406 = weight(_text_:java in 55) [ClassicSimilarity], result of:
      0.110893406 = score(doc=55,freq=2.0), product of:
        0.47472697 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.067360975 = 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.036426257 = weight(_text_:und in 55) [ClassicSimilarity], result of:
      0.036426257 = score(doc=55,freq=22.0), product of:
        0.14939985 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.067360975 = 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."