Search (53 results, page 1 of 3)

0.09864769 = product of:
  0.24661922 = sum of:
    0.19719799 = weight(_text_:objects in 3968) [ClassicSimilarity], result of:
      0.19719799 = score(doc=3968,freq=6.0), product of:
        0.3231294 = queryWeight, product of:
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.060794935 = queryNorm
        0.6102756 = fieldWeight in 3968, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.046875 = fieldNorm(doc=3968)
    0.049421243 = weight(_text_:22 in 3968) [ClassicSimilarity], result of:
      0.049421243 = score(doc=3968,freq=2.0), product of:
        0.2128935 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.060794935 = 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.4 = coord(2/5)

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.056797888 = product of:
  0.28398943 = sum of:
    0.28398943 = weight(_text_:thesaurus in 4713) [ClassicSimilarity], result of:
      0.28398943 = score(doc=4713,freq=4.0), product of:
        0.28093818 = queryWeight, product of:
          4.6210785 = idf(docFreq=1182, maxDocs=44218)
          0.060794935 = queryNorm
        1.0108609 = fieldWeight in 4713, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.6210785 = idf(docFreq=1182, maxDocs=44218)
          0.109375 = fieldNorm(doc=4713)
  0.2 = coord(1/5)

Theme

Konzeption und Anwendung des Prinzips Thesaurus

0.04490267 = product of:
  0.22451335 = sum of:
    0.22451335 = weight(_text_:thesaurus in 379) [ClassicSimilarity], result of:
      0.22451335 = score(doc=379,freq=10.0), product of:
        0.28093818 = queryWeight, product of:
          4.6210785 = idf(docFreq=1182, maxDocs=44218)
          0.060794935 = queryNorm
        0.7991557 = fieldWeight in 379, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          4.6210785 = idf(docFreq=1182, maxDocs=44218)
          0.0546875 = fieldNorm(doc=379)
  0.2 = coord(1/5)

Abstract

Shows the possibilities that exist to create a basic hypertext interface for a thesaurus management system. The project has been built in 3 stages: conceptual data model for the thesaurus; development of the management tools, that is, the thesaurus management system; and the hypertext interfaces. The system has been developed on Windows and combines the power of relational database management systems and the navigational flexibility of Guide, a hypertext shell. presents 2 interface models. Concludes that hypertext interfaces improve management, and open a new path for knowledge organization research

Footnote

Übers. des Titels: A hypertext interface for a thesaurus management system

Theme

Konzeption und Anwendung des Prinzips Thesaurus

0.042936392 = product of:
  0.21468195 = sum of:
    0.21468195 = weight(_text_:objects in 4572) [ClassicSimilarity], result of:
      0.21468195 = score(doc=4572,freq=4.0), product of:
        0.3231294 = queryWeight, product of:
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.060794935 = queryNorm
        0.6643839 = fieldWeight in 4572, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.0625 = fieldNorm(doc=4572)
  0.2 = coord(1/5)

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.04056992 = product of:
  0.2028496 = sum of:
    0.2028496 = weight(_text_:thesaurus in 6294) [ClassicSimilarity], result of:
      0.2028496 = score(doc=6294,freq=4.0), product of:
        0.28093818 = queryWeight, product of:
          4.6210785 = idf(docFreq=1182, maxDocs=44218)
          0.060794935 = queryNorm
        0.7220435 = fieldWeight in 6294, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.6210785 = idf(docFreq=1182, maxDocs=44218)
          0.078125 = fieldNorm(doc=6294)
  0.2 = coord(1/5)

Footnote

Übers. d. Titels: The use of associative relations specified in a thesaurus to define hypertext links

Theme

Konzeption und Anwendung des Prinzips Thesaurus

0.040162172 = product of:
  0.20081085 = sum of:
    0.20081085 = weight(_text_:thesaurus in 5096) [ClassicSimilarity], result of:
      0.20081085 = score(doc=5096,freq=8.0), product of:
        0.28093818 = queryWeight, product of:
          4.6210785 = idf(docFreq=1182, maxDocs=44218)
          0.060794935 = queryNorm
        0.7147866 = fieldWeight in 5096, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          4.6210785 = idf(docFreq=1182, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5096)
  0.2 = coord(1/5)

Abstract

Part of a special issue on hypertext and information retrieval. Conventional information retrieval systems provide little support for browsing. Browsing is the major method of searching in hypertext system but users can become disoriented even when browsing small information space. If hypertext is to be used to support browsing in bibliographic databases navigational assistance will be required. Examines the role of thesauri as navigational aids for subject domains of Bibliographic databases. Presents the design of an experimental hypertext-based browsing inference for a thesaurus and its implementation using a commercially available hypertext program. Examines strategies for linking the thesaurus to a database

Theme

Konzeption und Anwendung des Prinzips Thesaurus

0.0394396 = product of:
  0.19719799 = sum of:
    0.19719799 = weight(_text_:objects in 764) [ClassicSimilarity], result of:
      0.19719799 = score(doc=764,freq=6.0), product of:
        0.3231294 = queryWeight, product of:
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.060794935 = queryNorm
        0.6102756 = fieldWeight in 764, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.046875 = fieldNorm(doc=764)
  0.2 = coord(1/5)

Abstract

Although the object-oriente paradigm is well suited for modelling self-contained independent objects, it is not suited for modelling persistent relations (static links) between abstract data objects. At the same time, the concept of computer-navigable links is an integral part of hypermedia paradigm. In contrast to multimedia, where the object-oriented paradigm plays a leading role, the 'static link' deficiency considerably reduces the application of object-oriented methods in hypermedia. Presents a new logical data model (the HM Data Model) which incorporates the well-known principles of object-oriented data modelling into the management of large-scale, multi-user hypermedia databases. The model is based on the notion of abstract hypermedia data objects called S-collections. Computer-navigable links approach not only overcomes the static link deficiency of the object-oriented paradigm, but also supports modularity, incremental development, and flexible versioning, and provides a solid logical basis for sematic modelling

0.037569344 = product of:
  0.18784672 = sum of:
    0.18784672 = weight(_text_:objects in 7658) [ClassicSimilarity], result of:
      0.18784672 = score(doc=7658,freq=4.0), product of:
        0.3231294 = queryWeight, product of:
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.060794935 = queryNorm
        0.5813359 = fieldWeight in 7658, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.0546875 = fieldNorm(doc=7658)
  0.2 = coord(1/5)

Abstract

The C(K)onstance Hypertext System (KHS) is an elaborated example of an open hypertext system. Open hypertext systems combine heterogeneous resources and different hypertext applications such as e-mail, text and image hypertexts with access to online databases or other information resources. These hypertexts, to which heterogeneous users have access, grow steadily in size. This paper takes an object-oriented approach and proposes a rigorous typing of hypertext objects to overcome the problems of open hypertext. The advantage of this typing is shown on an e-mail hypertext as a special application of the KHS system. KHS is written in Smalltalk and is being developed on UNIX-machines

0.03286633 = product of:
  0.16433164 = sum of:
    0.16433164 = weight(_text_:objects in 7493) [ClassicSimilarity], result of:
      0.16433164 = score(doc=7493,freq=6.0), product of:
        0.3231294 = queryWeight, product of:
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.060794935 = queryNorm
        0.508563 = fieldWeight in 7493, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.0390625 = fieldNorm(doc=7493)
  0.2 = coord(1/5)

Abstract

In important stage in the process of retrieval of objects from a hypertext database is the creation of a set of inter-nodal links that are intended to represent the relationships existing between objects; this operation is often undertaken manually, just as index terms are often manually assigned to documents in a conventional retrieval system. Studies of conventional systems have suggested that a degree of consistency in the terms assigned to documents by indexers is positively associated with retrieval effectiveness. It is thus of interest to investigate the consistency of assignment of links in separate hypertext versions of the same full-text document, since a measure of agreement may be related to the subsequent utility of the resulting hypertext databases. The calculation of values indicating the degree of similarity between objects is a technique that has been widely used in the fields of textual and chemical information retrieval; in this paper we describe the application of arithmetic coefficients and topological indices to the measurement of the degree of similarity between the sets of inter-nodal links in hypertext databases. We publish the results of a study in which several different of links are inserted, by different people, between the paragraphs of each of a number of full-text documents. Our results show little similary between the sets of links identified by different people; this finding is comparable with those of studies of inter-indexer consistency, where it has been found that there is generally only a low level of agreement between the sets of idenx terms assigned to a document by different indexers

0.032455932 = product of:
  0.16227967 = sum of:
    0.16227967 = weight(_text_:thesaurus in 4892) [ClassicSimilarity], result of:
      0.16227967 = score(doc=4892,freq=4.0), product of:
        0.28093818 = queryWeight, product of:
          4.6210785 = idf(docFreq=1182, maxDocs=44218)
          0.060794935 = queryNorm
        0.5776348 = fieldWeight in 4892, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.6210785 = idf(docFreq=1182, maxDocs=44218)
          0.0625 = fieldNorm(doc=4892)
  0.2 = coord(1/5)

Abstract

Explores the strengths and limitations of hypertext for the online presentation of thesauri used in information retrieval. Examines the ability of hypertext to support each of 3 common types of thesaurus display: graphic, alphabetical, and hierarchical. Presents a design for a hypertext-based hierarchical display that addresses many inadequacies of printed hierarchical displays. Ullustrates how the design might be implemented using a commercially available hypertext system. Considers issues related to the implementation and evaluation of hypertext-based thesauri

Theme

Konzeption und Anwendung des Prinzips Thesaurus

0.032202296 = product of:
  0.16101147 = sum of:
    0.16101147 = weight(_text_:objects in 5935) [ClassicSimilarity], result of:
      0.16101147 = score(doc=5935,freq=4.0), product of:
        0.3231294 = queryWeight, product of:
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.060794935 = queryNorm
        0.49828792 = fieldWeight in 5935, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.046875 = fieldNorm(doc=5935)
  0.2 = coord(1/5)

Abstract

Most existing hypermedia authoring systems are intended for use on desktop computers. These systems are typically designed for the creation of 2D documents and therefore employ 2D authoring mechanisms. In contrast, authoring systems for nontraditional multimedia/hypermedia experiences for 3D virtual or augmented worlds focus mainly on creating separate media objects and embedding them within the user's surroundings. As a result, linking these media objects to create 3D hypermedia is a tedious manual task. To address this issue, we present an authoring tool for creating and editing linked 3D hypermedia narratives that are interwoven with a wearable computer user's surrounding environment. Our system is designed for use by authors who are not programmers, and allows them to preview their results on a desktop workstation, as well as with an augmented or virtual reality system.

0.030360613 = product of:
  0.15180306 = sum of:
    0.15180306 = weight(_text_:objects in 4920) [ClassicSimilarity], result of:
      0.15180306 = score(doc=4920,freq=2.0), product of:
        0.3231294 = queryWeight, product of:
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.060794935 = queryNorm
        0.46979034 = fieldWeight in 4920, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.0625 = fieldNorm(doc=4920)
  0.2 = coord(1/5)

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.030360613 = product of:
  0.15180306 = sum of:
    0.15180306 = weight(_text_:objects in 6497) [ClassicSimilarity], result of:
      0.15180306 = score(doc=6497,freq=2.0), product of:
        0.3231294 = queryWeight, product of:
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.060794935 = queryNorm
        0.46979034 = fieldWeight in 6497, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.0625 = fieldNorm(doc=6497)
  0.2 = coord(1/5)

Abstract

Provides definitions of hypertext, multimedia and hypermedia. Discusses the advantages and disadvantages of hypermedia systems. Outlines a knowledge based approach in developing a hypermedia system using frames (objects), slots and relations between them. Inheritance is used to project features from one object to another. Discusses the presentation of information. Compares hypermedia and databases. Examines the reading and processing of hypermedia information according to the interaction method; structural responsibility and the extent of orientation

0.030360613 = product of:
  0.15180306 = sum of:
    0.15180306 = weight(_text_:objects in 4721) [ClassicSimilarity], result of:
      0.15180306 = score(doc=4721,freq=2.0), product of:
        0.3231294 = queryWeight, product of:
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.060794935 = queryNorm
        0.46979034 = fieldWeight in 4721, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.0625 = fieldNorm(doc=4721)
  0.2 = coord(1/5)

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

0.030360613 = product of:
  0.15180306 = sum of:
    0.15180306 = weight(_text_:objects in 5870) [ClassicSimilarity], result of:
      0.15180306 = score(doc=5870,freq=2.0), product of:
        0.3231294 = queryWeight, product of:
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.060794935 = queryNorm
        0.46979034 = fieldWeight in 5870, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.0625 = fieldNorm(doc=5870)
  0.2 = coord(1/5)

Abstract

Examines the use of hypertexts as a tool to present educational material by projecting its nodes. The reader becomes a spectator who is passively subject to the navigation effected by the speaker. The author extends his influence to the reading process by navigating according to his own requirements. Presents a prototype developed specifically to increase the efficiency of a hypertext used for this form of communication, allowing the teacher to choose which objects will be projected and when they will appear

0.028398944 = product of:
  0.14199471 = sum of:
    0.14199471 = weight(_text_:thesaurus in 3259) [ClassicSimilarity], result of:
      0.14199471 = score(doc=3259,freq=4.0), product of:
        0.28093818 = queryWeight, product of:
          4.6210785 = idf(docFreq=1182, maxDocs=44218)
          0.060794935 = queryNorm
        0.50543046 = fieldWeight in 3259, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.6210785 = idf(docFreq=1182, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3259)
  0.2 = coord(1/5)

Abstract

When designing hypertext structure the folowing must be considered: semantic structure of the presented knowledge, strucutre for the user considering his information needs, knowledge and the way he will use the hypertext to access information; and rhetoric structure. Non-hierarchical links between hypertext nodes created on the basis of extralinguistic non-specified associative relations might cause a decrease in recall and retrieval of information. In order to leiminate such defects, suggests the implementation of specified associative relations marked in the thesaurus to define adequate associative links in the hypertext

Footnote

Übers. d. Titels: The implementation of the specified in thesaurus associative relations to define hypertext links

0.026565535 = product of:
  0.13282767 = sum of:
    0.13282767 = weight(_text_:objects in 1431) [ClassicSimilarity], result of:
      0.13282767 = score(doc=1431,freq=2.0), product of:
        0.3231294 = queryWeight, product of:
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.060794935 = queryNorm
        0.41106653 = fieldWeight in 1431, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1431)
  0.2 = coord(1/5)

Abstract

Large hypertext systems have been many benefits but can be difficult to build and use. To help overcome these obstacles, a method under development at Hewlett-Packard assists authors in creating usable hypertext. A Wizard of Oz experiment, to see what users liked and disliked, showed the need for a set of hypertext construction rules to ensure usability. Following these rules, and with computer assistance, authors are expected to do a tasks analysis of users' activities, to identify critical objects and create content nodes for them, to create links between nodes within clearly defined and cognitively justified limits, and to conduct usability tests on the resulting hypertext volume. The authoring system described has been developed for the HP help system, which has been adopted as the common help delivery system for developers of Common Open Systems Environment on Unix-like platforms

0.026565535 = product of:
  0.13282767 = sum of:
    0.13282767 = weight(_text_:objects in 4959) [ClassicSimilarity], result of:
      0.13282767 = score(doc=4959,freq=2.0), product of:
        0.3231294 = queryWeight, product of:
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.060794935 = queryNorm
        0.41106653 = fieldWeight in 4959, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4959)
  0.2 = coord(1/5)

Abstract

The concept of a system combining information in both textual and pictorial format was first suggested by Vannevar Bush in 1945. The present hypermedia system was originally developed by Tim Berners Lee at CERN in 1989 and provides access to brief documents, which are interlinked and contain text, images, sound and video. The system has become widely available through the WWW, which enables users to 'navigate' through related information. Recent developments include the ability to view objects in virtual reality and the automatic generation of document links

0.026565535 = product of:
  0.13282767 = sum of:
    0.13282767 = weight(_text_:objects in 48) [ClassicSimilarity], result of:
      0.13282767 = score(doc=48,freq=2.0), product of:
        0.3231294 = queryWeight, product of:
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.060794935 = queryNorm
        0.41106653 = fieldWeight in 48, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.0546875 = fieldNorm(doc=48)
  0.2 = coord(1/5)

Abstract

Current hypertext systems have been widely and effectively used on relatively small data volumes. Explores the potential of database technology for aiding the implementation of hypertext systems holding very large amounts of complex data. Databases meet many requirements of the hypermedium: persistent data management, large volumes, data modelling, multi-level architecture with abstractions and views, metadata integrated with operational data, short-term transaction processing and high-level end-user languages for searching and updating data. Describes a system implementing the storage, retrieval and recall of trails through hypertext comprising textual complex objects (to illustrate the potential for the use of data bases). Discusses weaknesses in current database systems for handling the complex modelling required

0.026565535 = product of:
  0.13282767 = sum of:
    0.13282767 = weight(_text_:objects in 150) [ClassicSimilarity], result of:
      0.13282767 = score(doc=150,freq=2.0), product of:
        0.3231294 = queryWeight, product of:
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.060794935 = queryNorm
        0.41106653 = fieldWeight in 150, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.0546875 = fieldNorm(doc=150)
  0.2 = coord(1/5)

Abstract

Introduces what automatic authoring of a hypertext for information retrieval means. The most difficult part of the automatic construction of a hypertext is the creation of links connecting documents or document fragments that are related. Becaus of this, to many researchers it seemed natural to use information retrieval techniques for this purpose, since information retrieval has always dealt with the construction of relationships between objects mutually relevant. Presents a survey of some of the attempts toward the automatic construction of hypertexts for information retrieval. Identifies and compares scope, advantages and limitations of different approaches. Points out the main and most successful current lines of research