Search (204 results, page 1 of 11)

  • × type_ss:"el"
  1. Landry, P.: MACS: multilingual access to subject and link management : Extending the Multilingual Capacity of TEL in the EDL Project (2007) 0.09
    0.091436766 = product of:
      0.22859192 = sum of:
        0.15964633 = weight(_text_:link in 1287) [ClassicSimilarity], result of:
          0.15964633 = score(doc=1287,freq=2.0), product of:
            0.2711644 = queryWeight, product of:
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.05088753 = queryNorm
            0.58874375 = fieldWeight in 1287, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.078125 = fieldNorm(doc=1287)
        0.06894558 = weight(_text_:22 in 1287) [ClassicSimilarity], result of:
          0.06894558 = score(doc=1287,freq=2.0), product of:
            0.17819946 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05088753 = queryNorm
            0.38690117 = fieldWeight in 1287, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.078125 = fieldNorm(doc=1287)
      0.4 = coord(2/5)
    
    Content
    Vortrag anlässlich des Workshops: "Extending the multilingual capacity of The European Library in the EDL project Stockholm, Swedish National Library, 22-23 November 2007".
  2. Kleineberg, M.: Context analysis and context indexing : formal pragmatics in knowledge organization (2014) 0.08
    0.080822885 = product of:
      0.40411443 = sum of:
        0.40411443 = weight(_text_:3a in 1826) [ClassicSimilarity], result of:
          0.40411443 = score(doc=1826,freq=2.0), product of:
            0.43142503 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.05088753 = queryNorm
            0.93669677 = fieldWeight in 1826, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.078125 = fieldNorm(doc=1826)
      0.2 = coord(1/5)
    
    Source
    http://www.google.de/url?sa=t&rct=j&q=&esrc=s&source=web&cd=5&ved=0CDQQFjAE&url=http%3A%2F%2Fdigbib.ubka.uni-karlsruhe.de%2Fvolltexte%2Fdocuments%2F3131107&ei=HzFWVYvGMsiNsgGTyoFI&usg=AFQjCNE2FHUeR9oQTQlNC4TPedv4Mo3DaQ&sig2=Rlzpr7a3BLZZkqZCXXN_IA&bvm=bv.93564037,d.bGg&cad=rja
  3. Baeza-Yates, R.; Boldi, P.; Castillo, C.: Generalizing PageRank : damping functions for linkbased ranking algorithms (2006) 0.08
    0.07764765 = product of:
      0.19411913 = sum of:
        0.15964633 = weight(_text_:link in 2565) [ClassicSimilarity], result of:
          0.15964633 = score(doc=2565,freq=8.0), product of:
            0.2711644 = queryWeight, product of:
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.05088753 = queryNorm
            0.58874375 = fieldWeight in 2565, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2565)
        0.03447279 = weight(_text_:22 in 2565) [ClassicSimilarity], result of:
          0.03447279 = score(doc=2565,freq=2.0), product of:
            0.17819946 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05088753 = queryNorm
            0.19345059 = fieldWeight in 2565, 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=2565)
      0.4 = coord(2/5)
    
    Abstract
    This paper introduces a family of link-based ranking algorithms that propagate page importance through links. In these algorithms there is a damping function that decreases with distance, so a direct link implies more endorsement than a link through a long path. PageRank is the most widely known ranking function of this family. The main objective of this paper is to determine whether this family of ranking techniques has some interest per se, and how different choices for the damping function impact on rank quality and on convergence speed. Even though our results suggest that PageRank can be approximated with other simpler forms of rankings that may be computed more efficiently, our focus is of more speculative nature, in that it aims at separating the kernel of PageRank, that is, link-based importance propagation, from the way propagation decays over paths. We focus on three damping functions, having linear, exponential, and hyperbolic decay on the lengths of the paths. The exponential decay corresponds to PageRank, and the other functions are new. Our presentation includes algorithms, analysis, comparisons and experiments that study their behavior under different parameters in real Web graph data. Among other results, we show how to calculate a linear approximation that induces a page ordering that is almost identical to PageRank's using a fixed small number of iterations; comparisons were performed using Kendall's tau on large domain datasets.
    Date
    16. 1.2016 10:22:28
  4. Wesch, M.: Web 2.0 ... The Machine is Us/ing Us (2006) 0.07
    0.073149405 = product of:
      0.18287352 = sum of:
        0.12771706 = weight(_text_:link in 3478) [ClassicSimilarity], result of:
          0.12771706 = score(doc=3478,freq=2.0), product of:
            0.2711644 = queryWeight, product of:
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.05088753 = queryNorm
            0.47099498 = fieldWeight in 3478, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.0625 = fieldNorm(doc=3478)
        0.055156462 = weight(_text_:22 in 3478) [ClassicSimilarity], result of:
          0.055156462 = score(doc=3478,freq=2.0), product of:
            0.17819946 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05088753 = queryNorm
            0.30952093 = fieldWeight in 3478, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0625 = fieldNorm(doc=3478)
      0.4 = coord(2/5)
    
    Content
    Final version now available! http://youtube.com/watch?v=NLlGopyXT_g http://mediatedcultures.net A higher quality version is available for download here: http://www.mediafire.com/?6duzg3zioyd. Please note that this is the second draft and the final version will not be available until late February after I review all comments and revise the video. Please return for a new download link at that time.
    Date
    5. 1.2008 19:22:48
  5. Popper, K.R.: Three worlds : the Tanner lecture on human values. Deliverd at the University of Michigan, April 7, 1978 (1978) 0.06
    0.06465831 = product of:
      0.32329154 = sum of:
        0.32329154 = weight(_text_:3a in 230) [ClassicSimilarity], result of:
          0.32329154 = score(doc=230,freq=2.0), product of:
            0.43142503 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.05088753 = 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.2 = coord(1/5)
    
    Source
    https%3A%2F%2Ftannerlectures.utah.edu%2F_documents%2Fa-to-z%2Fp%2Fpopper80.pdf&usg=AOvVaw3f4QRTEH-OEBmoYr2J_c7H
  6. Pro-Cite 2.0 for the IBM and Biblio-Link to USMARC comunications format records (1993) 0.05
    0.054185767 = product of:
      0.27092883 = sum of:
        0.27092883 = weight(_text_:link in 5618) [ClassicSimilarity], result of:
          0.27092883 = score(doc=5618,freq=4.0), product of:
            0.2711644 = queryWeight, product of:
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.05088753 = queryNorm
            0.99913126 = fieldWeight in 5618, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.09375 = fieldNorm(doc=5618)
      0.2 = coord(1/5)
    
    Object
    Biblio-Link
  7. Bradford, R.B.: Relationship discovery in large text collections using Latent Semantic Indexing (2006) 0.05
    0.047155138 = product of:
      0.11788784 = sum of:
        0.090309605 = weight(_text_:link in 1163) [ClassicSimilarity], result of:
          0.090309605 = score(doc=1163,freq=4.0), product of:
            0.2711644 = queryWeight, product of:
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.05088753 = queryNorm
            0.33304375 = fieldWeight in 1163, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.03125 = fieldNorm(doc=1163)
        0.027578231 = weight(_text_:22 in 1163) [ClassicSimilarity], result of:
          0.027578231 = score(doc=1163,freq=2.0), product of:
            0.17819946 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05088753 = queryNorm
            0.15476047 = fieldWeight in 1163, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03125 = fieldNorm(doc=1163)
      0.4 = coord(2/5)
    
    Source
    Proceedings of the Fourth Workshop on Link Analysis, Counterterrorism, and Security, SIAM Data Mining Conference, Bethesda, MD, 20-22 April, 2006. [http://www.siam.org/meetings/sdm06/workproceed/Link%20Analysis/15.pdf]
  8. Boldi, P.; Santini, M.; Vigna, S.: PageRank as a function of the damping factor (2005) 0.05
    0.045718383 = product of:
      0.11429596 = sum of:
        0.079823166 = weight(_text_:link in 2564) [ClassicSimilarity], result of:
          0.079823166 = score(doc=2564,freq=2.0), product of:
            0.2711644 = queryWeight, product of:
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.05088753 = queryNorm
            0.29437187 = fieldWeight in 2564, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2564)
        0.03447279 = weight(_text_:22 in 2564) [ClassicSimilarity], result of:
          0.03447279 = score(doc=2564,freq=2.0), product of:
            0.17819946 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05088753 = queryNorm
            0.19345059 = fieldWeight in 2564, 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=2564)
      0.4 = coord(2/5)
    
    Abstract
    PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor alpha that spreads uniformly part of the rank. The choice of alpha is eminently empirical, and in most cases the original suggestion alpha=0.85 by Brin and Page is still used. Recently, however, the behaviour of PageRank with respect to changes in alpha was discovered to be useful in link-spam detection. Moreover, an analytical justification of the value chosen for alpha is still missing. In this paper, we give the first mathematical analysis of PageRank when alpha changes. In particular, we show that, contrarily to popular belief, for real-world graphs values of alpha close to 1 do not give a more meaningful ranking. Then, we give closed-form formulae for PageRank derivatives of any order, and an extension of the Power Method that approximates them with convergence O(t**k*alpha**t) for the k-th derivative. Finally, we show a tight connection between iterated computation and analytical behaviour by proving that the k-th iteration of the Power Method gives exactly the PageRank value obtained using a Maclaurin polynomial of degree k. The latter result paves the way towards the application of analytical methods to the study of PageRank.
    Date
    16. 1.2016 10:22:28
  9. Borchers, D.: Missing Link : Wenn der Kasten denkt - Niklas Luhmann und die Folgen (2017) 0.05
    0.045154806 = product of:
      0.22577402 = sum of:
        0.22577402 = weight(_text_:link in 2358) [ClassicSimilarity], result of:
          0.22577402 = score(doc=2358,freq=4.0), product of:
            0.2711644 = queryWeight, product of:
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.05088753 = queryNorm
            0.8326094 = fieldWeight in 2358, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.078125 = fieldNorm(doc=2358)
      0.2 = coord(1/5)
    
    Source
    https://www.heise.de/newsticker/meldung/Missing-Link-Wenn-der-Kasten-denkt-Niklas-Luhmann-und-die-Folgen-3919843.html
  10. Shala, E.: ¬Die Autonomie des Menschen und der Maschine : gegenwärtige Definitionen von Autonomie zwischen philosophischem Hintergrund und technologischer Umsetzbarkeit (2014) 0.04
    0.040411443 = product of:
      0.20205721 = sum of:
        0.20205721 = weight(_text_:3a in 4388) [ClassicSimilarity], result of:
          0.20205721 = score(doc=4388,freq=2.0), product of:
            0.43142503 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.05088753 = queryNorm
            0.46834838 = fieldWeight in 4388, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4388)
      0.2 = coord(1/5)
    
    Footnote
    Vgl. unter: https://www.google.de/url?sa=t&rct=j&q=&esrc=s&source=web&cd=2&cad=rja&uact=8&ved=2ahUKEwizweHljdbcAhVS16QKHXcFD9QQFjABegQICRAB&url=https%3A%2F%2Fwww.researchgate.net%2Fpublication%2F271200105_Die_Autonomie_des_Menschen_und_der_Maschine_-_gegenwartige_Definitionen_von_Autonomie_zwischen_philosophischem_Hintergrund_und_technologischer_Umsetzbarkeit_Redigierte_Version_der_Magisterarbeit_Karls&usg=AOvVaw06orrdJmFF2xbCCp_hL26q.
  11. Dietz, K.: en.wikipedia.org > 6 Mio. Artikel (2020) 0.04
    0.040411443 = product of:
      0.20205721 = sum of:
        0.20205721 = weight(_text_:3a in 5669) [ClassicSimilarity], result of:
          0.20205721 = score(doc=5669,freq=2.0), product of:
            0.43142503 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.05088753 = queryNorm
            0.46834838 = fieldWeight in 5669, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5669)
      0.2 = coord(1/5)
    
    Content
    "Die Englischsprachige Wikipedia verfügt jetzt über mehr als 6 Millionen Artikel. An zweiter Stelle kommt die deutschsprachige Wikipedia mit 2.3 Millionen Artikeln, an dritter Stelle steht die französischsprachige Wikipedia mit 2.1 Millionen Artikeln (via Researchbuzz: Firehose <https://rbfirehose.com/2020/01/24/techcrunch-wikipedia-now-has-more-than-6-million-articles-in-english/> und Techcrunch <https://techcrunch.com/2020/01/23/wikipedia-english-six-million-articles/?utm_source=feedburner&utm_medium=feed&utm_campaign=Feed%3A+Techcrunch+%28TechCrunch%29&guccounter=1&guce_referrer=aHR0cHM6Ly9yYmZpcmVob3NlLmNvbS8yMDIwLzAxLzI0L3RlY2hjcnVuY2gtd2lraXBlZGlhLW5vdy1oYXMtbW9yZS10aGFuLTYtbWlsbGlvbi1hcnRpY2xlcy1pbi1lbmdsaXNoLw&guce_referrer_sig=AQAAAK0zHfjdDZ_spFZBF_z-zDjtL5iWvuKDumFTzm4HvQzkUfE2pLXQzGS6FGB_y-VISdMEsUSvkNsg2U_NWQ4lwWSvOo3jvXo1I3GtgHpP8exukVxYAnn5mJspqX50VHIWFADHhs5AerkRn3hMRtf_R3F1qmEbo8EROZXp328HMC-o>). 250120 via digithek ch = #fineBlog s.a.: Angesichts der Veröffentlichung des 6-millionsten Artikels vergangene Woche in der englischsprachigen Wikipedia hat die Community-Zeitungsseite "Wikipedia Signpost" ein Moratorium bei der Veröffentlichung von Unternehmensartikeln gefordert. Das sei kein Vorwurf gegen die Wikimedia Foundation, aber die derzeitigen Maßnahmen, um die Enzyklopädie gegen missbräuchliches undeklariertes Paid Editing zu schützen, funktionierten ganz klar nicht. *"Da die ehrenamtlichen Autoren derzeit von Werbung in Gestalt von Wikipedia-Artikeln überwältigt werden, und da die WMF nicht in der Lage zu sein scheint, dem irgendetwas entgegenzusetzen, wäre der einzige gangbare Weg für die Autoren, fürs erste die Neuanlage von Artikeln über Unternehmen zu untersagen"*, schreibt der Benutzer Smallbones in seinem Editorial <https://en.wikipedia.org/wiki/Wikipedia:Wikipedia_Signpost/2020-01-27/From_the_editor> zur heutigen Ausgabe."
  12. Hickey, T.: Matching names in parallel (2006) 0.04
    0.03831512 = product of:
      0.1915756 = sum of:
        0.1915756 = weight(_text_:link in 21) [ClassicSimilarity], result of:
          0.1915756 = score(doc=21,freq=2.0), product of:
            0.2711644 = queryWeight, product of:
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.05088753 = queryNorm
            0.7064925 = fieldWeight in 21, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.09375 = fieldNorm(doc=21)
      0.2 = coord(1/5)
    
    Abstract
    Link national authority records - Build on their authority work - Move towards universal bibliographic control
  13. Gillitzer, B.: Yewno (2017) 0.04
    0.036574703 = product of:
      0.09143676 = sum of:
        0.06385853 = weight(_text_:link in 3447) [ClassicSimilarity], result of:
          0.06385853 = score(doc=3447,freq=2.0), product of:
            0.2711644 = queryWeight, product of:
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.05088753 = queryNorm
            0.23549749 = fieldWeight in 3447, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.03125 = fieldNorm(doc=3447)
        0.027578231 = weight(_text_:22 in 3447) [ClassicSimilarity], result of:
          0.027578231 = score(doc=3447,freq=2.0), product of:
            0.17819946 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05088753 = queryNorm
            0.15476047 = fieldWeight in 3447, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03125 = fieldNorm(doc=3447)
      0.4 = coord(2/5)
    
    Abstract
    "Die Bayerische Staatsbibliothek testet den semantischen "Discovery Service" Yewno als zusätzliche thematische Suchmaschine für digitale Volltexte. Der Service ist unter folgendem Link erreichbar: https://www.bsb-muenchen.de/recherche-und-service/suchen-und-finden/yewno/. Das Identifizieren von Themen, um die es in einem Text geht, basiert bei Yewno alleine auf Methoden der künstlichen Intelligenz und des maschinellen Lernens. Dabei werden sie nicht - wie bei klassischen Katalogsystemen - einem Text als Ganzem zugeordnet, sondern der jeweiligen Textstelle. Die Eingabe eines Suchwortes bzw. Themas, bei Yewno "Konzept" genannt, führt umgehend zu einer grafischen Darstellung eines semantischen Netzwerks relevanter Konzepte und ihrer inhaltlichen Zusammenhänge. So ist ein Navigieren über thematische Beziehungen bis hin zu den Fundstellen im Text möglich, die dann in sogenannten Snippets angezeigt werden. In der Test-Anwendung der Bayerischen Staatsbibliothek durchsucht Yewno aktuell 40 Millionen englischsprachige Dokumente aus Publikationen namhafter Wissenschaftsverlage wie Cambridge University Press, Oxford University Press, Wiley, Sage und Springer, sowie Dokumente, die im Open Access verfügbar sind. Nach der dreimonatigen Testphase werden zunächst die Rückmeldungen der Nutzer ausgewertet. Ob und wann dann der Schritt von der klassischen Suchmaschine zum semantischen "Discovery Service" kommt und welche Bedeutung Anwendungen wie Yewno in diesem Zusammenhang einnehmen werden, ist heute noch nicht abzusehen. Die Software Yewno wurde vom gleichnamigen Startup in Zusammenarbeit mit der Stanford University entwickelt, mit der auch die Bayerische Staatsbibliothek eng kooperiert. [Inetbib-Posting vom 22.02.2017].
    Date
    22. 2.2017 10:16:49
  14. Somers, J.: Torching the modern-day library of Alexandria : somewhere at Google there is a database containing 25 million books and nobody is allowed to read them. (2017) 0.04
    0.036574703 = product of:
      0.09143676 = sum of:
        0.06385853 = weight(_text_:link in 3608) [ClassicSimilarity], result of:
          0.06385853 = score(doc=3608,freq=2.0), product of:
            0.2711644 = queryWeight, product of:
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.05088753 = queryNorm
            0.23549749 = fieldWeight in 3608, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.03125 = fieldNorm(doc=3608)
        0.027578231 = weight(_text_:22 in 3608) [ClassicSimilarity], result of:
          0.027578231 = score(doc=3608,freq=2.0), product of:
            0.17819946 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05088753 = queryNorm
            0.15476047 = fieldWeight in 3608, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03125 = fieldNorm(doc=3608)
      0.4 = coord(2/5)
    
    Abstract
    You were going to get one-click access to the full text of nearly every book that's ever been published. Books still in print you'd have to pay for, but everything else-a collection slated to grow larger than the holdings at the Library of Congress, Harvard, the University of Michigan, at any of the great national libraries of Europe-would have been available for free at terminals that were going to be placed in every local library that wanted one. At the terminal you were going to be able to search tens of millions of books and read every page of any book you found. You'd be able to highlight passages and make annotations and share them; for the first time, you'd be able to pinpoint an idea somewhere inside the vastness of the printed record, and send somebody straight to it with a link. Books would become as instantly available, searchable, copy-pasteable-as alive in the digital world-as web pages. It was to be the realization of a long-held dream. "The universal library has been talked about for millennia," Richard Ovenden, the head of Oxford's Bodleian Libraries, has said. "It was possible to think in the Renaissance that you might be able to amass the whole of published knowledge in a single room or a single institution." In the spring of 2011, it seemed we'd amassed it in a terminal small enough to fit on a desk. "This is a watershed event and can serve as a catalyst for the reinvention of education, research, and intellectual life," one eager observer wrote at the time. On March 22 of that year, however, the legal agreement that would have unlocked a century's worth of books and peppered the country with access terminals to a universal library was rejected under Rule 23(e)(2) of the Federal Rules of Civil Procedure by the U.S. District Court for the Southern District of New York. When the library at Alexandria burned it was said to be an "international catastrophe." When the most significant humanities project of our time was dismantled in court, the scholars, archivists, and librarians who'd had a hand in its undoing breathed a sigh of relief, for they believed, at the time, that they had narrowly averted disaster.
  15. EndNote Plus 2.3 : Enhanced reference database and bibliography maker. With EndLink 2.1, link to on-line and CD-ROM databases (1997) 0.03
    0.031929266 = product of:
      0.15964633 = sum of:
        0.15964633 = weight(_text_:link in 1717) [ClassicSimilarity], result of:
          0.15964633 = score(doc=1717,freq=2.0), product of:
            0.2711644 = queryWeight, product of:
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.05088753 = queryNorm
            0.58874375 = fieldWeight in 1717, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.078125 = fieldNorm(doc=1717)
      0.2 = coord(1/5)
    
  16. Young, J.A.; Hickey, T.B.: WikiD: an OpenURL 1.0 application (2006) 0.03
    0.03160836 = product of:
      0.1580418 = sum of:
        0.1580418 = weight(_text_:link in 3065) [ClassicSimilarity], result of:
          0.1580418 = score(doc=3065,freq=4.0), product of:
            0.2711644 = queryWeight, product of:
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.05088753 = queryNorm
            0.58282655 = fieldWeight in 3065, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3065)
      0.2 = coord(1/5)
    
    Abstract
    OpenURL was originally developed to enable link resolution of citation information in a distributed interoperable way. The initial standard (version 0.1) has been effectively subsumed as an application (named the San Antonio Level 1 profile) of a much more general framework called OpenURL 1.0. We used the framework to create WikiD (Wiki/Data), an application that has little to do with citation link resolvers, but is instead a set of general purpose services for managing arbitrary collections of items. The model for this application is a wiki engine generalized to manage multiple collections of XML records. This article describes WikiD and how it can serve as an example for applications that can be built on the foundation of the OpenURL framework.
  17. Krempl, S.: Missing Link : wie KI das menschliche Handlungsvermögen untergräbt (2020) 0.03
    0.03160836 = product of:
      0.1580418 = sum of:
        0.1580418 = weight(_text_:link in 5062) [ClassicSimilarity], result of:
          0.1580418 = score(doc=5062,freq=4.0), product of:
            0.2711644 = queryWeight, product of:
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.05088753 = queryNorm
            0.58282655 = fieldWeight in 5062, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.0546875 = fieldNorm(doc=5062)
      0.2 = coord(1/5)
    
    Source
    https://www.heise.de/news/Missing-Link-Wie-KI-das-menschliche-Handlungsvermoegen-untergraebt-4726359.html?view=print
  18. Halpin, H.; Hayes, P.J.: When owl:sameAs isn't the same : an analysis of identity links on the Semantic Web (2010) 0.03
    0.027092883 = product of:
      0.13546441 = sum of:
        0.13546441 = weight(_text_:link in 4834) [ClassicSimilarity], result of:
          0.13546441 = score(doc=4834,freq=4.0), product of:
            0.2711644 = queryWeight, product of:
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.05088753 = queryNorm
            0.49956563 = fieldWeight in 4834, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.046875 = fieldNorm(doc=4834)
      0.2 = coord(1/5)
    
    Abstract
    In Linked Data, the use of owl:sameAs is ubiquitous in 'inter-linking' data-sets. However, there is a lurking suspicion within the Linked Data community that this use of owl:sameAs may be somehow incorrect, in particular with regards to its interactions with inference. In fact, owl:sameAs can be considered just one type of 'identity link', a link that declares two items to be identical in some fashion. After reviewing the definitions and history of the problem of identity in philosophy and knowledge representation, we outline four alternative readings of owl:sameAs, showing with examples how it is being (ab)used on the Web of data. Then we present possible solutions to this problem by introducing alternative identity links that rely on named graphs.
  19. Hofmann, M.: TREC Konferenzbericht (7.10.93) (1995) 0.03
    0.025543412 = product of:
      0.12771706 = sum of:
        0.12771706 = weight(_text_:link in 5005) [ClassicSimilarity], result of:
          0.12771706 = score(doc=5005,freq=2.0), product of:
            0.2711644 = queryWeight, product of:
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.05088753 = queryNorm
            0.47099498 = fieldWeight in 5005, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.0625 = fieldNorm(doc=5005)
      0.2 = coord(1/5)
    
    Source
    http://www.inf-wiss.uni-konstanz.de/IW/HT-Link/assfalg:15:Feb:95:4:44:26pm.html
  20. Resource Description Framework (RDF) : Concepts and Abstract Syntax (2004) 0.03
    0.025543412 = product of:
      0.12771706 = sum of:
        0.12771706 = weight(_text_:link in 3067) [ClassicSimilarity], result of:
          0.12771706 = score(doc=3067,freq=2.0), product of:
            0.2711644 = queryWeight, product of:
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.05088753 = queryNorm
            0.47099498 = fieldWeight in 3067, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.3287 = idf(docFreq=582, maxDocs=44218)
              0.0625 = fieldNorm(doc=3067)
      0.2 = coord(1/5)
    
    Abstract
    The Resource Description Framework (RDF) is a framework for representing information in the Web. RDF Concepts and Abstract Syntax defines an abstract syntax on which RDF is based, and which serves to link its concrete syntax to its formal semantics. It also includes discussion of design goals, key concepts, datatyping, character normalization and handling of URI references.

Years

Languages

  • d 100
  • e 96
  • el 2
  • a 1
  • i 1
  • nl 1
  • More… Less…

Types

  • a 88
  • i 10
  • m 6
  • r 3
  • s 3
  • b 2
  • n 2
  • x 2
  • More… Less…