防空导弹飞行试验的引战配合性能分析方法

提出了一种对防空导弹的引战配合性能进行量化评价的方法。利用飞行试验数据对导弹目标交会及战斗部杀伤目标过程进行了仿真。     

武器系统经济性参数的支持向量机方法分析

采用一种基于支持向量机的武器系统费用分析方法.计算结果表明,这种方法有效解决了参数法对样本量要求较高以及对非线性问题处理能力较弱等问题.与传统方法相比较,有更好的拟合精度和泛化能力,因而该方法可以作为研究此类问题的新途径.     

软件无失效测试数据的统计分析

软件可靠性估计是软件可靠性研究的重要问题之一,文中对分布式软件系统可靠性的评估方法进行了研究,给出了软件系统可靠度的最优置信下限.最后以某大型软件的评估为例,说明该方法的应用.     

基于机器翻译的原型句蜕及其包装研究

首先简要介绍了HNC理论及其机器翻译观,结合机器翻译的难点与原型句蜕存在的普遍性,说明了解决原型句蜕变换的意义:接着对原型句蜕构成现象进行了描述,从汉英语义块构成对比分析中导出了汉英变换规则;从现有的机器翻译系统所暴露的问题中,说明原型句蜕变换对提高机器翻译质量的必要性和可行性;最后是对本文的结论和说明。     

Designing a screening experiment for highly reliable products

Within a reasonable life‐testing time, how to improve the reliability of highly reliable products is one of the great challenges to today's manufacturers. By using a resolution III experiment together with degradation test, Tseng, Hamada, and Chiao (1995) presented an interesting case study of improving the reliability of fluorescent lamps. However, in conducting such an experiment, they did not address the problem of how to choose the optimal settings of variables, such as sample size, inspection frequency, and termination time for each run, which are influential to the correct identification of significant factors and the experimental cost. Assuming that the product's degradation paths satisfy Wiener processes, this paper proposes a systematic approach to the aforementioned problem. First, an intuitively appealing identification rule is proposed. Next, under the constraints of a minimum probability of correct decision and a maximum probability of incorrect decision of the proposed identification rule, the optimum test plan (including the determinations of inspection frequency, sample size, and termination time for each run) can be obtained by minimizing the total experimental cost. An example is provided to illustrate the proposed method. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 514–526, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10024     

Two‐stage component test plans for testing the reliability of a series system

A system reliability is often evaluated by individual tests of components that constitute the system. These component test plans have advantages over complete system based tests in terms of time and cost. In this paper, we consider the series system with n components, where the lifetime of the i‐th component follows exponential distribution with parameter λ_i. Assuming test costs for the components are different, we develop an efficient algorithm to design a two‐stage component test plan that satisfies the usual probability requirements on the system reliability and in addition minimizes the maximum expected cost. For the case of prior information in the form of upper bounds on λ_i's, we use the genetic algorithm to solve the associated optimization problems which are otherwise difficult to solve using mathematical programming techniques. The two‐stage component test plans are cost effective compared to single‐stage plans developed by Rajgopal and Mazumdar. We demonstrate through several numerical examples that our approach has the potential to reduce the overall testing costs significantly. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 95–116, 2002; DOI 10.1002/nav.1051     

舰船动力发展的方向——综合电力系统

论述了舰船综合电力系统的概念及研究意义,指出综合电力系统是舰船动力发展的新方向;介绍了国内外舰船综合电力系统的研究现状和前沿动态,探讨了舰船综合电力系统需攻克的关键技术,提出了我国发展舰船综合电力系统的对策.     

雷电回击地面水平电场的解析求解

假定大地为良导电平面 ,基于DU模型计算了雷电回击地面电磁场 ,并探讨了地面水平电场的求解。对于雷电回击水平电场的两种近似求解方法———大地表面阻抗法和斜波法 ,进行了解析推导 ,并从数学上证明了两种方法在远区场的等价法。     

机械设计系列课程教改对比试验情况分析

简述了机械设计系列课程教学改革的主要思想,给出了教改教学实践环节中对比试验的具体内容。通过重点分析对比试验的量化指标,对教改进行了阶段总结,归纳了教改的若干经验,提出了存在的问题并分析了原因。     

Scheduling jobs with piecewise linear decreasing processing times

We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003