基于巡逻历史与道路优先级的武警巡逻策略

针对武警巡逻车辆配置问题,引入了Dijkstra最短路径算法、K—means聚类算法以及计算几何的相关理论,建立了一套警车巡逻模型,并提出了评价巡逻效果的量化评价标准。采用Dijkstra与K—means算法解决了静态警车配置问题;针对警车动态巡逻方案的设计,提出了基于巡逻历史与道路优先级的道路概率选择算法,并给出了不同情况下的警车配置以及巡逻方案。通过MATLAB仿真实验,证明了算法及模型的先进性和实用性。     

基于变结构方法的空空导弹鲁棒逆控制律设计

为克服动态逆控制严重依赖被控对象精确数学模型且鲁棒性较差的缺点,将动态逆与变结构方法相结合采用双环结构设计了空空导弹鲁棒动态逆控制律.将导弹飞行状态划分成快慢2个回路,慢回路(外环)采用变结构控制,并设计扩张状态观测器,对外环中的不确定性进行估计;快回路(内环)采用动态逆控制.仿真结果表明,所设计的控制律具有较好的动态特性和鲁棒性能.     

测试投稿，大家不要管哈~

采用非定常双时间步长方法、刚性旋转动网格技术,结合空间隐式格式数值分析了高超声速钝锥体定常与非定常流场特征,并运用最小二乘法辨识出钝锥体的俯仰阻尼导数。通过与相应的实验数据、工程估算值进行比较,分析并验证了壁面网格雷诺数、钝头比、攻角与质心位置对钝锥体俯仰阻尼导数的影响。同时采用五种差分格式,其中包含五阶精度WENO与高精度WNND格式,对钝锥体俯仰阻尼导数进行了计算,结果表明不同无粘差分格式对俯仰静导数影响较小,但不同格式之间俯仰动导数结果存在差异,分析认为差分格式之间不同的粘性分辨率应是差异的主要来源。     

On the Road to the 2015 NPT Review Conference

The second session of the Preparatory Committee for the 2015 Review Conference (RevCon) of the Treaty on the Non-Proliferation of Nuclear Weapons (NPT) highlighted two issues in particular—progress toward a Middle East Weapons of Mass Destruction–Free Zone and the Joint Statement on the humanitarian impact of nuclear weapons—that may not only greatly affect the health and vitality of the NPT and the 2015 RevCon, but possibly also have implications for the international nonproliferation regime as a whole. Dr. William Potter, director of the James Martin Center for Nonproliferation Studies, interviewed Ambassador Cornel Feruta, chairman of the 2013 PrepCom, to discuss these and other issues related to the meeting and the future of the treaty and its review process.     

Long-rod penetration: the transition zone between rigid and hydrodynamic penetration modes

Long-rod penetration in a wide range of velocity means that the initial impact velocity varies in a range from tens of meters per second to several kilometers per second. The long rods maintain rigid state when the impact velocity is low, the nose of rod deforms and even is blunted when the velocity gets higher, and the nose erodes and fails to lead to the consumption of long projectile when the velocity is very high due to instantaneous high pressure. That is, from low velocity to high velocity, the projectile undergoes rigid rods, deforming non-erosive rods, and erosive rods. Because of the complicated changes of the projectile, no well-established theoretical model and numerical simulation have been used to study the transition zone. Based on the analysis of penetration behavior in the transition zone, a phenomenological model to describe target resistance and a formula to calculate penetration depth in transition zone are proposed, and a method to obtain the boundary velocity of transition zone is determined. A combined theoretical analysis model for three response regions is built by analyzing the characteristics in these regions. The penetration depth predicted by this combined model is in good agreement with experimental result.     

新型舰炮武器系统的自动检测系统

阐述了某新型舰炮武器系统应用仿真技术、控制技术、网络技术和信息处理技术实现自动检测,以及自动检测系统的组成和工作原理。用内模拟仿真驱动技术,实现了舰炮武器系统全自动工作方式下的点迹提取、航迹建立、目标识别、威胁判断、目标指示、捕获跟踪、求解射击诸元,全系统动态联动精度在线评估,以及在线实时故障检测。为海军新装备的操作、使用和维护提供了有效的技术手段。将提高系统可维性和生命力。     

基于DIFHA算子的动态直觉模糊多属性群决策方法

动态决策问题是现实中的一类常见问题。在提出动态直觉模糊混合平均(D IFHA)算子的基础之上,提供一种动态直觉模糊多属性群决策方法。该方法能同时考虑决策过程的阶段性和属性值位置对决策结果的影响,并较好地处理决策过程中的定性指标。分析和算例证实该方法的可行性和实用性。     

射频识别系统的多目标识别-反碰撞算法

对多目标识别技术的二进制搜索算法、时隙ALOHA算法进行了剖析,并对ALOHA算法用概率论和数理统计的方法进行了深入的理论分析,得出要根据所设计的射频识别系统的特点合理采用各种算法方可得到良好的效果.该算法的实现对提高高速公路上自动收费系统、人员和物流管理等各领域的工作效率具有一定的指导意义.     

地空导弹部队集火射击模型

集火射击是地空导弹部队战术单位组织火力运用的一种重要方法,但是目前其组织实施主要依靠手工操作,比较复杂、耗时.对集火射击组织实施过程进行了深入分析,针对集火目标与火力单元的确定、集火射击诸元计算问题,建立了相关数学模型,实现了集火射击的自动化处理.通过在具体实例中的应用表明,该模型可信度高、实用性强,并且易于实现.     

On efficient algorithms for finding efficient salvo policies

We consider the salvo policy problem, in which there are k moments, called salvos, at which we can fire multiple missiles simultaneously at an incoming object. Each salvo is characterized by a probability p_i: the hit probability of a single missile. After each salvo, we can assess whether the incoming object is still active. If it is, we fire the missiles assigned to the next salvo. In the salvo policy problem, the goal is to assign at most n missiles to salvos in order to minimize the expected number of missiles used. We consider three problem versions. In Gould's version, we have to assign all n missiles to salvos. In the Big Bomb version, a cost of B is incurred when all salvo's are unsuccessful. Finally, we consider the Quota version in which the kill probability should exceed some quota Q. We discuss the computational complexity and the approximability of these problem versions. In particular, we show that Gould's version and the Big Bomb version admit pseudopolynomial time exact algorithms and fully polynomial time approximation schemes. We also present an iterative approximation algorithm for the Quota version, and show that a related problem is NP-complete.