{"title":"Study on Stewart platform control method based on model reference adaptive control","authors":"Xue Jian, Tang Zhiyong, Pei Zhongcai","doi":"10.1109/CYBER.2011.6011756","DOIUrl":"https://doi.org/10.1109/CYBER.2011.6011756","url":null,"abstract":"For the benefits such as strong structural stiffness and high movement accuracy, Stewart platform has been widely used in industry. This paper presents a control method, which is based on the theory of model reference adaptive control, aiming to solve the control difficulties of the Stewart platform system, which is multivariate, highly nonlinear and multi-parameter coupled. Taking Narendra's model reference adaptive control method as the theoretical basis, this control method doesn't differentiate measured values, but compare the system output and reference model, and change the system parameters adaptively to make the system output move closer to the reference model. This method can effectively eliminate the asymmetry of asymmetrical cylinders, and has robustness for the load force disturbance. Computer simulations and experiment results show that this method enables the system to obtain a good dynamic performance.","PeriodicalId":131682,"journal":{"name":"2011 IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117105357","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}
{"title":"Global robust criteria for stochastic neutral neural networks with uncertainties and unbounded distributed delay","authors":"Guoquan Liu, Simon X. Yang","doi":"10.1109/CYBER.2011.6011808","DOIUrl":"https://doi.org/10.1109/CYBER.2011.6011808","url":null,"abstract":"The problem of global robust stability analysis is studied for a class of stochastic neutral neural networks with uncertainties and unbounded distributed delay. Novel stability criteria are obtained in terms of linear matrix inequality (LMI) by employing the Lyapunov-Krasovskii functional method and using the free-weighting matrices technique. In addition, two examples are given to show the effectiveness of the obtained conditions.","PeriodicalId":131682,"journal":{"name":"2011 IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117147819","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}
{"title":"Study on performance measurement for green supply chain management","authors":"Li Yan, Li Xia","doi":"10.1109/CYBER.2011.6011812","DOIUrl":"https://doi.org/10.1109/CYBER.2011.6011812","url":null,"abstract":"Globalization results in both pressure and drivers for Chinese enterprises to improve their environmental performance. As a developing country, China has to balance economic and environmental performance. Green supply chain management (GSCM) is emerging to be an important approach for Chinese enterprises to improve performance, possibly on both these dimensions. Drawing upon a database of over 160 manufacturing faculties in china this paper is to explore performance measurement for GSCM. The results show that GSCM is strongly complementary with other advanced management practices, and that it contributes to improved environmental performance. The effects on commercial performance are more ambiguous.","PeriodicalId":131682,"journal":{"name":"2011 IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129737013","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}
{"title":"A hybrid algorithm for sensing coverage problem in wireless sensor netwoks","authors":"Zhang Bin, Mao Jianlin, Liang Haiping","doi":"10.1109/CYBER.2011.6011785","DOIUrl":"https://doi.org/10.1109/CYBER.2011.6011785","url":null,"abstract":"The coverage problem is one basic problem in the wireless sensor networks (WSNs). In one limited region, how to reasonably arrange the sensor nodes to achieve the best coverage is the key to improve the performance of the whole networks. This paper presented a hybrid algorithm which is based on the fish swarm algorithm and particle swarm optimization in the limited WSNs region. The new algorithm has the well global search ability of the fish swarm algorithm and the quickly search ability of the particle swarm optimization. The simulation results show that the hybrid algorithm can effectively optimize the nodes' deployment of the sensor networks to improve the coverage of the whole networks.","PeriodicalId":131682,"journal":{"name":"2011 IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127186817","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}
{"title":"Approximate Jacobian control of robot manipulators without joint velocity measurements","authors":"Xinwu Liang, Xinhan Huang, Min Wang","doi":"10.1109/CYBER.2011.6011754","DOIUrl":"https://doi.org/10.1109/CYBER.2011.6011754","url":null,"abstract":"So far, all of the approximate Jacobian controllers for robot manipulators proposed in the literatures have assumed that the exact joint velocity measurements are available. In this paper, we propose alternative controller designs without the use of joint velocity measurements. To provide the joint velocities used by the controllers, we introduce the well-known sliding mode observers to estimate the robot manipulator states. In addition, Lyapunov analysis is presented to show that the combined controller-observer designs can achieve asymptotical stability in the sliding patch. Simulation results are also presented to show the performance of the proposed methods.","PeriodicalId":131682,"journal":{"name":"2011 IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128032149","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}
{"title":"A new coding method for genetic algorithm in vehicle routing problem","authors":"Qin Jiajiao, Zhang Yong, Mao Jianlin, F. Lixia","doi":"10.1109/CYBER.2011.6011793","DOIUrl":"https://doi.org/10.1109/CYBER.2011.6011793","url":null,"abstract":"Genetic algorithm is widely used to solve optimization problems for its characteristic, especially vehicle routing problem. By using this algorithm to solve the vehicle scheduling problem, determine the solution coding method is a very crucial basic work, because it will directly influence the algorithm to realize and the inferiority of algorithm performance. This paper presents a new coding method — the client direct arrangement and grouping randomized. Firstly, produce customer arrangement without repeating, and than put it into small groups randomly which is serviced by a vehicle separately. It represents a solution or a route. In the final, it is proved that the genetic algorithm with new coding has good performance through experiment.","PeriodicalId":131682,"journal":{"name":"2011 IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128311376","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}
{"title":"Attacker-exclusion scheme for cooperative spectrum sensing against SSDF attacks based on accumulated suspicious level","authors":"Siyang Liu, Quan Liu, Jun Gao, Jianxin Guan","doi":"10.1109/CYBER.2011.6011801","DOIUrl":"https://doi.org/10.1109/CYBER.2011.6011801","url":null,"abstract":"Cooperative spectrum sensing (CSS) is one of the vital mechanisms of cognitive radio (CR), however, its security area has attracted very little attention, which is vulnerable to the attacks of malicious secondary users. To counter the spectrum sensing data falsification (SSDF) attacks, an accumulated suspicious level-based algorithm was proposed. Based on all secondary users' reporting histories, it calculates the accumulated suspicious level and distinguishes honest users and attackers. Then, only the honest secondary users will be incorporated in decision combination at the fusion centre, which improves the robustness of CSS against SSDF attacks. Simulation results illustrated the effectiveness of the proposed scheme. Unlike other existing schemes, the algorithm does not assume any a priori information about the strategy of attackers and can effectively detect the intelligent attackers.","PeriodicalId":131682,"journal":{"name":"2011 IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134138832","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}
Y. Xiaodong, Xiang Feng-hong, Mao Jianlin, Wang Na
{"title":"An improved particle filter algorithm for target tracking in binary wireless sensor networks","authors":"Y. Xiaodong, Xiang Feng-hong, Mao Jianlin, Wang Na","doi":"10.1109/CYBER.2011.6011796","DOIUrl":"https://doi.org/10.1109/CYBER.2011.6011796","url":null,"abstract":"An improved particle filter algorithm with adaptive process noise variance is proposed for target tracking in binary wireless sensor networks (BWSN). The standard particle filter (SPF) is not fit for target's constant velocity model and has cumulative effect of prediction error. The proposed algorithm adopts real-time updating process noise variance to eliminate the cumulative effect of particle filter prediction error. The simulation results show that the proposed algorithm is suited for target's constant and variable velocity model with higher accuracy than SPF.","PeriodicalId":131682,"journal":{"name":"2011 IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133559288","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}
Jun He, Qian-Hua He, Zhifeng Wang, Yan-xiong Li, Hai-Yu Luo
{"title":"Dynamic speaker clustering algorithm based on minimal GMM distance tracing","authors":"Jun He, Qian-Hua He, Zhifeng Wang, Yan-xiong Li, Hai-Yu Luo","doi":"10.1109/CYBER.2011.6011763","DOIUrl":"https://doi.org/10.1109/CYBER.2011.6011763","url":null,"abstract":"In the field of speaker clustering, most of the clustering algorithms rely heavily on the pre-given thresholds, which is hard work to get the optimal values. This paper proposed a speaker clustering algorithm based on tracing the minimal Bhattacharyya distance between two Gaussian Mixture Models (GMMs), without any pre-given thresholds. In the procedure of clustering, if utterance set A and B has the minimal distance, utterance B is regarded as suspicious set whose utterance may come from the speaker of A. And then, two stage-verification is used. First, a comparative likelihood is used to verify whether the suspicious set B is generated from the speaker or not. Second, a comparative likelihood for each utterance in set B is used to judge whether it is produced by the speaker of set A or not. If the utterance is from the speaker of set A, we move the utterance of set B to set A. And then the models of utterance set A and B are updated. Repeat the above two stages until each speech set is not changed. Experiments, evaluated on Chinese 863 speech database, give 68.97% average cluster purity (ACP), and classification error ratio (CER) is 39%. On the other hand, CER of the K-means and the Iterative Self-Organizing Data Analysis (ISODATA) with the optimal thresholds give 35% and 38% respectively.","PeriodicalId":131682,"journal":{"name":"2011 IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124272274","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}