新型舰炮武器情报指挥系统模拟试验方法

在简要介绍模拟试验系统及搜索雷达模拟器功能和工作原理的基础上,针对某型近程反导舰炮武器情报指挥系统,提出了包括模拟试验流程、仿真数学模型及评估方法的一套模拟试验方法,弥补了单一外场试验考核不充分的不足,达到了全面科学评价被试系统的目的。该模拟方法是外场试验的补充和完善,开拓了靶场试验的新思路。     

HLA在C3I系统仿真试验中的应用

采用系统仿真结合实装试验的方法构建仿真试验环境,是实现对C3I系统全面而系统的评估的必要手段.而这种与实装结合的仿真试验环境如何构建,采用什么样的体系结构是目前迫切需要解决的问题.在总结C3I系统仿真试验的特点以及高层体系结构(LHA)主要思想的基础上,提出了基于HLA的C3I系统仿真试验环境建设方法,为C3I系统试验的实施提供了一种新思路.     

基于最小误差模型估计的地空导弹飞行试验数据相容性检验

提出了基于递推最小模型误差估计(RMMEE)的地空导弹飞行试验数据相容性检验的方法,该方法采用导弹位置和弹体角位移测量,不仅能在线重构六自由度弹道参数,而且能估计捷联惯导的动态误差,从根本上克服了Klein模型的局限性。该方法对导弹速度、位置估值的初值不敏感,即使存在较大的捷联惯导动态误差,仍具有良好的收敛性和稳健性。     

指数型产品可靠性验收试验的一种贝叶斯方法

采用贝叶斯方法 ,利用大量的历史数据和工程技术人员的丰富经验确定先验分布 ,制定出验收试验的一种新方案 .按照这一方案 ,在确保产品质量的前提下 ,可大大节省试验时间 ,从而得到十分可观的经济效益 .     

小型直流发电机输出特性自动测试系统

提出了一种基于PC机的小型直流发电机输出特性自动测试系统 ,该系统利用直流变送器测量发电机输出功率 ,并给出了试验结果。     

随机相位信号检测模型及其在移动通信保密系统中的应用

通过对随机相位信号检测模型的分析 ,介绍了一种基于该检测模型的对于经FSK调制的随机相位信号的检测方法 ,并阐述了该方法在一种蜂窝式移动通信保密系统中的应用     

Minimizing makespan on a single batch processing machine with nonidentical job sizes

We deal with the problem of minimizing makespan on a single batch processing machine. In this problem, each job has both processing time and size (capacity requirement). The batch processing machine can process a number of jobs simultaneously as long as the total size of these jobs being processed does not exceed the machine capacity. The processing time of a batch is just the processing time of the longest job in the batch. An approximation algorithm with worst‐case ratio 3/2 is given for the version where the processing times of large jobs (with sizes greater than 1/2) are not less than those of small jobs (with sizes not greater than 1/2). This result is the best possible unless P = NP. For the general case, we propose an approximation algorithm with worst‐case ratio 7/4. A number of heuristics by Uzosy are also analyzed and compared. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 226–240, 2001     

Case‐based reasoning and improved adaptive search for project scheduling

Most scheduling problems are notoriously intractable, so the majority of algorithms for them are heuristic in nature. Priority rule‐based methods still constitute the most important class of these heuristics. Of these, in turn, parametrized biased random sampling methods have attracted particular interest, due to the fact that they outperform all other priority rule‐based methods known. Yet, even the “best” such algorithms are unable to relate to the full range of instances of a problem: Usually there will exist instances on which other algorithms do better. We maintain that asking for the one best algorithm for a problem may be asking too much. The recently proposed concept of control schemes, which refers to algorithmic schemes allowing to steer parametrized algorithms, opens up ways to refine existing algorithms in this regard and improve their effectiveness considerably. We extend this approach by integrating heuristics and case‐based reasoning (CBR), an approach that has been successfully used in artificial intelligence applications. Using the resource‐constrained project scheduling problem as a vehicle, we describe how to devise such a CBR system, systematically analyzing the effect of several criteria on algorithmic performance. Extensive computational results validate the efficacy of our approach and reveal a performance similar or close to state‐of‐the‐art heuristics. In addition, the analysis undertaken provides new insight into the behaviour of a wide class of scheduling heuristics. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 201–222, 2000     

地(舰)空导弹测试系统维修性设计的实践与思考

导弹测试系统是由多种设备组合而成,其功能是对导弹进行综合测试。导弹测试系统是多次反复使用的设备,维修性是其重要设计指标之一。从导弹测试系统维修性设计指标要求出发,就导弹测试系统维修性设计的有关问题进行论述,提出了设计中应重视的问题。     

Scheduling parallel machines with inclusive processing set restrictions and job rejection

In this article, we study a parallel machine scheduling problem with inclusive processing set restrictions and the option of job rejection. In the problem, each job is compatible to a subset of machines, and machines are linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process (but not conversely). To achieve a tight production due date, some of the jobs might be rejected at certain penalty. We first study the problem of minimizing the makespan of all accepted jobs plus the total penalty cost of all rejected jobs, where we develop a ‐approximation algorithm with a time complexity of . We then study two bicriteria variants of the problem. For the variant problem of minimizing the makespan subject to a given bound on the total rejection cost, we develop a ‐approximation algorithm with a time complexity of . For the variant problem of maximizing the total rejection cost of the accepted jobs subject to a given bound on the makespan, we present a 0.5‐approximation algorithm with a time complexity of . © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 667–681, 2017