一种GMM-SVM混合说话人辨认模型

文中提出了一种GMM和SVM混合说话人识别模型,在特征参数域和概率得分域对两种模型进行了融合。混合模型结合了GMM和SVM各自的优势,使SVM的概率输出兼顾各说话人模型内部和模型之间的信息,并有效解决了SVM训练算法复杂,难以处理大量样本的问题。采用TIMIT数据库进行了说话人辨认实验,结果证明本文提出的GMM-SVM模型比传统的GMM模型和SVM模型具有更好的辨识性能。     

火炮身管内膛疵病检测现状与展望

简要回顾了火炮身管内膛疵病的光学检测方法及其局限性,详细介绍了目前重点研究的光电窥膛检测方法,分析了取得的成果和存在的问题。对火炮身管内膛疵病检测的发展方向进行了预测与展望,指出基于机器视觉的研究是一个新的方向。探讨了今后的研究思路,提出首要的任务是在软件方面实现“采集一识别一判定”的自动运行,为此需要重点研究疵病检测的机器视觉图像信息、图像的纹理特征分析技术、疵病评定体系等3方面的内容。     

用于多类分类的层次式支持向量机

针对支持向量机存在的训练数据量大导致的训练时间过长和训练数据不平衡导致的分类结果会向训练数据多的类倾斜等问题,提出了适合于多类分类的层次式支持向量机。在训练过程中,首先折衷考虑各类之间的距离和各类的训练数据长度,据此将训练样本分为距离较远且其长度基本平衡的2类,然后逐层进行训练,最终形成二叉树分类结构。仿真实验证明,该方法能够有效地缩短训练和分类时间,且对多类分类中的数据不平衡问题有一定的效果。     

支持向量机在柴油机技术状况评估中的应用

介绍了现有的柴油机技术状况评估方法,分析了这些方法的局限性和支持向量机在处理小样本、非线性、高维数等方面的优势。提出了基于支持向量机的柴油机技术状况评估模型。确定了能够表征柴油机技术状况变化的特征,并通过实车试验提取这些特征;构建了基于支持向量机的柴油机技术状况评估模型,并对部分试验车辆柴油机进行了评估。结果证明：支持向量机在装甲车辆柴油机技术状况评估中的应用是可行的。     

基于支持向量机的威胁判断模型

目标威胁判断是防空作战中一项重要内容,在建立目标威胁模型时,首先要挑选特征参数,分析了影响威胁度的若干因素.这里采用Rough理论中知识约简方法选择目标的特征参数;支持向量机是一类新型机器学习方法,由于其出色的学习能力,该技术已成为当前国际机器学习界的研究热点,利用支持向量机建立了威胁判断模型,给出了实例和解决此问题的支持向量机源程序.通过实例与神经网络法的结果进行了比较,结果表明支持向量机比较精确和简单.     

Linear compound algorithms for the partitioning problem

For a given set S of nonnegative integers the partitioning problem asks for a partition of S into two disjoint subsets S₁ and S₂ such that the sum of elements in S₁ is equal to the sum of elements in S₂. If additionally two elements (the kernels) r₁, r₂ ∈ S are given which must not be assigned to the same set S_i, we get the partitioning problem with kernels. For these NP‐complete problems the authors present two compound algorithms which consist both of three linear greedylike algorithms running independently. It is shown that the worst‐case performance of the heuristic for the ordinary partitioning problem is 12/11, while the second procedure for partitioning with kernels has a bound of 8/7. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 593–601, 2000     

同步电机超瞬态电抗的线对线短路试验测量

研究了计及定子绕组电阻时三相同步电机超瞬态电抗的测定,导出了有关计算公式,并在实机上进行了试验.     

A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times

We investigate a single‐machine scheduling problem for which both the job processing times and due windows are decision variables to be determined by the decision maker. The job processing times are controllable as a linear or convex function of the amount of a common continuously divisible resource allocated to the jobs, where the resource allocated to the jobs can be used in discrete or continuous quantities. We use the common flow allowances due window assignment method to assign due windows to the jobs. We consider two performance criteria: (i) the total weighted number of early and tardy jobs plus the weighted due window assignment cost, and (ii) the resource consumption cost. For each resource consumption function, the objective is to minimize the first criterion, while keeping the value of the second criterion no greater than a given limit. We analyze the computational complexity, devise pseudo‐polynomial dynamic programming solution algorithms, and provide fully polynomial‐time approximation schemes and an enhanced volume algorithm to find high‐quality solutions quickly for the considered problems. We conduct extensive numerical studies to assess the performance of the algorithms. The computational results show that the proposed algorithms are very efficient in finding optimal or near‐optimal solutions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 41–63, 2017     

Determining optimal sizes of bounded batches with rejection via quadratic min‐cost flow

In this article, we consider a single machine scheduling problem, in which identical jobs are split into batches of bounded sizes. For each batch, it is allowed to produce less jobs than a given upper bound, that is, some jobs in a batch can be rejected, in which case a penalty is paid for each rejected job. The objective function is the sum of several components, including the sum of the completion times, total delivery cost, and total rejection cost. We reduce this problem to a min‐cost flow problem with a convex quadratic function and adapt Tamir's algorithm for its solution. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 217–224, 2017     

军事云环境下基于动态博弈的资源调度方法

针对军事云环境下联合指挥资源调度优化问题,综合考虑了多部队任务需求,多目标优化,多部队资源竞争等约束条件,运用动态博弈理论及方法,建立并提出了一种基于完全信息扩展博弈的资源调度模型及方法,提高了资源调度效率,兼顾了多部队利益,增加了联合作战效益。最后通过实验验证了其有效性及准确性。