新时期基层消防部队科学文化教育存在的问题及对策

基层部队开展科学文化教育活动,是培养“四有"军人,加强部队现代化建设的一项战略任务。然而,各级领导对这项活动在思想认识、组织引导、工作力度等方面存在诸多问题,必须在充分认识的基础上,采取多种措施,大力加以解决,在兴趣培养、方法、内容、制度、环境等方面进行改进,切实搞好这项活动,推进部队全面建设。     

灵巧噪声干扰本质及相关基本问题探讨

为正确理解和实施灵巧噪声干扰,基于匹配滤波器理论对灵巧噪声干扰的本质含义进行了分析。指出,灵巧噪声干扰的本质含义是使干扰由多个分量组成,并且使干扰中的每一个分量的频谱都与雷达发射信号的频谱相同,从而使干扰中的每一个分量的功率利用效率都达到最大。最后,从理论和实践2个角度,阐述了与灵巧噪声干扰相关的基本问题,并进行了相应的分析。     

Models and algorithms for shuffling problems in steel plants

In this article, we study item shuffling (IS) problems arising in the logistics system of steel production. An IS problem here is to optimize shuffling operations needed in retrieving a sequence of steel items from a warehouse served by a crane. There are two types of such problems, plate shuffling problems (PSP) and coil shuffling problems (CSP), considering the item shapes. The PSP is modeled as a container storage location assignment problem. For CSP, a novel linear integer programming model is formulated considering the practical stacking and shuffling features. Several valid inequalities are constructed to accelerate the solving of the models. Some properties of optimal solutions of PSP and CSP are also derived. Because of the strong NP‐hardness of the problems, we consider some special cases of them and propose polynomial time algorithms to obtain optimal solutions for these cases. A greedy heuristic is proposed to solve the general problems and its worst‐case performances on both PSP and CSP are analyzed. A tabu search (TS) method with a tabu list of variable length is proposed to further improve the heuristic solutions. Without considering the crane traveling distance, we then construct a rolling variable horizon heuristic for the problems. Numerical experiments show that the proposed heuristic algorithms and the TS method are effective. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Newsvendor problems with sequentially revealed demand information

This article analyzes a capacity/inventory planning problem with a one‐time uncertain demand. There is a long procurement leadtime, but as some partial demand information is revealed, the firm is allowed to cancel some of the original capacity reservation at a certain fee or sell off some inventory at a lower price. The problem can be viewed as a generalization of the classic newsvendor problem and can be found in many applications. One key observation of the analysis is that the dynamic programming formulation of the problem is closely related to a recursion that arises in the study of a far more complex system, a series inventory system with stochastic demand over an infinite horizon. Using this equivalence, we characterize the optimal policy and assess the value of the additional demand information. We also extend the analysis to a richer model of information. Here, demand is driven by an underlying Markov process, representing economic conditions, weather, market competition, and other environmental factors. Interestingly, under this more general model, the connection to the series inventory system is different. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 2012     

连续情形的窃贼问题

讨论了连续时间上的窃贼问题。Ｊｔ是［０,ｔ］上窃贼作案的次数,｛Ｊｔ｝ｔ≥０是Ｐｏｉｓ－ｓｏｎ过程;收获过程与风险过程都是独立同分布的时间序列。利用弱无穷小算子,我们找出了最优停时规则。     

双二体几何切面法及天梯地月转移轨道分析

双二体模型是求解地月转移轨道的重要基础。与传统的采用月球影响球入口点经纬度的描述方式不同,本文提出一种基于飞行轨道面参数来描述地月转移轨道的双二体模型几何表达方式,结合一维非线性方程求根算法Brent算法和Lambert原理,将原始三维球面搜索算法降维成为二维圆上的搜索算法,可以高效求解地月转移轨道的形状参数。为避免重复计算,将转移轨道窗口计算的轨道多变量搜索问题解耦分解成两个子问题——转移轨道形状参数求解问题和转移轨道面空间定向问题,降低了问题的求解维度。形成两级并行计算算法,充分发挥多核计算机算力,加速计算过程。仿真结果表明,基于提出的并行圆锥曲线几何切面法,可以成功应用于计算天梯地月转移轨道分析。     

Generalized orienteering problem with resource dependent rewards

We introduce a generalized orienteering problem (OP) where, as usual, a vehicle is routed from a prescribed start node, through a directed network, to a prescribed destination node, collecting rewards at each node visited, to maximize the total reward along the path. In our generalization, transit on arcs in the network and reward collection at nodes both consume a variable amount of the same limited resource. We exploit this resource trade‐off through a specialized branch‐and‐bound algorithm that relies on partial path relaxation problems that often yield tight bounds and lead to substantial pruning in the enumeration tree. We present the smuggler search problem (SSP) as an important real‐world application of our generalized OP. Numerical results show that our algorithm applied to the SSP outperforms standard mixed‐integer nonlinear programming solvers for moderate to large problem instances. We demonstrate model enhancements that allow practitioners to represent realistic search planning scenarios by accounting for multiple heterogeneous searchers and complex smuggler motion. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

控制分配在平流层飞艇姿态控制中的应用*(专题约稿)

针对平流层飞艇一般采用多控制机构的特点,提出了将广义逆控制分配方法应用到飞艇姿态控制系统中,并根据飞艇控制机构特性采用了加权伪逆控制分配算法。飞艇姿态控制仿真结果表明：设计的控制分配方法可以有效实现多控制机构的协调操纵,姿态角控制效果良好,避免了单一操纵舵面过早进入饱和状态的情况;合理调整控制分配权值可减少能量损耗,实时性较好,便于工程实现。     

高速行进坦克身管速度对射击精度影响

坦克在高速行进时,由于路面谱等外部激励的影响,车体姿态和运动状态都会发生变化。由于车体的振动和随动系统的控制误差等,致使坦克火炮在射击时身管前端存在一定的速度扰动。原有解命中问题的条件中未考虑这一速度扰动的影响,使得坦克在高速行进条件下的目标提前点预测产生误差。通过建立外弹道模型,较准确地仿真分析了这一误差的大小和对射击精度的影响。     

基于委托模式的多分辨率联合仿真

多分辨率联合仿真是实现多层次、多视角仿真的有效方法之一。现有多分辨率联合仿真模式存在一致性偏差和仿真剧情割裂问题,从而影响仿真的有效性。为此,提出基于委托模式的多分辨率联合仿真思路,该模式下能够较好地避免仿真剧情割裂问题,同时降低一致性问题的解决难度。通过实例验证,该方法较好地适用于大规模作战和局部作战行动的多分辨率联合仿真。