基于支持向量机的飞机备件需求预测

支持向量机是一种机器学习算法,在国外已广泛应用于工程实践领域。首先探讨了支持向量机回归预测模型的学习和预测机制,分析其中三个重要参数对算法的影响规律,得出一套定性的参数选择方法,然后将支持向量机引入到装备综合保障分析之中,构建了飞机备件智能预测模型,并对某型军用飞机备件需求进行了预测和分析,结果表明:基于支持向量机的备件需求预测是有效的、可行的。     

A note on combined job selection and sequencing problems

We investigate the solvability of two single‐machine scheduling problems when the objective is to identify among all job subsets with cardinality k,1≤k≤n, the one that has the minimum objective function value. For the single‐machine minimum maximum lateness problem, we conclude that the problem is solvable in O(n²) time using the proposed REMOVE algorithm. This algorithm can also be used as an alternative to Moore's algorithm to solve the minimum number of tardy jobs problem by actually solving the hierarchical problem in which the objective is to minimize the maximum lateness subject to the minimum number of tardy jobs. We then show that the REMOVE algorithm cannot be used to solve the general case of the single‐machine total‐weighted completion time problem; we derive sufficient conditions among the job parameters so that the total weighted completion time problem becomes solvable in O(n²) time. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 449–453, 2013     

全气动步兵武器表层自动喷涂机设计

分析目前步兵武器零件表层喷涂技术现状,提出全气动自动喷涂机设计方案,根据步兵武器零件结构特点,规划自动喷涂轨迹,设计全气动自动化喷涂专用设备．该设备具有本质安全性,适于部队条件下使用．     

防空兵分队兵力机动综合保障能力评估

根据兵力机动任务对综合保障的实际需求,构建了综合保障能力的评估指标体系。在此基础上,分别构建了战斗保障能力、后勤保障能力、装备保障能力以及综合保障能力评估模型。明确了防空兵分队兵力机动实施综合保障的主要内容,较好的解决了防空兵分队兵力机动综合保障评估问题。     

基于CPLD与单片机的多路高精度数据采集系统设计

结合CPLD与单片机设计了一种多路高精度数据采集系统,最高可达24位转换精度。所采集数据具备良好的实时性,可采集通道数目多,同时系统具备较强的抗外界干扰能力,结构简单,可靠性好。该系统具有较强的可移植性,能够广泛应用于多路、高精度、低频数据采集的场合。     

基于声矢量传感器原理的目标被动定向算法

声测被动定向是声学监视技术的重要研究内容.为了实现对低空运动目标的声学监视,提出了一种基于声矢量传感器原理的被动定向方法,推导出了基于互谱法声强测量技术的定向算法,并对定向算法进行了分析和数值仿真.仿真表明:当传感器尺寸为0.28m、信号信噪比为5dB时,定向精度在2.5°以内.仿真结果说明,该定向算法是正确可行的,有较大的实用价值.该研究成果可直接用于空中运动目标,如飞机、导弹和无人机等目标的声测被动定向.     

A m‐parallel crane scheduling problem with a non‐crossing constraint

In this paper, we study a m‐parallel machine scheduling problem with a non‐crossing constraint motivated by crane scheduling in ports. We decompose the problem to allow time allocations to be determined once crane assignments are known and construct a backtracking search scheme that manipulates domain reduction and pruning strategies. Simple approximation heuristics are developed, one of which guarantees solutions to be at most two times the optimum. For large‐scale problems, a simulated annealing heuristic that uses random neighborhood generation is provided. Computational experiments are conducted to test the algorithms. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

现代文本分类技术研究

分析了当前的文本分类技术,总结了文本分类需要解决的问题;在详细比较了各种不同的分类算法以及文本模型以后,为进一步开展优化以及提高文本分类技术的研究工作提供了一些参考和建议。     

On equivalence between the proportionate flow shop and single‐machine scheduling problems

We derive sufficient conditions which, when satisfied, guarantee that an optimal solution for a single‐machine scheduling problem is also optimal for the corresponding proportionate flow shop scheduling problem. We then utilize these sufficient conditions to show the solvability in polynomial time of numerous proportionate flow shop scheduling problems with fixed job processing times, position‐dependent job processing times, controllable job processing times, and also problems with job rejection. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 595–603, 2015     

Scheduling research and the first decade of NRLQ: A historical perspective

It is generally recognized that the first model involving job scheduling was presented by Selmer Johnson and published in the inaugural issue of Naval Research Logistics Quarterly (NRLQ) in 1954. NRLQ also published another seminal scheduling paper by Wayne E. Smith a short time later. In the present paper, we discuss the contribution of NRLQ and the role of the Office of Naval Research in the development of the scheduling literature during the first decade (1954–1963). We also provide a critical analysis of the papers by Johnson and Smith. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 335–344, 2015