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 developm...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.展开更多
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 invo...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.展开更多
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...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.展开更多
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 communicati...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.展开更多
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...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.展开更多
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 Jinp...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”.展开更多
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 ...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.展开更多
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...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 .展开更多
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 rand...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.展开更多
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 metho...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.展开更多
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. ...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.展开更多
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-n...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.展开更多
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 t...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.展开更多
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.展开更多
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 netwo...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.展开更多
As climate change negotiations progress,monitoring biomass and carbon stocks is becoming an important part of the current forest research.Therefore,national governments are interested in developing forest-monitoring s...As climate change negotiations progress,monitoring biomass and carbon stocks is becoming an important part of the current forest research.Therefore,national governments are interested in developing forest-monitoring strategies using geospatial technology.Among statistical methods for mapping biomass,there is a nonparametric approach called k-nearest neighbor(kNN).We compared four variations of distance metrics of the kNN for the spatially-explicit estimation of aboveground biomass in a portion of the Mexican north border of the intertropical zone.Satellite derived,climatic,and topographic predictor variables were combined with the Mexican National Forest Inventory(NFI)data to accomplish the purpose.Performance of distance metrics applied into the kNN algorithm was evaluated using a cross validation leave-one-out technique.The results indicate that the Most Similar Neighbor(MSN)approach maximizes the correlation between predictor and response variables(r=0.9).Our results are in agreement with those reported in the literature.These findings confirm the predictive potential of the MSN approach for mapping forest variables at pixel level under the policy of Reducing Emission from Deforestation and Forest Degradation(REDD+).展开更多
To improve the accuracy of illumination estimation while maintaining a relative fast execution speed, a novel learning-based color constancy using color edge moments and regularized regression in an anchored neighborh...To improve the accuracy of illumination estimation while maintaining a relative fast execution speed, a novel learning-based color constancy using color edge moments and regularized regression in an anchored neighborhood is proposed. First, scene images are represented by the color edge moments of various orders. Then, an iterative regression with a squared Frobenius norm（F-norm） regularizer is introduced to learn the mapping between the edge moments and illuminants in the neighborhood of the anchored sample.Illumination estimation for the test image finally becomes the nearest anchored point search followed by a matrix multiplication using the associated mapping matrix which can be precalculated and stored. Experiments on two standard image datasets show that the proposed approach significantly outperforms the state-of-the-art algorithms with a performance increase of at least 10. 35% and 7. 44% with regard to median angular error.展开更多
"My Neighbor Rosicky,"one of the representative short stories by Willa Cather,the American local colorist famous for her de scription of frontier life on the Great Plains,conveys Cather's deep understand..."My Neighbor Rosicky,"one of the representative short stories by Willa Cather,the American local colorist famous for her de scription of frontier life on the Great Plains,conveys Cather's deep understanding about life.In this paper,the author attempts to apply Jung's archetypal theory to the analysis of Mr.Rosicky,the hero of the short story and gets the conclusion that Mr.Rosicky is in constant pursuit of"Rebirth"through the medium,"the ground."展开更多
文摘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.
基金supported in part by the National Natural Science Foundations of CHINA(Grant No.61771392,No.61771390,No.61871322 and No.61501373)Science and Technology on Avionics Integration Laboratory and the Aeronautical Science Foundation of China(Grant No.201955053002 and No.20185553035)。
文摘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.
基金This work was supported by Science and Technology Research Program of Chongqing Municipal Education Commission(KJZD-M202300502,KJQN201800539).
文摘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.
基金supported in part by the Fundamental Research Funds for the Central Universities under Grant No.2024ZCJH01in part by the National Natural Science Foundation of China(NSFC)under Grant No.62271081in part by the National Key Research and Development Program of China under Grant No.2020YFA0711302.
文摘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.
文摘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.
文摘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”.
文摘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.
文摘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 .
基金supported by the National Natural Science Foundation of China(Grant No.12002246 and No.52178301)Knowledge Innovation Program of Wuhan(Grant No.2022010801020357)+2 种基金the Science Research Foundation of Wuhan Institute of Technology(Grant No.K2021030)2020 annual Open Fund of Failure Mechanics&Engineering Disaster Prevention and Mitigation,Key Laboratory of Sichuan Province(Sichuan University)(Grant No.2020JDS0022)Open Research Fund Program of Hubei Provincial Key Laboratory of Chemical Equipment Intensification and Intrinsic Safety(Grant No.2019KA03)。
文摘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.
文摘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.
基金supported by the Taif University Researchers Supporting Project Number(TURSP-2020/79),Taif University,Taif,Saudi Arabia.
文摘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.
基金Supported by the National Key Research and Development Program (No.2019YFA0707201)the Key Work Program of Institute of Scientific and Technical Information of China (No.ZD2022-01,ZD2023-07)。
文摘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.
基金supported in part by Shaanxi Natural Science Foundation Project (2023-JC-QN-0438)in part by Fundamental Research Funds for the Central Universities (2452021050).
文摘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.
文摘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.
文摘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.
文摘As climate change negotiations progress,monitoring biomass and carbon stocks is becoming an important part of the current forest research.Therefore,national governments are interested in developing forest-monitoring strategies using geospatial technology.Among statistical methods for mapping biomass,there is a nonparametric approach called k-nearest neighbor(kNN).We compared four variations of distance metrics of the kNN for the spatially-explicit estimation of aboveground biomass in a portion of the Mexican north border of the intertropical zone.Satellite derived,climatic,and topographic predictor variables were combined with the Mexican National Forest Inventory(NFI)data to accomplish the purpose.Performance of distance metrics applied into the kNN algorithm was evaluated using a cross validation leave-one-out technique.The results indicate that the Most Similar Neighbor(MSN)approach maximizes the correlation between predictor and response variables(r=0.9).Our results are in agreement with those reported in the literature.These findings confirm the predictive potential of the MSN approach for mapping forest variables at pixel level under the policy of Reducing Emission from Deforestation and Forest Degradation(REDD+).
基金The National Natural Science Foundation of China(No.61503303,51409215)the Fundamental Research Funds for the Central Universities(No.G2015KY0102)
文摘To improve the accuracy of illumination estimation while maintaining a relative fast execution speed, a novel learning-based color constancy using color edge moments and regularized regression in an anchored neighborhood is proposed. First, scene images are represented by the color edge moments of various orders. Then, an iterative regression with a squared Frobenius norm（F-norm） regularizer is introduced to learn the mapping between the edge moments and illuminants in the neighborhood of the anchored sample.Illumination estimation for the test image finally becomes the nearest anchored point search followed by a matrix multiplication using the associated mapping matrix which can be precalculated and stored. Experiments on two standard image datasets show that the proposed approach significantly outperforms the state-of-the-art algorithms with a performance increase of at least 10. 35% and 7. 44% with regard to median angular error.
文摘"My Neighbor Rosicky,"one of the representative short stories by Willa Cather,the American local colorist famous for her de scription of frontier life on the Great Plains,conveys Cather's deep understanding about life.In this paper,the author attempts to apply Jung's archetypal theory to the analysis of Mr.Rosicky,the hero of the short story and gets the conclusion that Mr.Rosicky is in constant pursuit of"Rebirth"through the medium,"the ground."
