神经网络的函数逼近理论

分析了将函数逼近理论与方法引入神经网络研究的必要性；从经典函数逼近与统计分析两方面详细地讨论了多层前馈网（ＭＬＰ）逼近能力分析的基本方法及结论；分析了正则理论观点下的径向基函数网络（ＲＢＦ）的逼近能力；讨论了ＲＢＦ网与多层前馈网在最佳逼近特性上的差异。文末指出了神经网络函数逼近的发展方向。     

扩展卡尔曼滤波的有向传感器网络移动目标跟踪算法

针对传感器网络中跟踪目标需要大量的节点协同工作,还需要实时处理和传输大量数据,提出一种基于扩展卡尔曼滤波的有向传感器网络目标跟踪算法(EK-MTDC),重点研究了传感器网络中的扇区数量对节点间数据传输与目标跟踪精度的影响,根据对目标状态的分析,通过压缩参与监测的节点个数,选择激活网络中节点相交区域内的节点对跟踪目标进行监测。仿真结果表明,该算法能在不降低跟踪效果的前提下,降低网络能耗,延长其使用寿命。     

战术移动自组织网络路由方法

战术移动自组织网络(Mobile Ad Hoc Network,MANET)作为网络中心战的重要组成,有望解决未来战场上传统作战力量与新型无人作战平台之间高效组网通信问题。战术MANET作为MANET在战场环境下的应用,可在基础设施缺乏或遭破坏的地域快速展开,具有节点自由出入、移动性高、抗毁伤性强等特点。综述了战术MANET路由协议和仿真方法,对研究方法和面临的挑战作了简要评述。     

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.