Full Solution Indexing and Efficient Compressed Graph Representation for Web Service Composition

Service-oriented computing enhances business scalability and flexibility; providers who expect to benefit from it may bring explosive growth of web services. Searching an optimal composition solution with both functional and non-functional requirements is a computationally demanding problem: the time and space requirements may be infeasible due to the high number of available services. In this thesis, we study QoS-aware service composition problems which satisfy functional requirements as well as non-functional requirements. We use optimization algorithms to enhance accuracy of our searching algorithms. In the first approach, we propose a database-based approach to search a service composition solution. Current in-memory methods are limited by expensive and volatile physical memory, to deal with this problem, we want to use the large space available in relational database on persistence disk. In our database-based approach, all possible service combinations are generated beforehand and stored in a relational database. When a user request comes, SQL queries are composed to search in the database and K best solutions are returned. We test the performance of the proposed approach with a service challenge data set; experiment results demonstrate that this approach can always successfully find top-K valid solutions.We offer three main contributions in this approach. First, we overcome the disadvantages of in-memory composition algorithms, such as volatile and expensive, and provide a solution suitable to cloud environments. Second, we fetch top-K solutions in case the optimal solution is not available as backup solutions to the user. Third, compared with other pre-computing composition methods, we use a single SQL query: there is no need to eliminate spurious services iteratively. Then, we propose the application of a skyline operator to reduce the search space and improve the scalability. Skyline analysis returns all of the elements that are not dominated by another element. We use skyline analysis to find a set of candidate services referred to as "skyline services", therefore, less competitive services are reduced. This allows us to find a solution for a large composition problem with less storage and increased speed. In reality, different users may have same requests, we are motivated to pick some popular requests and generate paths for fast delivery. These paths are stored in a separate table of the relational database. When a user request comes, we first search to find a nearly ready-made solution. Only as a last resort do we search the table with whole paths to find a solution. Finally, to deal with the problem that the search space may explore, we apply a compressed data structure to represent the service composition graph. The goal is to allow algorithms running in in-memory over larger graphs. In this approach, we use compact K2-trees to represent the service composition graph. When a user request comes, we search the K2-tree for a satisfactory solution. We use an array to store values in the last level of the compact tree, which represents relationships between services and concepts. In our algorithms, we find services' inputs (resp. outputs) by locating elements in this array directly, therefore, decompressing the graph is unnecessary. To the best of our knowledge, our work is the first attempt to consider compact structure in solving web service composition problems. Experiment results demonstrate that this approach takes less space and has good scalability when handling a large number of web services. We provide different approaches to search a solution for the user. If the user want to find an optimal solution with fewer services, he may use the database-based approach to search for a solution. If the user want to get a solution in a short time, he may choose the in-memory approach

Composition adaptative de services pour l’Internet des objets

L'internet des objets (IoT) est une technologie émergente, qui représente l’intégration ou la fusion de l'espace d'information et de l'espace physique. Au fil du temps, l’IoT est devenu de plus en plus populaire dans plusieurs endroits. Afin de répondre à la demande compliquée des utilisateurs, la plupart des appareils IoT ne fonctionnent pas seuls, une composition de services multiples doit être effectuée et elle est définie comme la composition de services. Pour des raisons de conductivités, pannes, batterie, charge et autres, la disponibilité des services IoT est imprévisible. Cette imprévisibilité de la disponibilité et l'évolution dynamique des besoins des utilisateurs, font que la composition du service doit gérer cette dynamique et s'adapter à de nouvelles configurations non prévues à la conception. La composition adaptative des services consiste à modifier le système pour lui permettre de se comporter correctement dans différents contextes afin d'assurer la disponibilité des services offerts, afin de répondre à une situation non prévue lors de la phase de conception. De ce fait, notre objectif est de proposer une méthode de composition de services IoT adaptative et sensible au contexte afin de satisfaire les besoins des utilisateurs. Dans notre travail, nous considérons que la croissance de l'Internet des Objets (IoT) implique la disponibilité d'un très grand nombre de services qui peuvent être similaires ou identiques, la gestion de la Qualité de Service (QoS) permet de différencier un service d'un autre. La composition de services offre la possibilité d'effectuer des activités complexes en combinant les fonctionnalités de plusieurs services au sein d'un seul processus. Très peu de travaux ont présenté une solution de composition de services adaptative gérant les attributs de QoS, en plus dans le domaine de la santé, qui est l'un des plus difficiles et délicats car il concerne la précieuse vie humaine. Dans cette thèse, nous présenterons une approche de composition de services adaptative sensible aux QoS basée sur un algorithme génétique multipopulation dans un environnement Fog-IoT. Notre algorithme P-MPGA implémente une méthode de sélection intelligente qui nous permet de sélectionner le bon service. En outre, PMPGA implémente un système de surveillance qui surveille les services pour gérer le changement dynamique des environnements IoT. Les résultats expérimentaux montrent les excellents résultats du P-MPGA en termes de temps d'exécution, de valeurs de fitness moyennes et de rapport temps d'exécution / meilleure valeur de fitness malgré l'augmentation de la population. P-MPGA peut rapidement obtenir un service composite satisfaisant les besoins de QoS de l'utilisateur, ce qui le rend adapté à un environnement IoT à grande échelle

Recent Advances in Social Data and Artificial Intelligence 2019

The importance and usefulness of subjects and topics involving social data and artificial intelligence are becoming widely recognized. This book contains invited review, expository, and original research articles dealing with, and presenting state-of-the-art accounts pf, the recent advances in the subjects of social data and artificial intelligence, and potentially their links to Cyberspace

Safety and Reliability - Safe Societies in a Changing World

The contributions cover a wide range of methodologies and application areas for safety and reliability that contribute to safe societies in a changing world. These methodologies and applications include: - foundations of risk and reliability assessment and management - mathematical methods in reliability and safety - risk assessment - risk management - system reliability - uncertainty analysis - digitalization and big data - prognostics and system health management - occupational safety - accident and incident modeling - maintenance modeling and applications - simulation for safety and reliability analysis - dynamic risk and barrier management - organizational factors and safety culture - human factors and human reliability - resilience engineering - structural reliability - natural hazards - security - economic analysis in risk managemen