-
Schweibenz, W.; Thissen, F.: Qualität im Web : Benutzerfreundliche Webseiten durch Usability Evaluation (2003)
0.01
0.0077603008 = product of:
0.0155206015 = sum of:
0.0155206015 = product of:
0.031041203 = sum of:
0.031041203 = weight(_text_:22 in 767) [ClassicSimilarity], result of:
0.031041203 = score(doc=767,freq=2.0), product of:
0.16046064 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.045821942 = queryNorm
0.19345059 = fieldWeight in 767, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=767)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Date
- 22. 3.2008 14:24:08
-
Langville, A.N.; Meyer, C.D.: Google's PageRank and beyond : the science of search engine rankings (2006)
0.00
0.003314477 = product of:
0.006628954 = sum of:
0.006628954 = product of:
0.013257908 = sum of:
0.013257908 = weight(_text_:h in 6) [ClassicSimilarity], result of:
0.013257908 = score(doc=6,freq=4.0), product of:
0.113842286 = queryWeight, product of:
2.4844491 = idf(docFreq=10020, maxDocs=44218)
0.045821942 = queryNorm
0.11645855 = fieldWeight in 6, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
2.4844491 = idf(docFreq=10020, maxDocs=44218)
0.0234375 = fieldNorm(doc=6)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Content
- Inhalt: Chapter 1. Introduction to Web Search Engines: 1.1 A Short History of Information Retrieval - 1.2 An Overview of Traditional Information Retrieval - 1.3 Web Information Retrieval Chapter 2. Crawling, Indexing, and Query Processing: 2.1 Crawling - 2.2 The Content Index - 2.3 Query Processing Chapter 3. Ranking Webpages by Popularity: 3.1 The Scene in 1998 - 3.2 Two Theses - 3.3 Query-Independence Chapter 4. The Mathematics of Google's PageRank: 4.1 The Original Summation Formula for PageRank - 4.2 Matrix Representation of the Summation Equations - 4.3 Problems with the Iterative Process - 4.4 A Little Markov Chain Theory - 4.5 Early Adjustments to the Basic Model - 4.6 Computation of the PageRank Vector - 4.7 Theorem and Proof for Spectrum of the Google Matrix Chapter 5. Parameters in the PageRank Model: 5.1 The a Factor - 5.2 The Hyperlink Matrix H - 5.3 The Teleportation Matrix E Chapter 6. The Sensitivity of PageRank; 6.1 Sensitivity with respect to alpha - 6.2 Sensitivity with respect to H - 6.3 Sensitivity with respect to vT - 6.4 Other Analyses of Sensitivity - 6.5 Sensitivity Theorems and Proofs Chapter 7. The PageRank Problem as a Linear System: 7.1 Properties of (I - alphaS) - 7.2 Properties of (I - alphaH) - 7.3 Proof of the PageRank Sparse Linear System Chapter 8. Issues in Large-Scale Implementation of PageRank: 8.1 Storage Issues - 8.2 Convergence Criterion - 8.3 Accuracy - 8.4 Dangling Nodes - 8.5 Back Button Modeling
-
Net effects : how librarians can manage the unintended consequenees of the Internet (2003)
0.00
0.0015624594 = product of:
0.0031249188 = sum of:
0.0031249188 = product of:
0.0062498376 = sum of:
0.0062498376 = weight(_text_:h in 1796) [ClassicSimilarity], result of:
0.0062498376 = score(doc=1796,freq=2.0), product of:
0.113842286 = queryWeight, product of:
2.4844491 = idf(docFreq=10020, maxDocs=44218)
0.045821942 = queryNorm
0.05489909 = fieldWeight in 1796, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.4844491 = idf(docFreq=10020, maxDocs=44218)
0.015625 = fieldNorm(doc=1796)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Footnote
- Unlike muck of the professional library literature, Net Effects is not an open-aimed embrace of technology. Block even suggests that it is helpful to have a Luddite or two an each library staff to identify the setbacks associated with technological advances in the library. Each of the book's 10 chapters deals with one Internet-related problem, such as "Chapter 4-The Shifted Librarian: Adapting to the Changing Expectations of Our Wired (and Wireless) Users," or "Chapter 8-Up to Our Ears in Lawyers: Legal Issues Posed by the Net." For each of these 10 problems, multiple solutions are offered. For example, for "Chapter 9-Disappearing Data," four solutions are offered. These include "Link-checking," "Have a technological disaster plan," "Advise legislators an the impact proposed laws will have," and "Standards for preservation of digital information." One article is given to explicate each of these four solutions. A short bibliography of recommended further reading is also included for each chapter. Block provides a short introduction to each chapter, and she comments an many of the entries. Some of these comments seem to be intended to provide a research basis for the proposed solutions, but they tend to be vague generalizations without citations, such as, "We know from research that students would rather ask each other for help than go to adults. We can use that (p. 91 )." The original publication dates of the entries range from 1997 to 2002, with the bulk falling into the 2000-2002 range. At up to 6 years old, some of the articles seem outdated, such as a 2000 news brief announcing the creation of the first "customizable" public library Web site (www.brarydog.net). These critiques are not intended to dismiss the volume entirely. Some of the entries are likely to find receptive audiences, such as a nuts-and-bolts instructive article for making Web sites accessible to people with disabilities. "Providing Equitable Access," by Cheryl H. Kirkpatrick and Catherine Buck Morgan, offers very specific instructions, such as how to renovate OPAL workstations to suit users with "a wide range of functional impairments." It also includes a useful list of 15 things to do to make a Web site readable to most people with disabilities, such as, "You can use empty (alt) tags (alt="') for images that serve a purely decorative function. Screen readers will skip empty (alt) tags" (p. 157). Information at this level of specificity can be helpful to those who are faced with creating a technological solution for which they lack sufficient technical knowledge or training.
