通信对抗装备维修管理信息系统

通信对抗装备的性能越来越强、复杂程度越来越高 ,而维修保障方式和手段的落后制约了装备战斗力的发挥。因此 ,改善装备维修的手段 ,实现装备信息的科学管理就成为一项迫切需要解决的问题。从功能、构成和信息结构、信息管理和软件体系等方面介绍了一个装备维修管理信息系统的设计思想。     

一种飞行器在线实时航迹规划算法

针对飞行器在线航迹规划问题展开研究,提出了一种实时航迹搜索算法。该方法将飞行器的运动与航迹搜索结合在一起,可以有效地调节搜索的时间,满足在线实时应用的要求。通过在限定的时间内扩大寻优范围,该算法可以有效地避免不可行区域,并使生成的航迹更加优化。实验结果表明,算法能有效地处理各种航迹约束,实时地生成满意的三维航迹。     

GPS与其他数字系统的共存问题

现代飞行器配备多种电子系统工作在复杂的电磁环境中,需要解决各系统兼容的问题.因此,在理论上分析了窄带数字系统、宽带CDMA系统、超宽带系统对GPS系统影响,然后讨论了解决方案,最后给出仿真结果.     

环形区域极点/协方差约束下的模型简化设计

提出离散随机系统模型简化的一种新方法,即环形区域极点／协方差约束下的模型简化方法。这种设计方法的基本思路是构造指定维数的降阶模型,使其匹配给定的环形区域极点和稳态协方差参数,在系统的动态特性和稳态特性方面逼近给定的满阶模型。文中导出了期望的简化模型的存在条件及解析表达式,并提供了一个数值算例。     

贝叶斯网络推理在信息系统安全风险评估中的应用

提出了一种基于贝叶斯网络推理的安全风险评估方法。从实际出发建立信息系统的贝叶斯网络模型,根据专家给出的先验信息,结合获得的证据信息,运用Pearl方法完成对模型的评估,给出在特定条件下模型的计算——线性推理算法。最后,以实例分析信息系统安全评估的实现过程,结果表明,该方法可行、有效。     

A model of supply-chain decisions for resource sharing with an application to ventilator allocation to combat COVID-19

We present a stochastic optimization model for allocating and sharing a critical resource in the case of a pandemic. The demand for different entities peaks at different times, and an initial inventory for a central agency are to be allocated. The entities (states) may share the critical resource with a different state under a risk-averse condition. The model is applied to study the allocation of ventilator inventory in the COVID-19 pandemic by FEMA to different U.S. states. Findings suggest that if less than 60% of the ventilator inventory is available for non-COVID-19 patients, FEMA's stockpile of 20 000 ventilators (as of March 23, 2020) would be nearly adequate to meet the projected needs in slightly above average demand scenarios. However, when more than 75% of the available ventilator inventory must be reserved for non-COVID-19 patients, various degrees of shortfall are expected. In a severe case, where the demand is concentrated in the top-most quartile of the forecast confidence interval and states are not willing to share their stockpile of ventilators, the total shortfall over the planning horizon (until May 31, 2020) is about 232 000 ventilator days, with a peak shortfall of 17 200 ventilators on April 19, 2020. Results are also reported for a worst-case where the demand is at the upper limit of the 95% confidence interval. An important finding of this study is that a central agency (FEMA) can act as a coordinator for sharing critical resources that are in short supply over time to add efficiency in the system. Moreover, through properly managing risk-aversion of different entities (states) additional efficiency can be gained. An additional implication is that ramping up production early in the planning cycle allows to reduce shortfall significantly. An optimal timing of this production ramp-up consideration can be based on a cost-benefit analysis.     

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     

一类多维双重时序 AR(1)-MA(q) 模型的平稳性

讨论了一类多维双重时序ＡＲ（１）－ＭＡ（ｑ）模型的二阶平稳性问题。通过导出一组线性方程组，给出了这类模型二阶平稳的显式充分条件和必要条件，为验证模型的二阶平稳性提供了一个可行的途径。     

阻止差分密码攻击的有效方法

差分密码分析方法是1990年由E.Biham和A.Shamir提出的,这种方法对DES算法及DES类体制构成了威胁。本文在剖析了差分密码分析方法工作原理的基础上,提出了改进DES算法的7种方法,从而可以有效地阻止差分密码分析法的攻击。     

分布虚拟战场环境CGF行为调度

提出了一种分布虚拟战场环境中计算机生成兵力(CGF)实体行为调度方法,该方法由仿真结点对结点中运行的所有本地CGF实体及异地实体的远程模型所产生的行为进行集中式调度。通过本地CGF实体的兴趣域动态决定需要执行的异地实体远程模型行为的优先级及执行最后时限,通过将本地所有CGF实体的兴趣域合并,减少仿真结点需要调度的异地实体远程模型数量,进一步降低仿真结点的计算开销。该方法可以有效地确保分布虚拟战场环境对仿真实时性及真实性的要求。