针对在低信噪比(SNR)情况下稀疏度欠估计和高信噪比情况下稀疏度过估计的问题,提出了一种基于Gerschgorin理论稀疏度估计的宽带频谱感知算法。首先,该算法利用Gerschgorin理论分离信号圆盘与噪声圆盘得到稀疏度估计值;然后,利用正交匹...针对在低信噪比(SNR)情况下稀疏度欠估计和高信噪比情况下稀疏度过估计的问题,提出了一种基于Gerschgorin理论稀疏度估计的宽带频谱感知算法。首先,该算法利用Gerschgorin理论分离信号圆盘与噪声圆盘得到稀疏度估计值;然后,利用正交匹配追踪(OMP)算法得到频谱支撑集;最后,完成宽带频谱感知。仿真结果表明,所提算法、AIC-OMP算法和MDL-OMP算法频谱感知的检测概率达到95%信噪比分别需要4.6 d B、8.5 d B和9.7 d B;所提算法频谱感知的虚警概率在信噪比大于13 d B时趋近于0,明显低于BPD-OMP和GDRI-OMP算法的虚警概率,因此,所提算法对于压缩感知(CS)的信号稀疏度估计兼顾了低信噪比和高信噪比时的稀疏度估计性能,频谱感知性能优于AIC-OMP算法、MDL-OMP算法、BPD-OMP算法和GDRI-OMP算法。展开更多
In this paper, we propose a new genetic algorithm for job-shop scheduling problems （JSP）. The proposed method uses the operation-based representation, based on schema theorem and building block hypothesis, a new cro...In this paper, we propose a new genetic algorithm for job-shop scheduling problems （JSP）. The proposed method uses the operation-based representation, based on schema theorem and building block hypothesis, a new crossover is proposed ： By selecting short, low order highly fit schemas to genetic operator, the crossover can exchange meaningful ordering information of parents effectively and can search the global optimization. Simulation results on MT benchmark problem coded by C ＋ ＋ show that our genetic operators are very powerful and suitable to job-shop scheduling problems and our method outperforms the previous GA-based approaches.展开更多
We present some convergence and boundedness theorems with respect to filter convergence for lattice group-valued measures. We give a direct proof, based on the sliding hump argument. Furthermore we pose some open prob...We present some convergence and boundedness theorems with respect to filter convergence for lattice group-valued measures. We give a direct proof, based on the sliding hump argument. Furthermore we pose some open problems.展开更多
文摘针对在低信噪比(SNR)情况下稀疏度欠估计和高信噪比情况下稀疏度过估计的问题,提出了一种基于Gerschgorin理论稀疏度估计的宽带频谱感知算法。首先,该算法利用Gerschgorin理论分离信号圆盘与噪声圆盘得到稀疏度估计值;然后,利用正交匹配追踪(OMP)算法得到频谱支撑集;最后,完成宽带频谱感知。仿真结果表明,所提算法、AIC-OMP算法和MDL-OMP算法频谱感知的检测概率达到95%信噪比分别需要4.6 d B、8.5 d B和9.7 d B;所提算法频谱感知的虚警概率在信噪比大于13 d B时趋近于0,明显低于BPD-OMP和GDRI-OMP算法的虚警概率,因此,所提算法对于压缩感知(CS)的信号稀疏度估计兼顾了低信噪比和高信噪比时的稀疏度估计性能,频谱感知性能优于AIC-OMP算法、MDL-OMP算法、BPD-OMP算法和GDRI-OMP算法。
文摘In this paper, we propose a new genetic algorithm for job-shop scheduling problems （JSP）. The proposed method uses the operation-based representation, based on schema theorem and building block hypothesis, a new crossover is proposed ： By selecting short, low order highly fit schemas to genetic operator, the crossover can exchange meaningful ordering information of parents effectively and can search the global optimization. Simulation results on MT benchmark problem coded by C ＋ ＋ show that our genetic operators are very powerful and suitable to job-shop scheduling problems and our method outperforms the previous GA-based approaches.
文摘We present some convergence and boundedness theorems with respect to filter convergence for lattice group-valued measures. We give a direct proof, based on the sliding hump argument. Furthermore we pose some open problems.
