基于扩展Petri网的防空C~4ISRK系统建模分析

针对地空导弹武器系统防空中的火力分配问题,建立了战术级防空C4ISRK系统的Petri网模型。对其进行扩展,即联合谓词Petri网和赋色Petri网,建立旅级火力分配的改进模型,给出了具体的前置谓词公式。为有效分析战术决策的正确性提供了依据和思路。     

大流量气体减压器振动问题研究

对大流量气体减压器工作过程中的振动故障进行分析,建立了减压器系统动态数学模型,进行了故障数值仿真,找到了简单有效的提高减压器输出响应稳定性的方法--减小控制腔入口面积,并得到试验验证.仿真结果还表明,大流量气体减压器的振动问题不仅和减压器本身设计参数有关,还和下游管路容积有关.     

Value management of diagnostic equipment with cancelation,no‐show,and emergency patients

Magnetic resonance imaging and other multifunctional diagnostic facilities, which are considered as scarce resources of hospitals, typically provide services to patients with different medical needs. This article examines the admission policies during the appointment management of such facilities. We consider two categories of patients: regular patients who are scheduled in advance through an appointment system and emergency patients with randomly generated demands during the workday that must be served as soon as possible. According to the actual medical needs of patients, regular patients are segmented into multiple classes with different cancelation rates, no‐show probabilities, unit value contributions, and average service times. Management makes admission decisions on whether or not to accept a service request from a regular patient during the booking horizon to improve the overall value that could be generated during the workday. The decisions should be made by considering the cancelation and no‐show behavior of booked patients as well as the emergency patients that would have to be served because any overtime service would lead to higher costs. We studied the optimal admission decision using a continuous‐time discrete‐state dynamic programming model. Identifying an optimal policy for this discrete model is analytically intractable and numerically inefficient because the state is multidimensional and infinite. We propose to study a deterministic counterpart of the problem (i.e., the fluid control problem) and to develop a time‐based fluid policy that is shown to be asymptotically optimal for large‐scale problems. Furthermore, we propose to adopt a mixed fluid policy that is developed based on the information obtained from the fluid control problem. Numerical experiments demonstrate that this improved policy works effectively for small‐scale problems. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 287–304, 2016     

应用Isight的复合材料桁架结构优化设计

轻质复合材料及其结构以其优异的力学性能在航天航空飞行器上得到了广泛应用。考察玻璃纤维/环氧复合材料方形截面桁架在典型弯曲载荷工况条件下的非线性结构承载性能。采用Isight集成平台对桁架结构进行多参数优化设计,获得满足结构刚度和承载性能要求的最轻质桁架结构的几何参数,并分析最优化结构在载荷作用下的结构非线性响应行为。结果表明采用Isight平台对桁架结构进行多参数优化设计具有较高的效率和可信度。     

基于LabVIEW的地下震源定位系统设计

针对小区域浅层地下震源定位中,由于震动信号受传输介质复杂、传感器不稳定等因素影响,出现初至波提取困难、震源定位低精度等问题,设计了基于LabVIEW的地下震源定位系统,实现三轴信号合成、基于小波变换的阈值去噪、基于改进的长短时窗(STA/LTA)的初至提取、基于时差技术(TDOA)的联合定位算法等功能模块。结果表明,该软件在10 m×10 m×3 m的区域内,初至特征提取精确到10-4s,定位精度精确到0.1 m,可以广泛应用于爆破定位、信息侦查等领域。     

武器装备体系能力矩阵评估方法

针对武器装备体系能力难以客观、定量评估的问题,引入复杂网络理论,提出了基于矩阵运算的武器装备体系能力评估方法。分析了武器装备体系能力的概念,建立了武器装备体系的复杂层次网络模型,描述了装备网络的组成、运行过程,定义了装备网络的矩阵描述方法和矩阵运算规则,提出了装备网络作战能力描述参数,给出了装备网络能力的矩阵计算方法,进行了影响因素分析,最后通过实例验证了方法可行性、有效性和灵活性。     

剪切来流条件下的涡生振荡机理

将指数极坐标系建立在运动的圆柱上,推导了运动坐标中剪切来流条件下,涡生振荡的涡量-流函数守恒方程、其初始和边界条件、圆柱表面的水动力表达式、圆柱振荡方程。对圆柱从静止开始振荡到发展为稳定振荡状态进行了计算和讨论,描述了脱体涡街的发展过程、升阻力相图的连续变形和漂移、圆柱振荡和平衡位置的变化过程。研究了涡生振荡终态随剪切度K的变化。结果表明:剪切来流给流场加入了背景涡,使圆柱的上涡增强、下涡减弱,流场的对称性被破坏。随着剪切度K的增大,涡街的倾斜程度增大,压力曲线的漂移量增大,由此导致升力的绝对值增大,圆柱的振幅增大且平衡位置向圆柱下侧的漂移也增大。     

基于复杂网络理论的岸防作战体系骨干网络研究

随着信息技术在战争中的大量应用,现代战争越来越呈现出网络化和体系对抗性,研究其拓扑特性已十分必要。基于复杂网络理论,首先建立了岸防作战体系网络模型,然后提出一种基于贪心思想的骨干网挖掘算法,最后对模型的骨干网络进行了研究。结果表明该方法能够快速、准确地挖掘出岸防作战体系的网络骨干,并能为军事对抗体系的复杂网络应用研究提供借鉴和参考。     

军用无人机目标特性综述

军用无人机作为一类典型的空中目标,分析其目标特性有着重要的军事意义和技术价值。为系统介绍军用无人机的目标特性,从应用和设计的角度分析探讨了其作战使用、结构、飞行和电磁辐射等特性的基本特点,可为工程设计与使用人员提供参考。     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008