In order to reveal the complex network characteristics and evolution principle of China aviation network,the relationship between the average degree and the average path length of edge vertices of China aviation netwo...In order to reveal the complex network characteristics and evolution principle of China aviation network,the relationship between the average degree and the average path length of edge vertices of China aviation network in 1988,1994,2001,2008 and 2015 was studied.According to the theory and method of complex network,the network system was constructed with the city where the airport was located as the network node and the airline as the edge of the network.On the basis of the statistical data,the average degree and average path length of edge vertices of China aviation network in 1988,1994,2001,2008 and 2015 were calculated.Through regression analysis,it was found that the average degree had a logarithmic relationship with the average path length of edge vertices and the two parameters of the logarithmic relationship had linear evolutionary trace.展开更多
The mean path length(MPL)of photons is a critical parameter to calculate tissue absorption coefficient as well as blood oxygenation using modified Beer-Lambert law,where in the differential path factor(DPF)is often as...The mean path length(MPL)of photons is a critical parameter to calculate tissue absorption coefficient as well as blood oxygenation using modified Beer-Lambert law,where in the differential path factor(DPF)is often assumed as constant over range of tissue absorption.By utilizing the Monte Carlo(MC)simulation of photon migrations in the leg,this study used four approaches to estimate MPL,and compared them with that determined by the MPL definition.The simulation results indicate that the DPF is remarkably affected by tissue absorption,at approximate 10% variation.A linear model is suggested to calculate MPL for measurements of tissue absorption as well as blood oxygenation using modified Beer-Lambert law.展开更多
In order to reveal the complex network characteristics and evolution principle of China aviation network,the relationship between the node degree and the average path length of China aviation network in 1988,1994,2001...In order to reveal the complex network characteristics and evolution principle of China aviation network,the relationship between the node degree and the average path length of China aviation network in 1988,1994,2001,2008 and 2015 was studied.According to the theory and method of complex network,the network system was constructed with the city where the airport was located as the network node and the airline as the edge of the network.On the basis of the statistical data,the node average path length of China aviation network in 1988,1994,2001,2008 and 2015 was calculated.Through regression analysis,it was found that the node degree had a logarithmic relationship with the average length of node path,and the two parameters of the logarithmic relationship had linear evolutionary trace.Key word:China aviation network,complex network,node degree,average length of node path,logarithmic relationship,evolutionary trace.展开更多
The object of this study is to propose a statistical model for predicting the Expected Path Length (expected number of steps the attacker will take, starting from the initial state to compromise the security goal—EPL...The object of this study is to propose a statistical model for predicting the Expected Path Length (expected number of steps the attacker will take, starting from the initial state to compromise the security goal—EPL) in a cyber-attack. The model we developed is based on utilizing vulnerability information along with having host centric attack graph. Utilizing the developed model, one can identify the interaction among the vulnerabilities and individual variables (risk factors) that drive the Expected Path Length. Gaining a better understanding of the relationship between vulnerabilities and their interactions can provide security administrators a better view and an understanding of their security status. In addition, we have also ranked the attributable variables and their contribution in estimating the subject length. Thus, one can utilize the ranking process to take precautions and actions to minimize Expected Path Length.展开更多
In this paper,based on the adjacency matrix of the network and its powers,the formulas are derived for theshortest path and the average path length,and an effective algorithm is presented.Furthermore,an example is pro...In this paper,based on the adjacency matrix of the network and its powers,the formulas are derived for theshortest path and the average path length,and an effective algorithm is presented.Furthermore,an example is providedto demonstrate the proposed method.展开更多
A hierarchical scheme for clustering data is presented which applies to spaces with a high number of dimensions (). The data set is first reduced to a smaller set of partitions (multi-dimensional bins). Multiple clust...A hierarchical scheme for clustering data is presented which applies to spaces with a high number of dimensions (). The data set is first reduced to a smaller set of partitions (multi-dimensional bins). Multiple clustering techniques are used, including spectral clustering;however, new techniques are also introduced based on the path length between partitions that are connected to one another. A Line-of-Sight algorithm is also developed for clustering. A test bank of 12 data sets with varying properties is used to expose the strengths and weaknesses of each technique. Finally, a robust clustering technique is discussed based on reaching a consensus among the multiple approaches, overcoming the weaknesses found individually.展开更多
Transparent liquid flattening or stretching realizes optical path length modulation. A flat thin seal transparent cavity, one flank is an electromagnetic driving membrane and is filled over with transparent liquid. Vi...Transparent liquid flattening or stretching realizes optical path length modulation. A flat thin seal transparent cavity, one flank is an electromagnetic driving membrane and is filled over with transparent liquid. Vibration of the membrane makes the liquid compressing or stretching, changes the liquid layer thickness, i.e. the optical path length of light through the liquid layer. The liquid layer compressed is equivalent to increase membrane tension. The membrane has higher resonant frequency. The cavity diameter 10 mm modulation frequency is about 18 kHz.展开更多
We develop a quantum key distribution (QKD) system with fast active optical path length compensation. A rapid and reliable active optical path length compensation scheme is proposed and applied to a plug-and-play QKD ...We develop a quantum key distribution (QKD) system with fast active optical path length compensation. A rapid and reliable active optical path length compensation scheme is proposed and applied to a plug-and-play QKD system. The system monitors changes in key rates and controls it is own operation automatically. The system achieves its optimal performance within three seconds of operation, which includes a sifted key rate of 5.5 kbps and a quantum bit error rate of less than 2% after an abrupt temperature variation along the 25 km quantum channel. The system also operates well over a 24 h period while completing more than 60 active optical path length compensations.展开更多
Path length calculation is a frequent requirement in studies related to graph theoretic problems such as genetics. Standard method to calculate average path length （APL） of a graph requires traversing all nodes in t...Path length calculation is a frequent requirement in studies related to graph theoretic problems such as genetics. Standard method to calculate average path length （APL） of a graph requires traversing all nodes in the graph repeatedly, which is computationally expensive for graphs containing large number of nodes. We propose a novel method to calculate APL for graphs commonly required in the studies of genetics. The proposed method is computationally less expensive and less time-consuming compared to standard method.展开更多
We say that a parameter p of directed graphs has the interval property if for every graph G?and orientations of G, p can take every value between its minimum and maximum values. Let λbe the length of the lo...We say that a parameter p of directed graphs has the interval property if for every graph G?and orientations of G, p can take every value between its minimum and maximum values. Let λbe the length of the longest directed path. A question asked by C. Lin in [1] is equivalent to the question of whether λhas the interval property. In this note, we answer this question in the affirmative. We also show that the diameter of directed graphs does not have the interval property.展开更多
In a wireless sensor network, routing messages between two nodes s and t with multiple disjoint paths will increase the throughput, robustness and load balance of the network. The existing researches focus on finding ...In a wireless sensor network, routing messages between two nodes s and t with multiple disjoint paths will increase the throughput, robustness and load balance of the network. The existing researches focus on finding multiple disjoint paths connecting s and t efficiently, but they do not consider length constraint of the paths. A too long path will be useless because of high latency and high packet loss rate. This paper deals with such a problem: given two nodes s and t in a sensor network, finding as many as possible disjoint paths connecting s and t whose lengths are no more than L, where L is the length bound set by the users. By now, we know that this problem is not only NP hard but also APX complete [1,2], which means that there is no PTAS for this problem. To the best of our knowledge, there is only one heuristic algorithm proposed for this problem [3], and it is not suitable for sensor network because it processes in a centralized way. This paper proposes an efficient distributed algorithm for this problem. By processing in a distributed way, the algorithm is very communication efficient. Simulation results show that our algorithm outperforms the existing algorithm in both aspects of found path number and communication efficiency.展开更多
In order to reveal the complex network feature and its evolution principle of aviation network of China,probability distribution and its evolution trace of average length of node path of aviation network of China were...In order to reveal the complex network feature and its evolution principle of aviation network of China,probability distribution and its evolution trace of average length of node path of aviation network of China were researched according to statistics data in years 1988,1994,2001,2008 and 2015 of civil aviation of China.Floyd algorithm to calculate the path length between any two nodes of network was applied and average length of node path of aviation network was obtained according to this algorithm.It was discovered that average length of node path to other nodes had normal distribution function in each year.At meantime,the location parameter and scale parameter of normal distribution function had linear evolution trace.Airline rate was an index to describe the density of airline.It was found that average length of node path of aviation network of China evolved synchronously with airline rate and they had linear relationship.展开更多
This paper proposes a new methodology to optimize trajectory of the path for multi-robots using improved gravitational search algorithm(IGSA) in clutter environment. Classical GSA has been improved in this paper based...This paper proposes a new methodology to optimize trajectory of the path for multi-robots using improved gravitational search algorithm(IGSA) in clutter environment. Classical GSA has been improved in this paper based on the communication and memory characteristics of particle swarm optimization(PSO). IGSA technique is incorporated into the multi-robot system in a dynamic framework, which will provide robust performance, self-deterministic cooperation, and coping with an inhospitable environment. The robots in the team make independent decisions, coordinate, and cooperate with each other to accomplish a common goal using the developed IGSA. A path planning scheme has been developed using IGSA to optimally obtain the succeeding positions of the robots from the existing position in the proposed environment. Finally, the analytical and experimental results of the multi-robot path planning were compared with those obtained by IGSA, GSA and differential evolution(DE) in a similar environment. The simulation and the Khepera environment result show outperforms of IGSA as compared to GSA and DE with respect to the average total trajectory path deviation, average uncovered trajectory target distance and energy optimization in terms of rotation.展开更多
Network information mining is the study of the network topology,which may answer a large number of applicationbased questions towards the structural evolution and the function of a real system.The question can be rela...Network information mining is the study of the network topology,which may answer a large number of applicationbased questions towards the structural evolution and the function of a real system.The question can be related to how the real system evolves or how individuals interact with each other in social networks.Although the evolution of the real system may seem to be found regularly,capturing patterns on the whole process of evolution is not trivial.Link prediction is one of the most important technologies in network information mining,which can help us understand the evolution mechanism of real-life network.Link prediction aims to uncover missing links or quantify the likelihood of the emergence of nonexistent links from known network structures.Currently,widely existing methods of link prediction almost focus on short-path networks that usually have a myriad of close triangular structures.However,these algorithms on highly sparse or longpath networks have poor performance.Here,we propose a new index that is associated with the principles of structural equivalence and shortest path length(SESPL)to estimate the likelihood of link existence in long-path networks.Through a test of 548 real networks,we find that SESPL is more effective and efficient than other similarity-based predictors in long-path networks.Meanwhile,we also exploit the performance of SESPL predictor and of embedding-based approaches via machine learning techniques.The results show that the performance of SESPL can achieve a gain of 44.09%over GraphWave and 7.93%over Node2vec.Finally,according to the matrix of maximal information coefficient(MIC)between all the similarity-based predictors,SESPL is a new independent feature in the space of traditional similarity features.展开更多
文摘In order to reveal the complex network characteristics and evolution principle of China aviation network,the relationship between the average degree and the average path length of edge vertices of China aviation network in 1988,1994,2001,2008 and 2015 was studied.According to the theory and method of complex network,the network system was constructed with the city where the airport was located as the network node and the airline as the edge of the network.On the basis of the statistical data,the average degree and average path length of edge vertices of China aviation network in 1988,1994,2001,2008 and 2015 were calculated.Through regression analysis,it was found that the average degree had a logarithmic relationship with the average path length of edge vertices and the two parameters of the logarithmic relationship had linear evolutionary trace.
基金Research Funds from North University of China(No.130087)
文摘The mean path length(MPL)of photons is a critical parameter to calculate tissue absorption coefficient as well as blood oxygenation using modified Beer-Lambert law,where in the differential path factor(DPF)is often assumed as constant over range of tissue absorption.By utilizing the Monte Carlo(MC)simulation of photon migrations in the leg,this study used four approaches to estimate MPL,and compared them with that determined by the MPL definition.The simulation results indicate that the DPF is remarkably affected by tissue absorption,at approximate 10% variation.A linear model is suggested to calculate MPL for measurements of tissue absorption as well as blood oxygenation using modified Beer-Lambert law.
文摘In order to reveal the complex network characteristics and evolution principle of China aviation network,the relationship between the node degree and the average path length of China aviation network in 1988,1994,2001,2008 and 2015 was studied.According to the theory and method of complex network,the network system was constructed with the city where the airport was located as the network node and the airline as the edge of the network.On the basis of the statistical data,the node average path length of China aviation network in 1988,1994,2001,2008 and 2015 was calculated.Through regression analysis,it was found that the node degree had a logarithmic relationship with the average length of node path,and the two parameters of the logarithmic relationship had linear evolutionary trace.Key word:China aviation network,complex network,node degree,average length of node path,logarithmic relationship,evolutionary trace.
文摘The object of this study is to propose a statistical model for predicting the Expected Path Length (expected number of steps the attacker will take, starting from the initial state to compromise the security goal—EPL) in a cyber-attack. The model we developed is based on utilizing vulnerability information along with having host centric attack graph. Utilizing the developed model, one can identify the interaction among the vulnerabilities and individual variables (risk factors) that drive the Expected Path Length. Gaining a better understanding of the relationship between vulnerabilities and their interactions can provide security administrators a better view and an understanding of their security status. In addition, we have also ranked the attributable variables and their contribution in estimating the subject length. Thus, one can utilize the ranking process to take precautions and actions to minimize Expected Path Length.
基金National Natural Science Foundation of China under the Key Project under Grant Nos.10635040 and 60774073the Natural Science Foundation of Jiangsu Province of China under Grant No.BK2007075
文摘In this paper,based on the adjacency matrix of the network and its powers,the formulas are derived for theshortest path and the average path length,and an effective algorithm is presented.Furthermore,an example is providedto demonstrate the proposed method.
文摘A hierarchical scheme for clustering data is presented which applies to spaces with a high number of dimensions (). The data set is first reduced to a smaller set of partitions (multi-dimensional bins). Multiple clustering techniques are used, including spectral clustering;however, new techniques are also introduced based on the path length between partitions that are connected to one another. A Line-of-Sight algorithm is also developed for clustering. A test bank of 12 data sets with varying properties is used to expose the strengths and weaknesses of each technique. Finally, a robust clustering technique is discussed based on reaching a consensus among the multiple approaches, overcoming the weaknesses found individually.
文摘Transparent liquid flattening or stretching realizes optical path length modulation. A flat thin seal transparent cavity, one flank is an electromagnetic driving membrane and is filled over with transparent liquid. Vibration of the membrane makes the liquid compressing or stretching, changes the liquid layer thickness, i.e. the optical path length of light through the liquid layer. The liquid layer compressed is equivalent to increase membrane tension. The membrane has higher resonant frequency. The cavity diameter 10 mm modulation frequency is about 18 kHz.
基金was supported by the ICT R&D programs of Ministry of Science, ICT and Future Planning/Institute for Information & Communications Technology Promotion (Grant No. B0101-16-1355)the Korea Institute of Science and Technology research program (Grant No. 2E27231)Korea Institute of Science and Technology-Electronics And Telecommunications Research Institute research program (Grant No. 2V05340)
文摘We develop a quantum key distribution (QKD) system with fast active optical path length compensation. A rapid and reliable active optical path length compensation scheme is proposed and applied to a plug-and-play QKD system. The system monitors changes in key rates and controls it is own operation automatically. The system achieves its optimal performance within three seconds of operation, which includes a sifted key rate of 5.5 kbps and a quantum bit error rate of less than 2% after an abrupt temperature variation along the 25 km quantum channel. The system also operates well over a 24 h period while completing more than 60 active optical path length compensations.
文摘Path length calculation is a frequent requirement in studies related to graph theoretic problems such as genetics. Standard method to calculate average path length （APL） of a graph requires traversing all nodes in the graph repeatedly, which is computationally expensive for graphs containing large number of nodes. We propose a novel method to calculate APL for graphs commonly required in the studies of genetics. The proposed method is computationally less expensive and less time-consuming compared to standard method.
文摘We say that a parameter p of directed graphs has the interval property if for every graph G?and orientations of G, p can take every value between its minimum and maximum values. Let λbe the length of the longest directed path. A question asked by C. Lin in [1] is equivalent to the question of whether λhas the interval property. In this note, we answer this question in the affirmative. We also show that the diameter of directed graphs does not have the interval property.
文摘In a wireless sensor network, routing messages between two nodes s and t with multiple disjoint paths will increase the throughput, robustness and load balance of the network. The existing researches focus on finding multiple disjoint paths connecting s and t efficiently, but they do not consider length constraint of the paths. A too long path will be useless because of high latency and high packet loss rate. This paper deals with such a problem: given two nodes s and t in a sensor network, finding as many as possible disjoint paths connecting s and t whose lengths are no more than L, where L is the length bound set by the users. By now, we know that this problem is not only NP hard but also APX complete [1,2], which means that there is no PTAS for this problem. To the best of our knowledge, there is only one heuristic algorithm proposed for this problem [3], and it is not suitable for sensor network because it processes in a centralized way. This paper proposes an efficient distributed algorithm for this problem. By processing in a distributed way, the algorithm is very communication efficient. Simulation results show that our algorithm outperforms the existing algorithm in both aspects of found path number and communication efficiency.
文摘In order to reveal the complex network feature and its evolution principle of aviation network of China,probability distribution and its evolution trace of average length of node path of aviation network of China were researched according to statistics data in years 1988,1994,2001,2008 and 2015 of civil aviation of China.Floyd algorithm to calculate the path length between any two nodes of network was applied and average length of node path of aviation network was obtained according to this algorithm.It was discovered that average length of node path to other nodes had normal distribution function in each year.At meantime,the location parameter and scale parameter of normal distribution function had linear evolution trace.Airline rate was an index to describe the density of airline.It was found that average length of node path of aviation network of China evolved synchronously with airline rate and they had linear relationship.
文摘This paper proposes a new methodology to optimize trajectory of the path for multi-robots using improved gravitational search algorithm(IGSA) in clutter environment. Classical GSA has been improved in this paper based on the communication and memory characteristics of particle swarm optimization(PSO). IGSA technique is incorporated into the multi-robot system in a dynamic framework, which will provide robust performance, self-deterministic cooperation, and coping with an inhospitable environment. The robots in the team make independent decisions, coordinate, and cooperate with each other to accomplish a common goal using the developed IGSA. A path planning scheme has been developed using IGSA to optimally obtain the succeeding positions of the robots from the existing position in the proposed environment. Finally, the analytical and experimental results of the multi-robot path planning were compared with those obtained by IGSA, GSA and differential evolution(DE) in a similar environment. The simulation and the Khepera environment result show outperforms of IGSA as compared to GSA and DE with respect to the average total trajectory path deviation, average uncovered trajectory target distance and energy optimization in terms of rotation.
基金supported by the National Natural Science Foundation of China(Grant Nos.61773091 and 62173065)the Industry-University-Research Innovation Fund for Chinese Universities(Grant No.2021ALA03016)+2 种基金the Fund for University Innovation Research Group of Chongqing(Grant No.CXQT21005)the National Social Science Foundation of China(Grant No.20CTQ029)the Fundamental Research Funds for the Central Universities(Grant No.SWU119062).
文摘Network information mining is the study of the network topology,which may answer a large number of applicationbased questions towards the structural evolution and the function of a real system.The question can be related to how the real system evolves or how individuals interact with each other in social networks.Although the evolution of the real system may seem to be found regularly,capturing patterns on the whole process of evolution is not trivial.Link prediction is one of the most important technologies in network information mining,which can help us understand the evolution mechanism of real-life network.Link prediction aims to uncover missing links or quantify the likelihood of the emergence of nonexistent links from known network structures.Currently,widely existing methods of link prediction almost focus on short-path networks that usually have a myriad of close triangular structures.However,these algorithms on highly sparse or longpath networks have poor performance.Here,we propose a new index that is associated with the principles of structural equivalence and shortest path length(SESPL)to estimate the likelihood of link existence in long-path networks.Through a test of 548 real networks,we find that SESPL is more effective and efficient than other similarity-based predictors in long-path networks.Meanwhile,we also exploit the performance of SESPL predictor and of embedding-based approaches via machine learning techniques.The results show that the performance of SESPL can achieve a gain of 44.09%over GraphWave and 7.93%over Node2vec.Finally,according to the matrix of maximal information coefficient(MIC)between all the similarity-based predictors,SESPL is a new independent feature in the space of traditional similarity features.
