导弹攻防对抗作战效能仿真分析方法论

本文介绍了在基于攻防对抗仿真的导弹作战效能分析时应该面对的四个主要环节，提出了采用攻防对抗仿真进行导弹作战效能分析的一般过程。该方法适用于各类导弹等武器系统攻防对抗仿真作战效能研究。     

Killing with Culture: Anthropology’s Ethical Dilemma with War

ABSTRACT

This article highlights the difficulty of creating a code of ethics in anthropology, particularly one that appropriately addresses the nuanced nature of the military and the anthropologists who conduct research and disseminate information in the context of war. The article consults one of the most important books on this topic, George R. Lucas' Anthropologists in Arms (2009), along with several other relevant texts, and examines the ethical complexities and dilemmas American and European anthropologists faced during their involvement in both World Wars, as well as those faced during Vietnam and the more recent wars in Iraq and Afghanistan. The article also examines the military's recruitment of cultural experts, the methods used to culturally engage combatants, and the criticisms against social scientists who choose to work as so-called military anthropologists. The anthropologists in this article risked academic exile conducting what some consider an adulteration of academic principles. The article contributes to the discourse regarding unconventional warfare and the methods used by the armed forces to better understand the cultural nuances of people, and to highlight the need for the development of a better anthropological code of ethics that accounts for the challenges of war.     

智能搜救机器人在障碍地形的自主构型规划

为了解决带有辅助摆臂的智能搜救机器人自动规划构型以实现自主越障的难题,提出一种能够适应复杂地面形状的搜救机器人越障构型规划新方法,其核心是一种高适应性、高效率的机器人姿态预测算法。通过将地形表示为离散的点集,建立了搜救机器人的单侧姿态预测数学模型;进一步提出了快速求解该问题的算法,每秒可预测1 000～1 500个姿态。基于此,设计了机器人越障过程中状态、动作的评价指标,运用动态规划算法与滚动优化思想构建了具有优化能力的、能够实时运行的构型规划器。仿真与实物实验的结果表明,该方法能够使机器人自主调整构型穿越复杂地形,且相较强化学习算法和人工操作具有更平稳的越障效果。     

智能反射面辅助的无线网络加权和速率优化设计

针对智能反射面(intelligent reflecting surface, IRS)辅助的无线网络传输设计的目标是通过联合设计基站处的发送波束形成向量和IRS的反射系数,在满足基站发射功率和IRS单位模约束的条件下,使多个地面用户的加权和速率最大化。为了求解非凸的目标函数,提出一种交替优化方法,其中采用黎曼流形梯度(Riemannian manifold gradient, RMG)方法来优化反射系数,使用二分搜索法优化发送波束形成向量。此外,为了降低RMG方法的复杂度,设计了一种智能元素块坐标下降方法。仿真结果验证了所提算法的有效性,并且表明通过优化设计反射系数,IRS可显著提高无线网络的频谱效率。     

旋成体射弹倾斜入水运动仿真

为了研究运动参数和弹头外形对弹体斜入水过程的影响规律,采用气液两相流体积分数和水汽空化模型,通过嵌套网格实现刚体三自由度运动学和动力学耦合,模拟了弹体以80～100 m/s速度倾斜入水开空泡阶段的运动过程。经文献实验验证,入水弹体速度与位移的误差为0～6%和-8%～0,转动角度误差为-6%～0。通过对入水速度和入水角度的多工况模拟研究,发现入水速度增大,弹体轴向冲击载荷增大,最大载荷与速度的平方呈线性关系,弹体速度非线性衰减率大;入水角增大,弹体转动角速率减小,运动稳定性强,速度衰减率不受入水角影响。与圆锥头部弹体相比,采用头部阶梯状修型后的弹体的平均速度衰减率、转动角速率和最大轴向冲击载荷分别降低到66.7%、40%和77.2%,显著提高了运动稳定性。     

区块链在车联网中的应用综述

针对当前车联网系统面临的网络安全与可信以及数据大规模同步共享挑战,提出利用区块链技术提升车联网系统的安全性水平与协同共享能力.首先从概念特征与技术架构两个层面对区块链技术进行了整体概述,并结合区块链去中心化存储、共识安全防护、数据不可篡改等特点,探讨了区块链与边缘计算协同应用的互补优势与研究现状.进而从协作同步、安全信...     

某雷达装备虚拟训练系统实现技术

从实际装备的特点出发,确定了虚拟训练系统的分布式实现模式.以该实现模式为基础,对系统软件结构框架、基于HLA/RTI的分布交互以及虚拟装备的人机交互等关键技术的实现进行了讨论,解决了雷达装备虚拟训练系统的系统集成环境构成、各仿真节点间的分布交互以及人机交互等问题,最后在虚拟训练系统上实现了雷达装备的开关机、跟踪以及故障维修等不同训练功能.     

基于小波分析的子带特征提取与选择方法

在研究了目标图像多尺度小波分解特性的基础上,提出了基于小波多尺度分解子带主成分的特征提取的算法。该算法利用图像在不同尺度的小波变换域中能量局部集中性,选择各子带能量较集中的局部小波系数构成图像目标特征向量。这种特征包含图像目标的主要边缘、纹理、灰度、结构等多种信息。由于对图像目标的特征信息的分布没有任何限制,因而适用于多种类型的图像的特征提取,可以解决单一特征提取方法中必须面对的所提取特征不明显的难点。这种特征向量对噪声有较好的鲁棒性。     

参数化滤波器逼近问题的全局最优算法

基于Lipschitz下界估值和分枝定界技术,给出了一维参数化小波滤波器逼近问题的全局最优算法。由于充分利用了滤波器逼近问题的特点,本方法将原来的Lipschitz算法的线性收敛速率提高为二次收敛速率。     

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.