Search (290 results, page 2 of 15)

0.0027189455 = product of:
  0.005437891 = sum of:
    0.005437891 = product of:
      0.010875782 = sum of:
        0.010875782 = weight(_text_:a in 1563) [ClassicSimilarity], result of:
          0.010875782 = score(doc=1563,freq=10.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.22789092 = fieldWeight in 1563, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0625 = fieldNorm(doc=1563)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The h-index has been shown to increase in many cases mostly because of citations to rather old publications. This inertia can be circumvented by restricting the evaluation to a citation time window. Here I report results of an empirical study analyzing the evolution of the thus defined timed h-index in dependence on the length of the citation time window.

Type

a

0.0027189455 = product of:
  0.005437891 = sum of:
    0.005437891 = product of:
      0.010875782 = sum of:
        0.010875782 = weight(_text_:a in 5205) [ClassicSimilarity], result of:
          0.010875782 = score(doc=5205,freq=10.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.22789092 = fieldWeight in 5205, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0625 = fieldNorm(doc=5205)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

We provide a model for the reception of knowledge from externalized information sources. The model is based on a cognitive understanding of information processing and draws up ideas of an exchange of information in communication processes. Karl Popper's three-world theory with its orientation on falsifiable scientific knowledge is extended by John Searle's concept of collective intentionality. This allows a consistent description of externalization and reception of knowledge including scientific knowledge as well as everyday knowledge.

Type

a

0.0027125655 = product of:
  0.005425131 = sum of:
    0.005425131 = product of:
      0.010850262 = sum of:
        0.010850262 = weight(_text_:a in 1874) [ClassicSimilarity], result of:
          0.010850262 = score(doc=1874,freq=52.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.22735618 = fieldWeight in 1874, product of:
              7.2111025 = tf(freq=52.0), with freq of:
                52.0 = termFreq=52.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.02734375 = fieldNorm(doc=1874)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Content

"People can summarize a complex scene in a few words without thinking twice. It's much more difficult for computers. But we've just gotten a bit closer -- we've developed a machine-learning system that can automatically produce captions (like the three above) to accurately describe images the first time it sees them. This kind of system could eventually help visually impaired people understand pictures, provide alternate text for images in parts of the world where mobile connections are slow, and make it easier for everyone to search on Google for images. Recent research has greatly improved object detection, classification, and labeling. But accurately describing a complex scene requires a deeper representation of what's going on in the scene, capturing how the various objects relate to one another and translating it all into natural-sounding language. Many efforts to construct computer-generated natural descriptions of images propose combining current state-of-the-art techniques in both computer vision and natural language processing to form a complete image description approach. But what if we instead merged recent computer vision and language models into a single jointly trained system, taking an image and directly producing a human readable sequence of words to describe it? This idea comes from recent advances in machine translation between languages, where a Recurrent Neural Network (RNN) transforms, say, a French sentence into a vector representation, and a second RNN uses that vector representation to generate a target sentence in German. Now, what if we replaced that first RNN and its input words with a deep Convolutional Neural Network (CNN) trained to classify objects in images? Normally, the CNN's last layer is used in a final Softmax among known classes of objects, assigning a probability that each object might be in the image. But if we remove that final layer, we can instead feed the CNN's rich encoding of the image into a RNN designed to produce phrases. We can then train the whole system directly on images and their captions, so it maximizes the likelihood that descriptions it produces best match the training descriptions for each image.
Our experiments with this system on several openly published datasets, including Pascal, Flickr8k, Flickr30k and SBU, show how robust the qualitative results are -- the generated sentences are quite reasonable. It also performs well in quantitative evaluations with the Bilingual Evaluation Understudy (BLEU), a metric used in machine translation to evaluate the quality of generated sentences. A picture may be worth a thousand words, but sometimes it's the words that are most useful -- so it's important we figure out ways to translate from images to words automatically and accurately. As the datasets suited to learning image descriptions grow and mature, so will the performance of end-to-end approaches like this. We look forward to continuing developments in systems that can read images and generate good natural-language descriptions. To get more details about the framework used to generate descriptions from images, as well as the model evaluation, read the full paper here." Vgl. auch: https://news.ycombinator.com/item?id=8621658.

Source

http://googleresearch.blogspot.de/2014/11/a-picture-is-worth-thousand-coherent.html

0.0026326077 = product of:
  0.0052652154 = sum of:
    0.0052652154 = product of:
      0.010530431 = sum of:
        0.010530431 = weight(_text_:a in 8920) [ClassicSimilarity], result of:
          0.010530431 = score(doc=8920,freq=6.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.22065444 = fieldWeight in 8920, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.078125 = fieldNorm(doc=8920)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

A BIBFRAME Relationship is a relationship between a BIBFRAME Work or Instance and another BIBFRAME Work or Instance. Thus there are four types of relationships: Work to Work - Work to Instance - Instance to Work - Instance to Instance

0.0026061484 = product of:
  0.0052122967 = sum of:
    0.0052122967 = product of:
      0.010424593 = sum of:
        0.010424593 = weight(_text_:a in 2430) [ClassicSimilarity], result of:
          0.010424593 = score(doc=2430,freq=12.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.21843673 = fieldWeight in 2430, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2430)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

This paper explores a technique to improve searcher access to library collections by providing a faceted search interface built on a data model based on the Functional Requirements for Bibliographic Records (FRBR). The prototype provides a Workcentric view of a moving image collection that is integrated with bibliographic and holdings data. Two sets of facets address important user needs: "what do you want?" and "how/where do you want it?" enabling patrons to narrow, broaden and pivot across facet values instead of limiting them to the tree-structured hierarchy common with existing FRBR applications. The data model illustrates how FRBR is being adapted and applied beyond the traditional library catalog.

Type

a

0.0026061484 = product of:
  0.0052122967 = sum of:
    0.0052122967 = product of:
      0.010424593 = sum of:
        0.010424593 = weight(_text_:a in 3371) [ClassicSimilarity], result of:
          0.010424593 = score(doc=3371,freq=12.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.21843673 = fieldWeight in 3371, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3371)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

After a year of development, the library at the University of Illinois at Urbana-Champaign has launched a repository, called the Illinois Data Bank (https://databank.illinois.edu/), to provide Illinois researchers with a free, self-serve publishing platform that centralizes, preserves, and provides persistent and reliable access to Illinois research data. This article presents a holistic view of development by discussing our overarching technical, policy, and interface strategies. By openly presenting our design decisions, the rationales behind those decisions, and associated challenges this paper aims to contribute to the library community's work to develop repository services that meet growing data preservation and sharing needs.

Type

a

0.0026061484 = product of:
  0.0052122967 = sum of:
    0.0052122967 = product of:
      0.010424593 = sum of:
        0.010424593 = weight(_text_:a in 3864) [ClassicSimilarity], result of:
          0.010424593 = score(doc=3864,freq=12.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.21843673 = fieldWeight in 3864, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3864)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Autism is a complex neurological phenomenon that affects our society on individual, community, and cultural levels. There is an ongoing dialog between the medical, scientific and autism communities that critiques and molds the meaning of autism. The prevailing social model perspective, the neurodiversity paradigm, views autism as a natural variation in human neurology. Towards the goal of crystallizing the various facets of autism, this paper conducts a domain analysis of neurodiversity. Through this analysis, we explore the dynamics between diagnosis, identity, power, and inclusion.

Type

a

0.0026061484 = product of:
  0.0052122967 = sum of:
    0.0052122967 = product of:
      0.010424593 = sum of:
        0.010424593 = weight(_text_:a in 4530) [ClassicSimilarity], result of:
          0.010424593 = score(doc=4530,freq=12.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.21843673 = fieldWeight in 4530, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4530)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

I need to measure semantic similarity between CSO ontology concepts, depending on Ontology structure (concept path, depth, least common subsumer (LCS) ...). CSO (Computer Science Ontology) is a large-scale ontology of research areas. A concepts in CSO may have multiple parents/super concepts (i.e. a concept may be a child of many other concepts), e.g. : (world wide web) is parent of (semantic web) (semantics) is parent of (semantic web) I found some measures that meet my needs, but the papers proposing these measures are not cited, so i got hesitated. I also found a measure that depends on weighted edges, but multiple inheritance (super concepts) is not considered..

0.0026061484 = product of:
  0.0052122967 = sum of:
    0.0052122967 = product of:
      0.010424593 = sum of:
        0.010424593 = weight(_text_:a in 5236) [ClassicSimilarity], result of:
          0.010424593 = score(doc=5236,freq=12.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.21843673 = fieldWeight in 5236, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0546875 = fieldNorm(doc=5236)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The Black Book Interactive Project at the University of Kansas (KU) is developing an expanded corpus of novels by African American authors, with an emphasis on lesser known writers and a goal of expanding research in this field. Using a custom metadata schema with an emphasis on race-related elements, each novel is analyzed for a variety of elements such as literary style, targeted content analysis, historical context, and other areas. Librarians at KU have worked to develop a variety of computational text analysis processes designed to assist with specific aspects of this metadata collection, including text mining and natural language processing, automated subject extraction based on word sense disambiguation, harvesting data from Wikidata, and other actions.

Type

a

0.002579418 = product of:
  0.005158836 = sum of:
    0.005158836 = product of:
      0.010317672 = sum of:
        0.010317672 = weight(_text_:a in 1868) [ClassicSimilarity], result of:
          0.010317672 = score(doc=1868,freq=16.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.2161963 = fieldWeight in 1868, product of:
              4.0 = tf(freq=16.0), with freq of:
                16.0 = termFreq=16.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=1868)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

We present a model that generates free-form natural language descriptions of image regions. Our model leverages datasets of images and their sentence descriptions to learn about the inter-modal correspondences between text and visual data. Our approach is based on a novel combination of Convolutional Neural Networks over image regions, bidirectional Recurrent Neural Networks over sentences, and a structured objective that aligns the two modalities through a multimodal embedding. We then describe a Recurrent Neural Network architecture that uses the inferred alignments to learn to generate novel descriptions of image regions. We demonstrate the effectiveness of our alignment model with ranking experiments on Flickr8K, Flickr30K and COCO datasets, where we substantially improve on the state of the art. We then show that the sentences created by our generative model outperform retrieval baselines on the three aforementioned datasets and a new dataset of region-level annotations.

Type

a

0.002579418 = product of:
  0.005158836 = sum of:
    0.005158836 = product of:
      0.010317672 = sum of:
        0.010317672 = weight(_text_:a in 3205) [ClassicSimilarity], result of:
          0.010317672 = score(doc=3205,freq=16.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.2161963 = fieldWeight in 3205, product of:
              4.0 = tf(freq=16.0), with freq of:
                16.0 = termFreq=16.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=3205)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The goal of Open Knowledge Maps is to create a visual interface to the world's scientific knowledge. The base for this visual interface consists of so-called knowledge maps, which enable the exploration of existing knowledge and the discovery of new knowledge. Our open source knowledge mapping software applies a mixture of summarization techniques and similarity measures on article metadata, which are iteratively chained together. After processing, the representation is saved in a database for use in a web visualization. In the future, we want to create a space for collective knowledge mapping that brings together individuals and communities involved in exploration and discovery. We want to enable people to guide each other in their discovery by collaboratively annotating and modifying the automatically created maps.

Type

a

0.002579418 = product of:
  0.005158836 = sum of:
    0.005158836 = product of:
      0.010317672 = sum of:
        0.010317672 = weight(_text_:a in 3884) [ClassicSimilarity], result of:
          0.010317672 = score(doc=3884,freq=16.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.2161963 = fieldWeight in 3884, product of:
              4.0 = tf(freq=16.0), with freq of:
                16.0 = termFreq=16.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=3884)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Techniques for multidimensional scaling visualize objects as points in a low-dimensional metric map. As a result, the visualizations are subject to the fundamental limitations of metric spaces. These limitations prevent multidimensional scaling from faithfully representing non-metric similarity data such as word associations or event co-occurrences. In particular, multidimensional scaling cannot faithfully represent intransitive pairwise similarities in a visualization, and it cannot faithfully visualize "central" objects. In this paper, we present an extension of a recently proposed multidimensional scaling technique called t-SNE. The extension aims to address the problems of traditional multidimensional scaling techniques when these techniques are used to visualize non-metric similarities. The new technique, called multiple maps t-SNE, alleviates these problems by constructing a collection of maps that reveal complementary structure in the similarity data. We apply multiple maps t-SNE to a large data set of word association data and to a data set of NIPS co-authorships, demonstrating its ability to successfully visualize non-metric similarities.

Type

a

0.00252053 = product of:
  0.00504106 = sum of:
    0.00504106 = product of:
      0.01008212 = sum of:
        0.01008212 = weight(_text_:a in 3868) [ClassicSimilarity], result of:
          0.01008212 = score(doc=3868,freq=22.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.21126054 = fieldWeight in 3868, product of:
              4.690416 = tf(freq=22.0), with freq of:
                22.0 = termFreq=22.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3868)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Gross et al. (2015) have demonstrated that about a quarter of hits would typically be lost to keyword searchers if contemporary academic library catalogs dropped their controlled subject headings. This paper reports on an analysis of the loss levels that would result if a bibliographic database, namely the Australian Education Index (AEI), were missing the subject descriptors and identifiers assigned by its professional indexers, employing the methodology developed by Gross and Taylor (2005), and later by Gross et al. (2015). The results indicate that AEI users would lose a similar proportion of hits per query to that experienced by library catalog users: on average, 27% of the resources found by a sample of keyword queries on the AEI database would not have been found without the subject indexing, based on the Australian Thesaurus of Education Descriptors (ATED). The paper also discusses the methodological limitations of these studies, pointing out that real-life users might still find some of the resources missed by a particular query through follow-up searches, while additional resources might also be found through iterative searching on the subject vocabulary. The paper goes on to describe a new research design, based on a before - and - after experiment, which addresses some of these limitations. It is argued that this alternative design will provide a more realistic picture of the value that professionally assigned subject indexing and controlled subject vocabularies can add to literature searching of a more scholarly and thorough kind.

Type

a

0.0024318986 = product of:
  0.004863797 = sum of:
    0.004863797 = product of:
      0.009727594 = sum of:
        0.009727594 = weight(_text_:a in 4092) [ClassicSimilarity], result of:
          0.009727594 = score(doc=4092,freq=8.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.20383182 = fieldWeight in 4092, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0625 = fieldNorm(doc=4092)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Deep learning has emerged as a powerful machine learning technique that learns multiple layers of representations or features of the data and produces state-of-the-art prediction results. Along with the success of deep learning in many other application domains, deep learning is also popularly used in sentiment analysis in recent years. This paper first gives an overview of deep learning and then provides a comprehensive survey of its current applications in sentiment analysis.

Type

a

0.0024318986 = product of:
  0.004863797 = sum of:
    0.004863797 = product of:
      0.009727594 = sum of:
        0.009727594 = weight(_text_:a in 5788) [ClassicSimilarity], result of:
          0.009727594 = score(doc=5788,freq=8.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.20383182 = fieldWeight in 5788, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0625 = fieldNorm(doc=5788)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

A database supports legal research by matching a user's request for information with documents of the database that contain it. Indexes are among the oldest tools to achieve that aim. Many legal publishers continue to provide manual subject indexing of legal documents, in addition to automatic full-text indexing, which improves the performance of a full-text search.

0.0024128247 = product of:
  0.0048256493 = sum of:
    0.0048256493 = product of:
      0.009651299 = sum of:
        0.009651299 = weight(_text_:a in 4762) [ClassicSimilarity], result of:
          0.009651299 = score(doc=4762,freq=14.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.20223314 = fieldWeight in 4762, product of:
              3.7416575 = tf(freq=14.0), with freq of:
                14.0 = termFreq=14.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=4762)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

This paper presents a model to compose semantic relations. The model is independent of any particular set of relations and uses an extended definition for semantic relations. This extended definition includes restrictions on the domain and range of relations and utilizes semantic primitives to characterize them. Primitives capture elementary properties between the arguments of a relation. An algebra for composing semantic primitives is used to automatically identify the resulting relation of composing a pair of compatible relations. Inference axioms are obtained. Axioms take as input a pair of semantic relations and output a new, previously ignored relation. The usefulness of this proposed model is shown using PropBank relations. Eight inference axioms are obtained and their accuracy and productivity are evaluated. The model offers an unsupervised way of accurately extracting additional semantics from text.

Type

a

0.0024128247 = product of:
  0.0048256493 = sum of:
    0.0048256493 = product of:
      0.009651299 = sum of:
        0.009651299 = weight(_text_:a in 4799) [ClassicSimilarity], result of:
          0.009651299 = score(doc=4799,freq=14.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.20223314 = fieldWeight in 4799, product of:
              3.7416575 = tf(freq=14.0), with freq of:
                14.0 = termFreq=14.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=4799)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Constructing ontology is considerably time consuming process in general. Since there are a vast amount of thesauri currently available, it may be a feasible solution to exploit thesauri, when constructing ontology in a short period of time. This paper designs and implements a XTM (XML Topic Maps) code converter generating XTM coded ontology from an object based thesaurus. It is an extended thesaurus, which enriches the conventional thesauri with user defined associations, a notion of instances and occurrences associated with them. The reason we adopt XTM is that it is a verified and practical methodology to semantically reorganize the conceptual structure of extant web applications with minimal effort. Moreover, since XTM is conceptually similar to our object based thesauri, recommendation and inference mechanism already developed in our system could be easily applied to the generated XTM ontology. To show that the XTM ontology is correct, we also verify it with onto pia Omnigator and Vizigator, the components of Ontopia Knowledge Suite (OKS) tool.

Type

a

0.0024128247 = product of:
  0.0048256493 = sum of:
    0.0048256493 = product of:
      0.009651299 = sum of:
        0.009651299 = weight(_text_:a in 476) [ClassicSimilarity], result of:
          0.009651299 = score(doc=476,freq=14.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.20223314 = fieldWeight in 476, product of:
              3.7416575 = tf(freq=14.0), with freq of:
                14.0 = termFreq=14.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=476)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Although quite a number of RDF triple store benchmarks have already been conducted and published, it appears to be not that easy to find the right storage solution for your particular Semantic Web project. A basic reason is the lack of comprehensive performance tests with real-world data. Confronted with this problem, we setup and ran our own tests with a selection of four up-to-date triple store implementations - and came to interesting findings. In this paper, we briefly present the benchmark setup including the store configuration, the datasets, and the test queries. Based on a set of metrics, our results demonstrate the importance of real-world datasets in identifying anomalies or di?erences in reasoning. Finally, we must state that it is indeed difficult to give a general recommendation as no store wins in every field.

Source

Proceedings of the 2nd International Workshop on Semantic Digital Archives held in conjunction with the 16th Int. Conference on Theory and Practice of Digital Libraries (TPDL) on September 27, 2012 in Paphos, Cyprus [http://ceur-ws.org/Vol-912/proceedings.pdf]. Eds.: A. Mitschik et al

0.0024128247 = product of:
  0.0048256493 = sum of:
    0.0048256493 = product of:
      0.009651299 = sum of:
        0.009651299 = weight(_text_:a in 2882) [ClassicSimilarity], result of:
          0.009651299 = score(doc=2882,freq=14.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.20223314 = fieldWeight in 2882, product of:
              3.7416575 = tf(freq=14.0), with freq of:
                14.0 = termFreq=14.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=2882)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

This short publication was made for two reasons. First, to provide a simple way to help people understand a bit more precisely what is defined by RDA, AACR2, MARC format, and so on. In this way, when someone says that MARC, or AARC2, or ISBD should change, they will have a better idea of what each term does and does not pertain to. One record has been chosen at random and analysed in various ways. This publication is far from complete and does not pretend to teach anything, it only demonstrates. When someone talks about, e.g. MARC, all the reader needs to do is look at the colored areas to get an idea of what that means.

Source

http://blog.jweinheimer.net/wp-content/Ebooks/A%20visual%20explanation%20of%20the%20are%20-%20James%20Weinheimer.pdf

0.0024128247 = product of:
  0.0048256493 = sum of:
    0.0048256493 = product of:
      0.009651299 = sum of:
        0.009651299 = weight(_text_:a in 3264) [ClassicSimilarity], result of:
          0.009651299 = score(doc=3264,freq=14.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.20223314 = fieldWeight in 3264, product of:
              3.7416575 = tf(freq=14.0), with freq of:
                14.0 = termFreq=14.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=3264)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

We scho how the beenfits of the view-based search method, developed within the information retrieval community, can be extended with ontology-based search, developed within the Semantic Web community, and with semantic recommendations. As a proof of the concept, we have implemented an ontology-and view-based search engine and recommendations system Ontogaotr for RDF(S) repositories. Ontogator is innovative in two ways. Firstly, the RDFS.based ontologies used for annotating metadata are used in the user interface to facilitate view-based information retrieval. The views provide the user with an overview of the repositorys contents and a vocabulary for expressing search queries. Secondlyy, a semantic browsing function is provided by a recommender system. This system enriches instance level metadata by ontologies and provides the user with links to semantically related relevant resources. The semantic linkage is specified in terms of logical rules. To illustrate and discuss the ideas, a deployed application of Ontogator to a photo repository of the Helsinki University Museum is presented.

Type

a