应用柯洛波夫数论网格计算发射n发至少命中m发概率的研究

本文应用了柯洛波夫数论网格方法,较好地解决了三级误差条件下高精度计算命中概率指标 P_(Lm)的问题。本文还详细给出了计算 P_(Lm)的方法、步骤和实例。     

机载制导武器的武器-目标分配算法研究

机载制导武器的武器-目标分配算法是智能航空指控系统的一个基础研究问题。本文在建立了武器-目标分配的基本概念和对算法要求的基础上,提出了两种武器-目标分配算法;基于决策论的武器-目标分配算法和基于导弹截获区的武器-目标分配算法,并对基于导弹截获区的武器-目标分配算法进行了仿真实验。结果表明,此算法具有高透明性、有限消除最大威肋、杀伤概率最大、充分利用机载武器等特点。     

Tychonoff定理的又一个证法

本文给出了Tychoncff 定理的又一个证法。在证明中,我们基于Zorn 引理,利用紧空间的等价命题之一——任一网都有丛点——来证明的。首先,我们引进了万有同的概念,并给出了一个例子。其次,我们证明了万有网的几个性质(即引理1,2,3,4)。最后,我们证明了一般拓扑学中著名的定理——Tychonoff 定理。     

Transformation of Military Ethics During the Zhou Dynasty in Ancient China

ABSTRACT

The transformation of the governance model from a rule of virtue to political realism in China has been a topic of great interest to scholars. In this study, I examine military culture during the Zhou Dynasty and investigate the changes in ethics based on factors such as cultural values, social customs, and political structure to understand the process by which moral values have changed as the governance model transformed from rule of virtue to political realism. I found that military ethics have changed from governance through the use of rituals during the Western Zhou Dynasty to what was called “deception makes an army” during the Eastern Zhou Dynasty.     

Weighted vertex packing problem for specially structured geometric graphs

Consider a set of vertices V = {1, 2,…, n} placed on a two-dimensional Euclidean plane R² with each vertex attached a nonnegative weight w: V → R. For a given constant d>0, the geometric graph G = (V, E) is defined to have edge set E = {(i, j): d_ij ⩽ d} with d_ij being the Euclidean distance between vertices i and j. The geometric vertex packing (GVP) problem, which is often called the independent set problem, is defined as selecting the set of pairwise nonadjacent vertices with maximum total weight. We limit our attention to the special case that no vertex is within a distance βd of any other vertices where 0 ⩽ β < 1. A special value of β (= 1/2) is referred to frequently because of its correspondence to a manufacturing problem in circuit board testing. In this article we show that the weighted vertex packing problem for the specially structured geometric graph (SGVP) defined with the above restriction is NP-complete even for the case that all vertex weights are unity and for any β. Polynomial procedures have been designed for generating cuts to obtain tight LP upper bounds for the SGVP. Two heuristics with bounded worst-case performance are applied to the LP solution to produce a feasible solution and a lower bound. We then use a branch-and-bound procedure to solve the problem to optimality. Computational results on large-scale SGVP problems will be discussed. © 1995 John Wiley & Sons, Inc.     

二维拉格朗日和欧拉结合法在流处理器MASA上的实现与评测

现代半导体工艺技术的发展使得在单芯片上放置数百个运算单元成为可能,但是全局片上片外带宽受限。通用处理器体系结构不能较好地适应变化,仍然依靠全局片上结构,少量的运算单元。而流体系结构拥有大量的运算单元、鲜明的存储层次,使得在有限的片外带宽下,用高的本地带宽来满足大量运算单元的需求。首先介绍了原型MASA流体系结构,然后给出了爆轰流体力学中的二维拉格朗日和欧拉结合法(Ygx2)在流体系结构上实现的实例研究,最后用时钟精确的模拟器来评测应用的运行性能,结果表明Ygx2应用在500MHz的MASA上运行结果与1.6GHz的Iantium2的比较快近4倍,证实了流体系结构在高性能计算领域的极大潜力。     

基于四阶龙格-库塔公式的火控系统瞄准角修正模型

目前我军装甲突击车辆火控系统的弹道解算模型采用了线性多项式拟合的方法,且应用弹道刚性原理忽略了炮目高低角对射击精度的影响,其射表没有编制大炮目高低角射击时瞄准角的修正量,导致在进行大炮目高低角射击时,首发命中率受到了一定的影响,客观上制约了其火力性能的发挥。对此,利用四阶龙格-库塔公式,建立了对含有炮目高低角的外弹道方程直接进行数值求解的数学模型,得到更为精确的瞄准角,并通过matlab编程计算出瞄准角偏差量,从根本上解决大射角射击时弹道刚性原理产生的误差。     

C4ISR网络安全态势的可拓云理论综合评估方法

为了对C4ISR网络的安全态势进行精确评估,提出了一种基于云理论和可拓学的评估方法。分析了影响C4ISR网络安全态势的评价指标体系,通过主客观综合赋权法确定各评价指标的权系数。在此基础上,利用云理论和可拓学中的基元理论,构建C4ISR网络安全态势的综合评估方法。通过对实例的分析,表明了该方法的可操作性和优越性。