Recently,as recognizing emotion has been one of the hallmarks of affective computing,more attention has been paid to physiological signals for emotion recognition.This paper presented an approach to emotion recognitio...Recently,as recognizing emotion has been one of the hallmarks of affective computing,more attention has been paid to physiological signals for emotion recognition.This paper presented an approach to emotion recognition using ElectroCardioGraphy(ECG) signals from multiple subjects.To collect reliable affective ECG data,we applied an arousal method by movie clips to make subjects experience specific emotions without external interference.Through precise location of P-QRS-T wave by continuous wavelet transform,an amount of ECG features was extracted sufficiently.Since feature selection is a combination optimization problem,Improved Binary Particle Swarm Optimization(IBPSO) based on neighborhood search was applied to search out effective features to improve classification results of emotion states with the help of fisher or K-Nearest Neighbor(KNN) classifier.In the experiment,it is shown that the approach is successful and the effective features got from ECG signals can express emotion states excellently.展开更多
A data-aided technique for cartier frequency offset estimation with continuous phase modulation （CPM） in burst- mode transmission is presented. The proposed technique first exploits a special pilot sequence, or trai...A data-aided technique for cartier frequency offset estimation with continuous phase modulation （CPM） in burst- mode transmission is presented. The proposed technique first exploits a special pilot sequence, or training sequence, to form a sinusoidal waveform. Then, an improved dichotomous search frequency offset estimator is introduced to determine the frequency offset using the sinusoid. Theoretical analysis and simulation results indicate that our estimator is noteworthy in the following aspects. First, the estimator can operate independently of timing recovery. Second, it has relatively low outlier, i.e., the minimum signal-to-noise ratio （SNR） required to guarantee estimation accuracy. Finally, the most important property is that our estimator is complexity-reduced compared to the existing dichotomous search methods： it eliminates the need for fast Fourier transform （FFT） and modulation removal, and exhibits faster convergence rate without accuracy degradation.展开更多
This paper provides a gradient search algorithm for finding the maximal visible area polygon (VAP) viewed by an interior point in a simple polygon P. The algorithm is based on a natural partition of P into convex sets...This paper provides a gradient search algorithm for finding the maximal visible area polygon (VAP) viewed by an interior point in a simple polygon P. The algorithm is based on a natural partition of P into convex sets, such that each element of the partition is associated with a unique analytical form of the area function. We call this partition a back diagonal partition of P. Our maximal VAP algorithm converges in a finite number of steps, and is polynomial with a complexity of , for a simple polygon P with n vertices, and r reflex vertices. We use the maximal VAP algorithm as a basis for a greedy heuristic for the well known guardhouse problem with a computation complexity of .展开更多
We present the analog analogue of Grover's problem as an example of the time-independent Hamiltonian for applying the speed limit of the imaginary-time Schrödinger equation derived by Okuyama and Ohzeki and t...We present the analog analogue of Grover's problem as an example of the time-independent Hamiltonian for applying the speed limit of the imaginary-time Schrödinger equation derived by Okuyama and Ohzeki and the new class of energy-time uncertainty relation proposed by Kieu. It is found that the computational time of the imaginary-time quantum annealing of this Grover search can be exponentially small, while the counterpart of the quantum evolution driven by the real-time Schrödinger equation could only provide square root speedup, compared with classic search. The present results are consistent with the cases of the time-dependent quantum evolution of the natural Grover problem in previous works. We once again emphasize that the logarithm and square root algorithmic performances are generic in imaginary-time quantum annealing and quantum evolution driven by real-time Schrödinger equation, respectively. Also, we provide evidences to search deep reasons why the imaginary-time quantum annealing can lead to exponential speedup and the real-time quantum annealing can make square root speedup.展开更多
Steelmaking–refining–Continuous Casting(SCC) scheduling is a worldwide problem, which is NP-hard. Effective SCC scheduling algorithms can help to enhance productivity, and thus make significant monetary savings. Thi...Steelmaking–refining–Continuous Casting(SCC) scheduling is a worldwide problem, which is NP-hard. Effective SCC scheduling algorithms can help to enhance productivity, and thus make significant monetary savings. This paper develops an Improved Artificial Bee Colony(IABC) algorithm for the SCC scheduling. In the proposed IABC, charge permutation is employed to represent the solutions. In the population initialization, several solutions with certain quality are produced by a heuristic while others are generated randomly. Two variable neighborhood search neighborhood operators are devised to generate new high-quality solutions for the employed bee and onlooker bee phases, respectively. Meanwhile, in order to enhance the exploitation ability, a control parameter is introduced to conduct the search of onlooker bee phase. Moreover, to enhance the exploration ability,the new generated solutions are accepted with a control acceptance criterion. In the scout bee phase, the solution corresponding to a scout bee is updated by performing three swap operators and three insert operators with equal probability. Computational comparisons against several recent algorithms and a state-of-the-art SCC scheduling algorithm have demonstrated the strength and superiority of the IABC.展开更多
基金Supported by the National Natural Science Foundation of China (No.60873143)the National Key Subject Foundation for Basic Psychology (No.NKSF07003)
文摘Recently,as recognizing emotion has been one of the hallmarks of affective computing,more attention has been paid to physiological signals for emotion recognition.This paper presented an approach to emotion recognition using ElectroCardioGraphy(ECG) signals from multiple subjects.To collect reliable affective ECG data,we applied an arousal method by movie clips to make subjects experience specific emotions without external interference.Through precise location of P-QRS-T wave by continuous wavelet transform,an amount of ECG features was extracted sufficiently.Since feature selection is a combination optimization problem,Improved Binary Particle Swarm Optimization(IBPSO) based on neighborhood search was applied to search out effective features to improve classification results of emotion states with the help of fisher or K-Nearest Neighbor(KNN) classifier.In the experiment,it is shown that the approach is successful and the effective features got from ECG signals can express emotion states excellently.
基金supported by the National Natural Science Foundation of China(Grant No.61301179)the Doctorial Programs Foundation of the Ministry of Education,China(Grant No.20110203110011)the Programme of Introducing Talents of Discipline to Universities,China(Grant No.B08038)
文摘A data-aided technique for cartier frequency offset estimation with continuous phase modulation （CPM） in burst- mode transmission is presented. The proposed technique first exploits a special pilot sequence, or training sequence, to form a sinusoidal waveform. Then, an improved dichotomous search frequency offset estimator is introduced to determine the frequency offset using the sinusoid. Theoretical analysis and simulation results indicate that our estimator is noteworthy in the following aspects. First, the estimator can operate independently of timing recovery. Second, it has relatively low outlier, i.e., the minimum signal-to-noise ratio （SNR） required to guarantee estimation accuracy. Finally, the most important property is that our estimator is complexity-reduced compared to the existing dichotomous search methods： it eliminates the need for fast Fourier transform （FFT） and modulation removal, and exhibits faster convergence rate without accuracy degradation.
文摘This paper provides a gradient search algorithm for finding the maximal visible area polygon (VAP) viewed by an interior point in a simple polygon P. The algorithm is based on a natural partition of P into convex sets, such that each element of the partition is associated with a unique analytical form of the area function. We call this partition a back diagonal partition of P. Our maximal VAP algorithm converges in a finite number of steps, and is polynomial with a complexity of , for a simple polygon P with n vertices, and r reflex vertices. We use the maximal VAP algorithm as a basis for a greedy heuristic for the well known guardhouse problem with a computation complexity of .
基金Project supported by the China Postdoctoral Science Foundation (Grant No. 2017M620322)the Priority Fund for the Postdoctoral Scientific and Technological Program of Hubei Province in 2017, the Seed Foundation of Huazhong University of Science and Technology (Grant No. 2017KFYXJJ070)the Science and Technology Program of Shenzhen of China (Grant No. JCYJ 20180306124612893).
文摘We present the analog analogue of Grover's problem as an example of the time-independent Hamiltonian for applying the speed limit of the imaginary-time Schrödinger equation derived by Okuyama and Ohzeki and the new class of energy-time uncertainty relation proposed by Kieu. It is found that the computational time of the imaginary-time quantum annealing of this Grover search can be exponentially small, while the counterpart of the quantum evolution driven by the real-time Schrödinger equation could only provide square root speedup, compared with classic search. The present results are consistent with the cases of the time-dependent quantum evolution of the natural Grover problem in previous works. We once again emphasize that the logarithm and square root algorithmic performances are generic in imaginary-time quantum annealing and quantum evolution driven by real-time Schrödinger equation, respectively. Also, we provide evidences to search deep reasons why the imaginary-time quantum annealing can lead to exponential speedup and the real-time quantum annealing can make square root speedup.
基金Supported by the National Natural Science Foundation of China(51705177,51575212)the Program for New Century Excellent Talents in University(NCET-13-0106)the Program for HUST Academic Frontier Youth Team
文摘Steelmaking–refining–Continuous Casting(SCC) scheduling is a worldwide problem, which is NP-hard. Effective SCC scheduling algorithms can help to enhance productivity, and thus make significant monetary savings. This paper develops an Improved Artificial Bee Colony(IABC) algorithm for the SCC scheduling. In the proposed IABC, charge permutation is employed to represent the solutions. In the population initialization, several solutions with certain quality are produced by a heuristic while others are generated randomly. Two variable neighborhood search neighborhood operators are devised to generate new high-quality solutions for the employed bee and onlooker bee phases, respectively. Meanwhile, in order to enhance the exploitation ability, a control parameter is introduced to conduct the search of onlooker bee phase. Moreover, to enhance the exploration ability,the new generated solutions are accepted with a control acceptance criterion. In the scout bee phase, the solution corresponding to a scout bee is updated by performing three swap operators and three insert operators with equal probability. Computational comparisons against several recent algorithms and a state-of-the-art SCC scheduling algorithm have demonstrated the strength and superiority of the IABC.
