N. Serbedzija, M. Ribaric, Nikola M. Tomasevic, G. Beyer
The paper describes an approach for design and development of an adaptive control framework for media-rich applications. As novel techniques require complex computation and wide spectrum of devices, a modular simulator is being developed that can be used for inexpensive and effective analyses of different design strategies. The kernel of the simulator is the same as the kernel of the real system, making the final implementation easier. Various application scenarios can be exercised and their feasibility and applicability can be tested before the actual deployment of real application is done.
{"title":"Simulating Adaptive Control in Multimedia Applications","authors":"N. Serbedzija, M. Ribaric, Nikola M. Tomasevic, G. Beyer","doi":"10.1109/SASOW.2008.59","DOIUrl":"https://doi.org/10.1109/SASOW.2008.59","url":null,"abstract":"The paper describes an approach for design and development of an adaptive control framework for media-rich applications. As novel techniques require complex computation and wide spectrum of devices, a modular simulator is being developed that can be used for inexpensive and effective analyses of different design strategies. The kernel of the simulator is the same as the kernel of the real system, making the final implementation easier. Various application scenarios can be exercised and their feasibility and applicability can be tested before the actual deployment of real application is done.","PeriodicalId":447279,"journal":{"name":"2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131290137","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}
When programming a spatial computing medium such as a cellular automaton, the hop count distance to some set of sources (particles) is an often used information. In particular, we consider the case where the sources themselves are moving. When no assumption is made on the size of the medium, that distance takes its values in the set of integers, which is not desirable, because it does not lead to finite state. This paper shows how to use the modulo operation to project that set of integer fields into a set of finite state fields. Using the modulo stored at each site, we show that we are still able to compute the local differential of the original field, allowing to manipulate the former as a directional gradient. It allows us to evaluate the direction of the nearest source, provided the sources move at bounded speed, less than one site per time unit. This information can be used to solve several problems of spatial nature. In the particular case of cellular automata, we present rules for two such problems: Voronoi diagram of moving points and convex hull.
{"title":"Integer Gradient for Cellular Automata: Principle and Examples","authors":"Luidnel Maignan, F. Gruau","doi":"10.1109/SASOW.2008.52","DOIUrl":"https://doi.org/10.1109/SASOW.2008.52","url":null,"abstract":"When programming a spatial computing medium such as a cellular automaton, the hop count distance to some set of sources (particles) is an often used information. In particular, we consider the case where the sources themselves are moving. When no assumption is made on the size of the medium, that distance takes its values in the set of integers, which is not desirable, because it does not lead to finite state. This paper shows how to use the modulo operation to project that set of integer fields into a set of finite state fields. Using the modulo stored at each site, we show that we are still able to compute the local differential of the original field, allowing to manipulate the former as a directional gradient. It allows us to evaluate the direction of the nearest source, provided the sources move at bounded speed, less than one site per time unit. This information can be used to solve several problems of spatial nature. In the particular case of cellular automata, we present rules for two such problems: Voronoi diagram of moving points and convex hull.","PeriodicalId":447279,"journal":{"name":"2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133305004","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}
Mikael Högqvist, Seif Haridi, Nico Kruber, A. Reinefeld, T. Schütt
Distributed hash tables (DHT) with order-preserving hash functions require load balancing to ensure an even item-load over all nodes. While previous item-balancing algorithms only improve the load imbalance, we argue that due to the cost of moving items, the competing goal of minimizing the used network traffic must be addressed as well. We aim to improve on existing algorithms by augmenting them with approximations of global knowledge, which can be distributed in a DHT with low cost using gossip mechanisms. In this paper we present initial simulation-based results from a decentralized balancing scheme extended with knowledge about the average node load. In addition, we discuss future work including a centralized auction-based algorithm that will be used as a benchmark.
{"title":"Using Global Information for Load Balancing in DHTs","authors":"Mikael Högqvist, Seif Haridi, Nico Kruber, A. Reinefeld, T. Schütt","doi":"10.1109/SASOW.2008.50","DOIUrl":"https://doi.org/10.1109/SASOW.2008.50","url":null,"abstract":"Distributed hash tables (DHT) with order-preserving hash functions require load balancing to ensure an even item-load over all nodes. While previous item-balancing algorithms only improve the load imbalance, we argue that due to the cost of moving items, the competing goal of minimizing the used network traffic must be addressed as well. We aim to improve on existing algorithms by augmenting them with approximations of global knowledge, which can be distributed in a DHT with low cost using gossip mechanisms. In this paper we present initial simulation-based results from a decentralized balancing scheme extended with knowledge about the average node load. In addition, we discuss future work including a centralized auction-based algorithm that will be used as a benchmark.","PeriodicalId":447279,"journal":{"name":"2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"41 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114098669","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}
Tariq Abdullah, V. Sokolov, B. Pourebrahimi, K. Bertels
Resource management for ad hoc grids is challenging due to the participation of heterogeneous, dynamic, autonomous and ephemeral nodes. Different underlying network infrastructures, and varying use and access policies make resource management even more complex. Therefore it is required to develop such a resource management mechanism that will enable the ad hoc grid to self-organize according to the workload of the resource manager. The proposed mechanism is based on the emergent behavior of the participating nodes and adapts with respect to changes in the ad hoc grid environment. Scalability and robustness of the proposed mechanism is tested by running the experiments on PlanetLab. Simulation results show that our mechanism performs better than previously proposed mechanisms.
{"title":"Self-Organizing Dynamic Ad Hoc Grids","authors":"Tariq Abdullah, V. Sokolov, B. Pourebrahimi, K. Bertels","doi":"10.1109/SASOW.2008.21","DOIUrl":"https://doi.org/10.1109/SASOW.2008.21","url":null,"abstract":"Resource management for ad hoc grids is challenging due to the participation of heterogeneous, dynamic, autonomous and ephemeral nodes. Different underlying network infrastructures, and varying use and access policies make resource management even more complex. Therefore it is required to develop such a resource management mechanism that will enable the ad hoc grid to self-organize according to the workload of the resource manager. The proposed mechanism is based on the emergent behavior of the participating nodes and adapts with respect to changes in the ad hoc grid environment. Scalability and robustness of the proposed mechanism is tested by running the experiments on PlanetLab. Simulation results show that our mechanism performs better than previously proposed mechanisms.","PeriodicalId":447279,"journal":{"name":"2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124895039","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}
In this paper we discuss a scheme that allows sensor networks to operate securely and efficiently. In this scheme after deployment the sensors go through a self-organization phase when they establish a communication pattern among themselves; then they follow this pattern through multiple activity phases when they collect, process, and transmit information. The algorithm for self-organization assumes anonymous sensors and random times of the communication events, as well as random communication frequencies; the sensors use random number generators and a set of shared seeds so no external entity can either join in, or predict the time when the sensors in the set will transmit and attempt to interfere with the transmissions. The scheme extends the lifetime of the network by reducing the power consumption; it minimizes the number of collisions experienced by a sensor when it transmits and maximizes the time a sensor is either idle or dedicated to monitoring and/or internal data processing.
{"title":"A Secure Self-Organizing Sensor Network","authors":"D. Marinescu, Chen Yu, G. Marinescu","doi":"10.1109/SASOW.2008.24","DOIUrl":"https://doi.org/10.1109/SASOW.2008.24","url":null,"abstract":"In this paper we discuss a scheme that allows sensor networks to operate securely and efficiently. In this scheme after deployment the sensors go through a self-organization phase when they establish a communication pattern among themselves; then they follow this pattern through multiple activity phases when they collect, process, and transmit information. The algorithm for self-organization assumes anonymous sensors and random times of the communication events, as well as random communication frequencies; the sensors use random number generators and a set of shared seeds so no external entity can either join in, or predict the time when the sensors in the set will transmit and attempt to interfere with the transmissions. The scheme extends the lifetime of the network by reducing the power consumption; it minimizes the number of collisions experienced by a sensor when it transmits and maximizes the time a sensor is either idle or dedicated to monitoring and/or internal data processing.","PeriodicalId":447279,"journal":{"name":"2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125049185","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}
Sven A. Brueckner, Elizabeth Downs, R. Hilscher, Andrew Yinger
Self-organizing systems are robust, scalable, adaptive to a changing environment, and tolerant to noise and incomplete or conflicting information. These are the requirements for our information matching system (IMS) that organizes models of document contents and user interest in an abstract information space by relevance to provide any-time recommendations of other users (for collaboration) or documents (for information gathering) to intelligence analysts. In this report on research-in-progress, we present a plug-and-play integration architecture for multiple and possibly competing modelers of arbitrary (text, audio, video, etc) document contents that influence the emerging arrangement of document and user models. The contributions of these modelers are numerical similarity statements that specify attractive or repulsive forces, which guide the ongoing rearrangement of the current set of models. This self-organizing force-based arrangement process adjusts dynamically to changes in the document set or shifting user interest. Our paper also discusses related research, initial experiments that indicate satisfactory system-level behavior, and an upcoming evaluation exercise with actual users.
{"title":"Self-Organizing Integration of Competing Reasoners for Information Matching","authors":"Sven A. Brueckner, Elizabeth Downs, R. Hilscher, Andrew Yinger","doi":"10.1109/SASOW.2008.54","DOIUrl":"https://doi.org/10.1109/SASOW.2008.54","url":null,"abstract":"Self-organizing systems are robust, scalable, adaptive to a changing environment, and tolerant to noise and incomplete or conflicting information. These are the requirements for our information matching system (IMS) that organizes models of document contents and user interest in an abstract information space by relevance to provide any-time recommendations of other users (for collaboration) or documents (for information gathering) to intelligence analysts. In this report on research-in-progress, we present a plug-and-play integration architecture for multiple and possibly competing modelers of arbitrary (text, audio, video, etc) document contents that influence the emerging arrangement of document and user models. The contributions of these modelers are numerical similarity statements that specify attractive or repulsive forces, which guide the ongoing rearrangement of the current set of models. This self-organizing force-based arrangement process adjusts dynamically to changes in the document set or shifting user interest. Our paper also discusses related research, initial experiments that indicate satisfactory system-level behavior, and an upcoming evaluation exercise with actual users.","PeriodicalId":447279,"journal":{"name":"2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122291642","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}
K. Herrmann, K. Rothermel, Gerd Kortuem, Naranker Dulay
The era of pervasive computing brings with it a grand challenge: Pervasive applications must adapt to the dynamics entailed in human behavior and constantly changing computing environments. In this paper, we propose adaptable pervasive flows as a novel technology that goes far beyond existing approaches for adapting pervasive computing systems. APFs model applications in a fashion similar to classical workflows while being situated in the real world. The notable advantage of this is that applications as well as their environment can be adapted proactively based on knowledge about future tasks. We introduce the visions, concepts, and challenges of this emerging approach.
{"title":"Adaptable Pervasive Flows - An Emerging Technology for Pervasive Adaptation","authors":"K. Herrmann, K. Rothermel, Gerd Kortuem, Naranker Dulay","doi":"10.1109/SASOW.2008.25","DOIUrl":"https://doi.org/10.1109/SASOW.2008.25","url":null,"abstract":"The era of pervasive computing brings with it a grand challenge: Pervasive applications must adapt to the dynamics entailed in human behavior and constantly changing computing environments. In this paper, we propose adaptable pervasive flows as a novel technology that goes far beyond existing approaches for adapting pervasive computing systems. APFs model applications in a fashion similar to classical workflows while being situated in the real world. The notable advantage of this is that applications as well as their environment can be adapted proactively based on knowledge about future tasks. We introduce the visions, concepts, and challenges of this emerging approach.","PeriodicalId":447279,"journal":{"name":"2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126843477","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
扫码关注我们
求助内容：
应助结果提醒方式：