Anne Bumiller, Stéphanie Challita, B. Combemale, Olivier Barais, Nicolas Aillery, Gaël Le Lan
{"title":"On Understanding Context Modelling for Adaptive Authentication Systems","authors":"Anne Bumiller, Stéphanie Challita, B. Combemale, Olivier Barais, Nicolas Aillery, Gaël Le Lan","doi":"10.1145/3582696","DOIUrl":"https://doi.org/10.1145/3582696","url":null,"abstract":"In many situations, it is of interest for authentication systems to adapt to context (e.g., when the user’s behavior differs from the previous behavior). Hence, representing the context with appropriate and well-designed models is crucial. We provide a comprehensive overview and analysis of research work on Context Modelling for Adaptive Authentication systems (CM4AA). To this end, we pursue three goals based on the Systematic Mapping Study (SMS) and Systematic Literature Review (SLR) research methodologies. We first present a SMS to structure the research area of CM4AA (goal 1). We complement the SMS with an SLR to gather and synthesise evidence about context information and its modelling for adaptive authentication systems (goal 2). From the knowledge gained from goal 2, we determine the desired properties of the context information model and its use for adaptive authentication systems (goal 3). Motivated to find out how to model context information for adaptive authentication, we provide a structured survey of the literature to date on CM4AA and a classification of existing proposals according to several analysis metrics. We demonstrate the ability of capturing a common set of contextual features that are relevant for adaptive authentication systems independent from the application domain. We emphasise that despite the possibility of a unified framework, no standard for CM4AA exists.","PeriodicalId":50919,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems","volume":"18 1","pages":"1 - 35"},"PeriodicalIF":2.7,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48020704","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Modeling, Replicating, and Predicting Human Behavior: A Survey","authors":"Andrew Fuchs, Andrea Passarella, M. Conti","doi":"10.1145/3580492","DOIUrl":"https://doi.org/10.1145/3580492","url":null,"abstract":"Given the popular presupposition of human reasoning as the standard for learning and decision making, there have been significant efforts and a growing trend in research to replicate these innate human abilities in artificial systems. As such, topics including Game Theory, Theory of Mind, and Machine Learning, among others, integrate concepts that are assumed components of human reasoning. These serve as techniques to replicate and understand the behaviors of humans. In addition, next-generation autonomous and adaptive systems will largely include AI agents and humans working together as teams. To make this possible, autonomous agents will require the ability to embed practical models of human behavior, allowing them not only to replicate human models as a technique to “learn” but also to understand the actions of users and anticipate their behavior, so as to truly operate in symbiosis with them. The main objective of this article is to provide a succinct yet systematic review of important approaches in two areas dealing with quantitative models of human behaviors. Specifically, we focus on (i) techniques that learn a model or policy of behavior through exploration and feedback, such as Reinforcement Learning, and (ii) directly model mechanisms of human reasoning, such as beliefs and bias, without necessarily learning via trial and error.","PeriodicalId":50919,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems","volume":"18 1","pages":"1 - 47"},"PeriodicalIF":2.7,"publicationDate":"2023-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47959005","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jad Bassil, A. Makhoul, Benoît Piranda, J. Bourgeois
{"title":"Distributed Size-constrained Clustering Algorithm for Modular Robot-based Programmable Matter","authors":"Jad Bassil, A. Makhoul, Benoît Piranda, J. Bourgeois","doi":"10.1145/3580282","DOIUrl":"https://doi.org/10.1145/3580282","url":null,"abstract":"Modular robots are defined as autonomous kinematic machines with variable morphology. They are composed of several thousands or even millions of modules that are able to coordinate to behave intelligently. Clustering the modules in modular robots has many benefits, including scalability, energy-efficiency, reducing communication delay, and improving the self-reconfiguration process that focuses on finding a sequence of reconfiguration actions to convert robots from an initial shape to a goal one. The main idea of clustering is to divide the modules in an initial shape into a number of groups based on the final goal shape to enhance the self-reconfiguration process by allowing clusters to reconfigure in parallel. In this work, we prove that the size-constrained clustering problem is NP-complete, and we propose a new tree-based size-constrained clustering algorithm called “SC-Clust.” To show the efficiency of our approach, we implement and demonstrate our algorithm in simulation on networks of up to 30000 modules and on the Blinky Blocks hardware with up to 144 modules.","PeriodicalId":50919,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems","volume":"18 1","pages":"1 - 21"},"PeriodicalIF":2.7,"publicationDate":"2023-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45941370","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Formally Verified Scalable Look Ahead Planning For Cloud Resource Management","authors":"Farzin Zaker, Marin Litoiu, Mark Shtern","doi":"https://dl.acm.org/doi/10.1145/3555315","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3555315","url":null,"abstract":"<p>In this article, we propose and implement a distributed autonomic manager that maintains service level agreements (SLA) for each application scenario. The proposed autonomic manager supports SLAs by configuring the bandwidth ratios for each application scenario and uses an overlay network as an infrastructure. The most important aspect of the proposed autonomic manager is its scalability which allows us to deal with geographically distributed cloud-based applications and a large volume of computation. This can be useful in look ahead optimization and in adaptations using complex models, such as machine learning. We formally prove the safety and liveness properties of the implemented distributed algorithms. Through experiments on the Amazon AWS cloud, using two different use cases, we demonstrate the elasticity and flexibility of the autonomic manager as a measure of its applicability to different cloud applications with different types of workloads. Experiments also demonstrate that increasing the size of a look ahead window, up to a certain size, improves the accuracy of the adaptation decisions by up to 50%.</p>","PeriodicalId":50919,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems","volume":"7 8","pages":""},"PeriodicalIF":2.7,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138503611","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Sridhar Adepu, Nianyu Li, Eunsuk Kang, David Garlan
{"title":"Modeling and Analysis of Explanation for Secure Industrial Control Systems","authors":"Sridhar Adepu, Nianyu Li, Eunsuk Kang, David Garlan","doi":"https://dl.acm.org/doi/10.1145/3557898","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3557898","url":null,"abstract":"<p>Many self-adaptive systems benefit from human involvement and oversight, where a human operator can provide expertise not available to the system and detect problems that the system is unaware of. One way of achieving this synergy is by placing the human operator <i>on the loop</i>—i.e., providing supervisory oversight and intervening in the case of questionable adaptation decisions. To make such interaction effective, an <i>explanation</i> can play an important role in allowing the human operator to understand why the system is making certain decisions and improve the level of knowledge that the operator has about the system. This, in turn, may improve the operator’s capability to intervene and, if necessary, override the decisions being made by the system. However, explanations may incur costs, in terms of delay in actions and the possibility that a human may make a bad judgment. Hence, it is not always obvious whether an explanation will improve overall utility and, if so, then what kind of explanation should be provided to the operator. In this work, we define a formal framework for reasoning about explanations of adaptive system behaviors and the conditions under which they are warranted. Specifically, we characterize explanations in terms of explanation <i>content</i>, <i>effect</i>, and <i>cost</i>. We then present a dynamic system adaptation approach that leverages a probabilistic reasoning technique to determine when an explanation should be used to improve overall system utility. We evaluate our explanation framework in the context of a realistic industrial control system with adaptive behaviors.</p>","PeriodicalId":50919,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems","volume":"8 1","pages":""},"PeriodicalIF":2.7,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138503610","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Danny Weyns, I. Gerostathopoulos, Nadeem Abbas, J. Andersson, S. Biffl, Přemek Brada, T. Bures, A. D. Salle, M. Galster, Patricia Lago, G. Lewis, Marin Litoiu, Angelika Musil, Juergen Musil, Panos Patros, Patrizio Pelliccione
{"title":"Self-Adaptation in Industry: A Survey","authors":"Danny Weyns, I. Gerostathopoulos, Nadeem Abbas, J. Andersson, S. Biffl, Přemek Brada, T. Bures, A. D. Salle, M. Galster, Patricia Lago, G. Lewis, Marin Litoiu, Angelika Musil, Juergen Musil, Panos Patros, Patrizio Pelliccione","doi":"10.1145/3589227","DOIUrl":"https://doi.org/10.1145/3589227","url":null,"abstract":"Computing systems form the backbone of many areas in our society, from manufacturing to traffic control, healthcare, and financial systems. When software plays a vital role in the design, construction, and operation, these systems are referred to as software-intensive systems. Self-adaptation equips a software-intensive system with a feedback loop that either automates tasks that otherwise need to be performed by human operators or deals with uncertain conditions. Such feedback loops have found their way to a variety of practical applications; typical examples are an elastic cloud to adapt computing resources and automated server management to respond quickly to business needs. To gain insight into the motivations for applying self-adaptation in practice, the problems solved using self-adaptation and how these problems are solved, and the difficulties and risks that industry faces in adopting self-adaptation, we performed a large-scale survey. We received 184 valid responses from practitioners spread over 21 countries. Based on the analysis of the survey data, we provide an empirically grounded overview the of state of the practice in the application of self-adaptation. From that, we derive insights for researchers to check their current research with industrial needs, and for practitioners to compare their current practice in applying self-adaptation. These insights also provide opportunities for applying self-adaptation in practice and pave the way for future industry-research collaborations.","PeriodicalId":50919,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems","volume":"18 1","pages":"1 - 44"},"PeriodicalIF":2.7,"publicationDate":"2022-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44964349","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Veronika Lesch, Marius Hadry, Samuel Kounev, Christian Krupitzer
{"title":"Self-Aware Optimization of Adaptation Planning Strategies","authors":"Veronika Lesch, Marius Hadry, Samuel Kounev, Christian Krupitzer","doi":"https://dl.acm.org/doi/10.1145/3568680","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3568680","url":null,"abstract":"<p>In today’s world, circumstances, processes, and requirements for software systems are becoming increasingly complex. In order to operate properly in such dynamic environments, software systems must adapt to these changes, which has led to the research area of Self-Adaptive Systems (SAS). Platooning is one example of adaptive systems in Intelligent Transportation Systems, which is the ability of vehicles to travel with close inter-vehicle distances. This technology leads to an increase in road throughput and safety, which directly addresses the increased infrastructure needs due to increased traffic on the roads. However, the No-Free-Lunch theorem states that the performance of one adaptation planning strategy is not necessarily transferable to other problems. Moreover, especially in the field of SAS, the selection of the most appropriate strategy depends on the current situation of the system. In this paper, we address the problem of self-aware optimization of adaptation planning strategies by designing a framework that includes situation detection, strategy selection, and parameter optimization of the selected strategies. We apply our approach on the case study platooning coordination and evaluate the performance of the proposed framework.</p>","PeriodicalId":50919,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems","volume":"8 2","pages":""},"PeriodicalIF":2.7,"publicationDate":"2022-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138503609","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Veronika Lesch, Marius Hadry, Christian Krupitzer, Samuel Kounev
{"title":"Self-aware Optimization of Adaptation Planning Strategies","authors":"Veronika Lesch, Marius Hadry, Christian Krupitzer, Samuel Kounev","doi":"10.1145/3568680","DOIUrl":"https://doi.org/10.1145/3568680","url":null,"abstract":"In today’s world, circumstances, processes, and requirements for software systems are becoming increasingly complex. To operate properly in such dynamic environments, software systems must adapt to these changes, which has led to the research area of Self-Adaptive Systems (SAS). Platooning is one example of adaptive systems in Intelligent Transportation Systems, which is the ability of vehicles to travel with close inter-vehicle distances. This technology leads to an increase in road throughput and safety, which directly addresses the increased infrastructure needs due to increased traffic on the roads. However, the No-Free-Lunch theorem states that the performance of one adaptation planning strategy is not necessarily transferable to other problems. Moreover, especially in the field of SAS, the selection of the most appropriate strategy depends on the current situation of the system. In this article, we address the problem of self-aware optimization of adaptation planning strategies by designing a framework that includes situation detection, strategy selection, and parameter optimization of the selected strategies. We apply our approach on the case study platooning coordination and evaluate the performance of the proposed framework.","PeriodicalId":50919,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems","volume":"18 1","pages":"1 - 35"},"PeriodicalIF":2.7,"publicationDate":"2022-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48297976","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Mehdi Mashayekhi, Nirav Ajmeri, George F. List, Munindar P. Singh
{"title":"Prosocial Norm Emergence in Multi-agent Systems","authors":"Mehdi Mashayekhi, Nirav Ajmeri, George F. List, Munindar P. Singh","doi":"https://dl.acm.org/doi/10.1145/3540202","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3540202","url":null,"abstract":"<p>Multi-agent systems provide a basis for developing systems of autonomous entities and thus find application in a variety of domains. We consider a setting where not only the member agents are adaptive but also the multi-agent system viewed as an entity in its own right is adaptive. Specifically, the social structure of a multi-agent system can be reflected in the social norms among its members. It is well recognized that the norms that arise in society are not always beneficial to its members. We focus on prosocial norms, which help achieve positive outcomes for society and often provide guidance to agents to act in a manner that takes into account the welfare of others.</p><p>Specifically, we propose Cha, a framework for the emergence of prosocial norms. Unlike previous norm emergence approaches, Cha supports continual change to a system (agents may enter and leave) and dynamism (norms may change when the environment changes). Importantly, Cha agents incorporate prosocial decision-making based on inequity aversion theory, reflecting an intuition of guilt arising from being antisocial. In this manner, Cha brings together two important themes in prosociality: decision-making by individuals and fairness of system-level outcomes. We demonstrate via simulation that Cha can improve aggregate societal gains and fairness of outcomes.</p>","PeriodicalId":50919,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems","volume":"8 4","pages":""},"PeriodicalIF":2.7,"publicationDate":"2022-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138503607","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Collective Adaptive Approach to Decentralised k-Coverage in Multi-robot Systems","authors":"Danilo Pianini, Federico Pettinari, Roberto Casadei, Lukas Esterle","doi":"https://dl.acm.org/doi/10.1145/3547145","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3547145","url":null,"abstract":"<p>We focus on the online multi-object <i>k</i>-coverage problem (OMOkC), where mobile robots are required to sense a mobile target from <i>k</i> diverse points of view, coordinating themselves in a scalable and possibly decentralised way. There is active research on OMOkC, particularly in the design of decentralised algorithms for solving it. We propose a new take on the issue: Rather than classically developing new algorithms, we apply a macro-level paradigm, called <i>aggregate computing</i>, specifically designed to directly program the global behaviour of a whole <i>ensemble</i> of devices at once. To understand the potential of the application of aggregate computing to OMOkC, we extend the Alchemist simulator (supporting aggregate computing natively) with a novel toolchain component supporting the simulation of mobile robots. This way, we build a software engineering toolchain comprising language and simulation tooling for addressing OMOkC. Finally, we exercise our approach and related toolchain by introducing new algorithms for OMOkC; we show that they can be expressed concisely, reuse existing software components and perform better than the current state-of-the-art in terms of coverage over time and number of objects covered overall.</p>","PeriodicalId":50919,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems","volume":"8 5","pages":""},"PeriodicalIF":2.7,"publicationDate":"2022-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138503606","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}