Search results for "Search engine"
showing 10 items of 121 documents
Sixth graders’ evaluation strategies when reading Internet search results : an eye-tracking study
2018
Eye-tracking technology was used to examine Internet search result evaluation strategies adopted by sixth-grade students (N = 36) during ten experimental information search tasks. The relevancy of the search result’s title, URL, and snippet components was manipulated and selection of search results as well as looking into probabilities on the search result components was analysed. The results revealed that during first-pass inspection, students read the search engine page by first looking at the title of a search result. If the title was relevant, the probability of looking at the snippet of the search result increased. During second-pass inspection, there was a high probability of students…
The indexing of persons in news sequences using audio-visual data
2004
We describe a video indexing system that automatically searches for a specific person in a news sequence. The proposed approach combines audio and video confidence values extracted from speaker and face recognition analysis. The system also incorporates a shot selection module that seeks for anchors, where the person on the scene is likely speaking. The system has been extensively tested on several news sequences with very good recognition rates.
«Lex Google»: Copyright Law and Internet Providers, Future Enemies or Allies?
2013
The German Federal Parliament is discussing the approval of the so-called “Lex Google” which will amend the German Copyright Act and provide for a number of improvements to the management of copyrighted content by Internet Service Providers. This paper focuses on the advantages and disadvantages linked to the diffusion of copyrighted content over the Internet and suggests that the Lex Google would benefit from taking better into account E-Commerce rules and ECJ case-law on Internet Service Providers.
Reverse-Safe Text Indexing
2021
We introduce the notion of reverse-safe data structures. These are data structures that prevent the reconstruction of the data they encode (i.e., they cannot be easily reversed). A data structure D is called z - reverse-safe when there exist at least z datasets with the same set of answers as the ones stored by D . The main challenge is to ensure that D stores as many answers to useful queries as possible, is constructed efficiently, and has size close to the size of the original dataset it encodes. Given a text of length n and an integer z , we propose an algorithm that constructs a z -reverse-safe data structure ( z -RSDS) that has size O(n) and answers decision and counting pattern matc…
Effectively and efficiently supporting crowd-enabled databases via NoSQL paradigms
2013
In this paper we provide an overview of the Hints From the Crowd (HFC) project, whose main goal is to build a NoSQL database system for large collections of product reviews; the database is queried by expressing a natural language sentence; the result is a list of products ranked based on the relevance of reviews w.r.t. the natural language sentence. The best ranked products in the result list can be seen as the best hints for the user based on crowd opinions (the reviews). The HFC prototype has been developed as a web application, independent of the particular application domain of the collected product reviews. Queries are performed by evaluating a text-based ranking metric for sets of re…
Business Constraints Integration in a Search Engine Optimization Fuzzy Decision Support System
2017
The Internet has dramatically changed the way companies can reach their clients. Henceforth, to develop their business online, companies have to drive qualified traffic to their website. For this, their website must be visible in the first pages of search engine results. Search Engine Optimization (SEO) permits the improvement of the position of a website on the search engines results pages. However, the practice of SEO is complex, and results are uncertain, because search engines do not communicate much about their ranking methods. Moreover, this activity takes time, and requires the implementation of modifications that can alter the visual appearance of the webpages. This paper proposes a…
Search for Subsolar-Mass Ultracompact Binaries in Advanced LIGO's First Observing Run
2018
We present the first Advanced LIGO and Advanced Virgo search for ultracompact binary systems with component masses between 0.2 $M_\odot$ - 1.0 $M_\odot$ using data taken between September 12, 2015 and January 19, 2016. We find no viable gravitational wave candidates. Our null result constrains the coalescence rate of monochromatic (delta function) distributions of non-spinning (0.2 $M_\odot$, 0.2 $M_\odot$) ultracompact binaries to be less than $1.0 \times 10^6 \text{Gpc}^{-3} \text{yr}^{-1}$ and the coalescence rate of a similar distribution of (1.0 $M_\odot$, 1.0 $M_\odot$) ultracompact binaries to be less than $1.9 \times 10^4 \text{Gpc}^{-3} \text{yr}^{-1}$ (at 90 percent confidence). N…
Suitability of a content-based retrieval method in astronomical image databases
1996
Abstract Indexing and retrieval methods based on the image content are required to effectively use information from large repositories of digital images. Usually, the way to search for data and images in astronomical archives is via textual queries expressed in terms of constraints on observation parameters. In this paper we present a method for automatic extraction of images by using shape descriptions based on local symmetry. The proposed indexing methodology has been developed and tested inside JACOB, a prototypal system for content-based video database querying.
Small world theory and the World Wide Web: linking small world properties and website centrality
2016
This qualitative paper aims to point out the incidence of small world characteristics in the World Wide Web. To this end, some theoretical implications of small world theory (SWT) are verified using information from focus groups and in-depth interviews administered to experts and users of the World Wide Web. The purpose of this study is to investigate whether it is possible to apply small world properties to online social networks while pointing out the key variables of website centrality in that context. Building on this, the paper traces possible contributions for better management of the World Wide Web in terms of the professional use of social media to facilitate information or product …
Novel Results on the Number of Runs of the Burrows-Wheeler-Transform
2021
The Burrows-Wheeler-Transform (BWT), a reversible string transformation, is one of the fundamental components of many current data structures in string processing. It is central in data compression, as well as in efficient query algorithms for sequence data, such as webpages, genomic and other biological sequences, or indeed any textual data. The BWT lends itself well to compression because its number of equal-letter-runs (usually referred to as $r$) is often considerably lower than that of the original string; in particular, it is well suited for strings with many repeated factors. In fact, much attention has been paid to the $r$ parameter as measure of repetitiveness, especially to evalua…