According to the unknown control direction strict feedback nonlinear systems, this paper introduced a design process for time-varying nonlinear adaptive controller by introducing the Nussbaum increasing and the dead area revision algorithm. Its stability is proved and analyzed, and its simulation is designed with the LMI MATLAB toolbox, the result shows that the controller has a good performance.
{"title":"A Design of Time-Varying Auto-Adaptive Tracker","authors":"Xianfang Wang, Zhiyong Du, F. Pan","doi":"10.1109/CCCM.2008.29","DOIUrl":"https://doi.org/10.1109/CCCM.2008.29","url":null,"abstract":"According to the unknown control direction strict feedback nonlinear systems, this paper introduced a design process for time-varying nonlinear adaptive controller by introducing the Nussbaum increasing and the dead area revision algorithm. Its stability is proved and analyzed, and its simulation is designed with the LMI MATLAB toolbox, the result shows that the controller has a good performance.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"206 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116193166","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}
Xiaohong Wang, Jinming Yang, Xian-yong Zhang, Jie Wu
The brushless doubly-fed machine (BDFM) has prospect application in the wind energy conversion system (WECS) for its abilities of speed regulation and variable-speed constant-frequency. The decoupled control of the active and reactive power is crucial to the applications of the BDFM in WECS. The robust control strategy based on sliding mode theory is applied for the independent control of active and reactive power of the BDFM. The controller is designed through the Lyapunov stable theory to ensure the stability of controller and achieve the required control result. The effect of the proposed method is tested with the matlab/simulink software. Simulation results illustrate the good performance of the controller and proves the power control strategy's feasibility.
{"title":"Sliding Mode Control of Active and Reactive Power for Brushless Doubly-Fed Machine","authors":"Xiaohong Wang, Jinming Yang, Xian-yong Zhang, Jie Wu","doi":"10.1109/CCCM.2008.167","DOIUrl":"https://doi.org/10.1109/CCCM.2008.167","url":null,"abstract":"The brushless doubly-fed machine (BDFM) has prospect application in the wind energy conversion system (WECS) for its abilities of speed regulation and variable-speed constant-frequency. The decoupled control of the active and reactive power is crucial to the applications of the BDFM in WECS. The robust control strategy based on sliding mode theory is applied for the independent control of active and reactive power of the BDFM. The controller is designed through the Lyapunov stable theory to ensure the stability of controller and achieve the required control result. The effect of the proposed method is tested with the matlab/simulink software. Simulation results illustrate the good performance of the controller and proves the power control strategy's feasibility.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"32 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120850749","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}
A shadow detection algorithm base on spatial features was proposed, in the case of focusing on traffic vehicle detection system. First of all, multi-foreground rectangles were extracted by using Gaussian mixture model (GMM) and edge detection operator of mathematical morphology. Then, histogram of horizontal location - foreground point number of vertical direction was computed, combined with optimum threshold segmentation, shadow areas were removed. To enhance the adaptability, the system learns direction relations between target and its shadow, automatically. Results were presented for several video sequences representing a variety of illumination conditions. Experimental results in different traffic conditions showed our technique robust, self-adaptive, and real-time.
{"title":"Spatial Feature Based Shadow Detection in Visual Traffic Surveillance System","authors":"Shaohua Xu, Yong Zhao, Chunyu Yu, Ling Shen","doi":"10.1109/CCCM.2008.55","DOIUrl":"https://doi.org/10.1109/CCCM.2008.55","url":null,"abstract":"A shadow detection algorithm base on spatial features was proposed, in the case of focusing on traffic vehicle detection system. First of all, multi-foreground rectangles were extracted by using Gaussian mixture model (GMM) and edge detection operator of mathematical morphology. Then, histogram of horizontal location - foreground point number of vertical direction was computed, combined with optimum threshold segmentation, shadow areas were removed. To enhance the adaptability, the system learns direction relations between target and its shadow, automatically. Results were presented for several video sequences representing a variety of illumination conditions. Experimental results in different traffic conditions showed our technique robust, self-adaptive, and real-time.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"19 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120953087","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}
From the view of how to get the biggest benefits by optimizing the project network schedule, the paper uses systemic method of controlling the construction schedule and puts forward a mathematical model which considers the synthetic optimization of the cost, the supply of resources and the influence of latent uncertainties. Then by changing the choose strategy and the local search strategy, the combining ant colony algorithms and particle swarm optimization algorithms (PAAA) is proposed and applied in the process of optimizing the model. Finally, an example is used to prove the method is effective.
{"title":"Network Synthetic Optimization in Project Schedule by Using PAAA Algorithm and Considered of Time Value of Money","authors":"Yuansheng Huang, Qingchao Liu, Zilong Qiu","doi":"10.1109/CCCM.2008.52","DOIUrl":"https://doi.org/10.1109/CCCM.2008.52","url":null,"abstract":"From the view of how to get the biggest benefits by optimizing the project network schedule, the paper uses systemic method of controlling the construction schedule and puts forward a mathematical model which considers the synthetic optimization of the cost, the supply of resources and the influence of latent uncertainties. Then by changing the choose strategy and the local search strategy, the combining ant colony algorithms and particle swarm optimization algorithms (PAAA) is proposed and applied in the process of optimizing the model. Finally, an example is used to prove the method is effective.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116346304","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 order to improve the support ability of dealing with the complex decision problem, grey cloud model and intelligent decision support system (IDSS) based on grey cloud model is proposed. A new uncertain model, grey cloud model is proposed. Firstly the definition depiction of grey model is given. Then representation uncertain of knowledge based on grey cloud model in knowledge database is proposed. The data mining method based on is proposed. Lastly the case of data mining based on grey cloud model in intelligent decision support system is given to verify the validity of grey cloud model. The innovation of method is that the grey cloud model and intelligent decision support system based on grey cloud objectively express the character of complex problem. This increases the support ability of dealing with the complex decision problem in IDSS.
{"title":"Grey Cloud Model and Its Application in Intelligent Decision Support System Supporting Complex Decision","authors":"Hongli Wang","doi":"10.1109/CCCM.2008.292","DOIUrl":"https://doi.org/10.1109/CCCM.2008.292","url":null,"abstract":"In order to improve the support ability of dealing with the complex decision problem, grey cloud model and intelligent decision support system (IDSS) based on grey cloud model is proposed. A new uncertain model, grey cloud model is proposed. Firstly the definition depiction of grey model is given. Then representation uncertain of knowledge based on grey cloud model in knowledge database is proposed. The data mining method based on is proposed. Lastly the case of data mining based on grey cloud model in intelligent decision support system is given to verify the validity of grey cloud model. The innovation of method is that the grey cloud model and intelligent decision support system based on grey cloud objectively express the character of complex problem. This increases the support ability of dealing with the complex decision problem in IDSS.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126671288","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 the pairwise comparison method, Saaty's consistency test is performed to ensure that the decision maker is being neither random nor illogical in his or her pairwise comparisons. Saaty suggested that the consistency ratio (CR) should be less than or equal to 0.1. Some researchers argued that the cut-off rule should be a function of the matrix size. In this paper, by simulation analysis, we find that, as the matrix size increases, the percent of the matrices with acceptable consistency (CR les 0.1) decreases dramatically, however, on the other hand, there will be more and more contradictory judgements in these sufficiently consistent matrices. This paradox shows that it is impossible to find some proper critical values of CR for different matrix sizes. Thus we argue that Saaty's consistency test could be unreasonable.
{"title":"Is It Reasonable for Saaty's Consistency Test in the Pairwise Comparison Method?","authors":"Wei-jun Xu, Yucheng Dong, Weilin Xiao","doi":"10.1109/CCCM.2008.136","DOIUrl":"https://doi.org/10.1109/CCCM.2008.136","url":null,"abstract":"In the pairwise comparison method, Saaty's consistency test is performed to ensure that the decision maker is being neither random nor illogical in his or her pairwise comparisons. Saaty suggested that the consistency ratio (CR) should be less than or equal to 0.1. Some researchers argued that the cut-off rule should be a function of the matrix size. In this paper, by simulation analysis, we find that, as the matrix size increases, the percent of the matrices with acceptable consistency (CR les 0.1) decreases dramatically, however, on the other hand, there will be more and more contradictory judgements in these sufficiently consistent matrices. This paradox shows that it is impossible to find some proper critical values of CR for different matrix sizes. Thus we argue that Saaty's consistency test could be unreasonable.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127087113","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}
Secure key issuing in identity-based public key cryptosystems is a challenging task due to the inherent drawback of key escrow and the requirement for secure channel between the private key generator (PKG) and users. In this paper, we propose a practical key issuing scheme. User registers at a local registration authority in off-line manner, local registration authority signs and delivers authenticated userpsilas information to multiple PKGs in batch manner. The master key is generated by PKGs based on secure distributed key generation protocol, which solves the key escrow problem. The secure channel between the user and the PKGs are not needed by using blinding technique. The proposed scheme is more efficient than those of existing key issuing schemes and the security is proved under random oracle model.
{"title":"A Practical Key Issuing Scheme in Identity-Based Cryptosystem","authors":"Chang-ji Wang, Jing Liu","doi":"10.1109/CCCM.2008.302","DOIUrl":"https://doi.org/10.1109/CCCM.2008.302","url":null,"abstract":"Secure key issuing in identity-based public key cryptosystems is a challenging task due to the inherent drawback of key escrow and the requirement for secure channel between the private key generator (PKG) and users. In this paper, we propose a practical key issuing scheme. User registers at a local registration authority in off-line manner, local registration authority signs and delivers authenticated userpsilas information to multiple PKGs in batch manner. The master key is generated by PKGs based on secure distributed key generation protocol, which solves the key escrow problem. The secure channel between the user and the PKGs are not needed by using blinding technique. The proposed scheme is more efficient than those of existing key issuing schemes and the security is proved under random oracle model.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127904645","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}
An intrusion detection system which can work in IPv6 network environment is designed and implemented based on protocol analysis and pattern match technology in this paper. The system not only can fast detect system vulnerabilities and network intrusion events, but also possesses high accuracy and good performance. Furthermore, the system is tested using IDSwakeup. The test shows that the system can detect 90% of the attacking packets and lost hardly any packet when enormous and different types of vicious data packets generated by data packet generator are sent. So the system is efficient and quick-reacting IDS working in IPv6 environment.
{"title":"Research and Implementation of Next Generation Network Intrusion Detection System Based on Protocol Analysis","authors":"Guo-xiang Yao, Quanlong Guan, Liangjie Lin, Shu-qiang Huang, Guo-cheng Zhu, Hui-ping Zhang, Zhi Gao","doi":"10.1109/CCCM.2008.30","DOIUrl":"https://doi.org/10.1109/CCCM.2008.30","url":null,"abstract":"An intrusion detection system which can work in IPv6 network environment is designed and implemented based on protocol analysis and pattern match technology in this paper. The system not only can fast detect system vulnerabilities and network intrusion events, but also possesses high accuracy and good performance. Furthermore, the system is tested using IDSwakeup. The test shows that the system can detect 90% of the attacking packets and lost hardly any packet when enormous and different types of vicious data packets generated by data packet generator are sent. So the system is efficient and quick-reacting IDS working in IPv6 environment.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132652842","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}
Xiaojun Zhang, Minglu Zhang, Jianguang Sun, Chunyan He
The robot assembled electronic nose has extensive applications, such as detecting toxic gases, searching explosives, detecting leakage, etc. Following the robot modular design concept, the paper designs a bionic electronic nose for robot, which has a human-like nasal cavity structure. It can simultaneously detect five kinds of different toxic gases, namely, CO, SO2, H2S, Cl2 and NH3, by using of electrochemical gas sensor array. The electrochemical gas sensor only responds to the specific gas, and has good selectivity and linear output, so the electronic nose dispenses with the pattern recognition algorithm in measuring multi-type gases simultaneously, which greatly reduces the operation task of olfactory system and improves the detection accuracy and efficiency to meet the robotpsilas real-time requirement, and can be conveniently changed corresponding gas sensors based on the target gases. By virtue of the compact structure, simple mechanical interface and communication interface, not only can the bionic electronic nose be used as a standardized component for all types of robots to help them to accomplish works related to olfaction, but also as a portable electronic nose applied to detect toxic gas in many fields.
{"title":"Design of a Bionic Electronic Nose for Robot","authors":"Xiaojun Zhang, Minglu Zhang, Jianguang Sun, Chunyan He","doi":"10.1109/CCCM.2008.69","DOIUrl":"https://doi.org/10.1109/CCCM.2008.69","url":null,"abstract":"The robot assembled electronic nose has extensive applications, such as detecting toxic gases, searching explosives, detecting leakage, etc. Following the robot modular design concept, the paper designs a bionic electronic nose for robot, which has a human-like nasal cavity structure. It can simultaneously detect five kinds of different toxic gases, namely, CO, SO2, H2S, Cl2 and NH3, by using of electrochemical gas sensor array. The electrochemical gas sensor only responds to the specific gas, and has good selectivity and linear output, so the electronic nose dispenses with the pattern recognition algorithm in measuring multi-type gases simultaneously, which greatly reduces the operation task of olfactory system and improves the detection accuracy and efficiency to meet the robotpsilas real-time requirement, and can be conveniently changed corresponding gas sensors based on the target gases. By virtue of the compact structure, simple mechanical interface and communication interface, not only can the bionic electronic nose be used as a standardized component for all types of robots to help them to accomplish works related to olfaction, but also as a portable electronic nose applied to detect toxic gas in many fields.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130441357","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}
Mining data streams poses great challenges due to the limited memory availability and real time query response requirement. One of the most important mining tasks is clustering. There already lots of clustering algorithms for data stream have been presented. Fuzzy cluster is an important clustering method. However, to the best of our knowledge, all the clustering algorithms are hard clustering methods, fuzzy clustering algorithm is presently not used directly for data streams. Fuzzy c-means (FCM) is a typical fuzzy clustering algorithm. In this paper, we extend FCM and propose a weighted fuzzy algorithm for clustering data stream. Experimental results on both synthetic and real data sets show its superiority over the traditional FCM algorithms.
{"title":"A Weighted Fuzzy Clustering Algorithm for Data Stream","authors":"Renxia Wan, Xiaoya Yan, Xiaoke Su","doi":"10.1109/CCCM.2008.186","DOIUrl":"https://doi.org/10.1109/CCCM.2008.186","url":null,"abstract":"Mining data streams poses great challenges due to the limited memory availability and real time query response requirement. One of the most important mining tasks is clustering. There already lots of clustering algorithms for data stream have been presented. Fuzzy cluster is an important clustering method. However, to the best of our knowledge, all the clustering algorithms are hard clustering methods, fuzzy clustering algorithm is presently not used directly for data streams. Fuzzy c-means (FCM) is a typical fuzzy clustering algorithm. In this paper, we extend FCM and propose a weighted fuzzy algorithm for clustering data stream. Experimental results on both synthetic and real data sets show its superiority over the traditional FCM algorithms.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116623517","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
扫码关注我们
求助内容：
应助结果提醒方式：