Binary particle swarm optimization algorithm(BPSOA) has the excellent characters such as easy to implement and few set parameters.But it is tendentious to stick in the local optimal solutions and has slow convergence ...Binary particle swarm optimization algorithm(BPSOA) has the excellent characters such as easy to implement and few set parameters.But it is tendentious to stick in the local optimal solutions and has slow convergence rate when the problem is complex.Cultural algorithm(CA) can exploit knowledge extracted during the search to improve the performance of an evolutionary algorithm and show higher intelligence in treating complicated problems.So it is proposed that integrating binary particle swarm algorithm into cultural algorithm frame to develop a more efficient cultural binary particle swarm algorithm (CBPSOA) for fault feature selection.In CBPSOA,BPSOA is used as the population space of CA;the evolution of belief space adopts crossover,mutation and selection operations;the designs of acceptance function and influence function are improved according to the evolution character of BPSOA.The tests of optimizing functions show the proposed algorithm is valid and effective.Finally,CBPSOA is applied for fault feature selection.The simulations on Tennessee Eastman process (TEP) show the CBPSOA can perform better and more quickly converge than initial BPSOA.And with fault feature selection,more satisfied performance of fault diagnosis is obtained.展开更多
Delay diversity is an effective transmit diversity technique to combat adverse effects of fading. Thus far, previous work in delay diversity assumed that perfect estimates of current channel fading conditions are ava...Delay diversity is an effective transmit diversity technique to combat adverse effects of fading. Thus far, previous work in delay diversity assumed that perfect estimates of current channel fading conditions are available at the receiver and training symbols are required to estimate the channel from the transmitter to the receiver. However, increasing the number of the antennas increases the required training interval and reduces the available time with in whichdata may be transmitted. Learning the channel coefficients becomes increasingly difficult for the frequency selective channels. In this paper, with the subspace method and the delay character of delay diversity, a channel estimation method is proposed, which does not use training symbols. It addresses the transmit diversity for a frequency selective channel from a single carrier perspective in the form of a simple equivalent flat fading model. Monte Carlo simulations give the performance of channel estimation and the performance comparison of our channel-estimation-based detector with decision feedback equalization, which uses the perfect channel information.展开更多
Grapiglia et al.(2013) proved subspace properties for the Celis-Dennis-Tapia(CDT) problem. If a subspace with lower dimension is appropriately chosen to satisfy subspace properties, then one can solve the CDT problem ...Grapiglia et al.(2013) proved subspace properties for the Celis-Dennis-Tapia(CDT) problem. If a subspace with lower dimension is appropriately chosen to satisfy subspace properties, then one can solve the CDT problem in that subspace so that the computational cost can be reduced. We show how to find subspaces that satisfy subspace properties for the CDT problem, by using the eigendecomposition of the Hessian matrix of the objection function. The dimensions of the subspaces are investigated. We also apply the subspace technologies to the trust region subproblem and the quadratic optimization with two quadratic constraints.展开更多
基金National High Technology Research and Development Program of China(No.2007AA04Z171)
文摘Binary particle swarm optimization algorithm(BPSOA) has the excellent characters such as easy to implement and few set parameters.But it is tendentious to stick in the local optimal solutions and has slow convergence rate when the problem is complex.Cultural algorithm(CA) can exploit knowledge extracted during the search to improve the performance of an evolutionary algorithm and show higher intelligence in treating complicated problems.So it is proposed that integrating binary particle swarm algorithm into cultural algorithm frame to develop a more efficient cultural binary particle swarm algorithm (CBPSOA) for fault feature selection.In CBPSOA,BPSOA is used as the population space of CA;the evolution of belief space adopts crossover,mutation and selection operations;the designs of acceptance function and influence function are improved according to the evolution character of BPSOA.The tests of optimizing functions show the proposed algorithm is valid and effective.Finally,CBPSOA is applied for fault feature selection.The simulations on Tennessee Eastman process (TEP) show the CBPSOA can perform better and more quickly converge than initial BPSOA.And with fault feature selection,more satisfied performance of fault diagnosis is obtained.
基金the National Natural Science Foundation of China (No.69872029)
文摘Delay diversity is an effective transmit diversity technique to combat adverse effects of fading. Thus far, previous work in delay diversity assumed that perfect estimates of current channel fading conditions are available at the receiver and training symbols are required to estimate the channel from the transmitter to the receiver. However, increasing the number of the antennas increases the required training interval and reduces the available time with in whichdata may be transmitted. Learning the channel coefficients becomes increasingly difficult for the frequency selective channels. In this paper, with the subspace method and the delay character of delay diversity, a channel estimation method is proposed, which does not use training symbols. It addresses the transmit diversity for a frequency selective channel from a single carrier perspective in the form of a simple equivalent flat fading model. Monte Carlo simulations give the performance of channel estimation and the performance comparison of our channel-estimation-based detector with decision feedback equalization, which uses the perfect channel information.
基金supported by National Natural Science Foundation of China(Grant Nos.11171217 and 11571234)
文摘Grapiglia et al.(2013) proved subspace properties for the Celis-Dennis-Tapia(CDT) problem. If a subspace with lower dimension is appropriately chosen to satisfy subspace properties, then one can solve the CDT problem in that subspace so that the computational cost can be reduced. We show how to find subspaces that satisfy subspace properties for the CDT problem, by using the eigendecomposition of the Hessian matrix of the objection function. The dimensions of the subspaces are investigated. We also apply the subspace technologies to the trust region subproblem and the quadratic optimization with two quadratic constraints.
