Natural connectivity has been recently proposed to efficiently characterize the structural robustness of complex networks.The natural connectivity,interpreted as the Helmholtz free energy of a network,can be derived f...Natural connectivity has been recently proposed to efficiently characterize the structural robustness of complex networks.The natural connectivity,interpreted as the Helmholtz free energy of a network,can be derived from the graph spectrum.We extend the concept of natural connectivity to weighted complex networks,in which the weight represents the number of multiple edges.We prove that the weighted natural connectivity changes monotonically when the weights are increased or decreased.We investigate the influence of weight on the network robustness within scenarios of weight changing and show that the weighted natural connectivity allows a precise quantitative analysis of the structural robustness for weighted complex networks.展开更多
In this paper, based on new Lyapunov function, the asymptotic properties of the dynamic neural system with asymmetric connection weights are investigated. Since the dynamic neural system with asymmetric connection wei...In this paper, based on new Lyapunov function, the asymptotic properties of the dynamic neural system with asymmetric connection weights are investigated. Since the dynamic neural system with asymmetric connection weights is more general than that with symmetric ones, the new results are significant in both theory and applications. Specially the new result can cover the asymptotic stability results of linear systems as special cases.展开更多
The bending strength of carbon?fiber/thermoplastic epoxy composites?(CF/TP-EP Compo.)?had?bi-linear increasewith increase of weight-average molecular weight (Mw) of matrix. The transition in the bending strength appea...The bending strength of carbon?fiber/thermoplastic epoxy composites?(CF/TP-EP Compo.)?had?bi-linear increasewith increase of weight-average molecular weight (Mw) of matrix. The transition in the bending strength appeared at around 55k of Mw (“k”?means 103). SEM observation of fractured surface of CF/TP-EP Compo. showed that the fracture mode changed from interfacial failure to fiber breakage dominated failure. The smooth surface of carbon fibers appeared at lower Mw than 55k while some resin remained on the fibers indicating good adhesion between carbon fiber and matrix at higher Mw than 55k. The interfacial shear strength between carbon fiber and matrix bi-linearly increased with an increase of Mw similarly to the bending strength of the composite, measured by the micro droplet test. The dynamic loss tanδ?of the matrix measured at 2?Hz also showed a bi-linear relationship with respect to Mw having a knee point at Mw = 55k. The connection probability of two cracks introduced on?each side of specimens also confirmed that the interfacial strength between carbon fiber and matrix is the key for the mechanical performance of CF/TP-EP Compo. in bending.展开更多
This paper derives some sufficient conditions for exponential stability for the equilibrium point by dividing the state variables of the system according to the characters of the neural networks. The new conditions ar...This paper derives some sufficient conditions for exponential stability for the equilibrium point by dividing the state variables of the system according to the characters of the neural networks. The new conditions are described by some blocks of the interconnection matrix. An example is given to demonstrate the effectiveness of the proposed theory.展开更多
针对容迟网络中节点存储空间有限从而出现大量丢包情况的问题,本文提出了一种适用于节点环境状态的拥塞控制管理策略(congestion control management strategy suitable for the state of the node environment,NEMS):该策略由节点间位...针对容迟网络中节点存储空间有限从而出现大量丢包情况的问题,本文提出了一种适用于节点环境状态的拥塞控制管理策略(congestion control management strategy suitable for the state of the node environment,NEMS):该策略由节点间位置差异相关的控制保留策略和节点自差异相关的丢包策略构成.首先根据节点剩余缓存空间的大小判断节点是处于忙碌状态(BS)还是崩溃状态(CS),当节点处于BS状态时,节点间位置差异相关的控制保留策略结合门限度和连接活跃值的概念分析是否留存新消息.节点自差异相关的丢包策略利用熵权法动态计算各个节点中不同消息属性权重,得到消息丢弃优先级.当拥塞发生,优先删除丢弃优先级大的消息.同时,引入ACK反馈机制,消除网络中已成功投递的冗余消息.仿真结果表明,与无缓存管理的路由策略相比,加入NEMS后使得消息成功投递率增加了约100.93%~200.67%,网络负载降低了约76.05%~81.42%.展开更多
Let D be a weighted digraph with n vertices in which each arc has been assigned a positive number.Let A(D)be the adjacency matrix of D and W(D)=diag(w_(1)^(+),w_(2)^(+),...,w_(n)^(+)).In this paper,we study the matrix...Let D be a weighted digraph with n vertices in which each arc has been assigned a positive number.Let A(D)be the adjacency matrix of D and W(D)=diag(w_(1)^(+),w_(2)^(+),...,w_(n)^(+)).In this paper,we study the matrix A_(α)(D),which is defined as Aα(D)=αW(D)+(1−α)A(D),0≤α≤1.The spectral radius of A_(α)(D)is called the Aαspectral radius of D,denoted byλα(D).We obtain some upper bounds on the Aαspectral radius of strongly connected irregular weighted digraphs.展开更多
基金Supported by the National Science Foundation of China under Grant Nos 60904065,71031007 and 71101013the Program for New Century Excellent Talents in University under Grant No NCET-12-0141.
文摘Natural connectivity has been recently proposed to efficiently characterize the structural robustness of complex networks.The natural connectivity,interpreted as the Helmholtz free energy of a network,can be derived from the graph spectrum.We extend the concept of natural connectivity to weighted complex networks,in which the weight represents the number of multiple edges.We prove that the weighted natural connectivity changes monotonically when the weights are increased or decreased.We investigate the influence of weight on the network robustness within scenarios of weight changing and show that the weighted natural connectivity allows a precise quantitative analysis of the structural robustness for weighted complex networks.
文摘In this paper, based on new Lyapunov function, the asymptotic properties of the dynamic neural system with asymmetric connection weights are investigated. Since the dynamic neural system with asymmetric connection weights is more general than that with symmetric ones, the new results are significant in both theory and applications. Specially the new result can cover the asymptotic stability results of linear systems as special cases.
文摘The bending strength of carbon?fiber/thermoplastic epoxy composites?(CF/TP-EP Compo.)?had?bi-linear increasewith increase of weight-average molecular weight (Mw) of matrix. The transition in the bending strength appeared at around 55k of Mw (“k”?means 103). SEM observation of fractured surface of CF/TP-EP Compo. showed that the fracture mode changed from interfacial failure to fiber breakage dominated failure. The smooth surface of carbon fibers appeared at lower Mw than 55k while some resin remained on the fibers indicating good adhesion between carbon fiber and matrix at higher Mw than 55k. The interfacial shear strength between carbon fiber and matrix bi-linearly increased with an increase of Mw similarly to the bending strength of the composite, measured by the micro droplet test. The dynamic loss tanδ?of the matrix measured at 2?Hz also showed a bi-linear relationship with respect to Mw having a knee point at Mw = 55k. The connection probability of two cracks introduced on?each side of specimens also confirmed that the interfacial strength between carbon fiber and matrix is the key for the mechanical performance of CF/TP-EP Compo. in bending.
文摘This paper derives some sufficient conditions for exponential stability for the equilibrium point by dividing the state variables of the system according to the characters of the neural networks. The new conditions are described by some blocks of the interconnection matrix. An example is given to demonstrate the effectiveness of the proposed theory.
文摘针对容迟网络中节点存储空间有限从而出现大量丢包情况的问题,本文提出了一种适用于节点环境状态的拥塞控制管理策略(congestion control management strategy suitable for the state of the node environment,NEMS):该策略由节点间位置差异相关的控制保留策略和节点自差异相关的丢包策略构成.首先根据节点剩余缓存空间的大小判断节点是处于忙碌状态(BS)还是崩溃状态(CS),当节点处于BS状态时,节点间位置差异相关的控制保留策略结合门限度和连接活跃值的概念分析是否留存新消息.节点自差异相关的丢包策略利用熵权法动态计算各个节点中不同消息属性权重,得到消息丢弃优先级.当拥塞发生,优先删除丢弃优先级大的消息.同时,引入ACK反馈机制,消除网络中已成功投递的冗余消息.仿真结果表明,与无缓存管理的路由策略相比,加入NEMS后使得消息成功投递率增加了约100.93%~200.67%,网络负载降低了约76.05%~81.42%.
基金Supported by the National Natural Science Foundation of China (Grant No.12001434)The Natural Science Basic Research Program of Shaanxi Province (Grant No.2022JM-006)Chinese Universities Scientific Fund (Grant No.2452020021)
文摘Let D be a weighted digraph with n vertices in which each arc has been assigned a positive number.Let A(D)be the adjacency matrix of D and W(D)=diag(w_(1)^(+),w_(2)^(+),...,w_(n)^(+)).In this paper,we study the matrix A_(α)(D),which is defined as Aα(D)=αW(D)+(1−α)A(D),0≤α≤1.The spectral radius of A_(α)(D)is called the Aαspectral radius of D,denoted byλα(D).We obtain some upper bounds on the Aαspectral radius of strongly connected irregular weighted digraphs.
