RBF网络用于战车火控系统弹道解算的方法

弹道解算问题对战车火控系统的性能有着直接的影响.传统的弹道解算方法在精度和实时性方面都存在一定的局限性.为了提高解算精度、战车首发命中率和解算的实时性,基于RBF网络的函数逼近及预测能力,将RBF网络用于弹道解算,对传统算法进行优化,得到了新的弹道解算方法.最后对所提方法进行了仿真,发现新方法在解算精度没有降低的条件下,大大提高了弹道解算的实时性.     

电磁信息泄漏研究及进展

分析了电磁信息泄漏的机理,介绍了电磁信息泄漏的发展历史和趋势,阐述了电磁信息泄漏的基本概念和主要研究内容。针对P89C668单片机实现的DES密码系统,采用差分电磁分析的方法对其进行密码破译实验,获得了DES第16轮48 bit子密钥。     

基于模糊灰关联分析的通信网运行可靠性评估

基于模糊灰关联度理论 ,提出了通信网运行可靠性评估的方法 .通过实例验证 ,该方法有效 .     

二轴晶外锥折射的理论分析

从晶体的简正模方程出发,求得在二轴晶体中,当光线沿第二类光轴（光线轴）方向行进时,所对应的电场矢量和电位移矢量,并通过几何证明,验证所有折射光线在晶体内均在同一锥面上。     

A linear-programming-based method for determining whether or not n demand points are on a hemisphere

Whenever n demand points are located on a hemisphere, spherical location problems can be solved easily using geometrical methods or mathematical programming. A method based on a linear programming formulation with four constraints is presented to determine whether n demand points are on a hemisphere. The formulation is derived from a modified minimax spherical location problem whose Karush-Kuhn-Tucker conditions are the constraints of the linear program. © 1993 John Wiley & Sons, Inc.     

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.     

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.