CNR Institute of Information Science and Technologies Alessandro Faedo

Italy

CNR Institute of Information Science and Technologies Alessandro Faedo

Italy
SEARCH FILTERS
Time filter
Source Type

Straccia U.,CNR Institute of Information Science and Technologies Alessandro Faedo
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2017

The aim of this talk is to present the state of the art in representing and reasoning with fuzzy knowledge in Semantic Web Languages such as triple languages RDF/RDFS, conceptual languages of the OWL 2 family and rule languages. We further show how one may generalise them to so-called annotation domains, that cover also e.g. temporal and provenance extensions. © Springer International Publishing AG 2017.


Bobillo F.,University of Zaragoza | Straccia U.,CNR Institute of Information Science and Technologies Alessandro Faedo
International Journal of Approximate Reasoning | Year: 2011

The need to deal with vague information in Semantic Web languages is rising in importance and, thus, calls for a standard way to represent such information. We may address this issue by either extending current Semantic Web languages to cope with vagueness, or by providing a procedure to represent such information within current standard languages and tools. In this work, we follow the latter approach, by identifying the syntactic differences that a fuzzy ontology language has to cope with, and by proposing a concrete methodology to represent fuzzy ontologies using OWL 2 annotation properties. We also report on some prototypical implementations: a plug-in to edit fuzzy ontologies using OWL 2 annotations and some parsers that translate fuzzy ontologies represented using our methodology into the languages supported by some reasoners. © 2011 Elsevier Inc. All rights reserved.


Belazzougui D.,University Paris Diderot | Venturini R.,CNR Institute of Information Science and Technologies Alessandro Faedo
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms | Year: 2013

Given a set of integer keys from a bounded universe along with associated data, the dictionary problem asks to answer two queries: membership and retrieval. Membership has to tell whether a given element is in the dictionary or not; Retrieval has to return the data associated with the searched key. In this paper we provide time and space optimal solutions for three well-established relaxations of this basic problem: (Compressed) Static functions, Approximate membership and Relative membership. Copyright © SIAM.


ter Beek M.H.,CNR Institute of Information Science and Technologies Alessandro Faedo | de Vink E.P.,TU Eindhoven
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2014

We introduce by means of an example a modular verification technique for analyzing the behavior of software product lines using the mCRL2 toolset. Based on feature-driven borders, we divide a behavioral model of a product line into a set of separate components with interfaces and a driver process to coordinate them. Abstracting from irrelevant components, we verify properties over a smaller behavioral model, which not only simplifies the model checking task but also makes the result amenable for reuse. This is a fundamental step forward for the approach to scale up to industrial-size product lines. © Springer-Verlag Berlin Heidelberg 2014.


Lucchesi D.M.,National institute for astrophysics | Lucchesi D.M.,CNR Institute of Information Science and Technologies Alessandro Faedo | Peron R.,National institute for astrophysics
Physical Review Letters | Year: 2010

The pericenter shift of a binary system represents a suitable observable to test for possible deviations from the Newtonian inverse-square law in favor of new weak interactions between macroscopic objects. We analyzed 13 years of tracking data of the LAGEOS satellites with GEODYN II software but with no models for general relativity. From the fit of LAGEOS II pericenter residuals we have been able to obtain a 99.8% agreement with the predictions of Einstein's theory. This result may be considered as a 99.8% measurement in the field of the Earth of the combination of the γ and β parameters of general relativity, and it may be used to constrain possible deviations from the inverse-square law in favor of new weak interactions parametrized by a Yukawa-like potential with strength α and range λ. We obtained |α|∼1×10-11, a huge improvement at a range of about 1 Earth radius. © 2010 The American Physical Society.


Straccia U.,CNR Institute of Information Science and Technologies Alessandro Faedo
Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics | Year: 2010

We outline SoftFacts, an ontology mediated top-k information retrieval system over relational databases. An ontology layer is used to define (in terms of a OWL-QL like Semantic Web language) the relevant abstract concepts and relations of the application domain, while graded facts are stored into a relational database. Queries are conjunctive queries with ranking aggregates and scoring functions and the results of a query may be ranked according to user defined scoring functions. We will illustrate SoftFacts' architecture, the representation and the query language, sketch the reasoning algorithms of the SoftFacts system and its Protege plug-in. ©2010 IEEE.


Kuruoglu E.E.,CNR Institute of Information Science and Technologies Alessandro Faedo
IEEE Signal Processing Magazine | Year: 2010

Recent satellite missions have provided and continue to provide us with vast amounts of data on radiation measurements that generally present themselves as superpositions of various cosmological sources, most importantly cosmic microwave background (CMB) radiation and other galactic and extragalactic sources. We would like to obtain the estimates of these sources separately since they carry vital information of cosmological significance about our Universe. Although initial attempts to obtain sources have utilized blind estimation techniques, the presence of important astrophysical prior information and the demanding nature of the problem makes the use of informed techniques possible and indispensable. In this article, our objective is to present a formulation of the problem in Bayesian framework for the signal processing community and to provide a panorama of Bayesian source separation techniques for the estimation of cosmological components from the observation mixtures. © 2006 IEEE.


Silvestri F.,CNR Institute of Information Science and Technologies Alessandro Faedo
Foundations and Trends in Information Retrieval | Year: 2010

Web search engines have stored in their logs information about users since they started to operate. This information often serves many purposes. The primary focus of this survey is on introducing to the discipline of query mining by showing its foundations and by analyzing the basic algorithms and techniques that are used to extract useful knowledge from this (potentially) infinite source of information. We show how search applications may benefit from this kind of analysis by analyzing popular applications of query log mining and their influence on user experience. We conclude the paper by, briefly, presenting some of the most challenging current open problems in this field. Copyright © 2010 F. Silvestri.


Kuruoglu E.E.,CNR Institute of Information Science and Technologies Alessandro Faedo
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2010

In this paper, we discuss various dependent component analysis approaches available in the literature and study their performances on the problem of separation of dependent cosmological sources from multichannel microwave radiation maps of the sky. Realisticaly simulated cosmological radiation maps are utilised in the simulations which demonstrate the superior performance obtained by tree-dependent component analysis and correlated component analysis methods when compared to classical ICA. © 2010 Springer-Verlag.


Tarini M.,CNR Institute of Information Science and Technologies Alessandro Faedo
ACM Transactions on Graphics | Year: 2016

UV-maps are required in order to apply a 2D texture over a 3D model. Conventional UV-maps are defined by an assignment of uv positions to mesh vertices. We present an alternative representation, volume-encoded UV-maps, in which each point on the surface is mapped to a uv position which is solely a function of its 3D position. This function is tailored for a target surface: its restriction to the surface is a parametrization exhibiting high quality, e.g. in terms of angle and area preservation; and, near the surface, it is almost constant for small orthogonal displacements. The representation is applicable to a wide range of shapes and UV-maps, and unlocks several key advantages: it removes the need to duplicate vertices in the mesh to encode cuts in the map; it makes the UVmap representation independent from the meshing of the surface; the same texture, and even the same UV-map, can be shared by multiple geometrically similar models (e.g. all levels of a LoD pyramid); UV-maps can be applied to representations other than polygonal meshes, like point clouds or set of registered range-maps. Our schema is cheap on GPU computational and memory resources, requiring only a single, cache-coherent indirection to a small volumetric texture per fragment. We also provide an algorithm to construct a volume-encoded UV-map given a target surface. © 2016 Copyright held by the owner/author(s).

Loading CNR Institute of Information Science and Technologies Alessandro Faedo collaborators
Loading CNR Institute of Information Science and Technologies Alessandro Faedo collaborators