A method to determine the shell layout scheme for equipment battlefield damage tests under artillery fire

In this paper,a new method for determining the shell layout scheme is proposed,which can make the equipment damage data by the battlefield damage test resemble as close as possible the actual combat data.This method is based on the analysis of the impact point distribution and effective damage area of equipment.In order to obtain the position of the impact points,an impact point distribution model under artillery fire was established.Similarly,in order to obtain the effective damage area of equipment,the concepts of generalized damage area and task-based equipment functional damage probability were demonstrated,and the corresponding calculation model was established.Through case analysis,the shell layout scheme was effectively obtained,verifying the correctness of the proposed method.     

多维六角形节块动力学程序系统的开发及验证

以多维六角形节块中子动力学程序HENKO的理论模型为基础,研制成功六角形组件的反应堆多维瞬态分析程序系统,提出了一种处理控制棒尖点问题的方法.通过VVER一号国际基准问题的验算,验证了本程序的正确性.     

农学专业教学生产实习问题探讨

农学专业是一门实践性非常强的专业,其中教学生产实习是专业教育过程中极为重要的环节,其成败直接影响农学专业学生的综合能力和水平。经过多年指导农学专业教学生产实习的实践,现就农学专业教学生产实习的特点和在新时期下存在的主要问题进行分析,并提出相应的改革措施。     

回归型支持向量机的机翼结冰冰型预测

飞机结冰严重威胁着飞行安全。针对机翼结冰冰型预测时不确定性因素较多、难以准确预测的问题,提出了一种基于回归型支持向量机的机翼结冰冰型预测方法。在建立冰型模型的基础上,利用回归型支持向量机(Support Vector Regression,SVR)获得冰型多项式系数,从而预测出相关飞行条件和大气条件下的冰型。仿真结果表明,该方法具有较好的预测能力,可以及时提供可靠的结冰信息,为保证结冰条件下的飞行安全提供了保障。     

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     

综合系统多重递阶控制设计方法研究(一)空-空航炮的机身指向火控解算方法

为了满足综合系统多重递阶控制设计方法的需求,建立了空-空航炮的机身指向火控解算方法.该方法是在期望弹丸命中目标的情况下求解机身期望指向及其变化率.在某验证机的控制增稳系统上,采用所建立的火控解算方法以及综合系统多重递阶控制设计方法,设计了综合飞行/火力控制系统.仿真结果表明,所建立的空-空航炮机身指向火控解算方法较好地满足了综合飞行/火力控制系统的设计需求,获得了良好的综合控制系统动态性能.     

一维热构件模型及其在船用核动力装置运行分析中的应用

建立了一维热构件模型 ,该模型具有广泛的适用性 ,可以模拟是否有内热源、不同几何形状及具有多种边界条件的热构件 .方程采用隐式有限差分法求解热传导方程 ,并将模型应用于核动力装置的运行分析中 .计算结果表明 ,本文所建立的一维热构件模型能逼真地描述一维热构件的温度场分布 ,计算精度高 .     

一维热构件模型及其在船用核动力装置

建立了一雏热构件模型,该模型具有广泛的适用性,可以模拟是否有内热源、不同几何形状及具有多种边界条件的热构件．方程采用隐式有限差分法求解热传导方程,并将模型应用于核动力装置的运行分析中．计算结果表明,本文所建立的一维热构件模型能逼真地描述一雏热构件的温度场分布,计算精度高．     

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     

Minimizing total completion time in two-processor task systems with prespecified processor allocations

We consider the problem of scheduling multiprocessor tasks with prespecified processor allocations to minimize the total completion time. The complexity of both preemptive and nonpreemptive cases of the two-processor problem are studied. We show that the preemptive case is solvable in O(n log n) time. In the nonpreemptive case, we prove that the problem is NP-hard in the strong sense, which answers an open question mentioned in Hoogeveen, van de Velde, and Veltman (1994). An efficient heuristic is also developed for this case. The relative error of this heuristic is at most 100%. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 231–242, 1998