基于复杂网络理论的作战系统结构拓扑模型研究

基于复杂网络理论,分析了信息化作战系统网络结构,构建了传统作战系统和信息化作战系统拓扑模型的生成算法,并通过对传统作战系统和信息化作战系统结构拓扑模型度量性质的比较,说明了信息化战争下的作战系统结构特点,为进一步研究网络化战争提供了良好的模型基础．     

The Trust Paradox in Nuclear Smuggling

ABSTRACT

This article explores the paradox of trust in the largest nuclear smuggling operation involving highly enriched uranium (HEU) discussed in open source literature. In the first effort to understand the type, extent, and role of trust in nuclear smuggling enterprises, it draws from literature on trust development in legitimate businesses as well as criminal enterprises. Observed behavioral patterns in this case challenge traditional notions of the internal dynamics of temporary groups engaged in nuclear smuggling and operational realities of such activities. The article seeks to explain why individuals agree (and continue) to operate in this high-risk environment, unbound by close personal ties, without any effort to verify the background, motives, or qualifications of the fellow conspirators. It offers ways to advance current nonproliferation efforts in non-state actor interdiction by exploiting the environment of shallow trust in temporary groups.     

具有时滞的Cohen—Grossberg神经网络的Hopf分支全局存在性研究

摘要：利用泛函微分方程的度理论,研究一类具有时滞的Cohen-Grossberg神经网络的全局分支的存在性,研究结果为该类神经网络的应用设计提供理论基础．     

Strategic intelligence during coin detention operations – relational data and understanding latent terror networks

One aspect of the global “War on Terror” that has received limited coverage in the academic literature is the problem of detained persons as it relates to intelligence. This is a surprising oversight, given the number of detainees that the USA has been responsible for (over 25,000 were in custody in Iraq alone at one time during its peak). The detention environment offers a prime strategic intelligence opportunity for the US intelligence community to study the tactics and organizations of individuals who have been removed from the overall conflict. In this article an easily implemented collection program is recommended to be deployed in US/coalition detention centers. The primary recommendation is to gather relational data on detainee communication, both authorized and illicit, and to use these data to perform network analyses of terrorist groups and their individual members.     

一种基于模糊竞争网络的主动声纳目标分类器

提出了一种基于模糊竞争网络的主动声纳目标分类器。该分类器结构简单,学习速度快,仅用少量样本进行训练便可获得良好的推广性能．便于实时学习和应用。通过对模式属于各类别的隶属度的分析,可以知道判决的可靠性,具有较好的应用价值。     

未知非线性系统的神经网络建模与控制仿真研究

针对一类未知非线性系统的建模与控制问题,采用基于神经网络的多步预测控制算法进行了仿真研究,仿真对象选取控制工程界常用的单摆试验装置.该算法的实现步骤为:获取系统开环试验数据;辨识神经网络正向动态模型;设计非线性优化控制律.仿真研究结果表明,所提出的建模与控制方法是有效的.     

具有变时滞的离散型随机BAM神经网络的稳定性

研究一类具有变时滞的离散型随机BAM神经网络。通过构造Lyapunov泛函以及线性矩阵不等式（LMI）,得出了离散系统全局渐近稳定的充分条件。     

基于弱多径覆盖的虚电路恢复策略研究

虚电路技术可以为Ad Hoc网络中的节点提供面向连接的服务。然而,由于拓扑动态性等特征,Ad Hoc网络中的虚电路容易断开,从而导致业务时延、时延抖动增大甚至通信中断等问题。为此文章提出了一种基于弱多径覆盖的虚电路恢复策略,通过将虚电路机制与弱多径覆盖多径策略相结合,可以有效地减少虚电路恢复时间和需要重新预约资源的节点的数量。理论分析和仿真结果表明了该方法的有效性。     

基于小波包变换和BP网络的齿轮箱故障诊断

利用小波包分析提取出齿轮箱在各种工况下振动信号的有效成分,根据时频域特点提取比较典型的特征参量,利用改进的BP网络进行训练,根据训练结果判别齿轮箱的故障状态。     

A generalization of the weighted set covering problem

We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect b‐matching problem. In general, we may use a polynomial‐time greedy heuristic similar to the one for the classical weighted set covering problem studied by D.S. Johnson [Approximation algorithms for combinatorial problems, J Comput Syst Sci 9 (1974), 256–278], L. Lovasz [On the ratio of optimal integral and fractional covers, Discrete Math 13 (1975), 383–390], and V. Chvatal [A greedy heuristic for the set‐covering problem, Math Oper Res 4(3) (1979), 233–235] to get an approximate solution for the problem. We find a worst‐case bound for the heuristic similar to that for the classical problem. In addition, we introduce a general type of probability distribution for the population of the problem instances and prove that the greedy heuristic is asymptotically optimal for instances drawn from such a distribution. We also conduct computational studies to compare solutions resulting from running the heuristic and from running the commercial integer programming solver CPLEX on problem instances drawn from a more specific type of distribution. The results clearly exemplify benefits of using the greedy heuristic when problem instances are large. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2005