Search results for " search"
showing 10 items of 654 documents
Automatic Illustration of Short Texts via Web Images
2015
In this paper we propose a totally unsupervised and automatic illustration method, which aims to find onto the Web a set of images to illustrate the content of an input short text. The text is modelled as a semantic space and a set of relevant keywords is extracted. We compare and discuss different methods to create semantic representations by keyword extraction. Keywords are used to query Google Image Search engine for a list of relevant images. We also extract information from the Web pages that include the retrieved images, to create an Image Semantic Space, which is compared to the Text Semantic Space in order to rank the list of retrieved images. Tests showed that our method achieves v…
An Agent-based Service Network for Personal Mobile Devices
2006
We propose the Agent Network for Bluetooth Devices, a system that uses personal mobile devices as adaptive human-environment interfaces to supply people with ad hoc information and high-level services. The ANBD system operates with a hierarchical framework of service-providing nodes, dynamically composed and managed by mobile agents.
Maximizing versus satisficing in the digital age: Disjoint scales and the case for “construct consensus”
2018
Abstract A question facing us today, in the new and rapidly evolving digital age, is whether searching for the best option – being a maximizer – leads to greater happiness and better outcomes than settling on the first good enough option found – or “satisficing.” Answers to this question inform behavioural insights to improve well-being and decision-making in policy and organizational settings. Yet, the answers to this fundamental question of measurement of the happiness of a maximizer versus a satisficer in the current psychological literature are: 1) conflicting; 2) anchored on the use of the first scale published to measure maximization as an individual-difference, and 3) unable to descr…
Optimisation des requêtes de similarité dans les espaces métriques répondant aux besoins des usagers
2012
The complexity of data stored in large databases has increased at very fast paces. Hence, operations more elaborated than traditional queries are essential in order to extract all required information from the database. Therefore, the interest of the database community in similarity search has increased significantly. Two of the well-known types of similarity search are the Range (Rq) and the k-Nearest Neighbor (kNNq) queries, which, as any of the traditional ones, can be sped up by indexing structures of the Database Management System (DBMS). Another way of speeding up queries is to perform query optimization. In this process, metrics about data are collected and employed to adjust the par…
Use of simulation-based learning among perioperative nurses and students: A scoping review.
2018
Abstract Objectives Simulation-based learning has been extensively explored, especially in baccalaureate nursing programmes. Recently, simulation-based learning has been introduced in perioperative nursing. The aim of this scoping review is to investigate work published on the use of simulation-based learning in the field of perioperative nursing. Design and data sources A scoping review was conducted using the methodological framework of Arksey and O'Malley to identify a broad range of relevant literature, regardless of study design. A comprehensive and systematic search was performed using Medline, CINAHL, Eric, Svemed+, PsychINFO and Embase in May 2016 and then was updated in February 20…
Acceleration of short and long DNA read mapping without loss of accuracy using suffix array
2014
HPG Aligner applies suffix arrays for DNA read mapping. This implementation produces a highly sensitive and extremely fast mapping of DNA reads that scales up almost linearly with read length. The approach presented here is faster (over 20 for long reads) and more sensitive (over 98% in a wide range of read lengths) than the current state-of-the-art mappers. HPG Aligner is not only an optimal alternative for current sequencers but also the only solution available to cope with longer reads and growing throughputs produced by forthcoming sequencing technologies.
On the analysis of a random walk-jump chain with tree-based transitions and its applications to faulty dichotomous search
2018
Random Walks (RWs) have been extensively studied for more than a century [1]. These walks have traditionally been on a line, and the generalizations for two and three dimensions, have been by extending the random steps to the corresponding neighboring positions in one or many of the dimensions. Among the most popular RWs on a line are the various models for birth and death processes, renewal processes and the gambler’s ruin problem. All of these RWs operate “on a discretized line”, and the walk is achieved by performing small steps to the current-state’s neighbor states. Indeed, it is this neighbor-step motion that renders their analyses tractable. When some of the transitions are to non-ne…
Hores: A timetabling system for Spanish secondary schools
1995
Constructing a timetable is a difficult problem faced by every school every year. A feasible solution has to satisfy many different requirements and constraints. A good solution has to provide compact timetables for classes and teachers. In order to help the schools, we have developed HORES, a robust and flexible timetabling system suited to the needs of Spanish secondary schools. HORES runs on a PC and is fast and user-friendly. It may handle virtually every condition required by the schools and obtains good quality solutions in very short computing times. It also allows the user to modify interactively the solutions. HORES is now being used by schools with satisfactory results.
Pseudo-Cut Strategies for Global Optimization
2011
Motivated by the successful use of a pseudo-cut strategy within the setting of constrained nonlinear and nonconvex optimization in Lasdon et al. (2010), we propose a framework for general pseudo-cut strategies in global optimization that provides a broader and more comprehensive range of methods. The fundamental idea is to introduce linear cutting planes that provide temporary, possibly invalid, restrictions on the space of feasible solutions, as proposed in the setting of the tabu search metaheuristic in Glover (1989), in order to guide a solution process toward a global optimum, where the cutting planes can be discarded and replaced by others as the process continues. These strategies can…
Estimating Mean Lifetime from Partially Observed Events in Nuclear Physics
2022
Abstract The mean lifetime is an important characteristic of particles to be identified in nuclear physics. State-of-the-art particle detectors can identify the arrivals of single radioactive nuclei as well as their subsequent radioactive decays (departures). Challenges arise when the arrivals and departures are unmatched and the departures are only partially observed. An inefficient solution is to run experiments where the arrival rate is set very low to allow for the matching of arrivals and departures. We propose an estimation method that works for a wide range of arrival rates. The method combines an initial estimator and a numerical bias correction technique. Simulations and examples b…