A Shared Natural Neighbors Based-Hierarchical Clustering Algorithm for Discovering Arbitrary-Shaped Clusters

In clustering algorithms,the selection of neighbors significantly affects the quality of the final clustering results.While various neighbor relationships exist,such as K-nearest neighbors,natural neighbors,and shared neighbors,most neighbor relationships can only handle single structural relationships,and the identification accuracy is low for datasets with multiple structures.In life,people’s first instinct for complex things is to divide them into multiple parts to complete.Partitioning the dataset into more sub-graphs is a good idea approach to identifying complex structures.Taking inspiration from this,we propose a novel neighbor method:Shared Natural Neighbors(SNaN).To demonstrate the superiority of this neighbor method,we propose a shared natural neighbors-based hierarchical clustering algorithm for discovering arbitrary-shaped clusters(HC-SNaN).Our algorithm excels in identifying both spherical clusters and manifold clusters.Tested on synthetic datasets and real-world datasets,HC-SNaN demonstrates significant advantages over existing clustering algorithms,particularly when dealing with datasets containing arbitrary shapes.

A Multi-Token Sector Antenna Neighbor Discovery Protocol for Directional Ad Hoc Networks

In this paper,we propose a Multi-token Sector Antenna Neighbor Discovery(M-SAND)protocol to enhance the efficiency of neighbor discovery in asynchronous directional ad hoc networks.The central concept of our work involves maintaining multiple tokens across the network.To prevent mutual interference among multi-token holders,we introduce the time and space non-interference theorems.Furthermore,we propose a master-slave strategy between tokens.When the master token holder(MTH)performs the neighbor discovery,it decides which 1-hop neighbor is the next MTH and which 2-hop neighbors can be the new slave token holders(STHs).Using this approach,the MTH and multiple STHs can simultaneously discover their neighbors without causing interference with each other.Building on this foundation,we provide a comprehensive procedure for the M-SAND protocol.We also conduct theoretical analyses on the maximum number of STHs and the lower bound of multi-token generation probability.Finally,simulation results demonstrate the time efficiency of the M-SAND protocol.When compared to the QSAND protocol,which uses only one token,the total neighbor discovery time is reduced by 28% when 6beams and 112 nodes are employed.

The GSI and Building a Neighborhood Community with a Shared Future

Against the backdrop of the international political and economic configuration featuring that“the East is rising and the West is declining”,relations between China and its neighboring countries enjoy steady development in general.However,the return of the Cold War mentality,rampant protectionism and prominent security governance issues have seriously threatened peace and stability in China’s neighboring region.

Sensing and Communication Integrated Fast Neighbor Discovery for UAV Networks

In unmanned aerial vehicle(UAV)networks,the high mobility of nodes leads to frequent changes in network topology,which brings challenges to the neighbor discovery(ND)for UAV networks.Integrated sensing and communication(ISAC),as an emerging technology in 6G mobile networks,has shown great potential in improving communication performance with the assistance of sensing information.ISAC obtains the prior information about node distribution,reducing the ND time.However,the prior information obtained through ISAC may be imperfect.Hence,an ND algorithm based on reinforcement learning is proposed.The learning automaton(LA)is applied to interact with the environment and continuously adjust the probability of selecting beams to accelerate the convergence speed of ND algorithms.Besides,an efficient ND algorithm in the neighbor maintenance phase is designed,which applies the Kalman filter to predict node movement.Simulation results show that the LA-based ND algorithm reduces the ND time by up to 32%compared with the Scan-Based Algorithm(SBA),which proves the efficiency of the proposed ND algorithms.

Probability Distribution of Arithmetic Average of China Aviation Network Edge Vertices Nearest Neighbor Average Degree Value and Its Evolutionary Trace Based on Complex Network

In order to reveal the complex network characteristics and evolution principle of China aviation network,the probability distribution and evolution trace of arithmetic average of edge vertices nearest neighbor average degree values of China aviation network were studied based on the statistics data of China civil aviation network in 1988,1994,2001,2008 and 2015.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 route between cities as the edge of the network.Based on the statistical data,the arithmetic averages of edge vertices nearest neighbor average degree values of China aviation network in 1988,1994,2001,2008 and 2015 were calculated.Using the probability statistical analysis method,it was found that the arithmetic average of edge vertices nearest neighbor average degree values had the probability distribution of normal function and the position parameters and scale parameters of the probability distribution had linear evolution trace.

基于沙地猫群优化–最小二乘支持向量机的动态NOx排放预测

针对火电机组频繁调峰导致机组燃烧状态不稳,进而导致锅炉出口NOx浓度波动范围大的问题,提出一种基于沙地猫群优化(sand cat sarm optimization,SCSO)的最小二乘支持向量机(leastsquaressupportvectormachine,LSSVM) NOx动态预测模型。首先利用k近邻互信息计算时间延迟的同时筛选辅助变量。然后,基于SCSO算法进行输入变量阶次的选择。使用包含辅助变量时间延迟和阶次的信息作为模型的输入,SCSO算法优化最小二乘支持向量机参数,建立动态NOx排放最小二乘支持向量机预测模型(SCSO-LSSVM动态软测量模型)。最后将模型与未加入迟延的LSSVM模型,加入迟延的LSSVM模型和粒子群优化算法(particle swarm optimization,PSO)优化最小二乘支持向量机参数的动态软测量模型进行对比验证。结果表明,相较于其他模型,该文建立SCSO-LSSVM动态软测量模型均方根误差、平均绝对误差、平均绝对误差最小,预测精度最高,而且在NOx浓度剧烈波动时也能够较好地预测NOx浓度,具有很好的动态特性。

Active learning accelerated Monte-Carlo simulation based on the modified K-nearest neighbors algorithm and its application to reliability estimations

This paper proposes an active learning accelerated Monte-Carlo simulation method based on the modified K-nearest neighbors algorithm.The core idea of the proposed method is to judge whether or not the output of a random input point can be postulated through a classifier implemented through the modified K-nearest neighbors algorithm.Compared to other active learning methods resorting to experimental designs,the proposed method is characterized by employing Monte-Carlo simulation for sampling inputs and saving a large portion of the actual evaluations of outputs through an accurate classification,which is applicable for most structural reliability estimation problems.Moreover,the validity,efficiency,and accuracy of the proposed method are demonstrated numerically.In addition,the optimal value of K that maximizes the computational efficiency is studied.Finally,the proposed method is applied to the reliability estimation of the carbon fiber reinforced silicon carbide composite specimens subjected to random displacements,which further validates its practicability.

China’s Efforts to Build a Community with a Shared Future in the Neighborhood from the Perspective of Major-country Competition

Since the 18th National Congress of the Communist Party of China,China has proposed and actively acted on the important vision of building a community with a shared future for mankind.In October 2013,President Xi Jinping put forward that“the building of a community with a shared future should be advanced in China’s neighboring countries”.

CIIS Organizes International Symposium to Commemorate China’s Principle in Neighborhood Diplomacy

On October 24,the International Symposium to Commemorate the10th Anniversary of China's Principle of Amity,Sincerity,Mutual Benefit and Inclusiveness in Neighborhood Diplomacy was held in Beijing.Co-hosted by the Office of the Central Commission for Foreign Affairs and the Ministry of Foreign Affairs,and organized by China Institute of International Studies(CIIS),the Symposium was attended by more than200 representatives including political figures from neighboring countries,heads of international and regional organizations,diplomatic envoys of neighboring countries to China and renowned experts and scholars.

A Pattern Classification Model for Vowel Data Using Fuzzy Nearest Neighbor

Classification of the patterns is a crucial structure of research and applications. Using fuzzy set theory, classifying the patterns has become of great interest because of its ability to understand the parameters. One of the problemsobserved in the fuzzification of an unknown pattern is that importance is givenonly to the known patterns but not to their features. In contrast, features of thepatterns play an essential role when their respective patterns overlap. In this paper,an optimal fuzzy nearest neighbor model has been introduced in which a fuzzifi-cation process has been carried out for the unknown pattern using k nearest neighbor. With the help of the fuzzification process, the membership matrix has beenformed. In this membership matrix, fuzzification has been carried out of the features of the unknown pattern. Classification results are verified on a completelyllabelled Telugu vowel data set, and the accuracy is compared with the differentmodels and the fuzzy k nearest neighbor algorithm. The proposed model gives84.86% accuracy on 50% training data set and 89.35% accuracy on 80% trainingdata set. The proposed classifier learns well enough with a small amount of training data, resulting in an efficient and faster approach.

Real-Time Data Transmission with Data Carrier Support Value in Neighbor Strategic Collection in WSN

An efficient trust-aware secure routing and network strategy-based data collection scheme is presented in this paper to enhance the performance and security of wireless sensor networks during data collection.The method first discovers the routes between the data sensors and the sink node.Several factors are considered for each sensor node along the route,including energy,number of neighbours,previous transmissions,and energy depletion ratio.Considering all these variables,the Sink Reachable Support Measure and the Secure Communication Support Measure,the method evaluates two distinct measures.The method calculates the data carrier support value using these two metrics.A single route is chosen to collect data based on the value of data carrier support.It has contributed to the design of Secure Communication Support(SCS)Estimation.This has been measured according to the strategy of each hop of the route.The suggested method improves the security and efficacy of data collection in wireless sensor networks.The second stage uses the two-fish approach to build a trust model for secure data transfer.A sim-ulation exercise was conducted to evaluate the effectiveness of the suggested framework.Metrics,including PDR,end-to-end latency,and average residual energy,were assessed for the proposed model.The efficiency of the suggested route design serves as evidence for the average residual energy for the proposed framework.

The g-Good-Neighbor Connectivity of Some Cartesian Product Graphs

The g-good-neighbor connectivity of G is a generalization of the concept of connectivity, which is just for, and an important parameter in measuring the fault tolerance and reliability of interconnection network. Many well-known networks can be constructed by the Cartesian products of some simple graphs. In this paper, we determine the g-good-neighbor connectivity of some Cartesian product graphs. We give the exact value of g-good-neighbor connectivity of the Cartesian product of two complete graphs and for , mesh for , cylindrical grid and torus for .

GHM-FKNN:a generalized Heronian mean based fuzzy k-nearest neighbor classifier for the stock trend prediction

Stock trend prediction is a challenging problem because it involves many variables.Aiming at the problem that some existing machine learning techniques, such as random forest(RF), probabilistic random forest(PRF), k-nearest neighbor(KNN), and fuzzy KNN(FKNN), have difficulty in accurately predicting the stock trend(uptrend or downtrend) for a given date, a generalized Heronian mean(GHM) based FKNN predictor named GHM-FKNN was proposed.GHM-FKNN combines GHM aggregation function with the ideas of the classical FKNN approach.After evaluation, the comparison results elucidated that GHM-FKNN outperformed the other best existing methods RF, PRF, KNN and FKNN on independent test datasets corresponding to three stocks, namely AAPL, AMZN and NFLX.Compared with RF, PRF, KNN and FKNN, GHM-FKNN achieved the best performance with accuracy of 62.37% for AAPL, 58.25% for AMZN, and 64.10% for NFLX.

Diagnosis of Disc Space Variation Fault Degree of Transformer Winding Based on K-Nearest Neighbor Algorithm

Winding is one of themost important components in power transformers.Ensuring the health state of the winding is of great importance to the stable operation of the power system.To efficiently and accurately diagnose the disc space variation(DSV)fault degree of transformer winding,this paper presents a diagnostic method of winding fault based on the K-Nearest Neighbor(KNN)algorithmand the frequency response analysis(FRA)method.First,a laboratory winding model is used,and DSV faults with four different degrees are achieved by changing disc space of the discs in the winding.Then,a series of FRA tests are conducted to obtain the FRA results and set up the FRA dataset.Second,ten different numerical indices are utilized to obtain features of FRA curves of faulted winding.Third,the 10-fold cross-validation method is employed to determine the optimal k-value of KNN.In addition,to improve the accuracy of the KNN model,a comparative analysis is made between the accuracy of the KNN algorithm and k-value under four distance functions.After getting the most appropriate distance metric and kvalue,the fault classificationmodel based on theKNN and FRA is constructed and it is used to classify the degrees of DSV faults.The identification accuracy rate of the proposed model is up to 98.30%.Finally,the performance of the model is presented by comparing with the support vector machine(SVM),SVM optimized by the particle swarmoptimization(PSO-SVM)method,and randomforest(RF).The results show that the diagnosis accuracy of the proposed model is the highest and the model can be used to accurately diagnose the DSV fault degrees of the winding.

基于时域波形特征认知的输电线路近端故障辨识与定位

针对现有单端行波故障测距对近端故障存在测距盲区、双端行波故障测距对近端故障测距误差较大,无法满足工程需要的不足,提出基于波形特征认知的近端故障辨识与定位方法。首先,分析了线路故障行波传播规律,以固定分辨率显示波形。发现线路近端故障时,初始行波及其后续波形在长时窗整体宏观观测下呈堆叠缓变特征,而在短时窗局部放大观测下呈周期性变化特征,且周期与故障距离相关。不同线路的近端故障历史样本能统一作为参照基准为测距提供提示。进而提出基于波形密度和突变分布的近端故障辨识方法。最后,对辨识出的近端故障进行周期估计,利用近端故障与线长的无关性以及历史样本突变周期和故障位置已知性,搜索周期最近邻历史样本,并由已知故障距离插值实现故障位置确定。基于大量实测数据进行仿真测试,结果表明所提方法能够显著提升单端行波测距可靠性和成功率。

Probability Distribution of China Aviation Network Nearest Neighbor Average Degree and Its Evolutionary Trace Based on Complex Network

In order to reveal the complex network characteristics and evolution principle of China aviation network,the probability distribution and evolution trace of node nearest neighbor average degree of China aviation network were studied based on the statistics data of China civil aviation network in 1988,1994,2001,2008 and 2015.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 route between cities as the edge of the network.Based on the statistical data,the nearest neighbor average degrees of nodes in China aviation network in 1988,1994,2001,2008 and 2015 were calculated.Using the probability statistical analysis method,it was found that the nearest neighbor average degree had the probability distribution of normal function and the position parameters and scale parameters of the probability distribution had linear evolution trace.

Nonlinear Relationship and Its Evolutionary Trace between Node Degree and Nearest Neighbor Average Degree 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 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.

基于网格近邻优化的密度峰值聚类算法

密度峰值聚类(DPC)将数据样本点的局部密度和相对距离进行结合,能对任意形状数据集进行聚类处理,但密度峰值聚类算法存在主观选择截断距离、简单分配策略和较高时间复杂度等问题。为此,提出了一种基于网格近邻优化的密度峰值聚类算法(KG-DPC算法)。首先对数据空间进行网格化,减少了样本数据点之间距离的计算量;在计算局部密度时不仅考虑了网格自身的密度值,而且考虑了周围k个近邻的网格密度值,降低了主观选择截断距离对聚类结果的影响,提高了聚类准确率,设定网格密度阈值,保证了聚类结果的稳定性。通过实验结果表明,KG-DPC算法比DBSCAN、DPC和SDPC算法在聚类准确率上有很大提升,在聚类平均消耗时间上DPC、SNN-DPC和DPC-NN算法分别降低38%、44%和44%。在保证基本聚类准确率的基础上,KG-DPC算法在聚类效率上有特定优势。

面向栅格地图的区域渐进均分算法

单架无人机续航能力限制了区域全覆盖侦察,合理的区域划分是实现多无人机协同全域侦察的关键。栅格法规划侦察区域是无人机区域侦察的常用研究方法。为了解决栅格地图等量划分的问题,提出了一种面向栅格地图的区域渐进均分算法。算法由4个阶段构成。阶段1,建立区域边界确认的跳跃迭代法,根据栅格的特点制定判定条件,进行栅格特征标识。阶段2,提出一种双特征标识方法,对射线法进行改进,确定区域内部栅格。阶段3,模仿水波扩散,提出了一种邻边扩散法,实现区域初步的扩散分割。阶段4,设计补偿规则,通过邻边补偿算法,对各子区域栅格数进行数量补偿。实验证明,区域渐进均分算法相较于其他算法,具有较好的聚集性,连续性和均匀性,为多无人机协同全域侦察提供了理论保证。

面向流形数据的加权自然近邻密度峰值聚类算法

流形数据由一些弧线形类簇组成,其特点是同一类簇的样本间距离较大.密度峰值聚类(DPC)算法具有简单高效的特点,但应对流形数据时表现不佳. DPC算法的两种密度度量标准可能造成不同程度的信息缺失,其分配策略仅参考距离和密度,致使聚类精度不高.提出面向流形数据的加权自然近邻DPC(DPC-WNNN)算法,定义样本局部密度时,综合分析样本的局部和全局信息,引入加权的自然近邻以及逆近邻来应对高斯核或截断核的信息缺失问题.设计样本分配策略时通过引入共享近邻和共享逆近邻计算样本相似度,弥补DPC算法空间因素缺失的问题.将DPC-WNNN算法在流形数据集和真实数据集上与7种类似算法进行比较,结果表明该算法能更有效地找到类簇的中心点并准确分配样本,表现出良好的聚类性能.