In order to reveal the complex network characteristics and evolution principle of China aviation network, the relationship between the node degree and the nearest neighbor average degree and its evolution trace of Chi...In order to reveal the complex network characteristics and evolution principle of China aviation network, the relationship between the node degree and the nearest neighbor average degree and its evolution trace of China aviation network in 1988, 1994, 2001, 2008 and 2015 were 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. According to the statistical data, the node nearest neighbor average degree 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 negative exponential relationship with the nearest neighbor average degree, and the two parameters of the negative exponential relationship had linear evolution trace.展开更多
低压台区拓扑信息的准确记录是进行台区线损分析、三相不平衡治理等工作的基础。针对目前拓扑档案排查成本高且效率低的问题,提出一种基于自适应k近邻(adaptive k nearest neighbor,AKNN)异常检验和自适应密度峰值(adaptive density pea...低压台区拓扑信息的准确记录是进行台区线损分析、三相不平衡治理等工作的基础。针对目前拓扑档案排查成本高且效率低的问题,提出一种基于自适应k近邻(adaptive k nearest neighbor,AKNN)异常检验和自适应密度峰值(adaptive density peaks clustering,ADPC)聚类的低压台区拓扑识别方法。该方法利用动态时间弯曲(dynamic time warping,DTW)距离度量低压台区用户间电压序列的相似性,通过AKNN异常检验算法检验并校正异常的用户与变压器之间的关系(简称“户变关系”),在得到正确户变关系的基础上,采用ADPC聚类算法对台区内用户进行相位识别;最后,通过实际台区算例分析验证了该方法不需要人为设置参数,能有效实现低压台区的拓扑识别,具有较高的适用性与准确性。展开更多
在认知物联网(CIoT, cognitive internet of things)中,由于主用户(PU, primary user)与次级用户(SU,secondary user)之间的非合作特性,单独依靠传统的频谱感知技术判断频谱接入机会存在一定的不可靠性。作为一种重要的辅助信息,PU与SU...在认知物联网(CIoT, cognitive internet of things)中,由于主用户(PU, primary user)与次级用户(SU,secondary user)之间的非合作特性,单独依靠传统的频谱感知技术判断频谱接入机会存在一定的不可靠性。作为一种重要的辅助信息,PU与SU之间的相互位置信息可以协助判断授权频谱的二次接入可能性。提出了一种低复杂度的基于相邻关系的加权质心定位(NB-WCL, neighbor-based weighted centroid localization)算法,通过解决CIoT中SU的定位问题,从而完成CIoT中各个地理位置上是否能够进行频谱接入的决策。在理论层面分析了二维位置估计的均方根误差(RMSE, root mean square error)性能,通过仿真验证了通信半径、节点密集度、阴影影响、路径损失、连通性度量值以及发送数据次数等因素对于算法性能的影响。理论推导与实验结果表明,相对于传统的定位算法,所提方案为CIoT中的SU定位算法提供了更为强健和良好的定位误差性能,能够有效地增强认知物联网中用户频谱接入的可靠性。该方案可以作为认知物联网中的一种高效实用的定位感知方案。展开更多
针对社会网络中节点关系预测困难的问题,提出了一种新的链接预测算法:邻居关系权值算法。该算法将共同邻居节点与其他邻居节点之间的边赋予不同的权值,进而计算被预测节点之间的相似性。算法通过5个社会网络数据集进行实验,采用AUC(area...针对社会网络中节点关系预测困难的问题,提出了一种新的链接预测算法:邻居关系权值算法。该算法将共同邻居节点与其他邻居节点之间的边赋予不同的权值,进而计算被预测节点之间的相似性。算法通过5个社会网络数据集进行实验,采用AUC(area under the receiver operating characteristic curve)指标和Precision指标评价其效果。实验表明新算法的预测准确率整体上高于已有的基于节点相似性的链接预测算法,同时该算法保持了较低的时间复杂度。展开更多
文摘In order to reveal the complex network characteristics and evolution principle of China aviation network, the relationship between the node degree and the nearest neighbor average degree and its evolution trace of China aviation network in 1988, 1994, 2001, 2008 and 2015 were 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. According to the statistical data, the node nearest neighbor average degree 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 negative exponential relationship with the nearest neighbor average degree, and the two parameters of the negative exponential relationship had linear evolution trace.
文摘低压台区拓扑信息的准确记录是进行台区线损分析、三相不平衡治理等工作的基础。针对目前拓扑档案排查成本高且效率低的问题,提出一种基于自适应k近邻(adaptive k nearest neighbor,AKNN)异常检验和自适应密度峰值(adaptive density peaks clustering,ADPC)聚类的低压台区拓扑识别方法。该方法利用动态时间弯曲(dynamic time warping,DTW)距离度量低压台区用户间电压序列的相似性,通过AKNN异常检验算法检验并校正异常的用户与变压器之间的关系(简称“户变关系”),在得到正确户变关系的基础上,采用ADPC聚类算法对台区内用户进行相位识别;最后,通过实际台区算例分析验证了该方法不需要人为设置参数,能有效实现低压台区的拓扑识别,具有较高的适用性与准确性。
文摘针对社会网络中节点关系预测困难的问题,提出了一种新的链接预测算法:邻居关系权值算法。该算法将共同邻居节点与其他邻居节点之间的边赋予不同的权值,进而计算被预测节点之间的相似性。算法通过5个社会网络数据集进行实验,采用AUC(area under the receiver operating characteristic curve)指标和Precision指标评价其效果。实验表明新算法的预测准确率整体上高于已有的基于节点相似性的链接预测算法,同时该算法保持了较低的时间复杂度。
