Robustness is a very important issue in the field of automatic speech recognition (ASR) research, especially to provide high recognition accuracy in practical applications. However, the recognition rate based on the t...
详细信息
Despite that the surrogate-assisted evolutionary algorithms have achieved great success in addressing expensive optimization problems, they still suffer from stiff challenges when the number of dimensions of problems ...
详细信息
Despite that the surrogate-assisted evolutionary algorithms have achieved great success in addressing expensive optimization problems, they still suffer from stiff challenges when the number of dimensions of problems becomes large. The primary reason lies in that it is very hard to build an acceptable surrogate model in the high-dimensional search space with small amounts of evaluated historical data in evolution. To tackle this issue, we suggest an effective surrogate modeling method for large-scale expensive optimization in this paper, where the models are built on a number of linear subspaces instead of the original search space. Specifically, a linear subspace is constructed by a pair of points/solutions which are generated based on the set of elite solutions. For each linear subspace, several historical solutions are first associated according to their distance to the linear subspace, and then a surrogate model is trained by the associated solutions and used to evaluate the offspring. To ensure the exploration and exploitation capacity of the proposed method, these linear subspaces and the surrogate models are updated after a few iterations. Experimental results on CEC’2010 and CEC’2013 single-objective optimization problems with up to 1500 decision variables show that the proposed algorithm is superior over six comparison algorithms. Moreover, we also extend the proposed algorithm to multi-objective optimization problems and verified its competitiveness on problems with up to 1500 decision variables. IEEE
The connections between Maxwell's equations and symplectic matrix are studied. First, we analyze the continuous-time Maxwell's differential equations in free space and verify its time evolution matrix (TEMA) i...
详细信息
Cyclic codes of dimension 2 over a finite field are shown to have at most two nonzero weights. We compute their weight distribution, and give a condition on the roots of their check polynomials for them to be maximum ...
详细信息
Cyclic codes of dimension 2 over a finite field are shown to have at most two nonzero weights. We compute their weight distribution, and give a condition on the roots of their check polynomials for them to be maximum distance separable code.
We propose a robust pipeline detection algorithm for obscuration environments, which includes two improvements: a pre-processing method called the Regional Adaptive Thresh-olding Algorithm (RATA) and a novel clusterin...
详细信息
This paper proposes and designs a microstrip antenna that can work in the B1 band for Beidou with a double-layer substrate, and realizes the circularly polarized radiation characteristics. The antenna consists of a gr...
详细信息
Reconfigurable intelligent Surface (RIS) is a revolutionary technology in modern wireless communication systems, since it can adjust the wireless communication environment with passive components. In this paper, we co...
详细信息
Magnetic coupling resonance wireless power transmission is a new technology to realize the wireless transmission of energy by means of high frequency coupling resonance between the coils. The variation of the coupling...
详细信息
In this paper, we present a robust face recognition method with combined locality-sensitive sparsity and group sparsity constraint. The group sparsity constraint is designed to utilize the grouped structure informatio...
详细信息
The paper introduces a Kernel Weibull M-Transform Least-Mean Square (LMS) (KWMLMS) algorithm aimed to enhance filtering performance for a nonlinear system. By incorporating the Weibull M-Transformation into the cost f...
详细信息
暂无评论