Pub Date : 2011-12-01DOI: 10.1109/ICCIAUTOM.2011.6183965
Xinming Ye, Hongying Bai, Tao Sun, Guanghua Li
Colored Petri Nets (CPN) is suitable for formally describing and analyzing complex systems with communication, synchronization and concurrency. In this paper, CPN properties based on CPN model is defined, the test case generation algorithm based on CPN properties is given, and a test case generation tool is developed to generate test sequences based on CPN properties automatically. We also apply this method to the test sequences generation of HMIPv6 protocol and verify its effectiveness.
{"title":"Test sequences generation based on CPN properties","authors":"Xinming Ye, Hongying Bai, Tao Sun, Guanghua Li","doi":"10.1109/ICCIAUTOM.2011.6183965","DOIUrl":"https://doi.org/10.1109/ICCIAUTOM.2011.6183965","url":null,"abstract":"Colored Petri Nets (CPN) is suitable for formally describing and analyzing complex systems with communication, synchronization and concurrency. In this paper, CPN properties based on CPN model is defined, the test case generation algorithm based on CPN properties is given, and a test case generation tool is developed to generate test sequences based on CPN properties automatically. We also apply this method to the test sequences generation of HMIPv6 protocol and verify its effectiveness.","PeriodicalId":177039,"journal":{"name":"2011 2nd International Conference on Control, Instrumentation and Automation (ICCIA)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115415624","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 : 2011-12-01DOI: 10.1109/ICCIAUTOM.2011.6183933
Jian Xiao, Jian-zhong Zhou, Pangao Kou, Xiaoyuan Zhang, Xianguo Wu, Mu Li
In this paper, we present a novel evolutionary algorithm-based approach to identification of hydraulic turbine governor system (HTGS). A new variant of particle swarm optimization (PSO) technique named unified PSO (UPSO) is employed and improved to search for optimal parameters of HTGS by minimizing errors between the model's evaluated outputs and the actual ones. The performance of the improved unified PSO (IUPSO) is compared with standard PSO and UPSO algorithms tested via numerical simulation. Identification results aptly show that the IUPSO algorithm has the advantage of convergence capability and solution quality and it provides a new way for parameter identification of hydraulic turbine governor system.
{"title":"Identification of hydraulic turbine governor system based on improved unified PSO algorithm","authors":"Jian Xiao, Jian-zhong Zhou, Pangao Kou, Xiaoyuan Zhang, Xianguo Wu, Mu Li","doi":"10.1109/ICCIAUTOM.2011.6183933","DOIUrl":"https://doi.org/10.1109/ICCIAUTOM.2011.6183933","url":null,"abstract":"In this paper, we present a novel evolutionary algorithm-based approach to identification of hydraulic turbine governor system (HTGS). A new variant of particle swarm optimization (PSO) technique named unified PSO (UPSO) is employed and improved to search for optimal parameters of HTGS by minimizing errors between the model's evaluated outputs and the actual ones. The performance of the improved unified PSO (IUPSO) is compared with standard PSO and UPSO algorithms tested via numerical simulation. Identification results aptly show that the IUPSO algorithm has the advantage of convergence capability and solution quality and it provides a new way for parameter identification of hydraulic turbine governor system.","PeriodicalId":177039,"journal":{"name":"2011 2nd International Conference on Control, Instrumentation and Automation (ICCIA)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124121911","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 : 2011-12-01DOI: 10.1109/ICCIAUTOM.2011.6184001
Xiao Du, Yuan’an Liu, Kaiming Liu, F. Yuan
This article describes a new collision solutions mechanism for Collision Solutions Mechanism in Opportunistic Routing, named CSMOR, in wireless networks. The mechanism encourages the senders' signals to be interfered with each other in Opportunistic Routing. When two or more signals are transmited at the same time, the packets might be conflicted and interfered. In the mechanism, the nodes can decode the interfered signal and get the original packets. So, the mechanism of CSMOR encourages the sender to transmit data at the same time, the receiver can use network layer information to reconstruct the interfered signals, and decode the signal they need from the package. Therefore, CSMOR avoid the back-off time and the accuracy of received packets has a significant improvement. This mechanism could minimize the end-to-end delay, increase the network throughput. With the data packets flow increasing, the gain of the mechanism is also enhanced. Theoretical analysis and simulation results show that CSMOR improves the performance significantly in terms of the less end-to-end delay, the greater throughput, compared with the classic Opportunistic Routing ExOR and MORE.
{"title":"An Collision Solutions Mechanism in opportunistic routing in wireless mesh networks","authors":"Xiao Du, Yuan’an Liu, Kaiming Liu, F. Yuan","doi":"10.1109/ICCIAUTOM.2011.6184001","DOIUrl":"https://doi.org/10.1109/ICCIAUTOM.2011.6184001","url":null,"abstract":"This article describes a new collision solutions mechanism for Collision Solutions Mechanism in Opportunistic Routing, named CSMOR, in wireless networks. The mechanism encourages the senders' signals to be interfered with each other in Opportunistic Routing. When two or more signals are transmited at the same time, the packets might be conflicted and interfered. In the mechanism, the nodes can decode the interfered signal and get the original packets. So, the mechanism of CSMOR encourages the sender to transmit data at the same time, the receiver can use network layer information to reconstruct the interfered signals, and decode the signal they need from the package. Therefore, CSMOR avoid the back-off time and the accuracy of received packets has a significant improvement. This mechanism could minimize the end-to-end delay, increase the network throughput. With the data packets flow increasing, the gain of the mechanism is also enhanced. Theoretical analysis and simulation results show that CSMOR improves the performance significantly in terms of the less end-to-end delay, the greater throughput, compared with the classic Opportunistic Routing ExOR and MORE.","PeriodicalId":177039,"journal":{"name":"2011 2nd International Conference on Control, Instrumentation and Automation (ICCIA)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116022757","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 : 2011-12-01DOI: 10.1109/ICCIAUTOM.2011.6184006
Yaqi Liu, Ziqi Zhu
The reusing of personal information governed by public sectors becomes an important researching field in the last decade. The existence personal information managing scheme mainly focus on the collection scheme and the storage scheme. However, one other key problem, which is how to distribute the personal information safely, is always ignored. In this paper, a novel chaos-based multi-points secure communication system is proposed for the distribution of personal information. Thus the security of personal information governed by public sectors is guaranteed while reusing it.
{"title":"A novel chaos-based multi-points secure communication system for the managing of personal information governed by public sectors","authors":"Yaqi Liu, Ziqi Zhu","doi":"10.1109/ICCIAUTOM.2011.6184006","DOIUrl":"https://doi.org/10.1109/ICCIAUTOM.2011.6184006","url":null,"abstract":"The reusing of personal information governed by public sectors becomes an important researching field in the last decade. The existence personal information managing scheme mainly focus on the collection scheme and the storage scheme. However, one other key problem, which is how to distribute the personal information safely, is always ignored. In this paper, a novel chaos-based multi-points secure communication system is proposed for the distribution of personal information. Thus the security of personal information governed by public sectors is guaranteed while reusing it.","PeriodicalId":177039,"journal":{"name":"2011 2nd International Conference on Control, Instrumentation and Automation (ICCIA)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116037108","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 : 2011-12-01DOI: 10.1109/ICCIAUTOM.2011.6184022
Jingshu Ma
Simulated annealing algorithm is a heuristic algorithm, proposed one approximation algorithm kind of solving optimization combinatorial problems inspired by objects in the annealing process by heating crunch. The algorithm is superior to the traditional greedy algorithm, which avoiding falling into local optimum and reach global optimum. In road network planning, often encountered some kind of traffic problems, for the distribution of traffic, need to achieve optimal in planning. The article uses an example of simulating annealing algorithm validation to verify it, the effect proved to be feasible.
{"title":"Obtain the optimal of road network with annealing algorithm","authors":"Jingshu Ma","doi":"10.1109/ICCIAUTOM.2011.6184022","DOIUrl":"https://doi.org/10.1109/ICCIAUTOM.2011.6184022","url":null,"abstract":"Simulated annealing algorithm is a heuristic algorithm, proposed one approximation algorithm kind of solving optimization combinatorial problems inspired by objects in the annealing process by heating crunch. The algorithm is superior to the traditional greedy algorithm, which avoiding falling into local optimum and reach global optimum. In road network planning, often encountered some kind of traffic problems, for the distribution of traffic, need to achieve optimal in planning. The article uses an example of simulating annealing algorithm validation to verify it, the effect proved to be feasible.","PeriodicalId":177039,"journal":{"name":"2011 2nd International Conference on Control, Instrumentation and Automation (ICCIA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116450717","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 : 2011-12-01DOI: 10.1109/ICCIAUTOM.2011.6183916
Lu Jing-hui, Wang Hong-li, Wen Tao, Zhan Qiao-Lin
To reduce the effects of various error factors and improve the pointing precision, a star sensor error calibration algorithm was presented. Based on analysis and generalizing the typical error of star sensor, the ideal and real model of star sensor were constructed. The calibration errors such as the bore-sight offsets, inaccurate focal length of optical system, plane tilt and rotating of focal plane, and optical lens distortion etc, which were separated by the least squares optimal estimation method and the principal of star distance invariability in star catalog. The simulation results indicate that the error caused by not having an ideal model and calibration of the optics could be estimated, the calibration accuracy is improved.
{"title":"Error calibration method for star sensor","authors":"Lu Jing-hui, Wang Hong-li, Wen Tao, Zhan Qiao-Lin","doi":"10.1109/ICCIAUTOM.2011.6183916","DOIUrl":"https://doi.org/10.1109/ICCIAUTOM.2011.6183916","url":null,"abstract":"To reduce the effects of various error factors and improve the pointing precision, a star sensor error calibration algorithm was presented. Based on analysis and generalizing the typical error of star sensor, the ideal and real model of star sensor were constructed. The calibration errors such as the bore-sight offsets, inaccurate focal length of optical system, plane tilt and rotating of focal plane, and optical lens distortion etc, which were separated by the least squares optimal estimation method and the principal of star distance invariability in star catalog. The simulation results indicate that the error caused by not having an ideal model and calibration of the optics could be estimated, the calibration accuracy is improved.","PeriodicalId":177039,"journal":{"name":"2011 2nd International Conference on Control, Instrumentation and Automation (ICCIA)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123289473","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 : 2011-12-01DOI: 10.1109/ICCIAUTOM.2011.6183949
Xin Wang, Yuenan Qiu, Shasha Gao
In this paper we discuss the multiscale asymptotic expansion for a kind of general second order elliptic problem with rapidly oscillating coefficients in n-D parallelotope periodic structure. Based on the theoretical results, we investigate exhaustively the multiscale finite element algorithm. Numerical simulations are carried out to validate the proposed method of this paper.
{"title":"Multiscale asymptotic analysis and numerical simulation for second elliptic problems with oscillating coefficients in parallelotope periodic structure","authors":"Xin Wang, Yuenan Qiu, Shasha Gao","doi":"10.1109/ICCIAUTOM.2011.6183949","DOIUrl":"https://doi.org/10.1109/ICCIAUTOM.2011.6183949","url":null,"abstract":"In this paper we discuss the multiscale asymptotic expansion for a kind of general second order elliptic problem with rapidly oscillating coefficients in n-D parallelotope periodic structure. Based on the theoretical results, we investigate exhaustively the multiscale finite element algorithm. Numerical simulations are carried out to validate the proposed method of this paper.","PeriodicalId":177039,"journal":{"name":"2011 2nd International Conference on Control, Instrumentation and Automation (ICCIA)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123484371","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 : 2011-12-01DOI: 10.1109/ICCIAUTOM.2011.6183951
Lisheng Yang, Haiying Zheng
This article is to discuss a cold standby system which consists of l series working components and n − 1 independent cold standby components. Suppose that the component follows geometric distribution. The precise Fiducial lower confidence limit for system reliability is obtained, when only a parameter is unknown. And when all of the parameters are unknown, a method is offered to resolve the Fiducial approximate lower confidence limit for system reliability. At the same time Monte Carlo simulation is carried out to verify the conclusions.
{"title":"Fiducial lower confidence limit for the reliability of cold standby system consists of geometric series components","authors":"Lisheng Yang, Haiying Zheng","doi":"10.1109/ICCIAUTOM.2011.6183951","DOIUrl":"https://doi.org/10.1109/ICCIAUTOM.2011.6183951","url":null,"abstract":"This article is to discuss a cold standby system which consists of l series working components and n − 1 independent cold standby components. Suppose that the component follows geometric distribution. The precise Fiducial lower confidence limit for system reliability is obtained, when only a parameter is unknown. And when all of the parameters are unknown, a method is offered to resolve the Fiducial approximate lower confidence limit for system reliability. At the same time Monte Carlo simulation is carried out to verify the conclusions.","PeriodicalId":177039,"journal":{"name":"2011 2nd International Conference on Control, Instrumentation and Automation (ICCIA)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121417166","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 : 2011-12-01DOI: 10.1109/ICCIAUTOM.2011.6183913
Jun-yan Zhang, Fan Min
Pattern mining is a popular issue in biological sequence analysis. In this paper, we propose new definitions related to the pattern frequency, where gaps are mined instead of specified. We develop algorithm with polynomial complexities. Patterns can grow from both sides, and Apriori property holds. Some interesting biological patterns are mined by our algorithm.
{"title":"Mining frequent patterns from sequences","authors":"Jun-yan Zhang, Fan Min","doi":"10.1109/ICCIAUTOM.2011.6183913","DOIUrl":"https://doi.org/10.1109/ICCIAUTOM.2011.6183913","url":null,"abstract":"Pattern mining is a popular issue in biological sequence analysis. In this paper, we propose new definitions related to the pattern frequency, where gaps are mined instead of specified. We develop algorithm with polynomial complexities. Patterns can grow from both sides, and Apriori property holds. Some interesting biological patterns are mined by our algorithm.","PeriodicalId":177039,"journal":{"name":"2011 2nd International Conference on Control, Instrumentation and Automation (ICCIA)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125806650","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 : 2011-12-01DOI: 10.1109/ICCIAUTOM.2011.6183994
Wenguang Li, Guangliang Liu, Xiangdong Li, Jianbin Zhi, Shiguo Ma
A new simple and valid, stacking robot stacking method based is presented. The process based the kinematic computation of the stacking robot. The rest pile position and orientation of palletizing robot is derived, in full consideration of the teaching pile position and orientation. Based on the derived reasonable position of pile, compensate the rotation of the robot end, counteract the posture changes brought by the robot base rotation. Finally, the proposed algorithm is tested by the Matlab on a simulation experiment, and the results show that the method is feasible, in addition, it can be applied to the actual work environment, reduce the teaching steps to improve the level of automation.
{"title":"Research of automatic stacking algorithm of hybrid-connection stacking robot","authors":"Wenguang Li, Guangliang Liu, Xiangdong Li, Jianbin Zhi, Shiguo Ma","doi":"10.1109/ICCIAUTOM.2011.6183994","DOIUrl":"https://doi.org/10.1109/ICCIAUTOM.2011.6183994","url":null,"abstract":"A new simple and valid, stacking robot stacking method based is presented. The process based the kinematic computation of the stacking robot. The rest pile position and orientation of palletizing robot is derived, in full consideration of the teaching pile position and orientation. Based on the derived reasonable position of pile, compensate the rotation of the robot end, counteract the posture changes brought by the robot base rotation. Finally, the proposed algorithm is tested by the Matlab on a simulation experiment, and the results show that the method is feasible, in addition, it can be applied to the actual work environment, reduce the teaching steps to improve the level of automation.","PeriodicalId":177039,"journal":{"name":"2011 2nd International Conference on Control, Instrumentation and Automation (ICCIA)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126237288","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
扫码关注我们
求助内容：
应助结果提醒方式：