Search (4 results, page 1 of 1)

0.010259628 = product of:
  0.030778883 = sum of:
    0.022399915 = product of:
      0.04479983 = sum of:
        0.04479983 = weight(_text_:addresses in 2752) [ClassicSimilarity], result of:
          0.04479983 = score(doc=2752,freq=2.0), product of:
            0.20233937 = queryWeight, product of:
              5.7256255 = idf(docFreq=391, maxDocs=44218)
              0.03533926 = queryNorm
            0.22140937 = fieldWeight in 2752, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.7256255 = idf(docFreq=391, maxDocs=44218)
              0.02734375 = fieldNorm(doc=2752)
      0.5 = coord(1/2)
    0.008378968 = product of:
      0.016757935 = sum of:
        0.016757935 = weight(_text_:22 in 2752) [ClassicSimilarity], result of:
          0.016757935 = score(doc=2752,freq=2.0), product of:
            0.123752065 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03533926 = queryNorm
            0.1354154 = fieldWeight in 2752, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.02734375 = fieldNorm(doc=2752)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)

Abstract

The doctoral thesis of Tatiana Gossen formulates criteria and guidelines on how to design the user interfaces of search engines for children. In her work, the author identifies the conceptual challenges based on own and previous user studies and addresses the changing characteristics of the users by providing a means of adaptation. Additionally, a novel type of search result visualisation for children with cartoon style characters is developed taking children's preference for visual information into account.

Date

1. 2.2016 18:25:22

0.009322119 = product of:
  0.05593271 = sum of:
    0.05593271 = product of:
      0.11186542 = sum of:
        0.11186542 = weight(_text_:lectures in 3934) [ClassicSimilarity], result of:
          0.11186542 = score(doc=3934,freq=2.0), product of:
            0.26750946 = queryWeight, product of:
              7.5697527 = idf(docFreq=61, maxDocs=44218)
              0.03533926 = queryNorm
            0.4181737 = fieldWeight in 3934, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              7.5697527 = idf(docFreq=61, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3934)
      0.5 = coord(1/2)
  0.16666667 = coord(1/6)

0.0042666504 = product of:
  0.025599902 = sum of:
    0.025599902 = product of:
      0.051199805 = sum of:
        0.051199805 = weight(_text_:addresses in 5329) [ClassicSimilarity], result of:
          0.051199805 = score(doc=5329,freq=2.0), product of:
            0.20233937 = queryWeight, product of:
              5.7256255 = idf(docFreq=391, maxDocs=44218)
              0.03533926 = queryNorm
            0.25303927 = fieldWeight in 5329, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.7256255 = idf(docFreq=391, maxDocs=44218)
              0.03125 = fieldNorm(doc=5329)
      0.5 = coord(1/2)
  0.16666667 = coord(1/6)

Abstract

This book describes efficient and effective techniques for harnessing the power of Linked Data by tackling the various aspects of managing its growing volume: storing, querying, reasoning, provenance management and benchmarking. To this end, Chapter 1 introduces the main concepts of the Semantic Web and Linked Data and provides a roadmap for the book. Next, Chapter 2 briefly presents the basic concepts underpinning Linked Data technologies that are discussed in the book. Chapter 3 then offers an overview of various techniques and systems for centrally querying RDF datasets, and Chapter 4 outlines various techniques and systems for efficiently querying large RDF datasets in distributed environments. Subsequently, Chapter 5 explores how streaming requirements are addressed in current, state-of-the-art RDF stream data processing. Chapter 6 covers performance and scaling issues of distributed RDF reasoning systems, while Chapter 7 details benchmarks for RDF query engines and instance matching systems. Chapter 8 addresses the provenance management for Linked Data and presents the different provenance models developed. Lastly, Chapter 9 offers a brief summary, highlighting and providing insights into some of the open challenges and research directions. Providing an updated overview of methods, technologies and systems related to Linked Data this book is mainly intended for students and researchers who are interested in the Linked Data domain. It enables students to gain an understanding of the foundations and underpinning technologies and standards for Linked Data, while researchers benefit from the in-depth coverage of the emerging and ongoing advances in Linked Data storing, querying, reasoning, and provenance management systems. Further, it serves as a starting point to tackle the next research challenges in the domain of Linked Data management.

0.0022570763 = product of:
  0.0135424575 = sum of:
    0.0135424575 = product of:
      0.027084915 = sum of:
        0.027084915 = weight(_text_:22 in 2753) [ClassicSimilarity], result of:
          0.027084915 = score(doc=2753,freq=4.0), product of:
            0.123752065 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03533926 = queryNorm
            0.21886435 = fieldWeight in 2753, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03125 = fieldNorm(doc=2753)
      0.5 = coord(1/2)
  0.16666667 = coord(1/6)

Abstract

This book constitutes the thoroughly refereed post-conference proceedings of the First COST Action IC1302 International KEYSTONE Conference on semantic Keyword-based Search on Structured Data Sources, IKC 2015, held in Coimbra, Portugal, in September 2015. The 13 revised full papers, 3 revised short papers, and 2 invited papers were carefully reviewed and selected from 22 initial submissions. The paper topics cover techniques for keyword search, semantic data management, social Web and social media, information retrieval, benchmarking for search on big data.

Date

1. 2.2016 18:25:22