Identifying influential nodes in complex networks is still an open issue. In this paper, a new comprehensive centrality mea- sure is proposed based on the Dempster-Shafer evidence theory. The existing measures of degr...Identifying influential nodes in complex networks is still an open issue. In this paper, a new comprehensive centrality mea- sure is proposed based on the Dempster-Shafer evidence theory. The existing measures of degree centrality, betweenness centra- lity and closeness centrality are taken into consideration in the proposed method. Numerical examples are used to illustrate the effectiveness of the proposed method.展开更多
Multiple complex networks, each with different properties and mutually fused, have the problems that the evolving process is time varying and non-equilibrium, network structures are layered and interlacing, and evolvi...Multiple complex networks, each with different properties and mutually fused, have the problems that the evolving process is time varying and non-equilibrium, network structures are layered and interlacing, and evolving characteristics are difficult to be measured. On that account, a dynamic evolving model of complex network with fusion nodes and overlap edges（CNFNOEs） is proposed. Firstly, we define some related concepts of CNFNOEs, and analyze the conversion process of fusion relationship and hierarchy relationship. According to the property difference of various nodes and edges, fusion nodes and overlap edges are subsequently split, and then the CNFNOEs is transformed to interlacing layered complex networks（ILCN）. Secondly,the node degree saturation and attraction factors are defined. On that basis, the evolution algorithm and the local world evolution model for ILCN are put forward. Moreover, four typical situations of nodes evolution are discussed, and the degree distribution law during evolution is analyzed by means of the mean field method.Numerical simulation results show that nodes unreached degree saturation follow the exponential distribution with an error of no more than 6%; nodes reached degree saturation follow the distribution of their connection capacities with an error of no more than 3%; network weaving coefficients have a positive correlation with the highest probability of new node and initial number of connected edges. The results have verified the feasibility and effectiveness of the model, which provides a new idea and method for exploring CNFNOE＇s evolving process and law. Also, the model has good application prospects in structure and dynamics research of transportation network, communication network, social contact network,etc.展开更多
Since the latest revision of the TNM system reclassified T3N0 tumours into the ⅡB stage, N2 lesions became the major determinant of the ⅢA stage. Concerning the minority of patients with T3N1 tumours in this stage,
In order to reduce power consumption of sensor nodes and extend network survival time in the wireless sensor network （WSN）, sensor nodes are scheduled in an active or dormant mode. A chain-type WSN is fundamental y ...In order to reduce power consumption of sensor nodes and extend network survival time in the wireless sensor network （WSN）, sensor nodes are scheduled in an active or dormant mode. A chain-type WSN is fundamental y different from other types of WSNs, in which the sensor nodes are deployed along elongated geographic areas and form a chain-type network topo-logy structure. This paper investigates the node scheduling prob-lem in the chain-type WSN. Firstly, a node dormant scheduling mode is analyzed theoretical y from geographic coverage, and then three neighboring nodes scheduling criteria are proposed. Sec-ondly, a hybrid coverage scheduling algorithm and dead areas are presented. Final y, node scheduling in mine tunnel WSN with uniform deployment （UD）, non-uniform deployment （NUD） and op-timal distribution point spacing （ODS） is simulated. The results show that the node scheduling with UD and NUD, especial y NUD, can effectively extend the network survival time. Therefore, a strat-egy of adding a few mobile nodes which activate the network in dead areas is proposed, which can further extend the network survival time by balancing the energy consumption of nodes.展开更多
A new genetic algorithm for community detection in complex networks was proposed. It adopts matrix encoding that enables traditional crossover between individuals. Initial populations are generated using nodes similar...A new genetic algorithm for community detection in complex networks was proposed. It adopts matrix encoding that enables traditional crossover between individuals. Initial populations are generated using nodes similarity, which enhances the diversity of initial individuals while retaining an acceptable level of accuracy, and improves the efficiency of optimal solution search. Individual crossover is based on the quality of individuals' genes; all nodes unassigned to any community are grouped into a new community, while ambiguously placed nodes are assigned to the community to which most of their neighbors belong. Individual mutation, which splits a gene into two new genes or randomly fuses it into other genes, is non-uniform. The simplicity and effectiveness of the algorithm are revealed in experimental tests using artificial random networks and real networks. The accuracy of the algorithm is superior to that of some classic algorithms, and is comparable to that of some recent high-precision algorithms.展开更多
基金supported by the National Natural Science Foundation of China(61174022)the National High Technology Research and Development Program of China(863 Program)(2013AA013801)+2 种基金the Open Funding Project of State Key Laboratory of Virtual Reality Technology and Systems,Beihang University(BUAA-VR-14KF-02)the General Research Program of the Science Supported by Sichuan Provincial Department of Education(14ZB0322)the Fundamental Research Funds for the Central Universities(XDJK2014D008)
文摘Identifying influential nodes in complex networks is still an open issue. In this paper, a new comprehensive centrality mea- sure is proposed based on the Dempster-Shafer evidence theory. The existing measures of degree centrality, betweenness centra- lity and closeness centrality are taken into consideration in the proposed method. Numerical examples are used to illustrate the effectiveness of the proposed method.
基金supported by the National Natural Science Foundation of China(615730176140149961174162)
文摘Multiple complex networks, each with different properties and mutually fused, have the problems that the evolving process is time varying and non-equilibrium, network structures are layered and interlacing, and evolving characteristics are difficult to be measured. On that account, a dynamic evolving model of complex network with fusion nodes and overlap edges（CNFNOEs） is proposed. Firstly, we define some related concepts of CNFNOEs, and analyze the conversion process of fusion relationship and hierarchy relationship. According to the property difference of various nodes and edges, fusion nodes and overlap edges are subsequently split, and then the CNFNOEs is transformed to interlacing layered complex networks（ILCN）. Secondly,the node degree saturation and attraction factors are defined. On that basis, the evolution algorithm and the local world evolution model for ILCN are put forward. Moreover, four typical situations of nodes evolution are discussed, and the degree distribution law during evolution is analyzed by means of the mean field method.Numerical simulation results show that nodes unreached degree saturation follow the exponential distribution with an error of no more than 6%; nodes reached degree saturation follow the distribution of their connection capacities with an error of no more than 3%; network weaving coefficients have a positive correlation with the highest probability of new node and initial number of connected edges. The results have verified the feasibility and effectiveness of the model, which provides a new idea and method for exploring CNFNOE＇s evolving process and law. Also, the model has good application prospects in structure and dynamics research of transportation network, communication network, social contact network,etc.
文摘Since the latest revision of the TNM system reclassified T3N0 tumours into the ⅡB stage, N2 lesions became the major determinant of the ⅢA stage. Concerning the minority of patients with T3N1 tumours in this stage,
基金supported by the China Doctoral Discipline New Teacher Foundation(200802901507)the Sichuan Province Basic Research Plan Project(2013JY0165)the Cultivating Programme of Excellent Innovation Team of Chengdu University of Technology(KYTD201301)
文摘In order to reduce power consumption of sensor nodes and extend network survival time in the wireless sensor network （WSN）, sensor nodes are scheduled in an active or dormant mode. A chain-type WSN is fundamental y different from other types of WSNs, in which the sensor nodes are deployed along elongated geographic areas and form a chain-type network topo-logy structure. This paper investigates the node scheduling prob-lem in the chain-type WSN. Firstly, a node dormant scheduling mode is analyzed theoretical y from geographic coverage, and then three neighboring nodes scheduling criteria are proposed. Sec-ondly, a hybrid coverage scheduling algorithm and dead areas are presented. Final y, node scheduling in mine tunnel WSN with uniform deployment （UD）, non-uniform deployment （NUD） and op-timal distribution point spacing （ODS） is simulated. The results show that the node scheduling with UD and NUD, especial y NUD, can effectively extend the network survival time. Therefore, a strat-egy of adding a few mobile nodes which activate the network in dead areas is proposed, which can further extend the network survival time by balancing the energy consumption of nodes.
文摘A new genetic algorithm for community detection in complex networks was proposed. It adopts matrix encoding that enables traditional crossover between individuals. Initial populations are generated using nodes similarity, which enhances the diversity of initial individuals while retaining an acceptable level of accuracy, and improves the efficiency of optimal solution search. Individual crossover is based on the quality of individuals' genes; all nodes unassigned to any community are grouped into a new community, while ambiguously placed nodes are assigned to the community to which most of their neighbors belong. Individual mutation, which splits a gene into two new genes or randomly fuses it into other genes, is non-uniform. The simplicity and effectiveness of the algorithm are revealed in experimental tests using artificial random networks and real networks. The accuracy of the algorithm is superior to that of some classic algorithms, and is comparable to that of some recent high-precision algorithms.
