SpaceWire网络热点通信模式的缓存资源分配算法

基于SpaceWire网络在热点通信模式下的工作特点,研究缓存资源的分配算法。给出均匀通信模式和热点通信模式的释义;推导网络路由节点的满负荷概率和平均延时的解析方法,计算网络中的关键通信节点;再给出SpaceWire网络缓存资源分配算法。利用Opnet网络仿真平台建立SpaceWire通信模型,仿真了不同通信模式中采用缓存优化策略前后的关键性能指标。研究结果表明:在热点通信模式状态下,该缓存资源分配算法在保证总资源一定的前提下,网络系统的平均延时降低,优化了SpaceWire网络性能。     

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

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

多层弹道导弹防御体系火力分配优化研究

对多层弹道导弹防御体系火力分配问题进行了研究。首先对多层弹道导弹防御体系火力分配问题进行了描述,在此基础上建立了基于最大化资源剩余价值目标函数的多层弹道导弹防御体系火力分配模型,分析了求解该模型的难点,提出了基于文化基因的多层弹道导弹防御体系火力分配问题文化基因求解算法,最后应用实例验证了模型的有效性,并对算法进行了对比分析。试验结果证明,合理制定多层弹道导弹防御体系火力分配方案,对于提升防御效能具有重要意义。     

基于混合智能算法的小型通信干扰装备分配优化

如何充分发挥小型通信干扰装备的作战效能是指挥员面临的棘手问题。本文将战术指标——干扰后的通信畅通区覆盖程度作为评估通信干扰装备分配优劣的指标,分别建立了单机和多部干扰时的通信干扰有效压制区和通信畅通区边界的计算模型,并给出了通信干扰有效压制区和通信畅通区面积的计算方法。构建了基于机会约束规划的空域频域通信干扰任务分配模型,并设计了混合蚁群算法和遗传算法的模型求解算法。最后进行了仿真实验,验证分析了模型和算法的合理性。研究成果为通信对抗战术计算和作战运用研究拓展了思路。     

弹道导弹防御中拦截弹最优分层配置

多层弹道导弹防御系统在助推段、飞行中段或再入段不同阶段实施拦截,可有效提高系统拦截概率,不同拦截阶段存在拦截弹最优配比问题。为了解决拦截弹道导弹过程中的最优分层配置的问题,本文分别以单层、双层、三层这三种拦截系统为例,通过公式演算和计算机仿真,得出了分段拦截弹道导弹时、不同拦截阶段的拦截弹之间的数量比与整体拦截成功率之间的关系;并提出了整体拦截成功率的概念。经仿真表明,在整体拦截成功率给定的情况下,使用本文所得出的不同拦截段之间所需拦截弹数目之间的最优比,可以最大限度地降低弹道导弹的拦截成本。     

A dynamic allocation heuristic for centralized safety stock

An inventory system that consists of a depot (central warehouse) and retailers (regional warehouses) is considered. The system is replenished regularly on a fixed cycle by an outside supplier. Most of the stock is direct shipped to the retailer locations but some stock is sent to the central warehouse. At the beginning of any one of the periods during the cycle, the central stock can then be completely allocated out to the retailers. In this paper we propose a heuristic method to dynamically (as retailer inventory levels change with time) determine the appropriate period in which to do the allocation. As the optimal method is not tractable, the heuristic's performance is compared against two other approaches. One presets the allocation period, while the other provides a lower bound on the expected shortages of the optimal solution, obtained by assuming that we know ahead of time all of the demands, period by period, in the cycle. The results from extensive simulation experiments show that the dynamic heuristic significantly outperforms the “preset” approach and its performance is reasonably close to the lower bound. Moreover, the logic of the heuristic is appealing and the calculations, associated with using it, are easy to carry out. Sensitivities to various system parameters (such as the safety factor, coefficient of variation of demand, number of regional warehouses, external lead time, and the cycle length) are presented. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

新型军用模块化充电电源

为了弥补部队装备中充电设备技术落后、自动化水平低的缺点,介绍了利用高频开关管IGBT构成模块化充电电源的主电路、控制电路及保护电路的结构、原理。利用该项技术研制的移动式充电车与充电柜,极大地提高了部队的快速反应能力。     

机械系统可靠性设计若干问题探讨

机械系统的可靠性设计是当前可靠性工程界面临的热点和难点问题之一,从分析机械系统可靠性设计的特点和难点入手,探讨了机械系统可靠性建模、分配、预计等机械系统可靠性设计中急需解决的关键问题。     

突防过程的组网雷达干扰资源优化分配

以组网雷达融合中心检测概率为目标函数,建立针对组网雷达系统的干扰资源优化分配模型.并进一步指出该模型运用于飞行器突防时,其不足之处在于"以点带面",以飞行器突防过程中某一点的融合中心检测概率代替整个突防过程时,该评估方法损失过程中的大量信息.在此基础上充分利用突防过程的信息,提出以"融合中心检测概率加权积分"为目标函数,建立基于突防过程的干扰资源优化分配模型.仿真结果表明具有一定的指导意义.     

Capacity allocation with traditional and Internet channels

In this paper we study a capacity allocation problem for two firms, each of which has a local store and an online store. Customers may shift among the stores upon encountering a stockout. One question facing each firm is how to allocate its finite capacity (i.e., inventory) between its local and online stores. One firm's allocation affects the decision of the rival, thereby creating a strategic interaction. We consider two scenarios of a single‐product single‐period model and derive corresponding existence and stability conditions for a Nash equilibrium. We then conduct sensitivity analysis of the equilibrium solution with respect to price and cost parameters. We also prove the existence of a Nash equilibrium for a generalized model in which each firm has multiple local stores and a single online store. Finally, we extend the results to a multi‐period model in which each firm decides its total capacity and allocates this capacity between its local and online stores. A myopic solution is derived and shown to be a Nash equilibrium solution of a corresponding “sequential game.” © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006