Search (44 results, page 1 of 3)

  • × theme_ss:"Hypertext"
  1. Agosti, M.; Crestani, F.; Melucci, M.: Design and implementation of a tool for the automatic construction of hypertexts for information retrieval (1996) 0.09
    0.09457025 = product of:
      0.14185537 = sum of:
        0.105127774 = weight(_text_:sites in 5571) [ClassicSimilarity], result of:
          0.105127774 = score(doc=5571,freq=2.0), product of:
            0.26002133 = queryWeight, product of:
              5.227637 = idf(docFreq=644, maxDocs=44218)
              0.049739745 = queryNorm
            0.40430441 = fieldWeight in 5571, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.227637 = idf(docFreq=644, maxDocs=44218)
              0.0546875 = fieldNorm(doc=5571)
        0.0367276 = product of:
          0.0734552 = sum of:
            0.0734552 = weight(_text_:index in 5571) [ClassicSimilarity], result of:
              0.0734552 = score(doc=5571,freq=2.0), product of:
                0.21735094 = queryWeight, product of:
                  4.369764 = idf(docFreq=1520, maxDocs=44218)
                  0.049739745 = queryNorm
                0.33795667 = fieldWeight in 5571, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  4.369764 = idf(docFreq=1520, maxDocs=44218)
                  0.0546875 = fieldNorm(doc=5571)
          0.5 = coord(1/2)
      0.6666667 = coord(2/3)
    
    Abstract
    Describes the design and implementation of TACHIR, a tool for the automatic construction of hypertexts for information retrieval. Through the use of an authoring methodology employing a set of well known information retrieval techniques, TACHIR automatically builds up a hypertext from a document collection. The structure of the hypertext reflects a 3 level conceptual model which enables navigation among documents, index terms, and concepts using automatically determined links. The hypertext is implemented using the HTML language. It can be distributed on different sites and different machines over the Internet, and it can be navigated using WWW interfaces
  2. Yang, C.C.; Liu, N.: Web site topic-hierarchy generation based on link structure (2009) 0.08
    0.08202847 = product of:
      0.1230427 = sum of:
        0.106195085 = weight(_text_:sites in 2738) [ClassicSimilarity], result of:
          0.106195085 = score(doc=2738,freq=4.0), product of:
            0.26002133 = queryWeight, product of:
              5.227637 = idf(docFreq=644, maxDocs=44218)
              0.049739745 = queryNorm
            0.40840912 = fieldWeight in 2738, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              5.227637 = idf(docFreq=644, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2738)
        0.016847622 = product of:
          0.033695243 = sum of:
            0.033695243 = weight(_text_:22 in 2738) [ClassicSimilarity], result of:
              0.033695243 = score(doc=2738,freq=2.0), product of:
                0.1741801 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.049739745 = 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
  3. E-Text : Strategien und Kompetenzen. Elektronische Kommunikation in Wissenschaft, Bildung und Beruf (2001) 0.05
    0.049034074 = product of:
      0.07355111 = sum of:
        0.06007301 = weight(_text_:sites in 622) [ClassicSimilarity], result of:
          0.06007301 = score(doc=622,freq=2.0), product of:
            0.26002133 = queryWeight, product of:
              5.227637 = idf(docFreq=644, maxDocs=44218)
              0.049739745 = queryNorm
            0.23103109 = fieldWeight in 622, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.227637 = idf(docFreq=644, maxDocs=44218)
              0.03125 = fieldNorm(doc=622)
        0.0134780975 = product of:
          0.026956195 = sum of:
            0.026956195 = weight(_text_:22 in 622) [ClassicSimilarity], result of:
              0.026956195 = score(doc=622,freq=2.0), product of:
                0.1741801 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.049739745 = queryNorm
                0.15476047 = fieldWeight in 622, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.03125 = fieldNorm(doc=622)
          0.5 = coord(1/2)
      0.6666667 = coord(2/3)
    
    Abstract
    Elektronische Produktion, Verbreitung und Rezeption von Texten - deren integrative Wechselbeziehungen eingeschlossen - verändern unausweichlich unsere Forschungs-, Lernund Arbeitsbedingungen. In diesem Wandel braucht es Orientierung, Strategien und Kompetenzen. Dieser Band bietet sie in interdisziplinärer Vielfalt. Teil 1 befaßt sich mit Wissen und Wissenschaft. Er spannt den Bogen der Medientheorie von der Antike bis ins 21. Jahrhundert und bietet einen konstruktivistischen Ansatz für das Wissensmanagement. Textsortenkonventionen und Hypertext sind ebenso Schwerpunkte wie empiriegestützte Guidelines und innovative Werkzeuge für das wissenschaftliche Arbeiten. Teil 2 ist Lernumgebungen gewidmet. Reflexionen zur Theorie von hypermedialem Lernen und Kognition werden ergänzt durch ein Produktionssystem für interaktive Software. Eine Felduntersuchungvergleicht Varianten kooperativen Schreibens, ein Schreibdidaktik-Projekt vermittelt zwischen Studium und Beruf. Teil 3 vereint unter dem Titel «Domänen der Praxis» empirische Erhebungen zur Text(re)produktion und elektronischen Kommunikation im Berufsalltag, die Konzeption eines Werkzeugs für die Übersetzungsarbeit und den Ausblick auf kulturspezifische Web-Sites in der Wirtschaft.
    Date
    12. 8.2012 18:05:22
  4. Reynolds, C.F.; Robertson, J.: Navigation requirements in large hypertext systems (1993) 0.04
    0.040048674 = product of:
      0.12014602 = sum of:
        0.12014602 = weight(_text_:sites in 6263) [ClassicSimilarity], result of:
          0.12014602 = score(doc=6263,freq=2.0), product of:
            0.26002133 = queryWeight, product of:
              5.227637 = idf(docFreq=644, maxDocs=44218)
              0.049739745 = queryNorm
            0.46206218 = fieldWeight in 6263, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.227637 = idf(docFreq=644, maxDocs=44218)
              0.0625 = fieldNorm(doc=6263)
      0.33333334 = coord(1/3)
    
    Abstract
    Most successful hypertext systems are small. The texts are either authored by a single person or written to tight standards. Examines the problems of handling large amorphous collections of research type documents with hypertext. Presents a pilot study for the Australian Heritage Commission which safeguards heritage sites that may involve conflicts of ownership and land use. An experimental hyperbase was constructed of plants and plant communities in the forest of Tasmania. Examines issues of scaling up, especially those relating to navigation through a vast hyperbase via routes never followed before. Proposes categories for Logical Information Modules and links
  5. Sindoni, G.: Incremental maintenance of hypertext views (1999) 0.04
    0.03504259 = product of:
      0.105127774 = sum of:
        0.105127774 = weight(_text_:sites in 3966) [ClassicSimilarity], result of:
          0.105127774 = score(doc=3966,freq=2.0), product of:
            0.26002133 = queryWeight, product of:
              5.227637 = idf(docFreq=644, maxDocs=44218)
              0.049739745 = queryNorm
            0.40430441 = fieldWeight in 3966, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.227637 = idf(docFreq=644, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3966)
      0.33333334 = coord(1/3)
    
    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
  6. Marchionini, G.: Designing hypertexts : start with an index (1994) 0.02
    0.024485067 = product of:
      0.0734552 = sum of:
        0.0734552 = product of:
          0.1469104 = sum of:
            0.1469104 = weight(_text_:index in 2981) [ClassicSimilarity], result of:
              0.1469104 = score(doc=2981,freq=2.0), product of:
                0.21735094 = queryWeight, product of:
                  4.369764 = idf(docFreq=1520, maxDocs=44218)
                  0.049739745 = queryNorm
                0.67591333 = fieldWeight in 2981, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  4.369764 = idf(docFreq=1520, maxDocs=44218)
                  0.109375 = fieldNorm(doc=2981)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
  7. Richy, H.: ¬A hypertext electronic index based on the Grif structured document editor (1994) 0.02
    0.024233935 = product of:
      0.072701804 = sum of:
        0.072701804 = product of:
          0.14540361 = sum of:
            0.14540361 = weight(_text_:index in 2637) [ClassicSimilarity], result of:
              0.14540361 = score(doc=2637,freq=6.0), product of:
                0.21735094 = queryWeight, product of:
                  4.369764 = idf(docFreq=1520, maxDocs=44218)
                  0.049739745 = queryNorm
                0.6689808 = fieldWeight in 2637, product of:
                  2.4494898 = tf(freq=6.0), with freq of:
                    6.0 = termFreq=6.0
                  4.369764 = idf(docFreq=1520, maxDocs=44218)
                  0.0625 = fieldNorm(doc=2637)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
    Abstract
    Grif is a structured document editor based on the generic structure concepts that supports both hierarchical structures and non hierarchical links. Defines an index and presents an electronic index service that was developed in the Grif editor by taking advantage of the hypertext facilities available in the system. discusses the main principles of the Grif system, describes indexing features with Grif and additional features
  8. Johnson, A.; Fotouhi, F.: Adaptive clustering of hypermedia documents (1996) 0.02
    0.019786924 = product of:
      0.05936077 = sum of:
        0.05936077 = product of:
          0.11872154 = sum of:
            0.11872154 = weight(_text_:index in 7437) [ClassicSimilarity], result of:
              0.11872154 = score(doc=7437,freq=4.0), product of:
                0.21735094 = queryWeight, product of:
                  4.369764 = idf(docFreq=1520, maxDocs=44218)
                  0.049739745 = queryNorm
                0.5462205 = fieldWeight in 7437, product of:
                  2.0 = tf(freq=4.0), with freq of:
                    4.0 = termFreq=4.0
                  4.369764 = idf(docFreq=1520, maxDocs=44218)
                  0.0625 = fieldNorm(doc=7437)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
    Abstract
    Compares the use of 2 adaptive algorithms (genetic algorithms, and neural networks) in clustering hypermedia documents. The clusters allow the user to index into the nodes and find information quickly. The clustering focuses on the user's paths through the hypermedia document and not on the content of the nodes or the structure of the links in the document, thus the clustering reflects the unique relationships each user sees among the nodes. The original hypermedia document remains untouched, and each user has a personalised index into this document
  9. Picking, R.: ¬A comparative study of computer-based document manipulation techniques (1994) 0.02
    0.018175451 = product of:
      0.05452635 = sum of:
        0.05452635 = product of:
          0.1090527 = sum of:
            0.1090527 = weight(_text_:index in 1491) [ClassicSimilarity], result of:
              0.1090527 = score(doc=1491,freq=6.0), product of:
                0.21735094 = queryWeight, product of:
                  4.369764 = idf(docFreq=1520, maxDocs=44218)
                  0.049739745 = queryNorm
                0.50173557 = fieldWeight in 1491, product of:
                  2.4494898 = tf(freq=6.0), with freq of:
                    6.0 = termFreq=6.0
                  4.369764 = idf(docFreq=1520, maxDocs=44218)
                  0.046875 = fieldNorm(doc=1491)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
    Abstract
    Techniques to aid the manipulation of a computer based document were tested by a group of 38 novice users. The subjects were given a period of time to browse the document, and were subsequently given a set of goal related tasks in a questionnaire/answer session. The techniques tested were sequential paging, index referral, text fins and embedded hypertext links. 3 differing types of link mechansms were assessed and compared with each other. Sequential paging and index referral were the most commonly used of the techniques. Text find was employed more for goal related tasks than for browsing. The hypertext link technique was generally unpopular, especially for goal related tasks. In order to establish the importance of the text find technique, the effect on reading strategies without this facility was also investigated. For browsing operations, an increase in paging and decrease in hypertext linking was observed. In the case of goal directed searching, an increase was observed in paging and index referral techniques. The study calls into question the usefulness of hypertext in educational software
  10. Forrester, M.: Indexing in hypertext environments : the role of user models (1995) 0.02
    0.018175451 = product of:
      0.05452635 = sum of:
        0.05452635 = product of:
          0.1090527 = sum of:
            0.1090527 = weight(_text_:index in 3830) [ClassicSimilarity], result of:
              0.1090527 = score(doc=3830,freq=6.0), product of:
                0.21735094 = queryWeight, product of:
                  4.369764 = idf(docFreq=1520, maxDocs=44218)
                  0.049739745 = queryNorm
                0.50173557 = fieldWeight in 3830, product of:
                  2.4494898 = tf(freq=6.0), with freq of:
                    6.0 = termFreq=6.0
                  4.369764 = idf(docFreq=1520, maxDocs=44218)
                  0.046875 = fieldNorm(doc=3830)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
    Abstract
    Considers the relationship between indexing and hypermedia. Conceptualizes adequate models of index structures and indexing procedures; and establishes what readers do when accessing indexes. There is a range of explicit and implicit models underlying databases, documents and indexes. A fundamental starting point for the development of substructure indexing tools for use with hypermedia is the precise specification of such models. Analysis of substructure indexing models will allow the identification of largely technical constraints and conceptual constraints. Related also are aspects of the problem deriving from how indexes can, and should be, presented. Gives a framework for the identification of such models. Examines index use. A field study was conducted looking at the use accountants make of indexing facilities an a large financial services document. Task analysis highlights the range of problems encountered, strategies employed and the kinds of solutions arrived at. There are 6 key factors underlying the 'rule of thumb' procedure users employ when interrogating an index. Discusses the implications of this study for the design of indexing within hypermedia environment
  11. Schreiweis, U.: Hypertextstrukturen als Grundlage für integrierte Wissensakquisitionssysteme (1993) 0.02
    0.017970797 = product of:
      0.05391239 = sum of:
        0.05391239 = product of:
          0.10782478 = sum of:
            0.10782478 = weight(_text_:22 in 8762) [ClassicSimilarity], result of:
              0.10782478 = score(doc=8762,freq=2.0), product of:
                0.1741801 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.049739745 = 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
  12. Scott, P.: Hypertext: information at your fingertips (1993) 0.02
    0.017489335 = product of:
      0.052468 = sum of:
        0.052468 = product of:
          0.104936 = sum of:
            0.104936 = weight(_text_:index in 6192) [ClassicSimilarity], result of:
              0.104936 = score(doc=6192,freq=2.0), product of:
                0.21735094 = queryWeight, product of:
                  4.369764 = idf(docFreq=1520, maxDocs=44218)
                  0.049739745 = queryNorm
                0.48279524 = fieldWeight in 6192, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  4.369764 = idf(docFreq=1520, maxDocs=44218)
                  0.078125 = fieldNorm(doc=6192)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
    Abstract
    HyperRez from MaxThink is discussed as is the creation of the major Internet index, HYTELNET. Reference is also made to hypertext utilities currently under development that make use of the HyperRez software
  13. Aßfalg, R.: Integration eines offenen Hypertextsystems in den Internet-Mehrwertdienst World Wide Web : ein Ansatz unter Verwendung eines objektorientierten Datenbanksystems (1996) 0.02
    0.015724447 = product of:
      0.04717334 = sum of:
        0.04717334 = product of:
          0.09434668 = sum of:
            0.09434668 = weight(_text_:22 in 6562) [ClassicSimilarity], result of:
              0.09434668 = score(doc=6562,freq=2.0), product of:
                0.1741801 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.049739745 = queryNorm
                0.5416616 = fieldWeight in 6562, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.109375 = fieldNorm(doc=6562)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
    Date
    22. 2.1997 19:40:31
  14. Menges, T.: Möglichkeiten und Grenzen der Übertragbarkeit eines Buches auf Hypertext am Beispiel einer französischen Grundgrammatik (Klein; Kleineidam) (1997) 0.02
    0.015724447 = product of:
      0.04717334 = sum of:
        0.04717334 = product of:
          0.09434668 = sum of:
            0.09434668 = weight(_text_:22 in 1496) [ClassicSimilarity], result of:
              0.09434668 = score(doc=1496,freq=2.0), product of:
                0.1741801 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.049739745 = queryNorm
                0.5416616 = fieldWeight in 1496, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.109375 = fieldNorm(doc=1496)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
    Date
    22. 7.1998 18:23:25
  15. Ellis, D.; Furner-Hines, J.; Willett, P.: ¬The creation of hypertext links in full-text documents (1994) 0.01
    0.014840192 = product of:
      0.044520576 = sum of:
        0.044520576 = product of:
          0.08904115 = sum of:
            0.08904115 = weight(_text_:index in 1084) [ClassicSimilarity], result of:
              0.08904115 = score(doc=1084,freq=4.0), product of:
                0.21735094 = queryWeight, product of:
                  4.369764 = idf(docFreq=1520, maxDocs=44218)
                  0.049739745 = queryNorm
                0.40966535 = fieldWeight in 1084, product of:
                  2.0 = tf(freq=4.0), with freq of:
                    4.0 = termFreq=4.0
                  4.369764 = idf(docFreq=1520, maxDocs=44218)
                  0.046875 = fieldNorm(doc=1084)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
    Abstract
    An important stage in the process of retrieval of objects from a hypertext database is the creation of a set of internodal links that are intended to represent the relationships existing between objetcs; an operation that is usually undertaken manually such as the allocation of subject index terms to documents. Reports results of a study in which several different sets of hypertext links were inserted, each by a different person, between the paragraphs of each of a number of full text documents. The similarity between the members of each pair of link sets was then evaluated. Results indicated that little similarity existed among the link sets, a finding comparable with those of studies of inter indexer consistency, which suggests that there is generally only a low level of agreemenet between the sets of index terms assigned to a document by indexers. Concludes with that part of the study designed to test the validity of making these kinds of assumptions in the context of hypertext link sets
  16. Tudhope, D.; Taylor, C.: ¬A unified similarity coefficient for navigating through multi-dimensional information (1996) 0.01
    0.014840192 = product of:
      0.044520576 = sum of:
        0.044520576 = product of:
          0.08904115 = sum of:
            0.08904115 = weight(_text_:index in 7460) [ClassicSimilarity], result of:
              0.08904115 = score(doc=7460,freq=4.0), product of:
                0.21735094 = queryWeight, product of:
                  4.369764 = idf(docFreq=1520, maxDocs=44218)
                  0.049739745 = queryNorm
                0.40966535 = fieldWeight in 7460, product of:
                  2.0 = tf(freq=4.0), with freq of:
                    4.0 = termFreq=4.0
                  4.369764 = idf(docFreq=1520, maxDocs=44218)
                  0.046875 = fieldNorm(doc=7460)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
    Abstract
    Describes an integrated approach to similarity coefficients for information spaces with multiple dimensions of different types of index term. Categorises applications of similarity coefficients underlying different navigation tools in hypermedia by type of term. Describes an implementation of a unified similarity coefficient based on work in numerical taxonomy, with illustrative scenarios from an experimental navigation via similarity tool for a prototype social history museum hypermedia system. The underlying architecture is based on a semantic approach, where semantic relationships can exist between index terms. This allows imprecise matching when comparing for similarity, with distance measures yielding a degree of match. A ranked list of matching items over several weighted dimensions is returned by the similarity navigation tool. The approach has the potential of allowing different access methods to multimedia data to be combined
  17. Rubottom, J.D.: Using Lotus SmarText to build hypertext documents (1993) 0.01
    0.013991467 = product of:
      0.0419744 = sum of:
        0.0419744 = product of:
          0.0839488 = sum of:
            0.0839488 = weight(_text_:index in 5085) [ClassicSimilarity], result of:
              0.0839488 = score(doc=5085,freq=2.0), product of:
                0.21735094 = queryWeight, product of:
                  4.369764 = idf(docFreq=1520, maxDocs=44218)
                  0.049739745 = queryNorm
                0.3862362 = fieldWeight in 5085, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  4.369764 = idf(docFreq=1520, maxDocs=44218)
                  0.0625 = fieldNorm(doc=5085)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
    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
  18. Rada, R.: Hypertext writing and document reuse : the role of a semantic net (1990.) 0.01
    0.013991467 = product of:
      0.0419744 = sum of:
        0.0419744 = product of:
          0.0839488 = sum of:
            0.0839488 = weight(_text_:index in 5911) [ClassicSimilarity], result of:
              0.0839488 = score(doc=5911,freq=2.0), product of:
                0.21735094 = queryWeight, product of:
                  4.369764 = idf(docFreq=1520, maxDocs=44218)
                  0.049739745 = queryNorm
                0.3862362 = fieldWeight in 5911, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  4.369764 = idf(docFreq=1520, maxDocs=44218)
                  0.0625 = fieldNorm(doc=5911)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
    Abstract
    When document components are classified and then recombined during document re-use, a semantic net may serve as the classification language. A theory of analogical inheritance, applied to this semantic net, guides the reorganisation of document components. Authors index paragraphs from various sources with node-link-node triples from a semantic net and then use programs to transverse the semantic net and generate various outlines. The program examines node and link names in deciding which path to take. Describes how these techniques helped in the re-use: parts of an existing book to write a new one
  19. Scott, P.: Hypertext ... information at your fingertips (1993) 0.01
    0.013991467 = product of:
      0.0419744 = sum of:
        0.0419744 = product of:
          0.0839488 = sum of:
            0.0839488 = weight(_text_:index in 6) [ClassicSimilarity], result of:
              0.0839488 = score(doc=6,freq=2.0), product of:
                0.21735094 = queryWeight, product of:
                  4.369764 = idf(docFreq=1520, maxDocs=44218)
                  0.049739745 = queryNorm
                0.3862362 = fieldWeight in 6, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  4.369764 = idf(docFreq=1520, maxDocs=44218)
                  0.0625 = fieldNorm(doc=6)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
    Abstract
    Hypertext is an alternative to traditional linear text and has been used successfully to create useful indexes on various types of computers. HyperRez, from MaxThink, is discussed in details, as is the creation of the major Internet index, HYTELNET. Reference is also made to hypertext utilities currently under development that make use of the HyperRez software
  20. Maislin, S.: Ripping out the pages (2000) 0.01
    0.012366828 = product of:
      0.037100483 = sum of:
        0.037100483 = product of:
          0.074200965 = sum of:
            0.074200965 = weight(_text_:index in 220) [ClassicSimilarity], result of:
              0.074200965 = score(doc=220,freq=4.0), product of:
                0.21735094 = queryWeight, product of:
                  4.369764 = idf(docFreq=1520, maxDocs=44218)
                  0.049739745 = queryNorm
                0.3413878 = fieldWeight in 220, product of:
                  2.0 = tf(freq=4.0), with freq of:
                    4.0 = termFreq=4.0
                  4.369764 = idf(docFreq=1520, maxDocs=44218)
                  0.0390625 = fieldNorm(doc=220)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
    Abstract
    When the Web was invented, it was touted as a novel nonlinear medium for the written word. No longer would we be constrained by linear presentations! Hyperlinks would allow us to jump haphazardly from page to page, chapter to chapter, idea to idea! Texts would no longer need to run from beginning to end! This is misleading. A printed book is also multidimensional and potentially nonlinear. We can open it to any page, from any other page, for any reason. We can open several books at once. In fact, what makes a book special is its combination of linear structure (the order of the words) and nonlinear physicality (the bound papers). This linear/nonlinear duality is enhanced further by the index, which maps linearly sequenced pages in a nonlinear, informationally ordered structure (architecture). In truth, the online environment is crippled by an absence of linear structure. Imagine selecting a hard cover book, tearing off the covers, ripping pages into small pieces, and throwing them in a box. That box is like a computer file system, and the paper scraps are Web documents. Only one scrap can be retrieved from the box at a time, and it must be replaced before another can be accessed. Page numbers are meaningless. Global context is destroyed. And without page numbers or context, what happens to the index?

Years

Languages

  • e 36
  • d 8

Types

  • a 34
  • m 4
  • s 3
  • x 2
  • b 1
  • d 1
  • r 1
  • More… Less…