Search (183 results, page 1 of 10)

  • × theme_ss:"Hypertext"
  1. Rada, R.: Interactive media (1995) 0.10
    0.10440599 = product of:
      0.24361397 = sum of:
        0.12697922 = weight(_text_:interactions in 684) [ClassicSimilarity], result of:
          0.12697922 = score(doc=684,freq=4.0), product of:
            0.22965278 = queryWeight, product of:
              5.8977947 = idf(docFreq=329, maxDocs=44218)
              0.038938753 = queryNorm
            0.55291826 = fieldWeight in 684, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              5.8977947 = idf(docFreq=329, maxDocs=44218)
              0.046875 = fieldNorm(doc=684)
        0.03351775 = weight(_text_:with in 684) [ClassicSimilarity], result of:
          0.03351775 = score(doc=684,freq=10.0), product of:
            0.09383348 = queryWeight, product of:
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.038938753 = queryNorm
            0.35720462 = fieldWeight in 684, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.046875 = fieldNorm(doc=684)
        0.08311701 = product of:
          0.16623402 = sum of:
            0.16623402 = weight(_text_:humans in 684) [ClassicSimilarity], result of:
              0.16623402 = score(doc=684,freq=4.0), product of:
                0.26276368 = queryWeight, product of:
                  6.7481275 = idf(docFreq=140, maxDocs=44218)
                  0.038938753 = queryNorm
                0.63263696 = fieldWeight in 684, product of:
                  2.0 = tf(freq=4.0), with freq of:
                    4.0 = termFreq=4.0
                  6.7481275 = idf(docFreq=140, maxDocs=44218)
                  0.046875 = fieldNorm(doc=684)
          0.5 = coord(1/2)
      0.42857143 = coord(3/7)
    
    Abstract
    The subject of this book is the relationship between people and interactive media. Written by one of the world's leading experts on this subject, this book explores how hypermedia, groupware, and networks change the way in which people, gropus and organizations work and interact. Its wide-ranging focus discusses the emergence of new technologies and demonstrates by considering real-life case studies the impact each has had on the way we view and interact with colleagues and information. With its emphasis on actual examples of usage, the author provides both practitioners and students with a fascinating glimpse of the future of these media and their applications.
    COMPASS
    Computers / Interactions / With / Humans
    Subject
    Computers / Interactions / With / Humans
  2. Chen, C.; Rada, R.: Interacting with hypertext : a meta-analysis of experimental studies (1996) 0.04
    0.042280514 = product of:
      0.1479818 = sum of:
        0.11971715 = weight(_text_:interactions in 5793) [ClassicSimilarity], result of:
          0.11971715 = score(doc=5793,freq=2.0), product of:
            0.22965278 = queryWeight, product of:
              5.8977947 = idf(docFreq=329, maxDocs=44218)
              0.038938753 = queryNorm
            0.5212963 = fieldWeight in 5793, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.8977947 = idf(docFreq=329, maxDocs=44218)
              0.0625 = fieldNorm(doc=5793)
        0.02826465 = weight(_text_:with in 5793) [ClassicSimilarity], result of:
          0.02826465 = score(doc=5793,freq=4.0), product of:
            0.09383348 = queryWeight, product of:
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.038938753 = queryNorm
            0.30122137 = fieldWeight in 5793, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.0625 = fieldNorm(doc=5793)
      0.2857143 = coord(2/7)
    
    Abstract
    Presents a study on hypertext examining the cognitive styles and spatial ability of users; the complexity of tasks; and the strucutre of information organization and the visualization of the structure. Future work on hypertext usability should emphasize task taxonomies along with longitudinal and ethnographic studies for a deep understanding of the interactions between users and hypertext
  3. Chen, C.; Rada, R.: ¬A conceptual model for supporting collaborative authoring and use (1994) 0.04
    0.036995452 = product of:
      0.12948407 = sum of:
        0.1047525 = weight(_text_:interactions in 7554) [ClassicSimilarity], result of:
          0.1047525 = score(doc=7554,freq=2.0), product of:
            0.22965278 = queryWeight, product of:
              5.8977947 = idf(docFreq=329, maxDocs=44218)
              0.038938753 = queryNorm
            0.4561343 = fieldWeight in 7554, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.8977947 = idf(docFreq=329, maxDocs=44218)
              0.0546875 = fieldNorm(doc=7554)
        0.024731567 = weight(_text_:with in 7554) [ClassicSimilarity], result of:
          0.024731567 = score(doc=7554,freq=4.0), product of:
            0.09383348 = queryWeight, product of:
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.038938753 = queryNorm
            0.2635687 = fieldWeight in 7554, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.0546875 = fieldNorm(doc=7554)
      0.2857143 = coord(2/7)
    
    Abstract
    This paper discusses some problems encountered in hypermedia-based collaboration and reuse, and presents a conceptual framework to resolve these problems. Three suggestions are made based on the discussion: (1) extra organizational structures are necessary in shared hypermedia to support collaborative interactions; (2) an abstract schema is a key to capture the dynamic nature of the shared hypermedia; (3) an integration of the schema evolution approach and the workflow approach is recommended for an open system hypermedia teamwork support. The whole authoring environment is divided into several component spaces with particular respect to the Dexter Hypertext Reference Model. Not only can this separation reduce the overall complexitiy of working within such an environment, but it also conforms more closely with human cognitive needs in collaborative authoring and reuse activities
  4. Horney, M.A.; Anderson-Inman, L.: ¬The ElectroText Project : hypertext reading patterns of middle school students (1994) 0.04
    0.036995452 = product of:
      0.12948407 = sum of:
        0.1047525 = weight(_text_:interactions in 8413) [ClassicSimilarity], result of:
          0.1047525 = score(doc=8413,freq=2.0), product of:
            0.22965278 = queryWeight, product of:
              5.8977947 = idf(docFreq=329, maxDocs=44218)
              0.038938753 = queryNorm
            0.4561343 = fieldWeight in 8413, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.8977947 = idf(docFreq=329, maxDocs=44218)
              0.0546875 = fieldNorm(doc=8413)
        0.024731567 = weight(_text_:with in 8413) [ClassicSimilarity], result of:
          0.024731567 = score(doc=8413,freq=4.0), product of:
            0.09383348 = queryWeight, product of:
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.038938753 = queryNorm
            0.2635687 = fieldWeight in 8413, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.0546875 = fieldNorm(doc=8413)
      0.2857143 = coord(2/7)
    
    Abstract
    Reports a descriptive study conducted with 17 middle school students reading hypertext versions of two short stories. The study focused on gathering and analysing detailed information on students' use of various text enhancements designed to support their reading comprehension and to teach them the use of meta cognitive reading strategies. Data were collected via observations and interviews, as well as a computer monitor that recorded all student interactions with the hypertext documents. Analysis of the monitor transcripts led to the identification of 6 hypertext reading patterns: skimming, checking, reading, responding, studying and reviewing. The reading patterns varied considerable on at least 2 dimensions and their frequency of occurrence was felt to be influenced by such factors as software design, the instructional context, and the student's perception of the task
  5. Gaines, B.R.; Shaw, M.L.G.: Concept maps as hypermedia components (1995) 0.04
    0.03523018 = product of:
      0.12330562 = sum of:
        0.08978786 = weight(_text_:interactions in 4541) [ClassicSimilarity], result of:
          0.08978786 = score(doc=4541,freq=2.0), product of:
            0.22965278 = queryWeight, product of:
              5.8977947 = idf(docFreq=329, maxDocs=44218)
              0.038938753 = queryNorm
            0.39097226 = fieldWeight in 4541, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.8977947 = idf(docFreq=329, maxDocs=44218)
              0.046875 = fieldNorm(doc=4541)
        0.03351775 = weight(_text_:with in 4541) [ClassicSimilarity], result of:
          0.03351775 = score(doc=4541,freq=10.0), product of:
            0.09383348 = queryWeight, product of:
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.038938753 = queryNorm
            0.35720462 = fieldWeight in 4541, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.046875 = fieldNorm(doc=4541)
      0.2857143 = coord(2/7)
    
    Abstract
    Concept mapping has a history of use in many disciplines as a formal or semi formal diagramming technique. Concept maps have an abstract structure as type hypergraphs, and computer support for concept mapping can associate visual attributes with node types to provide an attractive and consistent appearance. Computer support can also provide interactive interfaces allowing arbitrary actions to be associated with nodes such as hypermedia links to other maps and documents. Describes a general concept mapping system that is open architecture for integration with other systems, scriptable to support arbitrary interactions and computations, and customizable to emulate many styles of map. The system supports collaborative development of concept maps across local area and wide area networks, and integrates with WWW in both client helper and server gateway roles. A number of applications are illustrated ranging through education, artificial intelligence, active documents, hypermedia indexing and concurrent engeneering. Concept maps should be regarded as basic components of any hypermedia system, complementing text and images with formal and semi-formal active diagrams
  6. Noermark, K.; Oesterbye, K.: Rich hypertext : a foundation for improved interaction techniques (1995) 0.01
    0.014964644 = product of:
      0.1047525 = sum of:
        0.1047525 = weight(_text_:interactions in 4543) [ClassicSimilarity], result of:
          0.1047525 = score(doc=4543,freq=2.0), product of:
            0.22965278 = queryWeight, product of:
              5.8977947 = idf(docFreq=329, maxDocs=44218)
              0.038938753 = queryNorm
            0.4561343 = fieldWeight in 4543, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.8977947 = idf(docFreq=329, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4543)
      0.14285715 = coord(1/7)
    
    Abstract
    Hypertext has broader applications than being just an information browsing method. Hypertext is a framework which allows for a powerful structuring of large amounts of information. Using hypertext concepts, it is possible to model data in such a way that users can manipulate this information in many different ways, and at different levels of abstraction. Discusses the relationship between the internal representation and the external presentations. Illustrates how a well designed internal representation serves as a foundation for specialized interactions, which can be tailored to specific application areas, primarily by taking the underlying types of information into account
  7. Dimitroff, A.; Wolfram, D.: Searcher response in a hypertext-based bibliographic information retrieval system (1995) 0.01
    0.014104944 = product of:
      0.0493673 = sum of:
        0.02826465 = weight(_text_:with in 187) [ClassicSimilarity], result of:
          0.02826465 = score(doc=187,freq=4.0), product of:
            0.09383348 = queryWeight, product of:
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.038938753 = queryNorm
            0.30122137 = fieldWeight in 187, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.0625 = fieldNorm(doc=187)
        0.021102654 = product of:
          0.042205308 = sum of:
            0.042205308 = weight(_text_:22 in 187) [ClassicSimilarity], result of:
              0.042205308 = score(doc=187,freq=2.0), product of:
                0.13635688 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.038938753 = 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.2857143 = coord(2/7)
    
    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
  8. Salton, G.: Automatic text structuring and summarization (1997) 0.01
    0.013852836 = product of:
      0.09696984 = sum of:
        0.09696984 = product of:
          0.19393969 = sum of:
            0.19393969 = weight(_text_:humans in 145) [ClassicSimilarity], result of:
              0.19393969 = score(doc=145,freq=4.0), product of:
                0.26276368 = queryWeight, product of:
                  6.7481275 = idf(docFreq=140, maxDocs=44218)
                  0.038938753 = queryNorm
                0.73807645 = fieldWeight in 145, product of:
                  2.0 = tf(freq=4.0), with freq of:
                    4.0 = termFreq=4.0
                  6.7481275 = idf(docFreq=140, maxDocs=44218)
                  0.0546875 = fieldNorm(doc=145)
          0.5 = coord(1/2)
      0.14285715 = coord(1/7)
    
    Abstract
    Applies the ideas from the automatic link generation research to automatic text summarisation. Using techniques for inter-document link generation, generates intra-document links between passages of a document. Based on the intra-document linkage pattern of a text, characterises the structure of the text. Applies the knowledge of text structure to do automatic text summarisation by passage extraction. Evaluates a set of 50 summaries generated using these techniques by comparing the to paragraph extracts constructed by humans. The automatic summarisation methods perform well, especially in view of the fact that the summaries generates by 2 humans for the same article are surprisingly dissimilar
  9. Baoming, Z.: Authoring a hypertext database : experiences with HyperPAD (1993) 0.01
    0.012341825 = product of:
      0.043196388 = sum of:
        0.024731567 = weight(_text_:with in 2761) [ClassicSimilarity], result of:
          0.024731567 = score(doc=2761,freq=4.0), product of:
            0.09383348 = queryWeight, product of:
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.038938753 = queryNorm
            0.2635687 = fieldWeight in 2761, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2761)
        0.018464822 = product of:
          0.036929645 = sum of:
            0.036929645 = weight(_text_:22 in 2761) [ClassicSimilarity], result of:
              0.036929645 = score(doc=2761,freq=2.0), product of:
                0.13635688 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.038938753 = 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.2857143 = coord(2/7)
    
    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. Papers from the workshop on hypermedia and hypertext standards held in Amsterdam, Netherlands, 22-23 April 1993 (1993) 0.01
    0.011739651 = product of:
      0.041088775 = sum of:
        0.019986123 = weight(_text_:with in 6320) [ClassicSimilarity], result of:
          0.019986123 = score(doc=6320,freq=2.0), product of:
            0.09383348 = queryWeight, product of:
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.038938753 = queryNorm
            0.21299566 = fieldWeight in 6320, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.0625 = fieldNorm(doc=6320)
        0.021102654 = product of:
          0.042205308 = sum of:
            0.042205308 = weight(_text_:22 in 6320) [ClassicSimilarity], result of:
              0.042205308 = score(doc=6320,freq=2.0), product of:
                0.13635688 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.038938753 = 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.2857143 = coord(2/7)
    
    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
  11. Ramarapu, N.: ¬The impact of hypertext versus sequential information presentation on decision making : a conceptual model (1996) 0.01
    0.011739651 = product of:
      0.041088775 = sum of:
        0.019986123 = weight(_text_:with in 5512) [ClassicSimilarity], result of:
          0.019986123 = score(doc=5512,freq=2.0), product of:
            0.09383348 = queryWeight, product of:
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.038938753 = queryNorm
            0.21299566 = fieldWeight in 5512, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.0625 = fieldNorm(doc=5512)
        0.021102654 = product of:
          0.042205308 = sum of:
            0.042205308 = weight(_text_:22 in 5512) [ClassicSimilarity], result of:
              0.042205308 = score(doc=5512,freq=2.0), product of:
                0.13635688 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.038938753 = queryNorm
                0.30952093 = fieldWeight in 5512, 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=5512)
          0.5 = coord(1/2)
      0.2857143 = coord(2/7)
    
    Abstract
    Proposes a conceptual model to examine hypertext information presentation effects on decision making performance when compared with traditional sequentional information presentation and access. Considers which combination of task knowledge type (superficial, and causal) and information presentation styles (sequential, hypertext) yield the best decision making performance. This is achieved by comparing performance effect of hypertext and sequential information presentation when applied to superficial and causal type of knowledge required for the task. The 2 surrogates used for measuring the outcome of the performance effects are decision time and secision accuracy
    Date
    24.10.1996 19:57:22
  12. Milosavljevic, M.; Oberlander, J.: Dynamic catalogues on the WWW (1998) 0.01
    0.011739651 = product of:
      0.041088775 = sum of:
        0.019986123 = weight(_text_:with in 3594) [ClassicSimilarity], result of:
          0.019986123 = score(doc=3594,freq=2.0), product of:
            0.09383348 = queryWeight, product of:
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.038938753 = queryNorm
            0.21299566 = fieldWeight in 3594, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.0625 = fieldNorm(doc=3594)
        0.021102654 = product of:
          0.042205308 = sum of:
            0.042205308 = weight(_text_:22 in 3594) [ClassicSimilarity], result of:
              0.042205308 = score(doc=3594,freq=2.0), product of:
                0.13635688 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.038938753 = 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.2857143 = coord(2/7)
    
    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
  13. Capps, M.; Ladd, B.; Stotts, D.: Enhanced graph models in the Web : multi-client, multi-head, multi-tail browsing (1996) 0.01
    0.010272195 = product of:
      0.03595268 = sum of:
        0.017487857 = weight(_text_:with in 5860) [ClassicSimilarity], result of:
          0.017487857 = score(doc=5860,freq=2.0), product of:
            0.09383348 = queryWeight, product of:
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.038938753 = queryNorm
            0.1863712 = fieldWeight in 5860, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.0546875 = fieldNorm(doc=5860)
        0.018464822 = product of:
          0.036929645 = sum of:
            0.036929645 = weight(_text_:22 in 5860) [ClassicSimilarity], result of:
              0.036929645 = score(doc=5860,freq=2.0), product of:
                0.13635688 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.038938753 = 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.2857143 = coord(2/7)
    
    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
  14. Carmel, E.; Crawford, S.; Chen, H.: Browsing in hypertext : a cognitive study (1992) 0.01
    0.009949936 = product of:
      0.034824774 = sum of:
        0.021635616 = weight(_text_:with in 7469) [ClassicSimilarity], result of:
          0.021635616 = score(doc=7469,freq=6.0), product of:
            0.09383348 = queryWeight, product of:
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.038938753 = queryNorm
            0.2305746 = fieldWeight in 7469, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.0390625 = fieldNorm(doc=7469)
        0.013189158 = product of:
          0.026378317 = sum of:
            0.026378317 = weight(_text_:22 in 7469) [ClassicSimilarity], result of:
              0.026378317 = score(doc=7469,freq=2.0), product of:
                0.13635688 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.038938753 = 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.2857143 = coord(2/7)
    
    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
  15. Yang, C.C.; Liu, N.: Web site topic-hierarchy generation based on link structure (2009) 0.01
    0.009949936 = product of:
      0.034824774 = sum of:
        0.021635616 = weight(_text_:with in 2738) [ClassicSimilarity], result of:
          0.021635616 = score(doc=2738,freq=6.0), product of:
            0.09383348 = queryWeight, product of:
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.038938753 = queryNorm
            0.2305746 = fieldWeight in 2738, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2738)
        0.013189158 = product of:
          0.026378317 = sum of:
            0.026378317 = weight(_text_:22 in 2738) [ClassicSimilarity], result of:
              0.026378317 = score(doc=2738,freq=2.0), product of:
                0.13635688 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.038938753 = queryNorm
                0.19345059 = fieldWeight in 2738, 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=2738)
          0.5 = coord(1/2)
      0.2857143 = coord(2/7)
    
    Abstract
    Navigating through hyperlinks within a Web site to look for information from one of its Web pages without the support of a site map can be inefficient and ineffective. Although the content of a Web site is usually organized with an inherent structure like a topic hierarchy, which is a directed tree rooted at a Web site's homepage whose vertices and edges correspond to Web pages and hyperlinks, such a topic hierarchy is not always available to the user. In this work, we studied the problem of automatic generation of Web sites' topic hierarchies. We modeled a Web site's link structure as a weighted directed graph and proposed methods for estimating edge weights based on eight types of features and three learning algorithms, namely decision trees, naïve Bayes classifiers, and logistic regression. Three graph algorithms, namely breadth-first search, shortest-path search, and directed minimum-spanning tree, were adapted to generate the topic hierarchy based on the graph model. We have tested the model and algorithms on real Web sites. It is found that the directed minimum-spanning tree algorithm with the decision tree as the weight learning algorithm achieves the highest performance with an average accuracy of 91.9%.
    Date
    22. 3.2009 12:51:47
  16. Falquet, G.; Guyot, J.; Nerima, L.: Languages and tools to specify hypertext views on databases (1999) 0.01
    0.008804738 = product of:
      0.030816581 = sum of:
        0.014989593 = weight(_text_:with in 3968) [ClassicSimilarity], result of:
          0.014989593 = score(doc=3968,freq=2.0), product of:
            0.09383348 = queryWeight, product of:
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.038938753 = queryNorm
            0.15974675 = fieldWeight in 3968, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.046875 = fieldNorm(doc=3968)
        0.015826989 = product of:
          0.031653978 = sum of:
            0.031653978 = weight(_text_:22 in 3968) [ClassicSimilarity], result of:
              0.031653978 = score(doc=3968,freq=2.0), product of:
                0.13635688 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.038938753 = 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.2857143 = coord(2/7)
    
    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
  17. 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.007337282 = product of:
      0.025680486 = sum of:
        0.012491328 = weight(_text_:with in 633) [ClassicSimilarity], result of:
          0.012491328 = score(doc=633,freq=2.0), product of:
            0.09383348 = queryWeight, product of:
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.038938753 = queryNorm
            0.1331223 = fieldWeight in 633, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.0390625 = fieldNorm(doc=633)
        0.013189158 = product of:
          0.026378317 = sum of:
            0.026378317 = weight(_text_:22 in 633) [ClassicSimilarity], result of:
              0.026378317 = score(doc=633,freq=2.0), product of:
                0.13635688 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.038938753 = 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.2857143 = coord(2/7)
    
    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
  18. Schreiweis, U.: Hypertextstrukturen als Grundlage für integrierte Wissensakquisitionssysteme (1993) 0.01
    0.0060293297 = product of:
      0.042205308 = sum of:
        0.042205308 = product of:
          0.084410615 = sum of:
            0.084410615 = weight(_text_:22 in 8762) [ClassicSimilarity], result of:
              0.084410615 = score(doc=8762,freq=2.0), product of:
                0.13635688 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.038938753 = queryNorm
                0.61904186 = fieldWeight in 8762, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.125 = fieldNorm(doc=8762)
          0.5 = coord(1/2)
      0.14285715 = coord(1/7)
    
    Date
    19.10.1995 10:22:53
  19. Gallagher, L.; Furuta, R.; Stotts, P.D.: Increasing the power of hypertext search with relational queries (1990) 0.01
    0.005710321 = product of:
      0.039972246 = sum of:
        0.039972246 = weight(_text_:with in 4920) [ClassicSimilarity], result of:
          0.039972246 = score(doc=4920,freq=8.0), product of:
            0.09383348 = queryWeight, product of:
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.038938753 = queryNorm
            0.42599133 = fieldWeight in 4920, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.0625 = fieldNorm(doc=4920)
      0.14285715 = coord(1/7)
    
    Abstract
    Describes an SGL relational database schema for representing the objects in HyperCard, along with a technique for automatically populating this schema from a HyperCard stack using the facilities in HyperTalk with calls to the database manager. The stabndard relational database query language SQL can then be used to perform more general hypertext searches than are possible with the string search feature found in most hypertext browsing environments. These techniques, although demonstrated specially usinf HyperCard and Oracle for Macintosh, are generally applicable to a wide range of hypertext systems and relational databases
  20. Fox, E.A.; Chen, Q.F.; France, R.K.: Integrating search and retrieval with hypertext (1991) 0.01
    0.005710321 = product of:
      0.039972246 = sum of:
        0.039972246 = weight(_text_:with in 5671) [ClassicSimilarity], result of:
          0.039972246 = score(doc=5671,freq=2.0), product of:
            0.09383348 = queryWeight, product of:
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.038938753 = queryNorm
            0.42599133 = fieldWeight in 5671, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.409771 = idf(docFreq=10797, maxDocs=44218)
              0.125 = fieldNorm(doc=5671)
      0.14285715 = coord(1/7)
    

Authors

Years

Languages

Types

  • a 168
  • m 5
  • r 5
  • s 5
  • b 1
  • d 1
  • x 1
  • More… Less…

Classifications