分布式实时网络半实物仿真方法研究

介绍了基于分布式实时网络的复合寻的制导武器半实物仿真试验环境建立的基本方法,对其工作原理、主要设备和技术进行了分析。     

高可靠性软件的极值统计分析

提出了极值统计分析的方法.对于失效数据极值分布函数的拟合检验,采用了相关系数法;对于母体分布的参数估计,则分别采用了最小二乘估计(LSE)和极大似然估计(MLE);最后通过一个实例说明了统计过程,并用模拟的方法证明了最小二乘估计较好.     

延迟时间模型参数的极大似然估计

介绍了基于客观数据的延迟时间模型参数极大似然估计方法,提出了应用优化理论中的单纯形法求解似然函数的算法,为延迟时间模型的参数估计问题提供了可行的解决方法。通过计算机模拟数据的验证,此方法切实可行,结果可以满足需要。     

一种评价发动机实际技术状况的方法

通过系统的实验,建立了某一型号发动机对应于不同使用时间的空载减速时间数据库,然后在未知某同类型发动机实际使用时间的情况下,通过测取此发动机的空载减速时间,能较正确的评价此发动机的实际技术状况.     

基于时间序列预测的独立分量排序

独立分量排序是独立分量分析的热点问题,是提高特征空间鲁棒性和减少计算复杂度的必要前提。结合ICA在时间序列预测的应用,给出了基于一阶差分和最小方差误差的多分量联合重构预测排序准则。为了避免联合优化中出现的海量计算问题,提出了添加-测试-接受机制(ATA)的次优搜索方法。实验结果表明,和传统排序方法比较,新方法具有优异的预测能力和搜索效率。     

Multiple subset sum with inclusive assignment set restrictions

In a traditional multiple subset sum problem (MSSP), there is a given set of items and a given set of bins (or knapsacks) with identical capacities. The objective is to select a subset of the items and pack them into the bins such that the total weight of the selected items is maximized. However, in many applications of the MSSP, the bins have assignment restrictions. In this article, we study the subset sum problem with inclusive assignment set restrictions, in which the assignment set of one item (i.e., the set of bins that the item may be assigned to) must be either a subset or a superset of the assignment set of another item. We develop an efficient 0.6492‐approximation algorithm and test its effectiveness via computational experiments. We also develop a polynomial time approximation scheme for this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Production‐inventory systems with imperfect advance demand information and updating

We consider a supplier with finite production capacity and stochastic production times. Customers provide advance demand information (ADI) to the supplier by announcing orders ahead of their due dates. However, this information is not perfect, and customers may request an order be fulfilled prior to or later than the expected due date. Customers update the status of their orders, but the time between consecutive updates is random. We formulate the production‐control problem as a continuous‐time Markov decision process and prove there is an optimal state‐dependent base‐stock policy, where the base‐stock levels depend upon the numbers of orders at various stages of update. In addition, we derive results on the sensitivity of the state‐dependent base‐stock levels to the number of orders in each stage of update. In a numerical study, we examine the benefit of ADI, and find that it is most valuable to the supplier when the time between updates is moderate. We also consider the impact of holding and backorder costs, numbers of updates, and the fraction of customers that provide ADI. In addition, we find that while ADI is always beneficial to the supplier, this may not be the case for the customers who provide the ADI. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

一种基于球坐标系的四站三维时差定位算法

提出了一种在球坐标系下的无源时差定位算法,该算法解决了参变量法中难于解决的模糊和无解问题,计算量小,定位结果可信。当布站接近平面时,本算法可独立进行定位,当站址高度差较大时本算法可以与参变量法相配合解决模糊和无解问题,适合于工程应用。     

无源雷达菱形布站的定位精度分析

为了得到无源雷达菱形布站的最佳布站方案,分析了时差定位算法的基本原理,推导了定位精度的数学模型,考虑了影响定位精度的各种因素。通过计算机仿真实验对比了在不同主站位置、不同站间距离以及不同主站高度的情况下菱形布站的GDOP(geometric d ilution of precision)等值线分布,最终得出了定位精度与布站之间的联系,为无源雷达最优菱形布站提供了理论依据。     

末制导炮弹射表参数程控时间的研究

末制导炮弹属于制导武器,正是由于程控时间和激光开机时间的存在(需要人为给定)致使其弹道比较复杂.程控时间体现为惯性制导的开始,激光开机时间体现为激光末制导的开始,这两种制导的实现都是通过舵片的偏转来实现.从射表编拟的角度出发,通过仿真研究程控时间对末制导炮弹弹道参数的影响,给出了程控时间确定的一些原则,为编制高精度的射...