B. Prosser, Neal Dawes, E. Fulp, A. McKinnon, Glenn A. Fink
Cover time measures the time (or number of steps) required for a mobile agent to visit each node in a network (graph) at least once. A short cover time is important for search or foraging applications that require mobile agents to quickly inspect or monitor nodes in a network, such as providing situational awareness or security. Speed can be achieved if details about the graph are known or if the agent maintains a history of visited nodes, however, these requirements may not be feasible for agents with limited resources, they are difficult in dynamic graph topologies, and they do not easily scale to large networks. This paper introduces a set-based form of heading (directional bias) that allows an agent to more efficiently explore any connected graph, static or dynamic. When deciding the next node to visit, agents are discouraged from visiting nodes that neighbor both their previous and current locations. Modifying a traditional movement method, e.g., random walk, with this concept encourages an agent to move toward nodes that are less likely to have been previously visited, reducing cover time. Simulation results with grid, scale-free, and minimum distance graphs demonstrate heading can consistently reduce cover time as compared to non-heading movement techniques.
{"title":"Using Set-Based Heading to Improve Mobile Agent Movement","authors":"B. Prosser, Neal Dawes, E. Fulp, A. McKinnon, Glenn A. Fink","doi":"10.1109/SASO.2014.24","DOIUrl":"https://doi.org/10.1109/SASO.2014.24","url":null,"abstract":"Cover time measures the time (or number of steps) required for a mobile agent to visit each node in a network (graph) at least once. A short cover time is important for search or foraging applications that require mobile agents to quickly inspect or monitor nodes in a network, such as providing situational awareness or security. Speed can be achieved if details about the graph are known or if the agent maintains a history of visited nodes, however, these requirements may not be feasible for agents with limited resources, they are difficult in dynamic graph topologies, and they do not easily scale to large networks. This paper introduces a set-based form of heading (directional bias) that allows an agent to more efficiently explore any connected graph, static or dynamic. When deciding the next node to visit, agents are discouraged from visiting nodes that neighbor both their previous and current locations. Modifying a traditional movement method, e.g., random walk, with this concept encourages an agent to move toward nodes that are less likely to have been previously visited, reducing cover time. Simulation results with grid, scale-free, and minimum distance graphs demonstrate heading can consistently reduce cover time as compared to non-heading movement techniques.","PeriodicalId":6458,"journal":{"name":"2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"34 1","pages":"120-128"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77623536","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Self-adaptability enables a system to adapt itself to changes in its execution conditions and user requirements in order to achieve particular quality goals. However, assuring that the adaptation goals are satisfied poses complex challenges. We recently developed the ActivFORMS approach that aims to tackle some of these challenges, but further research is required to evaluate the approach. This paper presents the results of a study in which we applied ActivFORMS to a mobile storytelling application that employs a social recommender. The initial version of the application used a static recommender that could not deal with changing environment conditions, or take into account preferences of users. To that end, we added a self-adaptive layer on top of the application. The study results show that self-adaptation significantly increases the quality of recommendations compared to the initial version by: (1) enabling the social recommender to adapt to the quality of user input and unavailability of the GPS service, and (2) making the recommender adaptive to user preferences. Providing guarantees for these adaptation goals is crucial in this domain from a business perspective. The study results show the feasibility and effectiveness of ActivFORMS for a practical application, but they also underpin the need for an integrated verification approach for self-adaptive systems that combines offline with online verification.
{"title":"Providing Assurances for Self-Adaptation in a Mobile Digital Storytelling Application Using ActivFORMS","authors":"Danny Weyns, S. Shevtsov, Sabri Pllana","doi":"10.1109/SASO.2014.23","DOIUrl":"https://doi.org/10.1109/SASO.2014.23","url":null,"abstract":"Self-adaptability enables a system to adapt itself to changes in its execution conditions and user requirements in order to achieve particular quality goals. However, assuring that the adaptation goals are satisfied poses complex challenges. We recently developed the ActivFORMS approach that aims to tackle some of these challenges, but further research is required to evaluate the approach. This paper presents the results of a study in which we applied ActivFORMS to a mobile storytelling application that employs a social recommender. The initial version of the application used a static recommender that could not deal with changing environment conditions, or take into account preferences of users. To that end, we added a self-adaptive layer on top of the application. The study results show that self-adaptation significantly increases the quality of recommendations compared to the initial version by: (1) enabling the social recommender to adapt to the quality of user input and unavailability of the GPS service, and (2) making the recommender adaptive to user preferences. Providing guarantees for these adaptation goals is crucial in this domain from a business perspective. The study results show the feasibility and effectiveness of ActivFORMS for a practical application, but they also underpin the need for an integrated verification approach for self-adaptive systems that combines offline with online verification.","PeriodicalId":6458,"journal":{"name":"2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"100 1","pages":"110-119"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86424284","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Self-adaptive systems are required to continually adapt themselves to changing environment conditions in order to maintain good quality of service. Such systems typically implement a set of self-properties (e.g., self-monitoring, self-improvement) to improve an adaptation and system's performance. Some of these properties can contribute to selection of an adequate adaptation solution with the use of decision making techniques. Appropriate decision-making technique should not only select a good quality solution to enhance performance, but also do this within a specified time bound when applied in a time-constrained environment. There are many different decision-making methods that can provide an adaptation solution, but not all are suitable for dynamic, self-adaptive systems. In this paper, we outline different decision-making techniques and implement three representative ones in a time-constrained, self-adaptive system case study -- the virtual machine (VM) placement problem. The techniques implemented are Artificial Neural Networks (ANN), Q-learning, and a technique that models the problem as a Constraint Satisfaction Problem (CSP). We compare these techniques against metrics such as execution time and decision quality.
{"title":"An Analysis of Decision-Making Techniques in Dynamic, Self-Adaptive Systems","authors":"P. Idziak, S. Clarke","doi":"10.1109/SASOW.2014.23","DOIUrl":"https://doi.org/10.1109/SASOW.2014.23","url":null,"abstract":"Self-adaptive systems are required to continually adapt themselves to changing environment conditions in order to maintain good quality of service. Such systems typically implement a set of self-properties (e.g., self-monitoring, self-improvement) to improve an adaptation and system's performance. Some of these properties can contribute to selection of an adequate adaptation solution with the use of decision making techniques. Appropriate decision-making technique should not only select a good quality solution to enhance performance, but also do this within a specified time bound when applied in a time-constrained environment. There are many different decision-making methods that can provide an adaptation solution, but not all are suitable for dynamic, self-adaptive systems. In this paper, we outline different decision-making techniques and implement three representative ones in a time-constrained, self-adaptive system case study -- the virtual machine (VM) placement problem. The techniques implemented are Artificial Neural Networks (ANN), Q-learning, and a technique that models the problem as a Constraint Satisfaction Problem (CSP). We compare these techniques against metrics such as execution time and decision quality.","PeriodicalId":6458,"journal":{"name":"2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"33 1","pages":"137-143"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86502910","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Self-expression is the capability of a system of changing its adaptation pattern at runtime, this can lead to better performance still keeping the achievement of the global goal in a Collective Adaptive System (CAS). In this paper, we show how self-expression can be achieved by means of roles. Developers can embed the adaptation logic in pieces of software that represent roles that system units can play: by changing the roles at runtime, the adaptation pattern changes as a consequence. Exploiting a swarm robotics case study, we show the applicability of our approach and the improvement of the performances with respect to keeping the same pattern during the execution.
{"title":"Enabling Self-Expression: The Use of Roles to Dynamically Change Adaptation Patterns","authors":"Mariachiara Puviani, Giacomo Cabri, L. Leonardi","doi":"10.1109/SASOW.2014.10","DOIUrl":"https://doi.org/10.1109/SASOW.2014.10","url":null,"abstract":"Self-expression is the capability of a system of changing its adaptation pattern at runtime, this can lead to better performance still keeping the achievement of the global goal in a Collective Adaptive System (CAS). In this paper, we show how self-expression can be achieved by means of roles. Developers can embed the adaptation logic in pieces of software that represent roles that system units can play: by changing the roles at runtime, the adaptation pattern changes as a consequence. Exploiting a swarm robotics case study, we show the applicability of our approach and the improvement of the performances with respect to keeping the same pattern during the execution.","PeriodicalId":6458,"journal":{"name":"2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"39 1","pages":"14-19"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85437771","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Synchronised and coordinated individual behaviours and actions in a socio-technical system could lead towards successful collective action. We present the design and implementation of a Serious Game, in which players have to self-organise the distribution of energy resources, which helps provide collective awareness, a prerequisite for collective action.
{"title":"A Game-Based Approach for Collective Action in Self-Organising Socio-technical Systems","authors":"Aikaterini Bourazeri, J. Pitt","doi":"10.1109/SASO.2014.31","DOIUrl":"https://doi.org/10.1109/SASO.2014.31","url":null,"abstract":"Synchronised and coordinated individual behaviours and actions in a socio-technical system could lead towards successful collective action. We present the design and implementation of a Serious Game, in which players have to self-organise the distribution of energy resources, which helps provide collective awareness, a prerequisite for collective action.","PeriodicalId":6458,"journal":{"name":"2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"6 1","pages":"175-176"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90739324","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper discusses the notion of self-organising and context-aware data flows, i.e. spatially-situated services made of flows of data propagating across mobile nodes, sensitive to their context and responding to it following self-organising principles. This paves the way for a new category of spatially-situated pervasive services based on data propagation among mobile devices.
{"title":"Self-Organising and Context-Aware Data Flows","authors":"F. D. Angelis, J. Fernandez-Marquez, G. Serugendo","doi":"10.1109/SASO.2014.41","DOIUrl":"https://doi.org/10.1109/SASO.2014.41","url":null,"abstract":"This paper discusses the notion of self-organising and context-aware data flows, i.e. spatially-situated services made of flows of data propagating across mobile nodes, sensitive to their context and responding to it following self-organising principles. This paves the way for a new category of spatially-situated pervasive services based on data propagation among mobile devices.","PeriodicalId":6458,"journal":{"name":"2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"14 1","pages":"195-196"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89115503","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Self-properties have introduced a novelty in the IT world: software may change during its execution by performing modifications by itself on itself. The evaluation of such systems implies the evaluation of their ability to change. The variety of possible changes makes the evaluation a challenging task. This paper aims to (1) mention the available quality evaluation mechanisms in software engineering (ranging from design principles and patterns to anti-patterns and smells, as well as metrics), (2) outline which available mechanisms have been adapted to self-systems, and (3) introduce a wish list for future research concerning the evaluation issues.
{"title":"Hints on Quality Evaluation of Self-Systems","authors":"C. Raibulet","doi":"10.1109/SASO.2014.36","DOIUrl":"https://doi.org/10.1109/SASO.2014.36","url":null,"abstract":"Self-properties have introduced a novelty in the IT world: software may change during its execution by performing modifications by itself on itself. The evaluation of such systems implies the evaluation of their ability to change. The variety of possible changes makes the evaluation a challenging task. This paper aims to (1) mention the available quality evaluation mechanisms in software engineering (ranging from design principles and patterns to anti-patterns and smells, as well as metrics), (2) outline which available mechanisms have been adapted to self-systems, and (3) introduce a wish list for future research concerning the evaluation issues.","PeriodicalId":6458,"journal":{"name":"2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"40 2 1","pages":"185-186"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90975133","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Julio Cano, É. Rutten, G. Delaval, Yazid Benazzouz, L. Gürgen
Reactive systems operate in various fields such as, surveillance systems, embedded systems and Internet of things. This paradigm can employ mechanisms of type Event - Condition -Action (ECA). It is a powerful and flexible tool to respond to complex situations. However, the behaviour of a rules based system is difficult to analyse because of the ability of rules to interact with each other. Particularly, in IoT area the rules that govern the relations between sensors and actuators will lead to highly distributed collaborative applications. Runtime coordination and formal analysis becomes a necessity to avoid side effects mainly when applications are critical. This paper presents a case study for safe applications development in IoT. Our approach proposes an extension of ECA semantic by discrete control. We defined a safe interaction properties and developed autonomous controllers that support ECA distribution.
{"title":"ECA Rules for IoT Environment: A Case Study in Safe Design","authors":"Julio Cano, É. Rutten, G. Delaval, Yazid Benazzouz, L. Gürgen","doi":"10.1109/SASOW.2014.32","DOIUrl":"https://doi.org/10.1109/SASOW.2014.32","url":null,"abstract":"Reactive systems operate in various fields such as, surveillance systems, embedded systems and Internet of things. This paradigm can employ mechanisms of type Event - Condition -Action (ECA). It is a powerful and flexible tool to respond to complex situations. However, the behaviour of a rules based system is difficult to analyse because of the ability of rules to interact with each other. Particularly, in IoT area the rules that govern the relations between sensors and actuators will lead to highly distributed collaborative applications. Runtime coordination and formal analysis becomes a necessity to avoid side effects mainly when applications are critical. This paper presents a case study for safe applications development in IoT. Our approach proposes an extension of ECA semantic by discrete control. We defined a safe interaction properties and developed autonomous controllers that support ECA distribution.","PeriodicalId":6458,"journal":{"name":"2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"3 1","pages":"116-121"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91057525","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Bio-inspired network controls are driven by the competition between their ordering force and disordering force. Both forces simultaneously affect their performance and robustness. Therefore, we must carefully determine their balance. In this paper, we focus on thermodynamic phenomena where a substance achieves the balance between both forces depending on its temperature. We translate bio-inspired network controls from the perspective of thermodynamics, and we analytically show that the appropriate balance between both forces can be achieved by selecting appropriate temperature.
{"title":"Thermodynamics-Based Strategy to Achieve Balance between Robustness and Performance for Self-Organized Network Controls","authors":"Takuya Iwai, D. Kominami, M. Murata, T. Yomo","doi":"10.1109/SASO.2014.34","DOIUrl":"https://doi.org/10.1109/SASO.2014.34","url":null,"abstract":"Bio-inspired network controls are driven by the competition between their ordering force and disordering force. Both forces simultaneously affect their performance and robustness. Therefore, we must carefully determine their balance. In this paper, we focus on thermodynamic phenomena where a substance achieves the balance between both forces depending on its temperature. We translate bio-inspired network controls from the perspective of thermodynamics, and we analytically show that the appropriate balance between both forces can be achieved by selecting appropriate temperature.","PeriodicalId":6458,"journal":{"name":"2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"1 1","pages":"181-182"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78423139","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jan Kantert, Sarah Edenhofer, Sven Tomforde, J. Hähner, C. Müller-Schloer
A Trusted Desktop Grid System (TDG) is a platform for autonomous agents to share their computing resources based on trust relationships. Thereby, agents that only use the system without a fair participation are considered as malicious. Typically, the effects of active malicious agents and high-load situations of the TDG are similar -- calling for appropriate approaches to distinguish them and, thus, allowing for counter measures to attacks. In this paper, we investigate the effect of high load to our measurements and present a concept for filtering our metrics. The evaluation demonstrated that we can normalise our metrics under high load to detect attacks with a high certainty using system-wide metrics.
{"title":"Robust Self-Monitoring in Trusted Desktop Grids for Self-Configuration at Runtime","authors":"Jan Kantert, Sarah Edenhofer, Sven Tomforde, J. Hähner, C. Müller-Schloer","doi":"10.1109/SASOW.2014.28","DOIUrl":"https://doi.org/10.1109/SASOW.2014.28","url":null,"abstract":"A Trusted Desktop Grid System (TDG) is a platform for autonomous agents to share their computing resources based on trust relationships. Thereby, agents that only use the system without a fair participation are considered as malicious. Typically, the effects of active malicious agents and high-load situations of the TDG are similar -- calling for appropriate approaches to distinguish them and, thus, allowing for counter measures to attacks. In this paper, we investigate the effect of high load to our measurements and present a concept for filtering our metrics. The evaluation demonstrated that we can normalise our metrics under high load to detect attacks with a high certainty using system-wide metrics.","PeriodicalId":6458,"journal":{"name":"2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"34 1","pages":"178-185"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88309832","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：