基于SVM-UPF的雷达弱小目标检测前跟踪算法

针对低信噪比条件下雷达弱小目标的检测与跟踪,提出了基于支持向量机和无迹粒子滤波的检测前跟踪算法。该算法采用无迹卡尔曼滤波生成粒子滤波的重要性密度函数,提高了粒子的使用效率,在此基础上将支持向量机引入到粒子重采样步骤中,通过构建状态的后验概率密度函数来获得多样性的新粒子,有效解决了粒子贫化问题,仿真结果表明,该算法提高了目标的检测概率和跟踪精度。     

地球静止轨道高能电子通量在线预测模型

利用粒子群优化算法和最小二乘支持向量机,建立地球静止轨道高能电子通量在线预测模型。针对粒子群优化算法,提出一种新的粒子群多样性测度计算方法,有效改善其早熟收敛现象。运用改进的粒子群优化算法优化最小二乘支持向量机的正则化参数和核参数。利用滑动时间窗口策略更新模型数据,选择触发机制以及模型的再学习机制为设计变量,实现模型的在线预测功能。对2000年电子通量监测数据和相关太阳风、地磁参数等实际数据进行的提前1~3天的预测实验,表明所建在线预测模型具有较高的预测性能,并具有一定的实用价值。     

基于层间嵌入式多级支持向量机的特征选择

针对多故障样本一次性映射之后分类不理想,研究了多级层次式支持向量机,应用UCI数据仿真,结果表明该方法缩短了训练时间、提升了测试准确率、改善了样本的可分类性。由于误差积累,在此基础上,提出了层间嵌入式多级支持向量机,采用Abalone数据仿真,结果表明分类精度有所提高并减少了分类步骤。结合ReliefF算法,对制导设备的故障特征参数进行了选择。     

Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness

We study a parallel machine scheduling problem, where a job j can only be processed on a specific subset of machines M_j, and the M_j subsets of the n jobs are nested. We develop a two‐phase heuristic for minimizing the total weighted tardiness subject to the machine eligibility constraints. In the first phase, we compute the factors and statistics that characterize a problem instance. In the second phase, we propose a new composite dispatching rule, the Apparent Tardiness Cost with Flexibility considerations (ATCF) rule, which is governed by several scaling parameters of which the values are determined by the factors obtained in the first phase. The ATCF rule is a generalization of the well‐known ATC rule which is very widely used in practice. We further discuss how to improve the dispatching rule using some simple but powerful properties without requiring additional computation time, and the improvement is quite satisfactory. We apply the Sequential Uniform Design Method to design our experiments and conduct an extensive computational study, and we perform tests on the performance of the ATCF rule using a real data set from a large hospital in China. We further compare its performance with that of the classical ATC rule. We also compare the schedules improved by the ATCF rule with what we believe are Near Optimal schedules generated by a general search procedure. The computational results show that especially with a low due date tightness, the ATCF rule performs significantly better than the well‐known ATC rule generating much improved schedules that are close to the Near Optimal schedules. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 249–267, 2017     

Scheduling for parallel dedicated machines with a single server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000     

无刷双馈电机原理及控制策略

详细分析了无刷双馈发电机的基本原理,基于不同的参考坐标系(转子轴dq0坐标系和同步坐标系),建立了无刷双馈发电机不同的数学模型.依据建立的数学模型,介绍了无刷双馈发电机的几种控制策略(标量控制、磁场定向控制、直接转矩控制、智能控制方法),并指出其优缺点.最后,指出了无刷双馈发电机运行控制中存在的难点和进一步研究的方向.     

Server scheduling on parallel dedicated machines with fixed job sequences

We consider server scheduling on parallel dedicated machines to minimize the makespan. Each job has a loading operation and a processing operation. The loading operation requires a server that serves all the jobs. Each machine has a given set of jobs to process, and the processing sequence is known and fixed. We design a polynomial‐time algorithm to solve the two‐machine case of the problem. When the number of machines is arbitrary, the problem becomes strongly NP‐hard even if all the jobs have the same processing length or all the loading operations require a unit time. We design two heuristic algorithms to treat the case where all the loading times are unit and analyze their performance.     

判决特征选择的快速人脸识别算法

为了在确保识别精度的条件下提高人脸识别的速度,提出了判决特征选择算法(SVM-DFS).针对多类分类问题,判决特征选择算法根据统计学习理论使用支持向量机来实现特征选择,根据全概率定理把特征选择和多类分类集成到一个统一框架.在UMIST和FERET人脸数据库上的实验表明:SVM-DFS算法可以用来挑选对分类最有用的特征,这些挑选出来的特征具有明显的物理意义.使用判决特征选择方法不但可以加快分类器的响应速度,而且不降低分类器的泛化能力.     

一种新的Gabor小波支持向量机人脸识别算法

提出了一种新的基于Gabor小波特征重组的支持向量机人脸识别方法。该方法首先计算5个尺度和8个方向的Gabor小波变换结果,再把不同人脸中的同一尺度和方向的变换结果进行特征重组,得到40个新特征矩阵,分别利用PCA方法降维去噪,最后构造40个支持向量机分类器并采用选票决策机制决定识别结果。实验结果表明,该方法不仅拓宽了主元分析法中累积方差贡献率可选范围,并在一定程度上解决了核参数选择难的问题,同时取得了理想识别效果。     

Preemptive parallel‐machine scheduling with a common server to minimize makespan

We consider parallel‐machine scheduling with a common server and job preemption to minimize the makespan. While the non‐preemptive version of the problem is strongly NP‐hard, the complexity status of the preemptive version has remained open. We show that the preemptive version is NP‐hard even if there is a fixed number of machines. We give a pseudo‐polynomial time algorithm to solve the case with two machines. We show that the case with an arbitrary number of machines is unary NP‐hard, analyze the performance ratios of some natural heuristic algorithms, and present several solvable special cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 388–398, 2017