电子对抗装备战术指标体系构建方法

考虑电子对抗的作战特点，遵循体系构建原则，依据作战目标特性，以作战规模为依据，把电子对抗装备战术指标划分为战略、战役、战术三个层次，并把作战规模作为一级指标的划分依据，选择作战用途和装备指标性质作为二级指标的划分依据，装备的具体作战能力和环境适应能力作为三级以下指标划分依据。     

高功率光纤激光器及其在战术激光武器中的应用

作为目前世界上最先进的固体激光器——光纤激光器具有无以伦比的独特优势,它已广泛应用于战术激光武器。本文评述和分析了高功率光纤激光器的特点、最新进展,光束合成技术和光学相控阵,以及它们在战术激光武器中的应用。Abstract：     

外军战术数据链发展趋势分析

战术数据链是提升体系化联合作战能力的关键,文中在介绍了美军及北约战术数据链Link-4、Link-11、[JP]Link-16发展现状的基础上,重点对统一消息标准、动态网络管理、通用链路集成处理、通用化方向演进等发展趋势进行了详细分析,并对我军战术数据链发展提出了良好的建议。     

新型战术高能液体激光器

评论了化学激光器和固体激光器的现状和主要问题,介绍和讨论了高能液体激光区域防御系统的特点、任务、发展规化和现状,以及主要组成和关键特性.     

舰载预警直升机及其雷达系统的发展

介绍了国外几种典型的舰载预警直升机及其雷达系统的发展情况,分析了主要战技指标,并对未来发展趋势进行了阐述.     

美军CBU-94型断电弹药投放落点分析

以美军CBU-94型断电弹药的战术应用为背景,探讨了其战术使用过程和作用原理.将导电纤维的落点分三个阶段进行计算,论述了子弹抛物线运动、纤维卷抛物线运动和导电纤维随风运动的计算方程,给出了以导电纤维落点为坐标原点,断电弹药投放时的坐标参数的计算方法,在已知目标点的GPS坐标的前提下,可以通过专门的三维坐标计算软件,计算出断电弹药投放时的GPS坐标.     

Tactical Decompositions of Steiner Systems and Orbits of Projective Groups

Block's lemma states that the numbers m of point-classes and n of block-classes in a tactical decomposition of a 2-(v, k, ) design with b blocks satisfy m n m + b – v. We present a strengthening of the upper bound for the case of Steiner systems (2-designs with = 1), together with results concerning the structure of the block-classes in both extreme cases. Applying the results to the Steiner systems of points and lines of projective space PG(N, q), we obtain a complete classification of the groups inducing decompositions satisfying the upper bound; answering the analog of a question raised by Cameron and Liebler (P.J. Cameron and R.A. Liebler, Lin. Alg. Appl. 46 (1982), 91–102) (and still open).     

战术激光中继镜系统

激光中继镜技术将激光源与光束控制部分离,降低了大气等因素对激光性能的影响.介绍了激光中继镜的概念及工作过程,分析了战术激光中继镜系统的优势与面临的技术挑战,最后介绍了美国中继镜技术的发展概况.     

Even-aged restrictions with sub-graph adjacency

Restrictions on the size and proximity of clearcuts have led to the development of a variety of exact and heuristic methods to optimize the net present value of timber harvests, subject to adjacency constraints. Most treat harvest units as pre-defined, and impose adjacency constraints on any two units sharing a common border. By using graph theory notation to define sub-graph adjacency constraints, opening size can be considered variable, which may be more appropriate for landscape-level planning. A small example data set is used in this paper to demonstrate the difference between the two types of adjacency constraints for both integer programming and heuristic solution methods.     

More on regular linear spaces

We extend the enumeration of regular linear spaces in 1 to at most 19 points. In addition, one of the 5 missing cases in the previous list is settled. The number of regular linear spaces of type (15|2¹⁵,3³⁰) is 10,177,328. © 2005 Wiley Periodicals, Inc. J Combin Designs.