Optimal navigation for characterizing the role of the nodes in complex networks

In this paper, we explore how the approach of optimal navigation (Cajueiro (2009) [33]) can be used to evaluate the centrality of a node and to characterize its role in a network. Using the subway network of Boston and the London rapid transit rail as proxies for complex networks, we show that the centrality measures inherited from the approach of optimal navigation may be considered if one desires to evaluate the centrality of the nodes using other pieces of information beyond the geometric properties of the network. Furthermore, evaluating the correlations between these inherited measures and classical measures of centralities such as the degree of a node and the characteristic path length of a node, we have found two classes of results. While for the London rapid transit rail, these inherited measures can be easily explained by these classical measures of centrality, for the Boston underground transportation system we have found nontrivial results.     

Event-based state estimation for a class of complex networks with time-varying delays: A comparison principle approach

The paper is concerned with the state estimation problem for a class of time-delayed complex networks with event-triggering communication protocol. A novel event generator function, which is dependent not only on the measurement output but also on a predefined positive constant, is proposed with hope to reduce the communication burden. A new concept of exponentially ultimate boundedness is provided to quantify the estimation performance. By means of the comparison principle, some sufficient conditions are obtained to guarantee that the estimation error is exponentially ultimately bounded, and then the estimator gains are obtained in terms of the solution of certain matrix inequalities. Furthermore, a rigorous proof is proposed to show that the designed triggering condition is free of the Zeno behavior. Finally, a numerical example is given to illustrate the effectiveness of the proposed event-based estimator.     

Effects of delayed recovery and nonuniform transmission on the spreading of diseases in complex networks

We investigate the effects of delaying the time to recovery (delayed recovery) and of nonuniform transmission on the propagation of diseases on structured populations. Through a mean-field approximation and large-scale numerical simulations, we find that postponing the transition from the infectious to the recovered states can largely reduce the epidemic threshold, therefore promoting the outbreak of epidemics. On the other hand, if we consider nonuniform transmission among individuals, the epidemic threshold increases, thus inhibiting the spreading process. When both mechanisms are at work, the latter might prevail, hence resulting in an increase of the epidemic threshold with respect to the standard case, in which both ingredients are absent. Our findings are of interest for a better understanding of how diseases propagate on structured populations and to a further design of efficient immunization strategies.     

Dynamic discrimination of convergence of the LMS time delay estimation in complicated noisy environments

For nonstationary signals, time constant can no longer represent the actual convergence performance of the adaptive delay estimation. A scheme is thus proposed for dynamically discriminating the convergence of the LMS time delay estimation to get an optimal estimate even under complicated noisy environments. Based on the fact that the filter output gets orthogonal to the estimation error only when an adaptive filter operates in its optimal condition, an approximate orthogonality constraint is derived for discriminating the practical adaptation’s convergence. This discrimination condition, which is obtained through the estimated mean-square values of related available variables at each iteration, can be updated in the adaptation process according to the varying statistic characteristics of observed signals. Thus, it can dynamically evaluate the quality of the adaptive solution and end the iteration opportunely. Simulation results are also included to demonstrate its effectiveness to give exact convergence results in both stationary and nonstationary cases.     

使用基于动态程序规划的时间延迟法分析直线磁化等离子体漂移波湍流角向传播速度和带状流结构

对等离子体湍流速度场的有效探测,有助于更加深入了解磁约束等离子体湍流以及实现对某些理论预言现象和结构(如带状流)的充分辨识.本文将基于动态程序规划的时间延迟估算技术成功应用于直线磁化等离子体装置中热阴极放电条件下的漂移波湍流角向速度涨落的实验分析,并且其结果清晰再现了漂移波湍流中通过非线性能量耦合自发产生的带状流结构.通过对采用不同频段等离子体湍流涨落通过基于动态程序规划的时间延迟估算分析所再现的带状流结构特征进行比较,进一步就该算法对载波信号中非相干噪声相对水平的抗干扰能力进行了定性评估.这些工作的成功开展,对于通过采用基于动态程序规划的时间延迟估算分析技术更为深入有效探索磁约束等离子体湍流行为特征,尤其是速度涨落场的演化提供了重要的借鉴和参考价值.     

基于Voronoi图盲区的无线传感器网络覆盖控制部署策略

针对无线传感器网络在二维平面应用场景中的覆盖控制问题, 提出了一种基于泰森盲区多边形形心的覆盖控制部署策略(blind-zone centroid-based scheme, BCBS). BCBS先对监测区域做Voronoi图划分以得到被每个传感器节点覆盖的泰森多边形, 而后根据泰森多边形顶点的覆盖情况分析得出泰森多边形内的盲区, 并构造与盲区形状相近的多边形, 最后以该多边形的几何中心作为传感器节点移动的候选目标位置, 从而达到提高网络覆盖率的目的. 仿真实验结果表明, BCBS在覆盖率、节点分布均匀性与节点覆盖效率等方面相比CBS有明显优势. 关键词： 无线传感器网络 节点覆盖 Voronoi图 多边形形心     

Dynamic modeling and aperiodically intermittent strategy for adaptive finite-time synchronization control of the multi-weighted complex transportation networks with multiple delays

The idea of network splitting according to time delay and weight is introduced. Based on the cyber physical systems(CPS), a class of multi-weighted complex transportation networks with multiple delays is modeled. The finite-time synchronization of the proposed complex transportation networks model is studied systematically. On the basis of the theory of stability, the technique of adaptive control, aperiodically intermittent control and finite-time control, the aperiodically intermittent adaptive finite-time synchronization controller is designed. The controller designed in this paper is beneficial for understanding the synchronization in multi-weighted complex transportation networks with multiple delays. In addition,the conditions for the existence of finite time synchronization have been discussed in detail. And the specific value of the settling finite time for synchronization is obtained. Moreover, the outer coupling configuration matrices are not required to be irreducible or symmetric. Finally, simulation results of the finite-time synchronization problem are given to illustrate the correctness of the results obtained.