Pub Date : 2009-12-28DOI: 10.1109/ICICISYS.2009.5357820
Zhenya Zhang, Lin Zhang, Shuguan Zhang
Chance discovery is a new research topic on cognition psychology inspired deep data analysis. Scene is the contact point of human process and computer process in the double helical model of chance discovery. Event archipelago is the basic foundation for scene construction. Event archipelago and island are defined in this paper. Problem of event archipelago for Chance Discovery based on correlation matrix is a NP hard problem and to solve this problem instantly, GeneticCEA, an approximate algorithm based on genetic algorithm is presented. This paper discusses the performance of GeneticCEA too. Experimental results show that GeneticCEA can run with excellent performance for clustering task while it is treated as a kind of task for the construction of event archipelago in chance discovery.
{"title":"An approach to the construction of event archipelago for chance discovery via genetic algorithm based on correlation matrix","authors":"Zhenya Zhang, Lin Zhang, Shuguan Zhang","doi":"10.1109/ICICISYS.2009.5357820","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5357820","url":null,"abstract":"Chance discovery is a new research topic on cognition psychology inspired deep data analysis. Scene is the contact point of human process and computer process in the double helical model of chance discovery. Event archipelago is the basic foundation for scene construction. Event archipelago and island are defined in this paper. Problem of event archipelago for Chance Discovery based on correlation matrix is a NP hard problem and to solve this problem instantly, GeneticCEA, an approximate algorithm based on genetic algorithm is presented. This paper discusses the performance of GeneticCEA too. Experimental results show that GeneticCEA can run with excellent performance for clustering task while it is treated as a kind of task for the construction of event archipelago in chance discovery.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122751286","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}
Pub Date : 2009-12-28DOI: 10.1109/ICICISYS.2009.5357769
Bo Gao, Demin Xu, Fubin Zhang, Yao Yao
In this paper, we address the solution of solving the following problem: given a known workspace and a robot with limited sensors compute a short path for the vehicle so that every space in the workspace could be detected by the limited sensor of mobile robot on at least one point of the path. Visibility constraints including range of distance and angle of incidence are taken into consideration to model the real sensors with the view of 360 degrees. Instead of setting a number of guard location points for robot to travel, we here propose a concept called the visibility hallway which is constructed from the valid range of sensor. Our problem could be solved by two steps: we first construct the visibility graph according to the visibility hallway and then the path planner compute the short path from visibility graph with some specifications. Experiment results demonstrate that the proposed method could compute the path efficiently and the workspace could be inspected everywhere.
{"title":"Constructing visibility graph and planning optimal path for inspection of 2D workspace","authors":"Bo Gao, Demin Xu, Fubin Zhang, Yao Yao","doi":"10.1109/ICICISYS.2009.5357769","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5357769","url":null,"abstract":"In this paper, we address the solution of solving the following problem: given a known workspace and a robot with limited sensors compute a short path for the vehicle so that every space in the workspace could be detected by the limited sensor of mobile robot on at least one point of the path. Visibility constraints including range of distance and angle of incidence are taken into consideration to model the real sensors with the view of 360 degrees. Instead of setting a number of guard location points for robot to travel, we here propose a concept called the visibility hallway which is constructed from the valid range of sensor. Our problem could be solved by two steps: we first construct the visibility graph according to the visibility hallway and then the path planner compute the short path from visibility graph with some specifications. Experiment results demonstrate that the proposed method could compute the path efficiently and the workspace could be inspected everywhere.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122870207","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}
Pub Date : 2009-12-28DOI: 10.1109/ICICISYS.2009.5358031
Zhangjun Huang, Chengen Wang, Hong Tian
Engineering problems are commonly optimization problems with various constraints. For solving these constrained optimization problems, an effective genetic algorithm with a constrained sorting method is proposed in this work. The constrained sorting method is based on a dynamic penalty function and a non-dominated sorting technique that is used for ranking all the feasible and infeasible solutions in the whole evolutionary population. The proposed algorithm is tested on five well-known benchmark functions and three engineering problems. Experimental results and comparisons with previously reported results demonstrate the effectiveness, efficiency and robustness of the present algorithm for constrained optimization problems.
{"title":"A genetic algorithm with constrained sorting method for constrained optimization problems","authors":"Zhangjun Huang, Chengen Wang, Hong Tian","doi":"10.1109/ICICISYS.2009.5358031","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5358031","url":null,"abstract":"Engineering problems are commonly optimization problems with various constraints. For solving these constrained optimization problems, an effective genetic algorithm with a constrained sorting method is proposed in this work. The constrained sorting method is based on a dynamic penalty function and a non-dominated sorting technique that is used for ranking all the feasible and infeasible solutions in the whole evolutionary population. The proposed algorithm is tested on five well-known benchmark functions and three engineering problems. Experimental results and comparisons with previously reported results demonstrate the effectiveness, efficiency and robustness of the present algorithm for constrained optimization problems.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114407585","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}
Pub Date : 2009-12-28DOI: 10.1109/ICICISYS.2009.5357724
Xiaoyu Zhang, Zhuo-qiu Li, S. Zhu
Based on the function character and conductivity of carbon fiber smart layer(CFSL), A novel electrical resistance tomography (ERT) system of CFSL had been developed for whole field structural health monitoring (SHM). The apposite Tikhonov regularization principle and modified Newton-Raphson(MNR) algorithm were adopted to solve the ERT inverse problem. Its effectiveness was evaluated using virtual experimental. The resistivity distribution image of CFSL sensor had been obtained from the ERT system, which data came form the virtual experimental. The result showed that the electrical resistivity of CFSL sensor increases under tension. Its high-resistivity area was distributed in the high stress/strain area of the structure. Its resistivity distribution indicated structural stress/strain condition. It is feasibility to whole field SHM using the function character of smart layer and ERT technology.
{"title":"A novel electrical resistance tomography system of carbon fiber smart layer for structural health monitoring","authors":"Xiaoyu Zhang, Zhuo-qiu Li, S. Zhu","doi":"10.1109/ICICISYS.2009.5357724","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5357724","url":null,"abstract":"Based on the function character and conductivity of carbon fiber smart layer(CFSL), A novel electrical resistance tomography (ERT) system of CFSL had been developed for whole field structural health monitoring (SHM). The apposite Tikhonov regularization principle and modified Newton-Raphson(MNR) algorithm were adopted to solve the ERT inverse problem. Its effectiveness was evaluated using virtual experimental. The resistivity distribution image of CFSL sensor had been obtained from the ERT system, which data came form the virtual experimental. The result showed that the electrical resistivity of CFSL sensor increases under tension. Its high-resistivity area was distributed in the high stress/strain area of the structure. Its resistivity distribution indicated structural stress/strain condition. It is feasibility to whole field SHM using the function character of smart layer and ERT technology.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114493687","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}
Pub Date : 2009-12-28DOI: 10.1109/ICICISYS.2009.5358271
S. Thiel, D. Habe, M. Block
Co-operative teams of service robots have been a research target for several years. Real-time task distribution and scheduling was identified to be one of the key challenges for these robot teams. This paper introduces the application of a team of service robots within hospital environments. Existing approaches for task distribution and scheduling, like central and distributed scheduling for the particular scenario, are introduced. Finally an adapted approach for the scenario is presented. The underlying task distribution problem however differs from known problems, since scheduling takes the power state and equipment of a robot into account required for each task. This paper introduces the concept of IWARD with a special focus on the benefits of co-operative robot teams performing in hospitals.
{"title":"Co-operative robot teams in a hospital environment","authors":"S. Thiel, D. Habe, M. Block","doi":"10.1109/ICICISYS.2009.5358271","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5358271","url":null,"abstract":"Co-operative teams of service robots have been a research target for several years. Real-time task distribution and scheduling was identified to be one of the key challenges for these robot teams. This paper introduces the application of a team of service robots within hospital environments. Existing approaches for task distribution and scheduling, like central and distributed scheduling for the particular scenario, are introduced. Finally an adapted approach for the scenario is presented. The underlying task distribution problem however differs from known problems, since scheduling takes the power state and equipment of a robot into account required for each task. This paper introduces the concept of IWARD with a special focus on the benefits of co-operative robot teams performing in hospitals.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122235628","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}
Pub Date : 2009-12-28DOI: 10.1109/ICICISYS.2009.5358225
Liang Peng, Yan-li Xu
There are many challenges of using all kinds of handheld devices as learning tools, that can connect to the Remote Learning System by cable or wireless network and then browser the downloaded course contents. First of all, network connection, especially wireless link, is usually not persistent and wireless coverage is often limited. In this case, the handheld learning devices become useless and the learning activities are interfered. Secondly, the learning resource size become more and more large, so that the time to wait for these resources downloaded from the remote learning system would be more and more long. Thirdly, computing power and storages ability of the device is too weak to save or perform plentiful downloaded learning resource. In order to solute the mentioned problems, an auto-adjustment cache algorithm is purposed in a Remote Learning System.
{"title":"An auto-adjustment cache algorithm in handheld learning devices","authors":"Liang Peng, Yan-li Xu","doi":"10.1109/ICICISYS.2009.5358225","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5358225","url":null,"abstract":"There are many challenges of using all kinds of handheld devices as learning tools, that can connect to the Remote Learning System by cable or wireless network and then browser the downloaded course contents. First of all, network connection, especially wireless link, is usually not persistent and wireless coverage is often limited. In this case, the handheld learning devices become useless and the learning activities are interfered. Secondly, the learning resource size become more and more large, so that the time to wait for these resources downloaded from the remote learning system would be more and more long. Thirdly, computing power and storages ability of the device is too weak to save or perform plentiful downloaded learning resource. In order to solute the mentioned problems, an auto-adjustment cache algorithm is purposed in a Remote Learning System.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116822614","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}
Pub Date : 2009-12-28DOI: 10.1109/ICICISYS.2009.5357739
Peng Rui-hui, Wang Shu-zong, Wang Xiang-wei, Lux0308 Yong-sheng
A gamma-distributed texture in coherent imagery is widely applied on some fields such as description of texture characteristic and verification of classification algorithm. In this paper, a method based on spherically invariant random process for texture modeling in SAR imagery has been proposed, and the feasibility of modeling for gamma-distributed texture with SIRP is testified, the representation functions have also been educed. By means of the relationship between the envelope and the complex SIRV, the correlation property has been introduced into the texture. And a modeling and simulating flow of correlated gamma-distributed texture using SIRV theorem has been established. A computer simulation has been made for verification. In order to testify whether the results obey gamma distribution, a maximum likelihood estimate fitting has been made. The results show: theoretical analysis fits the simulating data well, and the generated texture image is fairly realistic; using the proposed method, the image PDF and its ACF can be independently controlled, and the correlation property can be conveniently induced with no limitation on the form of ACF.
{"title":"Modelling of correlated Gamma-distributed texture based on spherically invariant random process","authors":"Peng Rui-hui, Wang Shu-zong, Wang Xiang-wei, Lux0308 Yong-sheng","doi":"10.1109/ICICISYS.2009.5357739","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5357739","url":null,"abstract":"A gamma-distributed texture in coherent imagery is widely applied on some fields such as description of texture characteristic and verification of classification algorithm. In this paper, a method based on spherically invariant random process for texture modeling in SAR imagery has been proposed, and the feasibility of modeling for gamma-distributed texture with SIRP is testified, the representation functions have also been educed. By means of the relationship between the envelope and the complex SIRV, the correlation property has been introduced into the texture. And a modeling and simulating flow of correlated gamma-distributed texture using SIRV theorem has been established. A computer simulation has been made for verification. In order to testify whether the results obey gamma distribution, a maximum likelihood estimate fitting has been made. The results show: theoretical analysis fits the simulating data well, and the generated texture image is fairly realistic; using the proposed method, the image PDF and its ACF can be independently controlled, and the correlation property can be conveniently induced with no limitation on the form of ACF.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"5 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117030461","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}
Pub Date : 2009-12-28DOI: 10.1109/ICICISYS.2009.5358060
Xu Li, Yang Liang
Optimization of total arrangement of load-bearing coiled tubing operation vehicle can play a positive role for this apparatus to realize the normal work. Relevant overall arrangement is researched, applying for the genetic algorithm with character of searching for the optimal solution from more staring point in solution space. With consideration of requirements of a single vehicle driving and corresponding function and position of main parts, penalty function is set up and the optimal goal is confirmed. Combined with the practice of overall arrangement question, total layout optimization of the coiled tubing operation vehicle is developed through introducing the genetic algorithm.
{"title":"Study of total arrangement of coiled tubing operation vehicle based on genetic algorithm","authors":"Xu Li, Yang Liang","doi":"10.1109/ICICISYS.2009.5358060","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5358060","url":null,"abstract":"Optimization of total arrangement of load-bearing coiled tubing operation vehicle can play a positive role for this apparatus to realize the normal work. Relevant overall arrangement is researched, applying for the genetic algorithm with character of searching for the optimal solution from more staring point in solution space. With consideration of requirements of a single vehicle driving and corresponding function and position of main parts, penalty function is set up and the optimal goal is confirmed. Combined with the practice of overall arrangement question, total layout optimization of the coiled tubing operation vehicle is developed through introducing the genetic algorithm.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129779784","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}
Pub Date : 2009-12-28DOI: 10.1109/ICICISYS.2009.5358029
Lei Liu, Mao-Sheng Zhong, R. Lu
This paper proposes a method for automatic extracting and extending lexical attributes from a Chinese Machine Readable Dictionary (MRD). The method acquires lexical attributes such as density, reserve and ductility for the class metal from definitions in MRD, not using any instantiated objects. Compared with previous works, our method takes advantage of hyponymy semantic relation to extend classes conceptually and acquire more attributes. Although the method for acquisition of hyponyms is very simple and only a few hyponyms are acquired, experimental results show that they can help to improve the performance of attribute extraction from MRD effectively.
{"title":"Automatic extracting and extending lexical attributes from chinese machine readable dictionary","authors":"Lei Liu, Mao-Sheng Zhong, R. Lu","doi":"10.1109/ICICISYS.2009.5358029","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5358029","url":null,"abstract":"This paper proposes a method for automatic extracting and extending lexical attributes from a Chinese Machine Readable Dictionary (MRD). The method acquires lexical attributes such as density, reserve and ductility for the class metal from definitions in MRD, not using any instantiated objects. Compared with previous works, our method takes advantage of hyponymy semantic relation to extend classes conceptually and acquire more attributes. Although the method for acquisition of hyponyms is very simple and only a few hyponyms are acquired, experimental results show that they can help to improve the performance of attribute extraction from MRD effectively.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128270693","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}
Pub Date : 2009-12-28DOI: 10.1109/ICICISYS.2009.5358197
Shi-xing Liu, Defeng Tu, Yongming Zhang
Wireless fire detection nodes based on Wireless sensor network is designed which can detect temperature, humidity and smoke concentration. The ratio of fire misinformation is decreased with multiparameter coincidence technique. And a shortest path routing algorithm is proposed according to multi-hop transmission based on CSMA/CA principle. The sensor nodes can connect each other automatically and the sensor data can be transmitted within minimum hops, so a real-time fire monitoring system is built up. The result of experiment show: the maximum distance of single hop transmission is 100m; the delay time of every hop within multi-hop communications is about 50ms; the sensitivity of fire smoke reached to I level; the parameter of humidity is used to eliminate the distorted effect of water vapor.
{"title":"Multiparameter fire detection based on wireless sensor network","authors":"Shi-xing Liu, Defeng Tu, Yongming Zhang","doi":"10.1109/ICICISYS.2009.5358197","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5358197","url":null,"abstract":"Wireless fire detection nodes based on Wireless sensor network is designed which can detect temperature, humidity and smoke concentration. The ratio of fire misinformation is decreased with multiparameter coincidence technique. And a shortest path routing algorithm is proposed according to multi-hop transmission based on CSMA/CA principle. The sensor nodes can connect each other automatically and the sensor data can be transmitted within minimum hops, so a real-time fire monitoring system is built up. The result of experiment show: the maximum distance of single hop transmission is 100m; the delay time of every hop within multi-hop communications is about 50ms; the sensitivity of fire smoke reached to I level; the parameter of humidity is used to eliminate the distorted effect of water vapor.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129322191","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
扫码关注我们
求助内容：
应助结果提醒方式：