International Conference on Move to Meaningful Internet Systems 

About: International Conference on Move to Meaningful Internet Systems is an academic conference. The conference publishes majorly in the area(s): Ontology (information science) & Web service. Over the lifetime, 1140 publications have been published by the conference receiving 17213 citations.

Reactome – a knowledgebase of biological pathways

Abstract: Reactome (www.reactome.org) is a curated database describing very diverse biological processes in a computationally accessible format The data is provided by experts in the field and subject to a peer review process The core unit of the Reactome data model is the reaction The entities participating in reactions form a network of biological interactions Reactions are grouped into pathways Reactome data are cross-referenced to a wide selection of publically available databases (such as UniProt, Ensembl, GO, PubMed), facilitating overall integration of biological data In addition to the manually curated, mainly human reactions, electronically inferred reactions to a wide range of other species, are presented on the website All Reactome reactions are displayed as arrows on a Reactionmap The Skypainter tool allows visualisation of user-supplied data by colouring the Reactionmap Reactome data are freely available and can be downloaded in a number of formats.

Process mining and verification of properties: an approach based on temporal logic

Abstract: Information systems are facing conflicting requirements. On the one hand, systems need to be adaptive and self-managing to deal with rapidly changing circumstances. On the other hand, legislation such as the Sarbanes-Oxley Act, is putting increasing demands on monitoring activities and processes. As processes and systems become more flexible, both the need for, and the complexity of monitoring increases. Our earlier work on process mining has primarily focused on process discovery, i.e., automatically constructing models describing knowledge extracted from event logs. In this paper, we focus on a different problem complementing process discovery. Given an event log and some property, we want to verify whether the property holds. For this purpose we have developed a new language based on Linear Temporal Logic (LTL) and we combine this with a standard XML format to store event logs. Given an event log and an LTL property, our LTL Checker verifies whether the observed behavior matches the (un)expected/(un)desirable behavior.

Worklets: a service-oriented implementation of dynamic flexibility in workflows

Abstract: This paper presents the realisation, using a Service Oriented Architecture, of an approach for dynamic flexibility and evolution in workflows through the support of flexible work practices, based not on proprietary frameworks, but on accepted ideas of how people actually work A set of principles have been derived from a sound theoretical base and applied to the development of worklets, an extensible repertoire of self-contained sub-processes aligned to each task, from which a dynamic runtime selection is made depending on the context of the particular work instance.

EMAP: an efficient mutual-authentication protocol for low-cost RFID tags

Abstract: RFID tags are devices of very limited computational capabilities, which only have 250-3K logic gates that can be devoted to security-related tasks Many proposals have recently appeared, but all of them are based on RFID tags using classical cryptographic primitives such as PRNGs, hash functions, block ciphers, etc We believe this assumption to be fairly unrealistic, as classical cryptographic constructions lie well beyond the computational reach of very low-cost RFID tags A new approach is necessary to tackle this problem, so we propose an extremely efficient lightweight mutual-authentication protocol that offers an adequate security level for certain applications and can be implemented even in the most limited low-cost RFID tags, as it only needs around 150 gates.

QoS-Based service selection and ranking with trust and reputation management

Abstract: QoS-based service selection mechanisms will play an essential role in service-oriented architectures, as e-Business applications want to use services that most accurately meet their requirements. Standard approaches in this field typically are based on the prediction of services’ performance from the quality advertised by providers as well as from feedback of users on the actual levels of QoS delivered to them. The key issue in this setting is to detect and deal with false ratings by dishonest providers and users, which has only received limited attention so far. In this paper, we present a new QoS-based semantic web service selection and ranking solution with the application of a trust and reputation management method to address this problem. We will give a formal description of our approach and validate it with experiments which demonstrate that our solution yields high-quality results under various realistic cheating behaviors.