电磁发射用脉冲功率电源放电建模分析

为高效研究电磁发射用脉冲功率电源放电性能,为电磁发射提供技术支持,降低研发成本,电磁发射过程的相关建模与仿真工作需要重点研究。对弹丸在轨道中实际运动物理过程建立数学模型,对脉冲功率电源建立电路模型,采用联合两种模型的方法对脉冲功率电源放电系统进行研究,提出一种基于发射过程多物理现象的脉冲功率电源放电系统仿真模型。通过实验验证了提出方法的有效性,为后续脉冲功率电源放电研究提供了依据。     

Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work

We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016     

Level workforce planning for multistage transfer lines

In this article, we define two different workforce leveling objectives for serial transfer lines. Each job is to be processed on each transfer station for c time periods (e.g., hours). We assume that the number of workers needed to complete each operation of a job in precisely c periods is given. Jobs transfer forward synchronously after every production cycle (i.e., c periods). We study two leveling objectives: maximin workforce size () and min range (R). Leveling objectives produce schedules where the cumulative number of workers needed in all stations of a transfer line does not experience dramatic changes from one production cycle to the next. For and a two‐station system, we develop a fast polynomial algorithm. The range problem is known to be NP‐complete. For the two‐station system, we develop a very fast optimal algorithm that uses a tight lower bound and an efficient procedure for finding complementary Hamiltonian cycles in bipartite graphs. Via a computational experiment, we demonstrate that range schedules are superior because not only do they limit the workforce fluctuations from one production cycle to the next, but they also do so with a minor increase in the total workforce size. We extend our results to the m‐station system and develop heuristic algorithms. We find that these heuristics work poorly for min range (R), which indicates that special structural properties of the m‐station problem need to be identified before we can develop efficient algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 577–590, 2016     

界面改性对SiCp/Cu复合材料导热性能的影响

采用磁控溅射法结合结晶化热处理工艺在SiC颗粒表面成功制备了金属Mo涂层,分析Mo涂层的成分和形貌;采用热压烧结工艺制备SiCp/Cu复合材料,重点对比分析Mo界面阻挡层厚度对复合材料导热性能的影响。结果表明:磁控溅射法能够在SiC颗粒表面沉积得到Mo涂层,随溅射时间的延长,Mo涂层的厚度增加、粗糙度增大,且磁控溅射后SiC颗粒表面直接得到的Mo涂层为非晶态,结晶化热处理后,变为致密平整的晶态Mo涂层。磁控溅射时间对Mo涂层厚度和复合材料导热性能影响明显。随磁控溅射时间的增加,复合材料的热导率呈先增后减趋势。采用磁控溅射9h镀Mo改性并经过800℃结晶化热处理的SiC复合粉体在850℃下热压烧结制备的SiCp/Cu复合材料(VSiC=50%),其热导率达到了最高值274.056W/(m·K)。     

阵列雷达波束内双目标的极大似然角度估计方法

单波束内目标往往相距较近,采用传统角度分辨技术难以将其分辨,从而给目标跟踪和识别带来较大困难。于是提出基于LM算法的极大似然角度估计方法,实现波束内双目标的分辨。该方法在阵列雷达的基础上建立双目标回波模型,推导极大似然角度估计算法。考虑到求解算法直接影响极大似然角度估计的收敛速度和估计精度,利用LM算法实现了极大似然估计的求解,从而得到目标角度的精确估计。该方法避免了多次脉冲相干积累,具有计算量小的特点。仿真结果验证了方法的有效性。     

3mm波段混凝土屏蔽材料的研究

在混凝土中添加标准砂,钢纤维,铁晶矿砂,炭纤维毡,氧化锌晶须,铁氧体,乙炔碳黑,羰基铁粉等材料,制成了具有微波吸收性能的混凝土屏蔽材料,以期能探索一条大型建筑及军事掩体的电磁防护的新途径。在3mm波段范围内对混凝土屏蔽材料进行了初步的实验研究,研究了不同材料、不同掺量下电磁波的吸收衰减特性,并分析了它们之间的关系,为进一步的研究指明了方向。     

INS 故障模型和推理方法的研究与设计

讨论了某型惯导 ( INS)设备的结构、工作流程和故障特点 ,分析了基于知识的专家系统 ( ES)常用的诊断模型和推理方法 ,在此基础上 ,设计了具体的基于对象的惯导综合层次模型及其推理机 .该模型和推理机已实际应用于该型 INS的故障诊断专家系统的设计     

加强计算机基础教育问题的探索

指出了高等军事院校非计算机专业人才加强计算机基础教育的重要意义,结合我院的现状,提出了加强计算机基础教育的措施和模式.     

双向时空连续性轨迹片段关联的目标跟踪方法

提出一种使用双向时空连续性关联轨迹片段的目标跟踪方法.首先对检测结果进行简单的帧间匹配关联,生成可靠的轨迹片段;然后对每个轨迹片段通过卡尔曼滤波以及有权重的均值法分别计算修正轨迹片段的速度、位置与颜色特征;最后通过计算轨迹片段之间的双向时空连续性迭代关联,找到最符合时空连续性的轨迹片段关联.实验证明本文方法可以有效解决...     

用弹性动力学基本分析方法求解导弹 折叠翼展开的动响应

用机构弹性动力学的基本方法分析了一种导弹折叠翼展开的动力学问题,详细介绍了运动微分方程的解法,并将计算结果曲线与刚体动力学计算曲线、试验测得的曲线进行比较和分析,证明了该算法的可靠性和可行性。