弹道数据处理融合算法的并行计算

针对参考文献[1]中提出的融合多信源信息的融合算法,讨论了其中大计算量的测元遴选问题,并给出了它的并行算法。最后详细地分析了此并行算法的高效性和可扩展性,给出了加速比的仿真结果     

Alpha 工作站仿真一体化环境交互系统设计

交互系统是一体化建模仿真环境中的一个重要环节,主要解决人机关系,使用户可以方便地与仿真机作高速通讯,对仿真运行进行实时监控。本文在简要介绍整个系统概况的基础上,对交互系统的总体设计、命令分析与处理、功能实现等几个方面展开了讨论。此外,还简单介绍了交互界面的设计和实现情况     

复合材料圆锥壳稳定性分析的传递函数法

基于线弹性小变形理论， 利用Ｆｏｕｒｉｅｒ级数展开、Ｌａｐｌａｃｅ 变换和摄动方法， 建立了复合材料薄壁圆锥壳的静力响应、频率响应、自由振动与屈曲特征值问题的渐近传递函数解。构造了复杂边界条件、中间带支撑、变锥度及阶梯变厚度圆锥壳的传递函数解。数值计算结果表明该方法具有很高的计算精度。     

高可靠、强实时分布式系统的切换技术研究

本文首先给出某高可靠、强实时分布式系统及系统的两种切换方案的简要描述，然后对切换技术的实现进行讨论；最后，在建立强实时双工系统的可靠性模型基础上，对系统的两种切换方案进行分析与比较。研究结果表明：对于本系统，机组级切换优于结点机级切换，且可以减少程序的复杂度，提高系统的可靠性与实时性。     

协同仿真环境的设计与实现

本文从计算机技术和仿真技术的发展和应用需求出发，提出了协同仿真的基本概念和关键技术，包括建模方法、仿真算法、仿真数据库等几个方面。讨论了协同仿真环境的一般体系结构，最后，介绍了一种协同仿真环境的设计和实现方法。     

基于关系数据库的仿真模型管理

本文将讨论仿真模型库管理技术。从仿真模型库管理的实际需求出发，提出以关系代数系统实体结构（ＲＡＳＥＳ）框架为理论依据、利用关系数据库进行模型库管理的方法，并给出模型库管理算法的形式化描述及系统设计。     

大功率柔性互联设备的有功互济协调控制方法

针对以常规母联开关互联的交流电网线路变压器容量无法合理利用的问题,提出了依靠由背靠背电压源变流器组成的新型大功率柔性互联装置实现两侧交流电网有功功率互济的协调控制方法。介绍了新型柔性互联装置的拓扑结构与基本的控制原理,为实现两侧线路变压器容量合理的目标制定了一种生成有功功率参考的方法,并基于PSCAD/EMTDC搭建了一套仿真算例,对新型柔性互联装置的基本控制与所提出的有功互济的协调控制方法进行了验证。仿真结果表明,在柔性互联装置采用所提方法时能够实现两侧交流线路的有功功率互济,解决了线路变压器容量无法合理分配的问题。     

Ordering policies for an inventory system with three supply modes

This article explores ordering policies for inventory systems with three supply modes. This model is particularly interesting because the optimal ordering decision needs to balance the inventory and purchase costs, as well as the costs for earlier and later periods. The latter cost trade-off is present only in inventory systems with three or more supply modes. Therefore, the result not only offers guidelines for the operation of the concerned inventory systems, but also provides valuable insight into the complex cost trade-offs when more supply modes are available. We assume that the difference between the lead times is one period, and the inventory holding and shortage costs are linear. We analyze two cases and obtain the structure of the optimal ordering policy. Moreover, in the first case, explicit formulas are derived to calculate the optimal order-up-to levels. In the second case, although the optimal order-up-to levels are functions of the initial inventory state and are not obtained in closed form, their properties are discussed. We also develop heuristic ordering policies based on the news-vendor model. Our numerical experiments suggest that the heuristic policies perform reasonably well. © 1996 John Wiley & Sons, Inc.     

Expressions for item fill rates in periodic inventory systems

We examine the problem of estimating the item fill rate in a periodic inventory system. We show that the traditional expressions for line item fill rate, found in many operations management textbooks, perform well for high fill rates (above 90%), but they consistently underestimate the true fill rate. The problem of underestimation becomes significant as the fill rate falls below 90% and is greatly amplified in cases with very low fill rates (below 50%). We review other more accurate expressions for fill rate, discussing their relative merits. We then develop an exact fill rate expression that is robust for both high and low fill rates. We compare the new expression to others found in the literature via an extensive set of simulation experiments using data that reflect actual inventory systems found at Hewlett-Packard. We also examine the robustness of the expressions to violations in the underlying assumptions. Finally, we develop an alternative fill rate expression that is robust for cases of high demand variability where product returns are allowed. © 1995 John Wiley & Sons, Inc.     

An exact aggregation/disaggregation algorithm for large scale markov chains

Many Markov chain models have very large state spaces, making the computation of stationary probabilities very difficult. Often the structure and numerical properties of the Markov chain allows for more efficient computation through state aggregation and disaggregation. In this article we develop an efficient exact single pass aggregation/disaggregation algorithm which exploits structural properties of large finite irreducible mandatory set decomposable Markov chains. The required property of being of mandatory set decomposable structure is a generalization of several other Markov chain structures for which exact aggregation/disaggregation algorithms exist. © 1995 John Wiley & Sons, Inc.