Global Asymptotic Synchronization of a Class of BAM Neural Networks with Time Delays via Integrating Inequality Techniques

In this paper, the authors are concerned with global asymptotic synchronization for a class of BAM neural networks with time delays. Instead of using Lyapunov functional method, LMI method and matrix measure method which are recently widely applied to investigating global exponential/asymptotic synchronization for neural networks, two novel sufficient conditions on global asymptotic synchronization of above BAM neural networks are established by using a kind of new study method of global synchronization: Integrating inequality techniques. The method and results extend the study of global synchronization of neural networks.     

食物链网络在顶点攻击与边攻击下的鲁棒性

研究了14个典型食物链网络对顶点攻击和边攻击的反应.考虑到食物链网络的能量传递特征,实验中引入了顶点介数攻击和边介数攻击.选用鲁棒性系数(使物种灭绝率达到50%的顶点移除比例)测量顶点攻击效果,发现对大多数食物链网络,顶点介数攻击的效果比顶点度攻击好.以相同边移除率为标准,对顶点攻击和边攻击的效果进行了测量,发现边攻击的效果明显优于顶点攻击.     

Community Detection with the Weighted Parsimony Criterion

Community detection in networks has been studied extensively in the last decade. Many criteria, expressing the quality of the partitions obtained, as well as a few exact algorithms and a large number of heuristics have been proposed. The parsimony criterion consists in minimizing the number of edges added or removed from the given network in order to transform it into a set of disjoint cliques.Recently Zhang, Qiu and Zhang have proposed a weighted parsimony model in which a weight coefficient is introduced to balance the numbers of inserted and deleted edges. These authors propose rules to select a good value of the coefficient, use simulated annealing to find optimal or near-optimal solutions and solve a series of real and artificial instances. In the present paper, an algorithm is proposed for solving exactly the weighted parsimony problem for all values of the parameter. This algorithm is based on iteratively solving the problem for a set of given values of the parameter using a row generation algorithm. This procedure is combined with a search procedure to find all lowest breakpoints of the value curve(i.e., the weighted sum of inserted and deleted edges). Computational results on a series of artificial and real world networks from the literature are reported. It appears that several partitions for the same network may be informative and that the set of solutions usually contains at least one intuitively appealing partition.     

匹配于进化种群的局部网络图度量

为了分析匹配于进化种群的贝叶斯网络结构 ,给出了用于刻画局部贝叶斯网络度量的有关表示。依据贝叶斯狄利克雷度量 ,对于贝叶斯网络图中的 3个顶点 (对应于染色体的某 3个基因位置 ) ,研究了 3个顶点无连接、其中只有两个顶点存在有向连接、及 3个顶点存在两条有向边时的度量值关系。揭示了局部贝叶斯网络结构的固有特性 ,为进一步研究进化算法的种群结构提供了一条可行的途径。     

A New Peer-to-Peer Topology for Video Streaming Based on Complex Network Theory

A new wave of networks labeled Peer-to-Peer(P2P) networks attracts more researchers and rapidly becomes one of the most popular applications.In order to matching P2 P logical overlay network with physical topology,the position-based topology has been proposed.The proposed topology not only focuses on non-functional characteristics such as scalability,reliability,fault-tolerance,selforganization,decentralization and fairness,but also functional characteristics are addressed as well.The experimental results show that the hybrid complex topology achieves better characteristics than other complex networks’ models like small-world and scale-free models;since most of the real-life networks are both scale-free and small-world networks,it may perform well in mimicking the reality.Meanwhile,it reveals that the authors improve average distance,diameter and clustering coefficient versus Chord and CAN topologies.Finally,the authors show that the proposed topology is the most robust model,against failures and attacks for nodes and edges,versus small-world and scale-free networks.     

证券指数的网络动力学模型

基于复杂网络的分析方法，由香港证券市场的恒生指数（HSI）构建一个加权证券指数网络，通过对网络连接矩阵最大反比参与率厦其对应本征矢量的计算。得到了四个网络拓扑重要性节点，发现具有拓扑重要性的证券指数网络节点具有很好的统计稳定性，这说明香港证券市场在统计意义下是动力学稳定的而不是随机的。识别这些具有拓扑统计重要性的节点对应的证券市场指数的波动模式，利用复杂网络的拓扑结构来反映证券指数波动的动力学相互关联和作用，为证券市场动力学性质的研究提供了一种新的方法。     

The Dynamics of Two-State Public Opinion Propagation On Signed Networks

The formation of public opinion on the network is a hot issue in the field of complex network research, and some classical dynamic models are used to solve this problem. The signed network is a particular form of the complex network, which can adequately describe the amicable and hostile relationships in complex real-world systems. However, the methods for studying the dynamic process of public opinion propagation on signed networks still require to be further discussed. In this paper, the authors pay attention to the influence of negative edges in order to design a two-state public opinion propagation mechanism suitable for signed networks. The authors first set the interaction rules between nodes and the transition rules of node states and then apply the model to synthetic and real-world signed networks. The simulation results show that there is a critical value of the negative edge ratio.When the negative edge ratio exceeds this critical value, the evolutionary result of public opinion will change from a consistent state to a split state. This conclusion is also consistent with the distribution result of opinions within communities in the signed network. Besides, the research on the network structural balance shows that the model makes the network evolve in a more balanced direction.     

变聚类系数加权网络的建模及其级联抗毁性分析

针对ＢＢＶ 等传统加权网络模型生成的网络聚类系数较小、簇度幂律特征偏弱等不足,提出了一个变 聚类系数加权网络模型,其中新节点的加入根据节点强度和初始吸引度共同驱动的优先连接机制或三角连接机 制与网络中的旧节点建立连接。仿真表明,当初始吸引度和三角连接概率取不同值时,生成网络的度、强度和边 权都服从幂律分布,并且聚类系数可调,特别是随着三角连接概率的变大,簇度之间的幂律特征更加明显。最后 构建了基于加权网络的级联故障模型,分析了权重因素、聚类系数等对网络级联抗毁性的影响。     

基于个体属性的人类感知网络演化模型

从个体属性差异角度切入,结合现实群体关系研究感知网络演化模型.模型通过引入马氏定理,模拟在不同感知维度和感知能力下的个体行为,并计算其马氏距离,实现以优先连接概率为前提条件的人类感知网络结构.实验表明;通过优先连接概率阈值和感知因子权重关联度阈值两个外部环境因子,以及个体节点属性差异内部因素,可以共同数据化新旧节点度的...     

Stability for the mix-delayed Cohen-Grossberg neural networks with nonlinear impulse

<正> In this paper,the authors are concerned with the stability of the mix-delayed Cohen-Grossbergneural networks with nonlinear impulse by the nonsmooth analysis.Some novel sufficientconditions are obtained for the existence and the globally asymptotic stability of the unique equilibriumpoint,which include the well-known results on some impulsive systems and non-impulsive systems asits particular cases.The authores also analyze the globally exponential stability of the equilibriumpoint.Two examples are exploited to illustrate the feasibility and effectiveness of our results.     

考虑节点失效网络可靠性计算的重要度抽样随机模拟

针对同时考虑节点和边单元失效的一般赋权网络,提出了一种考虑节点失效网络连通可靠性计算的Monte Carlo随机模拟算法.Monte Carlo随机模拟方法包含单元状态抽样、网络系统连通状态分析和连通功能函数指标统计三个阶段.在系统连通状态分析阶段,提出将一般赋权网络转换为边权网络的等效化方法,此方法无需额外增加等效节点或边;在单元状态抽样阶段,采用重要度抽样函数进行随机抽样,增加对失效概率贡献大的抽样点出现概率,利用自适应方法求解最优重要度抽样函数.算例分析中,根据模拟均值的相对误差和变异系数两个指标,说明了本文方法的正确性和有效性.     

一种用于中药配方优化的DNA算法

提出了一种用于中药配方优化的DNA算法，该算法基于质粒DNA技术。首先将中药配方优化问题转化为求无向图的最大权团问题：选取6种具有抑制大肠杆菌生长功效的中药作为图的顶点，分别做抑菌试验，将它们的抑菌圈直径作为顶点的权。然后两两配对进行抑菌试验以确定它们在图中是否有边连接。这样构造了一个顶点赋权的无向图，这个图的最大权团具有最大的抑菌效力，也是这些中药的最佳配伍。求图的最大权团是一个典型的NP．完全问题，而DNA计算具有求解该问题的能力。该方法的提出探讨了DNA计算实用的可能性。     

Moment Equations of Linear It Stochastic Systems with Applications

1.INTRODUCTIONAsiswellknown,stochasticsystemmodeloftheIt6typeisoneofthemostimportantmodelsforstochasticsystems,manystochasticsystemswithcolorednoisecanbestudiedwithhelpoftheIt6stochasticsystems[if.ForthestabilityandcontrolproblemofIt6stochasticsystems,nlallyresultshavebeenobtainedintheliteratures[l~6].Whilesomebasicproblems,suchasthenecessaryandsufficientconditionofmean-squarestabilityoflinearIt6stochasticsystems,havehotbeensolved.Inthepreviousliterature,someresultsonthestabilityoflinear…     

基于最小连通支配集的复杂网络关键节点与连边识别方法

复杂网络关键节点与关键连边在网络中均起着十分重要的作用,目前的识别方法往往无法做到同时识别,并且识别指标角度较为单一。为解决上述问题,提出一种基于最小连通支配集(minimum connected dominatingset,MCDS)的复杂网络关键节点与连边识别方法,通过使用免疫粒子群(immune particle swarm optimization,IPSO)算法寻找网络最小连通支配集,构建核心骨干网,实现对复杂网络关键节点与连边的同时识别。该算法在求解过程中引入免疫机制指导粒子节点搜索方向、加快算法收敛速度,同时优化搜索节点质量。经实验验证表明,所提识别方法能够有效识别网络中的关键节点与关键连边。     

AR(1)-MA(1)模型的矩估计及其渐近分布

利用矩方法 ,给出了双重时间序列 AR( 1) - MA ( 1)模型的矩估计 ;并证明了该估计的渐近正态性.     

Multi-facility ordered median problems in directed networks

This paper uses a finite dominating set (FDS) to investigate the multi-facility ordered median problem (OMP) in a strongly connected directed network. The authors first prove that the multi-facility OMP has an FDS in the node set, which not only generalizes the FDS result provided by Kalcsics, et al. (2002), but also extends the FDS result from the single-facility case to the multiple case, filling an important gap. Then, based on this FDS result, the authors develop an exact algorithm to solve the problem. However, if the number of facilities is large, it is not practical to find the optimal solution, because the multi-facility OMP in directed networks is NP-hard. Hence, we present a constant-approximation algorithm for the p-median problem in directed networks. Finally, we pose an open problem for future research.     

两种简化标准Marching Cubes算法拓扑构形的方法

通过沿插值边移动等值点,提出了两种方法来简化标准MarchingCubes算法的拓扑构形。其一是将等值点移动到高于阈值的立方体顶点位置,其二是将等值点移动到低于阈值的立方体顶点位置。结果发现,这两种移动方式均可简化等值面的拓扑构形,明显减少重建三角片的数量,避免对等值点位置和法向量的插值计算,显著缩短重建时间。由于等值点的移动量不超过体素立方体的1个边长,这对于高分辨率图像数据集是可以忽略的。     

基于开源软件的有向图研究

从复杂网络的角度分析大型开源软件内部软件包依赖关系的复杂度和风险情况.以Gentoo Linux系统做为数据源,将系统中的软件包抽象成点,把软件包之间的依赖关系抽象成边,建立随机图,对此进行分析.除应用经典的随机图方法外,还定义了两个基于有向图的新参数:复杂度和风险度分布,用以量化地评估系统的复杂程度与风险性.通过应用两个新参数,观察到Gentoo系统的复杂度和风险度分布经历了一个快速增长的阶段.这种高速增长的原因来自系统中环状依赖结构.     

Stability analysis of extended discrete-time BAMneural networks based on LMI approach

1 .INTRODUCTIONBidirectional associative memory model is a kind ofneural network models in common use with the abili-ty of information memory and association. Since thedistributed memory of the information,the networkcan associate a completed and clear mode stored in itfroman uncompleted and fuzzy mode . Bidirectionalassociative memory (BAM) proposed by B. KoskoinRef .[1] is a generalization of Cohen-Grossberg’smodel from single layer to two layers . Since then,there have beenlots of …     

Razumikhin-type theorems for asymptotic stability of impulsive stochastic functional differential systems

<正>In this paper,we investigate the pth moment uniformly asymptotic stability of impulsive stochastic functional differential systems by extending some Razumikhin-type theorems.Based on the Lyapunov functions and Razumikhin techniques,some criteria are established and their applications to impulsive stochastic delay systems are proposed.An illustrative example shows the effectiveness of our results.