Search (57 results, page 1 of 3)

0.089736 = product of:
  0.13460399 = sum of:
    0.10735885 = weight(_text_:search in 187) [ClassicSimilarity], result of:
      0.10735885 = score(doc=187,freq=8.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.6144187 = fieldWeight in 187, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0625 = fieldNorm(doc=187)
    0.027245143 = product of:
      0.054490287 = sum of:
        0.054490287 = weight(_text_:22 in 187) [ClassicSimilarity], result of:
          0.054490287 = score(doc=187,freq=2.0), product of:
            0.17604718 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05027291 = 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.6666667 = coord(2/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

0.053949714 = product of:
  0.08092457 = sum of:
    0.053679425 = weight(_text_:search in 3594) [ClassicSimilarity], result of:
      0.053679425 = score(doc=3594,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.30720934 = fieldWeight in 3594, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0625 = fieldNorm(doc=3594)
    0.027245143 = product of:
      0.054490287 = sum of:
        0.054490287 = weight(_text_:22 in 3594) [ClassicSimilarity], result of:
          0.054490287 = score(doc=3594,freq=2.0), product of:
            0.17604718 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05027291 = 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.6666667 = coord(2/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

0.04626411 = product of:
  0.06939616 = sum of:
    0.03354964 = weight(_text_:search in 1427) [ClassicSimilarity], result of:
      0.03354964 = score(doc=1427,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.19200584 = fieldWeight in 1427, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1427)
    0.03584652 = product of:
      0.07169304 = sum of:
        0.07169304 = weight(_text_:engines in 1427) [ClassicSimilarity], result of:
          0.07169304 = score(doc=1427,freq=2.0), product of:
            0.25542772 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.05027291 = queryNorm
            0.2806784 = fieldWeight in 1427, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1427)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

Fast, effective, and adaptable techniques are needed to automatically organize and retrieve information an the ever-increasing World Wide Web. In that respect, different strategies have been suggested to take hypertext links into account. For example, hyperlinks have been used to (1) enhance document representation, (2) improve document ranking by propagating document score, (3) provide an indicator of popularity, and (4) find hubs and authorities for a given topic. Although the TREC experiments have not demonstrated the usefulness of hyperlinks for retrieval, the hypertext structure is nevertheless an essential aspect of the Web, and as such, should not be ignored. The development of abstract models of the IR task was a key factor to the improvement of search engines. However, at this time conceptual tools for modeling the hypertext retrieval task are lacking, making it difficult to compare, improve, and reason an the existing techniques. This article proposes a general model for using hyperlinks based an Probabilistic Argumentation Systems, in which each of the above-mentioned techniques can be stated. This model will allow to discover some inconsistencies in the mentioned techniques, and to take a higher level and systematic approach for using hyperlinks for retrieval.

0.04298305 = product of:
  0.064474575 = sum of:
    0.04744636 = weight(_text_:search in 7469) [ClassicSimilarity], result of:
      0.04744636 = score(doc=7469,freq=4.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.27153727 = fieldWeight in 7469, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0390625 = fieldNorm(doc=7469)
    0.017028214 = product of:
      0.03405643 = sum of:
        0.03405643 = weight(_text_:22 in 7469) [ClassicSimilarity], result of:
          0.03405643 = score(doc=7469,freq=2.0), product of:
            0.17604718 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05027291 = 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.6666667 = coord(2/3)

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.04298305 = product of:
  0.064474575 = sum of:
    0.04744636 = weight(_text_:search in 2738) [ClassicSimilarity], result of:
      0.04744636 = score(doc=2738,freq=4.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.27153727 = fieldWeight in 2738, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2738)
    0.017028214 = product of:
      0.03405643 = sum of:
        0.03405643 = weight(_text_:22 in 2738) [ClassicSimilarity], result of:
          0.03405643 = score(doc=2738,freq=2.0), product of:
            0.17604718 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05027291 = 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.6666667 = coord(2/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

0.035786286 = product of:
  0.10735885 = sum of:
    0.10735885 = weight(_text_:search in 5671) [ClassicSimilarity], result of:
      0.10735885 = score(doc=5671,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.6144187 = fieldWeight in 5671, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.125 = fieldNorm(doc=5671)
  0.33333334 = coord(1/3)

0.031630907 = product of:
  0.09489272 = sum of:
    0.09489272 = weight(_text_:search in 4875) [ClassicSimilarity], result of:
      0.09489272 = score(doc=4875,freq=4.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.54307455 = fieldWeight in 4875, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.078125 = fieldNorm(doc=4875)
  0.33333334 = coord(1/3)

Abstract

Hypermedia supports an unstructured search for information by association and enables retrieval of information in the order and to the detail required. Discusses the origings of hypermedia and examines applications of the technology in the area of financial planning. Also discusses hypermedia in the context of training and discusses its benefite to users, producers and distributors of information

0.031313002 = product of:
  0.093939 = sum of:
    0.093939 = weight(_text_:search in 193) [ClassicSimilarity], result of:
      0.093939 = score(doc=193,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.5376164 = fieldWeight in 193, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.109375 = fieldNorm(doc=193)
  0.33333334 = coord(1/3)

0.031313002 = product of:
  0.093939 = sum of:
    0.093939 = weight(_text_:search in 2758) [ClassicSimilarity], result of:
      0.093939 = score(doc=2758,freq=8.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.5376164 = fieldWeight in 2758, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2758)
  0.33333334 = coord(1/3)

Abstract

Hypertext systems provide an appealing mechanism for informally browsing databases by traversing selectable links. However, in many fact finding situations string searching is an effective complement to browsing. Describes the application of the signature file method to achieve rapid and convenient strung search in small personal computer hypertext environments. The method has been implemented to a prototype, as well as in a commercial product. Presents performance data for search times and storage space from a commercial hypertext database and discusses user interface issues. Experience with the string search interface indicates that it was used successfully by novice users

0.030007713 = product of:
  0.09002314 = sum of:
    0.09002314 = weight(_text_:search in 446) [ClassicSimilarity], result of:
      0.09002314 = score(doc=446,freq=10.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.51520574 = fieldWeight in 446, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.046875 = fieldNorm(doc=446)
  0.33333334 = coord(1/3)

Abstract

This study investigated information retrieval from hypertext on the WWW. Significant main and interaction effects were found for both link density (number of links per display) and display format (in paragraphs or lists) on search performance. Low link densities displayed in list format produced the best overall results, in terms of search accuracy, search time, number of links explored, and search task prioritization. Lower densities affected user ability to prioritize search tasks and produced more accurate searches, while list displays positively affected all aspects of searching except task prioritization. The performance of novices and experts, in terms of their previous experience browsing hypertext on the WWW, was compared. Experts performed better, mostly because of their superior task prioritization

0.027117856 = product of:
  0.08135357 = sum of:
    0.08135357 = weight(_text_:search in 8577) [ClassicSimilarity], result of:
      0.08135357 = score(doc=8577,freq=6.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.46558946 = fieldWeight in 8577, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0546875 = fieldNorm(doc=8577)
  0.33333334 = coord(1/3)

Abstract

The Konstanz-Hypertext-System (KHS) is an open hypertext system which employs internal and external information sources to satisfy the user's need for information when navigating through a hypertext. E-mail, Gopher and online databases are available in KHS as external information sources. The main tasks which must be carried out during an online search are analysis of the question, selection of the databases, formulation of a search strategy, online search, feedback and the presentation of the results. All of these tasks are supported within KHS, but special emphasis is given to database selection. Introduces a new method for selecting relevant online databases with KHS using the database descriptions from several hosts

0.027117856 = product of:
  0.08135357 = sum of:
    0.08135357 = weight(_text_:search in 3839) [ClassicSimilarity], result of:
      0.08135357 = score(doc=3839,freq=6.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.46558946 = fieldWeight in 3839, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3839)
  0.33333334 = coord(1/3)

Abstract

Presents a new way to tackle the well known 'getting lost sydrome' in hypertext systems by using expertext, or the integration of expert systems with hypertext. Focuses on automatic users' guidance. Presents intelligent Automatic Search Guidance which applies a frame-based representation scheme and object oriented techniques to incorporate an intelligent thesaurus into a meta system for powerful search guidance. It also integrates any specific knowledge that is stored in the information scientist's expertise, terms similarity, and any other data that was gathered in past research trials

0.025304725 = product of:
  0.075914174 = sum of:
    0.075914174 = weight(_text_:search in 4920) [ClassicSimilarity], result of:
      0.075914174 = score(doc=4920,freq=4.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.43445963 = fieldWeight in 4920, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0625 = fieldNorm(doc=4920)
  0.33333334 = coord(1/3)

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

0.025304725 = product of:
  0.075914174 = sum of:
    0.075914174 = weight(_text_:search in 6511) [ClassicSimilarity], result of:
      0.075914174 = score(doc=6511,freq=4.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.43445963 = fieldWeight in 6511, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0625 = fieldNorm(doc=6511)
  0.33333334 = coord(1/3)

Abstract

In most hypertext systems, information retrieval techniques emphasize browsing or navigational methods which are not thorough enough to find all relevant material, especially when the number of nodes and/or links becomes very large. Reviews the main query-based search techniques currently used in hypertext environments. Explains the experimental methodology. Concentrates on the retrieval effectiveness of these retrieval strategies. Considers ways of improving search effectiveness

0.023243874 = product of:
  0.06973162 = sum of:
    0.06973162 = weight(_text_:search in 4873) [ClassicSimilarity], result of:
      0.06973162 = score(doc=4873,freq=6.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.39907667 = fieldWeight in 4873, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.046875 = fieldNorm(doc=4873)
  0.33333334 = coord(1/3)

Abstract

As part of ongoing investigation of information seeking behaviour of end users in electronic environments, a comparison was made of those users having expertise in a topic area and those with expertise in online searching. Computer scientists and online search specialists conducted assigned searches in a HyperCard database on the topic of hypertext. Both groups of experts were able to conduct successful searches and outperformed a novice control group. Search specialists took slightly less time tahn the domain experts, modified queries by adding terms found in the text, and tended to focus on query formulation. Domain experts focused on the text and used their domain knowledge for further question answering

0.022366427 = product of:
  0.06709928 = sum of:
    0.06709928 = weight(_text_:search in 2779) [ClassicSimilarity], result of:
      0.06709928 = score(doc=2779,freq=8.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.3840117 = fieldWeight in 2779, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2779)
  0.33333334 = coord(1/3)

Abstract

Reports on a continuing project to study children's use of a graphically-based direct manipulation interface for science materials. The Science Library Catalogue (SLC), a component of project SEED, has been implemented in the libraries of 21 elementary schools in Los Angeles and will soon be implemented in a public library. The interface employs a hierarchical structure drawn from the DDC and implemented in HyperCard on the Macintosh. The study on the 2nd version of the interface indicates that children are able to use the Science Library Catalogue unaided, with reasonable success in finding items. Search success on the same topics on a Boolean command driven system was equivalent, but Boolean searches were faster. However, the Boolean system was more sensitive to differences in age, with 12-year-olds having significantly better success rates than 10-year-olds; and to search topic, with one set of questions being much easier to search than the other. On average, children liked the 2 systems about the same; the Boolean system was more attractive to certain age and gender combinations, while the Science Library Catalogue was more consistently liked across groups. results are compared to prior studies on the Science Library Catalogue and other online catalogues

0.022366427 = product of:
  0.06709928 = sum of:
    0.06709928 = weight(_text_:search in 6937) [ClassicSimilarity], result of:
      0.06709928 = score(doc=6937,freq=8.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.3840117 = fieldWeight in 6937, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0390625 = fieldNorm(doc=6937)
  0.33333334 = coord(1/3)

Abstract

The effects of link annotations on user search performance in hypertext environments having deep (layered) and shallow link structures were investigated in this study. Four environments were tested-layered-annotated, layered-unannotated, shallow-annotated, and shallow-unannotated. A single document was divided into 48 sections, and layered and unlayered versions were created. Additional versions were created by adding annotations to the links in the layered and unlayered versions. Subjects were given three queries of varying difficulty and then asked to find the answers to the queries that were contained within the hypertext environment to which they were randomly assigned. Correspondence between the wording links and queries was used to define difficulty level. The results of the study confirmed previous research that shallow link structures are better than deep (layered) link structures. Annotations had virtually no effect on the search performance of the subjects. The subjects performed similarly in the annotated and unannotated environments, regardless of whether the link structures were shallow or deep. An analysis of question difficulty suggests that the wording in links has primacy over the wording in annotations in influencing user search behavior.

0.022141634 = product of:
  0.0664249 = sum of:
    0.0664249 = weight(_text_:search in 1375) [ClassicSimilarity], result of:
      0.0664249 = score(doc=1375,freq=4.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.38015217 = fieldWeight in 1375, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1375)
  0.33333334 = coord(1/3)

Abstract

This paper describes the development and content of four Computer Assisted Learning packages designed to teach information skills to higher education students. The areas covered include database searching and library search skills. Educational aspects of using hypertext and hypermedia for learning are discussed along with development issues and a description is given of the staff costs involved. The main source of external funding was the Higher Education Funding Councils' Teaching and Learning Technology Programme

Content

Entwicklung an der University of Glasgow. 4 Produkte: 1. Library search skills (Toolbook); 2: Computer sources (Toolbook); 3. How to choose books and journals (Toolbook); 4. Biological abstracts (Guide)

0.01816343 = product of:
  0.054490287 = sum of:
    0.054490287 = product of:
      0.10898057 = sum of:
        0.10898057 = weight(_text_:22 in 8762) [ClassicSimilarity], result of:
          0.10898057 = score(doc=8762,freq=2.0), product of:
            0.17604718 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05027291 = 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

0.017893143 = product of:
  0.053679425 = sum of:
    0.053679425 = weight(_text_:search in 3317) [ClassicSimilarity], result of:
      0.053679425 = score(doc=3317,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.30720934 = fieldWeight in 3317, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0625 = fieldNorm(doc=3317)
  0.33333334 = coord(1/3)

Abstract

Attemps to elaborate the relationships among tasks, user types, and tools for hypertext. A computer system was built for automatically converting books into hypertext and one book converts into Emaccs-Info, Guide, HyperTies, and a variant of SuperBook, called MaxiBook. Compares the performance of 3 classes of users - expers, novices and trainees - with different tasks on these different delivery vehicles, the tasks involving one search question and one browse question