高速微粒轰击45钢表面纳米化过程中铁素体相晶粒细化过程分析

利用高速微粒轰击技术在45钢表面制备了纳米晶,利用透射电镜（TEM）和X射线衍射（XRD）等分析技术对距表面不同深度的微观结构进行分析,研究铁素体相晶粒细化过程。结果显示：随着距表面距离的减小结构尺寸逐渐减小,在最表面形成了纳米晶层,平均晶粒尺寸约为15 nm。通过不同尺寸位错胞的逐步形成,以及位错墙不断向晶界演化,晶粒被细化为细小的纳米晶。     

基于虚拟样机技术的某小口径火炮射击仿真分析

针对某小口径火炮在射击过程中零部件运动特性难以通过实弹射击试验获取的难题,联合三维建模软件和动力学仿真软件,建立了该炮的动力学模型。通过仿真数据与实弹射击试验数据的对比,验证了模型的有效性。在此基础上,研究了该炮在射击循环中各部件的运动规律和承受的发射应力载荷,研究结果可为该炮关键零部件的疲劳寿命分析和火炮射击精度研究提供参考。     

基于Petri网的装备维修过程建模与AnyLogic仿真

针对装备维修重修复质量、轻过程质量,导致效率不高、浪费较重、缺乏过程管控等问题,建立了装备维修过程库所/变迁网模型和着色时间Petri网模型,给出了装备维修过程动态性、随机性、时间性描述,提出了不同修理技能人员工序完成时间的计算方法,运用AnyLogic软件进行了装备维修过程仿真,得出了不同人员组合所对应的不同维修时间和工序返工情况,为维修过程优化与验证提供了一种思路。     

工程陶瓷表面粗糙度与图像纹理特征关系

为描述陶瓷磨削表面纹理特征与粗糙度的相互关系,实现快速评定和预测陶瓷磨削加工表面粗糙度,运用灰度共生矩阵对表面纹理特征进行提取和分析。根据采样点间距、灰度级随特征值的变化曲线确定灰度共生矩阵影响因素,按4个方向建立灰度共生矩阵并计算所有纹理特征参数均值。通过分析特征参数间相关性,确定4个参数为陶瓷磨削表面纹理主要特征参数。该参数与表面粗糙度的变化规律,可以反映陶瓷磨削表面粗糙度,进而评估磨削加工质量与可靠性。     

5GHz雷达的干扰计算模型概述

文章从开发5 GHz模型的目的入手,简要介绍了5 GHz模型的结构组成,详细讨论了5 GHz模型的干扰计算流程,包括无线局域网和雷达的场景设置、技术参数设置、总干扰计算等,最后给出了5 GHz模型的一个运行范例,以期为其它干扰模型的开发提供借鉴参考。     

美军太空信息支援战区作战研究

为了保证太空信息能自顶向下融入到战区联合作战行动,实现太空信息支援力量与其他作战部队的跨域协同,美军建立了体系健全、功能完备的太空信息支援系统。本文梳理归纳了美军太空信息支援力量体系,针对太空信息支援战区作战的指挥与运用流程,分析了“统分结合、视情授权”的太空信息支援战区作战指挥体系,研究了“需求提出－汇总分析－分类提供”的支援作战流程,对天基侦察监视、卫星通信中继、卫星导航定位的需求管理、任务规划与资源调度的具体运用流程进行了分析,总结了美军太空信息支援战区作战指挥控制的特点。希冀本研究可为太空信息支援作战的指挥体系构建和指挥控制流程设计提供一定参考。     

发动机动态特性及其对车辆换档特性的影响

分析了影响发动机动态特性的因素,并通过试验得出了动态特性与稳态特性的关系。根据试验结果,分析了动态特性对车辆换档特性的影响,得出按发动机动态特性设计换档规律,有利于车辆换档特性的改善。     

大口径机枪结构动力学建模方法研究

总结了我国近年来关于大口径机枪结构动力学建模方法研究的主要成果,分析了目前建模方法上存在的某些问题以及对武器装备研制的影响,进一步介绍了边界条件的确定、模型正确性判别和载荷识别等方面的新技术。     

Algorithms for solving the conditional covering problem on paths

Consider the conditional covering problem on an undirected graph, where each node represents a site that must be covered by a facility, and facilities may only be established at these nodes. Each facility can cover all sites that lie within some common covering radius, except the site at which it is located. Although this problem is difficult to solve on general graphs, there exist special structures on which the problem is easily solvable. In this paper, we consider the special case in which the graph is a simple path. For the case in which facility location costs do not vary based on the site, we derive characteristics of the problem that lead to a linear‐time shortest path algorithm for solving the problem. When the facility location costs vary according to the site, we provide a more complex, but still polynomial‐time, dynamic programming algorithm to find the optimal solution. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Outsourcing warranty repairs: Dynamic allocation

In this paper we consider the problem of minimizing the costs of outsourcing warranty repairs when failed items are dynamically routed to one of several service vendors. In our model, the manufacturer incurs a repair cost each time an item needs repair and also incurs a goodwill cost while an item is awaiting and undergoing repair. For a large manufacturer with annual warranty costs in the tens of millions of dollars, even a small relative cost reduction from the use of dynamic (rather than static) allocation may be practically significant. However, due to the size of the state space, the resulting dynamic programming problem is not exactly solvable in practice. Furthermore, standard routing heuristics, such as join‐the‐shortest‐queue, are simply not good enough to identify potential cost savings of any significance. We use two different approaches to develop effective, simply structured index policies for the dynamic allocation problem. The first uses dynamic programming policy improvement while the second deploys Whittle's proposal for restless bandits. The closed form indices concerned are new and the policies sufficiently close to optimal to provide cost savings over static allocation. All results of this paper are demonstrated using a simulation study. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005