通过对社会集群信息网络(Social Information Network,SIN)的分析,获取现实世界中特定目标的人际关系和社群结构,是社会集群信息网络研究的一个重要方向。这种研究在刑侦司法领域具有重大意义,能够使办案人员在不进行物理抓捕/监视的情...通过对社会集群信息网络(Social Information Network,SIN)的分析,获取现实世界中特定目标的人际关系和社群结构,是社会集群信息网络研究的一个重要方向。这种研究在刑侦司法领域具有重大意义,能够使办案人员在不进行物理抓捕/监视的情况下描绘出犯罪组织内部结构,进而找到犯罪组织核心成员。文章基于现有取证领域的相关研究,结合机器学习神经网络部分算法,提出一个网络取证工具Vec2Rank-CrimeNet,并以真实的犯罪数据作为实验数据,给出其在解决实际问题时的效果。展开更多
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.展开更多
This article analyzes the shift factors of the descending node local time for sun-synchronous satellites and proposes a shift control method to keep the local time shift within an allowance range. It is found that the...This article analyzes the shift factors of the descending node local time for sun-synchronous satellites and proposes a shift control method to keep the local time shift within an allowance range. It is found that the satellite orbit design and the orbit injection deviation are the causes for the initial shift velocity, whereas the atmospheric drag and the sun gravitational perturbation produce the shift acceleration. To deal with these shift factors, a shift control method is put forward, through such methods as orbit variation design, orbit altitude, and inclination keeping control. The simulation experiment and practical application have proved the effectiveness of this control method.展开更多
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.展开更多
It is known in the computational electromagnetics （CEM） that the node element has a relative wellconditioned matrix, but suffers from the spurious solution problem; whereas the edge element has no spurious solutions...It is known in the computational electromagnetics （CEM） that the node element has a relative wellconditioned matrix, but suffers from the spurious solution problem; whereas the edge element has no spurious solutions, but usually produces an ill-conditioned matrix. Particularly, when the mesh is over dense, the iterative solution of the matrix equation from edge element converges very slowly. Based on the node element and edge element, a node-edge element is presented, which has no spurious solutions and better-conditioned matrix. Numerical experiments demonstrate that the proposed node-edge element is more efficient than now-widely used edge element.展开更多
Overlapping community detection in a network is a challenging issue which attracts lots of attention in recent years.A notion of hesitant node（HN） is proposed. An HN contacts with multiple communities while the comm...Overlapping community detection in a network is a challenging issue which attracts lots of attention in recent years.A notion of hesitant node（HN） is proposed. An HN contacts with multiple communities while the communications are not strong or even accidental, thus the HN holds an implicit community structure.However, HNs are not rare in the real world network. It is important to identify them because they can be efficient hubs which form the overlapping portions of communities or simple attached nodes to some communities. Current approaches have difficulties in identifying and clustering HNs. A density-based rough set model（DBRSM） is proposed by combining the virtue of densitybased algorithms and rough set models. It incorporates the macro perspective of the community structure of the whole network and the micro perspective of the local information held by HNs, which would facilitate the further ＂growth＂ of HNs in community. We offer a theoretical support for this model from the point of strength of the trust path. The experiments on the real-world and synthetic datasets show the practical significance of analyzing and clustering the HNs based on DBRSM. Besides, the clustering based on DBRSM promotes the modularity optimization.展开更多
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.展开更多
To deploy sensor nodes over the area of interest,a scheme,named node scattering manipulation,was proposed.It adopted the following method:during node scattering,the initial states of every node,including the velocity ...To deploy sensor nodes over the area of interest,a scheme,named node scattering manipulation,was proposed.It adopted the following method:during node scattering,the initial states of every node,including the velocity and direction,were manipulated so that it would land in a region with a certain probability;every sensor was relocated in order to improve the coverage and connectivity.Simultaneously,to easily analyze the process of scattering sensors,a trajectory model was also proposed.Integrating node scattering manipulation with trajectory model,the node deployment in wireless sensor network was thoroughly renovated,that is,this scheme can scatter sensors.In practice,the scheme was operable compared with the previous achievements.The simulation results demonstrate the superiority and feasibility of the scheme,and also show that the energy consumption for sensors relocation is reduced.展开更多
The optimization of network performance in a movement-assisted data gathering scheme was studied by analyzing the energy consumption of wireless sensor network with node uniform distribution. A theoretically analytica...The optimization of network performance in a movement-assisted data gathering scheme was studied by analyzing the energy consumption of wireless sensor network with node uniform distribution. A theoretically analytical method for avoiding energy hole was proposed. It is proved that if the densities of sensor nodes working at the same time are alternate between dormancy and work with non-uniform node distribution. The efficiency of network can increase by several times and the residual energy of network is nearly zero when the network lifetime ends.展开更多
文摘通过对社会集群信息网络(Social Information Network,SIN)的分析,获取现实世界中特定目标的人际关系和社群结构,是社会集群信息网络研究的一个重要方向。这种研究在刑侦司法领域具有重大意义,能够使办案人员在不进行物理抓捕/监视的情况下描绘出犯罪组织内部结构,进而找到犯罪组织核心成员。文章基于现有取证领域的相关研究,结合机器学习神经网络部分算法,提出一个网络取证工具Vec2Rank-CrimeNet,并以真实的犯罪数据作为实验数据,给出其在解决实际问题时的效果。
基金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.
基金supported by the China Postdotoral Science Foundation(20060401004)
文摘This article analyzes the shift factors of the descending node local time for sun-synchronous satellites and proposes a shift control method to keep the local time shift within an allowance range. It is found that the satellite orbit design and the orbit injection deviation are the causes for the initial shift velocity, whereas the atmospheric drag and the sun gravitational perturbation produce the shift acceleration. To deal with these shift factors, a shift control method is put forward, through such methods as orbit variation design, orbit altitude, and inclination keeping control. The simulation experiment and practical application have proved the effectiveness of this control method.
基金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.
文摘It is known in the computational electromagnetics （CEM） that the node element has a relative wellconditioned matrix, but suffers from the spurious solution problem; whereas the edge element has no spurious solutions, but usually produces an ill-conditioned matrix. Particularly, when the mesh is over dense, the iterative solution of the matrix equation from edge element converges very slowly. Based on the node element and edge element, a node-edge element is presented, which has no spurious solutions and better-conditioned matrix. Numerical experiments demonstrate that the proposed node-edge element is more efficient than now-widely used edge element.
基金supported by the National Natural Science Foundation of China(71271018)
文摘Overlapping community detection in a network is a challenging issue which attracts lots of attention in recent years.A notion of hesitant node（HN） is proposed. An HN contacts with multiple communities while the communications are not strong or even accidental, thus the HN holds an implicit community structure.However, HNs are not rare in the real world network. It is important to identify them because they can be efficient hubs which form the overlapping portions of communities or simple attached nodes to some communities. Current approaches have difficulties in identifying and clustering HNs. A density-based rough set model（DBRSM） is proposed by combining the virtue of densitybased algorithms and rough set models. It incorporates the macro perspective of the community structure of the whole network and the micro perspective of the local information held by HNs, which would facilitate the further ＂growth＂ of HNs in community. We offer a theoretical support for this model from the point of strength of the trust path. The experiments on the real-world and synthetic datasets show the practical significance of analyzing and clustering the HNs based on DBRSM. Besides, the clustering based on DBRSM promotes the modularity optimization.
基金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.
基金Project(2007AA01Z224) supported by National High-Tech Research and Development Program of China
文摘To deploy sensor nodes over the area of interest,a scheme,named node scattering manipulation,was proposed.It adopted the following method:during node scattering,the initial states of every node,including the velocity and direction,were manipulated so that it would land in a region with a certain probability;every sensor was relocated in order to improve the coverage and connectivity.Simultaneously,to easily analyze the process of scattering sensors,a trajectory model was also proposed.Integrating node scattering manipulation with trajectory model,the node deployment in wireless sensor network was thoroughly renovated,that is,this scheme can scatter sensors.In practice,the scheme was operable compared with the previous achievements.The simulation results demonstrate the superiority and feasibility of the scheme,and also show that the energy consumption for sensors relocation is reduced.
基金Project(60873081)supported by the National Natural Science Foundation of ChinaProject(NCET-10-0787)supported by Program for New Century Excellent Talents in UniversityProject(11JJ1012)supported by the Natural Science Foundation of Hunan Province,China
文摘The optimization of network performance in a movement-assisted data gathering scheme was studied by analyzing the energy consumption of wireless sensor network with node uniform distribution. A theoretically analytical method for avoiding energy hole was proposed. It is proved that if the densities of sensor nodes working at the same time are alternate between dormancy and work with non-uniform node distribution. The efficiency of network can increase by several times and the residual energy of network is nearly zero when the network lifetime ends.
