Pub Date : 2015-05-23DOI: 10.1109/CCDC.2015.7161759
Shiyu Yan, Hong Wang, Chong Liu, Haibin Zhao
For a typical electrocorticogram(ECoG)-based brain-computer interface(BCI) system, a pattern recognition algorithm using wavelet analysis and Fisher linear discriminant analysis(FLDA) was proposed. Firstly, based on studying wavelet theory, a novel feature extraction method in ECoG signal processing namely wavelet variance(WV) or wavelet packet variance(WPV) was proposed considering the band interlacing phenomenon in wavelet packet transform, and the computing method of WV/WPV was brought out; then, taken as feature, the WVs and WPVs of 6 most important channels were selected from 64 channels for analysis, consequently the ECoG data were three-layer decomposed, the WVs and WPVs containing Mu rhythm and Beta rhythm were taken out as final features based on ERD/ERS phenomenon; finally the final features were classified with FLDA in optimum-intervals of the ECoG data. The results showed that the max accuracy for test data was 92%, wavelet variance and wavelet packet variance could be taken as efficient features for ECoG.
{"title":"Electrocorticogram classification based on wavelet variance and Fisher linear discriminant analysis","authors":"Shiyu Yan, Hong Wang, Chong Liu, Haibin Zhao","doi":"10.1109/CCDC.2015.7161759","DOIUrl":"https://doi.org/10.1109/CCDC.2015.7161759","url":null,"abstract":"For a typical electrocorticogram(ECoG)-based brain-computer interface(BCI) system, a pattern recognition algorithm using wavelet analysis and Fisher linear discriminant analysis(FLDA) was proposed. Firstly, based on studying wavelet theory, a novel feature extraction method in ECoG signal processing namely wavelet variance(WV) or wavelet packet variance(WPV) was proposed considering the band interlacing phenomenon in wavelet packet transform, and the computing method of WV/WPV was brought out; then, taken as feature, the WVs and WPVs of 6 most important channels were selected from 64 channels for analysis, consequently the ECoG data were three-layer decomposed, the WVs and WPVs containing Mu rhythm and Beta rhythm were taken out as final features based on ERD/ERS phenomenon; finally the final features were classified with FLDA in optimum-intervals of the ECoG data. The results showed that the max accuracy for test data was 92%, wavelet variance and wavelet packet variance could be taken as efficient features for ECoG.","PeriodicalId":273292,"journal":{"name":"The 27th Chinese Control and Decision Conference (2015 CCDC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129852986","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 : 2015-05-23DOI: 10.1109/CCDC.2015.7162588
Jian Hou, Ping Lin, Qingling Wang
This paper studies the discrete-time system for multi-agent consensus problem via group information. In this scheme, neither the absolute states nor inter-agent relative states are available. We partition a group of agents into several subgroups in probability, and then use the relative group information to update each agent state. In this paper, we focus on the group information as the average value of the states of agents in the corresponding subgroup. It is shown that when the agents are divided into only two subgroups, almost surely consensus is achieved if and only if the weighting parameter is greater than one. While the subgroup number m = 3 is considered, one more condition that the partition probability to the chosen two subgroups should be equal is required to guarantee the convergence. Numerical simulations are provided to demonstrate the validity of our results.
{"title":"Distributed multi-agent consensus with multiple group information","authors":"Jian Hou, Ping Lin, Qingling Wang","doi":"10.1109/CCDC.2015.7162588","DOIUrl":"https://doi.org/10.1109/CCDC.2015.7162588","url":null,"abstract":"This paper studies the discrete-time system for multi-agent consensus problem via group information. In this scheme, neither the absolute states nor inter-agent relative states are available. We partition a group of agents into several subgroups in probability, and then use the relative group information to update each agent state. In this paper, we focus on the group information as the average value of the states of agents in the corresponding subgroup. It is shown that when the agents are divided into only two subgroups, almost surely consensus is achieved if and only if the weighting parameter is greater than one. While the subgroup number m = 3 is considered, one more condition that the partition probability to the chosen two subgroups should be equal is required to guarantee the convergence. Numerical simulations are provided to demonstrate the validity of our results.","PeriodicalId":273292,"journal":{"name":"The 27th Chinese Control and Decision Conference (2015 CCDC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128255707","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 : 2015-05-23DOI: 10.1109/CCDC.2015.7162221
Leigang Wang, Zhang Tao, Zheng Zeng
Extended Kalman filter (EKF) is prevailing for cooperative localization, where the cross-covariance (representing the correlation of estimated position) determines the benefit quantity from the local measurement. In this paper, the covariance factor set is adopted for cross-covariance maintaining in distributed architecture. During two exteroceptive measurements, the covariance factor set is propagated independently in each agent. When the updating information from the measuring agent is received by the other agents, a temporary relative master-slave relationship is determined between them. The updated correlation is retained in the receiver (slave) agent as a covariance factor. Meanwhile, the counterpart in the measuring (master) agent is set as identify matrix. The operation of matrix decomposition and the feedback for covariance update from slave to master is saved. Thus, the computational consumption and communication burden are reduced. It is significant for real-time cooperative localization.
{"title":"Dynamic master-slave distributed algorithm for cooperative localization with low computational cost","authors":"Leigang Wang, Zhang Tao, Zheng Zeng","doi":"10.1109/CCDC.2015.7162221","DOIUrl":"https://doi.org/10.1109/CCDC.2015.7162221","url":null,"abstract":"Extended Kalman filter (EKF) is prevailing for cooperative localization, where the cross-covariance (representing the correlation of estimated position) determines the benefit quantity from the local measurement. In this paper, the covariance factor set is adopted for cross-covariance maintaining in distributed architecture. During two exteroceptive measurements, the covariance factor set is propagated independently in each agent. When the updating information from the measuring agent is received by the other agents, a temporary relative master-slave relationship is determined between them. The updated correlation is retained in the receiver (slave) agent as a covariance factor. Meanwhile, the counterpart in the measuring (master) agent is set as identify matrix. The operation of matrix decomposition and the feedback for covariance update from slave to master is saved. Thus, the computational consumption and communication burden are reduced. It is significant for real-time cooperative localization.","PeriodicalId":273292,"journal":{"name":"The 27th Chinese Control and Decision Conference (2015 CCDC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129048779","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 : 2015-05-23DOI: 10.1109/CCDC.2015.7162813
Liu Zhen-yuan, Liao Guang-Rui
In the area of service, the heterogeneous labor is widely used, and it's a really important and challenging problem faced by company to schedule the labor reasonably and effectively. In this kind of problem, labor can be part-time available and tasks could be executed in one of some possible moments, but they should be accomplished as soon as possible. An integer programming model for heterogeneous labor scheduling with elastic tasks is developed in this paper. And a heuristic algorithm is proposed, which decomposes the whole scheduling problem into a series of sub-problem in which assignment will be taken place in every time window. The comparative computational experiment indicates that the proposed heuristic algorithm has high effectiveness and efficiency. It can achieve a better scheduling effect by adopting the task urgency rules.
{"title":"Heterogeneous labor scheduling with elastic tasks","authors":"Liu Zhen-yuan, Liao Guang-Rui","doi":"10.1109/CCDC.2015.7162813","DOIUrl":"https://doi.org/10.1109/CCDC.2015.7162813","url":null,"abstract":"In the area of service, the heterogeneous labor is widely used, and it's a really important and challenging problem faced by company to schedule the labor reasonably and effectively. In this kind of problem, labor can be part-time available and tasks could be executed in one of some possible moments, but they should be accomplished as soon as possible. An integer programming model for heterogeneous labor scheduling with elastic tasks is developed in this paper. And a heuristic algorithm is proposed, which decomposes the whole scheduling problem into a series of sub-problem in which assignment will be taken place in every time window. The comparative computational experiment indicates that the proposed heuristic algorithm has high effectiveness and efficiency. It can achieve a better scheduling effect by adopting the task urgency rules.","PeriodicalId":273292,"journal":{"name":"The 27th Chinese Control and Decision Conference (2015 CCDC)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124681388","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 : 2015-05-23DOI: 10.1109/CCDC.2015.7161890
A. Shi, B. Liu
A robust H∞ control of uncertain system with long time delay and multiple data packet dropouts is proposed in the paper. Delay and packet dropouts occur randomly in the actual networked control system. One sufficient condition is constructed in the paper to reflect both time-varying delay and packet drpouts, and probable multiple packet dropouts is dealt with the iterative ways. A non-fragile controller is obtained which can ensure system stability through a series of matrix inequalities. To show the effectiveness of the method, a simulation example is presented at the end.
{"title":"Robust H∞ control of wireless NCS with delay and packet dropouts","authors":"A. Shi, B. Liu","doi":"10.1109/CCDC.2015.7161890","DOIUrl":"https://doi.org/10.1109/CCDC.2015.7161890","url":null,"abstract":"A robust H∞ control of uncertain system with long time delay and multiple data packet dropouts is proposed in the paper. Delay and packet dropouts occur randomly in the actual networked control system. One sufficient condition is constructed in the paper to reflect both time-varying delay and packet drpouts, and probable multiple packet dropouts is dealt with the iterative ways. A non-fragile controller is obtained which can ensure system stability through a series of matrix inequalities. To show the effectiveness of the method, a simulation example is presented at the end.","PeriodicalId":273292,"journal":{"name":"The 27th Chinese Control and Decision Conference (2015 CCDC)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124691637","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 : 2015-05-23DOI: 10.1109/CCDC.2015.7162448
Xiu-hong Zhao
This paper developed a new variant of teaching-learning-based optimization (TLBO), called Teaching-Learning-Based Optimization with Crossover (TLBOC), for improving the performance of TLBO. The TLBOC incorporated the conventional crossover operation of differential evolution (DE) algorithm into teaching phases, which aims at balancing local and global searching effectively. Moreover, an estimation of distribution operation is used to predict a learning elitist. The learning elitist helps to boost learning efficiency of each student in learning phase. The performance of TLBOC is assessed for solving global unconstrained optimization functions with different characteristics. Compared to the TLBO and several other promising heuristic methods, numerical results reveal that the TLBOC has better optimization performance.
{"title":"Teaching-learning based optimization with crossover operation","authors":"Xiu-hong Zhao","doi":"10.1109/CCDC.2015.7162448","DOIUrl":"https://doi.org/10.1109/CCDC.2015.7162448","url":null,"abstract":"This paper developed a new variant of teaching-learning-based optimization (TLBO), called Teaching-Learning-Based Optimization with Crossover (TLBOC), for improving the performance of TLBO. The TLBOC incorporated the conventional crossover operation of differential evolution (DE) algorithm into teaching phases, which aims at balancing local and global searching effectively. Moreover, an estimation of distribution operation is used to predict a learning elitist. The learning elitist helps to boost learning efficiency of each student in learning phase. The performance of TLBOC is assessed for solving global unconstrained optimization functions with different characteristics. Compared to the TLBO and several other promising heuristic methods, numerical results reveal that the TLBOC has better optimization performance.","PeriodicalId":273292,"journal":{"name":"The 27th Chinese Control and Decision Conference (2015 CCDC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129452886","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 : 2015-05-23DOI: 10.1109/CCDC.2015.7161974
T. Huixin, Y. Jiaxin
Electricity is one of the main energy in iron and steel enterprise, it is very important to forecast power load accuracy. Accurate power load demands estimation is an important way to reduce production cost, thus data-driven subspace (DDS) method is proposed to forecast power load. Considering the needs in the load forecast period of enterprises in the different sectors, the load forecasting systems are classified into daily load forecasting and ultra-short term load forecasting. The subspace method is improved by introducing the feedback factor and the forgetting factor. The values of these factors are optimized by particle swarm optimization (PSO) algorithm to improve the prediction accuracy. The performance of the improved method is verified by Bao steel's practical data. Forecasting results of the improved method can provide beneficial advice in power load management.
{"title":"A novel improved data-driven subspace algorithm for power load forecasting in iron and steel enterprise","authors":"T. Huixin, Y. Jiaxin","doi":"10.1109/CCDC.2015.7161974","DOIUrl":"https://doi.org/10.1109/CCDC.2015.7161974","url":null,"abstract":"Electricity is one of the main energy in iron and steel enterprise, it is very important to forecast power load accuracy. Accurate power load demands estimation is an important way to reduce production cost, thus data-driven subspace (DDS) method is proposed to forecast power load. Considering the needs in the load forecast period of enterprises in the different sectors, the load forecasting systems are classified into daily load forecasting and ultra-short term load forecasting. The subspace method is improved by introducing the feedback factor and the forgetting factor. The values of these factors are optimized by particle swarm optimization (PSO) algorithm to improve the prediction accuracy. The performance of the improved method is verified by Bao steel's practical data. Forecasting results of the improved method can provide beneficial advice in power load management.","PeriodicalId":273292,"journal":{"name":"The 27th Chinese Control and Decision Conference (2015 CCDC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130664269","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 : 2015-05-23DOI: 10.1109/CCDC.2015.7162425
Penghua Li, Minglong Chen, Fangchao Hu, Yang Xu
This paper presents a speaker identification algorithm using the deep neural network (DNN) as the classifier to learn the features of the voiceprints represented by spectrogram. The collected speech signals are pre-emphasized, windowed, divided into some chunks, then calculated to obtain the magnitude of the frequency spectrum, which creates the spectrograms. The local binary patterns (LBP) operator is used to obtain the texture features embedded in spectrograms. These texture features, being represented by LBP vectors, are fed to DNN with four hidden layers to learn the speech features. In the learning progress, both of extraction and reconstruction procedures are reduplicated in each hidden layer. Through these extraction and reconstruction procedures of DNN, the speech features of each individual are given as a recognition figure, which offers the recognition results. The numerical experiments indicate that our approach has an acceptable recognition rate with high accuracy.
{"title":"A spectrogram-based voiceprint recognition using deep neural network","authors":"Penghua Li, Minglong Chen, Fangchao Hu, Yang Xu","doi":"10.1109/CCDC.2015.7162425","DOIUrl":"https://doi.org/10.1109/CCDC.2015.7162425","url":null,"abstract":"This paper presents a speaker identification algorithm using the deep neural network (DNN) as the classifier to learn the features of the voiceprints represented by spectrogram. The collected speech signals are pre-emphasized, windowed, divided into some chunks, then calculated to obtain the magnitude of the frequency spectrum, which creates the spectrograms. The local binary patterns (LBP) operator is used to obtain the texture features embedded in spectrograms. These texture features, being represented by LBP vectors, are fed to DNN with four hidden layers to learn the speech features. In the learning progress, both of extraction and reconstruction procedures are reduplicated in each hidden layer. Through these extraction and reconstruction procedures of DNN, the speech features of each individual are given as a recognition figure, which offers the recognition results. The numerical experiments indicate that our approach has an acceptable recognition rate with high accuracy.","PeriodicalId":273292,"journal":{"name":"The 27th Chinese Control and Decision Conference (2015 CCDC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123864457","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 : 2015-05-23DOI: 10.1109/CCDC.2015.7162107
Susu Guo, Zijing Zhou, Jianming Li, Qiao Xiang, Zhonghua Li
RFID technology is one of the major core competencies for Internet of Things (IOT). Organizational strategies focus on improving the management efficiency as well as reducing the operational cost to maintain profit margins. Therefore, the performance of RFID systems has attracted researchers' attention. A variety of soft computing techniques have been employed to improve effectiveness and efficiency in various aspects of RFID systems. Meanwhile, an increasing number of papers have been published to address related issues. The aim of this paper is to summarize the findings by a systematic review of existing research papers concerning the application of soft computing techniques to RFID technology.
{"title":"Applications of soft computing in RFID system: A review","authors":"Susu Guo, Zijing Zhou, Jianming Li, Qiao Xiang, Zhonghua Li","doi":"10.1109/CCDC.2015.7162107","DOIUrl":"https://doi.org/10.1109/CCDC.2015.7162107","url":null,"abstract":"RFID technology is one of the major core competencies for Internet of Things (IOT). Organizational strategies focus on improving the management efficiency as well as reducing the operational cost to maintain profit margins. Therefore, the performance of RFID systems has attracted researchers' attention. A variety of soft computing techniques have been employed to improve effectiveness and efficiency in various aspects of RFID systems. Meanwhile, an increasing number of papers have been published to address related issues. The aim of this paper is to summarize the findings by a systematic review of existing research papers concerning the application of soft computing techniques to RFID technology.","PeriodicalId":273292,"journal":{"name":"The 27th Chinese Control and Decision Conference (2015 CCDC)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124034077","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 : 2015-05-23DOI: 10.1109/CCDC.2015.7162513
Naihu Li, Shihua Li
In actual servo system, the transmission mechanism is not an ideal rigid body, and mechanical resonance easily occurs. In this paper, the transmission mechanism of servo system is equivalent to a torsion spring, and the entire flexible connection servo system is simplified into a motor-spring-load two-mass system, then the mathematical model of the flexible connection servo system is established through theoretical analysis. Since the mechanical resonant frequency of the system will change with time and environment, the parameters of notch filter must be adjusted online with the resonant frequency. In this paper, according to the application requirements of mechanical resonance online suppressing, the mechanical resonance online suppressing algorithm based on adaptive IIR notch filter is proposed. Using a recursive least squares algorithm, resonant frequency of the system is online estimated, and then the frequency parameters of notch filter are adjusted online. The simulation results show the effectiveness of this method.
{"title":"Suppression of servo system mechanical resonance based on adaptive IIR notch filter","authors":"Naihu Li, Shihua Li","doi":"10.1109/CCDC.2015.7162513","DOIUrl":"https://doi.org/10.1109/CCDC.2015.7162513","url":null,"abstract":"In actual servo system, the transmission mechanism is not an ideal rigid body, and mechanical resonance easily occurs. In this paper, the transmission mechanism of servo system is equivalent to a torsion spring, and the entire flexible connection servo system is simplified into a motor-spring-load two-mass system, then the mathematical model of the flexible connection servo system is established through theoretical analysis. Since the mechanical resonant frequency of the system will change with time and environment, the parameters of notch filter must be adjusted online with the resonant frequency. In this paper, according to the application requirements of mechanical resonance online suppressing, the mechanical resonance online suppressing algorithm based on adaptive IIR notch filter is proposed. Using a recursive least squares algorithm, resonant frequency of the system is online estimated, and then the frequency parameters of notch filter are adjusted online. The simulation results show the effectiveness of this method.","PeriodicalId":273292,"journal":{"name":"The 27th Chinese Control and Decision Conference (2015 CCDC)","volume":"253 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124178116","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
扫码关注我们
求助内容：
应助结果提醒方式：