Search (378 results, page 1 of 19)

  • × theme_ss:"Hypertext"
  1. Viladenc, I.; Dupont, O.: Knowledge transfer in the field of telematics, in a didactic communicational context realized with hypermedia support (1998) 0.09
    0.08581623 = product of:
      0.12872434 = sum of:
        0.11726358 = weight(_text_:sociology in 82) [ClassicSimilarity], result of:
          0.11726358 = score(doc=82,freq=2.0), product of:
            0.30495512 = queryWeight, product of:
              6.9606886 = idf(docFreq=113, maxDocs=44218)
              0.043811057 = queryNorm
            0.38452733 = fieldWeight in 82, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              6.9606886 = idf(docFreq=113, maxDocs=44218)
              0.0390625 = fieldNorm(doc=82)
        0.011460752 = product of:
          0.022921504 = sum of:
            0.022921504 = weight(_text_:of in 82) [ClassicSimilarity], result of:
              0.022921504 = score(doc=82,freq=30.0), product of:
                0.06850986 = queryWeight, product of:
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.043811057 = queryNorm
                0.33457235 = fieldWeight in 82, product of:
                  5.477226 = tf(freq=30.0), with freq of:
                    30.0 = termFreq=30.0
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.0390625 = fieldNorm(doc=82)
          0.5 = coord(1/2)
      0.6666667 = coord(2/3)
    
    Abstract
    This paper describes part of a university research project which aims to construct a design method involving interactive multimedia products for knowledge acquisition. The purpose of the method is to design truly interactive multimedia products (Vidalenc, 1997), and thus to introduce a new form of writing. This is built up by adopting a constructivist paradigm that is based upon a systemic view and upon a network approach such as proposed by the sociology of translation (Callon, 1986). All our reflections are indeed based on the differentiation between two levels of information: an internal level and a sensitive level (Bouzidi and Vidalenc, 1997). However we have chosen a common model, the object oriented model, which allows us to represent the elements belonging to each level. In order to prove the validity of this proceeding, a prototype is under preparation. It is founded on the transposition of a course, which deals with telecommunications and networks, into a multimedia teaching tool. To be able to build up the prototype, taking into account the usual steps (writing the requirement schedule, choosing the necessary technology, modeling, design, implementation and evaluation), and after that, to be able to measure the conception method, a stage of analysis and assessment of the present course is necessary. The analysis of the course must allow us to identify the conditions of the knowledge transfer and provide components for the requirement schedule of the hypermedia product. This is the main subject of our reflections
    Source
    Structures and relations in knowledge organization: Proceedings of the 5th International ISKO-Conference, Lille, 25.-29.8.1998. Ed.: W. Mustafa el Hadi et al
  2. Griffith, C.: What's all the hype about hypertext? (1989) 0.03
    0.026619852 = product of:
      0.079859555 = sum of:
        0.079859555 = sum of:
          0.020501617 = weight(_text_:of in 2505) [ClassicSimilarity], result of:
            0.020501617 = score(doc=2505,freq=6.0), product of:
              0.06850986 = queryWeight, product of:
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.043811057 = queryNorm
              0.2992506 = fieldWeight in 2505, product of:
                2.4494898 = tf(freq=6.0), with freq of:
                  6.0 = termFreq=6.0
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.078125 = fieldNorm(doc=2505)
          0.059357934 = weight(_text_:22 in 2505) [ClassicSimilarity], result of:
            0.059357934 = score(doc=2505,freq=2.0), product of:
              0.15341885 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.043811057 = queryNorm
              0.38690117 = fieldWeight in 2505, 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=2505)
      0.33333334 = coord(1/3)
    
    Abstract
    Considers the reason why CD-ROM's promise of a large range of legal data bases has, to some extent, been limited. The new range of CD-ROM hypertext data bases, produced by West Publishing Company, are discussed briefly.
    Source
    Information today. 6(1989) no.4, S.22-24
  3. Welsch, L.A.: Multimedia and hypermedia : model and framework (1993) 0.03
    0.026619852 = product of:
      0.079859555 = sum of:
        0.079859555 = sum of:
          0.020501617 = weight(_text_:of in 2756) [ClassicSimilarity], result of:
            0.020501617 = score(doc=2756,freq=6.0), product of:
              0.06850986 = queryWeight, product of:
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.043811057 = queryNorm
              0.2992506 = fieldWeight in 2756, product of:
                2.4494898 = tf(freq=6.0), with freq of:
                  6.0 = termFreq=6.0
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.078125 = fieldNorm(doc=2756)
          0.059357934 = weight(_text_:22 in 2756) [ClassicSimilarity], result of:
            0.059357934 = score(doc=2756,freq=2.0), product of:
              0.15341885 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.043811057 = 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.33333334 = coord(1/3)
    
    Abstract
    Compilation of overhead sheets of papers given at the workshop. Describes standards for multimedia and hypermedia
    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. Smith, L.C.: "Wholly new forms of encyclopedias" : electronic knowledge in the form of hypertext (1989) 0.03
    0.025298074 = product of:
      0.07589422 = sum of:
        0.07589422 = sum of:
          0.028407872 = weight(_text_:of in 3558) [ClassicSimilarity], result of:
            0.028407872 = score(doc=3558,freq=18.0), product of:
              0.06850986 = queryWeight, product of:
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.043811057 = queryNorm
              0.41465375 = fieldWeight in 3558, product of:
                4.2426405 = tf(freq=18.0), with freq of:
                  18.0 = termFreq=18.0
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.0625 = fieldNorm(doc=3558)
          0.047486346 = weight(_text_:22 in 3558) [ClassicSimilarity], result of:
            0.047486346 = score(doc=3558,freq=2.0), product of:
              0.15341885 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.043811057 = 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.33333334 = coord(1/3)
    
    Abstract
    The history of encyclopedias and wholly new forms of encyclopedias are briefly reviewed. The possibilities and problems that hypertext presents as a basis for new forms of encyclopedias are explored. The capabilities of current systems, both experimental and commercially available, are outlined, focusing on new possibilities for authoring and design and for reading the retrieval. Examples of applications already making use of hypertext are given.
    Date
    7. 1.1996 22:47:52
    Source
    Information, knowledge, evolution. Proceedings of the 44th FID Congress, Helsinki, 28.8.-1.9.1988. Ed. by S. Koshiala and R. Launo
  5. Ramarapu, N.: ¬The impact of hypertext versus sequential information presentation on decision making : a conceptual model (1996) 0.02
    0.023560425 = product of:
      0.070681274 = sum of:
        0.070681274 = sum of:
          0.023194931 = weight(_text_:of in 5512) [ClassicSimilarity], result of:
            0.023194931 = score(doc=5512,freq=12.0), product of:
              0.06850986 = queryWeight, product of:
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.043811057 = queryNorm
              0.33856338 = fieldWeight in 5512, product of:
                3.4641016 = tf(freq=12.0), with freq of:
                  12.0 = termFreq=12.0
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.0625 = fieldNorm(doc=5512)
          0.047486346 = weight(_text_:22 in 5512) [ClassicSimilarity], result of:
            0.047486346 = score(doc=5512,freq=2.0), product of:
              0.15341885 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.043811057 = 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.33333334 = coord(1/3)
    
    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
    Source
    International journal of information management. 16(1996) no.3, S.183-193
  6. Diaz, P.; Aedo, I.; Panetsos, F.: Labyrinth, an abstract model for hypermedia applications : Description of its static components (1997) 0.02
    0.022886775 = product of:
      0.06866033 = sum of:
        0.06866033 = sum of:
          0.021173978 = weight(_text_:of in 3318) [ClassicSimilarity], result of:
            0.021173978 = score(doc=3318,freq=10.0), product of:
              0.06850986 = queryWeight, product of:
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.043811057 = queryNorm
              0.3090647 = fieldWeight in 3318, product of:
                3.1622777 = tf(freq=10.0), with freq of:
                  10.0 = termFreq=10.0
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.0625 = fieldNorm(doc=3318)
          0.047486346 = weight(_text_:22 in 3318) [ClassicSimilarity], result of:
            0.047486346 = score(doc=3318,freq=2.0), product of:
              0.15341885 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.043811057 = 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.33333334 = coord(1/3)
    
    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. Dimitroff, A.; Wolfram, D.: Searcher response in a hypertext-based bibliographic information retrieval system (1995) 0.02
    0.022141643 = product of:
      0.06642493 = sum of:
        0.06642493 = sum of:
          0.018938582 = weight(_text_:of in 187) [ClassicSimilarity], result of:
            0.018938582 = score(doc=187,freq=8.0), product of:
              0.06850986 = queryWeight, product of:
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.043811057 = queryNorm
              0.27643585 = fieldWeight in 187, product of:
                2.828427 = tf(freq=8.0), with freq of:
                  8.0 = termFreq=8.0
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.0625 = fieldNorm(doc=187)
          0.047486346 = weight(_text_:22 in 187) [ClassicSimilarity], result of:
            0.047486346 = score(doc=187,freq=2.0), product of:
              0.15341885 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.043811057 = 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.33333334 = coord(1/3)
    
    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. Spertus, E.: ParaSite : mining structural information on the Web (1997) 0.02
    0.022141643 = product of:
      0.06642493 = sum of:
        0.06642493 = sum of:
          0.018938582 = weight(_text_:of in 2740) [ClassicSimilarity], result of:
            0.018938582 = score(doc=2740,freq=8.0), product of:
              0.06850986 = queryWeight, product of:
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.043811057 = queryNorm
              0.27643585 = fieldWeight in 2740, product of:
                2.828427 = tf(freq=8.0), with freq of:
                  8.0 = termFreq=8.0
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.0625 = fieldNorm(doc=2740)
          0.047486346 = weight(_text_:22 in 2740) [ClassicSimilarity], result of:
            0.047486346 = score(doc=2740,freq=2.0), product of:
              0.15341885 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.043811057 = queryNorm
              0.30952093 = fieldWeight in 2740, 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=2740)
      0.33333334 = coord(1/3)
    
    Abstract
    Discusses the varieties of link information on the WWW, how the Web differs from conventional hypertext, and how the links can be exploited to build useful applications. Specific applications presented as part of the ParaSite system find individuals' homepages, new locations of moved pages and unindexed information
    Date
    1. 8.1996 22:08:06
    Footnote
    Contribution to a special issue of papers from the 6th International World Wide Web conference, held 7-11 Apr 1997, Santa Clara, California
  9. Baoming, Z.: Authoring a hypertext database : experiences with HyperPAD (1993) 0.02
    0.021661952 = product of:
      0.06498586 = sum of:
        0.06498586 = sum of:
          0.0234353 = weight(_text_:of in 2761) [ClassicSimilarity], result of:
            0.0234353 = score(doc=2761,freq=16.0), product of:
              0.06850986 = queryWeight, product of:
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.043811057 = queryNorm
              0.34207192 = fieldWeight in 2761, product of:
                4.0 = tf(freq=16.0), with freq of:
                  16.0 = termFreq=16.0
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.0546875 = fieldNorm(doc=2761)
          0.041550554 = weight(_text_:22 in 2761) [ClassicSimilarity], result of:
            0.041550554 = score(doc=2761,freq=2.0), product of:
              0.15341885 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.043811057 = 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.33333334 = coord(1/3)
    
    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.02
    0.02129588 = product of:
      0.06388764 = sum of:
        0.06388764 = sum of:
          0.016401293 = weight(_text_:of in 4915) [ClassicSimilarity], result of:
            0.016401293 = score(doc=4915,freq=6.0), product of:
              0.06850986 = queryWeight, product of:
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.043811057 = queryNorm
              0.23940048 = fieldWeight in 4915, product of:
                2.4494898 = tf(freq=6.0), with freq of:
                  6.0 = termFreq=6.0
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.0625 = fieldNorm(doc=4915)
          0.047486346 = weight(_text_:22 in 4915) [ClassicSimilarity], result of:
            0.047486346 = score(doc=4915,freq=2.0), product of:
              0.15341885 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.043811057 = 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.33333334 = coord(1/3)
    
    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. Papers from the workshop on hypermedia and hypertext standards held in Amsterdam, Netherlands, 22-23 April 1993 (1993) 0.02
    0.020292649 = product of:
      0.060877945 = sum of:
        0.060877945 = sum of:
          0.0133916 = weight(_text_:of in 6320) [ClassicSimilarity], result of:
            0.0133916 = score(doc=6320,freq=4.0), product of:
              0.06850986 = queryWeight, product of:
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.043811057 = queryNorm
              0.19546966 = fieldWeight in 6320, product of:
                2.0 = tf(freq=4.0), with freq of:
                  4.0 = termFreq=4.0
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.0625 = fieldNorm(doc=6320)
          0.047486346 = weight(_text_:22 in 6320) [ClassicSimilarity], result of:
            0.047486346 = score(doc=6320,freq=2.0), product of:
              0.15341885 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.043811057 = 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.33333334 = coord(1/3)
    
    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
  12. Milosavljevic, M.; Oberlander, J.: Dynamic catalogues on the WWW (1998) 0.02
    0.020292649 = product of:
      0.060877945 = sum of:
        0.060877945 = sum of:
          0.0133916 = weight(_text_:of in 3594) [ClassicSimilarity], result of:
            0.0133916 = score(doc=3594,freq=4.0), product of:
              0.06850986 = queryWeight, product of:
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.043811057 = queryNorm
              0.19546966 = fieldWeight in 3594, product of:
                2.0 = tf(freq=4.0), with freq of:
                  4.0 = termFreq=4.0
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.0625 = fieldNorm(doc=3594)
          0.047486346 = weight(_text_:22 in 3594) [ClassicSimilarity], result of:
            0.047486346 = score(doc=3594,freq=2.0), product of:
              0.15341885 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.043811057 = 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.33333334 = coord(1/3)
    
    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
    Footnote
    Contribution to a special issue devoted to the Proceedings of the 7th International World Wide Web Conference, held 14-18 April 1998, Brisbane, Australia
  13. Westland, J.C.: Some conditions for cost efficiency in hypermedia (1998) 0.02
    0.019357719 = product of:
      0.058073156 = sum of:
        0.058073156 = sum of:
          0.022458395 = weight(_text_:of in 3292) [ClassicSimilarity], result of:
            0.022458395 = score(doc=3292,freq=20.0), product of:
              0.06850986 = queryWeight, product of:
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.043811057 = queryNorm
              0.32781258 = fieldWeight in 3292, product of:
                4.472136 = tf(freq=20.0), with freq of:
                  20.0 = termFreq=20.0
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.046875 = fieldNorm(doc=3292)
          0.03561476 = weight(_text_:22 in 3292) [ClassicSimilarity], result of:
            0.03561476 = score(doc=3292,freq=2.0), product of:
              0.15341885 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.043811057 = 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.33333334 = coord(1/3)
    
    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
  14. Gabbard, R.: Recent literature shows accelerated growth in hypermedia tools : an annotated bibliography (1994) 0.02
    0.018985212 = product of:
      0.056955636 = sum of:
        0.056955636 = sum of:
          0.009469291 = weight(_text_:of in 8460) [ClassicSimilarity], result of:
            0.009469291 = score(doc=8460,freq=2.0), product of:
              0.06850986 = queryWeight, product of:
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.043811057 = queryNorm
              0.13821793 = fieldWeight in 8460, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.0625 = fieldNorm(doc=8460)
          0.047486346 = weight(_text_:22 in 8460) [ClassicSimilarity], result of:
            0.047486346 = score(doc=8460,freq=2.0), product of:
              0.15341885 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.043811057 = 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.33333334 = coord(1/3)
    
    Abstract
    An annotated bibliography on hypermedia divided into 3 sections: material on hypertext/hypermedia that is not tied to any hardware platforms or operating systems; materials detailing those hypertext/hypermedia applications for DOS and Windows, HyperCard Macintosh hypertext/hypermedia applications. Includes journal articles, monographs, conference proceedings, and specific product announcements, evaluations, and reviews from 1990 until the summer of 1993
    Source
    Reference services review. 22(1994) no.2, S.31-40
  15. Falquet, G.; Guyot, J.; Nerima, L.: Languages and tools to specify hypertext views on databases (1999) 0.02
    0.018567387 = product of:
      0.055702157 = sum of:
        0.055702157 = sum of:
          0.020087399 = weight(_text_:of in 3968) [ClassicSimilarity], result of:
            0.020087399 = score(doc=3968,freq=16.0), product of:
              0.06850986 = queryWeight, product of:
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.043811057 = queryNorm
              0.2932045 = fieldWeight in 3968, product of:
                4.0 = tf(freq=16.0), with freq of:
                  16.0 = termFreq=16.0
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.046875 = fieldNorm(doc=3968)
          0.03561476 = weight(_text_:22 in 3968) [ClassicSimilarity], result of:
            0.03561476 = score(doc=3968,freq=2.0), product of:
              0.15341885 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.043811057 = 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.33333334 = coord(1/3)
    
    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
  16. Baião Salgado Silva, G.; Lima, G.Â. Borém de Oliveira: Using topic maps in establishing compatibility of semantically structured hypertext contents (2012) 0.02
    0.018492091 = product of:
      0.05547627 = sum of:
        0.05547627 = sum of:
          0.025797302 = weight(_text_:of in 633) [ClassicSimilarity], result of:
            0.025797302 = score(doc=633,freq=38.0), product of:
              0.06850986 = queryWeight, product of:
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.043811057 = queryNorm
              0.37654874 = fieldWeight in 633, product of:
                6.164414 = tf(freq=38.0), with freq of:
                  38.0 = termFreq=38.0
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.0390625 = fieldNorm(doc=633)
          0.029678967 = weight(_text_:22 in 633) [ClassicSimilarity], result of:
            0.029678967 = score(doc=633,freq=2.0), product of:
              0.15341885 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.043811057 = 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.33333334 = coord(1/3)
    
    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
  17. Kim, S.H.; Eastman, C.M.: ¬An experiment on node size in a hypermedia system (1999) 0.02
    0.01775607 = product of:
      0.053268205 = sum of:
        0.053268205 = sum of:
          0.01171765 = weight(_text_:of in 3673) [ClassicSimilarity], result of:
            0.01171765 = score(doc=3673,freq=4.0), product of:
              0.06850986 = queryWeight, product of:
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.043811057 = queryNorm
              0.17103596 = fieldWeight in 3673, product of:
                2.0 = tf(freq=4.0), with freq of:
                  4.0 = termFreq=4.0
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.0546875 = fieldNorm(doc=3673)
          0.041550554 = weight(_text_:22 in 3673) [ClassicSimilarity], result of:
            0.041550554 = score(doc=3673,freq=2.0), product of:
              0.15341885 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.043811057 = 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.33333334 = coord(1/3)
    
    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
    Source
    Journal of the American Society for Information Science. 50(1999) no.6, S.530-536
  18. Capps, M.; Ladd, B.; Stotts, D.: Enhanced graph models in the Web : multi-client, multi-head, multi-tail browsing (1996) 0.02
    0.016612062 = product of:
      0.049836185 = sum of:
        0.049836185 = sum of:
          0.00828563 = weight(_text_:of in 5860) [ClassicSimilarity], result of:
            0.00828563 = score(doc=5860,freq=2.0), product of:
              0.06850986 = queryWeight, product of:
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.043811057 = queryNorm
              0.120940685 = fieldWeight in 5860, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.0546875 = fieldNorm(doc=5860)
          0.041550554 = weight(_text_:22 in 5860) [ClassicSimilarity], result of:
            0.041550554 = score(doc=5860,freq=2.0), product of:
              0.15341885 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.043811057 = 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.33333334 = coord(1/3)
    
    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
  19. Schreiweis, U.: Hypertextstrukturen als Grundlage für integrierte Wissensakquisitionssysteme (1993) 0.02
    0.015828783 = product of:
      0.047486346 = sum of:
        0.047486346 = product of:
          0.09497269 = sum of:
            0.09497269 = weight(_text_:22 in 8762) [ClassicSimilarity], result of:
              0.09497269 = score(doc=8762,freq=2.0), product of:
                0.15341885 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.043811057 = 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.33333334 = coord(1/3)
    
    Date
    19.10.1995 10:22:53
  20. Yang, C.C.; Liu, N.: Web site topic-hierarchy generation based on link structure (2009) 0.02
    0.015472822 = product of:
      0.046418466 = sum of:
        0.046418466 = sum of:
          0.016739499 = weight(_text_:of in 2738) [ClassicSimilarity], result of:
            0.016739499 = score(doc=2738,freq=16.0), product of:
              0.06850986 = queryWeight, product of:
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.043811057 = queryNorm
              0.24433708 = fieldWeight in 2738, product of:
                4.0 = tf(freq=16.0), with freq of:
                  16.0 = termFreq=16.0
                1.5637573 = idf(docFreq=25162, maxDocs=44218)
                0.0390625 = fieldNorm(doc=2738)
          0.029678967 = weight(_text_:22 in 2738) [ClassicSimilarity], result of:
            0.029678967 = score(doc=2738,freq=2.0), product of:
              0.15341885 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.043811057 = 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.33333334 = coord(1/3)
    
    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
    Source
    Journal of the American Society for Information Science and Technology. 60(2009) no.3, S.495-508

Authors

Years

Languages

Types

  • a 334
  • m 17
  • s 16
  • r 6
  • d 4
  • x 3
  • b 1
  • More… Less…