Masayuki Nakamura, A. Sakurai, Takumi Yamada, Jiro Nakamura
To develop an energy-saving environment control system, we propose wireless sensor/actuator networks which classify the user's behaviors for environment control such as lighting and configure the network according to sensor node selection. In our system, a wireless remote control node monitors the user's environment control actions and occupancy sensor networks detect the user's movement simultaneously. The system learns the relationship among the responses of the remote control node and the occupancy sensor networks to classify the user's behaviors only with the occupancy sensor networks. The system chooses informative sensor nodes for the behavior classification based on the information gain criterion. These chosen nodes have high sensing cost. Sensor network routing is controlled based on the sensing cost and communication cost metric. In the resultant sensor networks, the sensing performance is the same as that in the original network, but the resources are successfully allocated to the nodes. In addition, less informative and redundant nodes are identified. We demonstrate tracking environment control behaviors and sensor node selection using the sensor/actuator networks testbed.
{"title":"Adaptive sensor/actuator networks for tracking environment control behaviors","authors":"Masayuki Nakamura, A. Sakurai, Takumi Yamada, Jiro Nakamura","doi":"10.1145/1456223.1456360","DOIUrl":"https://doi.org/10.1145/1456223.1456360","url":null,"abstract":"To develop an energy-saving environment control system, we propose wireless sensor/actuator networks which classify the user's behaviors for environment control such as lighting and configure the network according to sensor node selection. In our system, a wireless remote control node monitors the user's environment control actions and occupancy sensor networks detect the user's movement simultaneously. The system learns the relationship among the responses of the remote control node and the occupancy sensor networks to classify the user's behaviors only with the occupancy sensor networks. The system chooses informative sensor nodes for the behavior classification based on the information gain criterion. These chosen nodes have high sensing cost. Sensor network routing is controlled based on the sensing cost and communication cost metric. In the resultant sensor networks, the sensing performance is the same as that in the original network, but the resources are successfully allocated to the nodes. In addition, less informative and redundant nodes are identified. We demonstrate tracking environment control behaviors and sensor node selection using the sensor/actuator networks testbed.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"53 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133292413","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}
The use of multirobot systems, is affecting our society in a fundamental way; from their use in hazardous environments, to their application in automated environmental cleanup. In an unknown environment, one of the most important problem related to multirobot systems, is to decide how to coordinate actions in order to achieve tasks in an optimal way. Ant algorithms are proved to be very useful in solving such distributed control problems. We introduce in this paper a modified version of the known ant algorithm, called Counter-Ant Algorithm (CAA). Indeed, the robots' collaborative behaviour is based on repulsion instead of attraction to pheromone, which is a chemical matter open to evaporation and representing the core of ants' cooperation. In order to test the performance of our CAA, we implement, simulate and test our algorithm in a generic multirobot environment. In practical terms, the subdivision of the cleaning space is achieved in emergent and evolving way. A series of simulations show the usefulness of our algorithm for adaptive and cooperative cleanup.
多机器人系统的使用，正从根本上影响着我们的社会;从它们在危险环境中的使用，到它们在自动环境清理中的应用。在未知环境下，多机器人系统的一个重要问题是如何协调行动，以最优方式完成任务。蚁群算法被证明在解决这种分布式控制问题方面非常有用。本文介绍了一种已知蚂蚁算法的改进版本，称为反蚂蚁算法(anti - ant algorithm, CAA)。事实上，机器人的合作行为是基于对信息素的排斥而不是吸引，信息素是一种容易蒸发的化学物质，代表了蚂蚁合作的核心。为了测试我们的CAA的性能，我们在一个通用的多机器人环境中实现、模拟和测试了我们的算法。在实践中，清洁空间的细分是以突现和演化的方式实现的。一系列的仿真表明了我们的算法在自适应和协作清理方面的有效性。
{"title":"Counter-ant algorithm for evolving multirobot collaboration","authors":"Abdelhak Chatty, I. Kallel, A. Alimi","doi":"10.1145/1456223.1456245","DOIUrl":"https://doi.org/10.1145/1456223.1456245","url":null,"abstract":"The use of multirobot systems, is affecting our society in a fundamental way; from their use in hazardous environments, to their application in automated environmental cleanup. In an unknown environment, one of the most important problem related to multirobot systems, is to decide how to coordinate actions in order to achieve tasks in an optimal way. Ant algorithms are proved to be very useful in solving such distributed control problems. We introduce in this paper a modified version of the known ant algorithm, called Counter-Ant Algorithm (CAA). Indeed, the robots' collaborative behaviour is based on repulsion instead of attraction to pheromone, which is a chemical matter open to evaporation and representing the core of ants' cooperation. In order to test the performance of our CAA, we implement, simulate and test our algorithm in a generic multirobot environment. In practical terms, the subdivision of the cleaning space is achieved in emergent and evolving way. A series of simulations show the usefulness of our algorithm for adaptive and cooperative cleanup.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134047114","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}
Policies are familiar approach to preserve security and privacy of the Web contents and services. This paper is going to address the policy based constrained access to the home contents and services but in the context of distributed but connected devices. A community concept equipped with trust metric is introduced to facilitate such restricted access. The community structure is maintained through a knowledge base exploiting Web Ontology Language and the policies are formulated using Semantic Web Rule Language. Reasoner then executes the policies to derive the access authorization results. In this paper, we provide a prototypical implementation of the whole scenario where a community member can download videos from the owner's home devices through a Web application. Besides, this paper critically investigates several challenges of the proposed approach with regard to various implementation issues.
策略是维护Web内容和服务的安全性和隐私性的常用方法。本文将讨论基于对家庭内容和服务的受限访问的策略，但在分布式但连接的设备的背景下。引入了带有信任度量的社区概念来促进这种受限访问。利用Web本体语言(Web Ontology Language)建立知识库，维护社区结构;利用语义Web规则语言(Semantic Web Rule Language)制定策略。然后，Reasoner执行策略以派生访问授权结果。在本文中，我们提供了整个场景的原型实现，其中社区成员可以通过Web应用程序从所有者的家庭设备下载视频。此外，本文批判性地调查了关于各种实施问题的拟议方法的几个挑战。
{"title":"Policy based access for home contents and services","authors":"M. Chowdhury, Sarfraz Alam, Josef Noll","doi":"10.1145/1456223.1456288","DOIUrl":"https://doi.org/10.1145/1456223.1456288","url":null,"abstract":"Policies are familiar approach to preserve security and privacy of the Web contents and services. This paper is going to address the policy based constrained access to the home contents and services but in the context of distributed but connected devices. A community concept equipped with trust metric is introduced to facilitate such restricted access. The community structure is maintained through a knowledge base exploiting Web Ontology Language and the policies are formulated using Semantic Web Rule Language. Reasoner then executes the policies to derive the access authorization results. In this paper, we provide a prototypical implementation of the whole scenario where a community member can download videos from the owner's home devices through a Web application. Besides, this paper critically investigates several challenges of the proposed approach with regard to various implementation issues.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134080246","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}
S. Stojanov, Ivan Ganchev, M. O'Droma, D. Mitev, I. Minov
A software architecture for context-aware mLearning provision via InfoStations within a University Campus is presented. The multi-agent nature of the proposed architecture receives particular attention.
{"title":"Multi-agent architecture for context-aware mLearning provision via InfoStations","authors":"S. Stojanov, Ivan Ganchev, M. O'Droma, D. Mitev, I. Minov","doi":"10.1145/1456223.1456334","DOIUrl":"https://doi.org/10.1145/1456223.1456334","url":null,"abstract":"A software architecture for context-aware mLearning provision via InfoStations within a University Campus is presented. The multi-agent nature of the proposed architecture receives particular attention.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133417680","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}
Linear Ordering Problem (LOP) is a well know optimization problem attractive for its complexity (it is a NP-hard problem), rich collection of testing data and variety of real world applications. In this paper, we investigate the usage and performance of two variants of Genetic Algorithms - Mutation Only Genetic Algorithms and Higher Level Chromosome Genetic Algorithms - on the Linear Ordering Problem. Both methods are tested and evaluated on a collection of real world and artificial LOP instances.
{"title":"Evolving feasible linear ordering problem solutions","authors":"P. Krömer, V. Snás̃el, J. Platoš","doi":"10.1145/1456223.1456293","DOIUrl":"https://doi.org/10.1145/1456223.1456293","url":null,"abstract":"Linear Ordering Problem (LOP) is a well know optimization problem attractive for its complexity (it is a NP-hard problem), rich collection of testing data and variety of real world applications. In this paper, we investigate the usage and performance of two variants of Genetic Algorithms - Mutation Only Genetic Algorithms and Higher Level Chromosome Genetic Algorithms - on the Linear Ordering Problem. Both methods are tested and evaluated on a collection of real world and artificial LOP instances.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133483503","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}
Sensor webs consist of a large collection of small nodes providing collaborative and distributed sensing ability in unpredictable environments. Nodes composing such sensor webs, are characterized by their resource restrictions, especially the energy, the processing, and the communication capacities. These nodes are also in constant interaction with each other and with their geographic environment. An efficient system aiming at managing sensor webs must take into account the evolution of the sensor nodes as well as the geographic environment. Such a management process involves coping with a variety of dynamic variables including the nodes characteristics, the environment properties as well as the sensed data. In this context, Multi-Agent Geo-Simulation (MAGS) provides a flexible approach that can be used to easily analyse complex systems such as sensor webs in large scale georeferenced environments. The purpose of this paper is to present SensorMAGS, an agent-based geo-simulation system which manages sensor nodes in virtual geographic environments. This system is applied in the context of a water resource monitoring project.
{"title":"Using multi-agent geo-simulation techniques for intelligent sensor web management","authors":"M. Mekni, B. Moulin","doi":"10.1145/1456223.1456358","DOIUrl":"https://doi.org/10.1145/1456223.1456358","url":null,"abstract":"Sensor webs consist of a large collection of small nodes providing collaborative and distributed sensing ability in unpredictable environments. Nodes composing such sensor webs, are characterized by their resource restrictions, especially the energy, the processing, and the communication capacities. These nodes are also in constant interaction with each other and with their geographic environment. An efficient system aiming at managing sensor webs must take into account the evolution of the sensor nodes as well as the geographic environment. Such a management process involves coping with a variety of dynamic variables including the nodes characteristics, the environment properties as well as the sensed data. In this context, Multi-Agent Geo-Simulation (MAGS) provides a flexible approach that can be used to easily analyse complex systems such as sensor webs in large scale georeferenced environments. The purpose of this paper is to present SensorMAGS, an agent-based geo-simulation system which manages sensor nodes in virtual geographic environments. This system is applied in the context of a water resource monitoring project.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115424201","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}
S. Grzonkowski, Wojciech Zaremba, Maciej Zaremba, B. McDaniel
User authentication is a crucial requirement for secure transactions and access to the sensitive resources on the Web. We propose, implement and evaluate a Zero-Knowledge Proof Authentication (ZKP) algorithm based on isomorphic graphs. The proposed mechanism allows for authentication with varying confidence and security levels. We suggest that most of the computations should be carried out by the user's web browser without revealing password or login at any point in time; instead generated random isomorphic graphs and permutation functions based on the user login/password can be exchanged. Our experimental evaluation shows that by combining the asynchronous web with ZKP protocols, it is feasible to satisfy existing usability standards on the web.
{"title":"Extending web applications with a lightweight zero knowledge proof authentication","authors":"S. Grzonkowski, Wojciech Zaremba, Maciej Zaremba, B. McDaniel","doi":"10.1145/1456223.1456241","DOIUrl":"https://doi.org/10.1145/1456223.1456241","url":null,"abstract":"User authentication is a crucial requirement for secure transactions and access to the sensitive resources on the Web. We propose, implement and evaluate a Zero-Knowledge Proof Authentication (ZKP) algorithm based on isomorphic graphs. The proposed mechanism allows for authentication with varying confidence and security levels.\u0000 We suggest that most of the computations should be carried out by the user's web browser without revealing password or login at any point in time; instead generated random isomorphic graphs and permutation functions based on the user login/password can be exchanged.\u0000 Our experimental evaluation shows that by combining the asynchronous web with ZKP protocols, it is feasible to satisfy existing usability standards on the web.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127955941","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}
Nowadays the Internet has become a reference on information retrieval. But this can be misused, as one can simply access information and take it as his own authorship. This constitutes an act of plagiarism. It has become increasingly common for people to do this, and tools to prevent this are in need. In order to help to deal with this relevant problem, this paper presents the PeerDetect, a new P2P middleware to support a plagiarism detection system. The proposed solution is based on a P2P network, where a plagiarism detection mechanism uses PeerDetect to distribute the effort of doing this detection among peers. The proposed approach allows us to reach a better performance and scalability.
{"title":"Design of a P2P infrastructure to support plagiarism detection mechanisms","authors":"J. Mussini, L. Lung, F. Favarim","doi":"10.1145/1456223.1456257","DOIUrl":"https://doi.org/10.1145/1456223.1456257","url":null,"abstract":"Nowadays the Internet has become a reference on information retrieval. But this can be misused, as one can simply access information and take it as his own authorship. This constitutes an act of plagiarism. It has become increasingly common for people to do this, and tools to prevent this are in need. In order to help to deal with this relevant problem, this paper presents the PeerDetect, a new P2P middleware to support a plagiarism detection system. The proposed solution is based on a P2P network, where a plagiarism detection mechanism uses PeerDetect to distribute the effort of doing this detection among peers. The proposed approach allows us to reach a better performance and scalability.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117094503","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 introduce a novel procedure, based on (fuzzy) clustering comparison techniques, to identify association rules between clusters. The procedure we propose is largely based on the use of clustering comparison techniques that we generalized to the fuzzy context. The described methodology can be useful for exploratory data analysis; its complexity is linear to the number of the entities in the data set.
{"title":"Identification of association rules between clusters","authors":"M. Pagani, Gloria Bordogna","doi":"10.1145/1456223.1456307","DOIUrl":"https://doi.org/10.1145/1456223.1456307","url":null,"abstract":"In this paper we introduce a novel procedure, based on (fuzzy) clustering comparison techniques, to identify association rules between clusters.\u0000 The procedure we propose is largely based on the use of clustering comparison techniques that we generalized to the fuzzy context. The described methodology can be useful for exploratory data analysis; its complexity is linear to the number of the entities in the data set.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117096806","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}
Mehdi Moghadam Fard, Maryam Moghadam Fard, B. Minaei-Bidgoli, M. Hussain
In this paper a new Persian on-line handwritten character recognition system using neural network is presented. The proposed system is based-on a newly developed Spatio-Temporal Artificial Neuron (STAN) which is well adapted for the recognition of Spatio-Temporal patterns. In this model the strokes of a character generated by a digitizing tablet is presented in form of a sequence of spikes corresponding to displacement of the stylus. The architecture of the proposed system is based on three modules preprocessing, spike extraction and classification. The second and third modules are based on neural architectures which have STANs as their neurons. Our database comprises the handwritings of 80 persons. Each person has written 10 times each of 32 characters
{"title":"Persian on-line handwritten character recognition by RCE spatio-temporal neural network","authors":"Mehdi Moghadam Fard, Maryam Moghadam Fard, B. Minaei-Bidgoli, M. Hussain","doi":"10.1145/1456223.1456246","DOIUrl":"https://doi.org/10.1145/1456223.1456246","url":null,"abstract":"In this paper a new Persian on-line handwritten character recognition system using neural network is presented. The proposed system is based-on a newly developed Spatio-Temporal Artificial Neuron (STAN) which is well adapted for the recognition of Spatio-Temporal patterns. In this model the strokes of a character generated by a digitizing tablet is presented in form of a sequence of spikes corresponding to displacement of the stylus. The architecture of the proposed system is based on three modules preprocessing, spike extraction and classification. The second and third modules are based on neural architectures which have STANs as their neurons. Our database comprises the handwritings of 80 persons. Each person has written 10 times each of 32 characters","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126782536","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
扫码关注我们
求助内容：
应助结果提醒方式：