One of the bottlenecks in traditional evolvable hardware is that the fitness evaluation process is restricted by the performance of the reconfigurable hardware, so that the overall evolution efficiency is very low. In order to solve the problem we propose a double-layer evolvable hardware method, which is composed of logical evolving layer and physical evolving layer. The chromosome coding based on the logic operation unit is used in logical evolving, which can implement the rapid fitness evaluation process in computer without the FPGA and other hardware. Based on the result of logical evolving, the physical evolving uses classical evolving method to evolve the physical characters of target circuit. Thus, the efficiency and the popularity of the evolvable hardware can both be improved.
{"title":"Double-Layer Evolvable Hardware Method","authors":"Shuyong Liu, Guoyin Zhang","doi":"10.1109/ICICSE.2009.16","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.16","url":null,"abstract":"One of the bottlenecks in traditional evolvable hardware is that the fitness evaluation process is restricted by the performance of the reconfigurable hardware, so that the overall evolution efficiency is very low. In order to solve the problem we propose a double-layer evolvable hardware method, which is composed of logical evolving layer and physical evolving layer. The chromosome coding based on the logic operation unit is used in logical evolving, which can implement the rapid fitness evaluation process in computer without the FPGA and other hardware. Based on the result of logical evolving, the physical evolving uses classical evolving method to evolve the physical characters of target circuit. Thus, the efficiency and the popularity of the evolvable hardware can both be improved.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130302685","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}
Extension of life cycle has been one of the hot spots in Wireless Sensor Networks. Owing to limited capacity nodes fail as soon as energy is consumed, which tends to shorten survival time of entire wireless sensor network. Therefore, a clustering key management scheme based on hierarchical tree is proposed, furthermore dynamic update of networks is realized in the paper. In the hierarchical tree, child keys can be calculated according to their parent key, and nodes of different importance can be protected distinctively. The results show that it can not only ensure security of networks but also reduce the communication traffic, lower network overhead, and prolong life cycle of networks.
{"title":"A New Key Management Scheme in Clustering Wireless Sensor Networks","authors":"Nianmin Yao, Baoying Ma, Shuping Fan","doi":"10.1109/ICICSE.2009.58","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.58","url":null,"abstract":"Extension of life cycle has been one of the hot spots in Wireless Sensor Networks. Owing to limited capacity nodes fail as soon as energy is consumed, which tends to shorten survival time of entire wireless sensor network. Therefore, a clustering key management scheme based on hierarchical tree is proposed, furthermore dynamic update of networks is realized in the paper. In the hierarchical tree, child keys can be calculated according to their parent key, and nodes of different importance can be protected distinctively. The results show that it can not only ensure security of networks but also reduce the communication traffic, lower network overhead, and prolong life cycle of networks.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117133092","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 existing multi-robot task allocation mechanisms treat tasks as simple, indivisible entities. Also in many applications, the dynamicity and complexity of the environment are not considered. In order to allocate the robots adaptively and flexibility according to the complex task and environment, this paper presents a multi-robot coordination approaches based on virtual pheromone which is inspired by the ant colony foraging behavior in the background of exploring unknown environments by multi-robot system. Numerical and experiment results show that this approach is helpful and reliable, and it is proved that the robots collaboration degree was obviously improved. In addition, the exploration efficiency was greatly improved.
{"title":"Self-Organizing Task Allocation of Multi-robot","authors":"Ziying Zhang, Dong Xu, Xin Liu, J. Zhao","doi":"10.1109/ICICSE.2009.59","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.59","url":null,"abstract":"This existing multi-robot task allocation mechanisms treat tasks as simple, indivisible entities. Also in many applications, the dynamicity and complexity of the environment are not considered. In order to allocate the robots adaptively and flexibility according to the complex task and environment, this paper presents a multi-robot coordination approaches based on virtual pheromone which is inspired by the ant colony foraging behavior in the background of exploring unknown environments by multi-robot system. Numerical and experiment results show that this approach is helpful and reliable, and it is proved that the robots collaboration degree was obviously improved. In addition, the exploration efficiency was greatly improved.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115988778","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}
As the brisk development of Internet, shopping online becomes the mainstream. This new shopping makes the customers convenient, but it also makes new trouble that it costs customers much time to browse lots of website to choose the right commodities. This paper analyzed Deep Web technology, proposed the “Easy-shopping” system based on this technology, and introduced each part of this system. This system resolved the problem of inefficiency and complexity in shopping online.
{"title":"Easy-Shopping: A Deep Web-Based B2C System","authors":"Peiguang Lin, Ku Jin","doi":"10.1109/ICICSE.2009.44","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.44","url":null,"abstract":"As the brisk development of Internet, shopping online becomes the mainstream. This new shopping makes the customers convenient, but it also makes new trouble that it costs customers much time to browse lots of website to choose the right commodities. This paper analyzed Deep Web technology, proposed the “Easy-shopping” system based on this technology, and introduced each part of this system. This system resolved the problem of inefficiency and complexity in shopping online.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125520808","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}
Team Software Process (TSP) is brought forward to help improve the efficiency of software development process. Further, establishing simulation model for TSP can facilitate developers’ understanding, forecast possible shortcomings and bottlenecks in process and assist developers’ decision-making, supervise and control project development process. In this paper, firstly Temporal Parallel Automata (TPA) theory expanded from the finite state automata theory is applied into software process modeling. Secondly the concepts and the process control structures of TSP which are divided into sequence, AND-join, AND-split, OR-join, OR-split and Loop structure are mapped to TPA, thereby the TSP simulation model based on TPA is built. Thirdly the definition of soundness is given for soundness verification of process model. Finally, an instance is used to verify the validity of process model. It is proved that activity planning, resource allocation and schedule control of software process can be implemented effectively by the model.
{"title":"Simulation Model of Team Software Process Using Temporal Parallel Automata","authors":"Bingzi Zhang, Rubo Zhang","doi":"10.1109/ICICSE.2009.64","DOIUrl":"https://doi.org/10.1109/ICICSE.2009.64","url":null,"abstract":"Team Software Process (TSP) is brought forward to help improve the efficiency of software development process. Further, establishing simulation model for TSP can facilitate developers’ understanding, forecast possible shortcomings and bottlenecks in process and assist developers’ decision-making, supervise and control project development process. In this paper, firstly Temporal Parallel Automata (TPA) theory expanded from the finite state automata theory is applied into software process modeling. Secondly the concepts and the process control structures of TSP which are divided into sequence, AND-join, AND-split, OR-join, OR-split and Loop structure are mapped to TPA, thereby the TSP simulation model based on TPA is built. Thirdly the definition of soundness is given for soundness verification of process model. Finally, an instance is used to verify the validity of process model. It is proved that activity planning, resource allocation and schedule control of software process can be implemented effectively by the model.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"70 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129640259","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
扫码关注我们
求助内容：
应助结果提醒方式：