吊放声纳非探测时间的计算公式

使用吊放声纳探测潜艇是直升机反潜的主要样式。在评价直升机跟踪潜艇和潜艇规避其跟踪的方法中,吊放声纳非探测时间是最主要的参数。此外给出了计算非探测时间的公式。     

数据融合技术与潜艇指控系统的发展

就潜艇指控系统的现状和发展,综述了数据融合技术在潜艇指控系统中的应用前景。     

内可逆卡诺热泵的生态学优化性能

本文导出了内可逆卡诺热泵的供热量、供热率和供热系数的耗散量,以反映热泵供热率π与其耗散φ_cT_Lσ,即热泵熵产率σ、低温热源温度T_L和可逆供热系数φ_c乘积之间最佳折衷的“生态学”性能E=π-φ_cT_Lσ为目标,基于牛顿和线性唯象传热定律,研究内可逆卡诺热泵的优化问题,得到最大E性能时的供热系数界限及相应的供热率和熵产率。     

C~3I系统中的哨所通讯网

本文提供了在C~3I系统中哨所通讯网的可行组网方案,从理论上分析了组网实践过程的各种因素。介绍了用信息机实现莫尔斯报务通讯中的困难和解决方法,并对如何提高报传通讯速率提出了探讨性意见。     

Q∝T~n时不可逆卡诺热泵的最优性能

非线性传热条件下的内可逆卡诺热机最优性能有了一些讨论,本文将导出不可逆卡诺热泵工作于非线性传热 Q■条件下,最佳供热系数д与泵热率π的关系。据此可确定任意泵热率时所对应的供热系数界限。最后,讨论了这一关系的一些应用,所得结果包含了经典热力学及内可逆线性传热情况下的有关结论,为实际热泵设计提供新的理论依据。     

Designing a degradation experiment

Degradation experiments are widely used to assess the reliability of highly reliable products which are not likely to fail under the traditional life tests. In order to conduct a degradation experiment efficiently, several factors, such as the inspection frequency, the sample size, and the termination time, need to be considered carefully. These factors not only affect the experimental cost, but also affect the precision of the estimate of a product's lifetime. In this paper, we deal with the optimal design of a degradation experiment. Under the constraint that the total experimental cost does not exceed a predetermined budget, the optimal decision variables are solved by minimizing the variance of the estimated 100pth percentile of the lifetime distribution of the product. An example is provided to illustrate the proposed method. Finally, a simulation study is conducted to investigate the robustness of this proposed method. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 689–706, 1999     

舰载火箭子母弹最优火力分配

舰载火箭子母弹对岸上目标实施火力压制射击时,火力分配方式直接影响毁伤效果和火力支援任务的完成.针对舰载火箭子母弹的射击特点,首先分析了海上射击误差,然后探讨了集群目标的简化处理方法,最后给出了最优火力分配时表尺差计算公式,并进行了举例分析.利用最优火力分配方法来计算舰载火箭子母弹效力射表尺差,避免了指挥员战场射击指挥的盲目性,可以在相同弹药消耗量情况下取得最佳射击效果,对未来舰载火箭子母弹的火力运用具有较高的现实意义.     

信息管理误失灰色补偿方法

在信息采集、信息管理、信息传递过程中,数据链出现空穴、误传或丢失等情况时,将影响信息采集传递的安全性与信息管理的有效性,是信息管理与使用中一个值得关注的问题,如何对数据列进行有效补偿则是解决该问题的关键.运用灰色理论与正交试验设计方法建立了信息链缺失补偿模型并给出了信息链空穴补偿优化准则.所给出的具体的补偿实例说明信息链空穴灰色生成与正交试验设计生成是一种极为有效的信息缺失补偿方法.     

Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem

Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well‐known NP‐hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optimality of the sequence within the framework of probabilistic analysis. Our main result is that, when the processing times are randomly and independently drawn from the same uniform distribution, the sequence is asymptotically optimal in the sense that its relative error converges to zero in probability as n increases. Other theoretical results are also derived, including: (i) When the processing times follow a symmetric structure, the problem has 2^{⌊(n−1)/2⌋} optimal sequences, which include our proposed sequence and other heuristic sequences suggested in the literature; and (ii) when these 2^{⌊(n−1)/2⌋} sequences are used as approximate solutions for a general problem, our proposed sequence yields the best approximation (in an average sense) while another sequence, which is commonly believed to be a good approximation in the literature, is interestingly the worst. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 373–398, 1999     

Single machine sequencing with linear models of release dates

The paper deals with a problem of scheduling a set of jobs on a single machine. Before a job is released for processing, it must undergo some preprocessing treatment that consumes resources. It is assumed that the release date of a job is a linear decreasing continuous function of the amount of a locally and globally constrained, continuously divisible resource (e.g., energy, catalyzer, financial outlay, gas). The problem is to find a sequence of jobs and a resource allocation that will minimize the maximum job completion time. Such a problem appears, for example, in the ingot preheating and hot-rolling process in steel mills. It is shown that the problem is strongly NP-hard. Some polynomially solvable cases of the problem and approximate algorithms with both experimental and worst-case analysis are presented. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 99–113, 1998