Target Pattern Waves in Specific Reaction-Diffusion Equation

This paper uses two-timing to solve a class of reaction-diffusion equations of Oregonator and constructsformally stable target pattern solutions to leading term in small parameter, which can be used to account for someobserved experimental facts. In addition, it also gives the explicit expression of the period corresponding to the targetwaves.     

插值多项式对函数|x|α的逼近

研究插值多项式对|x|α达到最佳逼近度的一种构造方法,证明了当n=2m,m∈N,α∈(0,1]时, Fn(a)＜[2(2/3)]/na, 其中F2m(α)=max1≤x≤1||x|α-R2m(x)|,R2m(x)是以x0=0,xj=cos(j-1/2)π/2m(j=1,2,…,2m)为插值结点的对|x|α的Lagrange插值多项式,从而推广了M.Revers的结论.     

螺旋波动力学性质的元胞自动机有向小世界网络研究

以Greenberg-Hastings激发介质元胞自动机模型为基础,研究了有向小世界网络中重新连接概率p对螺旋波动力学行为的影响.对于在规则网络下的稳定螺旋波,施加有向小世界网络后发现:当p值较小时,原本稳定的螺旋波仍保持其稳定性.随着p的增大,先后观察到螺旋波持续漫游、螺旋波断裂以及螺旋波消失等现象.通过监测系统的激发比率,发现以上现象的产生源于介质激发性随p的增大而降低.同时还发现元胞周期的变化也与p有关. 关键词： 元胞自动机 螺旋波 激发介质 有向小世界网络     

A modified evidential methodology of identifying influential nodes in weighted networks

How to identify influential nodes in complex networks is still an open hot issue. In the existing evidential centrality (EVC), node degree distribution in complex networks is not taken into consideration. In addition, the global structure information has also been neglected. In this paper, a new Evidential Semi-local Centrality (ESC) is proposed by modifying EVC in two aspects. Firstly, the Basic Probability Assignment (BPA) of degree generated by EVC is modified according to the actual degree distribution, rather than just following uniform distribution. BPA is the generation of probability in order to model uncertainty. Secondly, semi-local centrality combined with modified EVC is extended to be applied in weighted networks. Numerical examples are used to illustrate the efficiency of the proposed method.     

Community structure discovery method based on the Gaussian kernel similarity matrix

Community structure discovery in complex networks is a popular issue, and overlapping community structure discovery in academic research has become one of the hot spots. Based on the Gaussian kernel similarity matrix and spectral bisection, this paper proposes a new community structure discovery method. First, by adjusting the Gaussian kernel parameter to change the scale of similarity, we can find the corresponding non-overlapping community structure when the value of the modularity is the largest relatively. Second, the changes of the Gaussian kernel parameter would lead to the unstable nodes jumping off, so with a slight change in method of non-overlapping community discovery, we can find the overlapping community nodes. Finally, synthetic data, karate club and political books datasets are used to test the proposed method, comparing with some other community discovery methods, to demonstrate the feasibility and effectiveness of this method.     

Generalized function projective (lag, anticipated and complete) synchronization between two different complex networks with nonidentical nodes

Generalized function projective (lag, anticipated and complete) synchronization between two different complex networks with nonidentical nodes is investigated in this paper. Based on Barbalat’s lemma, some sufficient synchronization criteria are derived by applying the nonlinear feedback control. Although previous work studied function projective synchronization on complex dynamical networks, the dynamics of the nodes are coupled partially linear chaotic systems. In our work, the dynamics of the nodes of the complex networks are any chaotic systems without the limitation of the partial linearity. In addition, each network can be undirected or directed, connected or disconnected, and nodes in either network may have identical or different dynamics. The proposed strategy is applicable to almost all kinds of complex networks. Numerical simulations further verify the effectiveness and feasibility of the proposed synchronization method. Numeric evidence shows that the synchronization rate is sensitively influenced by the feedback strength, the time delay, the network size and the network topological structure.     

A novel criterion for cluster synchronization of complex dynamical networks with coupling time-varying delays

This paper investigates the cluster synchronization problem for the time-varying delays coupling networks with nonidentical delayed dynamical systems by using pinning control method. We derive some simple and useful criteria for cluster synchronization for any initial values through an effective feedback control scheme and propose an adaptive feedback strategy that adjusts automatically the coupling strength. Finally, some numerical examples are then given to illustrate the theoretical results.     

二分网上的靴襻渗流

靴襻渗流最早应用于统计物理学中研究磁铁因非磁性杂质导致磁有序的降低并最终消失的现象. 随着复杂网络研究的深入, 许多学者展开网络上的靴襻渗流研究. 在自然界中, 许多系统自然呈现出二分结构, 二分网络是复杂网络中的一种重要的网络模式. 本文通过建立动力学方程和计算机仿真模拟的方法研究二分网上的靴襻渗流, 关注的参数是二分网中两类节点初始的活跃比例和活跃阈值, 分别用f₁, f₂和Ω₁, Ω₂表示, 得到二分网两类节点终态活跃比例随初始活跃比例的变化会发生相变等结论. 同时 验证了动力学方程与仿真模拟的一致性.     

An improved GPS method with a new pseudo-peripheral nodes finder in finite element analysis

Finding pseudo-peripheral nodes with the largest eccentricity is important in matrix bandwidth and profile reduction algorithms in finite element analysis. A heuristic parameter, called the “width-depth ratio” and denoted by κ, is presented for finding the pseudo-peripheral nodes with larger pseudo-diameter compared with the GPS (Gibbs-Poole-Stockmeyer) pseudo-peripheral nodes finder. A novel nodes renumbering algorithm is thus developed by using our nodes finder based on GPS method. Simulations show that proposed nodes finder is reliable and effective in locating the proper pseudo-peripheral nodes with larger pseudo-diameters. A shielded microstrip line is given as an example to testify the ability of the proposed algorithm in application. The results, including time, pseudo-diameter, bandwidths and profiles, all indicate that our method is more competitive than GPS algorithm to be used as the nodes renumbering algorithm.