2013 IEEE 7th International Conference on Self-Adaptive and Self-Organizing Systems最新文献

筛选
英文 中文
JA-BE-JA: A Distributed Algorithm for Balanced Graph Partitioning JA-BE-JA:平衡图划分的分布式算法
Fatemeh Rahimian, A. H. Payberah, Sarunas Girdzijauskas, Márk Jelasity, Seif Haridi
{"title":"JA-BE-JA: A Distributed Algorithm for Balanced Graph Partitioning","authors":"Fatemeh Rahimian, A. H. Payberah, Sarunas Girdzijauskas, Márk Jelasity, Seif Haridi","doi":"10.1109/SASO.2013.13","DOIUrl":"https://doi.org/10.1109/SASO.2013.13","url":null,"abstract":"Balanced graph partitioning is a well known NP-complete problem with a wide range of applications. These applications include many large-scale distributed problems including the optimal storage of large sets of graph-structured data over several hosts-a key problem in today's Cloud infrastructure. However, in very large-scale distributed scenarios, state-of-the-art algorithms are not directly applicable, because they typically involve frequent global operations over the entire graph. In this paper, we propose a fully distributed algorithm, called JA-BE-JA, that uses local search and simulated annealing techniques for graph partitioning. The algorithm is massively parallel: there is no central coordination, each node is processed independently, and only the direct neighbors of the node, and a small subset of random nodes in the graph need to be known locally. Strict synchronization is not required. These features allow JA-BE-JA to be easily adapted to any distributed graph-processing system from data centers to fully distributed networks. We perform a thorough experimental analysis, which shows that the minimal edge-cut value achieved by JA-BE-JA is comparable to state-of-the-art centralized algorithms such as METIS. In particular, on large social networks JA-BEJA outperforms METIS, which makes JA-BE-JA-a bottom-up, self-organizing algorithm-a highly competitive practical solution for graph partitioning.","PeriodicalId":441278,"journal":{"name":"2013 IEEE 7th International Conference on Self-Adaptive and Self-Organizing Systems","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126809976","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}
引用次数: 101
Self-synchronization of Nonidentical Machines in Machine-to-Machine Systems 机器对机器系统中不相同机器的自同步
I. Bojic, M. Kusek
{"title":"Self-synchronization of Nonidentical Machines in Machine-to-Machine Systems","authors":"I. Bojic, M. Kusek","doi":"10.1109/SASO.2013.39","DOIUrl":"https://doi.org/10.1109/SASO.2013.39","url":null,"abstract":"The notion of common time is very important information in distributed systems (e.g., for maintaining the consistency of distributed data). Namely, due to the lack of global time and imperfections (e.g., skew) of physical clocks, in order to agree on common time, distributed nodes have to synchronize themselves. Imperfections of physical clocks are even more emphasized in heterogeneous distributed systems called Machine-to-Machine (M2M) systems in which communication refers to the communication among no identical machines that communicate using different types of communication technologies without, or with limited human intervention.","PeriodicalId":441278,"journal":{"name":"2013 IEEE 7th International Conference on Self-Adaptive and Self-Organizing Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129545845","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}
引用次数: 5
An Advisor Concept for Distributed Self-organizing Systems Acting in Highly Connected Environments 高度连接环境中分布式自组织系统的顾问概念
Philipp Grosselfinger, J. Denzinger, B. Bauer
{"title":"An Advisor Concept for Distributed Self-organizing Systems Acting in Highly Connected Environments","authors":"Philipp Grosselfinger, J. Denzinger, B. Bauer","doi":"10.1109/SASO.2013.15","DOIUrl":"https://doi.org/10.1109/SASO.2013.15","url":null,"abstract":"We present an extension to the concept of an advisor for distributed self-organizing systems that allows to improve the efficiency of such systems that act in environments where the actions of a system component have an influence on the whole environment or large parts of it. An advisor periodically reviews the history of the system and identifies recurring tasks that the system did not perform well. For these tasks it then computes exception rules for the agents that indicate how to perform these tasks better. These rules are communicated to the agents when communication is possible and are from then on used if they are triggered. To deal with highly connected environments so-called group exceptions are needed that consist of individual rules for several agents and that require the agents to signal to the other agents that in their local view the group rules should be triggered. We instantiated this group advisor concept to a self-organizing system for controlling water distribution networks that is based on digital infochemical coordination. In our experiments, using the group advisor resulted in improvements in energy use between 1 and 21 percent, with an average savings of $ 5,000 per day for randomly generated water demand behaviors for the real network of a small North-American city.","PeriodicalId":441278,"journal":{"name":"2013 IEEE 7th International Conference on Self-Adaptive and Self-Organizing Systems","volume":"33 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114100462","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}
引用次数: 1
Toward an Automatic, Online Behavioral Malware Classification System 一种自动在线行为恶意软件分类系统
Raymond Canzanese, M. Kam, S. Mancoridis
{"title":"Toward an Automatic, Online Behavioral Malware Classification System","authors":"Raymond Canzanese, M. Kam, S. Mancoridis","doi":"10.1109/SASO.2013.8","DOIUrl":"https://doi.org/10.1109/SASO.2013.8","url":null,"abstract":"Malware authors are increasingly using specialized toolkits and obfuscation techniques to modify existing malware and avoid detection by traditional antivirus software. The resulting proliferation of obfuscated malware variants poses a challenge to antivirus vendors, who must create signatures to detect each new malware variant. Although the many variants in a malware family have different static signatures, they share characteristic behavioral patterns resulting from their common function and heritage. We describe an automatic classification system that can be trained to accurately identify new variants within known malware families, using observed similarities in behavioral features extracted from sensors monitoring live computers hosts. We evaluate the accuracy of the classifier on a live testbed under a heavy computational load. The described classification system is intended to perform classification online, using the computed classes of newly detected malware variants to guide the automatic mitigation of infected hosts.","PeriodicalId":441278,"journal":{"name":"2013 IEEE 7th International Conference on Self-Adaptive and Self-Organizing Systems","volume":"163 2-3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116635921","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}
引用次数: 38
Tracking Time-Dependent Scalar Fields with Swarms of Mobile Sensors 用移动传感器群跟踪随时间变化的标量场
Joshua Kirby, M. M. D. Oca, S. Senger, L. Rossi, Chien-Chung Shen
{"title":"Tracking Time-Dependent Scalar Fields with Swarms of Mobile Sensors","authors":"Joshua Kirby, M. M. D. Oca, S. Senger, L. Rossi, Chien-Chung Shen","doi":"10.1109/SASO.2013.37","DOIUrl":"https://doi.org/10.1109/SASO.2013.37","url":null,"abstract":"In previous work, we introduced a novel swarming interpolation framework and validated its effectiveness on static fields. In this paper, we show that a slightly revised version of this framework is able to track fields that translate, rotate, or expand over time, enabling interpolation of both static and dynamic fields. Our framework can be used to control autonomous mobile sensors into flexible spatial arrangements in order to interpolate values of a field in an unknown region. The key advantage to this framework is that the stable sensor distribution can be chosen to resemble a Chebyshev distribution, which can be optimal for certain ideal geometries.","PeriodicalId":441278,"journal":{"name":"2013 IEEE 7th International Conference on Self-Adaptive and Self-Organizing Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116439911","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}
引用次数: 2
A Framework for the Coordination of Multiple Autonomic Managers in Cloud Environments 云环境中多个自治管理器的协调框架
F. D. Oliveira, T. Ledoux, R. Sharrock
{"title":"A Framework for the Coordination of Multiple Autonomic Managers in Cloud Environments","authors":"F. D. Oliveira, T. Ledoux, R. Sharrock","doi":"10.1109/SASO.2013.27","DOIUrl":"https://doi.org/10.1109/SASO.2013.27","url":null,"abstract":"One of the main reasons for the wide adoption of Cloud Computing is the flexibility in which resources and software services are provisioned on demand through the concept of elasticity. Implementing elasticity to tackle varying workloads while optimizing infrastructures (e.g. utilization rate) and fulfilling applications' requirements on Quality of Service still remains an open issue and should be addressed by self-adaptation techniques able to manage complexity and dynamism. However, since Cloud systems are organized indifferent but dependent Cloud layers, self-management decisions taken in isolation in a certain layer may indirectly interfere with the decision taken by an other layer and globally affect the performance of the whole Cloud stack. Indeed, non-coordinated managers may lead to conflicting decisions and consequently to non-desired states. This paper proposes a framework for the coordination of multiple autonomic managers in Cloud systems. This framework introduces two kinds of managers: (i) one for each application, and (ii)another for the infrastructure. To tackle the problem of interferences between these Cloud autonomic managers, we propose a coordination protocol based on inter-manager events and actions along with synchronization mechanisms. The goal is to improve the synergy between layers in a loose-coupling manner. We evaluated the approach through an experimental scenario on Grid'5000, a real physical infrastructure testbed. In this use case, we show that our framework improves the synergy between cloud systems while dealing with conflicting objectives and negative interferences.","PeriodicalId":441278,"journal":{"name":"2013 IEEE 7th International Conference on Self-Adaptive and Self-Organizing Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117060346","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}
引用次数: 39
A Reductionist Approach to Hypothesis-Catching for the Analysis of Self-Organizing Decision-Making Systems 自组织决策系统分析中的假设捕获还原论方法
Heiko Hamann
{"title":"A Reductionist Approach to Hypothesis-Catching for the Analysis of Self-Organizing Decision-Making Systems","authors":"Heiko Hamann","doi":"10.1109/SASO.2013.10","DOIUrl":"https://doi.org/10.1109/SASO.2013.10","url":null,"abstract":"A difficulty in analyzing self-organizing decision-making systems is their high dimensionality which needs to be reduced to allow for deep insights. Following the hypothesis that such a dimensionality reduction can only be usefully determined in an act of a low-scale scientific discovery, a recipe for a data-driven, iterative process for determining, testing, and refining hypotheses about how the system operates is presented. This recipe relies on the definition of Markov chains and their analysis based on an urn model. Positive and negative feedback loops operating on global features of the system are detected by this analysis. The workflow of this analysis process is shown in two case studies investigating the BEECLUST algorithm and collective motion in locusts. The reported recipe has the potential to be generally applicable to self-organizing collective systems and is efficient due to an incremental approach.","PeriodicalId":441278,"journal":{"name":"2013 IEEE 7th International Conference on Self-Adaptive and Self-Organizing Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116280094","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}
引用次数: 5
Complex Structures and Collective Dynamics in Networked Systems: A Tutorial 网络系统中的复杂结构和集体动力学:教程
Ingo Scholtes, M. Esch
{"title":"Complex Structures and Collective Dynamics in Networked Systems: A Tutorial","authors":"Ingo Scholtes, M. Esch","doi":"10.1109/SASO.2013.40","DOIUrl":"https://doi.org/10.1109/SASO.2013.40","url":null,"abstract":"The study of complex networks and collective dynamics occurring in biological, social and technical systems has experienced a massive surge of interest both from academia and industry. Many of the results on the mechanisms underlying the self-organized formation of complex dynamic networks in natural and man-made systems have been derived based on a statistical physics perspective. In this tutorial, we provide a basic introduction to this perspective which will help attendees to benefit from the vast literature on self-organization and self-adaptation phenomena available in the fields of network science and complex systems. We cover basic models and abstractions for the study of static complex networks as well as dynamical processes like, e.g., information diffusion, random walks, synchronization or the propagation of cascading failures. We further introduce recent advances in the study of dynamic (social) networks and demonstrate how the resulting methods can be practically applied in the engineering of self-organizing and self-adaptive distributed systems and protocols.","PeriodicalId":441278,"journal":{"name":"2013 IEEE 7th International Conference on Self-Adaptive and Self-Organizing Systems","volume":"603 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116363404","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}
引用次数: 1
Using CVL to Support Self-Adaptation of Fault-Tolerant Service Compositions 使用CVL支持容错服务组合的自适应
A. Nascimento, C. M. F. Rubira, F. C. Filho
{"title":"Using CVL to Support Self-Adaptation of Fault-Tolerant Service Compositions","authors":"A. Nascimento, C. M. F. Rubira, F. C. Filho","doi":"10.1109/SASO.2013.34","DOIUrl":"https://doi.org/10.1109/SASO.2013.34","url":null,"abstract":"We present a dynamic software product line to support fault-tolerant service compositions. Architectural variability is specified and resolved by Common Variability Language (CVL). CVL is a generic variability modeling language that enables the transformation of a product line model into a configured, new product model. At runtime, whenever it is necessary to determine a fault tolerance technique more adapted to the context (i.e. a new product) the correspondent product model is dynamically generated by executing CVL model-to-model transformation. Based on the comparison of the reflection model with the target product model, the adaptation process is fully automated.","PeriodicalId":441278,"journal":{"name":"2013 IEEE 7th International Conference on Self-Adaptive and Self-Organizing Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124504667","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}
引用次数: 3
Formal Models of Social Processes: The Pursuit of Computational Justice in Self-Organising Multi-Agent Systems 社会过程的形式模型:自组织多主体系统中对计算正义的追求
J. Pitt, D. Busquets, Régis Riveret
{"title":"Formal Models of Social Processes: The Pursuit of Computational Justice in Self-Organising Multi-Agent Systems","authors":"J. Pitt, D. Busquets, Régis Riveret","doi":"10.1109/SASO.2013.24","DOIUrl":"https://doi.org/10.1109/SASO.2013.24","url":null,"abstract":"This SASO tutorial is concerned with the pursuit of computational justice in and for self-organising systems. We contend that many aspects of self-organisation in open systems and socio-technical systems -- such as representation in collective choice arrangements, fairness in resource provision and appropriation, rewards and sanctions for compliance and non-compliance with regulations, quality assessment of self-organised structures and processes --are all underpinned by some notion of justice. We propose computational justice as an interdisciplinary research programme at an intersection between computer science and social sciences, enabling and promoting an exchange of ideas and results in both directions. The aim of this tutorial is to provide students and researchers of self-organising systems with an introduction to the idea of computational justice, its motivation, concepts, tools, methods and applications -- and many open questions.","PeriodicalId":441278,"journal":{"name":"2013 IEEE 7th International Conference on Self-Adaptive and Self-Organizing Systems","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117222899","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}
引用次数: 7
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信