基于复杂网络的机群作战建模与仿真

机群作战已成为战争中的主要作战形式之一。而传统的作战模型,已经不适应其多任务驱动、多机种协作的机群作战特性。为此,以复杂网络为基础,提出了一种构造不同类型的节点连接的动态生成算法,构建了反映真实作战场景的网络描述模型,较好地呈现出了机群作战中的涌现性、模糊性等诸多性质。并提出了描述机群作战网络的统计特征量,通过破击仿真实验,得出了与战争事实相符合的结论,为未来研究机群作战体系效能评估打下了基础。     

Analysis of production lines with Coxian service times and no intermediate buffers

This paper uses the holding time model (HTM) method to derive an approximate analytic formula for the calculation of the mean throughput of a K-station production line with no buffers between any two successive stations. Service times follow the two-stage Coxian (C²) distribution at all stations. The paper provides a formula that relates the third moment of the service completion (or virtual service) time with the respective parameters of the service time, the repair time and the time to breakdown (the latter is assumed to follow the exponential distribution). In this way, it concludes that under certain conditions the two-stage Coxian distribution can be used to approximate any general distribution matching the first three moments of the service completion time distribution. The mean holding times (consisting of the service and blocking periods) of all stations of the line are obtained in an analytical form. Numerical results are provided for the mean throughput of lines with up to 20 stations. These results are shown to have a good accuracy compared against results obtained from the Markovian state method (for short lines) and results from simulation (for longer lines). © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 669–685, 1998     

The effect of training data set size and the complexity of the separation function on neural network classification capability: The two-group case

Classification among groups is a crucial problem in managerial decision making. Classification techniques are used in: identifying stressed firms, classifying among consumer types, and rating of firms' bonds, etc. Neural networks are recognized as important and emerging methodologies in the area of classification. In this paper, we study the effect of training sample size and the neural network topology on the classification capability of neural networks. We also compare neural network capabilities with those of commonly used statistical methodologies. Experiments were designed and carried out on two-group classification problems to find answers to these questions. The prediction capability of the neural network models are better than traditional statistical models. The learning capability of the neural networks is improving compared to traditional models because the discriminate function is more complex. For real world classification problems, the usage of neural networks is highly recommended, for two reasons: learning capability and flexibility. Learning capability: Neural network classifies better in sterile experiments as performed in this research. Flexibility: Real life data are rarely not contaminated with noise, such as unknown distributions, and missing variables, etc. Neural networks differ from a statistical model that it is not dependent on any assumption concerning the data set distribution. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 699–717, 1997     

基于RBF网络的导弹攻击区解算及对比分析

研究了神经网络在空空导弹攻击区处理中的运用,在提出多层前馈(MF)网络和径向基函数(RBF)网络设计方案的基础上,着重对MF网络的BP算法、改进BP算法以及RBF网络的应用进行了仿真,并从收敛速度、逼近精度和实时性三个方面,对计算结果进行了对比分析,结论表明RBF网络在导弹攻击区处理中具有更高的可行性,更适用于快速高精度的火控解算。     

一种基于神经网络的磁性目标定位方法

磁性目标定位问题可归结为一类非线性规划问题的求解 .该问题的最大特点就是其目标函数的计算过程极为繁琐 .而目标函数计算的快慢对磁定位的实时性有很大影响 .在详细研究了目标函数之后 ,给出了目标函数的一种神经网络结构实现 .由于该网络结构易于并行计算和VLSI实现 ,从而可使磁定位的实时性得到改善 .     

跨模态检索中的相似性漂移问题

为了降低“相似性漂移”问题的影响,提出一种基于“邻域传播”的匹配策略,将待查询项的模态内近邻映射到目标空间中,并将它们在目标空间中的最近邻作为查询项的跨模态近邻。基于邻域传播的匹配策略在不改变跨模态映射函数的条件下,可以有效地降低“相似性漂移”带来的误匹配现象。理论和实验分析证明,跨模态映射函数的“相似性漂移”问题广泛存在,而基于“邻域传播”的匹配策略可以有效降低其影响,提高匹配的准确率。     

复杂网络影响力极大化快速评估算法

分析复杂网络中影响力极大化问题,设计一种新的启发式算法框架。针对信息传递中节点的交互方式进行分析,给出节点在任意时刻处于信息接收态的概率。通过期望计算得到种子节点集传播影响力的近似估计,实现集群影响力快速计算,进而得到基于序列采样的影响力极大化快速评估算法。特别地,对于六个来自不同领域的真实网络上的影响力极大化问题进行了研究,仿真结果表明：该方法能够高效识别网络中具有重要传播影响力的节点集,在三种常见度量准则下的表现均明显优于三种影响力极大化问题基准算法。     

利用复单脉冲比的平面阵列雷达群目标检测方法

针对平面阵列雷达群目标检测问题,以矩形阵为例,详细分析方位向和俯仰向复单脉冲比虚部的统计特性;建立平面阵列雷达群目标检测模型,根据恒虚警检测原理推导复单脉冲比虚部的椭圆判决域,并利用复单脉冲比实部辅助判决,综合提出基于复单脉冲比的平面阵列雷达群目标检测算法。针对双目标情形进行仿真实验,结果表明:在较高信噪比、较大角度间隔以及幅度相当且相位差较大的条件下算法能够有效检测群目标。     

The social structure of armed groups. Reproduction and change during and after conflict

Current research on civil wars and conflict increasingly turns to the inner structure and functioning of state and non-state armed groups and their impact on aspects such as violent practice, internal cohesion and the dissolution of these groups during the conversion to peace. The first aim of this introduction is to set out the theme of this Special Issue on the social structure of armed groups and previous research within the field. The second aim is to introduce the contributions within the Special Issue, alongside possible trajectories of future research on the ‘meso-foundations’ of civil war and conflict.     

I-TCP:一个高速长距离网络的AIMD算法

针对互联网中高速长距离网络上的拥塞控制问题,基于同步AIMD源在Drop-Tail网络环境下竞争带宽的网络模型,提出了一个新的AIMD拥塞控制算法,I-TCP。通过合理地设计高速和低速模式以及模式切换规则,使得该算法适合于配置到高速长距离网络,同时在传统低速网络中也具有很好的性能。仿真试验表明,I-TCP中的AIMD算法在高速长距离网络中表现出了很好的效率、公平性和网络响应性。