新军事革命与C4I系统

介绍了联合作战的概念,着重分析了Ｃ４Ｉ在联合作战中的地位和作用、新军事革命对Ｃ４Ｉ的影响,并提出了几点看法。     

悬置螺母的载荷分布及优化设计

本文在全面考虑螺旋付变形和建立合理的力学模型的基础上,导出了悬置螺母载荷分布计算的矩阵表达式,并以载荷分布均匀为目标对其结构参数进行了优化。优化结果较好地改善了悬置螺母的载荷分布状况,显示出良好的应用前景。     

系统可靠度的模糊分配

本文把模糊规划理论应用于系统可靠度的最优分配问题,给出两类常见的可靠度分配模型,并以实例说明解决此类问题的思想方法。     

分布式计算机网络数据加密研究

针对C~3I 系统对分布式计算机网络数据加密的特定需求,重点对网络加密方式,密码装置、软件编程设计等核心问题进行了研究。可对数据加密总体设计与软件概要设计提供参考。     

凸集支撑函数的性质及其应用

本文讨论一个凸集C 的支撑函数的几个有用性质,并把这些性质应用于对函数次微分的研究,得到有关函数次微分的几个有趣结果。     

属性约简与近似集的关系研究

上近似和下近似是在粗集理论中最基本的概念,而粗集理论的主要思想又是在保持分类能力不变的前提下通过对属性的约简导出问题的决策和分类规则。本文讨论了属性的约简和相对约简与上近似和下近似的关系,并在此基础上提出了一种新的相对约简———保近似约简。     

联合作战自同步指挥问题探析

研究联合作战自同步指挥问题。本文从自同步指挥的概念入手,阐述了自同步指挥的特点、实现基础和运行机理,分析自同步指挥的应用与发展前景。     

液压驱动型四足机器人对角小跑步态本体水平位置控制方法

为了对对角小跑中四足机器人本体的水平位置进行控制,建立基于沿支撑线方向运动分解的机器人近似动力学模型,将本体和对角支撑腿简化为一个七连杆结构和一个线性倒立摆,并且基于线性倒立摆解析模型提出摆动腿落足点位置计算方法,进而实现对本体水平位置的控制。针对液压作动器伸缩速度受限的问题,利用单腿冗余关节将关节角速度优化问题转化为标准二次型规划问题,通过设计二次型规划问题解法,降低对摆动腿关节角速度的需求,并且避免了传统伪逆方法可能产生的腿部奇异位型。仿真和实验结果表明:该方法能够实现在关节角速度受限的情况下,有效跟踪本体水平位置的期望轨迹。     

The joint signature of coherent systems

We investigate the joint signature of $m$ coherent systems, under the assumption that the components have independent and identically distributed lifetimes. The joint signature, for a particular ordering of failure times, is an $m$‐dimensional matrix depending solely on the composition of the systems and independent of the underlying distribution function of the component lifetimes. The elements of the $m$‐dimensional matrix are formulated based on the joint signatures of numerous series of parallel systems. The number of the joint signatures involved is an exponential function of the number of the minimal cut sets of each original system and may, therefore, be significantly large. We prove that although this number is typically large, a great number of the joint signatures are repeated, or removed by negative signs. We determine the maximum number of different joint signatures based on the number of systems and components. It is independent of the number of the minimal cut sets of each system and is polynomial in the number of components. Moreover, we consider all permutations of failure times and demonstrate that the results for one permutation can be of use for the others. Our theorems are applied to various examples. The main conclusion is that the joint signature can be computed much faster than expected.     

Satellite constellation design for forest fire monitoring via a stochastic programing approach

There is significant value in the data collected by satellites during and after a natural disaster. The current operating paradigm in practice is for satellites to passively collect data when they happen to fly over a disaster location. Conversely, this article considers the alternative approach of actively maneuvering satellites to fly directly overhead of the disaster site on a routine basis. Toward this end, we seek to compute a satellite constellation design that minimizes the expected maneuver costs for monitoring an unknown forest fire. In this article, we present a 2‐stage stochastic programing model for this problem as well as a accelerated L‐shaped decomposition approach. A comparison between our approach and the current operating paradigm indicates that our solution provides longer duration data collections and a greater number of data collections. Analysis also shows that our proposed solution is robust over a wide array of scenarios.