Search (150 results, page 1 of 8)

0.021556493 = product of:
  0.07544772 = sum of:
    0.054281104 = weight(_text_:based in 187) [ClassicSimilarity], result of:
      0.054281104 = score(doc=187,freq=6.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.4612686 = fieldWeight in 187, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.0625 = fieldNorm(doc=187)
    0.021166623 = product of:
      0.042333245 = sum of:
        0.042333245 = weight(_text_:22 in 187) [ClassicSimilarity], result of:
          0.042333245 = score(doc=187,freq=2.0), product of:
            0.13677022 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03905679 = 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

0.015636176 = product of:
  0.10945322 = sum of:
    0.10945322 = weight(_text_:great in 6748) [ClassicSimilarity], result of:
      0.10945322 = score(doc=6748,freq=2.0), product of:
        0.21992016 = queryWeight, product of:
          5.6307793 = idf(docFreq=430, maxDocs=44218)
          0.03905679 = queryNorm
        0.49769527 = fieldWeight in 6748, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.6307793 = idf(docFreq=430, maxDocs=44218)
          0.0625 = fieldNorm(doc=6748)
  0.14285715 = coord(1/7)

Abstract

Hypermedia is the presentation of online text and graphics to users in a form that allows them to view information in a sequence and quantity that best suits their needs. it offers great opportunities for information transfer. Examines how far it is possible to assess the usability of information presented as hypermedia. Considers the need to reexamine concepts of usability and methods for measuring it

0.015636176 = product of:
  0.10945322 = sum of:
    0.10945322 = weight(_text_:great in 1990) [ClassicSimilarity], result of:
      0.10945322 = score(doc=1990,freq=2.0), product of:
        0.21992016 = queryWeight, product of:
          5.6307793 = idf(docFreq=430, maxDocs=44218)
          0.03905679 = queryNorm
        0.49769527 = fieldWeight in 1990, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.6307793 = idf(docFreq=430, maxDocs=44218)
          0.0625 = fieldNorm(doc=1990)
  0.14285715 = coord(1/7)

Abstract

Although hypertext has much potential as a medium for technical communication, it is not always easy to use. Frequently, users have had little experience with hypertext, or they may be unfamiliar with a particular documents. Authors, on the other hand, have a great deal of knowledge about the documents they design and write. Expert systems can make hypertext more usable by allowing the author's expertise to reside with the document. In effect, the author can be available to perform run-time audience analysis, to customize hypertext documents to users' needs, and to advise users in selecting documents and in choosing effective reading strategies

0.01403292 = product of:
  0.04911522 = sum of:
    0.03324025 = weight(_text_:based in 3968) [ClassicSimilarity], result of:
      0.03324025 = score(doc=3968,freq=4.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.28246817 = fieldWeight in 3968, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.046875 = fieldNorm(doc=3968)
    0.015874967 = product of:
      0.031749934 = sum of:
        0.031749934 = weight(_text_:22 in 3968) [ClassicSimilarity], result of:
          0.031749934 = score(doc=3968,freq=2.0), product of:
            0.13677022 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03905679 = 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

0.01347281 = product of:
  0.047154833 = sum of:
    0.033925693 = weight(_text_:based in 2738) [ClassicSimilarity], result of:
      0.033925693 = score(doc=2738,freq=6.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.28829288 = fieldWeight in 2738, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2738)
    0.013229139 = product of:
      0.026458278 = sum of:
        0.026458278 = weight(_text_:22 in 2738) [ClassicSimilarity], result of:
          0.026458278 = score(doc=2738,freq=2.0), product of:
            0.13677022 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03905679 = 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

0.011727133 = product of:
  0.08208992 = sum of:
    0.08208992 = weight(_text_:great in 734) [ClassicSimilarity], result of:
      0.08208992 = score(doc=734,freq=2.0), product of:
        0.21992016 = queryWeight, product of:
          5.6307793 = idf(docFreq=430, maxDocs=44218)
          0.03905679 = queryNorm
        0.37327147 = fieldWeight in 734, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.6307793 = idf(docFreq=430, maxDocs=44218)
          0.046875 = fieldNorm(doc=734)
  0.14285715 = coord(1/7)

Abstract

Most existing hypermedia authoring systems incorporate facilities for the creation of static links between pieces of information, termed nodes. Such links usually support only browsing activities over the hypermedia web, carrying little or no information about the conceptual relationship the nodes might have. Thus indecision occurs: the reader of the hypermedia can traverse a link but has no indication what link to choose and what he might expect from the traversal. At the same time, the creation of these links requires a great effort from the author, moreover if there are certain criteria that guide linking. This paper presents a two-layered hypermedia semantic model that enriches the semantic links, and alsoprovides the means for dynamic link creation. To accomplish these objectives, we adopt the use of fuzzy set theory and fuzzy logic as the mathematical framework for link characterization and dynamic link creation. Some aspects of a prototype system, named Platon, are also presented

0.011080084 = product of:
  0.07756059 = sum of:
    0.07756059 = weight(_text_:based in 4470) [ClassicSimilarity], result of:
      0.07756059 = score(doc=4470,freq=4.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.6590924 = fieldWeight in 4470, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.109375 = fieldNorm(doc=4470)
  0.14285715 = coord(1/7)

Abstract

A special issue devoted to knowledge based hypermedia

0.009376042 = product of:
  0.032816146 = sum of:
    0.019587006 = weight(_text_:based in 7469) [ClassicSimilarity], result of:
      0.019587006 = score(doc=7469,freq=2.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.16644597 = fieldWeight in 7469, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.0390625 = fieldNorm(doc=7469)
    0.013229139 = product of:
      0.026458278 = sum of:
        0.026458278 = weight(_text_:22 in 7469) [ClassicSimilarity], result of:
          0.026458278 = score(doc=7469,freq=2.0), product of:
            0.13677022 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03905679 = 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

0.009376042 = product of:
  0.032816146 = sum of:
    0.019587006 = weight(_text_:based in 633) [ClassicSimilarity], result of:
      0.019587006 = score(doc=633,freq=2.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.16644597 = fieldWeight in 633, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.0390625 = fieldNorm(doc=633)
    0.013229139 = product of:
      0.026458278 = sum of:
        0.026458278 = weight(_text_:22 in 633) [ClassicSimilarity], result of:
          0.026458278 = score(doc=633,freq=2.0), product of:
            0.13677022 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03905679 = 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

0.00895406 = product of:
  0.06267842 = sum of:
    0.06267842 = weight(_text_:based in 7504) [ClassicSimilarity], result of:
      0.06267842 = score(doc=7504,freq=2.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.5326271 = fieldWeight in 7504, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.125 = fieldNorm(doc=7504)
  0.14285715 = coord(1/7)

0.007914346 = product of:
  0.05540042 = sum of:
    0.05540042 = weight(_text_:based in 973) [ClassicSimilarity], result of:
      0.05540042 = score(doc=973,freq=4.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.47078028 = fieldWeight in 973, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.078125 = fieldNorm(doc=973)
  0.14285715 = coord(1/7)

Abstract

Introduction to people familiar with the concepts and syntax of SGML to the functionality provided by the new ISO 10744 standard. HyTime: the Hypermedia and Time Based Structuring Language, in producing hypertext information systems

0.007834803 = product of:
  0.05484362 = sum of:
    0.05484362 = weight(_text_:based in 2930) [ClassicSimilarity], result of:
      0.05484362 = score(doc=2930,freq=2.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.46604872 = fieldWeight in 2930, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.109375 = fieldNorm(doc=2930)
  0.14285715 = coord(1/7)

Theme

Computer Based Training

0.007834803 = product of:
  0.05484362 = sum of:
    0.05484362 = weight(_text_:based in 4713) [ClassicSimilarity], result of:
      0.05484362 = score(doc=4713,freq=2.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.46604872 = fieldWeight in 4713, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.109375 = fieldNorm(doc=4713)
  0.14285715 = coord(1/7)

0.007834803 = product of:
  0.05484362 = sum of:
    0.05484362 = weight(_text_:based in 4715) [ClassicSimilarity], result of:
      0.05484362 = score(doc=4715,freq=2.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.46604872 = fieldWeight in 4715, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.109375 = fieldNorm(doc=4715)
  0.14285715 = coord(1/7)

0.007834803 = product of:
  0.05484362 = sum of:
    0.05484362 = weight(_text_:based in 2737) [ClassicSimilarity], result of:
      0.05484362 = score(doc=2737,freq=2.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.46604872 = fieldWeight in 2737, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.109375 = fieldNorm(doc=2737)
  0.14285715 = coord(1/7)

Theme

Computer Based Training

0.007834803 = product of:
  0.05484362 = sum of:
    0.05484362 = weight(_text_:based in 4568) [ClassicSimilarity], result of:
      0.05484362 = score(doc=4568,freq=2.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.46604872 = fieldWeight in 4568, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.109375 = fieldNorm(doc=4568)
  0.14285715 = coord(1/7)

0.007834803 = product of:
  0.05484362 = sum of:
    0.05484362 = weight(_text_:based in 6132) [ClassicSimilarity], result of:
      0.05484362 = score(doc=6132,freq=2.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.46604872 = fieldWeight in 6132, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.109375 = fieldNorm(doc=6132)
  0.14285715 = coord(1/7)

0.007834803 = product of:
  0.05484362 = sum of:
    0.05484362 = weight(_text_:based in 6802) [ClassicSimilarity], result of:
      0.05484362 = score(doc=6802,freq=2.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.46604872 = fieldWeight in 6802, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.109375 = fieldNorm(doc=6802)
  0.14285715 = coord(1/7)

0.007834803 = product of:
  0.05484362 = sum of:
    0.05484362 = weight(_text_:based in 433) [ClassicSimilarity], result of:
      0.05484362 = score(doc=433,freq=2.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.46604872 = fieldWeight in 433, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.109375 = fieldNorm(doc=433)
  0.14285715 = coord(1/7)

0.0077544437 = product of:
  0.054281104 = sum of:
    0.054281104 = weight(_text_:based in 4721) [ClassicSimilarity], result of:
      0.054281104 = score(doc=4721,freq=6.0), product of:
        0.11767787 = queryWeight, product of:
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.03905679 = queryNorm
        0.4612686 = fieldWeight in 4721, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.0129938 = idf(docFreq=5906, maxDocs=44218)
          0.0625 = fieldNorm(doc=4721)
  0.14285715 = coord(1/7)

Abstract

Presents a 3 facet adaptive authoring model for online hypermedia information systems. It provides spatial reconfiguration of the presentation objects based on activation frequency, information content customization based on author specified criteria, and hypergraphic network optimization based on usage. Discusses the theory underlying the model, its architecture and hypermedia structure, and provides a preliminary quantitative measure and evaluation of its impact on authoring time, as well as study time