Search results for " search"

IntentStreams

2015

The user's understanding of information needs and the information available in the data collection can evolve during an exploratory search session. Search systems tailored for well-defined narrow search tasks may be suboptimal for exploratory search where the user can sequentially refine the expressions of her information needs and explore alternative search directions. A major challenge for exploratory search systems design is how to support such behavior and expose the user to relevant yet novel information that can be difficult to discover by using conventional query formulation techniques. We introduce IntentStreams, a system for exploratory search that provides interactive query refine…

Semantic technologies for industry: From knowledge modeling and integration to intelligent applications

2013

Artificial Intelligence technologies are growingly used within several software systems ranging from Web services to mobile applications. It is by no doubt true that the more AI algorithms and methods are used the more they tend to depart from a pure "AI" spirit and end to refer to the sphere of standard software. In a sense, AI seems strongly connected with ideas, methods and tools that are not (yet) used by the general public. On the contrary, a more realistic view of it would be a rich and pervading set of successful paradigms and approaches. Industry is currently perceiving semantic technologies as a key contribution of AI to innovation. In this paper a survey of current industrial expe…

Improving LSM‐trie performance by parallel search

2020

An evolutionary restricted neighborhood search clustering approach for PPI networks

2014

Protein-protein interaction networks have been broadly studied in the last few years, in order to understand the behavior of proteins inside the cell. Proteins interacting with each other often share common biological functions or they participate in the same biological process. Thus, discovering protein complexes made of a group of proteins strictly related can be useful to predict protein functions. Clustering techniques have been widely employed to detect significant biological complexes. In this paper, we integrate one of the most popular network clustering techniques, namely the Restricted Neighborhood Search Clustering (RNSC), with evolutionary computation. The two cost functions intr…

M-GRASP: A GRASP With Memory for Latency-Aware Partitioning Methods in DVE Systems

2009

A necessary condition for providing quality of service to distributed virtual environments (DVEs) is to provide a system response below a maximum threshold to the client computers. In this sense, latency-aware partitioning methods try to provide response times below the threshold to the maximum number of client computers as possible. These partitioning methods should find an assignment of clients to servers that optimizes system throughput, system latency, and partitioning efficiency. In this paper, we present a new algorithm based on greedy randomized adaptive search procedure with memory for finding the best solutions as possible to this problem. We take into account several different alt…

Acoustic Detection of Moving Vehicles

2018

This chapter outlines a robust algorithm to detect the arrival of a vehicle of arbitrary type when other noises are present. It is done via analysis of its acoustic signature against an existing database of recorded and processed acoustic signals. To achieve it with minimum number of false alarms, a construction of a training database of acoustic signatures of signals emitted by vehicles using the distribution of the energies among blocks of wavelet packet coefficients (waveband spectra, see Sect. 4.6) is combined with a procedure of random search for a near-optimal footprint (RSNOFP). The number of false alarms in the detection is minimized even under severe conditions such as: signals emi…

Periodic Variance Maximization using Generalized Eigenvalue Decomposition applied to Remote Photoplethysmography estimation

2018

International audience; A generic periodic variance maximization algorithm to extract periodic or quasi-periodic signals of unknown periods embedded into multi-channel temporal signal recordings is described in this paper. The algorithm combines the notion of maximizing a periodicity metric combined with the global optimization scheme to estimate the source periodic signal of an unknown period. The periodicity maximization is performed using Generalized Eigenvalue Decomposition (GEVD) and the global optimization is performed using tabu search. A case study of remote photoplethysmography signal estimation has been utilized to assess the performance of the method using videos from public data…

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…

A well-scalable metaheuristic for the fleet size and mix vehicle routing problem with time windows

2009

This paper presents an efficient and well-scalable metaheuristic for fleet size and mix vehicle routing with time windows. The suggested solution method combines the strengths of well-known threshold accepting and guided local search metaheuristics to guide a set of four local search heuristics. The computational tests were done using the benchmarks of [Liu, F.-H., & Shen, S.-Y. (1999). The fleet size and mix vehicle routing problem with time windows. Journal of the Operational Research Society, 50(7), 721-732] and 600 new benchmark problems suggested in this paper. The results indicate that the suggested method is competitive and scales almost linearly up to instances with 1000 custome…

Household Leverage and Fiscal Multipliers

2011

We study the size of fiscal multipliers in response to a government spending shock under different household leverage conditions in a general equilibrium setting with search and matching frictions. We allow for different levels of household indebtedness by changing the intensive margin of borrowing (loan-to-value ratio), as well as the extensive margin, defined as the number of borrowers over total population. The interaction between the consumption decisions of agents with limited access to credit and the process of wage bargaining and vacancy posting delivers two main results: (a) higher initial leverage makes it more likely to find output multipliers higher than one; and (b) a positive g…