面向联合作战行动设计的态势差分析机理研究

文章介绍了态势差的概念内涵,分析了在设计联合作战行动时为什么要分析态势差,阐述了如何分析态势差。态势差分析是工程化作战筹划的一个环节,研究态势差分析机理,能为作战行动设计提供有力支撑,提高作战筹划效率。     

旋转整流器断路故障诊断分析

阐述了无刷励磁发电机的旋转整流器在正常工况下的换相原理和换相过程,理论解析了旋转整流器在正常和断路工况下的输入电流波形,定量分析了励磁机励磁电流谐波含量,证明了以励磁电流作为旋转整流器故障诊断依据的可行性。仿真和实验验证表明:定量分析谐波含量提高了旋转整流器的故障检测精确性,为无刷励磁发电机系统的故障诊断研究提供了判断依据。     

含诱导缺陷复合材料T型接头的弯曲失效实验

通过实验研究含不同诱导缺陷的复合材料T型接头的弯曲力学性能和失效过程,采用引入脱黏缺陷和三角区填充率缺陷来诱导T型接头的不同失效模式。结果表明不同失效模式下T型接头所表现出来的弯曲力学性能差异极大,完好的T型接头所能承受的载荷为288.5N,界面脱黏会削弱其30%的承载能力,而三角区填充率的减少会导致裂纹在填充区内部引发和扩展,导致T型接头的弯曲力学性能大幅降低。     

水下制氢反应室动态过程数值分析

为研究水下制氢反应室的动态过程规律,基于化学反应动力学和单液滴运动学得到合金/水反应转化率,并在最小自由能法计算得到生成物各组分摩尔数的基础上利用质量守恒方程得到室内各物质质量变化规律。在建立非线性移动边界螺旋管动态模型的前提下,利用能量守恒方程得到室内热力参数变化规律,进而完成制氢反应室动态过程详尽模型的建立。利用该模型编写计算程序,完成某水下制氢反应室动态过程仿真。结果表明,各仿真曲线较好地反映了对应参数的动态变化规律,验证了模型建立与仿真的正确性;合金/水反应转化率决定了反应室的物质质量变化规律及其能量释放特性。该模型可以作为制氢反应室动态特性分析及其过程控制研究的基础模型。     

基于属性的舰载机航材备件品种确定方法

航材备件品种确定是舰载机供应保障工作的重要内容。基于属性对舰载机航材备件品种确定进行研究。基于粗糙集理论对属性集进行属性约简,确定航材备件品种确定的主要影响属性,然后基于属性约简进行航材备件品种确定。给出了单属性、顺次属性和多属性的品种决策方法。最后结合实例进行了应用分析。     

基于GPS载波相位差的炮弹滚转角测量方法

针对高速旋转炮弹滚转角的测量问题,在分析了相邻天线载波相位与滚转角数学关系的基础上,将载波相位差作为弹体滚转角的量测,最后使用扩展卡尔曼滤波技术估计弹体滚转角和滚转角速率。实验和数字仿真结果表明基于GPS载波相位差的滚转角测量方法在工程应用上是可行的,为高速旋转制导修正炮弹滚转角的实时测量提供了一种技术途径。     

防空通信系统性能评价及抗毁性分析

分析了防空通信系统的组织结构和对抗特点,利用性能评价过程代数描述防空通信系统的状态演化,提出一种防空通信系统抗毁特性分析方法。通过具体案例,对通信系统的组织结构、抗击软硬杀伤的能力进行建模和仿真验证。实验结果表明,该方法适用于防空通信系统的建模与分析,能够实现对防空通信系统的结构进行对抗过程的建模;通信系统的不同要素对抗毁性能的影响不同,可以采取有效策略以提高防空通信系统的抗毁能力。     

浅谈《中国近现代史纲要》课教学中的几个问题

"中国近现代史纲要"这门课目前面临着从教材体系向教学体系转变的关键时期。本文结合作者自身的教学实践,从内容和方法两个维度,提出了三个在教学过程中存在的突出问题。作者希望通过对这三个问题的阐释和解决,达到帮助大学生深入了解国情、国史,深刻领会历史和人民的"四个选择"的目的。     

Choosing arrival process models for service systems: Tests of a nonhomogeneous Poisson process

Service systems such as call centers and hospital emergency rooms typically have strongly time‐varying arrival rates. Thus, a nonhomogeneous Poisson process (NHPP) is a natural model for the arrival process in a queueing model for performance analysis. Nevertheless, it is important to perform statistical tests with service system data to confirm that an NHPP is actually appropriate, as emphasized by Brown et al. [8]. They suggested a specific statistical test based on the Kolmogorov–Smirnov (KS) statistic after exploiting the conditional‐uniform (CU) property to transform the NHPP into a sequence of i.i.d. random variables uniformly distributed on [0,1] and then performing a logarithmic transformation of the data. We investigate why it is important to perform the final data transformation and consider what form it should take. We conduct extensive simulation experiments to study the power of these alternative statistical tests. We conclude that the general approach of Brown et al. [8] is excellent, but that an alternative data transformation proposed by Lewis [22], drawing upon Durbin [10], produces a test of an NHPP test with consistently greater power. We also conclude that the KS test after the CU transformation, without any additional data transformation, tends to be best to test against alternative hypotheses that primarily differ from an NHPP only through stochastic and time dependence. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 66–90, 2014     

Flow shop scheduling with earliness,tardiness, and intermediate inventory holding costs

We consider the problem of scheduling customer orders in a flow shop with the objective of minimizing the sum of tardiness, earliness (finished goods inventory holding), and intermediate (work‐in‐process) inventory holding costs. We formulate this problem as an integer program, and based on approximate solutions to two different, but closely related, Dantzig‐Wolfe reformulations, we develop heuristics to minimize the total cost. We exploit the duality between Dantzig‐Wolfe reformulation and Lagrangian relaxation to enhance our heuristics. This combined approach enables us to develop two different lower bounds on the optimal integer solution, together with intuitive approaches for obtaining near‐optimal feasible integer solutions. To the best of our knowledge, this is the first paper that applies column generation to a scheduling problem with different types of strongly ????‐hard pricing problems which are solved heuristically. The computational study demonstrates that our algorithms have a significant speed advantage over alternate methods, yield good lower bounds, and generate near‐optimal feasible integer solutions for problem instances with many machines and a realistically large number of jobs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.