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

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

一种对间歇采样转发干扰的识别新方法

间歇采样转发干扰是一种针对相干雷达的有效干扰样式,该类干扰的抑制技术研究需求迫切,而干扰识别历来是抗干扰流程中的关键环节,针对间歇采样转发干扰的识别问题,提出了一种基于关联维数的干扰识别方法。通过对3类间歇采样转发干扰信号进行傅里叶变换,挖掘信号频谱上的差异,提取频域关联维数作为干扰识别的特征参数,并利用支持向量机进行分类识别,为后续雷达系统采取针对性抗干扰措施提供重要的决策信息。仿真结果证明该方法具有较高的识别率。     

基于时序特征编码的目标战术意图识别算法?

对战场目标战术意图的快速、准确和自动识别,是智能决策的前提和基础。目标战术意图通常由多个战术动作组合完成,因而目标状态呈现动态、时序变化特征。本文针对目标意图识别问题的特点,提出一种基于栈式自编码器（ SAE）的智能识别模型,设计智能识别模型的基本框架,提出一种基于时序特征的输入信号编码方法及相应的模式解析机制,通过将目标状态在多个时刻的时序特征和战场环境、目标属性等信息统一编码为输入信号,将军事专家的知识经验封装为模式标签,模拟人的推理模式与认知经验,实现对目标战术意图的智能识别。最后通过实验,分析预训练过程和网络深度对算法性能的影响,并通过与多层感知机（MLP）和逻辑回归分类器（LRC）识别准确率的比较,验证所提SAE算法的有效性。     

Expansion planning for waste‐to‐energy systems using waste forecast prediction sets

We consider an expansion planning problem for Waste‐to‐Energy (WtE) systems facing uncertainty in future waste supplies. The WtE expansion plans are regarded as strategic, long term decisions, while the waste distribution and treatment are medium to short term operational decisions which can adapt to the actual waste collected. We propose a prediction set uncertainty model which integrates a set of waste generation forecasts and is constructed based on user‐specified levels of forecasting errors. Next, we use the prediction sets for WtE expansion scenario analysis. More specifically, for a given WtE expansion plan, the guaranteed net present value (NPV) is evaluated by computing an extreme value forecast trajectory of future waste generation from the prediction set that minimizes the maximum NPV of the WtE project. This problem is essentially a multiple stage min‐max dynamic optimization problem. By exploiting the structure of the WtE problem, we show this is equivalent to a simpler min‐max optimization problem, which can be further transformed into a single mixed‐integer linear program. Furthermore, we extend the model to optimize the guaranteed NPV by searching over the set of all feasible expansion scenarios, and show that this can be solved by an exact cutting plane approach. We also propose a heuristic based on a constant proportion distribution rule for the WtE expansion optimization model, which reduces the problem into a moderate size mixed‐integer program. Finally, our computational studies demonstrate that our proposed expansion model solutions are very stable and competitive in performance compared to scenario tree approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 47–70, 2016     

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     

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     

Two‐agent scheduling on a single sequential and compatible batching machine

We study two‐agent scheduling on a single sequential and compatible batching machine in which jobs in each batch are processed sequentially and compatibility means that jobs of distinct agents can be processed in a common batch. A fixed setup time is required before each batch is started. Each agent seeks to optimize some scheduling criterion that depends on the completion times of its own jobs only. We consider several scheduling problems arising from different combinations of some regular scheduling criteria, including the maximum cost (embracing lateness and makespan as its special cases), the total completion time, and the (weighted) number of tardy jobs. Our goal is to find an optimal schedule that minimizes the objective value of one agent, subject to an upper bound on the objective value of the other agent. For each problem under consideration, we provide either a polynomial‐time or a pseudo‐polynomial‐time algorithm to solve it. We also devise a fully polynomial‐time approximation scheme when both agents’ scheduling criteria are the weighted number of tardy jobs.     

一种改进的粒子群优化算法

针对基本粒子群算法存在着收敛速度慢、效率低、易陷入局部最优等缺陷,为了更好地平衡全局和局部搜索能力,在粒子群算法中引入收缩因子,使算法中粒子不仅向种群最优的粒子进行学习,而且向种群中比自己优秀的所有粒子学习,增加了粒子的多样性。实验结果证明,与基本蚁群算法相比,改进的粒子群算法提高了收敛速度和效率,能一定程度地避免局部最优解的产生。     

基于支持向量机的多元文本分类研究

根据文本分类的特点,在对最小二乘支持向量机方法进行详细分析的基础上,创建了基于最小二乘支持向量机的多元文本分类器.实验表明,采用该文本分类器能够在保持较高分类精度和召回率的基础上,提高训练效率,具有一定的可行性.     

平面磨削精度控制的一种方法

分析了利用砂轮周边进行平面磨削加工产生形状误差的原因之一。即待加工表面的形状变化引起磨削力的变化,从而引起工艺系统的弹性变形的变化,这种变形最终导致工件产生形状误差。提出了解决这一问题的技术途径和方法,即将待加工表面分解成若干小块,对每一小块根据其形状进行分析,找出其磨削力的变化规律,然后用程序控制工件速度,从而保持磨削力近似不变,并总结了应用该方法的步骤。举例说明了应用该方法所取得的结果是:磨削平面的精度提高到原来的5倍,加工时间缩短到约为原来的一半。