多面函数内插数学模型生成虚拟地形的可视化研究

通过对多面函数内插数学模型的分析和研究,利用搜索圆和搜索正方形两种数据点的搜索方法,运用C#语言和OpenGL动态连接库将采集的离散点生成DEM数据,实现了由二维平面上的等高线到三维虚拟地形的可视化,并对可视化效果进行比较和分析.由可视化结果表明此算法速度快且效果好.此研究成果对虚拟战场环境的生成有一定参考价值.     

一种模拟退火伪并行遗传算法

借鉴模拟退火算法的局部搜索能力,结合并行计算的思想设计了一种采用模拟退火机制的实数编码自适应交叉、全概率变异伪并行遗传算法,最后用这种方法对典型的多峰值函数求极值,并和基本遗传算法进行比较,结果表明:该算法具有较强的全局搜索能力和局部搜索能力,能够更有效地克服早熟收敛问题。     

机载相控阵雷达搜索模式辐射能量控制方法

机载相控阵雷达过高的辐射能量威胁了战斗机的生存能力。为了减少相控阵雷达搜索模式辐射能量,提出了基于辐射能量控制的搜索模型。将总能量消耗函数和检测概率相对误差作为目标函数,以平均功率、波束宽度、积累脉冲数以及脉冲重复间隔作为优化变量,选取非支配遗传排序算法对此模型进行优化。仿真结果表明,在同样检测概率情况下,提出的搜索方法可以有效控制雷达辐射能量,具有更好的射频隐身性能。     

实时仿真中的函数生成

数据表的多变量函数计算往往构成了与动力系统仿真相关联的整个计算要求的一个主要部分。本文讨论了一种使用脱机计算制定在联机实时计算期间执行速度更快的修正数据表的新方法。文中有两个实际例子:六自由度的导弹仿真程序和六自由度的飞行仿真程序,都用来说明这种新方法。在这种新方法中,运行程序的时间分别减少19％和11％。     

基于扩展时空距离度量的连续k近邻查询方法

针对基于TPR树索引的连续k近邻查询,引入了一种新的时空距离度量最小最大距离函数作为TPR树索引搜索时节点剪枝上界。提出了一种采用最优优先策略的基于扩展时空距离度量的连续k近邻查询STM-CNN算法,利用最小距离函数进行TPR树索引节点搜索时访问排序,并使用最小最大距离函数对TPR树索引进行剪枝界定。     

相空间有限元方法在解二维中子输运方程中的应用

本文采用相空间有限元方法求解了柱形临界多群中子输运问题。其中对于方程中的坐标变量用分片连续线性多项式作为试探函数,对于方程中的角度变量用分片连续双线性多项式作为试探函数。整个求解空间区域和角度区域分别采用三角形和矩形单元划分,然后利用迦辽金方法得到一个以网格点处角通量为未知数的线性联立代数方程组,方程组中的系数矩阵的存储采用了压缩存储技术。最后用高斯消元法解此有限元方程组,表明相空间有限元方法计算收敛性较好、计算精度高。     

均匀分布集群目标射击火力分配优化数值仿真方法

基于所提出的火力分配方案,使用数值积分方法将对均匀分布集群目标射击的火力分配优化问题转化为由多变量初等函数表示的积分和函数在单位多面正方体内的最小值求解问题,火力分配优化的瞄准点坐标可以尝试利用成熟的Matlab优化计算软件来直接求解,算例说明所给出方法对于火力分配优化问题的深入研究是有裨益的.     

无源雷达截获概率建模与窗口变量影响仿真

在截获概率概念和截获条件的基础上,综合时域、空域、频域等窗口函数构建截获概率模型,分别建立截获过程的4个窗口函数子模型,研究截获概率与窗口函数变量的影响关系。以SPS-48雷达为辐射源,仿真分析各窗口函数变量对截获概率的影响程度,讨论分区策略下无源雷达参数优化对截获概率的影响并总结截获概率提高方法,为无源雷达设计、研制、试验以及使用提供技术支撑。     

信任函数理论在仿真评估中的应用

将信任函数理论应用到了仿真结果评估问题中,给出了总体仿真结果的信任函数和信念区间的计算方法。对仿真结果的真实性评估具有一定意义。这种思想和算法可推广应用到其它各种不确定性推理决策问题中去。     

基于分布搜索的传感器指示交接协商机制

针对传感器指示交接技术中"指示任务怎样执行"的问题,根据指示交接的实际过程,研究了多传感器针对多个协作任务怎样进行更好调度的问题,提出了基于分布搜索的多维协商机制。通过协商函数的迭代更新,不断寻找综合效用最大的传感器调度策略,优化了指示交接过程中多传感器多任务调度过程。实例仿真结果表明,所提方法合理、有效,提高了传感器协作的效率,为指示交接的深入研究奠定了基础。     

分段函数在分界点求导的一种简单的方法

介绍了用多项式根的性质与导数极限定理求分段函数在分界点的导数的简单方法。从而拓广了用导数定义求分界点导数的传统方法     

Control of entry to a nonstationary queuing system

In this article the control of entry of customers to a queuing system with s servers is considered. It is assumed that the arrivals form a nonstationary Poisson process with a periodic rate. The service times are assumed to be exponentially distributed with a parameter independent of time. The cost structure considered is the same as that of Naor. It is demonstrated numerically that, like the stationary cases, the average expected benefit of customers per unit of time is a unimodal function of the critical point. And, also, the social critical point is smaller than the individual critical point. These suggest the use of a search technique for finding the social critical point. The results show successful application of the discrete version of the Fibonacci search.     

Weapon effectiveness and the shapes of damage functions

This paper provides a review of methods of assessing a fragmentation weapon's effectiveness against a point target or an area target with keeping the focus on the necessity of using the Carleton damage function with the correct shape factor.First,cookie-cutter damage functions are redefined to preserve the shape factor of and to have the same lethal area as the corresponding Carleton damage function.Then,closed-form solutions of the effectiveness methods are obtained by using those cookie-cutter damage functions and the Carleton damage function.Finally,the closed-form solutions are applied to calculate the probability of damaging a point target and the expected fractional damage to an area target for several attack scenarios by using cookie-cutter damage functions and the Carleton damage functions with different shape factors.The comparison of the calculation results shows that using cookie-cutter damage functions or the Carleton damage function with a wrong shape factor results in quite signifi-cant differences from using the original Carleton damage function with a correct shape factor when weapon's delivery error deviations are less than or comparable to the lengths of the lethal area and the aim point is far from a target.The effectiveness methods improved in this paper will be useful for mission planning utilizing the precision-guided munitions in circumstances where the collateral damage should be reduced.     

An efficient cyclic coordinate method for optimizing penalty functions

In this study, a simple and efficient cyclic coordinate search procedure is used to optimize penalty functions. Since the contours of the penalty function are very ill-behaved, an accurate line search is very difficult to achieve. Due to accumulated errors in line search, this makes “simple-minded” search directions just as good as more sophisticated directions, and actually better since they require a smaller effort per iteration. Of course this is only true if the search procedure is able to “ride” along steep ridges, and meanwhile move an appreciable distance towards the optimal, if at all possible. Computational results on the cyclic coordinate method seems to support this point of view, and shows robustness, reliability, and efficiency of the method.     

自航式鱼雷发射装置发射管长度优化研究

基于某型鱼雷自航发射的内弹道数学模型,选择自航管的总长度作为优化目标,讨论了约束函数的取值,确定了优化问题的数学表达.采用惩罚函数法进行寻优计算,针对约束函数具有不可微和非线性的特点,采用模式搜索算法进行了无约束优化的求解,给出了优化结果并进行了比较.     

“大”与“小”语法功能上的差异性

“大”与“小”作为一对反义词 ,其语法功能在多数情况下是相同的 ,具有对称性。但两者在语法功能上存在差异性 ,即在有些情况下 ,两者的使用并不对称。本文试把“大”与“小”的这种不对称现象指出来 ,略加分析 ,并尽量予以合理的解释     

A New Chaotic Genetic Hybrid Algorithm and Its Applications in Mechanical Optimization Design

A new chaotic genetic hybrid algorithm(CGHA) based on float point coding was put forward in this paper.Firstly,it used chaos optimization to search coarsely and produced a better initial population.Then,a power function carrier was adopted to improve the ergodicity and the sufficiency of the chaos optimization.Secondly,the genetic algorithm(GA) was used to search finely and guaranteed the population's evolution.To avoid the search being trapped in local minimum,a chaos degenerate mutation operator was designed to make the search converge to a global optimum quickly.Finally,CGHA was used to solve a typical mechanical optimization problem of shear stress checking for a cylinder helix spring.Compared with traditional penalty function method,chaos-Powell hybrid algorithm and standard GA,CGHA shows better performance in solution precision and convergence speed than those of the algorithms.Therefore,CGHA is a new effective way to solve the problems in mechanical optimization design.     

三维点云深度模型压缩算法

随着计算机三维视觉的广泛应用,近几年基于深度学习的点云处理算法得到了大量研究,而耗时耗存储的缺陷较大程度限制了其在移动端的部署应用。基于改进损失函数的总体思路,提出了一种新的点云深度模型压缩框架,将知识蒸馏方法引入二值量化模型中,同时考虑点云聚合操作的特殊性引入了辅助损失项,改进的损失函数共包括预测损失项、蒸馏损失项和辅助损失项三部分。实验结果表明,和已有算法相比,所提算法可以获取更高的精度,同时对当前点云主流深度网络模型也具有良好的扩展性。     

SDI,NATO, and the Social Composition Function

The strategic defense initiative (SDI) intends to renew the leadership of the USA on the western alliance. The initiative takes place in a period when a summation technology prevails for the aggregation of contributions of NATO allies. We investigate if SDI induces a shift in Hirshleifer’s social composition function. Panel data tests over the period 1970–1990 do not confirm any break toward a best-shot aggregator. SDI does not alter the core of deterrence. It is indeed a public good at the US level but not at the NATO level, where, it is one of the joint products of the alliance. We also investigate the lessons to be drawn for the current debates on ballistic defense.