基于直\气复合的再入飞行器操纵耦合分析及鲁椿控制设计

为保证再入飞行器在剧烈变化飞行环境下的控制能力,传统单一气动舵面控制被直＼气复合控制模式取代.性能提升同时,多个参与飞行控制的执行机构之间引起的操纵耦合使系统耦合加剧.以再入飞行器为研究重点,分析了直＼气复合控制模式下的两类操纵耦合原理,建立数学模型.采用动态逆,模糊理论和变结构方法相结合策略设计鲁棒控制器.仿真结果表明该方法是行之有效的.     

基于复杂网络的作战网络分析

分布式网络化作战是网络中心战的基础,而分布式作战网络的构建是网络化作战的重要前提。首先,运用复杂网络的相关参数分析了多种不同的网络,选择了BA非标度网络作为分布式作战网络的最优表现形式;其次,以BA非标度网络为基础提出了一个适合军事上动态鲁棒性分析的模型DCNCE;最后,仿真结果表明,在以网络效能值为测度的对比下,分布式作战网络在介数毁伤策略下更脆弱,为构建并改进现有的作战网络提供了理论依据。     

基于金属膜电阻的大功率低电感负载

利用金属膜电阻设计并制作了用于陡化前沿Marx发生器调试的大功率低电感负载.其阻值约为90Ω,电感约为55nH,基本不具备分散电容.该负载采用线性渐变的圆锥外型结构,有利于减小信号在负载上的反射,配合电容分压器使用能够很好地完成对前沿约为几ns的快前沿高压脉冲的测量.理论估算了该负载的功率容量,并利用PSpice软件模拟了对其进行脉冲方波加载的情况.该负载用于调试陡化前沿的Marx发生器的实验中,获得了幅值约210kV,脉宽近40ns,前沿为5ns的快前沿高压脉冲.多次实验结果表明该负载性能稳定,适用于陡化前沿Marx发生器的调试工作.     

基于LBDL逻辑的抗DPA攻击电路设计方法

动态差分逻辑是一种典型的电路级差分功耗攻击(DPA)防护技术.这种技术通过使逻辑门保持恒定的翻转率来降低电路功耗与数据信号之间的相关性.介绍了一种新型的、基于查找表(Look-Up-Table,LUT)结构的动态差分逻辑(LBDL),以及基于这种逻辑的集成电路设计方法.该设计方法仅需在传统的半定制设计流程中添加少量的替换操作就可以实现 ,因而比其他完全需要全定制设计的动态差分逻辑具有更好的实用性.而相对同样适用于半定制实现的动态差分逻辑 WDDL(Wave Dynamic Differential Logic),LBDL逻辑解决了逻辑门翻转时刻与数据信号之间的相关性,从而比WDDL逻辑具有更好的功耗恒定性.实验结果表明,该设计方法能够有效实现具有抗DPA攻击性能的电路.     

助推滑翔飞行器复合控制系统线性化小偏差运动方程推导与控制系统设计

助推滑翔技术是制导武器实现增加射程、提高机动突防能力的关键技术之一,对飞行器姿态控制有较高的要求,需要设计复合控制方式的姿态控制系统.针对采用空气舵与燃气舵联动控制的飞行器,建立了动力学模型,详细推导了完整的三通道线性化小偏差运动方程,结合典型弹道数据给出了动力系数图像,分析了助推滑翔弹道各飞行段中飞行器的稳定性,在此基础上选取再入段低空飞行特征点进行了姿控系统设计,仿真结果验证了线性化小偏差运动方程的正确性和控制系统的有效性,为进行此类飞行器的稳定性分析与姿态控制系统设计提供了有益的参考.     

基于混合优化的前馈—反馈复合控制器最优设计

为了解决传统PID控制器在电动舵机系统设计中难以满足控制要求的问题,首先设计了一种规范化前馈-反馈控制系统,然后利用混沌优化算法和共轭梯度方法相结合的混合优化算法对前馈-反馈控制器参数进行了优化.仿真结果表明:基于混合优化算法的前馈-反馈控制器具有很好的动态和静态性能,增强了系统的稳定性和鲁棒性,降低了学习参数选择的盲目性和对经验的高度依赖性.     

Optimal control policies for an inventory system with commitment lead time

We consider a firm which faces a Poisson customer demand and uses a base‐stock policy to replenish its inventories from an outside supplier with a fixed lead time. The firm can use a preorder strategy which allows the customers to place their orders before their actual need. The time from a customer's order until the date a product is actually needed is called commitment lead time. The firm pays a commitment cost which is strictly increasing and convex in the length of the commitment lead time. For such a system, we prove the optimality of bang‐bang and all‐or‐nothing policies for the commitment lead time and the base‐stock policy, respectively. We study the case where the commitment cost is linear in the length of the commitment lead time in detail. We show that there exists a unit commitment cost threshold which dictates the optimality of either a buy‐to‐order (BTO) or a buy‐to‐stock strategy. The unit commitment cost threshold is increasing in the unit holding and backordering costs and decreasing in the mean lead time demand. We determine the conditions on the unit commitment cost for profitability of the BTO strategy and study the case with a compound Poisson customer demand.     

区块链在分队战术协同中的应用构想

从战术分队角度出发,探讨了区块链技术在作战实体之间的信息交互及智能协同方面的应用设想,分析了战术分队信息交互的相关技术及面临的挑战,阐述了区块链在未来战术分队指挥体系构建中的发展构想。     

On Government-industry Nexus and Indigenous Armed Resistance

This paper proposes a simple game-theoretic framework for analyzing the relationship between the government, industry and indigenous community, especially in the context of mounting violence surrounding displacement of indigenous communities by governments for the purposes of commercial use of their habitat. It specifically takes into account the possibility of alleged ‘nexus’ between the government and the industry and explores its implications on the level of allocation and utilities of the players. We find that the bias in allocation that occurs when the government and the industry enter a ‘nexus’ can be rectified when there is resistance from the indigenous groups. Moreover, rebellion is a dominant strategy of the indigenous community, irrespective of whether there is ‘nexus’ or not, and being in ‘nexus’ with the government is a best response for the industry. The unique SPNE occurs when there is ‘nexus’ between the industry and the government and resistance by the indigenous groups, corroborating the widespread allegations of ‘nexus’ and evidence of resistance worldwide. We also explore a few extensions of the basic model and present some narrative evidence in support of the theoretical model.     

The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008