Search

Change analysis of enterprise architectures is usually done by observing differences between two enterprise architectures, As-Is and To-Be. If the As-Is and To-Be have a lot of differences, it is problematic to manually create a correct view on changes. This paper proposes a revision of a definition of the Gap of Changes and defines it as a language independent analytic pattern suitable for using in tools. The paper describes a tool built on the basis of this definition. The change analysis without the tool and with the tool output has been tested in a workshop. The added value of the tool was acknowledged by the workshop participants.

Part 2: Security of Data; International audience; Along with the rapid development of ICT technologies, new areas like Industry 4.0, IoT and 5G have emerged and brought out the need for protecting shared resources and services under time-critical and energy-constrained scenarios with real-time policy-based access control. The process of policy evaluation under these circumstances must be executed within an unobservable delay and strictly comply with security objectives. To achieve this, the policy language needs to be very expressive but lightweight and efficient. Many existing implementations are using XML (Extensible Markup Language) to encode policies, which is verbose, inefficient to parse, and not readable by humans. On the contrary, JSON (JavaScript Object Notation) is a lightweight, text-based and language-independent data-interchange format that is simple for humans to read and write and easy for machines to parse and generate. Several attempts have emerged to convert existing XML policies and requests into JSON, however, there are very few policy specification proposals that are based on JSON with well-defined syntax and semantics. This paper investigates these challenges, and identifies a set of key requirements for a policy language to optimize the policy evaluation performance. According to these performance requirements, we introduce JACPoL, a descriptive, scalable and expressive policy language in JSON. JACPoL by design provides a flexible and fine-grained ABAC (Attribute-based Access Control), and meanwhile it can be easily tailored to express a broad range of other access control models. This paper systematically illustrates the design and implementation of JACPoL and evaluates it in comparison with other existing policy languages. The result shows that JACPoL can be as expressive as existing ones but more simple, scalable and efficient.

Part 3: Trusted Execution; International audience; Side-channel attacks (SCA) exploit the reification of a computation through its physical dimensions (current consumption, EM emission, ...). Focusing on Electromagnetic analyses (EMA), such analyses have mostly been considered on low-end devices: smartcards and microcontrollers. In the wake of recent works, we propose to analyze the effects of a modern microarchitecture on the efficiency of EMA (here Correlation Power Analysis and template attacks). We show that despite the difficulty to synchronize the measurements, the speed of the targeted core and the activity of other cores on the same chip can still be accommodated. Finally, we confirm that enabling the secure mode of TrustZone (a hardware-assisted software countermeasure) has no effect whatsoever on the EMA efficiency. Therefore, critical applications in TrustZone are not more secure than in the normal world with respect to EMA, in accordance with the fact that it is not a countermeasure against physical attacks. For the best of our knowledge this is the first application of EMA against TrustZone.

Part 1: Security in Emerging Systems; International audience; Fleets of UAVs will be deployed in near future in reliability and safety critical applications (e.g. for smart cities). To satisfy the stringent level of criticality, each UAV in the fleet must trust the other UAVs with which it communicates to get assurance of the trustworthiness in information received and to be sure not to disclose information to an unauthorized party. In addition, to be protected against an attacker willing to eavesdrop and/or modify the exchanged data, the communication channel needs to be secured, i.e. it has to provide confidentiality and integrity of exchanges. The work presented here is based on our previous research which concluded that it is required that each UAV includes a Secure Element (which we called ARFSSD standing for Active Radio Frequency Smart Secure Device) to withstand an adversary with a high attack potential. In this paper, we propose a secure and trusted channel protocol that satisfies the stated security and operational requirements for a UAV-to-UAV communication protocol. This protocol supports three main objectives: (1) it provides the assurance that all communicating entities can trust each other and can trust their internal (secure) software and hardware states; (2) it establishes a fair key exchange process between all communicating entities so as to provide a secure channel; (3) it is efficient for both the initial start-up of the network and when resuming a session after a cold and/or warm restart of a UAV. The proposed protocol is formally verified using CasperFDR and AVISPA.

International audience; Feature Models (FMs) have been introduced in the domain of software product lines to model and represent product variability. They have become a de facto standard, based on a logical tree structure accompanied by textual cross-tree constraints. Other representations are: (product) configuration sets from concrete software product lines, logical representations, constraint programming, or conceptual structures, coming from the Formal Concept Analysis (FCA) framework. Modeling variability through FMs may consist in extracting them from configuration sets (namely, doing FM synthesis), or designing them in several steps potentially involving several teams with different concerns. FM composition is useful in this design activity as it may assist FM iterative building. In this paper, we describe an approach, based on a configuration set and focusing on two main composition semantics (union, intersection), to assist designers in FM composition. We also introduce an approximate intersection notion. FCA is used to represent, for a product family, all the FMs that have the same configuration set through a canonical form. The approach is able to take into account cross-tree constraints and FMs with different feature sets and tree structure, thus it lets the expert free of choosing a different ontological interpretation. We describe the implementation of our approach and we present a set of concrete examples.

International audience; In the domain of software product lines, Feature Models (FM) play a central role in variability modeling, completed by configuration collections (from concrete software product lines), logical representations, constraint programming or conceptual structures, coming from the field of Formal Concept Analysis (FCA). The development of feature models may take several forms, including their synthesis from configuration collections or their design in several steps (by several teams or with different concerns). FM composition (merge) operators are part of that design activity as they assist their iterative building. In this paper, we describe an approach, based on two main merging semantics (intersection and union), which assists designers in merging several FMs. This approach benefits from the help of FCA to represent all the FMs with the same configuration set through a canonical form. We describe the implementation of our approach and present a set of concrete examples.

Cooperative distributed systems, particularly peer-to-peer systems, are the basis of several mainstream Internet applications (e.g., file-sharing, media streaming) and the key enablers of new and emerging technologies, including blockchain and the Internet of Things. Essential to the success of cooperative systems is that nodes are willing to cooperate with each other by sharing part of their resources, e.g., network bandwidth, CPU capability, storage space. However, as nodes are autonomous entities, they may be tempted to behave in a selfish manner by not contributing their fair share, potentially causing system performance degradation and instability. Addressing selfish nodes is, therefore, key to building efficient and reliable cooperative systems. Yet, it is a challenging task, as current techniques for analysing selfishness and designing effective countermeasures remain manual and time-consuming, requiring multi-domain expertise. In this thesis, we aim to provide practical and conceptual tools to help system designers in dealing with selfish nodes. First, based on a comprehensive survey of existing work on selfishness, we develop a classification framework to identify and understand the most important selfish behaviours to focus on when designing a cooperative system. Second, we propose RACOON, a unifying framework for the selfishness-aware design and configuration of cooperative systems. RACOON provides a semi-automatic methodology to integrate a given system with practical and finely tuned mechanisms to meet specified resilience and performance objectives, using game theory and simulations to predict the behaviour of the system when subjected to selfish nodes. An extension of the framework (RACOON++) is also proposed to improve the accuracy, flexibility, and usability of RACOON. Finally, we propose SEINE, a framework for fast modelling and evaluation of various types of selfish behaviour in a given cooperative system. SEINE relies on a domain-specific language for describing the selfishness scenario to evaluate and provides semi-automatic support for its implementation and study in a state-of-the-art simulator.; Les systèmes distribués collaboratifs, en particulier les systèmes pair-à-pair, forment l’infrastructure sous-jacente de nombreuses applications Internet, certaines parmi les plus populaires (ex : partage de fichiers, streaming multimédia). Ils se situent également à la base d’un ensemble de technologies émergentes telles que la blockchain et l’Internet des Objets. Le succès de ces systèmes repose sur la contribution volontaire, de la part des nœuds participants, aux ressources partagées (ex : bande passante réseau, puissance de calcul, stockage de données). Or ces nœuds sont des entités autonomes qui peuvent considérer comme plus avantageux de se comporter de manière égoïste, c’est-à-dire de refuser de collaborer. De tels comportements peuvent fortement impacter les performances et la stabilité opérationnelles du système cible. Prendre en compte et prévenir les comportements égoïstes des nœuds est donc essentiel pour garantir l’efficacité et la fiabilité des systèmes coopératifs. Cependant, cela exige du développeur, en dépit de la grande quantité de techniques et d’approches proposées dans la littérature, des connaissances multisectorielles approfondies. L'objectif de cette thèse est de concevoir et étudier de nouveaux outils théoriques et pratiques pour aider les concepteurs de systèmes distribués collaboratifs à faire face à des nœuds égoïstes. La première contribution, basée sur une analyse exhaustive de la littérature sur les comportements égoïstes dans les systèmes distribués, propose un modèle de classification pour identifier et analyser les comportements égoïstes les plus importants sur lesquels il est important de se concentrer lors de la conception d'un système coopératif. Dans la deuxième contribution, nous proposons RACOON, un framework pour la conception et la configuration de systèmes coopératifs résilients aux comportements égoïstes. Outre un ensemble de mécanismes d'incitation à la coopération, RACOON fournit une méthodologie semi-automatique d’intégration et de calibration de ces mécanismes de manière à garantir le niveau de performance souhaité. RACOON s’appuie sur une analyse du système cible fondée sur la théorie des jeux et sur des simulations pour prédire l’existence de nœuds égoïstes dans le système. RACOON a été étendu en un deuxième framework, RACOON++. Plus précis, plus flexible, RACOON++ offre également une plus grande facilité d'utilisation. Une dernière contribution, SEINE, propose un framework pour la modélisation et l'analyse des différents types de comportements égoïstes dans un système coopératif. Basé sur un langage dédié, développé pour décrire les scénarios de comportement égoïstes, SEINE fournit un support semi-automatique pour la mise en œuvre et l'étude de ces scénarios dans un simulateur choisi sur la base de l’état de l’art (PeerSim).

In this paper, we introduce an original approach that exploits time stamped geo-tagged messages posted by Twitter users through their smartphones when they travel to trace their trips.An original clustering technique is presented, that groups similartrips to define tours and analyze the popular tours in relation with local geo-located territorial resources. This objective is veryrelevant for emerging big data analytics tools.Tools developed to reconstruct and mine the most popular tours of tourists within a region are described which identify, track and group tourists' trips through a knowledge-based approach exploiting time stamped geo-tagged information associated with Twitter messages sent by tourists while traveling.The collected tracks are managed and shared on the Web in compliance with OGC standards so as to be able to analyze the characteristic of localities visited by the tourists by spatial overlaying with other open data, such as maps of Points Of Interest (POIs) of distinct type. The result is an novel Interoperable framework, based on web-service technology.

Part 4: Adoption, Use, and Impact; International audience; Background. The introduction of Open Source Software technologies in the Public Administration plays a key role in the spread of Open Source Software. The state of the art in the adoption of Open Source Software solutions in the Public Administration is not very well known even in areas like Lombardy, which is Italy’s largest and most developed region.Goal. The goal of the investigation documented in this paper is to obtain a clear picture about the introduction of Open Source Software technologies in the Public Administration, the obstacles to their adoption, and the willingness of stakeholders to proceed with their introduction.Method. We carried out a qualitative and quantitative survey that was submitted to a representative part of the Public Administrations in Lombardy.Results. The analysis of the qualitative and quantitative information shows that several Public Administrations are already using Open Source Software technologies, though not in all application areas. The savings are one frequently cited incentive to the adoption of Open Source Software. However, one obstacle is the fact that a comprehensive law on software in the Public Administration has not yet been approved.Conclusions. Our analysis provides results that indicate a common understanding of incentives, obstacles, and opportunities for Open Source Software technologies in Public Administrations.

We present a multimedia summarizer system for retrieving relevant information from some web repositories based on the extraction of semantic descriptors of documents. In particular, semantics attached to each document textual sentences is expressed as a set of assertions in the \(\langle subject,verb,object \rangle \) shape as in the RDF data model. While, images’ semantics is captured using a set of keywords derived from high level information such as the related title, description and tags. We leverage an unsupervised clustering algorithm exploiting the notion of semantic similarity and use the centroids of clusters to determine the most significant summary sentences. At the same time, several images are attached to each cluster on the base of keywords’ term frequency. Finally, several experiments are presented and discussed.

Part 3: Examples and Case Studies; International audience; Smart cities are not merely the infusion of technology into a city’s infrastructure, but also require citizens interacting with their urban environment in a smart and informed manner. Transportation is key aspect of smart cities. In this paper, we present a smart route planning open-source system; SMART-GH utilizes open data and participatory sensing, where citizens actively participate in collecting data about the city in their daily environment, e.g., noise, air pollution, etc. SMART-GH then augments the routing logic with sensor data to answer queries such as ‘return the least noisy route’. SMART-GH enables citizens to make smarter decisions about their daily commute, and subsequently improve their quality of life.

Part 6: OSS 2015 Ph.D. Contest; International audience; Open source software ecosystem modelling has emerged as an important research area in software engineering. Several models have been proposed to identify and analyse the complex relationships in OSS-ecosystems. However, there is a lack of formal models, methodologies, tool support, and standard notations for OSS-ecosystems. In this paper we propose a general framework for support the OSS-ecosystems modelling process. This framework will allow the representation, synthesis, analysis, evaluation, and evolution of OSS-ecosystems. Design science methodology is proposed to create several artefacts and investigating the suitability of these artefacts in the OSS-ecosystem context.

Part 4: Adoption, Use, and Impact; International audience; Managing risks related to OSS adoption is a must for organizations that need to smoothly integrate OSS-related practices in their development processes. Adequate tool support may pave the road to effective risk management and ensure the sustainability of such activity. In this paper, we present the RISCOSS platform for managing risks in OSS adoption. RISCOSS builds upon a highly configurable data model that allows customization to several types of scopes. It implements two different working modes: exploration, where the impact of decisions may be assessed before making them; and continuous assessment, where risk variables (and their possible consequences on business goals) are continuously monitored and reported to decision-makers. The blackboard-oriented architecture of the platform defines several interfaces for the identified techniques, allowing new techniques to be plugged in.

A Peer-to-Peer (P2P) platform is considered for collaborative Information Retrieval (IR). Each peer hosts a collection of text documents with subjects related to its owner's interests. Without a global indexing mechanism, peers locally index their documents, and provide the service to answer queries. A decentralized protocol is designed, enabling the peers to collaboratively forward queries from the initiator to the peers with relevant documents. Semantic Overlay Network (SONs) is one the state of the art solutions, where peers with semantically similar resources are clustered. IR is efficiently performed by forwarding queries to the relevant peer clusters in an informed way. SONs are built and maintained mainly via peer rewiring. Specifically, each peer periodically sends walkers to its neighborhood. The walkers walk along peer connections, aiming at discovering more similar peers to replace less similar neighbors of its initiator. The P2P network then gradually evolves from a random overlay network to a SON. Random and greedy walk can be applied individually or integrated in peer rewiring as a constant strategy during the progress of network evolution. However, the evolution of the network topology may affect their performance. For example, when peers are randomly connected with each other, random walk performs better than greedy walk for exploring similar peers. But as peer clusters gradually emerge in the network, a walker can explore more similar peers by following a greedy strategy. This thesis proposes an evolving walking strategy based on Simulated Annealing (SA), which evolves from a random walk to a greedy walk along the progress of network evolution. According to the simulation results, SA-based strategy outperforms current approaches, both in the efficiency to build a SON and the effectiveness of the subsequent IR. This thesis contains several advancements with respect to the state of the art in this field. First of all, we identify a generic peer rewiring pattern and formalize it as a three-step procedure. Our technique provides a consistent framework for peer rewiring, while allowing enough flexibility for the users/designers to specify its properties. Secondly, we formalize SON construction as a combinatorial optimization problem, with peer rewiring as its decentralized local search solution. Based on this model, we propose a novel SA-based approach to peer rewiring. Our approach is validated via an extensive experimental study on the effect of network wiring on (1) SON building and (2) IR in SONs., Nous considérons une plate-forme pair-à-pair pour la Recherche d'Information (RI) collaborative. Chaque pair héberge une collection de documents textuels qui traitent de ses sujets d'intérêt. En l'absence d'un mécanisme d'indexation global, les pairs indexent localement leurs documents et s'associent pour fournir un service distribué de réponse à des requêtes. Notre objectif est de concevoir un protocole décentralisé qui permette aux pairs de collaborer afin de transmettre une requête depuis son émetteur jusqu'aux pairs en possession de documents pertinents. Les réseaux logiques sémantiques (Semantic Overlay Networks, SON) représentent la solution de référence de l'état de l'art. Les pairs qui possèdent des ressources sémantiques similaires sont regroupés en clusters. Les opérations de RI seront alors efficaces puisqu'une requête sera transmise aux clusters de pairs qui hébergent les ressources pertinentes. La plupart des approches actuelles consistent en une reconfiguration dynamique du réseau de pairs (peer rewiring). Pour ce faire, chaque pair exécute périodiquement un algorithme de marche aléatoire ou gloutonne sur le réseau pair-à-pair afin de renouveler les pairs de son cluster. Ainsi, un réseau à la structure initialement aléatoire évolue progressivement vers un réseau logique sémantique. Jusqu'à présent, les approches existantes n'ont pas considéré que l'évolution de la topologie du réseau puisse influer sur les performances de l'algorithme de reconfiguration dynamique du réseau. Cependant, s'il est vrai que, pour une configuration initiale aléatoire des pairs, une marche aléatoire sera efficace pour découvrir les pairs similaires, lorsque des clusters commencent à émerger une approche gloutonne devient alors mieux adaptée. Ainsi, nous proposons une stratégie qui applique un algorithme de recuit simulé (Simulated Annealing, SA) afin de faire évoluer une stratégie de marche aléatoire vers une stratégie gloutonne lors de la construction du SON. Cette thèse contient plusieurs avancées concernant l'état de l'art dans ce domaine. D'abbord, nous modélisions formellement la reconfiguration dynamique d'un réseau en un SON. Nous identifions un schéma générique pour la reconfiguration d'un réseau pair-à-pair, et après le formalisons en une procédure constituée de trois étapes. Ce framework cohérent offre à ses utilisateurs de quoi le paramétrer. Ensuite, le problème de la construction d'un SON est modélisé sous la forme d'un problème d'optimisation combinatoire pour lequel les opérations de reconfiguration du réseau correspondent à la recherche décentralisée d'une solution locale. Fondée sur ce modèle, une solution concrète à base de recuit simulé est proposée. Nous menons une étude expérimentale poussée sur la construction du SON et la RI sur SONs, et validions notre approche.

International audience; In the Trusted Architecture for Securely Shared Services (TAS3) EC FP7 project we have developed a method to provide semantic support to the process modeler during the design of secure business process models. Its supporting tool, called Knowledge Annotator (KA), is using ontology-based data matching algorithms and strategy in order to infer the recommendations the best fitted to the user design intent, from a dedicated knowledge base. The paper illustrates how the strategy is used to perform the similarity (matching) check in order to retrieve the best design recommendation. We select the security and privacy domain for trust policy specification for the concept illustration. Finally, the paper discusses the evaluation of the results using the Ontology-based Data Matching Framework evaluation benchmark.

International audience; Artful processes are informal processes typically carried out by those people whose work is mental rather than physical (managers, professors, researchers, engineers, etc.), the so called “knowledge workers”. In this paper we propose the MailOfMine approach, to automatically build, on top of a collection of email messages, a set of workflow models that represent the artful processes laying behind the knowledge workers activities.

Furthermore, the authors, hope that from the assumptions and the insights of the studies reported will follow a high spread of the concept of DMSs considered as a significant contribution for developing strong innovative patterns of collaboration in Tourism Industry.

This chapter’s main objective is to provide a new conceptualization of the tourism which has major implications for management approaches, business models and strategy techniques of the sector. The objective is to try to reconcile the complexity of the environment with the managerial techniques and strategies that aim to create sustainable competitive advantage. The author will begin with a review of tourism characteristics of supply and demand side. Then they will analyze the paradigm shifts that are taking place overall in the new economy and the main challenges they bring on in the tourism context. Subsequently, they will discuss the need to realize a shift in tourism conceptualization and management in itself. The author will move their focus of analysis away from traditional, mechanical views of tourism to dynamic approaches that take into account the behavior of the overall system and help identify key leverage points of change and transformation.

This paper presents an integrated model to monitor and evaluate web 2.0 project-based learning through its application in a real higher education environment. Creating communities in the classroom has been the traditional method of engaging students. The web 2.0 technologies are changing the way learning communities interact. We designed a Social Computing Environment to support a community of students coming from Morocco, Tunisia, Egypt and Jordan involved in an International Master’s Program. This study suggests that Web 2.0 tools can be integrated in a model to assess learning effectiveness in terms of Learners’ Satisfaction, Knowledge Creation and Learning Performance. Preliminary results suggest that the Social Computing Environment helped students to better collaborate with peers, tutors and company’s supervisors, and also provided an environment where the learning assessment phase could be much easier to perform.

This paper presents the results achieved in terms of e-business capabilities developed in an International Master framed within an Euro-Medi-terranean cooperation. In particular, an e-Business Design Laboratory is here described which has been set up for designing and implementing innovative solutions to bring digital and organizational innovation in traditional and new industries. The most significant highlights of the last two editions of the Master are also reported in terms of the human, social and structural capital being generated.

Active learning is the ability of learners to carry out learning activities in such a way that they will be able to effectively and efficiently construct knowledge from information sources. Personalized and customizable access on digital materials collected from the Web according to one’s own personal requirements and interests is an example of active learning. Moreover, it is also necessary to provide techniques to locate suitable materials. In this chapter, we introduce a personalized learning environment providing intelligent support to achieve the expectations of active learning. The system exploits collaborative and semantic approaches to extract concepts from documents, and maintaining user and resources profiles based on domain ontologies. In such a way, the retrieval phase takes advantage of the common knowledge base used to extract useful knowledge and produces personalized views of the learning system.