舰载火控系统的建模与仿真

探讨了建模与仿真技术在新型武器系统研制中的作用地位;介绍了WISE一体化建模／仿真开发环境及仿真软件,描述了新型舰载火控系统的建模与数字仿真方法,给出了采用分布交互式仿真(DIS)技术支持新型舰载火控系统进行效能评估的技术途径     

分布式防空C3I系统的分布交互仿真研究

分布式防空C3I系统具有分布性、交互性、抗毁性和资源共享性,是C3I系统的发展方向.在分析了分布式防空C3I系统和分布交互仿真功能、特点的基础上,利用分布仿真技术构建了分布式防空C3I系统的仿真平台.具体分析了在仿真平台中的各个仿真实体应实现的功能,并对在仿真中所采用的关键技术进行了论述.     

一维非均匀分布参数系统的渐近传递函数方法

提出了一维非均匀分布参数系统的一种通用解法：渐近传递函数方法。对一般的一维非均匀分布参数系统，引入状态变量将控制方程及边界方程写成状态空间形式。通过定义小参数和摄动方法，使之变成常系数微分方程，从而得到问题的摄动解。各阶摄动解均具有规范的形式，是一以传递函数为积分核的积分形式解析解。文中最后给出了一些数值算例，验证了方法的有效性。     

递进优化技术在汽油机工作过程优化计算中的应用

采用数学规化的方法优化汽油机的工作过程,可以在限制发动机热负荷、机械负荷、氧化氮排放和不爆震的条件下,使发动机在运行过程中经济性最好.但是要求得比较精确的优化解,一般要进行大量计算,花费较多机时.本文提出了一种分段、分层、分级的递进优化方法,应用于汽油机工作过程的优化计算中,取得了较好的效果.     

分布式操作系统MTA－OS的设计研究

介绍了一个用于空－空多目标攻击数字仿真的分布式操作系统ＭＴＡ－ＯＳ的设计思想、系统结构、组成及主要功能。     

Dynamic coordination of production planning and sales admission control in the presence of a spot market

We consider the decision‐making problem of dynamically scheduling the production of a single make‐to stock (MTS) product in connection with the product's concurrent sales in a spot market and a long‐term supply channel. The spot market is run by a business to business (B2B) online exchange, whereas the long‐term channel is established by a structured contract. The product's price in the spot market is exogenous, evolves as a continuous time Markov chain, and affects demand, which arrives sequentially as a Markov‐modulated Poisson process (MMPP). The manufacturer is obliged to fulfill demand in the long‐term channel, but is able to rein in sales in the spot market. This is a significant strategic decision for a manufacturer in entering a favorable contract. The profitability of the contract must be evaluated by optimal performance. The current problem, therefore, arises as a prerequisite to exploring contracting strategies. We reveal that the optimal strategy of coordinating production and sales is structured by the spot price dependent on the base stock and sell‐down thresholds. Moreover, we can exploit the structural properties of the optimal strategy to conceive an efficient algorithm. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

The stochastic single resource service‐provision problem

The service‐provision problem described in this paper comes from an application of distributed processing in telecommunications networks. The objective is to maximize a service provider's profit from offering computational‐based services to customers. The service provider has limited capacity and must choose which of a set of software applications he would like to offer. This can be done dynamically, taking into consideration that demand for the different services is uncertain. The problem is examined in the framework of stochastic integer programming. Approximations and complexity are examined for the case when demand is described by a discrete probability distribution. For the deterministic counterpart, a fully polynomial approximation scheme is known 2 . We show that introduction of stochasticity makes the problem strongly NP‐hard, implying that the existence of such a scheme for the stochastic problem is highly unlikely. For the general case a heuristic with a worst‐case performance ratio that increases in the number of scenarios is presented. Restricting the class of problem instances in a way that many reasonable practical problem instances satisfy allows for the derivation of a heuristic with a constant worst‐case performance ratio. Worst‐case performance analysis of approximation algorithms is classical in the field of combinatorial optimization, but in stochastic programming the authors are not aware of any previous results in this direction. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

Optimal control of a production‐inventory system with both backorders and lost sales

We consider the optimal control of a production inventory‐system with a single product and two customer classes where items are produced one unit at a time. Upon arrival, customer orders can be fulfilled from existing inventory, if there is any, backordered, or rejected. The two classes are differentiated by their backorder and lost sales costs. At each decision epoch, we must determine whether or not to produce an item and if so, whether to use this item to increase inventory or to reduce backlog. At each decision epoch, we must also determine whether or not to satisfy demand from a particular class (should one arise), backorder it, or reject it. In doing so, we must balance inventory holding costs against the costs of backordering and lost sales. We formulate the problem as a Markov decision process and use it to characterize the structure of the optimal policy. We show that the optimal policy can be described by three state‐dependent thresholds: a production base‐stock level and two order‐admission levels, one for each class. The production base‐stock level determines when production takes place and how to allocate items that are produced. This base‐stock level also determines when orders from the class with the lower shortage costs (Class 2) are backordered and not fulfilled from inventory. The order‐admission levels determine when orders should be rejected. We show that the threshold levels are monotonic (either nonincreasing or nondecreasing) in the backorder level of Class 2. We also characterize analytically the sensitivity of these thresholds to the various cost parameters. Using numerical results, we compare the performance of the optimal policy against several heuristics and show that those that do not allow for the possibility of both backordering and rejecting orders can perform poorly.© 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010     

基于分布式排队网络的防空战术协同模型

分析了多个防空火力单元的作战过程,将战术BM/C3的控制协调决策抽象为决策策略。建立了多个火力单元协同作战的排队网络模型,并运用SPN理论对排队网络的运行机制进行了强有力的描述,有效地体现了防空作战过程中的威胁评估、目标分配等战术决策过程。这将为建立大型复杂排队网络,模拟仿真战役层面防空作战过程奠定基础。     

分布式卫星系统相对运动的Hamilton力学建模及求解方法研究

介绍了地球扁率摄动下分布式卫星系统(DSS,Distributed Satellite System)相对运动的Hamilton动力学模型,给出DSS相对运动的Hamilton正则方程;针对地球扁率摄动下DSS相对运动的两点边值问题,提出了一种基于生成函数的打靶求解法,应用该方法对地球扁率摄动下DSS高精度构型调整问题进行了计算,结果表明该算法具有较高的计算效率,可有效避免维数灾难问题。