多操纵面战斗机飞行控制系统设计

现代多操纵面战斗机飞行控制系统多采用非线性控制方法进行设计,其中逆系统方法具有物理概念清晰、参数对应明确、无不确定性算法、容易结合传统经验等优点,易于工程实现.将该方法应用于多操纵面战斗机的基本控制律设计,使用多层简化设计,改进了多操纵面的控制分配策略,并针对某型多操纵面战斗机六自由度模型进行数字仿真,效果良好.     

不确定情况下协同空战目标分配方法

现代空战环境下出现的大量不确定信息, 现在常用的协同目标分配模型都没有考虑到这种情况.针对这种情况,将随机规划引入到协同空战目标分配研究中,在一般期望值模型的基础上,建立了多机空战协同目标分配期望值模型,并利用随机模拟、神经网络和遗传算法结合而成的混合智能算法来求解该期望值模型.2∶4协同空战仿真结果表明该模型的有效性.     

异步雷达组网协同跟踪动态传感器分配算法

针对异步雷达组网下的协同跟踪问题提出了一种基于异步顺序融合的动态传感器分配算法。该算法对异步雷达的量测值按采样时刻顺序滤波,根据滤波协方差和目标期望协方差的接近程度动态选择下一时刻跟踪的最优传感器集合。仿真分析表明该算法和基于伪量测的异步雷达组网协同跟踪传感器分配算法相比具有较少的计算量和较高的目标跟踪精度。     

基于DRFM的匀加速距离门拖引干扰信号的频谱分析

研究了基于DRFM的匀加速距离门拖引干扰信号的频谱。由于DRFM的离散化采样,导致干扰信号频谱有两个明显特征。首先,频谱相对于中心频率会出现微小可测的频移;其次,频谱由菲涅尔谱及其周期性的谐波组成,且在特定情况下会出现频谱的交叠。首先推导了匀加速距离门拖引的时域表达式并分析其频谱,并从理论上得出频移、谐波中心的位置以及频谱交叠的条件。最后通过对时域信号的fft仿真,验证所作理论推导的正确性。     

Terminal allocation problem in a transshipment hub considering bunker consumption

This article investigates the method of allocating arriving vessels to the terminals in transshipment hubs. The terminal allocation decision faced by a shipping alliance has the influence on the scheduled arrival time of vessels and further affects the bunker consumption cost for the vessels. A model is formulated to minimize the bunker consumption cost as well as the transportation cost of inter‐terminal transshipment flows/movements. The capacity limitation of the port resources such as quay cranes (QCs) and berths is taken into account. Besides the terminal allocation, the QC assignment decision is also incorporated in the proposed model. A local branching based method and a particle swarm optimization based method are developed to solve the model in large‐scale problem instances. Numerical experiments are also conducted to validate the effectiveness of the proposed model, which can save around 14% of the cost when compared with the “First Come First Served” decision rule. Moreover, the proposed solution methods not only solve the proposed model within a reasonable computation time, but also obtain near‐optimal results with about 0.1～0.7% relative gap. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 529–548, 2016     

布达拉宫古建筑灭火设施优化配置研究

为配合布达拉宫的消防工程改造,优化其建筑灭火设施的配置,针对现阶段布达拉宫建筑灭火设施现状,剖析了其存在的问题和缺陷,介绍了国外文物古建筑消防保护的理念,阐明了古建筑灭火设施优化配置应遵循的原则,通过对各类灭火设施保护宫殿的可行性和适用性分析,提出了布达拉宫古建筑灭火设施优化配置方案。     

Optimal resource allocation and redistribution strategy in military conflicts with Lanchester square law attrition

We address the problem of optimal decision‐making in conflicts based on Lanchester square law attrition model where a defending force needs to be partitioned optimally, and allocated to two different attacking forces of differing strengths and capabilities. We consider a resource allocation scheme called the Time Zero Allocation with Redistribution (TZAR) strategy, where allocation is followed by redistribution of defending forces, on the occurrence of certain decisive events. Unlike previous work on Lanchester attrition model based tactical decision‐making, which propose time sequential tactics through an optimal control approach, the present article focuses on obtaining simpler resource allocation tactics based on a static optimization framework, and demonstrates that the results obtained are similar to those obtained by the more complex dynamic optimal control solution. Complete solution for this strategy is obtained for optimal partitioning of resources of the defending forces. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

一种面向分布式寄存器文件的VLIW调度新策略

新一代面向密集计算的高性能处理器普遍采用分布式寄存器文件来支撑ALU阵列,并通过VLIW开发指令级并行.面向分布式寄存器文件的编译成为新兴的研究热点,在斯坦福大学的kernelC编译器ISCD中最早提出了面向分布式寄存器的VLIW调度问题,在该领域处于领先水平,但是没有解决重负载下的分布式寄存器分配问题,使应用编程受到极大限制.在其基础上提出了一种新的VLIW调度策略,实验结果表明能够很好地解决重负载下的分布式寄存器分配问题.     

耐久性及其在装备研制中的应用

机械产品在武器装备中占有较大的比例,机械产品的故障,有很多是由于疲劳、磨损、腐蚀、老化等渐变性的耗损过程造成的,寿命是机械产品可靠性中的重要问题。耐久性的提出为解决机械产品与寿命有关的问题提供了方法和工具。通过探讨耐久性的定义、极限状态、耐久性参数、耐久性分配与预计等有关耐久性的基本问题,给出了耐久性分配与预计的工程实例。     

Equitable bandwidth allocation in content distribution networks

Applications for content distribution over networks, such as Video‐on‐Demand (VOD), are expected to grow significantly over time. Effective bandwidth allocation schemes that can be repeatedly executed must be deployed since new programs are often installed at various servers while other are deleted. We present a model for bandwidth allocation in a content distribution network that consists of multiple trees, where the root of each tree has a server that broadcasts multiple programs throughout the tree. Each network link has limited capacity and may be used by one or more of these trees. The model is formulated as an equitable resource allocation problem with a lexicographic maximin objective function that attempts to provide equitable service performance for all requested programs at the various nodes. The constraints include link capacity constraints and tree‐like ordering constraints imposed on each of the programs. We present an algorithm that provides an equitable solution in polynomial time for certain performance functions. At each iteration, the algorithm solves single‐link maximin optimization problems while relaxing the ordering constraints. The algorithm selects a bottleneck link, fixes various variables at their lexicographic optimal solution while enforcing the ordering constraints, and proceeds with the next iteration. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010