Search (3 results, page 1 of 1)

  • × author_ss:"Falquet, G."
  1. Falquet, G.; Guyot, J.; Nerima, L.: Languages and tools to specify hypertext views on databases (1999) 0.01 
    0.0080803 = product of:
  0.0323212 = sum of:
    0.0323212 = product of:
      0.0484818 = sum of:
        0.00946009 = weight(_text_:a in 3968) [ClassicSimilarity], result of:
          0.00946009 = score(doc=3968,freq=10.0), product of:
            0.055348642 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.04800207 = queryNorm
            0.1709182 = fieldWeight in 3968, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=3968)
        0.039021708 = weight(_text_:22 in 3968) [ClassicSimilarity], result of:
          0.039021708 = score(doc=3968,freq=2.0), product of:
            0.16809508 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04800207 = 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.6666667 = coord(2/3)
  0.25 = coord(1/4)
    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
    Type
    a
  2. Falquet, G.; Nerima, L.; Ziswiler, J.-C.: Hyperbooks (2009) 0.00 
    0.0011692984 = product of:
  0.0046771937 = sum of:
    0.0046771937 = product of:
      0.014031581 = sum of:
        0.014031581 = weight(_text_:a in 3385) [ClassicSimilarity], result of:
          0.014031581 = score(doc=3385,freq=22.0), product of:
            0.055348642 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.04800207 = queryNorm
            0.25351265 = fieldWeight in 3385, product of:
              4.690416 = tf(freq=22.0), with freq of:
                22.0 = termFreq=22.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=3385)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)
    Abstract
    The first part of the chapter presents a synthesis of recent works in the domain of hyperbooks and introduces a general hyperbook model. In this model, a hyperbook is made of a knowledge structure, a set of informational fragment, links between the fragments and the knowledge structure, and a user interface specification. This specification is used to generate the actual reading interface which is a hypertext whose nodes and links are derived from the knowledge and fragment structures. The knowledge structure provides a mean to interconnect different hyperbooks in a semantically consistent way, so as to create digital libraries of hyperbooks. The second part explains in more details the knowledge structure alignment process that is at the heart of the semantic interconnection of hyper-books. The presentation is based on a real-world example, in the domain of agriculture. It also provides experimental results about the performance, in terms of precision and recall, of this process.
    Type
    a
  3. Lacasta, J.; Falquet, G.; Nogueras Iso, J.N.; Zarazaga-Soria, J.: ¬A software processing chain for evaluating thesaurus quality (2017) 0.00 
    8.63584E-4 = product of:
  0.003454336 = sum of:
    0.003454336 = product of:
      0.010363008 = sum of:
        0.010363008 = weight(_text_:a in 3485) [ClassicSimilarity], result of:
          0.010363008 = score(doc=3485,freq=12.0), product of:
            0.055348642 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.04800207 = queryNorm
            0.18723148 = fieldWeight in 3485, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=3485)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)
    Abstract
    Thesauri are knowledge models commonly used for information classication and retrieval whose structure is dened by standards that describe the main features the concepts and relations must have. However, following these standards requires a deep knowledge of the field the thesaurus is going to cover and experience in their creation. To help in this task, this paper describes a software processing chain that provides dierent validation components that evaluates the quality of the main thesaurus features.
    Source
    Semantic keyword-based search on structured data sources: COST Action IC1302. Second International KEYSTONE Conference, IKC 2016, Cluj-Napoca, Romania, September 8-9, 2016, Revised Selected Papers. Eds.: A. Calì, A. et al
    Type
    a

Authors

Years

Themes