基于改进粒子群算法的装备维修资源优化问题研究

通过对粒子群算法的分析,针对其易过早收敛的不足,将遗传算法的变异操作引入其中,并给出了惯性因子的调整方式。在建立维修资源优化模型的基础上,结合实例运用改进的粒子群算法和模拟退火遗传算法进行了仿真,结果表明,该算法具有更好的收敛性。     

C4ISR系统中军用卫星系统若干关键技术

卫星系统在C4ISR系统这样一个综合性大系统中的应用无庸置疑,首先介绍了C4ISR系统中卫星系统的分类,然后分析了军用卫星通信系统在战场信息传输中的若干关键技术,包括卫星定位技术、与地面网络互联技术、抗干扰技术和卫星终端技术等,最后指出了卫星通信系统发展的方向.     

广义随机Petri网的装备战场抢修建模与分析

将广义随机Petri网(GSPN)的基本理论应用于装备战场抢修系统的建模与分析,考虑装备战场抢修过程中的各种因素,采用Petri网与马尔可夫理论相结合的装备战场抢修系统性能分析方法,为装备战场抢修系统性能的有效评估提供了理论依据.通过实例验证,该方法可用于分析装备抢修系统的时间性能和运作效率,为机关决策层提供参考.     

基于离散降雨衰耗状态的卫星信道模型

针对Ka频段卫星信道中降雨衰耗的统计分布特点,建立了基于离散降雨衰耗状态的卫星信道模型,模型中各状态组成离散的Markov链并由其转移概率矩阵来表示,分析此模型下的信道误比特性能和数据包丢失性能。此模型能够适用于链路层以及高层通信协议。     

A lagrangean relaxation algorithm for the constrained matrix problem

We present variants of a convergent Lagrangean relaxation algorithm for minimizing a strictly convex separable quadratic function over a transportation polytope. The algorithm alternately solves two “subproblems,” each of which has an objective function that is defined by using Lagrange multipliers derived from the other. Motivated by the natural separation of the subproblems into independent and very easily solved “subsubproblems,” the algorithm can be interpreted as the cyclic coordinate ascent method applied to the dual problem. We exhibit our computational results for different implementations of the algorithm applied to a set of large constrained matrix problems.     

二维粒子模拟的多时标法

将多时标法应用于二维激光等离子体全电磁相对论粒子模拟程序中,对共振吸收及相关的物理现象进行了模拟计算,既正确地描述了等离子体的动力学行为,又大大节省了计算时间。     

A game theoretic approach to a two firm bidding problem

In this paper a model is developed for determining optimal strategies for two competing firms which are about to submit sealed tender bids on K contracts. A contract calls for the winning firm to supply a specific amount of a commodity at the bid price. By the same token, the production of that commodity involves various amounts of N different resources which each firm possesses in limited quantities. It is assumed that the same two firms bid on each contract and that each wants to determine a bidding strategy which will maximize its profits subject to the constraint that the firm must be able to produce the amount of products required to meet the contracts it wins. This bidding model is formulated as a sequence of bimatrix games coupled together by N resource constraints. Since the firms' strategy spaces are intertwined, the usual quadratic programming methods cannot be used to determine equilibrium strategies. In lieu of this a number of theorems are given which partially characterize such strategies. For the single resource problem techniques are developed for determining equilibrium strategies. In the multiple resource problem similar methods yield subequilibrium strategies or strategies that are equilibrium from at least one firm's point of view.     

Efficient computational devices for the capacitated transportation problem

This paper presents the details for applying and specializing the work of Ellis Johnson [10] and [11] to develop a primal code for the well-known capacitated transportation problem. The code was developed directly from the work of Johnson, but is similar to codes developed by Glover, Karney, Klingman, and Napier [6] and Srinivasan and Thompson [14]. The emphasis in the presentation is the use of the graphical representation of the basis to carry out the revised simplex operations. This is a means of exploiting the special structure and sparseness of the constraint matrix to minimize computational effort and storage requirements. We also present the results of solving several large problems with the code developed.     

Bounds on the availability function

This paper gives bounds on the availability function for an alternating renewal process with exponential failure and general repair times. A bound on the error is also given. Several of the bounds with greatest practical consequence are worked out and illustrated. Repair distributions for which a lower bound on availability is easily computed are gamma (integer shape parameter), log normal, and Weibull. Finally, some simulation results for log normal repair versus gamma repair are given.