基于Agent技术的战术互联网动态频谱管理系统

动态频谱管理是提升战术互联网作战效能的主要手段之一.首先分析了战术互联网以及动态频率管理工作特点的基础上,设计了一种基于Agent技术的动态频谱管理系统,并详细介绍了动态频谱管理的实现方法.     

机组动态过程分析中处理转子运动的方法

分析军用便携式发电机组在单机供电及并联供电情况下的动态过程有利于提高其供电质量.采用有限元法计算电机动态过程需要在电机电磁场计算时实现转子的自由转动.从运动导电媒质中的电磁场方程出发,分析了固定坐标系求解方法及移动坐标系求解各方法的特点.针对军用便携式发电机组单机供电及并联供电情况下动态过程的特点分析,对各种处理转子运动的方法进行了比较,得出的结论对于研究军用便携式发电机组单机供电及并联供电情况时处理转子运动的方法选取具有理论指导意义.     

某自行战车火控系统动态航路制定及软件实现

根据某型自行战车对空中目标作战的精度需求,为突破火控系统自带动态航路的局限性,提出了动态航路制定模型.在基准战车时目标起始点坐标进行测量的基础上,由连战斗队形配置确定全连其余战车相对基准车档坐标值,通过坐标转换计算,得到其余战车动态航路参数.采用面向对象的可视化编程语言C#2.0编写程序,设计动态航路制定软件.通过举例分析,证明了该方法的可行性,为有效提高自行战车的射击精度提供了一种较为科学的方法.     

动态规划在消防增援调度中的应用

由于各消防中队一般规模较小,对于较大规模的火灾需要多个消防队共同救护,此时若能够实现增援调度的最优化可以提高这些同时出现的火灾被全部扑灭的概率。利用多阶段动态规划对增援调度进行了研究,并分析了具体案例。通过分析得出此方法有助于改善消防资源分配状况,以实现最大程度地减小经济损失。     

夹芯复合材料基座结构设计与强度分析

提出了两型夹芯复合材料基座结构的设计方案,建立了夹芯复合材料基座数值分析模型,通过理论分析确定了影响基座结构刚度和强度性能的主要参数;应用有限元法,分析了铺层方式、支撑厚度和骨架形式等对直支撑基座结构刚度和强度性能的影响规律,计算并讨论了曲率半径对弧形支撑式基座刚度和强度性能的影响;比较了5种夹芯材料基座的结构力学性能,并通过优化设计,确定了夹芯复合材料基座结构形式。     

联合作战的远程火力战法动态分析方法*

用定量动态分析方法开发远程火力战法是联合作战规划中必须解决的重要问题。借助仿真和博弈分析的混合方法,在对博弈效用函数计算的基础上,构建基于识别真目标、假目标以及火力命中目标概率的二人非零和(TPNZS)非合作博弈模型来开发远程火力战法动态分析方法,对两个典型的联合作战远程火力打击战法性能的初步动态分析表明:战场势态的动态变化直接影响定量规划最优战法的结果。     

Dynamic routing of prioritized warranty repairs

Recent years have seen a strong trend toward outsourcing warranty repair services to outside vendors. In this article we consider the problem of dynamically routing warranty repairs to service vendors when warranties have priority levels. Each time an item under warranty fails, it is sent to one of the vendors for repair. Items covered by higher priority warranty receive higher priority in repair service. The manufacturer pays a fixed fee per repair and incurs a linear holding cost while an item is undergoing or waiting for repair. The objective is to minimize the manufacturer's long‐run average cost. Because of the complexity of the problem, it is very unlikely that there exist tractable ways to find the optimal routing strategies. Therefore, we propose five heuristic routing procedures that are applicable to real‐life problems. We evaluate the heuristics using simulation. The simulation results show that the index‐based “generalized join the shortest queue” policy, which applies a single policy improvement step to an initial state‐independent policy, performs the best among all five heuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

考虑刚度影响的双输入转矩分流式齿轮系统均载特性

为了对转矩分流齿轮系统均载特性进行更加深入的研究,建立系统非线性动力学模型,采用数值仿真方法计算系统的均载系数,分析联动轴扭转刚度、输出轴支撑刚度、输入转速以及轴位角对均载系数的影响规律,并对齿轮系统进行实验研究.研究结果表明:输出端的均载系数大于输入端的均载系数,高压输入端的均载系数大于低压输入端的均载系数;均载系数...     

Approximate dynamic programming methods for an inventory allocation problem under uncertainty

We propose two approximate dynamic programming methods to optimize the distribution operations of a company manufacturing a certain product at multiple production plants and shipping it to different customer locations for sale. We begin by formulating the problem as a dynamic program. Our first approximate dynamic programming method uses a linear approximation of the value function and computes the parameters of this approximation by using the linear programming representation of the dynamic program. Our second method relaxes the constraints that link the decisions for different production plants. Consequently, the dynamic program decomposes by the production plants. Computational experiments show that the proposed methods are computationally attractive, and in particular, the second method performs significantly better than standard benchmarks. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Optimal pricing and inventory control policy in periodic‐review systems with fixed ordering cost and lost sales

This paper studies a periodic‐review pricing and inventory control problem for a retailer, which faces stochastic price‐sensitive demand, under quite general modeling assumptions. Any unsatisfied demand is lost, and any leftover inventory at the end of the finite selling horizon has a salvage value. The cost component for the retailer includes holding, shortage, and both variable and fixed ordering costs. The retailer's objective is to maximize its discounted expected profit over the selling horizon by dynamically deciding on the optimal pricing and replenishment policy for each period. We show that, under a mild assumption on the additive demand function, at the beginning of each period an (s,S) policy is optimal for replenishment, and the value of the optimal price depends on the inventory level after the replenishment decision has been done. Our numerical study also suggests that for a sufficiently long selling horizon, the optimal policy is almost stationary. Furthermore, the fixed ordering cost (K) plays a significant role in our modeling framework. Specifically, any increase in K results in lower s and higher S. On the other hand, the profit impact of dynamically changing the retail price, contrasted with a single fixed price throughout the selling horizon, also increases with K. We demonstrate that using the optimal policy values from a model with backordering of unmet demands as approximations in our model might result in significant profit penalty. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006