Search (3724 results, page 2 of 187)

0.0494159 = product of:
  0.2964954 = sum of:
    0.2964954 = weight(_text_:me in 6312) [ClassicSimilarity], result of:
      0.2964954 = score(doc=6312,freq=4.0), product of:
        0.32644376 = queryWeight, product of:
          7.2660704 = idf(docFreq=83, maxDocs=44218)
          0.04492714 = queryNorm
        0.9082588 = fieldWeight in 6312, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          7.2660704 = idf(docFreq=83, maxDocs=44218)
          0.0625 = fieldNorm(doc=6312)
  0.16666667 = coord(1/6)

Abstract

Describes a training programme for cataloguers at the Texas A&M University, which helps introduce the OCLC Cataloging Micro Enhance Plus (CAT ME Plus) program. A designated lead trainer familiarised herself with the Learning to use CAT ME Plus software and Cataloging Micro Enhancer Plus User Guuide before embarking on the training process. Throughout the training, a hands on component builds trainees' confidence and provides the trainer with an opportunity to monitor their progress

0.047570806 = product of:
  0.28542483 = sum of:
    0.28542483 = weight(_text_:3a in 140) [ClassicSimilarity], result of:
      0.28542483 = score(doc=140,freq=2.0), product of:
        0.38089278 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.04492714 = queryNorm
        0.7493574 = fieldWeight in 140, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.0625 = fieldNorm(doc=140)
  0.16666667 = coord(1/6)

Content

Vgl. auch: https://studylibde.com/doc/13053640/richard-schrodt. Vgl. auch: http%3A%2F%2Fwww.univie.ac.at%2FGermanistik%2Fschrodt%2Fvorlesung%2Fwissenschaftssprache.doc&usg=AOvVaw1lDLDR6NFf1W0-oC9mEUJf.

0.047570806 = product of:
  0.28542483 = sum of:
    0.28542483 = weight(_text_:3a in 230) [ClassicSimilarity], result of:
      0.28542483 = score(doc=230,freq=2.0), product of:
        0.38089278 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.04492714 = queryNorm
        0.7493574 = fieldWeight in 230, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.0625 = fieldNorm(doc=230)
  0.16666667 = coord(1/6)

Source

https%3A%2F%2Ftannerlectures.utah.edu%2F_documents%2Fa-to-z%2Fp%2Fpopper80.pdf&usg=AOvVaw3f4QRTEH-OEBmoYr2J_c7H

0.043677904 = product of:
  0.2620674 = sum of:
    0.2620674 = weight(_text_:me in 6441) [ClassicSimilarity], result of:
      0.2620674 = score(doc=6441,freq=2.0), product of:
        0.32644376 = queryWeight, product of:
          7.2660704 = idf(docFreq=83, maxDocs=44218)
          0.04492714 = queryNorm
        0.80279493 = fieldWeight in 6441, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.2660704 = idf(docFreq=83, maxDocs=44218)
          0.078125 = fieldNorm(doc=6441)
  0.16666667 = coord(1/6)

Object

CAT ME Plus

0.043677904 = product of:
  0.2620674 = sum of:
    0.2620674 = weight(_text_:me in 3488) [ClassicSimilarity], result of:
      0.2620674 = score(doc=3488,freq=2.0), product of:
        0.32644376 = queryWeight, product of:
          7.2660704 = idf(docFreq=83, maxDocs=44218)
          0.04492714 = queryNorm
        0.80279493 = fieldWeight in 3488, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.2660704 = idf(docFreq=83, maxDocs=44218)
          0.078125 = fieldNorm(doc=3488)
  0.16666667 = coord(1/6)

0.043677904 = product of:
  0.2620674 = sum of:
    0.2620674 = weight(_text_:me in 2431) [ClassicSimilarity], result of:
      0.2620674 = score(doc=2431,freq=2.0), product of:
        0.32644376 = queryWeight, product of:
          7.2660704 = idf(docFreq=83, maxDocs=44218)
          0.04492714 = queryNorm
        0.80279493 = fieldWeight in 2431, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.2660704 = idf(docFreq=83, maxDocs=44218)
          0.078125 = fieldNorm(doc=2431)
  0.16666667 = coord(1/6)

Abstract

I'd like to talk about some things that have come up for me as I've thought about how FRBR might apply to moving images.

0.043238916 = product of:
  0.25943348 = sum of:
    0.25943348 = weight(_text_:me in 3714) [ClassicSimilarity], result of:
      0.25943348 = score(doc=3714,freq=4.0), product of:
        0.32644376 = queryWeight, product of:
          7.2660704 = idf(docFreq=83, maxDocs=44218)
          0.04492714 = queryNorm
        0.79472643 = fieldWeight in 3714, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          7.2660704 = idf(docFreq=83, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3714)
  0.16666667 = coord(1/6)

Abstract

26 August 1996 marked the 25th anniversary of worldCat. As part of a tribute to this resource, OCLC and the US regional networks sponsored an essay contest in which librarians and library users were invited to write essays of 500 words or les on the topic 'What the OCLC Online Union Catalog means to me'. Prizes were offered and the contest attracted entries from 340 librarians an 13 countries. Reproduces the 5 proce winning essays

0.043238916 = product of:
  0.25943348 = sum of:
    0.25943348 = weight(_text_:me in 1995) [ClassicSimilarity], result of:
      0.25943348 = score(doc=1995,freq=4.0), product of:
        0.32644376 = queryWeight, product of:
          7.2660704 = idf(docFreq=83, maxDocs=44218)
          0.04492714 = queryNorm
        0.79472643 = fieldWeight in 1995, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          7.2660704 = idf(docFreq=83, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1995)
  0.16666667 = coord(1/6)

Abstract

What follows are my memories of the events, starting almost five decades ago, that led to the International Standard for Bibliographic Description (ISBD)-still the most successful and widely used international cataloging standard in history. Many of the documents of the time were little more than ephemera (working papers and the like) and some are not now available to me. I have checked my recollections in all the documents to which I have access and apologize in advance for any errors of time or place. I also apologize for the, alas, unavoidable, given the nature of the essay, many repetitions of the words "I" and "me."

0.04212305 = product of:
  0.2527383 = sum of:
    0.2527383 = weight(_text_:mor in 539) [ClassicSimilarity], result of:
      0.2527383 = score(doc=539,freq=2.0), product of:
        0.41386795 = queryWeight, product of:
          9.211981 = idf(docFreq=11, maxDocs=44218)
          0.04492714 = queryNorm
        0.6106738 = fieldWeight in 539, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          9.211981 = idf(docFreq=11, maxDocs=44218)
          0.046875 = fieldNorm(doc=539)
  0.16666667 = coord(1/6)

Abstract

Little research has been reported on how the Internet is being used to source corporate competitive intelligence. An exploratory study was conducted to explore current practice and future potential. A request for participants was posted to business-oriented listservs and Usenet newsgroups. Respondents were sent an open-ended survey which addressed three topics: a) the Internet as a source of competitive edge; b) ways in which the Internet could make their firm mor competitive, and c) security and other usage-related issues from the corporate perspective. Findings suggest that the Internet is being used as a tool for monitoring the external environment, locating distributed experts, engaging in informal know-how trading, and conducting market research. Respondents foresee greater use of the Internet in the context of the competitive intelligence function, and generally have few reservations about using the Internet

0.04212305 = product of:
  0.2527383 = sum of:
    0.2527383 = weight(_text_:mor in 4109) [ClassicSimilarity], result of:
      0.2527383 = score(doc=4109,freq=2.0), product of:
        0.41386795 = queryWeight, product of:
          9.211981 = idf(docFreq=11, maxDocs=44218)
          0.04492714 = queryNorm
        0.6106738 = fieldWeight in 4109, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          9.211981 = idf(docFreq=11, maxDocs=44218)
          0.046875 = fieldNorm(doc=4109)
  0.16666667 = coord(1/6)

Abstract

Conceptual data modelling (CDM) refers to the phase of the information systems development process that involves the abstraction and representation of the real world data pertinent to an organization. When CDM is properly and rigorously performed, the delivered system is expected to be functionally richer, less error-prone, more fully attuned to meet user needs, mor able to adjust to changing user requirements and less expensive. However, there is little evidence that conceptual data modelling of the enterprise is actually conducted. There is a feeling that the 'corporate reality' is much different. In many organizations, CDM is never employed. In others, it is applied in a haphazard, project to project basis, thus leading to considerable redundancy. The academic community has mainly focused on proposing semantic data models but has not demonstrated a rigorous basis for conceptual data modelling. Specially, the community has failed to show how a conceptual data model can map to an accurate logical data model. Discusses and compares the perspectives of academic and practitioner communities regarding the application of conceptual data modelling

0.041624457 = product of:
  0.24974672 = sum of:
    0.24974672 = weight(_text_:3a in 306) [ClassicSimilarity], result of:
      0.24974672 = score(doc=306,freq=2.0), product of:
        0.38089278 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.04492714 = queryNorm
        0.65568775 = fieldWeight in 306, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.0546875 = fieldNorm(doc=306)
  0.16666667 = coord(1/6)

Content

Vgl.: http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=5386707&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D5386707.

0.041624457 = product of:
  0.24974672 = sum of:
    0.24974672 = weight(_text_:3a in 5955) [ClassicSimilarity], result of:
      0.24974672 = score(doc=5955,freq=2.0), product of:
        0.38089278 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.04492714 = queryNorm
        0.65568775 = fieldWeight in 5955, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5955)
  0.16666667 = coord(1/6)

Footnote

Rez. in: Philosophisch-ethische Rezensionen vom 09.11.2019 (Jürgen Czogalla), Unter: https://philosophisch-ethische-rezensionen.de/rezension/Goedert1.html. In: B.I.T. online 23(2020) H.3, S.345-347 (W. Sühl-Strohmenger) [Unter: https%3A%2F%2Fwww.b-i-t-online.de%2Fheft%2F2020-03-rezensionen.pdf&usg=AOvVaw0iY3f_zNcvEjeZ6inHVnOK]. In: Open Password Nr. 805 vom 14.08.2020 (H.-C. Hobohm) [Unter: https://www.password-online.de/?mailpoet_router&endpoint=view_in_browser&action=view&data=WzE0MywiOGI3NjZkZmNkZjQ1IiwwLDAsMTMxLDFd].

0.0401722 = product of:
  0.2410332 = sum of:
    0.2410332 = weight(_text_:22 in 219) [ClassicSimilarity], result of:
      0.2410332 = score(doc=219,freq=4.0), product of:
        0.15732719 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04492714 = queryNorm
        1.5320505 = fieldWeight in 219, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.21875 = fieldNorm(doc=219)
  0.16666667 = coord(1/6)

Date

22. 5.1998 20:02:22

0.0401722 = product of:
  0.2410332 = sum of:
    0.2410332 = weight(_text_:22 in 1386) [ClassicSimilarity], result of:
      0.2410332 = score(doc=1386,freq=4.0), product of:
        0.15732719 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04492714 = queryNorm
        1.5320505 = fieldWeight in 1386, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.21875 = fieldNorm(doc=1386)
  0.16666667 = coord(1/6)

Date

22. 5.1998 20:02:22

0.0401722 = product of:
  0.2410332 = sum of:
    0.2410332 = weight(_text_:22 in 2102) [ClassicSimilarity], result of:
      0.2410332 = score(doc=2102,freq=4.0), product of:
        0.15732719 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04492714 = queryNorm
        1.5320505 = fieldWeight in 2102, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.21875 = fieldNorm(doc=2102)
  0.16666667 = coord(1/6)

Date

22. 5.1998 20:02:22

0.037826173 = product of:
  0.22695704 = sum of:
    0.22695704 = weight(_text_:me in 4492) [ClassicSimilarity], result of:
      0.22695704 = score(doc=4492,freq=6.0), product of:
        0.32644376 = queryWeight, product of:
          7.2660704 = idf(docFreq=83, maxDocs=44218)
          0.04492714 = queryNorm
        0.69524086 = fieldWeight in 4492, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          7.2660704 = idf(docFreq=83, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4492)
  0.16666667 = coord(1/6)

Abstract

The study reported in this paper is part of a programme of ongoing research based on the model of the Information Search Process (ISP) developed in a series of prior studies by Kuhlthau. This study sought to gain a better understanding of the variety of tasks that involve lawyers as a particular group of information workers, how they use information to accomplish their work, and the role mediators play in their process of information seeking and use. Findings revealed that these lawyers frequently were involved in complex tasks that required a constructive process of interpreting, learning and creating. To accomplish these complex tasks, they preferred printed texts over computer databases primarily because computer databases required well-specified requests and did not offer an option for examining a wide range of information at one time. These lawyers called for an active potential role for mediators in 'just for me' services. 'Just for me' services would encompass designing systems to provide a wider range of access more compatible with the process of construction, applying and developing principles of classification that would offer a more uniform system for organising and accessing files, and providing direction in filtering the overwhelming amount of information available on electronic resources.

0.037826173 = product of:
  0.22695704 = sum of:
    0.22695704 = weight(_text_:me in 1717) [ClassicSimilarity], result of:
      0.22695704 = score(doc=1717,freq=6.0), product of:
        0.32644376 = queryWeight, product of:
          7.2660704 = idf(docFreq=83, maxDocs=44218)
          0.04492714 = queryNorm
        0.69524086 = fieldWeight in 1717, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          7.2660704 = idf(docFreq=83, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1717)
  0.16666667 = coord(1/6)

Abstract

A dialogue-based interface for information systems is considered a potentially very useful approach to information access. A key step in computer processing of natural-language dialogues is dialogue-act (DA) recognition. In this paper, we apply a feature-based classification approach for DA recognition, by using the maximum entropy (ME) method to build a classifier for labeling utterances with DA tags. The ME method has the advantage that a large number of heterogeneous features can be flexibly combined in one classifier, which can facilitate feature selection. A unique characteristic of our approach is that it does not need to model the prior probability of DAs directly, and thus avoids the use of a discourse grammar. This simplifies the implementation of the classifier and improves the efficiency of DA recognition, without sacrificing the classification accuracy. We evaluate the classifier using a large data set based on the Switchboard corpus. Encouraging performance is observed; the highest classification accuracy achieved is 75.03%. We also propose a heuristic to address the problem of sparseness of the data set. This problem has resulted in poor classification accuracies of some DA types that have very low occurrence frequencies in the data set. Preliminary evaluation shows that the method is effective in improving the macroaverage classification accuracy of the ME classifier.

0.037826173 = product of:
  0.22695704 = sum of:
    0.22695704 = weight(_text_:me in 4924) [ClassicSimilarity], result of:
      0.22695704 = score(doc=4924,freq=6.0), product of:
        0.32644376 = queryWeight, product of:
          7.2660704 = idf(docFreq=83, maxDocs=44218)
          0.04492714 = queryNorm
        0.69524086 = fieldWeight in 4924, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          7.2660704 = idf(docFreq=83, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4924)
  0.16666667 = coord(1/6)

Abstract

We have developed a system that segments web pages into blocks and predicts those blocks' importance (block importance prediction or BIP). First, we use VIPS to partition a page into a tree composed of blocks and then extracts features from each block and labels all leaf nodes. This paper makes two main contributions. Firstly, we are pioneering the formulation of BIP as a sequence tagging task. We employ DFS, which outputs a single sequence for the whole tree in which related sub-blocks are adjacent. Our second contribution is using the conditional random fields (CRF) model for labeling these sequences. CRF's transition features model correlations between neighboring labels well, and CRF can simultaneously label all blocks in a sequence to find the global optimal solution for the whole sequence, not only the best solution for each block. In our experiments, our CRF-based system achieves an F1-measure of 97.41%, which significantly outperforms our ME-based baseline (95.64%). Lastly, we tested the CRF-based system using sites which were not covered in the training data. On completely novel sites CRF performed slightly worse than ME. However, when given only two training pages from a given site, CRF improved almost three times as much as ME.

0.03767604 = product of:
  0.11302812 = sum of:
    0.09172359 = weight(_text_:me in 1429) [ClassicSimilarity], result of:
      0.09172359 = score(doc=1429,freq=2.0), product of:
        0.32644376 = queryWeight, product of:
          7.2660704 = idf(docFreq=83, maxDocs=44218)
          0.04492714 = queryNorm
        0.28097823 = fieldWeight in 1429, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.2660704 = idf(docFreq=83, maxDocs=44218)
          0.02734375 = fieldNorm(doc=1429)
    0.021304525 = weight(_text_:22 in 1429) [ClassicSimilarity], result of:
      0.021304525 = score(doc=1429,freq=2.0), product of:
        0.15732719 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04492714 = queryNorm
        0.1354154 = fieldWeight in 1429, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.02734375 = fieldNorm(doc=1429)
  0.33333334 = coord(2/6)

Abstract

Pauline Atherton Cochrane has been contributing to library and information science for fifty years. Think of it-from mid-century to the millennium, from ENIAC (practically) to Internet 11 (almost here). What a time to be in our field! Her work an indexing, subject access, and the user-oriented approach had immediate and sustained impact, and she continues to be one of our most heavily cited authors (see, JASIS, 49[4], 327-55) and most beloved personages. This introduction includes a few words about my own experiences with Pauline as well as a short summary of the contributions that make up this tribute. A review of the curriculum vita provided at the end of this publication Shows that Pauline Cochrane has been involved in a wide variety of work. As Marcia Bates points out in her note (See below), Pauline was (and is) a role model, but I will always think of her as simply the best teacher 1 ever had. In 1997, I entered the University of Illinois Graduate School of Library and Information Science as a returning mid-life student; my previous doctorate had not led to a full-time job and I was re-tooling. I was not sure what 1 would find in library school, and the introductory course attended by more than 100 students from widely varied backgrounds had not yet convinced me I was in the right place. Then, one day, Pauline gave a guest lecture an the digital library in my introductory class. I still remember it. She put up some notes-a few words clustered an the blackboard with some circles and directional arrows-and then she gave a free, seemingly extemporaneous, but riveting narrative. She set out a vision for ideal information exchange in the digital environment but noted a host of practical concerns, issues, and potential problems that required (demanded!) continued human intervention. The lecture brought that class and the entire semester's work into focus; it created tremendous excitement for the future of librarianship. 1 saw that librarians and libraries would play an active role. I was in the right place.

Date

22. 9.1997 19:16:05

0.03595745 = product of:
  0.10787234 = sum of:
    0.09265482 = weight(_text_:me in 2139) [ClassicSimilarity], result of:
      0.09265482 = score(doc=2139,freq=4.0), product of:
        0.32644376 = queryWeight, product of:
          7.2660704 = idf(docFreq=83, maxDocs=44218)
          0.04492714 = queryNorm
        0.28383088 = fieldWeight in 2139, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          7.2660704 = idf(docFreq=83, maxDocs=44218)
          0.01953125 = fieldNorm(doc=2139)
    0.015217518 = weight(_text_:22 in 2139) [ClassicSimilarity], result of:
      0.015217518 = score(doc=2139,freq=2.0), product of:
        0.15732719 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.04492714 = queryNorm
        0.09672529 = fieldWeight in 2139, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.01953125 = fieldNorm(doc=2139)
  0.33333334 = coord(2/6)

Content

- Zugriff auf Datei-Newsgroups - Diese Lücke füllen Anbieter, die auf BinärNewsgroups spezialisiert sind. Sie haben in leistungsfähige Hardware und eine schnelle Internet Anbindung investiert und bieten gegen Gebühr Zugang zu den Terabytes an Daten. In aller Regel bezahlen Sie einen Monatsbeitrag, der sich um 10 Euro herum bewegt. Was Sie dafür erwarten können, unterscheidet sich zum Teil erheblich von Dienst zu Dienst. Beim einen Anbieter können Sie unbeschränkt Daten herunterladen, müssen aber in Kauf nehmen, dass jede Nachricht beziehungsweise Datei nach drei Tagen vom Server verschwunden und durch neue Daten ersetzt ist. Wer nichts verpassen will, muss also ständig ein Auge auf neue Inhalte haben. Andere Anbieter halten jede Datei mehr als 20 Tage vor und bieten nützliche Zusatzfunktionen, beschränken Ihre Download-Menge aber auf 6 bis 20 GB pro Monat. - Sieben Anbieter im Test - Wir haben sieben interessante Angebote getestet. Auswahlkriterium war zum einen der Preis: Mehr als 13 Euro im Monat sollte ein Newsserver-Zugang nicht kosten. Zum anderen haben wir Anbieter bevorzugt, bei denen man per Bankeinzug bezahlen kann und nicht nur per Kreditkarte. Wir bewerten die Download-Geschwindigkeit, die Vorhaltezeit der Nachrichten und die Anzahl der angebotenen Newsgroups. Zudem berücksichtigen wir bei der Bewertung Zusatzfunktionen, die ein Dienst bietet. Normalerweise benötigen Sie ein Newsreader-Programm, um auf Newsserver zuzugreifen. Ein großer Pluspunkt ist es, wenn ein Anbieter auch per WebBrowser Zugang auf die Datei-Schätze der Newsgroups bietet. Die Web-Schnittstellen verfügen meist über Komfortfunktionen, die die Bedienung erleichtern. Genauere Infos zum Testverfahren gibt's im Kasten "Wie wir testen" auf Seite 148. - Diese Newsreader sind empfehlenswert - Für Datei-Newsgroups gibt es speziell angepasste Newsreader. Wir empfehlen Newsbin Pro 4.2 für Windows 98/ME, 2000 und XP Mit der englischsprachigen Shareware lassen sich mehrere Dateien gleichzeitig von einem Server herunterladen - eine überaus wichtige Funktion bei Newsservern, die die Bandbreite pro Verbindung beschränken: In dem Fall können Sie nur durch parallele Downloads die Kapazität eines DSL-Anschlusses ausnutzen. Newsbin Pro lässt sich 10 Tagelang testen und kostet 35 Dollar (auf OHeft-CD und unter www.newsbin.com, 1,6 MB). Eine Freeware-Alternative ist Xnews 5.04.25 für Windows 98/ME, NT 4, 2000 und XP. Das englischsprachige Tool ist weniger komfortabel und etwas komplizierter zu bedienen. Es unterstützt maximal vier Downloads gleichzeitig. Hier eine kleine Hilfestellung zu Xnews: Dateien, die Sie herunterladen möchten, markieren Sie mit der Leertaste. Den Download-Vorgang starten Sie mit "Article, Decode" oder der Taste <F4>. Xnews finden Sie unter http:// xnews.newsguy.com (697 KB). Eine deutschsprachige Hilfe-Datei können Sie unter http://xnews.newsguy.com/xnews-de.chm (113 KB) herunterladen.
- Finden, was Sie suchen - Normalerweise können Sie im Usenet nur jede Newsgroup einzeln durchsuchen. Lediglich zwei Dienste im Test bieten eine globale Suchfunktion über alle Newsgroups hinweg: Easynews.com und Newshosting. Sie ist in der jeweiligen Web-Oberfläche integriert. Ein Klick auf einen Eintrag in der Ergebnisliste startet den Download. Komfortabler geht's kaum. Eine Hand voll kostenloser Anbieter indizieren Datei-Newsgroups und bieten ein Suchformular, etwa www.bincrawiercom, www. newzsearch.com und http://altbinaries.ni. Um eine gefundene Datei herunterzuladen, Müssen Sie im Anschluss Ihren Newsreader starten und in die angegebene Newsgroup wechseln. Bincrawler.com wurde im Oktober von einem anderen Anbieter aufgekauft. Ob er den kostenlosen Dienst weiterführen wird, ist ungewiss. - So vermeiden Sie illegale Inhalte - In Foren, in die jeder Anwender nach Belieben Dateien hineinstellen kann, landet auch viel Schmutz. In manchen Newsgroups finden sich etwa Software-Raubkopien und strafrechtlich relevante Bilder. Um nicht damit konfrontiert zu werden, sollten Sie Newsgroups mit eindeutig klingenden Namen meiden. Außerdem sind die angebotenen Dateien häufig mit Viren verseucht. Auch in Newsgroups mit harmloser Bezeichnung stoßen Sie möglicherweise auf urheberrechtlich geschütztes Material. Laden Sie deshalb nur Dateien herunter, von denen Sie sicher sind, dass sie legal angeboten werden. Vor allem urheberrechtlich geschützte MP3-Dateien sollten Sie meiden, da Sie sonst mit ernsten Konsequenzen rechnen müssen (> Beitrag auf Seite 22)."