Search results for "Retrieval"
showing 10 items of 1176 documents
ValWorkBench: an open source Java library for cluster validation, with applications to microarray data analysis.
2015
Background: Cluster analysis is one of the most well known activities in scientific investigation and the object of research in many disciplines, ranging from statistics to computer science. It is central to the life sciences due to the advent of high throughput technologies, e.g., classification of tumors. In particular, in cluster analysis, it is of relevance to assess cluster quality and to predict the number of clusters in a dataset, if any. This latter task is usually performed via internal validation measures. Despite their potentially important role, both the use of classic internal validation measures and the design of new ones, specific for microarray data, do not seem to have grea…
PyCellBase
2019
Python package for easy retrieval of biological data from heterogeneous sources.
VIRES: A distributed open architecture for pictorial database
2006
In this paper we describe VIRES (Visual Information Retrieval Extendible System) an open distributed pictorial database for image retrieval. The retrieval methods, pictorial indexing and data are distributed over the network. VIRES has been designed as an open architecture. The system is based on the concept of distributed model via dictionary in order to reach a good versatility without changing the kernel of VIRES.
Los trabajos sobre negociación colectiva publicados en revistas españolas antes de 1995 e incluidos en la base de datos ISOC. Acercamiento biliométri…
1997
Legal literature is one of the areas most neglected by bibliometric studies, both in Spa in and abroad. Within this context, the general aim of this note is to check the utility of national databases in the retrieval and overview of the legal literature published in Spanish journals. 447 papers on collective bargaining and allied subjects published before 1995 and included in ISOC database have been retrieved. Using a computer file of these papers, the distributions by years, number of authors per paper, institutions of origin, journals and specific subjects was analysed from a bibliometric approach. As a case study, distributions of the publications which have been used in a research paper…
Integration of Spatial processing and knowledge Processing through the Semantic Web Stack
2011
International audience; This paper presents the integration process of spatial technologies and Semantic Web technologies and its associated tool. The result of this work is a spatial query and rule engine of spatial. To do so, existing ontology with spatial elements is adjusted in order to process the spatial knowledge through spatial technologies. This paper outlines the methods and the processes of these adjustments and how results are returned by our tool. The SWRL and the SPARQL language are extended for spatial purpose and the existing OWL ontology wine is used as an application example.
Alignment-Free Sequence Comparison over Hadoop for Computational Biology
2015
Sequence comparison i.e., The assessment of how similar two biological sequences are to each other, is a fundamental and routine task in Computational Biology and Bioinformatics. Classically, alignment methods are the de facto standard for such an assessment. In fact, considerable research efforts for the development of efficient algorithms, both on classic and parallel architectures, has been carried out in the past 50 years. Due to the growing amount of sequence data being produced, a new class of methods has emerged: Alignment-free methods. Research in this ares has become very intense in the past few years, stimulated by the advent of Next Generation Sequencing technologies, since those…
Grover’s Search with Faults on Some Marked Elements
2016
Grover's algorithm is a quantum query algorithm solving the unstructured search problem of size N using $$O\sqrt{N}$$ queries. It provides a significant speed-up over any classical algorithm [2]. The running time of the algorithm, however, is very sensitive to errors in queries. Multiple authors have analysed the algorithm using different models of query errors and showed the loss of quantum speed-up [1, 4]. We study the behavior of Grover's algorithm in the model where the search space contains both faulty and non-faulty marked elements. We show that in this setting it is indeed possible to find one of marked elements in $$O\sqrt{N}$$ queries.
Distance-based functions for image comparison
1999
The interest in digital image comparison is steadily growing in the computer vision community. The definition of a suitable comparison measure for non-binary images is relevant in many image processing applications. Visual tasks like segmentation and classification require the evaluation of equivalence classes. Measures of similarity are also used to evaluate lossy compression algorithms and to define pictorial indices in image content based retrieval methods. In this paper we develop a distance-based approach to image similarity evaluation and we present several image distances which are based on low level features. The sensitivity and eAectiveness are tested on real data. ” 1999 Published…
Applications of the vehicle routing problem with trailers and transshipments
2013
Abstract The vehicle routing problem with trailers and transshipments (VRPTT) is a recent and challenging extension of the well-known vehicle routing problem. The VRPTT constitutes an archetypal representative of the class of vehicle routing problems with multiple synchronization constraints (VRPMSs). In addition to the usual task covering constraints, VRPMSs require further synchronization between vehicles, concerning spatial, temporal, and load aspects. VRPMSs possess considerable practical relevance, but limited coverage in the scientific literature. The purpose of the present paper is to describe how several important types of VRPMSs, such as multi-echelon location-routing problems and …
Traitpedia: a collaborative effort to gather species traits
2018
Abstract Summary Traitpedia is a collaborative database aimed to collect binary traits in a tabular form for a growing number of species. Availability and implementation Traitpedia can be accessed from http://cbdm-01.zdv.uni-mainz.de/~munoz/traitpedia. Supplementary information Supplementary data are available at Bioinformatics online.