Search results for "InformationSystems_INFORMATIONSTORAGEANDRETRIEVAL"
showing 10 items of 53 documents
Optimizing Query Perturbations to Enhance Shape Retrieval
2020
3D Shape retrieval algorithms use shape descriptors to identify shapes in a database that are the most similar to a given key shape, called the query. Many shape descriptors are known but none is perfect. Therefore, the common approach in building 3D Shape retrieval tools is to combine several descriptors with some fusion rule. This article proposes an orthogonal approach. The query is improved with a Genetic Algorithm. The latter makes evolve a population of perturbed copies of the query, called clones. The best clone is the closest to its closest shapes in the database, for a given shape descriptor. Experimental results show that improving the query also improves the precision and complet…
ViziQuer: A Visual Notation for RDF Data Analysis Queries
2019
Visual SPARQL query notations aim at easing the RDF data querying task. At the current state of the art there is still no generally accepted visual graph-based notation suitable to describe RDF data analysis queries that involve aggregation and subqueries. In this paper we present a visual diagram-centered notation for SPARQL select query formulation, capable to handle aggregate/statistics queries and hierarchic queries with subquery structure. The notation is supported by a web-based prototype tool. We present the notation examples, describe its syntax and semantics and describe studies with possible end users, involving both IT and medicine students.
Geometric Algebra Rotors for Sub-symbolic Coding of Natural Language Sentences
2007
A sub-symbolic encoding methodology for natural language sentences is presented. The procedure is based on the creation of an LSA-inspired semantic space and associates rotation operators derived from Geometric Algebra to word bigrams of the sentence. The operators are subsequently applied to an orthonormal standard basis of the created semantic space according to the order in which words appear in the sentence. The final rotated basis is then coded as a vector and its orthogonal part constitutes the sub-symbolic coding of the sentence. Preliminary experimental results for a classification task, compared with the traditional LSA methodology, show the effectiveness of the approach.
Research on Vocabulary Sizes and Codebook Universality
2014
Published version of an article in the journal: Abstract and Applied Analysis. Also available from the publisher at: http://dx.doi.org/10.1155/2014/697245 Open Access Codebook is an effective image representation method. By clustering in local image descriptors, a codebook is shown to be a distinctive image feature and widely applied in object classification. In almost all existing works on codebooks, the building of the visual vocabulary follows a basic routine, that is, extracting local image descriptors and clustering with a user-designated number of clusters. The problem with this routine lies in that building a codebook for each single dataset is not efficient. In order to deal with th…
Supplementary material from Competition between strains of Borrelia afzelii inside the rodent host and the tick vector
2018
Supplementary material supporting the paper
Biotechnology and Cultural Heritage Conservation
2020
The deterioration of cultural asset is induced by biological, chemical, and physical factors, influenced by anthropogenic activity and environmental conditions. In this study, the contribution of biotechnology is emphasized to define the conservation strategy, for a marble Fountain (Two Dragons, XV century) located in Palermo city center, based on an integrated approach and eco-friendly procedures. Biotechnological protocols are preliminarily applied as an integrated approach, based on microscopy observation, in vitro culture and genomic DNA analysis to recognize and characterize microbial communities. Several biological systems have been identified: green algae (Chlorella) and cyanobacteri…
DEFECT THEOREMS FOR TREES
2000
We generalize different notions of a rank of a set of words to sets of trees. We prove that almost all of those ranks can be used to formulate a defect theorem. However, as we show, the prefix rank forms an exception.
Locality of order-invariant first-order formulas
1998
A query is local if the decision of whether a tuple in a structure satisfies this query only depends on a small neighborhood of the tuple. We prove that all queries expressible by order-invariant first-order formulas are local.
Evaluation of Inciso: A system for automatic elaboration of a Citation Index in Social Science Spanish Journal
2007
We have developed a system that can elaborate a citation index in an automated way. It has been tested with Spanish journals. We need evaluate our system, mainly in effectiveness of the retrieval of citations. Criteria for evaluation of the system is presented and discussed, and the results of the application to our system are showed and analyzed.
ASR performance prediction on unseen broadcast programs using convolutional neural networks
2018
In this paper, we address a relatively new task: prediction of ASR performance on unseen broadcast programs. We first propose an heterogenous French corpus dedicated to this task. Two prediction approaches are compared: a state-of-the-art performance prediction based on regression (engineered features) and a new strategy based on convolutional neural networks (learnt features). We particularly focus on the combination of both textual (ASR transcription) and signal inputs. While the joint use of textual and signal features did not work for the regression baseline, the combination of inputs for CNNs leads to the best WER prediction performance. We also show that our CNN prediction remarkably …