2013
Report
Unknown
ENGAGED - Roadmap templates to support the cluster members in the assembly of raw roadmaps
Braun A., Chessa S., Fullaondo Zabala A.
The deliverable D4.1 - Roadmap templates to support the cluster members in the assembly of raw roadmaps is the first deliverable of WP4. The purpose of this document is to describe the procedure and provide supporting documents that will be used in creating the ENGAGED roadmaps as final results of the work package. The document first gives an overview of the rationale in deciding on the structure of the ENGAGED roadmap, using best practices by third party sources. In the following the roadmap template is described in detail. The next part summarises the Action Plans of the different Action Groups within EIP AHA. The input of those to the ENGAGED roadmap is discussed in detail and potential topics for the ENGAGED workshops are suggested. The next part of the document outlines templates for both workshop agenda and minutes that are specifically tailored to simplify the collection of the inputs relevant to the future roadmaps. Help is provided to the minute takers on filling out the templates, by giving detailed examples on all relevant parts and sections. The document concludes with a résumé and two annexes providing two blank templates for structural roadmap and workshop summary, respectively.Source: Project report, ENGAGED, Deliverable D4.1, 2013
Project(s): ENGAGED
Braun A., Chessa S., Fullaondo Zabala A.
The deliverable D4.1 - Roadmap templates to support the cluster members in the assembly of raw roadmaps is the first deliverable of WP4. The purpose of this document is to describe the procedure and provide supporting documents that will be used in creating the ENGAGED roadmaps as final results of the work package. The document first gives an overview of the rationale in deciding on the structure of the ENGAGED roadmap, using best practices by third party sources. In the following the roadmap template is described in detail. The next part summarises the Action Plans of the different Action Groups within EIP AHA. The input of those to the ENGAGED roadmap is discussed in detail and potential topics for the ENGAGED workshops are suggested. The next part of the document outlines templates for both workshop agenda and minutes that are specifically tailored to simplify the collection of the inputs relevant to the future roadmaps. Help is provided to the minute takers on filling out the templates, by giving detailed examples on all relevant parts and sections. The document concludes with a résumé and two annexes providing two blank templates for structural roadmap and workshop summary, respectively.Source: Project report, ENGAGED, Deliverable D4.1, 2013
Project(s): ENGAGED
See at: CNR ExploRA
2013
Journal article
Unknown
Epeerdemics: a peer-to-peer simulator targeting epidemic-based protocols
Dazzi P., Carlini E.
In the last decade, several P2P simulators have been proposed. Essentially, they differ in the level of abstraction provided, the programming language used and flexibility in developing protocols. To ease the evaluation and comparison of protocols, these simulators are often bundled with several well-known protocols. Unfortunately, only a few P2P simulators are specific to unstructured protocols and only a subset of them provide a bundle of epidemic-based protocols as baselines for testing. We developed Epeerdemics with the aim of filling this void. Epeerdemics is an extension to Overlay Weaver, an overlay construction toolkit widely diffused in the P2P community, mainly used for developing structured protocols. Epeerdemics is specifically designed to ease the development and testing of epidemic-based protocols. Protocols can either be developed from scratch or by extending the protocols provided with Epeerdemics.Source: ERCIM news 92 (2013): 50–51.
Dazzi P., Carlini E.
In the last decade, several P2P simulators have been proposed. Essentially, they differ in the level of abstraction provided, the programming language used and flexibility in developing protocols. To ease the evaluation and comparison of protocols, these simulators are often bundled with several well-known protocols. Unfortunately, only a few P2P simulators are specific to unstructured protocols and only a subset of them provide a bundle of epidemic-based protocols as baselines for testing. We developed Epeerdemics with the aim of filling this void. Epeerdemics is an extension to Overlay Weaver, an overlay construction toolkit widely diffused in the P2P community, mainly used for developing structured protocols. Epeerdemics is specifically designed to ease the development and testing of epidemic-based protocols. Protocols can either be developed from scratch or by extending the protocols provided with Epeerdemics.Source: ERCIM news 92 (2013): 50–51.
See at: CNR ExploRA
2013
Journal article
Open Access
Underwater scene understanding by optical and acoustic data integration
Moroni D., Pascali M. A., Reggiannini M., Salvetti O.
A new method is proposed to integrate 3D optical and acoustic images relative to the same underwater environment. The combination of optical and acoustic sensors in terms of uniform reference system, geo-referencing and time allows: (i) integration cascade (operational level), (ii) safety data acquisition in various domains (distance from ground, turbid water, vegetation, etc.), (iii) replanning of missions in progress. Furthermore, data fusion can be faced according to different approaches: (a) stratification of referenced data layers, (b) correlation of quantities of different nature, (c) comparison of extracted features: 2D geometries (segments, elementary curves) and 3D (planes, simple surfaces), repetitive patterns, (d) integration of semantic information, (e) template matching for recognizing known structures, (f) creation and refinement of probability maps as a measure of optical (geometry, texture) and acoustic (elevation or reflectivity maps) properties. A set of geometrical and textural feature extraction algorithms is applied to the multi-sensor images and the output results are compared. We aim thus at emphasizing the geometric features correspondences (e.g., lines or different kind of curves), instead of descriptor-based individual feature matching.Source: Proceedings of meetings on acoustics 17 (2013): 1–10. doi:10.1121/1.4792225
DOI: 10.1121/1.4792225
Metrics:
Moroni D., Pascali M. A., Reggiannini M., Salvetti O.
A new method is proposed to integrate 3D optical and acoustic images relative to the same underwater environment. The combination of optical and acoustic sensors in terms of uniform reference system, geo-referencing and time allows: (i) integration cascade (operational level), (ii) safety data acquisition in various domains (distance from ground, turbid water, vegetation, etc.), (iii) replanning of missions in progress. Furthermore, data fusion can be faced according to different approaches: (a) stratification of referenced data layers, (b) correlation of quantities of different nature, (c) comparison of extracted features: 2D geometries (segments, elementary curves) and 3D (planes, simple surfaces), repetitive patterns, (d) integration of semantic information, (e) template matching for recognizing known structures, (f) creation and refinement of probability maps as a measure of optical (geometry, texture) and acoustic (elevation or reflectivity maps) properties. A set of geometrical and textural feature extraction algorithms is applied to the multi-sensor images and the output results are compared. We aim thus at emphasizing the geometric features correspondences (e.g., lines or different kind of curves), instead of descriptor-based individual feature matching.Source: Proceedings of meetings on acoustics 17 (2013): 1–10. doi:10.1121/1.4792225
DOI: 10.1121/1.4792225
Metrics:
See at:
asa.scitation.org 
| asadl.org 
| doi.org | CNR ExploRA
2013
Conference article
Unknown
Autonomic preservation of "Access Copies" of digital contents
Allasia W., Falchi F., Gallo F., Meghini C.
The paper proposes the abstract approach enabling the delegation of the preservation processes that can be applied automatically to the access copies. The current standard, OAIS, is a reference model only and doesnot prescribe or even guide implementation. In particular, OAIS is designed around the Archival Information Package, leaving the Dissemination Information Package outside its boundaries. At the same time the "access copies" created as Dissemination Packages, must be preserved as well and very often can be considered as the cultural heritage the user is able to access. Small institutions as well as private users, usually cannot afford a dedicated Archival Information System for preservation and their access copies often constitute the contents themselves. This paper investigates and analyses the problem of autonomic management of the "access copies" preservation. Autonomous agents have been conceptualized in order to manage the stored contents and to keep them updated. The representation of dependencies and obsolescence has been analysed for allowing the automatic application of migration paths.Source: Memory of the World in the Digital Age: Digitization and Preservation, pp. 976–987, Vancouver, British Columbia, Canada, 26-28 September 2012
Project(s): PRESTOPRIME
Allasia W., Falchi F., Gallo F., Meghini C.
The paper proposes the abstract approach enabling the delegation of the preservation processes that can be applied automatically to the access copies. The current standard, OAIS, is a reference model only and doesnot prescribe or even guide implementation. In particular, OAIS is designed around the Archival Information Package, leaving the Dissemination Information Package outside its boundaries. At the same time the "access copies" created as Dissemination Packages, must be preserved as well and very often can be considered as the cultural heritage the user is able to access. Small institutions as well as private users, usually cannot afford a dedicated Archival Information System for preservation and their access copies often constitute the contents themselves. This paper investigates and analyses the problem of autonomic management of the "access copies" preservation. Autonomous agents have been conceptualized in order to manage the stored contents and to keep them updated. The representation of dependencies and obsolescence has been analysed for allowing the automatic application of migration paths.Source: Memory of the World in the Digital Age: Digitization and Preservation, pp. 976–987, Vancouver, British Columbia, Canada, 26-28 September 2012
Project(s): PRESTOPRIME
See at: CNR ExploRA
2013
Report
Unknown
universAAL - universAAL execution environment, installation packages, hardware abstraction layer, generic platform services, AAL platform services and ontology artefacts
Furfari F., Girolami M., Lenzi S.
Software that enables easy setup and deployment of the universAAL execution environment. Provides a uniform way for AAL services to access the hardware layer. Software that is installed on top of the universAAL execution environment, adding generic AAL service functionality. AAL platform services are software that is installed on top of the universAAL execution environment and Generic Platform services, providing business level AAL service functionality. Ontology artefacts are software and documents that enable developers to use a shared view on the AAL concepts and information modelsSource: Project report, UniversAAL, Deliverable D2.1-D e D2.2-D, 2013
Project(s): UNIVERSAAL
Furfari F., Girolami M., Lenzi S.
Software that enables easy setup and deployment of the universAAL execution environment. Provides a uniform way for AAL services to access the hardware layer. Software that is installed on top of the universAAL execution environment, adding generic AAL service functionality. AAL platform services are software that is installed on top of the universAAL execution environment and Generic Platform services, providing business level AAL service functionality. Ontology artefacts are software and documents that enable developers to use a shared view on the AAL concepts and information modelsSource: Project report, UniversAAL, Deliverable D2.1-D e D2.2-D, 2013
Project(s): UNIVERSAAL
See at: CNR ExploRA
2013
Journal article
Restricted
Sensor data fusion for activity monitoring in the PERSONA ambient assisted living project
Amoretti Michele, Copelli Sergio, Wientapper Folker, Furfari Francesco, Lenzi Stefano, Chessa Stefano
User activity monitoring is a major problem in Ambient Assisted Living, since it requires to infer new knowledge from collected and fused sensor data while dealing with highly dynamic environments, where devices continu- ously change their availability and (or) physical location. In the context of the European project PERSONA, we have developed an activity monitoring sub- system characterized by high modularity, little invasiveness of the environment and good responsiveness. In this paper we rst illustrate the functional archi- tecture of the proposed solution from a general point of view, discussing the motivations of the design. Then we describe in details the software components - Sensor Abstraction and Integration Layer, Human Posture Classi cation, Ac- tivity Monitor - and the resulting activity monitoring application, presenting also a performance evaluation.Source: Journal of Ambient Intelligence and Humanized Computing 4 (2013): 67–84. doi:10.1007/s12652-011-0095-6
DOI: 10.1007/s12652-011-0095-6
Metrics:
Amoretti Michele, Copelli Sergio, Wientapper Folker, Furfari Francesco, Lenzi Stefano, Chessa Stefano
User activity monitoring is a major problem in Ambient Assisted Living, since it requires to infer new knowledge from collected and fused sensor data while dealing with highly dynamic environments, where devices continu- ously change their availability and (or) physical location. In the context of the European project PERSONA, we have developed an activity monitoring sub- system characterized by high modularity, little invasiveness of the environment and good responsiveness. In this paper we rst illustrate the functional archi- tecture of the proposed solution from a general point of view, discussing the motivations of the design. Then we describe in details the software components - Sensor Abstraction and Integration Layer, Human Posture Classi cation, Ac- tivity Monitor - and the resulting activity monitoring application, presenting also a performance evaluation.Source: Journal of Ambient Intelligence and Humanized Computing 4 (2013): 67–84. doi:10.1007/s12652-011-0095-6
DOI: 10.1007/s12652-011-0095-6
Metrics:
See at:
Journal of Ambient Intelligence and Humanized Computing | Fraunhofer-ePrints | www.springerlink.com | CNR ExploRA
2013
Contribution to book
Restricted
Formal Methods: applying {logics in, theoretical} computer science
Latella D.
An Introduction to Formal Methods is given within the scope of the book "Formal Methods for Industrial Critical Systems: A Survey of Applications Formal Methods for Industrial Critical Systems: A Survey of Applications"Source: Formal Methods for Industrial Critical Systems: A Survey of Applications, edited by Stefania Gnesi, Tiziana Margaria, pp. 3–14. Hoboken: John Wiley & Sons Inc., 2013
DOI: 10.1002/9781118459898.ch1
Metrics:
Latella D.
An Introduction to Formal Methods is given within the scope of the book "Formal Methods for Industrial Critical Systems: A Survey of Applications Formal Methods for Industrial Critical Systems: A Survey of Applications"Source: Formal Methods for Industrial Critical Systems: A Survey of Applications, edited by Stefania Gnesi, Tiziana Margaria, pp. 3–14. Hoboken: John Wiley & Sons Inc., 2013
DOI: 10.1002/9781118459898.ch1
Metrics:
See at:
doi.org | onlinelibrary.wiley.com | CNR ExploRA
2013
Journal article
Open Access
Continuous approximation of collective systems behaviour: a tutorial
Bortolussi L., Hillston J., Latella D. : Massink M.
In this paper we present an overview of the field of deterministic approximation of Markov processes, both in discrete and continuous times. We will discuss mean field approximation of discrete time Markov chains and fluid approximation of continuous time Markov chains, considering the cases in which the deterministic limit process lives in continuous time or discrete time. We also consider some more advanced results, especially those relating to the limit stationary behaviour. We assume a knowledge of modelling with Markov chains, but not of more advanced topics in stochastic processes.Source: Performance evaluation 70 (2013): 317–349. doi:10.1016/j.peva.2013.01.001
DOI: 10.1016/j.peva.2013.01.001
Project(s): ASCENS
Metrics:
Bortolussi L., Hillston J., Latella D. : Massink M.
In this paper we present an overview of the field of deterministic approximation of Markov processes, both in discrete and continuous times. We will discuss mean field approximation of discrete time Markov chains and fluid approximation of continuous time Markov chains, considering the cases in which the deterministic limit process lives in continuous time or discrete time. We also consider some more advanced results, especially those relating to the limit stationary behaviour. We assume a knowledge of modelling with Markov chains, but not of more advanced topics in stochastic processes.Source: Performance evaluation 70 (2013): 317–349. doi:10.1016/j.peva.2013.01.001
DOI: 10.1016/j.peva.2013.01.001
Project(s): ASCENS
Metrics:
See at:
Performance Evaluation | Performance Evaluation | CNR ExploRA
2013
Contribution to book
Restricted
An application of stochastic model checking in the industry: user-centered modeling and analysis of collaboration in thinkteam
Ter Beek M. H., Gnesi S., Latella D., Massink M., Sebastianis M., Trentanni G.
In this chapter, we describe a general methodology for modeling and analyzing industrial software systems in their design phase, that is, prior to their implementation, by means of (stochastic) model checking.Source: Formal Methods for Industrial Critical Systems: A Survey of Applications, edited by Stefania Gnesi, Tiziana Margaria, pp. 179–203, 2013
DOI: 10.1002/9781118459898.ch9
Metrics:
Ter Beek M. H., Gnesi S., Latella D., Massink M., Sebastianis M., Trentanni G.
In this chapter, we describe a general methodology for modeling and analyzing industrial software systems in their design phase, that is, prior to their implementation, by means of (stochastic) model checking.Source: Formal Methods for Industrial Critical Systems: A Survey of Applications, edited by Stefania Gnesi, Tiziana Margaria, pp. 179–203, 2013
DOI: 10.1002/9781118459898.ch9
Metrics:
See at:
doi.org | onlinelibrary.wiley.com | CNR ExploRA
2013
Report
Open Access
TR 09: Coalgebraic bisimulation of FuTS
Latella D., Massink M., De Vink E.
Labeled state-to-function transition systems, FuTSs for short, capture transition schemes incorporat- ing multiplicities from states to functions of finite support over general semirings. As such FuTSs constitute a convenient modeling instrument to deal with process languages and their stochastic ex- tensions in particular. In this paper, the notion of bisimulation induced by a FuTS is addressed from a coalgebraic point of view. A correspondence result is established stating that FuTS-bisimilarity co- incides with behavioural equivalence of the associated functor. Moreover, it is shown that for FuTSs involving a specific type of semiring only, weak pullbacks are preserved. As a consequence, for these FuTSs, behavioural equivalence coincides with coalgebraic bisimilarity. As generic examples, the equivalences underlying the stochastic process algebras PEPA and IML are related to the bisimilar- ity of specific FuTSs. By the correspondence result coalgebraic justification of the equivalences of these calculi is obtained. Further illustrations of FuTS semantics are discussed for deterministically (discrete) timed process algebras and Markov Automata.Source: ISTI Technical reports, 2013
Project(s): ASCENS
Latella D., Massink M., De Vink E.
Labeled state-to-function transition systems, FuTSs for short, capture transition schemes incorporat- ing multiplicities from states to functions of finite support over general semirings. As such FuTSs constitute a convenient modeling instrument to deal with process languages and their stochastic ex- tensions in particular. In this paper, the notion of bisimulation induced by a FuTS is addressed from a coalgebraic point of view. A correspondence result is established stating that FuTS-bisimilarity co- incides with behavioural equivalence of the associated functor. Moreover, it is shown that for FuTSs involving a specific type of semiring only, weak pullbacks are preserved. As a consequence, for these FuTSs, behavioural equivalence coincides with coalgebraic bisimilarity. As generic examples, the equivalences underlying the stochastic process algebras PEPA and IML are related to the bisimilar- ity of specific FuTSs. By the correspondence result coalgebraic justification of the equivalences of these calculi is obtained. Further illustrations of FuTS semantics are discussed for deterministically (discrete) timed process algebras and Markov Automata.Source: ISTI Technical reports, 2013
Project(s): ASCENS
See at:
ISTI Repository | CNR ExploRA
2013
Journal article
Unknown
An environment supporting the production of live research objects
Assante M., Candela L., Pagano P.
Modern science communication requires innovative environment and means for providing stakeholders with scientific outcomes. Research objects are emerging as replacements of traditional "documents" in scientific communication. These objects are multi-media and multi-part objects that aggregate all the "pieces" that contribute to a research result. Supporting these objects has gone beyond the capacity of traditional technological approaches based on locally specialized data management facilities. In this article we present an environment for producing "live research objects" by exploiting the capabilities offered by a Data Infrastructure. Such environment includes: (i) a workspace where users can organize and share with their co-workers very different items in a file-system-like environment; (ii) an editing framework where users can define the structure of a live research object and compile objects that comply with one of the defined templates; and (iii) a workflow engine where users can define the workflow governing the production of a live research object by specifying the phases and the relative responsible actors(s).Source: The Grey journal (Print) 9 (2013): 24–31.
Project(s): IMARINE
Assante M., Candela L., Pagano P.
Modern science communication requires innovative environment and means for providing stakeholders with scientific outcomes. Research objects are emerging as replacements of traditional "documents" in scientific communication. These objects are multi-media and multi-part objects that aggregate all the "pieces" that contribute to a research result. Supporting these objects has gone beyond the capacity of traditional technological approaches based on locally specialized data management facilities. In this article we present an environment for producing "live research objects" by exploiting the capabilities offered by a Data Infrastructure. Such environment includes: (i) a workspace where users can organize and share with their co-workers very different items in a file-system-like environment; (ii) an editing framework where users can define the structure of a live research object and compile objects that comply with one of the defined templates; and (iii) a workflow engine where users can define the workflow governing the production of a live research object by specifying the phases and the relative responsible actors(s).Source: The Grey journal (Print) 9 (2013): 24–31.
Project(s): IMARINE
See at: CNR ExploRA
2013
Journal article
Unknown
OAIzer : customized OAI-ORE and OAI-PMH exports of compound objects for the Fedora repository
Bardi A., La Bruzzo S., Manghi P.
Modern Digital Library Systems (DLSs) are based on docu- ment models which surpass the traditional payload-metadata document model to incorporate further entities involved in the research life-cycle. Such DLSs manage graphs of interconnected objects, hence oer tools for the creation, visualization and exports of such graphs. In particular, ob- jects in the graph are exported via standard OAI-ORE and OAI-PMH pro- tocols, encoded as (XML) packages of interlinked information objects", also known as compound objects. Fedora is a well-known repository plat- form, designed to support the realization of DLSs implementing modern document models. To date, Fedora does not provide tools to customize compound object exports from DLS object graphs. This paper presents Fedora-OAIzer, an extension of Fedora which allows DLS developers to customize the structure of compound objects to be exported from a given DLS document model { expressed in terms of Fedora Content Models { and to select the OAI protocol of preference. In order to prove the com- pleteness of the approach, Fedora-OAIzer is compared to other solutions for exporting compound objects from Fedora repositories.Source: The Grey journal (Print) 9 (2013): 40–47.
Project(s): OPENAIREPLUS
Bardi A., La Bruzzo S., Manghi P.
Modern Digital Library Systems (DLSs) are based on docu- ment models which surpass the traditional payload-metadata document model to incorporate further entities involved in the research life-cycle. Such DLSs manage graphs of interconnected objects, hence oer tools for the creation, visualization and exports of such graphs. In particular, ob- jects in the graph are exported via standard OAI-ORE and OAI-PMH pro- tocols, encoded as (XML) packages of interlinked information objects", also known as compound objects. Fedora is a well-known repository plat- form, designed to support the realization of DLSs implementing modern document models. To date, Fedora does not provide tools to customize compound object exports from DLS object graphs. This paper presents Fedora-OAIzer, an extension of Fedora which allows DLS developers to customize the structure of compound objects to be exported from a given DLS document model { expressed in terms of Fedora Content Models { and to select the OAI protocol of preference. In order to prove the com- pleteness of the approach, Fedora-OAIzer is compared to other solutions for exporting compound objects from Fedora repositories.Source: The Grey journal (Print) 9 (2013): 40–47.
Project(s): OPENAIREPLUS
See at: CNR ExploRA
2013
Journal article
Open Access
An enhanced CRFs-based system for information extraction from radiology reports
Esuli A., Marcheggiani D., Sebastiani F.
We discuss the problem of performing information extraction from free-text radiology reports via supervised learning. In this task, segments of text (not necessarily coinciding with entire sentences, and possibly crossing sentence boundaries) need to be annotated with tags representing concepts of interest in the radiological domain. In this paper we present two novel approaches to IE for radiology reports: (i) a cascaded, two-stage method based on pipelining two taggers generated via the well known linear-chain conditional random fields (LC-CRFs) learner and (ii) a confidence-weighted ensemble method that combines standard LC-CRFs and the proposed two-stage method. We also report on the use of "positional features", a novel type of feature intended to aid in the automatic annotation of texts in which the instances of a given concept may be hypothesized to systematically occur in specific areas of the text. We present experiments on a dataset of mammography reports in which the proposed ensemble is shown to outperform a traditional, single-stage CRFs system in two different, applicatively interesting scenarios.Source: Journal of biomedical informatics 46 (2013): 425–435. doi:10.1016/j.jbi.2013.01.006
DOI: 10.1016/j.jbi.2013.01.006
Metrics:
Esuli A., Marcheggiani D., Sebastiani F.
We discuss the problem of performing information extraction from free-text radiology reports via supervised learning. In this task, segments of text (not necessarily coinciding with entire sentences, and possibly crossing sentence boundaries) need to be annotated with tags representing concepts of interest in the radiological domain. In this paper we present two novel approaches to IE for radiology reports: (i) a cascaded, two-stage method based on pipelining two taggers generated via the well known linear-chain conditional random fields (LC-CRFs) learner and (ii) a confidence-weighted ensemble method that combines standard LC-CRFs and the proposed two-stage method. We also report on the use of "positional features", a novel type of feature intended to aid in the automatic annotation of texts in which the instances of a given concept may be hypothesized to systematically occur in specific areas of the text. We present experiments on a dataset of mammography reports in which the proposed ensemble is shown to outperform a traditional, single-stage CRFs system in two different, applicatively interesting scenarios.Source: Journal of biomedical informatics 46 (2013): 425–435. doi:10.1016/j.jbi.2013.01.006
DOI: 10.1016/j.jbi.2013.01.006
Metrics:
See at:
Journal of Biomedical Informatics | www.sciencedirect.com | CNR ExploRA
2013
Journal article
Restricted
A mediator-based approach for integrating heterogeneous multimedia sources
Beneventano D., Gennaro C., Bergamaschi S., Rabitti F.
In many applications, the information required by the user cannot be found in just one source, but has to be retrieved from many varying sources. This is true not only of formatted data in database management systems, but also of textual documents and multimedia data, such as images and videos. We propose a mediator system that provides the end-user with a single query interface to an integrated view of multiple heterogeneous data sources. We exploit the capabilities of the MOMIS integration system and the MILOS multimedia data management system. Each multimedia source is managed by an instance of MILOS, in which a collection of multimedia records is made accessible by means of similarity searches employing the query-by-example paradigm. MOMIS provides an integrated virtual view of the underlying multimedia sources, thus offering unified multimedia access services. Two features are that MILOS is flexible--it is not tied to any particular similarity function--and the MOMIS's mediator query processor only exploits the ranks of the local answers.Source: Multimedia tools and applications 62 (2013): 427–450. doi:10.1007/s11042-011-0904-0
DOI: 10.1007/s11042-011-0904-0
Metrics:
Beneventano D., Gennaro C., Bergamaschi S., Rabitti F.
In many applications, the information required by the user cannot be found in just one source, but has to be retrieved from many varying sources. This is true not only of formatted data in database management systems, but also of textual documents and multimedia data, such as images and videos. We propose a mediator system that provides the end-user with a single query interface to an integrated view of multiple heterogeneous data sources. We exploit the capabilities of the MOMIS integration system and the MILOS multimedia data management system. Each multimedia source is managed by an instance of MILOS, in which a collection of multimedia records is made accessible by means of similarity searches employing the query-by-example paradigm. MOMIS provides an integrated virtual view of the underlying multimedia sources, thus offering unified multimedia access services. Two features are that MILOS is flexible--it is not tied to any particular similarity function--and the MOMIS's mediator query processor only exploits the ranks of the local answers.Source: Multimedia tools and applications 62 (2013): 427–450. doi:10.1007/s11042-011-0904-0
DOI: 10.1007/s11042-011-0904-0
Metrics:
See at:
Multimedia Tools and Applications | CNR ExploRA
2013
Report
Unknown
SIMPLE - Schematico e layout della board
Bertini G., Magrini M., Moroni D., Pieri G., Salvetti O.
This project report relates to SIMPLE Project http://simple.tuscany.it/ The SIMPLE (Sicurezza ferroviaria e Infrastruttura per la Mobilità applicate ai Passaggi a LivEllo) project aims to achieve an integrated and safe management of railway level crossings in the Smart City, providing at same time value-added services to citizens in the urban mobility domain. The SIMPLE system consists in two main components: one principally directed to the safety aspects of the railway level crossing and the other one which concerns the collection of data regarding the mobility in neighboring metropolitan roads and the provisioning of related services, such as indication of alternative routes to the drivers.Source: Project report, SIMPLE, Deliverable D.3.1.2, 2013
Bertini G., Magrini M., Moroni D., Pieri G., Salvetti O.
This project report relates to SIMPLE Project http://simple.tuscany.it/ The SIMPLE (Sicurezza ferroviaria e Infrastruttura per la Mobilità applicate ai Passaggi a LivEllo) project aims to achieve an integrated and safe management of railway level crossings in the Smart City, providing at same time value-added services to citizens in the urban mobility domain. The SIMPLE system consists in two main components: one principally directed to the safety aspects of the railway level crossing and the other one which concerns the collection of data regarding the mobility in neighboring metropolitan roads and the provisioning of related services, such as indication of alternative routes to the drivers.Source: Project report, SIMPLE, Deliverable D.3.1.2, 2013
See at: CNR ExploRA
2013
Journal article
Open Access
ATLAAS-P2P: A Two-Layer Architecture for Approximated Search in Peer to Peer
Baraglia R., Dazzi P., Mordacchini M., Ricci L.
ATLAAS-P2P is a two-layered peer-to-peer (P2P) architecture for developing systems, providing resource aggregation and approximated discovery in P2P networks. It gives users a flexible and easy means of searching for resources and also benefits resource providers by assisting users to find them. The process of identifying useful resources in a P2P network is highly dependent on query formulation. Users should be able to easily express their needs, and an efficient query resolution mechanism should efficiently find relevant resources and limit the number of messages exchanged. Common techniques for searching resources in P2P systems are based on range queries over a set of attributes. However, the volume of resources in a P2P network may be very large and heterogeneous, and users rarely have the appropriate knowledge about the available resources to allow them to properly formulate their queries. A user may, however, be able to define their "ideal" resource and ask the search system to find resources close to such an entity. Thus, instead of having to specify precise ranges on all attributes, the user simply has to provide an example of what is needed. This mechanism would simplify the work for users and lead to a more efficient exploitation of the search system. Moreover, it would provide an effective infrastructure for advertising for resource providers, facilitating their discovery by users.Source: ERCIM news 92 (2013).
Baraglia R., Dazzi P., Mordacchini M., Ricci L.
ATLAAS-P2P is a two-layered peer-to-peer (P2P) architecture for developing systems, providing resource aggregation and approximated discovery in P2P networks. It gives users a flexible and easy means of searching for resources and also benefits resource providers by assisting users to find them. The process of identifying useful resources in a P2P network is highly dependent on query formulation. Users should be able to easily express their needs, and an efficient query resolution mechanism should efficiently find relevant resources and limit the number of messages exchanged. Common techniques for searching resources in P2P systems are based on range queries over a set of attributes. However, the volume of resources in a P2P network may be very large and heterogeneous, and users rarely have the appropriate knowledge about the available resources to allow them to properly formulate their queries. A user may, however, be able to define their "ideal" resource and ask the search system to find resources close to such an entity. Thus, instead of having to specify precise ranges on all attributes, the user simply has to provide an example of what is needed. This mechanism would simplify the work for users and lead to a more efficient exploitation of the search system. Moreover, it would provide an effective infrastructure for advertising for resource providers, facilitating their discovery by users.Source: ERCIM news 92 (2013).
See at:
ercim-news.ercim.eu | CNR ExploRA
2013
Journal article
Open Access
A peer-to-peer recommender system for self-emerging user communities based on gossip overlays
Baraglia R., Dazzi P., Mordacchini M., Ricci L.
Gossip-based peer-to-peer protocols proved to be very efficient for supporting dynamic and complex information exchange among distributed peers. They are useful for building and maintaining the network topology itself as well as to support a pervasive diffusion of the information injected into the network. This is very useful in a world where there is a growing need to access and be aware of many types of distributed resources like Internet pages, shared files, online products, news and information. Finding flexible, scalable and efficient mechanisms addressing this topic is a key issue, even with relevant social and economic aspects. In this paper, we propose the general architecture of a system whose aim is to exploit the collaborative exchange of information between peers in order to build a system able to gather similar users and spread useful suggestions among them.Source: Journal of computer and system sciences (Print) 79 (2013): 291–308. doi:10.1016/j.jcss.2012.05.011
DOI: 10.1016/j.jcss.2012.05.011
Project(s): CONTRAIL, RECOGNITION , S-CUBE
Metrics:
Baraglia R., Dazzi P., Mordacchini M., Ricci L.
Gossip-based peer-to-peer protocols proved to be very efficient for supporting dynamic and complex information exchange among distributed peers. They are useful for building and maintaining the network topology itself as well as to support a pervasive diffusion of the information injected into the network. This is very useful in a world where there is a growing need to access and be aware of many types of distributed resources like Internet pages, shared files, online products, news and information. Finding flexible, scalable and efficient mechanisms addressing this topic is a key issue, even with relevant social and economic aspects. In this paper, we propose the general architecture of a system whose aim is to exploit the collaborative exchange of information between peers in order to build a system able to gather similar users and spread useful suggestions among them.Source: Journal of computer and system sciences (Print) 79 (2013): 291–308. doi:10.1016/j.jcss.2012.05.011
DOI: 10.1016/j.jcss.2012.05.011
Project(s): CONTRAIL
, RECOGNITION , S-CUBE Metrics:
See at:
Journal of Computer and System Sciences | www.sciencedirect.com | CNR ExploRA
2013
Journal article
Open Access
On the use of Bio-PEPA for modelling and analysing collective behaviours in swarm robotics
Massink M., Brambilla M., Latella D., Dorigo M., Birattari M.
In this paper we analyse a swarm robotics system using Bio-PEPA. Bio-PEPA is a process algebra language originally developed to analyse biochemical systems. A swarm robotics system can be analysed at two levels: the macroscopic level, to study the collective behaviour of the system, and the microscopic level, to study the robot-to-robot and robot-to- environment interactions. In general, multiple models are necessary to analyse a system at different levels. However, developing multiple models increases the effort needed to analyse a system and raises issues about the consistency of the results. Bio-PEPA, instead, allows the researcher to perform stochastic simulation, fluid flow (ODE) analysis and statistical model checking using a single description, reducing the effort necessary to perform the analysis and ensuring consistency between the results. Bio-PEPA is well suited for swarm robotics systems: by using Bio-PEPA it is possible to model distributed systems and their space- time characteristics in a natural way. We validate our approach by modelling a collective decision-making behaviour.Source: Swarm intelligence 7 (2013): 201–228. doi:10.1007/s11721-013-0079-6
DOI: 10.1007/s11721-013-0079-6
Project(s): ASCENS, E-SWARM
Metrics:
Massink M., Brambilla M., Latella D., Dorigo M., Birattari M.
In this paper we analyse a swarm robotics system using Bio-PEPA. Bio-PEPA is a process algebra language originally developed to analyse biochemical systems. A swarm robotics system can be analysed at two levels: the macroscopic level, to study the collective behaviour of the system, and the microscopic level, to study the robot-to-robot and robot-to- environment interactions. In general, multiple models are necessary to analyse a system at different levels. However, developing multiple models increases the effort needed to analyse a system and raises issues about the consistency of the results. Bio-PEPA, instead, allows the researcher to perform stochastic simulation, fluid flow (ODE) analysis and statistical model checking using a single description, reducing the effort necessary to perform the analysis and ensuring consistency between the results. Bio-PEPA is well suited for swarm robotics systems: by using Bio-PEPA it is possible to model distributed systems and their space- time characteristics in a natural way. We validate our approach by modelling a collective decision-making behaviour.Source: Swarm intelligence 7 (2013): 201–228. doi:10.1007/s11721-013-0079-6
DOI: 10.1007/s11721-013-0079-6
Project(s): ASCENS
, E-SWARM Metrics:
See at:
DI-fusion | Swarm Intelligence | link.springer.com | CNR ExploRA
2013
Journal article
Restricted
Flexible load distribution for hybrid distributed virtual environments
Carlini E., Ricci L., Coppola M.
This paper proposes an architecture for Distributed Virtual Environment (DVE) integrating cloud and peer nodes. We define the overall structure of the architecture and propose a flexible strategy to distribute the load due to the management of the entities of the DVE. The proposed approach takes into account the utilization of the nodes, the economical cost due to their use of bandwidth, and their probability failure. A greedy heuristics is exploited to reduce the computational cost of the algorithm in order to maintain a fair interactivity level to the end user of the DVE. A mobility model generating realistic Second Life traces is exploited to evaluate our algorithm. The experimental results show the effectiveness of our approach.Source: Future generation computer systems 29 (2013): 1561–1572. doi:10.1016/j.future.2012.09.004
DOI: 10.1016/j.future.2012.09.004
Project(s): CONTRAIL
Metrics:
Carlini E., Ricci L., Coppola M.
This paper proposes an architecture for Distributed Virtual Environment (DVE) integrating cloud and peer nodes. We define the overall structure of the architecture and propose a flexible strategy to distribute the load due to the management of the entities of the DVE. The proposed approach takes into account the utilization of the nodes, the economical cost due to their use of bandwidth, and their probability failure. A greedy heuristics is exploited to reduce the computational cost of the algorithm in order to maintain a fair interactivity level to the end user of the DVE. A mobility model generating realistic Second Life traces is exploited to evaluate our algorithm. The experimental results show the effectiveness of our approach.Source: Future generation computer systems 29 (2013): 1561–1572. doi:10.1016/j.future.2012.09.004
DOI: 10.1016/j.future.2012.09.004
Project(s): CONTRAIL
Metrics:
See at:
Future Generation Computer Systems | www.sciencedirect.com | CNR ExploRA
2013
Journal article
Open Access
Scalable analysis of movement data for extracting and exploring significant places
Andrienko G., Andrienko N., Hurter C., Rinzivillo S., Wroebel S.
Place-oriented analysis of movement data, i.e., recorded tracks of moving objects, includes finding places of interest in which certain types of movement events occur repeatedly and investigating the temporal distribution of event occurrences in these places and, possibly, other characteristics of the places and links between them. For this class of problems, we propose a visual analytics procedure consisting of four major steps: (1) event extraction from trajectories; (2) extraction of relevant places based on event clustering; (3) spatio-temporal aggregation of events or trajectories; (4) analysis of the aggregated data. All steps can be fulfilled in a scalable way with respect to the amount of the data under analysis; therefore, the procedure is not limited by the size of the computer's RAM and can be applied to very large datasets. We demonstrate the use of the procedure by example of two real-world problems requiring analysis at different spatial scales.Source: IEEE transactions on visualization and computer graphics (Online) 19 (2013): 1078–1094. doi:10.1109/TVCG.2012.311
DOI: 10.1109/tvcg.2012.311
Metrics:
Andrienko G., Andrienko N., Hurter C., Rinzivillo S., Wroebel S.
Place-oriented analysis of movement data, i.e., recorded tracks of moving objects, includes finding places of interest in which certain types of movement events occur repeatedly and investigating the temporal distribution of event occurrences in these places and, possibly, other characteristics of the places and links between them. For this class of problems, we propose a visual analytics procedure consisting of four major steps: (1) event extraction from trajectories; (2) extraction of relevant places based on event clustering; (3) spatio-temporal aggregation of events or trajectories; (4) analysis of the aggregated data. All steps can be fulfilled in a scalable way with respect to the amount of the data under analysis; therefore, the procedure is not limited by the size of the computer's RAM and can be applied to very large datasets. We demonstrate the use of the procedure by example of two real-world problems requiring analysis at different spatial scales.Source: IEEE transactions on visualization and computer graphics (Online) 19 (2013): 1078–1094. doi:10.1109/TVCG.2012.311
DOI: 10.1109/tvcg.2012.311
Metrics:
See at:
IEEE Transactions on Visualization and Computer Graphics | City Research Online | IEEE Transactions on Visualization and Computer Graphics | Hyper Article en Ligne | ieeexplore.ieee.org | Fraunhofer-ePrints | CNR ExploRA