Search (79 results, page 2 of 4)

0.02000121 = product of:
  0.08000484 = sum of:
    0.08000484 = weight(_text_:search in 3839) [ClassicSimilarity], result of:
      0.08000484 = score(doc=3839,freq=6.0), product of:
        0.17183559 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.049439456 = 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.25 = coord(1/4)

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.018663906 = product of:
  0.07465562 = sum of:
    0.07465562 = weight(_text_:search in 4920) [ClassicSimilarity], result of:
      0.07465562 = score(doc=4920,freq=4.0), product of:
        0.17183559 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.049439456 = 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.25 = coord(1/4)

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.018663906 = product of:
  0.07465562 = sum of:
    0.07465562 = weight(_text_:search in 6511) [ClassicSimilarity], result of:
      0.07465562 = score(doc=6511,freq=4.0), product of:
        0.17183559 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.049439456 = 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.25 = coord(1/4)

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.01763386 = product of:
  0.07053544 = sum of:
    0.07053544 = weight(_text_:web in 650) [ClassicSimilarity], result of:
      0.07053544 = score(doc=650,freq=6.0), product of:
        0.16134618 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.049439456 = queryNorm
        0.43716836 = fieldWeight in 650, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0546875 = fieldNorm(doc=650)
  0.25 = coord(1/4)

Abstract

Purpose - The purpose of this paper is to explore the application of post-structuralist theory to understanding hypertext and the World Wide Web, and the challenge posed by digital information technology to the practices of the information profession. Design/methodology/approach - The method adopted is that of a critical study. Findings - The paper argues for the importance of post-structuralism for an understanding of the implications of digital information for the information management profession. Originality/value - Focuses on an epistemological gap between the traditional practices of the information profession, and the structure of the World Wide Web.

0.017452994 = product of:
  0.06981198 = sum of:
    0.06981198 = weight(_text_:web in 60) [ClassicSimilarity], result of:
      0.06981198 = score(doc=60,freq=2.0), product of:
        0.16134618 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.049439456 = queryNorm
        0.43268442 = fieldWeight in 60, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.09375 = fieldNorm(doc=60)
  0.25 = coord(1/4)

0.017452994 = product of:
  0.06981198 = sum of:
    0.06981198 = weight(_text_:web in 5456) [ClassicSimilarity], result of:
      0.06981198 = score(doc=5456,freq=2.0), product of:
        0.16134618 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.049439456 = queryNorm
        0.43268442 = fieldWeight in 5456, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.09375 = fieldNorm(doc=5456)
  0.25 = coord(1/4)

0.017143894 = product of:
  0.068575576 = sum of:
    0.068575576 = weight(_text_:search in 4873) [ClassicSimilarity], result of:
      0.068575576 = score(doc=4873,freq=6.0), product of:
        0.17183559 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.049439456 = 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.25 = coord(1/4)

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.016496718 = product of:
  0.06598687 = sum of:
    0.06598687 = weight(_text_:search in 2779) [ClassicSimilarity], result of:
      0.06598687 = score(doc=2779,freq=8.0), product of:
        0.17183559 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.049439456 = 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.25 = coord(1/4)

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.016496718 = product of:
  0.06598687 = sum of:
    0.06598687 = weight(_text_:search in 6937) [ClassicSimilarity], result of:
      0.06598687 = score(doc=6937,freq=8.0), product of:
        0.17183559 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.049439456 = 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.25 = coord(1/4)

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.016454842 = product of:
  0.06581937 = sum of:
    0.06581937 = weight(_text_:web in 5192) [ClassicSimilarity], result of:
      0.06581937 = score(doc=5192,freq=4.0), product of:
        0.16134618 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.049439456 = queryNorm
        0.4079388 = fieldWeight in 5192, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0625 = fieldNorm(doc=5192)
  0.25 = coord(1/4)

Abstract

At a finer level, Amitay speculates about the use of language on the Web. The Web may be one large corpus of text, but she suggests that communities will express themselves by the conventions used for writing hypertext. It may be that new information technologies will spawn new communities.

0.016330918 = product of:
  0.06532367 = sum of:
    0.06532367 = weight(_text_:search in 1375) [ClassicSimilarity], result of:
      0.06532367 = score(doc=1375,freq=4.0), product of:
        0.17183559 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.049439456 = 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.25 = coord(1/4)

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.015114739 = product of:
  0.060458954 = sum of:
    0.060458954 = weight(_text_:web in 2795) [ClassicSimilarity], result of:
      0.060458954 = score(doc=2795,freq=6.0), product of:
        0.16134618 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.049439456 = queryNorm
        0.37471575 = fieldWeight in 2795, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.046875 = fieldNorm(doc=2795)
  0.25 = coord(1/4)

Abstract

The Multimedia Information Presentation System (MIPS) will allow end users to browse multimedia information presented in a user friendly and consistent manner. In its most powerful configuration, it will allow the end user to formulate queires which are interpreted, analyzed, and dispatched by the system to heterogeneous distributed external data sources, and to view a coherent and customized presentation of the data retrieved as answers. Data are stored in, or referenced from, a set of hyperdocuments conforming to the ISO standards HyTime and SGML. The hyperdocuments constitute an information web which may be dynamically expanded to accomodate retrieved data. The web navigation structure, structure of information nodes, specification of presentation mechanisms, specification of presentation tools, and data are separable and potentially reusable for different applications, different activities within an application, or different environments. Outlines the intended functionality and the design of MIPS, with particular reference to the structure and function of the hypermedia web and the role of the knowledge base system module in its dynamic expansion

0.015114739 = product of:
  0.060458954 = sum of:
    0.060458954 = weight(_text_:web in 1068) [ClassicSimilarity], result of:
      0.060458954 = score(doc=1068,freq=6.0), product of:
        0.16134618 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.049439456 = queryNorm
        0.37471575 = fieldWeight in 1068, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.046875 = fieldNorm(doc=1068)
  0.25 = coord(1/4)

Abstract

Interactive dynamic maps (IDMs) help users interactively explore webs of hypermedia documents. IDMs provide automatically generated abstract graphical views at different levels of granularity. Visual cues give users a better understanding of the content of the web, which results in better navigation control and more accurate and effective expressions of queries. IDMs consist of: topic maps, which provide visual abstractions of the semantic content of a web documents and document maps, which provide visual abstractions of subsets of documents. The major contribution of this work include: automatique techniques for building maps directly from a web of documents, including extraction of semantic content and use of a spatial metaphor for generating layout and filing space, a direct manipulation interaction paradigm for exploring webs of documents, using maps and an integrated graphical query language, and the ability to use the maps themselves as documents that can be customized, stored in a library and shared among users

0.014544163 = product of:
  0.05817665 = sum of:
    0.05817665 = weight(_text_:web in 4535) [ClassicSimilarity], result of:
      0.05817665 = score(doc=4535,freq=2.0), product of:
        0.16134618 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.049439456 = queryNorm
        0.36057037 = fieldWeight in 4535, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.078125 = fieldNorm(doc=4535)
  0.25 = coord(1/4)

0.014397987 = product of:
  0.05759195 = sum of:
    0.05759195 = weight(_text_:web in 3966) [ClassicSimilarity], result of:
      0.05759195 = score(doc=3966,freq=4.0), product of:
        0.16134618 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.049439456 = queryNorm
        0.35694647 = fieldWeight in 3966, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3966)
  0.25 = coord(1/4)

Abstract

A materialized hypertext view is a hypertext containing data coming from a database and whose pages are stored in files. A Web site presenting data coming from a database is an example of such a view, where the hypertext pages are HTML files. Even if the most popular approach to the generation of such sites is the virtual one, there is also a rationale for a materialized apporach. This paper deals with the maintenance issues required by these derived hypertext to enforce consistency between page content and database state

Source

The World Wide Web and Databases: International Workshop WebDB'98, Valencia, Spain, March 27-28, 1998, Selected papers. Eds.: P. Atzeni et al

0.0131973745 = product of:
  0.052789498 = sum of:
    0.052789498 = weight(_text_:search in 3317) [ClassicSimilarity], result of:
      0.052789498 = score(doc=3317,freq=2.0), product of:
        0.17183559 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.049439456 = 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.25 = coord(1/4)

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

0.0131973745 = product of:
  0.052789498 = sum of:
    0.052789498 = weight(_text_:search in 4452) [ClassicSimilarity], result of:
      0.052789498 = score(doc=4452,freq=2.0), product of:
        0.17183559 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.049439456 = queryNorm
        0.30720934 = fieldWeight in 4452, 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=4452)
  0.25 = coord(1/4)

Abstract

The emphasis in most hypertext systems is on the navigational methods, rather than on the global document retrieval mechanisms. When a search mechanism is provided, it is often restricted to simple string matching or to the Boolean model (as an alternate method). proposes a retrieval mechanism using Bayesian inference networks. The main contribution of this approach is the automatic construction of this network using the expected mutual information measure to build the inference tree, and using Jaccard's formula to define fixed conditional probability relationships

0.0131973745 = product of:
  0.052789498 = sum of:
    0.052789498 = weight(_text_:search in 4572) [ClassicSimilarity], result of:
      0.052789498 = score(doc=4572,freq=2.0), product of:
        0.17183559 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.049439456 = queryNorm
        0.30720934 = fieldWeight in 4572, 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=4572)
  0.25 = coord(1/4)

Abstract

HIFI (ESPRIT project 6532) creates a set of tools to allow a reader to access a large body of heterogeneous information, managed by external databases created beforehand, through a hypertext interface. The HIFI approach is a model-based description of the hypertext application as it appears to the reader. A declarative and/or operational mapping translates hypertext operations (search, queries and navigation) into operations on the underlying information base and also 'materialises' hypertext objects, using objects of the underlying databases. The system supports hypertext development. Illustrates this with the cooperation of end users as partners or project sponsors

0.0131973745 = product of:
  0.052789498 = sum of:
    0.052789498 = weight(_text_:search in 4805) [ClassicSimilarity], result of:
      0.052789498 = score(doc=4805,freq=2.0), product of:
        0.17183559 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.049439456 = queryNorm
        0.30720934 = fieldWeight in 4805, 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=4805)
  0.25 = coord(1/4)

Abstract

Hypertext for multi-media and full-text documents is rapidly developed on all fronts. For bibliographic information retrieval the applications are promising but pose several difficulties. Describes work conducted at the School of Library and Information Science at Univ. of Western Ontario the objective of which is to add the capability of a browsing search to an existing OPAC through the use of Windowed Hypertext Interface for Zippy Retrieval and Display (WHIZRD) software. Discusses the underlying retrieval capabilities of the system. Examines design problems and solutions and outlines future enhancements

0.0131973745 = product of:
  0.052789498 = sum of:
    0.052789498 = weight(_text_:search in 5085) [ClassicSimilarity], result of:
      0.052789498 = score(doc=5085,freq=2.0), product of:
        0.17183559 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.049439456 = queryNorm
        0.30720934 = fieldWeight in 5085, 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=5085)
  0.25 = coord(1/4)

Abstract

Reviews SmarText from Lotus Development Co. which creates and retrieves electronically stored reference materials and documents. The software builder automatically analyzes electronic versions of documents assembles its own outlines and indexes and establishes hypertext links between text and illustrations. Documents can be searched either by browsing through the text, using the outline to find a specific section, or selecting from the index. A Boolean search feature allows searching for combinations of terms. Examines the strengths and weaknesses of the program. Smartext is best suited to documents developed internally or in the public domain because of copyright law