Search (78 results, page 1 of 4)

  • × theme_ss:"Hypertext"
  1. Sinno-Rony, S.: ¬Les hypercatalogues : nouvelles perspectives pour le OPAC (1991) 0.05
    0.047161747 = product of:
      0.16506611 = sum of:
        0.03364573 = weight(_text_:classification in 6601) [ClassicSimilarity], result of:
          0.03364573 = score(doc=6601,freq=2.0), product of:
            0.09562149 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03002521 = queryNorm
            0.35186368 = fieldWeight in 6601, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.078125 = fieldNorm(doc=6601)
        0.0474976 = product of:
          0.0949952 = sum of:
            0.0949952 = weight(_text_:schemes in 6601) [ClassicSimilarity], result of:
              0.0949952 = score(doc=6601,freq=2.0), product of:
                0.16067243 = queryWeight, product of:
                  5.3512506 = idf(docFreq=569, maxDocs=44218)
                  0.03002521 = queryNorm
                0.5912352 = fieldWeight in 6601, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  5.3512506 = idf(docFreq=569, maxDocs=44218)
                  0.078125 = fieldNorm(doc=6601)
          0.5 = coord(1/2)
        0.05027704 = weight(_text_:bibliographic in 6601) [ClassicSimilarity], result of:
          0.05027704 = score(doc=6601,freq=2.0), product of:
            0.11688946 = queryWeight, product of:
              3.893044 = idf(docFreq=2449, maxDocs=44218)
              0.03002521 = queryNorm
            0.43012467 = fieldWeight in 6601, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.893044 = idf(docFreq=2449, maxDocs=44218)
              0.078125 = fieldNorm(doc=6601)
        0.03364573 = weight(_text_:classification in 6601) [ClassicSimilarity], result of:
          0.03364573 = score(doc=6601,freq=2.0), product of:
            0.09562149 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03002521 = queryNorm
            0.35186368 = fieldWeight in 6601, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.078125 = fieldNorm(doc=6601)
      0.2857143 = coord(4/14)
    
    Abstract
    Presents a state of the art review of the application oh hypertext searching techniques to online catalogues. The technique improves traditional online catalogues: when consulting the catalogue in a non linear way; and when browsing bibliographic information. New research could improve access to larger databases including thesauri and classification schemes
  2. Urr, C.: Will the real hypertext please stand up? (1991) 0.02
    0.019678125 = product of:
      0.09183125 = sum of:
        0.026916584 = weight(_text_:classification in 4798) [ClassicSimilarity], result of:
          0.026916584 = score(doc=4798,freq=2.0), product of:
            0.09562149 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03002521 = queryNorm
            0.28149095 = fieldWeight in 4798, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0625 = fieldNorm(doc=4798)
        0.03799808 = product of:
          0.07599616 = sum of:
            0.07599616 = weight(_text_:schemes in 4798) [ClassicSimilarity], result of:
              0.07599616 = score(doc=4798,freq=2.0), product of:
                0.16067243 = queryWeight, product of:
                  5.3512506 = idf(docFreq=569, maxDocs=44218)
                  0.03002521 = queryNorm
                0.4729882 = fieldWeight in 4798, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  5.3512506 = idf(docFreq=569, maxDocs=44218)
                  0.0625 = fieldNorm(doc=4798)
          0.5 = coord(1/2)
        0.026916584 = weight(_text_:classification in 4798) [ClassicSimilarity], result of:
          0.026916584 = score(doc=4798,freq=2.0), product of:
            0.09562149 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03002521 = queryNorm
            0.28149095 = fieldWeight in 4798, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0625 = fieldNorm(doc=4798)
      0.21428572 = coord(3/14)
    
    Abstract
    The term hypertext has broadened to the extent that it is almost meaningless. In essence hypertext is a means of rapidly accessing knowledge indepent of the user's abilities to access the knowledge. Librarians need to be wary of ineffective 'imitation' hypertext systems which lack a coherent linking system on which the user's ability to access knowledge depends. An analogy with library catalogues shows that hypertext systems lack access value in direct proportion to their lack of carefully developed schemes of classification. In a well constructed hypertext system access is rendered easy by a developed structure and the user requires little training in them
  3. Philips, R.: HyperLib : a hypertext interface to a library information system (1995) 0.02
    0.018810362 = product of:
      0.08778169 = sum of:
        0.033948522 = weight(_text_:subject in 2372) [ClassicSimilarity], result of:
          0.033948522 = score(doc=2372,freq=2.0), product of:
            0.10738805 = queryWeight, product of:
              3.576596 = idf(docFreq=3361, maxDocs=44218)
              0.03002521 = queryNorm
            0.31612942 = fieldWeight in 2372, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.576596 = idf(docFreq=3361, maxDocs=44218)
              0.0625 = fieldNorm(doc=2372)
        0.026916584 = weight(_text_:classification in 2372) [ClassicSimilarity], result of:
          0.026916584 = score(doc=2372,freq=2.0), product of:
            0.09562149 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03002521 = queryNorm
            0.28149095 = fieldWeight in 2372, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0625 = fieldNorm(doc=2372)
        0.026916584 = weight(_text_:classification in 2372) [ClassicSimilarity], result of:
          0.026916584 = score(doc=2372,freq=2.0), product of:
            0.09562149 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03002521 = queryNorm
            0.28149095 = fieldWeight in 2372, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0625 = fieldNorm(doc=2372)
      0.21428572 = coord(3/14)
    
    Abstract
    Outlines the progress of HyperLib, research which began in 1993 to develop a hypertext interface to the online catalogue and other databases at the University of Antwerp. A human factors oriented design methodology was adopted. A user survey was carried out. The project has focused on development of electronic guides and manual and interfaces to access an academic bibliography database and the UDC subject classification scheme. Evaluation is being carried out in 1995
  4. Pollard, A.: ¬A hypertext-based thesaurus as subject browsing aid for bibliographic databases (1993) 0.02
    0.01854254 = product of:
      0.12979777 = sum of:
        0.059409913 = weight(_text_:subject in 4713) [ClassicSimilarity], result of:
          0.059409913 = score(doc=4713,freq=2.0), product of:
            0.10738805 = queryWeight, product of:
              3.576596 = idf(docFreq=3361, maxDocs=44218)
              0.03002521 = queryNorm
            0.5532265 = fieldWeight in 4713, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.576596 = idf(docFreq=3361, maxDocs=44218)
              0.109375 = fieldNorm(doc=4713)
        0.070387855 = weight(_text_:bibliographic in 4713) [ClassicSimilarity], result of:
          0.070387855 = score(doc=4713,freq=2.0), product of:
            0.11688946 = queryWeight, product of:
              3.893044 = idf(docFreq=2449, maxDocs=44218)
              0.03002521 = queryNorm
            0.6021745 = fieldWeight in 4713, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.893044 = idf(docFreq=2449, maxDocs=44218)
              0.109375 = fieldNorm(doc=4713)
      0.14285715 = coord(2/14)
    
  5. Pollard, R.: ¬A hypertext-based thesaurus as a subject browsing aid for bibliographic databases (1993) 0.01
    0.014709548 = product of:
      0.10296683 = sum of:
        0.042009152 = weight(_text_:subject in 5096) [ClassicSimilarity], result of:
          0.042009152 = score(doc=5096,freq=4.0), product of:
            0.10738805 = queryWeight, product of:
              3.576596 = idf(docFreq=3361, maxDocs=44218)
              0.03002521 = queryNorm
            0.3911902 = fieldWeight in 5096, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.576596 = idf(docFreq=3361, maxDocs=44218)
              0.0546875 = fieldNorm(doc=5096)
        0.060957674 = weight(_text_:bibliographic in 5096) [ClassicSimilarity], result of:
          0.060957674 = score(doc=5096,freq=6.0), product of:
            0.11688946 = queryWeight, product of:
              3.893044 = idf(docFreq=2449, maxDocs=44218)
              0.03002521 = queryNorm
            0.52149844 = fieldWeight in 5096, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.893044 = idf(docFreq=2449, maxDocs=44218)
              0.0546875 = fieldNorm(doc=5096)
      0.14285715 = coord(2/14)
    
    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
  6. Duncan, E.B.: ¬A concept-map thesaurus as a knowledge-based hypertext interface to a bibliographic database (1990) 0.01
    0.012596626 = product of:
      0.058784254 = sum of:
        0.016822865 = weight(_text_:classification in 2481) [ClassicSimilarity], result of:
          0.016822865 = score(doc=2481,freq=2.0), product of:
            0.09562149 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03002521 = queryNorm
            0.17593184 = fieldWeight in 2481, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2481)
        0.02513852 = weight(_text_:bibliographic in 2481) [ClassicSimilarity], result of:
          0.02513852 = score(doc=2481,freq=2.0), product of:
            0.11688946 = queryWeight, product of:
              3.893044 = idf(docFreq=2449, maxDocs=44218)
              0.03002521 = queryNorm
            0.21506234 = fieldWeight in 2481, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.893044 = idf(docFreq=2449, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2481)
        0.016822865 = weight(_text_:classification in 2481) [ClassicSimilarity], result of:
          0.016822865 = score(doc=2481,freq=2.0), product of:
            0.09562149 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03002521 = queryNorm
            0.17593184 = fieldWeight in 2481, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2481)
      0.21428572 = coord(3/14)
    
    Abstract
    Three pre-web articles about using hypertext for knowledge representation. Duncan discusses how to use graphical, hypertext displays (she used Xerox PARC's NoteCards on a Xerox 1186 workstation) along with concept maps and facet analysis, a combination that would now be done with topic maps. The screen shots of her graphical displays are quite interesting. Her interest in facets is in how to use them to show things to different people in different ways, for example, so that experts can enter knowledge into a system in one way while novices can see it in another. Duncan found that facet labels (e.g. Process and Product) prompted the expert to think of related concepts when inputting data, and made navigation easier for users. Facets can be joined together, e.g. "Agents (causing) Process," leading to a "reasoning system." She is especially interested in how to show relstionships between two things: e.g., A causes B, A uses B, A occurs in B. This is an important question in facet theory, but probably not worth worrying about in a small online classification where the relations are fixed and obvious. These articles may be difficult to find, in which case the reader can find a nice sumary in the next article, by Ellis and Vasconcelos (2000). Anyone interested in tracing the history of facets and hypertext will, however, want to see the originals.
  7. Baron, L.; Tague-Sutcliffe, J.; Kinnucan, M.T.: Labeled, typed links as cues when reading hypertext documents (1996) 0.01
    0.012551095 = product of:
      0.05857178 = sum of:
        0.016822865 = weight(_text_:classification in 6503) [ClassicSimilarity], result of:
          0.016822865 = score(doc=6503,freq=2.0), product of:
            0.09562149 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03002521 = queryNorm
            0.17593184 = fieldWeight in 6503, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0390625 = fieldNorm(doc=6503)
        0.016822865 = weight(_text_:classification in 6503) [ClassicSimilarity], result of:
          0.016822865 = score(doc=6503,freq=2.0), product of:
            0.09562149 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03002521 = queryNorm
            0.17593184 = fieldWeight in 6503, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0390625 = fieldNorm(doc=6503)
        0.024926046 = product of:
          0.04985209 = sum of:
            0.04985209 = weight(_text_:texts in 6503) [ClassicSimilarity], result of:
              0.04985209 = score(doc=6503,freq=2.0), product of:
                0.16460659 = queryWeight, product of:
                  5.4822793 = idf(docFreq=499, maxDocs=44218)
                  0.03002521 = queryNorm
                0.302856 = fieldWeight in 6503, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  5.4822793 = idf(docFreq=499, maxDocs=44218)
                  0.0390625 = fieldNorm(doc=6503)
          0.5 = coord(1/2)
      0.21428572 = coord(3/14)
    
    Abstract
    This article examines the classification of link types within hypertext databases. Do labeled links act as cues, enabling understanding of the structure and leading to more informed navigational choices? Although there is anecdotal evidence that indicating link types to readers is useful in hypertext systems, there is little experimental data to support this position. This study tries to provide an experimental basis for the development of lables identifying link types. It addresses whether labeling the different types of links affects hypertext searching by providing or enhancing a structure for readers of nonlinear texts. An experiment was run to determine which of the following 3 conditions serve users with better cues and lead to increased performance in both browsing and querying scenarios: 1) providing only organizational links; 2) adding unlabeled semantic, rhetorical, and pragmatic links in addition to the organizational links; and 3) adding labeled semantic, rhetorical, and pragmatic links to the organizational links. The experiment used a between subjects design where subjects were library science students. SuperBook was used as the hypertext platform and the OCLC Cataloguing Users' Guide was used as the hypertext document. The statistical results indicate that there was no significant difference between the three conditions in the browsing task. However, subjects who had labeled content-based links performed significantly better on the querying task
  8. Dimitroff, A.; Wolfram, D.: Searcher response in a hypertext-based bibliographic information retrieval system (1995) 0.01
    0.012276846 = product of:
      0.08593792 = sum of:
        0.06966591 = weight(_text_:bibliographic in 187) [ClassicSimilarity], result of:
          0.06966591 = score(doc=187,freq=6.0), product of:
            0.11688946 = queryWeight, product of:
              3.893044 = idf(docFreq=2449, maxDocs=44218)
              0.03002521 = queryNorm
            0.5959982 = fieldWeight in 187, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.893044 = idf(docFreq=2449, maxDocs=44218)
              0.0625 = fieldNorm(doc=187)
        0.016272005 = product of:
          0.03254401 = sum of:
            0.03254401 = weight(_text_:22 in 187) [ClassicSimilarity], result of:
              0.03254401 = score(doc=187,freq=2.0), product of:
                0.10514317 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.03002521 = 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.14285715 = coord(2/14)
    
    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
  9. Aboud, M.; Chrisment, C.; Razouk, R.; Sedes, F.; Soule-Dupuy, C.: Querying a hypertext information retrieval system by the use of classification (1993) 0.01
    0.009990192 = product of:
      0.06993134 = sum of:
        0.03496567 = weight(_text_:classification in 6530) [ClassicSimilarity], result of:
          0.03496567 = score(doc=6530,freq=6.0), product of:
            0.09562149 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03002521 = queryNorm
            0.3656675 = fieldWeight in 6530, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.046875 = fieldNorm(doc=6530)
        0.03496567 = weight(_text_:classification in 6530) [ClassicSimilarity], result of:
          0.03496567 = score(doc=6530,freq=6.0), product of:
            0.09562149 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03002521 = queryNorm
            0.3656675 = fieldWeight in 6530, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.046875 = fieldNorm(doc=6530)
      0.14285715 = coord(2/14)
    
    Abstract
    We present in this paper a navigation approach using a combination of functionalities encountered in classification processes, Hypertext Systems and Information Retrieval Systems. its originality lies in the cooperation of these mechanisms to restrict the consultation universe, to locate faster the searched information, and to tackle the problem of disorientation when consulting the restricted Hypergraph of retrieved information. A first version of the SYRIUS system has been developed integrating both Hypertext and Information Retrieval functionalities that we have called Hypertext Information Retrieval System (H.I.R.S.). This version has been extended using classification mechanisms. The graphic interface of this new system version is presented here. Querying the system is done through common visual representation of the database Hypergraph. The visualization of the Hypergraph can be parameterized focusing on several levels (classes, links,...)
  10. Rada, R.: Medical knowledge and hypermedia (1992) 0.01
    0.009613066 = product of:
      0.06729146 = sum of:
        0.03364573 = weight(_text_:classification in 4280) [ClassicSimilarity], result of:
          0.03364573 = score(doc=4280,freq=2.0), product of:
            0.09562149 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03002521 = queryNorm
            0.35186368 = fieldWeight in 4280, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.078125 = fieldNorm(doc=4280)
        0.03364573 = weight(_text_:classification in 4280) [ClassicSimilarity], result of:
          0.03364573 = score(doc=4280,freq=2.0), product of:
            0.09562149 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03002521 = queryNorm
            0.35186368 = fieldWeight in 4280, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.078125 = fieldNorm(doc=4280)
      0.14285715 = coord(2/14)
    
    Source
    International classification. 19(1992) no.4, S.192
  11. Sharples, M.; Goodley, J.: ¬A comparison of algorithms for hypertext notes network linearization (1994) 0.01
    0.007910378 = product of:
      0.055372648 = sum of:
        0.02546139 = weight(_text_:subject in 8635) [ClassicSimilarity], result of:
          0.02546139 = score(doc=8635,freq=2.0), product of:
            0.10738805 = queryWeight, product of:
              3.576596 = idf(docFreq=3361, maxDocs=44218)
              0.03002521 = queryNorm
            0.23709705 = fieldWeight in 8635, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.576596 = idf(docFreq=3361, maxDocs=44218)
              0.046875 = fieldNorm(doc=8635)
        0.029911257 = product of:
          0.059822515 = sum of:
            0.059822515 = weight(_text_:texts in 8635) [ClassicSimilarity], result of:
              0.059822515 = score(doc=8635,freq=2.0), product of:
                0.16460659 = queryWeight, product of:
                  5.4822793 = idf(docFreq=499, maxDocs=44218)
                  0.03002521 = queryNorm
                0.36342722 = fieldWeight in 8635, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  5.4822793 = idf(docFreq=499, maxDocs=44218)
                  0.046875 = fieldNorm(doc=8635)
          0.5 = coord(1/2)
      0.14285715 = coord(2/14)
    
    Abstract
    A new computer-based writing environment is being developed which combines a hypertext 'ideas organizer' with a text editor. Compares 2 algortihms which could be used in such environments for turning networks of notes indicating ideas into linear draft documents. The algorithms are designed to produce a linear ordering of the notes which is acceptable to the writer as a first draft of the document. Reports on experiments to test their effectiveness. Subject were asked to create notes networks which were then linearized by the 2 algorithms. The resulting linearization created by hand, were assessed for textual organization. The experiments indicate that both algorithms produce linearizations which are acceptable as draft texts, that the best first algortihm is marginally superior to the hill climbing one, and that providing information to the algorithms about link types had little effect on their effectiveness. Concludes by describing an implementation of the best first algorithm as part of the Writer's Assistant writing environment
  12. Bogaschewsky, R.: Hypertext-/Hypermedia-Systeme : ein Überblick (1992) 0.01
    0.007690453 = product of:
      0.053833168 = sum of:
        0.026916584 = weight(_text_:classification in 3051) [ClassicSimilarity], result of:
          0.026916584 = score(doc=3051,freq=2.0), product of:
            0.09562149 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03002521 = queryNorm
            0.28149095 = fieldWeight in 3051, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0625 = fieldNorm(doc=3051)
        0.026916584 = weight(_text_:classification in 3051) [ClassicSimilarity], result of:
          0.026916584 = score(doc=3051,freq=2.0), product of:
            0.09562149 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03002521 = queryNorm
            0.28149095 = fieldWeight in 3051, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0625 = fieldNorm(doc=3051)
      0.14285715 = coord(2/14)
    
    Abstract
    Survey on hypertext-/hypermedia-systems and applications. Important parts of hypertext systems are shown. Selected systems and developments are presented with their essential characteristics in a frame of a rough classification. Some problems associated with the implementation of hypertext-systems are addressed. Finally it is attempted to sketch the possible future of hypertext/hypermedia. New application possibilities are seen especially in the integration of hypertext and knowledge-based systems, or in utilizing hypertext-systems for knowledge acquisition which are perhaps looked at as expert systems
  13. Rada, R.: Focus on links : a holistic view of hypertext (1991) 0.01
    0.007690453 = product of:
      0.053833168 = sum of:
        0.026916584 = weight(_text_:classification in 5227) [ClassicSimilarity], result of:
          0.026916584 = score(doc=5227,freq=2.0), product of:
            0.09562149 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03002521 = queryNorm
            0.28149095 = fieldWeight in 5227, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0625 = fieldNorm(doc=5227)
        0.026916584 = weight(_text_:classification in 5227) [ClassicSimilarity], result of:
          0.026916584 = score(doc=5227,freq=2.0), product of:
            0.09562149 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03002521 = queryNorm
            0.28149095 = fieldWeight in 5227, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0625 = fieldNorm(doc=5227)
      0.14285715 = coord(2/14)
    
    Source
    International classification. 18(1991) no.1, S.13-18
  14. Rada, R.: Hypertext writing and document reuse : the role of a semantic net (1990.) 0.01
    0.007690453 = product of:
      0.053833168 = sum of:
        0.026916584 = weight(_text_:classification in 5911) [ClassicSimilarity], result of:
          0.026916584 = score(doc=5911,freq=2.0), product of:
            0.09562149 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03002521 = queryNorm
            0.28149095 = fieldWeight in 5911, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0625 = fieldNorm(doc=5911)
        0.026916584 = weight(_text_:classification in 5911) [ClassicSimilarity], result of:
          0.026916584 = score(doc=5911,freq=2.0), product of:
            0.09562149 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03002521 = queryNorm
            0.28149095 = fieldWeight in 5911, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0625 = fieldNorm(doc=5911)
      0.14285715 = coord(2/14)
    
    Abstract
    When document components are classified and then recombined during document re-use, a semantic net may serve as the classification language. A theory of analogical inheritance, applied to this semantic net, guides the reorganisation of document components. Authors index paragraphs from various sources with node-link-node triples from a semantic net and then use programs to transverse the semantic net and generate various outlines. The program examines node and link names in deciding which path to take. Describes how these techniques helped in the re-use: parts of an existing book to write a new one
  15. Carmel, E.; Crawford, S.; Chen, H.: Browsing in hypertext : a cognitive study (1992) 0.01
    0.0075150942 = product of:
      0.05260566 = sum of:
        0.042435654 = weight(_text_:subject in 7469) [ClassicSimilarity], result of:
          0.042435654 = score(doc=7469,freq=8.0), product of:
            0.10738805 = queryWeight, product of:
              3.576596 = idf(docFreq=3361, maxDocs=44218)
              0.03002521 = queryNorm
            0.39516178 = fieldWeight in 7469, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.576596 = idf(docFreq=3361, maxDocs=44218)
              0.0390625 = fieldNorm(doc=7469)
        0.010170003 = product of:
          0.020340007 = sum of:
            0.020340007 = weight(_text_:22 in 7469) [ClassicSimilarity], result of:
              0.020340007 = score(doc=7469,freq=2.0), product of:
                0.10514317 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.03002521 = queryNorm
                0.19345059 = fieldWeight in 7469, 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=7469)
          0.5 = coord(1/2)
      0.14285715 = coord(2/14)
    
    Abstract
    With the growth of hypertext and multimedia applications that support and encourage browsing it is time to take a penetrating look at browsing behaviour. Several dimensions of browsing are exemined, to find out: first, what is browsing and what cognitive processes are associated with it: second, is there a browsing strategy, and if so, are there any differences between how subject-area experts and novices browse; and finally, how can this knowledge be applied to improve the design of hypertext systems. Two groups of students, subject-area experts and novices, were studied while browsing a Macintosh HyperCard application on the subject The Vietnam War. A protocol analysis technique was used to gather and analyze data. Components of the GOMS model were used to describe the goals, operators, methods, and selection rules observed: Three browsing strategies were identified: (1) search-oriented browse, scanning and and reviewing information relevant to a fixed task; (2) review-browse, scanning and reviewing intersting information in the presence of transient browse goals that represent changing tasks, and (3) scan-browse, scanning for interesting information (without review). Most subjects primarily used review-browse interspersed with search-oriented browse. Within this strategy, comparisons between subject-area experts and novices revealed differences in tactics: experts browsed in more depth, seldom used referential links, selected different kinds of topics, and viewed information differently thatn did novices. Based on these findings, suggestions are made to hypertext developers
    Source
    IEEE transactions on systems, man and cybernetics. 22(1992) no.5, S.865-884
  16. Krajewski, M.: Paper machines : about cards & catalogs, 1548-1929 (2011) 0.01
    0.0072947694 = product of:
      0.10212677 = sum of:
        0.10212677 = weight(_text_:henry in 735) [ClassicSimilarity], result of:
          0.10212677 = score(doc=735,freq=2.0), product of:
            0.23560001 = queryWeight, product of:
              7.84674 = idf(docFreq=46, maxDocs=44218)
              0.03002521 = queryNorm
            0.43347523 = fieldWeight in 735, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              7.84674 = idf(docFreq=46, maxDocs=44218)
              0.0390625 = fieldNorm(doc=735)
      0.071428575 = coord(1/14)
    
    Abstract
    "Krajewski draws on recent German media theory and on a rich array of European and American sources in this thought-provoking account of the index card as a tool of information management. In investigating the road from the slips of paper of the 16th century to the data processing of the 20th, Krajewski highlights its twists and turns--failures and unintended consequences, reinventions, and surprising transfers."--Ann M. Blair, Henry Charles Lea Professor of History, Harvard University, and author of Too Much to Know: Managing Scholarly Information before the Modern Age -- Ann Blair "This is a fascinating, original, continuously surprising, and meticulously researched study of the long history of the emergence of card systems for organizing not only libraries but business activities in Europe and the United States. It is particularly important for English language readers due to its European perspective and the extraordinary range of German and other resources on which it draws." --W. Boyd Rayward, Professor Emeritus, Graduate School of Library and Information Science, University of Illinois at Urbana-Champaign -- W. Boyd Rayward "Markus Krajewski has done the history of cataloguing and the history of information management a considerable service: I recommend it highly." -- Professor Tom Wilson, Editor-in-Chief, Information Research
  17. Kim, S.H.; Eastman, C.M.: ¬An experiment on node size in a hypermedia system (1999) 0.01
    0.0070192106 = product of:
      0.09826894 = sum of:
        0.09826894 = sum of:
          0.069792934 = weight(_text_:texts in 3673) [ClassicSimilarity], result of:
            0.069792934 = score(doc=3673,freq=2.0), product of:
              0.16460659 = queryWeight, product of:
                5.4822793 = idf(docFreq=499, maxDocs=44218)
                0.03002521 = queryNorm
              0.42399842 = fieldWeight in 3673, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                5.4822793 = idf(docFreq=499, maxDocs=44218)
                0.0546875 = fieldNorm(doc=3673)
          0.02847601 = weight(_text_:22 in 3673) [ClassicSimilarity], result of:
            0.02847601 = score(doc=3673,freq=2.0), product of:
              0.10514317 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.03002521 = 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.071428575 = coord(1/14)
    
    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
  18. Ihadjadene, M.; Bouché, R.; Zâafrani, R.: ¬The dynamic nature of searching and browsing on Web-OPACs : the CATHIE experience (2000) 0.01
    0.0067974646 = product of:
      0.04758225 = sum of:
        0.023791125 = weight(_text_:classification in 118) [ClassicSimilarity], result of:
          0.023791125 = score(doc=118,freq=4.0), product of:
            0.09562149 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03002521 = queryNorm
            0.24880521 = fieldWeight in 118, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0390625 = fieldNorm(doc=118)
        0.023791125 = weight(_text_:classification in 118) [ClassicSimilarity], result of:
          0.023791125 = score(doc=118,freq=4.0), product of:
            0.09562149 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03002521 = queryNorm
            0.24880521 = fieldWeight in 118, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0390625 = fieldNorm(doc=118)
      0.14285715 = coord(2/14)
    
    Abstract
    The paradigm shift from the old system centered view to a user centered approach involves new tools needed for accessing library resources under the condition that the user's needs are taken into account. An end-user, who has only a little knowledge of classification systems or thesauri, understands little of the mode of the representation of contents and the use of authority lists. In addition, he will have difficulty in formulating his question in a precise manner. He needs to know better what the library proposes in order to define of what use it would be for him. Many studies have been carried out on the use of controlled vocabularies (classification, authority lists, thesauri) as searching devices. It is surprising to find that relatively little attention has been given to the role of these tools in filtering and browsing processes. We have developed a prototype named CATHIE (CATalog Hypertextuel Interactif et Enrichi) that supports such filtering and interactive reformulation features
  19. Falquet, G.; Guyot, J.; Nerima, L.: Languages and tools to specify hypertext views on databases (1999) 0.01
    0.005814652 = product of:
      0.040702563 = sum of:
        0.02849856 = product of:
          0.05699712 = sum of:
            0.05699712 = weight(_text_:schemes in 3968) [ClassicSimilarity], result of:
              0.05699712 = score(doc=3968,freq=2.0), product of:
                0.16067243 = queryWeight, product of:
                  5.3512506 = idf(docFreq=569, maxDocs=44218)
                  0.03002521 = queryNorm
                0.35474116 = fieldWeight in 3968, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  5.3512506 = idf(docFreq=569, maxDocs=44218)
                  0.046875 = fieldNorm(doc=3968)
          0.5 = coord(1/2)
        0.0122040035 = product of:
          0.024408007 = sum of:
            0.024408007 = weight(_text_:22 in 3968) [ClassicSimilarity], result of:
              0.024408007 = score(doc=3968,freq=2.0), product of:
                0.10514317 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.03002521 = 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.14285715 = coord(2/14)
    
    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
  20. Barab, S.A.; Bowdish, B.E.; Lawless, K.A.: Hypermedia navigation : profiles of hypermedia users (1997) 0.00
    0.004806533 = product of:
      0.03364573 = sum of:
        0.016822865 = weight(_text_:classification in 97) [ClassicSimilarity], result of:
          0.016822865 = score(doc=97,freq=2.0), product of:
            0.09562149 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03002521 = queryNorm
            0.17593184 = fieldWeight in 97, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0390625 = fieldNorm(doc=97)
        0.016822865 = weight(_text_:classification in 97) [ClassicSimilarity], result of:
          0.016822865 = score(doc=97,freq=2.0), product of:
            0.09562149 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.03002521 = queryNorm
            0.17593184 = fieldWeight in 97, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0390625 = fieldNorm(doc=97)
      0.14285715 = coord(2/14)
    
    Abstract
    In this study we explored the use of logfiles as a window into the process of hypermedia navigation. Although there is a growing body of research addressing theoretical and design issues related to open-ended, non-directive technologies such as hypermedia, relatively few studies have attempted to explain navigational performance. 66 undergraduate students used a multidimensional, computer-based kiosk that could be explored in a nonlinear fashion to find information in response to one of two information retrieval tasks (simple or complex). Cluster analysis was used to generate performance profiles derived from navigational data captured in log files. Analyses of within cluster performance profiles, combined with external validation criteria, led to the classification of 4 different types of navigational performance (models users, disenchanted volunteers, feature explorers, and cyber cartographers). These characterizations were consistent with information retrieval users and the external criteria (self-efficacy, perceived utility, and interest). For example, individual who appeared to fake the time to learn the layout of the kiosk also had the highest self-efficacy, while those who used the help screen and watched the most movies had the lowest self-efficacy. Results also demonstrated an interaction between various individual navigational profiles and type information retrieval task

Authors

Years

Languages

  • e 67
  • d 8
  • f 1
  • p 1
  • pt 1
  • More… Less…

Types

  • a 65
  • m 7
  • s 3
  • r 2
  • b 1
  • d 1
  • x 1
  • More… Less…