Search (288 results, page 1 of 15)

  • × language_ss:"e"
  • × theme_ss:"Hypertext"
  1. Barbieri, G.: Relational back-ends in the management of large hypertexts (1991) 0.02 
    0.015221215 = product of:
  0.045663644 = sum of:
    0.012493922 = weight(_text_:in in 4457) [ClassicSimilarity], result of:
      0.012493922 = score(doc=4457,freq=2.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.21040362 = fieldWeight in 4457, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.109375 = fieldNorm(doc=4457)
    0.03316972 = weight(_text_:und in 4457) [ClassicSimilarity], result of:
      0.03316972 = score(doc=4457,freq=2.0), product of:
        0.09675359 = queryWeight, product of:
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.043654136 = queryNorm
        0.34282678 = fieldWeight in 4457, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.109375 = fieldNorm(doc=4457)
  0.33333334 = coord(2/6)
    Source
    Hypertext/Hypermedia'91: Tagung der GI, SI und OCG Graz, Mai 1991. Proceedings. Hrsg.: H. Maurer
  2. Barabási, A.-L.: Linked: The New Science of Networks (2002) 0.01 
    0.013634916 = product of:
  0.04090475 = sum of:
    0.009877314 = weight(_text_:in in 2015) [ClassicSimilarity], result of:
      0.009877314 = score(doc=2015,freq=20.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.16633868 = fieldWeight in 2015, product of:
          4.472136 = tf(freq=20.0), with freq of:
            20.0 = termFreq=20.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.02734375 = fieldNorm(doc=2015)
    0.031027434 = weight(_text_:und in 2015) [ClassicSimilarity], result of:
      0.031027434 = score(doc=2015,freq=28.0), product of:
        0.09675359 = queryWeight, product of:
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.043654136 = queryNorm
        0.3206851 = fieldWeight in 2015, product of:
          5.2915025 = tf(freq=28.0), with freq of:
            28.0 = termFreq=28.0
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.02734375 = fieldNorm(doc=2015)
  0.33333334 = coord(2/6)
    Footnote
    Rez. in: nfd 54(2003) H.8, S.497 (T. Mandl): "Gesetze der digitalen Anarchie - Hyperlinks im Internet entstehen als Ergebnis sozialer Prozesse und können auch als formaler Graph im Sinne der Mathematik interpretiert werden. Die Thematik Hyperlinks ist im Information Retrieval höchst aktuell, da Suchmaschinen die Link-Struktur bei der Berechnung ihrer Ergebnisse berücksichtigen. Algorithmen zur Bestimmung des "guten Rufs" einer Seite wie etwa PageRank von Google gewichten eine Seite höher, wenn viele links auf sie verweisen. Barabási erklärt dem Leser seines Buches darüber hinaus noch, wie es zu solchen Phänomenen kommt. Soziale Prozesse im Netz wirken so, dass bereits bekannte Seiten mit größerer Wahrscheinlichkeit auch wieder weitere Links oder neue Besucher anziehen. Barabási ist Physiker an der Notre-Dame University und ihm fehlt ebenso wie Huberman die informationswissenschaftliche Perspektive. Er fragt also kaum, wie kann das Wissen über Netzwerke zu Verbesserungen in Informationssystemen führen, die Benutzerbedürfnisse besser erfüllen. Gleichwohl lohnt sich die Lektüre auch für Informationswissenschaftler. Barabäsi stellt die aktuelle Forschung zur Netzwerkstruktur des Internets auf einfache Weise fast ohne Zugeständnisse an Aktualität und Komplexität dar. Wie Huberman verzichtet auch er weitgehend auf Formeln und andere Formalismen. Der in Ungarn geborene Barabási lässt darüber hinaus keine Anekdote aus, sei es über die Begründer der Graphen-Theorie, im peer-review abgelehnte Beiträge und persönliche Begegnungen mit anderen Forschern. Barabási beginnt mit einfachen Netzwerkstrukturen und schreitet didaktisch über internet-ähnliche Netzwerke weiter zu Anwendungen und praktischen Beispielen aus unterschiedlichsten Disziplinen. Er schafft mit seinem Buch "Linked" unter anderem Links zwischen der ungarischen Literatur, dem I-Love-You Computer-Virus, der Verbreitung von Aids, den Theorien Einsteins, den Aufsichtsräten der wichtigsten amerikanischen Firmen, dem Al-Qaeda-Netzwerk und der Struktur und der Funktion biologischer Zellen. Zu Beginn seines Buches berichtet Barabási von sogenannten kleinen Welten, in denen viele Objekte über wenige Verbindungen zusammenhängen. Ein Blick in den eigenen größeren Bekanntenkreis mag bestätigen, dass viele Menschen über wenige Schritte zwischen Bekannten erreichbar sind. Sowohl Barabäsi als auch Huberman gehen auf die Geschichte des ersten sozialwissenschaftlichen Experiments zu diesem Thema ein, das in den 1960er Jahren versuchte, die Anzahl von Schritten zwischen gemeinsamen Bekannten zu bestimmen, welche vom Mittleren Westen der USA an die Ostküste führt. Die genauere Struktur solcher Systeme, in denen manche Knoten weitaus mehr Beziehungen zu anderen eingehen als der Durchschnitt, führt hin zum Internet. Im Web lässt sich keineswegs immer ein Pfad zwischen zwei Knoten finden, wie noch vor wenigen Jahren vermutet wurde. Die durchschnittliche Entfernung war damals noch mit 19 Klicks berechnet worden. Vielmehr herrscht eine differenziertere Struktur, die Barabási vorstellt und in der zahlreiche Seiten in Sackgassen führen. Huberman wie Barabási diskutieren auch negative Aspekte des Internet. Während Huberman die Wartezeiten und Staus bei Downloads analysiert, bespricht Barabási die rasante Verbreitung von ComputerViren und weist auf die Grundlagen für diese Gefährdung hin. Das vorletzte Kapitel widmen übrigens beide Autoren den Märkten im Internet. Spätestens hier werden die wirtschaftlichen Aspekte von Netzwerken deutlich. Beide Titel führen den Leser in die neue Forschung zur Struktur des Internet als Netzwerk und sind leicht lesbar. Beides sind wissenschaftliche Bücher, wenden sich aber auch an den interessierten Laien. Das Buch von Barabási ist etwas aktueller, plauderhafter, länger, umfassender und etwas populärwissenschaftlicher."
  3. Welsch, L.A.: Multimedia and hypermedia : model and framework (1993) 0.01 
    0.012832299 = product of:
  0.038496897 = sum of:
    0.008924231 = weight(_text_:in in 2756) [ClassicSimilarity], result of:
      0.008924231 = score(doc=2756,freq=2.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.15028831 = fieldWeight in 2756, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.078125 = fieldNorm(doc=2756)
    0.029572664 = product of:
      0.059145328 = sum of:
        0.059145328 = weight(_text_:22 in 2756) [ClassicSimilarity], result of:
          0.059145328 = score(doc=2756,freq=2.0), product of:
            0.15286934 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.043654136 = queryNorm
            0.38690117 = fieldWeight in 2756, 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=2756)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)
    Footnote
    Part of a special issue featuring papers from the workshop on hypermedia and hypertext standards held in Amsterdam, Netherlands, 22-23 April 1993
  4. Papers from the workshop on hypermedia and hypertext standards held in Amsterdam, Netherlands, 22-23 April 1993 (1993) 0.01 
    0.011251582 = product of:
  0.033754744 = sum of:
    0.010096614 = weight(_text_:in in 6320) [ClassicSimilarity], result of:
      0.010096614 = score(doc=6320,freq=4.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.17003182 = fieldWeight in 6320, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0625 = fieldNorm(doc=6320)
    0.02365813 = product of:
      0.04731626 = sum of:
        0.04731626 = weight(_text_:22 in 6320) [ClassicSimilarity], result of:
          0.04731626 = score(doc=6320,freq=2.0), product of:
            0.15286934 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.043654136 = queryNorm
            0.30952093 = fieldWeight in 6320, 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=6320)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)
    Content
    Enthält u.a.: WELSCH, L.A.: Multimedia and hypermedia: model and framework. - BRYAN, M.: Standards for text and hypermedia processing. - POPHAM, M.G.: Use of SGML and HyTime in UK universities. - SCHELLER, A.: The Open Document Architecture (ODA) and its HyperODA extensions. - FROMONT, J.: State-of-the-art regarding the various standards for contents related to text, still images, sound and video. - BROEKMAN, H.J.D.: Effective communication with interactive media
  5. Dimitroff, A.; Wolfram, D.: Searcher response in a hypertext-based bibliographic information retrieval system (1995) 0.01 
    0.011251582 = product of:
  0.033754744 = sum of:
    0.010096614 = weight(_text_:in in 187) [ClassicSimilarity], result of:
      0.010096614 = score(doc=187,freq=4.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.17003182 = fieldWeight in 187, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0625 = fieldNorm(doc=187)
    0.02365813 = product of:
      0.04731626 = sum of:
        0.04731626 = weight(_text_:22 in 187) [ClassicSimilarity], result of:
          0.04731626 = score(doc=187,freq=2.0), product of:
            0.15286934 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.043654136 = queryNorm
            0.30952093 = fieldWeight in 187, 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=187)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)
    Abstract
    This article examines searcher behavior and affective response to a hypertext-based bibliographic information retrieval system called HyperLynx for searchers with different search skills and backgrounds. Search times and number of nodes visited were recorded for five specified search queries, and views of the system were recorded for each searcher. No significant differences were found in search times or user satisfaction with the system, indicating that a hypertext-based approach to bibliographic retrieval could be appropriate for a variety of searcher experience levels
    Source
    Journal of the American Society for Information Science. 46(1995) no.1, S.22-29
  6. Diaz, P.; Aedo, I.; Panetsos, F.: Labyrinth, an abstract model for hypermedia applications : Description of its static components (1997) 0.01 
    0.011251582 = product of:
  0.033754744 = sum of:
    0.010096614 = weight(_text_:in in 3318) [ClassicSimilarity], result of:
      0.010096614 = score(doc=3318,freq=4.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.17003182 = fieldWeight in 3318, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0625 = fieldNorm(doc=3318)
    0.02365813 = product of:
      0.04731626 = sum of:
        0.04731626 = weight(_text_:22 in 3318) [ClassicSimilarity], result of:
          0.04731626 = score(doc=3318,freq=2.0), product of:
            0.15286934 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.043654136 = queryNorm
            0.30952093 = fieldWeight in 3318, 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=3318)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)
    Abstract
    Analyzes an abstract model for hypermedia pplications. The model, Labyrinth, allows: the design of platform-independent hypermedia applications; the categorisation, generalisation and abstraction of unstructured heterogeneous information in multiple and interconnected levels, the creation of personalisations in multiuser hyperdocuments for both groups and individual users and the design of advanced security mechanisms for hypermedia applications
    Source
    Information systems. 22(1997) no.8, S.447-464
  7. Kim, S.H.; Eastman, C.M.: ¬An experiment on node size in a hypermedia system (1999) 0.01 
    0.01106493 = product of:
  0.033194788 = sum of:
    0.012493922 = weight(_text_:in in 3673) [ClassicSimilarity], result of:
      0.012493922 = score(doc=3673,freq=8.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.21040362 = fieldWeight in 3673, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3673)
    0.020700864 = product of:
      0.04140173 = sum of:
        0.04140173 = weight(_text_:22 in 3673) [ClassicSimilarity], result of:
          0.04140173 = score(doc=3673,freq=2.0), product of:
            0.15286934 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.043654136 = queryNorm
            0.2708308 = fieldWeight in 3673, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3673)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)
    Abstract
    The node size that should be used in a hypermedia system is an important design issue. 3 interpretations of node size are identified: storage (physical size), window size (presentation size), and length (logical size). an experiment in which presentation size and text length are varied in a HyperCard application is described. The experiment involves student subjects performing a fact retrieval task from a reference handbook. No interaction is found between these 2 independent variables. Performance is significantly better for the longer texts, but no significant difference is found for the 2 different window sizes
    Date
    22. 5.1999 9:35:20
  8. Schmolz, H.: Anaphora resolution and text retrieval : a lnguistic analysis of hypertexts (2013) 0.01 
    0.010872297 = product of:
  0.03261689 = sum of:
    0.008924231 = weight(_text_:in in 1810) [ClassicSimilarity], result of:
      0.008924231 = score(doc=1810,freq=2.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.15028831 = fieldWeight in 1810, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.078125 = fieldNorm(doc=1810)
    0.02369266 = weight(_text_:und in 1810) [ClassicSimilarity], result of:
      0.02369266 = score(doc=1810,freq=2.0), product of:
        0.09675359 = queryWeight, product of:
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.043654136 = queryNorm
        0.24487628 = fieldWeight in 1810, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.078125 = fieldNorm(doc=1810)
  0.33333334 = coord(2/6)
    Content
    Trägerin des VFI-Dissertationspreises 2014: "Überzeugende gründliche linguistische und quantitative Analyse eines im Information Retrieval bisher wenig beachteten Textelementes anhand eines eigens erstellten grossen Hypertextkorpus, einschliesslich der Evaluation selbsterstellter Auflösungsregeln für die Nutzung in künftigen IR-Systemen.".
  9. Baoming, Z.: Authoring a hypertext database : experiences with HyperPAD (1993) 0.01 
    0.010506973 = product of:
  0.031520918 = sum of:
    0.010820055 = weight(_text_:in in 2761) [ClassicSimilarity], result of:
      0.010820055 = score(doc=2761,freq=6.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.1822149 = fieldWeight in 2761, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2761)
    0.020700864 = product of:
      0.04140173 = sum of:
        0.04140173 = weight(_text_:22 in 2761) [ClassicSimilarity], result of:
          0.04140173 = score(doc=2761,freq=2.0), product of:
            0.15286934 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.043654136 = queryNorm
            0.2708308 = fieldWeight in 2761, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2761)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)
    Abstract
    In a hypertext database, the information is presented as a network of nodes connected by links. Such nodes may be text, graphics, audio, video, and even other software. Although hypertext provides a new approach to information management, it also leaves a whole new set of problems for the designers of the hypertext database to solve. As the volume of information grows, the task of authoring a hypertext database becomes much more complex. In this article, the author presents the experiences during the development of a hypertext version of the user's guide for information services on JANET, in the UK, by using HyperPAD, a hypertext shell for the IBM PC. It may be the first step to explore the proper way to solve those problems which come together with the increasing application of hypertext
    Source
    Aslib proceedings. 45(1993) no.1, S.19-22
  10. Rada, R.: Hypertext and paper : a special synergy (1991) 0.01 
    0.010265838 = product of:
  0.030797515 = sum of:
    0.0071393843 = weight(_text_:in in 4915) [ClassicSimilarity], result of:
      0.0071393843 = score(doc=4915,freq=2.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.120230645 = fieldWeight in 4915, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0625 = fieldNorm(doc=4915)
    0.02365813 = product of:
      0.04731626 = sum of:
        0.04731626 = weight(_text_:22 in 4915) [ClassicSimilarity], result of:
          0.04731626 = score(doc=4915,freq=2.0), product of:
            0.15286934 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.043654136 = queryNorm
            0.30952093 = fieldWeight in 4915, 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=4915)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)
    Abstract
    Some people argure that hypertext is easy to write, is hard to create by converting existing text into hypertext, and has a massive market. This paper argures the contrary. First, Hypertext is hard to write. Second, automatically converting a text into hypertext is, to a first approximation, easy. Third, successful marketing of hypertext depends on having a large volume of material that is also available in paper form
    Source
    International journal of information management. 11(1991) no.1, S.14-22
  11. Gabbard, R.: Recent literature shows accelerated growth in hypermedia tools : an annotated bibliography (1994) 0.01 
    0.010265838 = product of:
  0.030797515 = sum of:
    0.0071393843 = weight(_text_:in in 8460) [ClassicSimilarity], result of:
      0.0071393843 = score(doc=8460,freq=2.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.120230645 = fieldWeight in 8460, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0625 = fieldNorm(doc=8460)
    0.02365813 = product of:
      0.04731626 = sum of:
        0.04731626 = weight(_text_:22 in 8460) [ClassicSimilarity], result of:
          0.04731626 = score(doc=8460,freq=2.0), product of:
            0.15286934 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.043654136 = queryNorm
            0.30952093 = fieldWeight in 8460, 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=8460)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)
    Source
    Reference services review. 22(1994) no.2, S.31-40
  12. Smith, L.C.: "Wholly new forms of encyclopedias" : electronic knowledge in the form of hypertext (1989) 0.01 
    0.010265838 = product of:
  0.030797515 = sum of:
    0.0071393843 = weight(_text_:in in 3558) [ClassicSimilarity], result of:
      0.0071393843 = score(doc=3558,freq=2.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.120230645 = fieldWeight in 3558, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0625 = fieldNorm(doc=3558)
    0.02365813 = product of:
      0.04731626 = sum of:
        0.04731626 = weight(_text_:22 in 3558) [ClassicSimilarity], result of:
          0.04731626 = score(doc=3558,freq=2.0), product of:
            0.15286934 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.043654136 = queryNorm
            0.30952093 = fieldWeight in 3558, 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=3558)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)
    Date
    7. 1.1996 22:47:52
  13. Milosavljevic, M.; Oberlander, J.: Dynamic catalogues on the WWW (1998) 0.01 
    0.010265838 = product of:
  0.030797515 = sum of:
    0.0071393843 = weight(_text_:in in 3594) [ClassicSimilarity], result of:
      0.0071393843 = score(doc=3594,freq=2.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.120230645 = fieldWeight in 3594, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0625 = fieldNorm(doc=3594)
    0.02365813 = product of:
      0.04731626 = sum of:
        0.04731626 = weight(_text_:22 in 3594) [ClassicSimilarity], result of:
          0.04731626 = score(doc=3594,freq=2.0), product of:
            0.15286934 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.043654136 = queryNorm
            0.30952093 = fieldWeight in 3594, 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=3594)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)
    Abstract
    Natural language generation techniques can be used to dynamically produce hypertext dynamic catalogues on the Web, resulting in DYNAMIC HYPERTEXT. A dynamic hypertext document can be tailored more precisely to a particular user's needs and background, thus helping the user to search more effectively. Describes the automatic generation of WWW documents and illustrates with 2 implemented systems
    Date
    1. 8.1996 22:08:06
  14. Capps, M.; Ladd, B.; Stotts, D.: Enhanced graph models in the Web : multi-client, multi-head, multi-tail browsing (1996) 0.01 
    0.009845134 = product of:
  0.029535402 = sum of:
    0.008834538 = weight(_text_:in in 5860) [ClassicSimilarity], result of:
      0.008834538 = score(doc=5860,freq=4.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.14877784 = fieldWeight in 5860, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5860)
    0.020700864 = product of:
      0.04140173 = sum of:
        0.04140173 = weight(_text_:22 in 5860) [ClassicSimilarity], result of:
          0.04140173 = score(doc=5860,freq=2.0), product of:
            0.15286934 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.043654136 = queryNorm
            0.2708308 = fieldWeight in 5860, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0546875 = fieldNorm(doc=5860)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)
    Abstract
    Richer graph models permit authors to 'program' the browsing behaviour they want WWW readers to see by turning the hypertext into a hyperprogram with specific semantics. Multiple browsing streams can be started under the author's control and then kept in step through the synchronization mechanisms provided by the graph model. Adds a Semantic Web Graph Layer (SWGL) which allows dynamic interpretation of link and node structures according to graph models. Details the SWGL and its architecture, some sample protocol implementations, and the latest extensions to MHTML
    Date
    1. 8.1996 22:08:06
  15. Pollard, R.: Hypertext presentation of thesauri used in on-line searching (1990) 0.01 
    0.009683581 = product of:
  0.029050741 = sum of:
    0.010096614 = weight(_text_:in in 4892) [ClassicSimilarity], result of:
      0.010096614 = score(doc=4892,freq=4.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.17003182 = fieldWeight in 4892, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0625 = fieldNorm(doc=4892)
    0.018954126 = weight(_text_:und in 4892) [ClassicSimilarity], result of:
      0.018954126 = score(doc=4892,freq=2.0), product of:
        0.09675359 = queryWeight, product of:
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.043654136 = queryNorm
        0.19590102 = fieldWeight in 4892, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.0625 = fieldNorm(doc=4892)
  0.33333334 = coord(2/6)
    Abstract
    Explores the strengths and limitations of hypertext for the online presentation of thesauri used in information retrieval. Examines the ability of hypertext to support each of 3 common types of thesaurus display: graphic, alphabetical, and hierarchical. Presents a design for a hypertext-based hierarchical display that addresses many inadequacies of printed hierarchical displays. Ullustrates how the design might be implemented using a commercially available hypertext system. Considers issues related to the implementation and evaluation of hypertext-based thesauri
    Theme
    Konzeption und Anwendung des Prinzips Thesaurus
  16. Westland, J.C.: Some conditions for cost efficiency in hypermedia (1998) 0.01 
    0.009484224 = product of:
  0.028452672 = sum of:
    0.010709076 = weight(_text_:in in 3292) [ClassicSimilarity], result of:
      0.010709076 = score(doc=3292,freq=8.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.18034597 = fieldWeight in 3292, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.046875 = fieldNorm(doc=3292)
    0.017743597 = product of:
      0.035487194 = sum of:
        0.035487194 = weight(_text_:22 in 3292) [ClassicSimilarity], result of:
          0.035487194 = score(doc=3292,freq=2.0), product of:
            0.15286934 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.043654136 = queryNorm
            0.23214069 = fieldWeight in 3292, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046875 = fieldNorm(doc=3292)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)
    Abstract
    Models administrative and operating costs surrounding a hypermedia database and determines 7 conditions for the cost justification of hypermedia; higher linking costs proportionately reduce the total number of links implemented; increasing the benefits from using the database increases the total number of links proportionately; increasing database size results in an increase in the total number of links implemented; if the database user learns from the database slowly, then a larger number of links need to be provided: the maximum size of databases which is justified on cost will increase as the average cost of linking each node becomes smaller; the total benefit from usage required in order to cost justify a database will decrease as the average cost of linking each node becomes smaller and the maximum size of database which is cost justified will increase rapidly as the learning rate increases. The learning rate can be increased by construction of links and nodes so that they are maximally informative
    Date
    7. 3.1999 14:22:45
  17. Lima, G.A.B. de Oliveira: Conceptual modeling of hypertexts : methodological proposal for the management of semantic content in digital libraries (2012) 0.01 
    0.0091104945 = product of:
  0.027331483 = sum of:
    0.013115887 = weight(_text_:in in 451) [ClassicSimilarity], result of:
      0.013115887 = score(doc=451,freq=12.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.22087781 = fieldWeight in 451, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.046875 = fieldNorm(doc=451)
    0.014215595 = weight(_text_:und in 451) [ClassicSimilarity], result of:
      0.014215595 = score(doc=451,freq=2.0), product of:
        0.09675359 = queryWeight, product of:
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.043654136 = queryNorm
        0.14692576 = fieldWeight in 451, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.046875 = fieldNorm(doc=451)
  0.33333334 = coord(2/6)
    Abstract
    This research is focused on the continuation of the Hypertext Map prototype implementation - MHTX, proposed by Lima, (2004), with the general objective of transforming the MHTX into a semantic content management product facilitating navigation in context supported by customizable software that is easy to use, through high end desktop/web interfaces that sustain the operation of its functions. Besides, these studies aim, in the long run, to achieve the simplification of the information organization, access and recovery processes in digital libraries, making archive management by authors, content managers and information professionals possible.
    Content
    Vgl.: https://www.researchgate.net/publication/357066754_Conceptual_Modeling_of_Hypertexts_Methodological_Proposal_for_the_Management_of_Semantic_Content_in_Digital_Libraries und DOI: 10.5771/9783956504402-96.
    Series
    Advances in knowledge organization; vol.13
    Source
    Categories, contexts and relations in knowledge organization: Proceedings of the Twelfth International ISKO Conference 6-9 August 2012, Mysore, India. Eds.: Neelameghan, A. u. K.S. Raghavan
  18. Falquet, G.; Guyot, J.; Nerima, L.: Languages and tools to specify hypertext views on databases (1999) 0.01 
    0.009005977 = product of:
  0.027017929 = sum of:
    0.009274333 = weight(_text_:in in 3968) [ClassicSimilarity], result of:
      0.009274333 = score(doc=3968,freq=6.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.1561842 = fieldWeight in 3968, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.046875 = fieldNorm(doc=3968)
    0.017743597 = product of:
      0.035487194 = sum of:
        0.035487194 = weight(_text_:22 in 3968) [ClassicSimilarity], result of:
          0.035487194 = score(doc=3968,freq=2.0), product of:
            0.15286934 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.043654136 = queryNorm
            0.23214069 = fieldWeight in 3968, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046875 = fieldNorm(doc=3968)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)
    Abstract
    We present a declarative language for the construction of hypertext views on databases. The language is based on an object-oriented data model and a simple hypertext model with reference and inclusion links. A hypertext view specification consists in a collection of parameterized node schemes which specify how to construct node and links instances from the database contents. We show how this language can express different issues in hypertext view design. These include: the direct mapping of objects to nodes; the construction of complex nodes based on sets of objects; the representation of polymorphic sets of objects; and the representation of tree and graph structures. We have defined sublanguages corresponding to particular database models (relational, semantic, object-oriented) and implemented tools to generate Web views for these database models
    Date
    21.10.2000 15:01:22
    Series
    Lecture notes in computer science; vol.1590
  19. Pollard, R.: ¬A hypertext-based thesaurus as a subject browsing aid for bibliographic databases (1993) 0.01 
    0.008473134 = product of:
  0.0254194 = sum of:
    0.008834538 = weight(_text_:in in 5096) [ClassicSimilarity], result of:
      0.008834538 = score(doc=5096,freq=4.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.14877784 = fieldWeight in 5096, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5096)
    0.01658486 = weight(_text_:und in 5096) [ClassicSimilarity], result of:
      0.01658486 = score(doc=5096,freq=2.0), product of:
        0.09675359 = queryWeight, product of:
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.043654136 = queryNorm
        0.17141339 = fieldWeight in 5096, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5096)
  0.33333334 = coord(2/6)
    Abstract
    Part of a special issue on hypertext and information retrieval. Conventional information retrieval systems provide little support for browsing. Browsing is the major method of searching in hypertext system but users can become disoriented even when browsing small information space. If hypertext is to be used to support browsing in bibliographic databases navigational assistance will be required. Examines the role of thesauri as navigational aids for subject domains of Bibliographic databases. Presents the design of an experimental hypertext-based browsing inference for a thesaurus and its implementation using a commercially available hypertext program. Examines strategies for linking the thesaurus to a database
    Theme
    Konzeption und Anwendung des Prinzips Thesaurus
  20. Baião Salgado Silva, G.; Lima, G.Â. Borém de Oliveira: Using topic maps in establishing compatibility of semantically structured hypertext contents (2012) 0.01 
    0.008254642 = product of:
  0.024763925 = sum of:
    0.009977593 = weight(_text_:in in 633) [ClassicSimilarity], result of:
      0.009977593 = score(doc=633,freq=10.0), product of:
        0.059380736 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.043654136 = queryNorm
        0.16802745 = fieldWeight in 633, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0390625 = fieldNorm(doc=633)
    0.014786332 = product of:
      0.029572664 = sum of:
        0.029572664 = weight(_text_:22 in 633) [ClassicSimilarity], result of:
          0.029572664 = score(doc=633,freq=2.0), product of:
            0.15286934 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.043654136 = queryNorm
            0.19345059 = fieldWeight in 633, 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=633)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)
    Abstract
    Considering the characteristics of hypertext systems and problems such as cognitive overload and the disorientation of users, this project studies subject hypertext documents that have undergone conceptual structuring using facets for content representation and improvement of information retrieval during navigation. The main objective was to assess the possibility of the application of topic map technology for automating the compatibilization process of these structures. For this purpose, two dissertations from the UFMG Information Science Post-Graduation Program were adopted as samples. Both dissertations had been duly analyzed and structured on the MHTX (Hypertextual Map) prototype database. The faceted structures of both dissertations, which had been represented in conceptual maps, were then converted into topic maps. It was then possible to use the merge property of the topic maps to promote the semantic interrelationship between the maps and, consequently, between the hypertextual information resources proper. The merge results were then analyzed in the light of theories dealing with the compatibilization of languages developed within the realm of information technology and librarianship from the 1960s on. The main goals accomplished were: (a) the detailed conceptualization of the merge process of the topic maps, considering the possible compatibilization levels and the applicability of this technology in the integration of faceted structures; and (b) the production of a detailed sequence of steps that may be used in the implementation of topic maps based on faceted structures.
    Date
    22. 2.2013 11:39:23

Authors

Years

Types

  • a 255
  • m 13
  • s 12
  • r 5
  • d 3
  • b 1
  • x 1
  • More… Less…

Themes

Subjects

Classifications