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}
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}
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}
Component Based Software Engineering (CBSE) is concerned with the assembly of pre-existing software components that leads to a software system that responds to client-specific requirements. Component selection and component systems assembly have become two of the key issues involved in this process. This work presents an approach for component selection, solution based on maximum number of provided operations that satisfy the current requirements. Another contribution of this paper addresses the problem of automatic assembly of component systems. The algorithm CSAC (Component System Automatic Configurations) is presented. With our case study we show that our approach is efficient and generally applicable in practical scenarios.
{"title":"Automatic configuration for the component selection problem","authors":"A. Vescan, Horia F. Pop","doi":"10.1145/1456223.1456321","DOIUrl":"https://doi.org/10.1145/1456223.1456321","url":null,"abstract":"Component Based Software Engineering (CBSE) is concerned with the assembly of pre-existing software components that leads to a software system that responds to client-specific requirements. Component selection and component systems assembly have become two of the key issues involved in this process.\u0000 This work presents an approach for component selection, solution based on maximum number of provided operations that satisfy the current requirements.\u0000 Another contribution of this paper addresses the problem of automatic assembly of component systems. The algorithm CSAC (Component System Automatic Configurations) is presented. With our case study we show that our approach is efficient and generally applicable in practical scenarios.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"120 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":"121039709","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 presents some results of an ongoing project aimed at modeling the main concepts related to Customer Relationship Management (CRM). More precisely, the paper presents O-CREAM, a CRM ontology based on DOLCE and on two DOLCE-based modules, DnS (exploited for modeling roles and for handling reification) and OIO (exploited for modeling business knowledge by means of information objects). The project relies on the belief that all the actors involved in CRM could benefit from an ontological investigation of this field, aimed at providing a core set of formally described concepts and relations, useful both for describing CRM processes and for specifying the functionality of CRM applications. In particular, a well-formed CRM ontology would support communication and interoperability both in intra-organization and in inter-organization CRM processes. The paper discusses in details the axiomatization for the sale and customer relationship concepts, as well as for the corresponding business knowledge items (i.e., sale and customer records). It concludes by sketching a possible concrete exploitation of O-CREAM.
{"title":"Towards a first ontology for customer relationship management","authors":"Diego Magro, A. Goy","doi":"10.1145/1456223.1456352","DOIUrl":"https://doi.org/10.1145/1456223.1456352","url":null,"abstract":"This paper presents some results of an ongoing project aimed at modeling the main concepts related to Customer Relationship Management (CRM). More precisely, the paper presents O-CREAM, a CRM ontology based on DOLCE and on two DOLCE-based modules, DnS (exploited for modeling roles and for handling reification) and OIO (exploited for modeling business knowledge by means of information objects). The project relies on the belief that all the actors involved in CRM could benefit from an ontological investigation of this field, aimed at providing a core set of formally described concepts and relations, useful both for describing CRM processes and for specifying the functionality of CRM applications. In particular, a well-formed CRM ontology would support communication and interoperability both in intra-organization and in inter-organization CRM processes. The paper discusses in details the axiomatization for the sale and customer relationship concepts, as well as for the corresponding business knowledge items (i.e., sale and customer records). It concludes by sketching a possible concrete exploitation of O-CREAM.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"570 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":"126680129","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}
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}
The Underwater Wireless Sensor Network (UWSN) consists of sensor nodes equipped with a small battery of limited energy resource. A key design issue here is the energy efficiency that needs to be addressed in order to increase the lifetime of the network. In this paper, we apply a hexagon tessellation with an ideal cell size to deploy the underwater sensor nodes for two-dimensional UWSN. Upon this setting, we propose an enhanced hybrid transmission method that considers load balancing of data transmission in two-dimensional UWSN. The proposed method applies the threshold annulus that is defined as the distance between a node and the Base Station (BS) and allocates different frequencies to different annuluses. The simulation results show that the proposed method enhances the energy efficiency compared to the existing multi-hop forwarding methods and hybrid transmission methods.
{"title":"A new energy efficient data transmission method for underwater wireless sensor networks","authors":"Sangbo Seo, Seungmi Song, E. Kim, Sungun Kim","doi":"10.1145/1456223.1456359","DOIUrl":"https://doi.org/10.1145/1456223.1456359","url":null,"abstract":"The Underwater Wireless Sensor Network (UWSN) consists of sensor nodes equipped with a small battery of limited energy resource. A key design issue here is the energy efficiency that needs to be addressed in order to increase the lifetime of the network. In this paper, we apply a hexagon tessellation with an ideal cell size to deploy the underwater sensor nodes for two-dimensional UWSN. Upon this setting, we propose an enhanced hybrid transmission method that considers load balancing of data transmission in two-dimensional UWSN. The proposed method applies the threshold annulus that is defined as the distance between a node and the Base Station (BS) and allocates different frequencies to different annuluses. The simulation results show that the proposed method enhances the energy efficiency compared to the existing multi-hop forwarding methods and hybrid transmission methods.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"74 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":"127338934","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
扫码关注我们
求助内容：
应助结果提醒方式：