Search (6 results, page 1 of 1)

0.007171934 = product of:
  0.032273702 = sum of:
    0.011833867 = weight(_text_:of in 5155) [ClassicSimilarity], result of:
      0.011833867 = score(doc=5155,freq=10.0), product of:
        0.061262865 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.03917671 = queryNorm
        0.19316542 = fieldWeight in 5155, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5155)
    0.020439833 = weight(_text_:systems in 5155) [ClassicSimilarity], result of:
      0.020439833 = score(doc=5155,freq=2.0), product of:
        0.12039685 = queryWeight, product of:
          3.0731742 = idf(docFreq=5561, maxDocs=44218)
          0.03917671 = queryNorm
        0.1697705 = fieldWeight in 5155, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.0731742 = idf(docFreq=5561, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5155)
  0.22222222 = coord(2/9)

Abstract

Hinich and Molyneux review the literature of internet measurement and note three results consistently to be found in network traffic studies. These are "self-similarity," "long-range dependence," by which is meant that events in one time are correlated with events in a previous time and remain so through longer time periods than expected, and "heavy tails" by which they mean many small connections with low byte counts and a few long connections with large byte counts. The literature also suggests that conventional time series analysis is not helpful for network analysis. Using a single day's traffic at the Berkeley National Labs web server, cumulated TCP flows were collected, log transforms were used with the adding of .01 to all values allowing log transforms of the zero values, and providing a distribution that overcomes the heavy tail problem. However, Hinich's bicorrelation test for nonlinearity using overlapping moving windows found strong evidence of nonlinear structures. Time series analysis assumes linear systems theory and thus additivity and scalability. Spectral analysis should provide large peaks at the lowest frequencies if long range dependence is present since the power spectrum would go to infinity if the frequency goes to zero. This does not occur and so long range dependence must be questioned, at least until it is determined what effect other OSI layers may have on the TCP data.

Source

Journal of the American Society for Information Science and technology. 54(2003) no.2, S.161-168

0.0019958385 = product of:
  0.017962547 = sum of:
    0.017962547 = weight(_text_:of in 1047) [ClassicSimilarity], result of:
      0.017962547 = score(doc=1047,freq=4.0), product of:
        0.061262865 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.03917671 = queryNorm
        0.2932045 = fieldWeight in 1047, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.09375 = fieldNorm(doc=1047)
  0.11111111 = coord(1/9)

Footnote

Teil eines Themenheftes: OCLC and the Internet: An Historical Overview of Research Activities, 1990-1999 - Part II

Source

Journal of library administration. 34(2001) nos.3/4, S.229-236

0.0019958385 = product of:
  0.017962547 = sum of:
    0.017962547 = weight(_text_:of in 1051) [ClassicSimilarity], result of:
      0.017962547 = score(doc=1051,freq=4.0), product of:
        0.061262865 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.03917671 = queryNorm
        0.2932045 = fieldWeight in 1051, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.09375 = fieldNorm(doc=1051)
  0.11111111 = coord(1/9)

Footnote

Teil eines Themenheftes: OCLC and the Internet: An Historical Overview of Research Activities, 1990-1999 - Part II

Source

Journal of library administration. 34(2001) nos.3/4, S.265-278

0.0018922918 = product of:
  0.017030627 = sum of:
    0.017030627 = weight(_text_:software in 5729) [ClassicSimilarity], result of:
      0.017030627 = score(doc=5729,freq=2.0), product of:
        0.15541996 = queryWeight, product of:
          3.9671519 = idf(docFreq=2274, maxDocs=44218)
          0.03917671 = queryNorm
        0.10957812 = fieldWeight in 5729, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.9671519 = idf(docFreq=2274, maxDocs=44218)
          0.01953125 = fieldNorm(doc=5729)
  0.11111111 = coord(1/9)

Abstract

Der neue 128-Bit-Header treibt die Möglichkeiten ins Astronomische: 3,4 mal zehn hoch 38 Adressen, eine 3,4 mit 38 Nullen. -Das IPv6-Forum zerhackte den Zahlentrumm in anschauliche Stücke: Pro Quadratmillimeter Erdoberfläche stehen nun zirka 667 Billiarden, pro Mensch 6,5 mal zehn hoch 28 Adressen, bereit." Eine Billiarde bringt es immerhin auf respektable 15 Nullen. Schon kurz darauf ging ein Aufschrei durch die Netzgemeinde. Das neue Protokoll schrieb die weltweit eindeutigen Seriennummern bestimmter Netzwerkkarten auf den virtuellen Adressaufkleber. Die Ethernet-Adapter bewerkstelligen den Datentransport bei Computern, die über eine Standleitung, ein Koaxialkabel, dauernd online sind. Die Spur von Ethernet-Usern wäre damit leicht zu verfolgen gewesen, ihre Nutzerprofile, ihre Surfgewohnheiten einsehbar wie offene Bücher. Das Problem, ließ Icann nun wissen, sei behoben: Es gebe keine festen Kennzahlen mehr in den Adressköpfen. Bei jedem Hochfahren eines Rechners oder sogar noch öfter werden die Nummern neu durchgemischt", erläutert Hans Petter Dittler, stellvertretender Vorsitzender der deutschen Sektion der Internet Society. Das Betriebssystem Linux kann bereits mit dem IPv6 arbeiten. Microsoft will den Standard in das nächste Windows-Betriebssystem einbauen: "Wir denken, der vorgeschlagene Standard ist wichtig zum Schutz der Privatsphäre der Internet-Nutzer", sagt Jawad Khaki, Vizepräsident für Netzwerke. Seit einigen Tagen steht auf der Microsoft-Homepage eine Vorab-Version von lPv6 für Windows 2000 zum Herunterladen bereit. Geradezu euphorisch gibt sich Protokoll-Chef Vint Cerf. Mit IPv6 haben wir die Grundlage dafür", philosophierte der Internet-Daddy auf dem ersten lPv6-Kongress 1999 in Berlin, "das Internet von unserem Planeten über den Mars und die Asteroiden bis in den Weltraum hinaus auszudehnen." Doch im Internet-Alltag wird das alte Protokoll noch lange Vorrang haben. Grund sind handfeste Programmier-Probleme. Denn Software, die sich explizit auf die vierte IP-Version bezieht, muss umgeschrieben werden - etwa um mit den längeren Adressfeldern umgehen zu können. Hubert Martens vom Münchner Multinet Services befürchtet gar einen InternetCrash: "Das Jahr-2000-Problem war harmlos gegen das, was uns mit lPv6 droht."

0.0018595128 = product of:
  0.016735615 = sum of:
    0.016735615 = weight(_text_:of in 4898) [ClassicSimilarity], result of:
      0.016735615 = score(doc=4898,freq=20.0), product of:
        0.061262865 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.03917671 = queryNorm
        0.27317715 = fieldWeight in 4898, product of:
          4.472136 = tf(freq=20.0), with freq of:
            20.0 = termFreq=20.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4898)
  0.11111111 = coord(1/9)

Abstract

This article will examine the Z39.50 Information Retrieval protocol. It will look at some of the history of the protocol, its operation, and some of the major projects that have made use of it. There has been enough written (perhaps too much) about Z39.50 in the last several years so it is not intended to be a tutorial or detailed description of the protocol. The material that will be presented will try and put some context around the discussion. For those readers who are interested in delving into Z39.50 in a more technical manner, references to much of the material that has been written about it over the years will be provided at the end. Finally, the article will conclude with some thoughts on how technology and technological infrastructure have changed in the years since Z39.50 was initially developed and deployed, and where the protocol has so far lived up to its goals, and where it has perhaps failed to meet some of the high expectations that at least some people involved in the Z39.50 community held for it. The article will conclude with some of the author's speculations (and they are really no more than that) of what the future role of Z39.50 is likely to be.

0.0017640886 = product of:
  0.015876798 = sum of:
    0.015876798 = weight(_text_:of in 3813) [ClassicSimilarity], result of:
      0.015876798 = score(doc=3813,freq=18.0), product of:
        0.061262865 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.03917671 = queryNorm
        0.25915858 = fieldWeight in 3813, product of:
          4.2426405 = tf(freq=18.0), with freq of:
            18.0 = termFreq=18.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3813)
  0.11111111 = coord(1/9)

Abstract

Information retrieval (IR) protocols support effective and interoperable intersystem search and retrieval. Although intersystem search methods have been envisioned and under development since the 1970s, it was the Z39.50 IR protocol, first released in 1988, that demonstrated real-world possibilities for such search and retrieval. As the networked information environment changed with the emergence of the World Wide Web, the need for standard IR protocols did not disappear, and one can argue the need is even more compelling given both the visible and invisible Web. A new protocol, based on the experience from Z39.50 but simpler and more comprehensible than Z39.50, is now being used for Web search and retrieval. Search and retrieve via URL (SRU) uses Web technologies and standards resulting in a Web friendly protocol that provides standard search access to existing Z39.50 resources and a wide-range of new non-catalog digital resources. This entry provides both an overview of the two protocols and technical details to understand both. A brief discussion of IR and communications protocols provides background to the specifics of these two IR protocols. Although communication protocols are by their nature technical specifications, this entry focuses on an overview of the functions and capabilities of the protocols. It uses technical concepts and terminology from the protocols to help explain how the protocols work but limits discussion of technical details.

Source

Encyclopedia of library and information sciences. 3rd ed. Ed.: M.J. Bates