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.     

Essentially Non-Oscillatory插值的分析与方法

在科学研究与工程计算中对插值的分析与方法理论已有很重要的应用,而对于ENO插值的方法与理论在大多教科书中却很少涉及,本文介绍ENO插值的应用及算法,为大学生们学习数值分析中的插值计算提供参考。     

基于粗糙集理论的加权排序法及其应用

针对粗糙集理论在有限个方案的多目标决策问题应用中存在的缺陷,提出了一种新的加权排序法,该方法既吸取了粗糙集约简属性的优点,又考虑到了各属性间的相对重要性,使得决策过程更符合实际情况.最后给出了该种排序法在武器装备系统论证中的应用,取得了较好的效果.     

A generalization of the weighted set covering problem

We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect b‐matching problem. In general, we may use a polynomial‐time greedy heuristic similar to the one for the classical weighted set covering problem studied by D.S. Johnson [Approximation algorithms for combinatorial problems, J Comput Syst Sci 9 (1974), 256–278], L. Lovasz [On the ratio of optimal integral and fractional covers, Discrete Math 13 (1975), 383–390], and V. Chvatal [A greedy heuristic for the set‐covering problem, Math Oper Res 4(3) (1979), 233–235] to get an approximate solution for the problem. We find a worst‐case bound for the heuristic similar to that for the classical problem. In addition, we introduce a general type of probability distribution for the population of the problem instances and prove that the greedy heuristic is asymptotically optimal for instances drawn from such a distribution. We also conduct computational studies to compare solutions resulting from running the heuristic and from running the commercial integer programming solver CPLEX on problem instances drawn from a more specific type of distribution. The results clearly exemplify benefits of using the greedy heuristic when problem instances are large. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

论唯物史观的价值内涵

马克思的唯物史观作为一种理解与把握社会历史本质、社会历史现象的根本方法,既包含着对社会历史发展的客观必然性的理解,具有科学性的特征,也包含着人类社会自身的价值取向,贯穿着一定的价值理想与价值追求。     

基于理想点的指挥自动化系统不确定多属性效能评估

针对防空旅(团)指挥自动化系统效能评估中,其属性权重完全未知或只知大致范围的特点,给出2种基于理想点的不确定多属性效能评估模型,通过对模型的求解,可获得属性权重,进而对这种不确定性系统效能进行评估.该模型符合防空指挥自动化系统效能复杂性和人们思维的模糊性,为解决此类问题提供了新的途径和方法.实例证明,该模型简单有效.     

一类m-点边值问题的正解

研究一类二阶m-点边值问题u″ f(t,u,u)′=0,00,i=1,…,m-2,ζi满足0=ζ0<ζ1<ζ2<…<ζm-2<ζm-1=1和i∑=1aiζi<1。应用推广的Krasnosel-skii′s不动点定理,给出了上述边值问题至少存在一个正解的充分条件。     

j不变量等于1728的GLS椭圆曲线上四维

为了实现椭圆曲线的快速倍乘,Gallant-Lamber-Vanstone( GLV)方法被推广到四维的一般情形.文章中回答了Galbraith,Lin和Scott(J.Cryptol.DOI:10.1007/s00145 - 010 - 9065-y)提出的一个公开问题:研究Fp2上j不变量等于1728的GLS椭圆曲线上的四维GLV方法,并给出时间周期.尤其指出GLV的四维分解能够在很大的概率上实现,给出了一些结果和例子.特别指出在同一类曲线上,四维GLV方法的时间周期大概是二维GLV方法的70％～ 73％.     

航空燃料冰点快速测定方法

冰点是表征航空燃料低温使用性能的重要指标。常规冰点测定方法操作步骤复杂,测定时间长,影响航空燃料质量检测效率。基于光散射原理,将温度传感和光电检测技术应用于航空燃料冰点测定,利用燃料结晶对光散射和透射的影响,实现航空燃料冰点快速测定。该方法操作简单快速,检测1个油样用时少于15 min,大幅提高了冰点检测效率;试样体积仅需2 mL,有利于试验环境保护;测定结果重复性好,与标准方法 GB/T2430—2008具有良好的相关性。     

A mathematical programming approach for improving the robustness of least sum of absolute deviations regression

This paper discusses a novel application of mathematical programming techniques to a regression problem. While least squares regression techniques have been used for a long time, it is known that their robustness properties are not desirable. Specifically, the estimators are known to be too sensitive to data contamination. In this paper we examine regressions based on Least‐sum of Absolute Deviations (LAD) and show that the robustness of the estimator can be improved significantly through a judicious choice of weights. The problem of finding optimum weights is formulated as a nonlinear mixed integer program, which is too difficult to solve exactly in general. We demonstrate that our problem is equivalent to a mathematical program with a single functional constraint resembling the knapsack problem and then solve it for a special case. We then generalize this solution to general regression designs. Furthermore, we provide an efficient algorithm to solve the general nonlinear, mixed integer programming problem when the number of predictors is small. We show the efficacy of the weighted LAD estimator using numerical examples. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006