Nonlinear Relationship and Its Evolutionary Trace between Average Degree and Average Path Length of Edge Vertices of China Aviation Network Based on Complex Network

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.

Effects of tissue absorption on calculation of mean photon path length using modified Beer-Lambert law

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.

Nonlinear Relationship and Its Evolutionary Trace between Node Degree and Average Path Length of China Aviation Network Based on Complex Network

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.

Cybersecurity: A Statistical Predictive Model for the Expected Path Length

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.

A Formula of Average Path Length for Unweighted Networks

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.

High Dimensional Cluster Analysis Using Path Lengths

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.

An Optical Path Length Modulator for Laser Diode Self-Mixing Interference

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.

QKD system with fast active optical path length compensation

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.

On the complexity of average path length for biological networks and patterns

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.

Length of the Longest Path and Diameter in Orientations of Graphs

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.

Finding Multiple Length-Bounded Disjoint Paths in Wireless Sensor Networks

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.

Probability Distribution of Average Length of Node Path and Its Evolution Trace of Aviation Network of China Based on Complex Network

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.

A novel similarity measure for mining missing links in long-path networks

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.

基于Pareto蚁群算法的双目标路径规划研究

针对复杂建筑环境人员应急疏散单一路径不能满足火灾环境变化需求的问题,基于改进蚁群算法,结合Pareto双目标解集思想,提出一种组合优化解集的双目标蚁群算法,通过排序优化的思想,实现人员多路径动态疏散规划。在构造Pareto解集的阶段协同考虑疏散路径长度以及火灾风险程度2个优化目标,计算各个解之间的支配关系。利用排序优化蚁群算法的正反馈机制将各组解的信息素按一定比例作为最优路径信息素的积累,加快解集的寻找。最后将其与传统双目标蚁群算法相比较,结果表明:优化后的双目标算法更加适合复杂建筑人员疏散路径规划问题,在寻找多组满足要求解的同时展示目标之间的利弊关系,供决策者选择合适的路径,提高疏散效率。

基于优化蚁群算法的物流中心拣货路径优化研究

在物流中心,合理规划拣货路径可以提升拣货效率,然而在工作人员拣货的过程中,没有对拣货路径进行合理的时间规划,拣货效率低。鉴于此,对蚁群算法进行改进,在此基础上优化拣货路径,以达到减少拣货路径长度的目的。结果显示,改进蚁群算法有效降低了拣货路径长度,降低了24.49%;改进蚁群算法准确度高,达97.82%;在与遗传算法、传统蚁群算法的对比分析中,改进蚁群算法相比遗传算法路径长度减少了57.86%,相比传统蚁群算法路径长度减少了35.21%。实验验证了改进蚁群算法的优越性,说明改进蚁群算法可以有效优化拣货路径,减少拣货路径长度,提升物流中心的拣货效率。

空间引力波星载望远镜测试与评估技术研究进展

在空间引力波探测任务中,星载望远镜承担太空超长干涉光路双向光束准直的重要作用。空间引力波探测对星载望远镜提出了pm级光程稳定性和低于10^(-10)级后向杂散光水平的极高要求。超高水平指标要求超过了当前测试技术的精度极限,因此,针对星载望远镜发展测试与评估技术并开展系统超高精度测试是空间引力波探测计划成功的重要前提。本文在概述国内外在研的空间引力波探测星载望远镜研制情况的基础上,重点围绕星载望远镜的核心技术指标——光程稳定性和后向杂散光,介绍了在研望远镜的测试技术发展现状和已经取得的部分测试成果,以及各研究单位进一步的测试计划,为我国的空间引力波探测的星载望远镜测试与评估技术发展提供参考。

基于空间句法的矿井应急疏散研究与应用

地下矿井作业危险,空间拓扑结构复杂,因而矿山安全事故时有发生,合理的应急疏散路线规划以及疏散指示布置,能够有效提高井下人员的逃生效率,降低人员伤亡与财产损失。结合某地下矿井实例,基于空间句法和GIS网络分析搭建地下矿井巷道网络模型,从逃生人员的空间认知角度出发,利用标准化角度选择度值选取巷道网络模型中的前景网络和背景网络作为主要避险通道,为应急疏散指示标志布置提供参考;考虑巷道宽度、巷道类型、巷道坡度等巷道基础属性信息,并结合空间句法指标——标准化角度整合度,构建巷道网络应急脆弱模型,顾及巷道空间单元的稳定性,规划井下人员的最优认知路径,进而实现了多目标的地下矿井紧急疏散路线规划。该研究不仅能够为地下矿井的巷道布局设计提供建议,还可为地下矿井的应急疏散路线规划辅助决策、应急预案制定提供理论依据,同时为紧急避险系统的建设与完善提供新的思路。

基于遗传算法改进的AGV路径规划研究

自动引导搬运车(AGV)节能路径规划可提高AGV使用过程的能效,是实现车间生产节能的一种可行方法。为解决AGV在栅格地图中规划路径时易出现的拐弯角度较多和穿墙等问题,并降低AGV在移动时的能耗,提出一种基于遗传算法改进的AGV路径规划方案。首先减少障碍物角点数,并将路径长度作为目标函数;然后对变异算子进行改进,减少拐弯次数,降低AGV在运动过程中的能耗,提高AGV运行的安全性。仿真结果表明,相比普通遗传算法,改进方法能够找到长度短、能耗更低且安全的路径。

婴儿痉挛症儿童脑网络特点及ACTH疗效分析

目的探讨婴儿痉挛症(IS)儿童脑网络特点及与促肾上腺皮质激素(ACTH)疗效的相关性。方法选取2018年12月至2022年8月安徽省儿童医院确诊IS并给予ACTH治疗的20例患儿(IS组)为研究对象。另纳入同期20例健康儿童作为对照组。分析两组患儿脑电图数据,比较其脑网络属性并进行ACTH预后相关分析。结果Sigma频段下,IS组特征路径长度(CPL)低于对照组,全局效率(GE)高于对照组,传递性(T)低于对照组,差异均有统计学意义(P<0.05)。IS组Pz电极中介中心性(BC)在alpha、sigma频段下小于对照组,差异有统计学意义(P<0.05)。进一步分析发现,Sigma频段下CPL越高、GE越低,ACTH短期疗效更好。结论IS患儿存在脑网络属性异常,CPL和GE可能成为评价IS患儿ACTH短期疗效的神经生物学标志物。

多通池内光程实时校正技术用于甲烷浓度测量的方法研究

甲烷(CH4)是目前重要的清洁能源之一——天然气的主要成分,然而其具有易燃易爆的特性,因此监测大气和重要场所的CH4浓度有重要意义。激光吸收光谱技术由于其灵敏度高、检测速度快、选择性好和免接触等优势,在气体测量等领域获得广泛应用。为了获得更高的测量精度,通常使用光学多通池(MPCs)增加吸收光程(OPL)。对吸收光程的实时准确标定具有重要意义,得到光程的准确值结合其他参数等可通过朗伯-比尔(Lambert-Beer)定律直接反演出待测气体浓度而避免传统方法中标准气体定标这一复杂步骤。由于前人采用调频连续波(FMCW)和光学频域反射计(OFDR)法等具有结构较为复杂和运算量大等缺陷,提出了一种基于调幅连续波(AMCW)技术的多通池内光程测量方法,具有结构简单和测量速度快等优势,并将其与激光吸收光谱技术结合实现光程和CH4吸收谱的同时测量。主要通过光纤合束器将测光程的中心波长为650 nm的激光和测吸收谱的中心波长为1654 nm的分布式反馈(DFB)激光器发出的激光同时耦合进物理基长为12 cm的多通池内,在出射端分别测量测光程激光振幅调制的相位和测吸收谱激光的光强以同时获得光程和吸收谱信息。测量使用体积分数为297×10-6的CH4标准气体和CH4在6057.1 cm-1附近的吸收谱线。首先对实验所使用的DFB激光器进行工作电流与输出波数的标定,可将吸收谱的横坐标从点数变换为波数。然后调节光线耦合进多通池的入射角度,测量了4组不同光程与吸收谱数据,多通池内光程和吸收峰值分别为1.606 m和0.0212、3.326 m和0.0445、5.050 m和0.0678与6.762 m和0.0899。将所测光程与通过反射次数估算的光程进行线性拟合,相关系数r≈1;将所测光程与吸收峰值进行线性拟合,两者具有良好的线性关系,r≈0.99987。以上数据验证了AMCW技术用于多通池内光程实时测量的可行性与准确性,为激光吸收光谱技术中光程的确定和浓度的测量提供了一种新方法和思路。