A large number of community discovery algorithms have been proposed in the last decade. Recently, the sharp increase of network scale has become a great challenge for traditional community discovery algorithms. Label ...A large number of community discovery algorithms have been proposed in the last decade. Recently, the sharp increase of network scale has become a great challenge for traditional community discovery algorithms. Label propagation algorithm is a semi-supervised machine learning method, which has linear time complexity when coping with large scale networks. However, the output result has less stability and the quality of the output communities still remains to be improved. Therefore, we propose a novel coreleader based label propagation algorithm for community detection called CLBLPA. Firstly, we find core leaders of potential community by using a greedy method. Then we utilize the label influence potential to guide the process of label propagation. Thus we can accelerate the convergence of algorithm and improve the stability of the output. Experimental results on synthetic datasets and real networks show that CLBLPA can significantly improve the quality of the output communities.展开更多
In today’s rapid widespread of digital technologies into all live aspects to enhance efficiency and productivity on the one hand and on the other hand ensure customer engagement, personal data counterfeiting has beco...In today’s rapid widespread of digital technologies into all live aspects to enhance efficiency and productivity on the one hand and on the other hand ensure customer engagement, personal data counterfeiting has become a major concern for businesses and end-users. One solution to ensure data security is encryption, where keys are central. There is therefore a need to find robusts key generation implementation that is effective, inexpensive and non-invasive for protecting and preventing data counterfeiting. In this paper, we use the theory of electromagnetic wave propagation to generate encryption keys.展开更多
Voice classification is important in creating more intelligent systems that help with student exams,identifying criminals,and security systems.The main aim of the research is to develop a system able to predicate and ...Voice classification is important in creating more intelligent systems that help with student exams,identifying criminals,and security systems.The main aim of the research is to develop a system able to predicate and classify gender,age,and accent.So,a newsystem calledClassifyingVoice Gender,Age,and Accent(CVGAA)is proposed.Backpropagation and bagging algorithms are designed to improve voice recognition systems that incorporate sensory voice features such as rhythm-based features used to train the device to distinguish between the two gender categories.It has high precision compared to other algorithms used in this problem,as the adaptive backpropagation algorithm had an accuracy of 98%and the Bagging algorithm had an accuracy of 98.10%in the gender identification data.Bagging has the best accuracy among all algorithms,with 55.39%accuracy in the voice common dataset and age classification and accent accuracy in a speech accent of 78.94%.展开更多
Many network presentation learning algorithms(NPLA)have originated from the process of the random walk between nodes in recent years.Despite these algorithms can obtain great embedding results,there may be also some l...Many network presentation learning algorithms(NPLA)have originated from the process of the random walk between nodes in recent years.Despite these algorithms can obtain great embedding results,there may be also some limitations.For instance,only the structural information of nodes is considered when these kinds of algorithms are constructed.Aiming at this issue,a label and community information-based network presentation learning algorithm(LC-NPLA)is proposed in this paper.First of all,by using the community information and the label information of nodes,the first-order neighbors of nodes are reconstructed.In the next,the random walk strategy is improved by integrating the degree information and label information of nodes.Then,the node sequence obtained from random walk sampling is transformed into the node representation vector by the Skip-Gram model.At last,the experimental results on ten real-world networks demonstrate that the proposed algorithm has great advantages in the label classification,network reconstruction and link prediction tasks,compared with three benchmark algorithms.展开更多
The increased capacity and availability of the Internet has led to a wide variety of applications.Internet traffic characterization and application identification is important for network management.In this paper,base...The increased capacity and availability of the Internet has led to a wide variety of applications.Internet traffic characterization and application identification is important for network management.In this paper,based on detailed flow data collected from the public networks of Internet Service Providers,we construct a flow graph to model the interactions among users.Considering traffic from different applications,we analyze the community structure of the flow graph in terms of community size,degree distribution of the community,community overlap,and overlap modularity.The near linear time community detection algorithm in complex networks,the Label Propagation Algorithm(LPA),is extended to the flow graph for application identification.We propose a new initialization and label propagation and update scheme.Experimental results show that the proposed algorithm has high accuracy and efficiency.展开更多
Community detection is an important methodology for understanding the intrinsic structure and function of a realworld network.In this paper,we propose an effective and efficient algorithm,called Dominant Label Propaga...Community detection is an important methodology for understanding the intrinsic structure and function of a realworld network.In this paper,we propose an effective and efficient algorithm,called Dominant Label Propagation Algorithm(Abbreviated as DLPA),to detect communities in complex networks.The algorithm simulates a special voting process to detect overlapping and non-overlapping community structure in complex networks simultaneously.Our algorithm is very efficient,since its computational complexity is almost linear to the number of edges in the network.Experimental results on both real-world and synthetic networks show that our algorithm also possesses high accuracies on detecting community structure in networks.展开更多
It is a key challenge to exploit the label coupling relationship in multi-label classification(MLC)problems.Most previous work focused on label pairwise relations,in which generally only global statistical information...It is a key challenge to exploit the label coupling relationship in multi-label classification(MLC)problems.Most previous work focused on label pairwise relations,in which generally only global statistical information is used to analyze the coupled label relationship.In this work,firstly Bayesian and hypothesis testing methods are applied to predict the label set size of testing samples within their k nearest neighbor samples,which combines global and local statistical information,and then apriori algorithm is used to mine the label coupling relationship among multiple labels rather than pairwise labels,which can exploit the label coupling relations more accurately and comprehensively.The experimental results on text,biology and audio datasets shown that,compared with the state-of-the-art algorithm,the proposed algorithm can obtain better performance on 5 common criteria.展开更多
Community detection is a fundamental work to analyse the structural and functional properties of complex networks.The label propagation algorithm(LPA) is a near linear time algorithm to find a good community structure...Community detection is a fundamental work to analyse the structural and functional properties of complex networks.The label propagation algorithm(LPA) is a near linear time algorithm to find a good community structure. Despite various ubsequent advances, an important issue of this algorithm has not yet been properly addressed. Random update orders within the algorithm severely hamper the stability of the identified community structure. In this paper, we executed the asic label propagation algorithm on networks multiple times, to obtain a set of consensus partitions. Based on these onsensus partitions, we created a consensus weighted graph. In this consensus weighted graph, the weight value of the dge was the proportion value that the number of node pairs allocated in the same cluster was divided by the total number f partitions. Then, we introduced consensus weight to indicate the direction of label propagation. In label update steps,y computing the mixing value of consensus weight and label frequency, a node adopted the label which has the maximum mixing value instead of the most frequent one. For extending to different networks, we introduced a proportion parameter o adjust the proportion of consensus weight and label frequency in computing mixing value. Finally, we proposed an pproach named the label propagation algorithm with consensus weight(LPAcw), and the experimental results showed that he LPAcw could enhance considerably both the stability and the accuracy of community partitions.展开更多
A fast label-equivalence-based connected components labeling algorithm is proposed in this paper.It is a combination of two existing efficient methods,which are pivotal operations in two-pass connected components labe...A fast label-equivalence-based connected components labeling algorithm is proposed in this paper.It is a combination of two existing efficient methods,which are pivotal operations in two-pass connected components labeling algorithms.One is a fast pixel scan method,and the other is an array-based Union-Find data structure.The scan procedure assigns each foreground pixel a provisional label according to the location of the pixel.That is to say,it labels the foreground pixels following background pixels and foreground pixels in different ways,which greatly reduces the number of neighbor pixel checks.The array-based Union-Find data structure resolves the label equivalences between provisional labels by using only a single array with path compression,and it improves the efficiency of the resolving procedure which is very time-consuming in general label-equivalence-based algorithms.The experiments on various types of images with different sizes show that the proposed algorithm is superior to other labeling approaches for huge images containing many big connected components.展开更多
Various networks exist in the world today including biological, social, information, and communication networks with the Internet as the largest network of all. One salient structural feature of these networks is the ...Various networks exist in the world today including biological, social, information, and communication networks with the Internet as the largest network of all. One salient structural feature of these networks is the formation of groups or communities of vertices that tend to be more connected to each other within the same group than to those outside. Therefore, the detection of these communities is a topic of great interest and importance in many applications and different algorithms including label propagation have been developed for such purpose. Speaker-listener label propagation algorithm (SLPA) enjoys almost linear time complexity, so desirable in dealing with large networks. As an extension of SLPA, this study presented a novel weighted label propagation algorithm (WLPA), which was tested on four real world social networks with known community structures including the famous Zachary's karate club network. Wilcoxon tests on the communities found in the karate club network by WLPA demonstrated an improved statistical significance over SLPA. Withthehelp of Wilcoxon tests again, we were able to determine the best possible formation of two communities in this network relative to the ground truth partition, which could be used as a new benchmark for assessing community detection algorithms. Finally WLPA predicted better communities than SLPA in two of the three additional real social networks, when compared to the ground truth.展开更多
In many cases randomness in community detection algorithms has been avoided due to issues with stability. Indeed replacing random ordering with centrality rankings has improved the performance of some techniques such ...In many cases randomness in community detection algorithms has been avoided due to issues with stability. Indeed replacing random ordering with centrality rankings has improved the performance of some techniques such as Label Propagation Algorithms. This study evaluates the effects of such orderings on the Speaker-listener Label Propagation Algorithm or SLPA, a modification of LPA which has already been stabilized through alternate means. This study demonstrates that in cases where stability has been achieved without eliminating randomness, the result of removing random ordering is over fitting and bias. The results of testing seven various measures of centrality in conjunction with SLPA across five social network graphs indicate that while certain measures outperform random orderings on certain graphs, random orderings have the highest overall accuracy. This is particularly true when strict orderings are used in each run. These results indicate that the more evenly distributed solution space which results from complete random ordering is more valuable than the more targeted search that results from centrality orderings.展开更多
In order to prevent cracking appeared in the work-piece during the hot stamping operation,this paper proposes a hybrid optimization method based on Hammersley sequence sampling( HSS),finite analysis,backpropagation( B...In order to prevent cracking appeared in the work-piece during the hot stamping operation,this paper proposes a hybrid optimization method based on Hammersley sequence sampling( HSS),finite analysis,backpropagation( BP) neural network and genetic algorithm( GA). The mechanical properties of high strength boron steel are characterized on the basis of uniaxial tensile test at elevated temperatures. The samples of process parameters are chosen via the HSS that encourages the exploration throughout the design space and hence achieves better discovery of possible global optimum in the solution space. Meanwhile, numerical simulation is carried out to predict the forming quality for the optimized design. A BP neural network model is developed to obtain the mathematical relationship between optimization goal and design variables,and genetic algorithm is used to optimize the process parameters. Finally,the results of numerical simulation are compared with those of production experiment to demonstrate that the optimization strategy proposed in the paper is feasible.展开更多
A new method for multi-protocol label switching is presented in this study, whose core idea is to construct model for simulating process of accommodating network online loads and then adopt genetic algorithm to optimi...A new method for multi-protocol label switching is presented in this study, whose core idea is to construct model for simulating process of accommodating network online loads and then adopt genetic algorithm to optimize the model. Due to the heuristic property of evolutional method, the new method is efficient and effective, which is verified by the experiments.展开更多
Data prediction can improve the science of decision-making by making predictions about what happens in daily life based on natural law trends.Back propagation(BP)neural network is a widely used prediction method.To re...Data prediction can improve the science of decision-making by making predictions about what happens in daily life based on natural law trends.Back propagation(BP)neural network is a widely used prediction method.To reduce its probability of falling into local optimum and improve the prediction accuracy,we propose an improved BP neural network prediction method based on a multi-strategy sparrow search algorithm(MSSA).The weights and thresholds of the BP neural network are optimized using the sparrow search algorithm(SSA).Three strategies are designed to improve the SSA to enhance its optimization-seeking ability,leading to the MSSA-BP prediction model.The MSSA algorithm was tested with nine different types of benchmark functions to verify the optimization performance of the algorithm.Two different datasets were selected for comparison experiments on three groups of models.Under the same conditions,the mean absolute error(MAE),root mean square error(RMSE),andmean absolute percentage error(MAPE)of the prediction results of MSSA-BPwere significantly reduced,and the convergence speed was significantly improved.MSSA-BP can effectively improve the prediction accuracy and has certain application value.展开更多
Given a connected undirected graph G whose edges are labeled,the minimumlabeling spanning tree(MLST)problemis to find a spanning tree of G with the smallest number of different labels.TheMLST is anNP-hard combinatoria...Given a connected undirected graph G whose edges are labeled,the minimumlabeling spanning tree(MLST)problemis to find a spanning tree of G with the smallest number of different labels.TheMLST is anNP-hard combinatorial optimization problem,which is widely applied in communication networks,multimodal transportation networks,and data compression.Some approximation algorithms and heuristics algorithms have been proposed for the problem.Firefly algorithm is a new meta-heuristic algorithm.Because of its simplicity and easy implementation,it has been successfully applied in various fields.However,the basic firefly algorithm is not suitable for discrete problems.To this end,a novel discrete firefly algorithm for the MLST problem is proposed in this paper.A binary operation method to update firefly positions and a local feasible handling method are introduced,which correct unfeasible solutions,eliminate redundant labels,and make the algorithm more suitable for discrete problems.Computational results show that the algorithm has good performance.The algorithm can be extended to solve other discrete optimization problems.展开更多
We extend LeVeque's wave propagation algorithm,a widely used finite volume method for hyperbolic partial differential equations,to a third-order accurate method.The resulting scheme shares main properties with the...We extend LeVeque's wave propagation algorithm,a widely used finite volume method for hyperbolic partial differential equations,to a third-order accurate method.The resulting scheme shares main properties with the original method,i.e.,it is based on a wave decomposition at grid cell interfaces,it can be used to approximate hyperbolic problems in divergence form as well as in quasilinear form and limiting is introduced in the form of a wave limiter.展开更多
On the basis of inner-system labeling signaling used in the integrated access system,a kind of inner-system labeling algorithm is introduced in this paper, and the fairness of the algorithm for each traffic stream in ...On the basis of inner-system labeling signaling used in the integrated access system,a kind of inner-system labeling algorithm is introduced in this paper, and the fairness of the algorithm for each traffic stream in the integrated-services is analyzed. The base of this algorithm is Class of Services (CoS), and each packet entering the relative independent area (an autonomous system) would be labeled according to the service type or Quality of Service (QoS) in demand,and be scheduled and managed within the system (the system can be enlarged if conforming to the same protocol). The experimental results show that each of the stream rate in the integratedservices would converge to a stable value if the rates of transmitting converge to that of the receiving exponentially, that is, the effective traffic of each stream would be fair.展开更多
A kind of packet labeling algorithm for autonomous system is introduced. The fairness of the algorithm for each traffic stream in the integratedservices is analyzed. It is shown that the rate of each stream in the int...A kind of packet labeling algorithm for autonomous system is introduced. The fairness of the algorithm for each traffic stream in the integratedservices is analyzed. It is shown that the rate of each stream in the integratedservices would converge to a stable value if the transmitting or forwarding rates converge to that of the receiving exponentially.展开更多
基金supported by the National Natural Science Foundation of China under Grant No. 61272277, 41301409, 41571390the Fundamental Research Funds for the Central Universities under Grant No. 274742
文摘A large number of community discovery algorithms have been proposed in the last decade. Recently, the sharp increase of network scale has become a great challenge for traditional community discovery algorithms. Label propagation algorithm is a semi-supervised machine learning method, which has linear time complexity when coping with large scale networks. However, the output result has less stability and the quality of the output communities still remains to be improved. Therefore, we propose a novel coreleader based label propagation algorithm for community detection called CLBLPA. Firstly, we find core leaders of potential community by using a greedy method. Then we utilize the label influence potential to guide the process of label propagation. Thus we can accelerate the convergence of algorithm and improve the stability of the output. Experimental results on synthetic datasets and real networks show that CLBLPA can significantly improve the quality of the output communities.
文摘In today’s rapid widespread of digital technologies into all live aspects to enhance efficiency and productivity on the one hand and on the other hand ensure customer engagement, personal data counterfeiting has become a major concern for businesses and end-users. One solution to ensure data security is encryption, where keys are central. There is therefore a need to find robusts key generation implementation that is effective, inexpensive and non-invasive for protecting and preventing data counterfeiting. In this paper, we use the theory of electromagnetic wave propagation to generate encryption keys.
文摘Voice classification is important in creating more intelligent systems that help with student exams,identifying criminals,and security systems.The main aim of the research is to develop a system able to predicate and classify gender,age,and accent.So,a newsystem calledClassifyingVoice Gender,Age,and Accent(CVGAA)is proposed.Backpropagation and bagging algorithms are designed to improve voice recognition systems that incorporate sensory voice features such as rhythm-based features used to train the device to distinguish between the two gender categories.It has high precision compared to other algorithms used in this problem,as the adaptive backpropagation algorithm had an accuracy of 98%and the Bagging algorithm had an accuracy of 98.10%in the gender identification data.Bagging has the best accuracy among all algorithms,with 55.39%accuracy in the voice common dataset and age classification and accent accuracy in a speech accent of 78.94%.
基金What is more,we thank the National Natural Science Foundation of China(Nos.61966039,62241604)the Scientific Research Fund Project of the Education Department of Yunnan Province(No.2023Y0565)Also,this work was supported in part by the Xingdian Talent Support Program for Young Talents(No.XDYC-QNRC-2022-0518).
文摘Many network presentation learning algorithms(NPLA)have originated from the process of the random walk between nodes in recent years.Despite these algorithms can obtain great embedding results,there may be also some limitations.For instance,only the structural information of nodes is considered when these kinds of algorithms are constructed.Aiming at this issue,a label and community information-based network presentation learning algorithm(LC-NPLA)is proposed in this paper.First of all,by using the community information and the label information of nodes,the first-order neighbors of nodes are reconstructed.In the next,the random walk strategy is improved by integrating the degree information and label information of nodes.Then,the node sequence obtained from random walk sampling is transformed into the node representation vector by the Skip-Gram model.At last,the experimental results on ten real-world networks demonstrate that the proposed algorithm has great advantages in the label classification,network reconstruction and link prediction tasks,compared with three benchmark algorithms.
基金the National Natural Science Foundation of China under Grant No.61171098,the Fundamental Research Funds for the Central Universities of China,the 111 Project of China under Grant No.B08004
文摘The increased capacity and availability of the Internet has led to a wide variety of applications.Internet traffic characterization and application identification is important for network management.In this paper,based on detailed flow data collected from the public networks of Internet Service Providers,we construct a flow graph to model the interactions among users.Considering traffic from different applications,we analyze the community structure of the flow graph in terms of community size,degree distribution of the community,community overlap,and overlap modularity.The near linear time community detection algorithm in complex networks,the Label Propagation Algorithm(LPA),is extended to the flow graph for application identification.We propose a new initialization and label propagation and update scheme.Experimental results show that the proposed algorithm has high accuracy and efficiency.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.61173093 and 61202182)the Postdoctoral Science Foundation of China(Grant No.2012 M521776)+2 种基金the Fundamental Research Funds for the Central Universities of Chinathe Postdoctoral Science Foundation of Shannxi Province,Chinathe Natural Science Basic Research Plan of Shaanxi Province,China(Grant Nos.2013JM8019 and 2014JQ8359)
文摘Community detection is an important methodology for understanding the intrinsic structure and function of a realworld network.In this paper,we propose an effective and efficient algorithm,called Dominant Label Propagation Algorithm(Abbreviated as DLPA),to detect communities in complex networks.The algorithm simulates a special voting process to detect overlapping and non-overlapping community structure in complex networks simultaneously.Our algorithm is very efficient,since its computational complexity is almost linear to the number of edges in the network.Experimental results on both real-world and synthetic networks show that our algorithm also possesses high accuracies on detecting community structure in networks.
基金Supported by Australian Research Council Discovery(DP130102691)the National Science Foundation of China(61302157)+1 种基金China National 863 Project(2012AA12A308)China Pre-research Project of Nuclear Industry(FZ1402-08)
文摘It is a key challenge to exploit the label coupling relationship in multi-label classification(MLC)problems.Most previous work focused on label pairwise relations,in which generally only global statistical information is used to analyze the coupled label relationship.In this work,firstly Bayesian and hypothesis testing methods are applied to predict the label set size of testing samples within their k nearest neighbor samples,which combines global and local statistical information,and then apriori algorithm is used to mine the label coupling relationship among multiple labels rather than pairwise labels,which can exploit the label coupling relations more accurately and comprehensively.The experimental results on text,biology and audio datasets shown that,compared with the state-of-the-art algorithm,the proposed algorithm can obtain better performance on 5 common criteria.
基金supported by the National Natural Science Foundation of China(Grant No.61370073)the China Scholarship Council,China(Grant No.201306070037)
文摘Community detection is a fundamental work to analyse the structural and functional properties of complex networks.The label propagation algorithm(LPA) is a near linear time algorithm to find a good community structure. Despite various ubsequent advances, an important issue of this algorithm has not yet been properly addressed. Random update orders within the algorithm severely hamper the stability of the identified community structure. In this paper, we executed the asic label propagation algorithm on networks multiple times, to obtain a set of consensus partitions. Based on these onsensus partitions, we created a consensus weighted graph. In this consensus weighted graph, the weight value of the dge was the proportion value that the number of node pairs allocated in the same cluster was divided by the total number f partitions. Then, we introduced consensus weight to indicate the direction of label propagation. In label update steps,y computing the mixing value of consensus weight and label frequency, a node adopted the label which has the maximum mixing value instead of the most frequent one. For extending to different networks, we introduced a proportion parameter o adjust the proportion of consensus weight and label frequency in computing mixing value. Finally, we proposed an pproach named the label propagation algorithm with consensus weight(LPAcw), and the experimental results showed that he LPAcw could enhance considerably both the stability and the accuracy of community partitions.
基金Sponsored by the National Natural Science Foundation of China (Grant No. 81071219)
文摘A fast label-equivalence-based connected components labeling algorithm is proposed in this paper.It is a combination of two existing efficient methods,which are pivotal operations in two-pass connected components labeling algorithms.One is a fast pixel scan method,and the other is an array-based Union-Find data structure.The scan procedure assigns each foreground pixel a provisional label according to the location of the pixel.That is to say,it labels the foreground pixels following background pixels and foreground pixels in different ways,which greatly reduces the number of neighbor pixel checks.The array-based Union-Find data structure resolves the label equivalences between provisional labels by using only a single array with path compression,and it improves the efficiency of the resolving procedure which is very time-consuming in general label-equivalence-based algorithms.The experiments on various types of images with different sizes show that the proposed algorithm is superior to other labeling approaches for huge images containing many big connected components.
文摘Various networks exist in the world today including biological, social, information, and communication networks with the Internet as the largest network of all. One salient structural feature of these networks is the formation of groups or communities of vertices that tend to be more connected to each other within the same group than to those outside. Therefore, the detection of these communities is a topic of great interest and importance in many applications and different algorithms including label propagation have been developed for such purpose. Speaker-listener label propagation algorithm (SLPA) enjoys almost linear time complexity, so desirable in dealing with large networks. As an extension of SLPA, this study presented a novel weighted label propagation algorithm (WLPA), which was tested on four real world social networks with known community structures including the famous Zachary's karate club network. Wilcoxon tests on the communities found in the karate club network by WLPA demonstrated an improved statistical significance over SLPA. Withthehelp of Wilcoxon tests again, we were able to determine the best possible formation of two communities in this network relative to the ground truth partition, which could be used as a new benchmark for assessing community detection algorithms. Finally WLPA predicted better communities than SLPA in two of the three additional real social networks, when compared to the ground truth.
文摘In many cases randomness in community detection algorithms has been avoided due to issues with stability. Indeed replacing random ordering with centrality rankings has improved the performance of some techniques such as Label Propagation Algorithms. This study evaluates the effects of such orderings on the Speaker-listener Label Propagation Algorithm or SLPA, a modification of LPA which has already been stabilized through alternate means. This study demonstrates that in cases where stability has been achieved without eliminating randomness, the result of removing random ordering is over fitting and bias. The results of testing seven various measures of centrality in conjunction with SLPA across five social network graphs indicate that while certain measures outperform random orderings on certain graphs, random orderings have the highest overall accuracy. This is particularly true when strict orderings are used in each run. These results indicate that the more evenly distributed solution space which results from complete random ordering is more valuable than the more targeted search that results from centrality orderings.
基金Sponsored by the Fundamental Research Funds for the Central Universities(Grant No.CDJZR14130006)
文摘In order to prevent cracking appeared in the work-piece during the hot stamping operation,this paper proposes a hybrid optimization method based on Hammersley sequence sampling( HSS),finite analysis,backpropagation( BP) neural network and genetic algorithm( GA). The mechanical properties of high strength boron steel are characterized on the basis of uniaxial tensile test at elevated temperatures. The samples of process parameters are chosen via the HSS that encourages the exploration throughout the design space and hence achieves better discovery of possible global optimum in the solution space. Meanwhile, numerical simulation is carried out to predict the forming quality for the optimized design. A BP neural network model is developed to obtain the mathematical relationship between optimization goal and design variables,and genetic algorithm is used to optimize the process parameters. Finally,the results of numerical simulation are compared with those of production experiment to demonstrate that the optimization strategy proposed in the paper is feasible.
基金This work was supported by the National Natural Science Foundation of China (No10371097)Open Project of Com-putational Key Laboratory in Yunnan Provice
文摘A new method for multi-protocol label switching is presented in this study, whose core idea is to construct model for simulating process of accommodating network online loads and then adopt genetic algorithm to optimize the model. Due to the heuristic property of evolutional method, the new method is efficient and effective, which is verified by the experiments.
基金the National Natural Science Foundation of China(Grant No.62162024 and 62162022)Key Projects in Hainan Province(Grant ZDYF2021GXJS003 and Grant ZDYF2020040)the Major science and technology project of Hainan Province(Grant No.ZDKJ2020012).
文摘Data prediction can improve the science of decision-making by making predictions about what happens in daily life based on natural law trends.Back propagation(BP)neural network is a widely used prediction method.To reduce its probability of falling into local optimum and improve the prediction accuracy,we propose an improved BP neural network prediction method based on a multi-strategy sparrow search algorithm(MSSA).The weights and thresholds of the BP neural network are optimized using the sparrow search algorithm(SSA).Three strategies are designed to improve the SSA to enhance its optimization-seeking ability,leading to the MSSA-BP prediction model.The MSSA algorithm was tested with nine different types of benchmark functions to verify the optimization performance of the algorithm.Two different datasets were selected for comparison experiments on three groups of models.Under the same conditions,the mean absolute error(MAE),root mean square error(RMSE),andmean absolute percentage error(MAPE)of the prediction results of MSSA-BPwere significantly reduced,and the convergence speed was significantly improved.MSSA-BP can effectively improve the prediction accuracy and has certain application value.
基金This work is supported by the National Natural Science Foundation of China under Grant 61772179the Hunan Provincial Natural Science Foundation of China under Grant 2019JJ40005+3 种基金the Science and Technology Plan Project of Hunan Province under Grant 2016TP1020the Double First-Class University Project of Hunan Province under Grant Xiangjiaotong[2018]469the Open Fund Project of Hunan Provincial Key Laboratory of Intelligent Information Processing and Application for Hengyang Normal University under Grant IIPA19K02the Science Foundation of Hengyang Normal University under Grant 19QD13.
文摘Given a connected undirected graph G whose edges are labeled,the minimumlabeling spanning tree(MLST)problemis to find a spanning tree of G with the smallest number of different labels.TheMLST is anNP-hard combinatorial optimization problem,which is widely applied in communication networks,multimodal transportation networks,and data compression.Some approximation algorithms and heuristics algorithms have been proposed for the problem.Firefly algorithm is a new meta-heuristic algorithm.Because of its simplicity and easy implementation,it has been successfully applied in various fields.However,the basic firefly algorithm is not suitable for discrete problems.To this end,a novel discrete firefly algorithm for the MLST problem is proposed in this paper.A binary operation method to update firefly positions and a local feasible handling method are introduced,which correct unfeasible solutions,eliminate redundant labels,and make the algorithm more suitable for discrete problems.Computational results show that the algorithm has good performance.The algorithm can be extended to solve other discrete optimization problems.
基金This work was supported by the DFG through HE 4858/4-1
文摘We extend LeVeque's wave propagation algorithm,a widely used finite volume method for hyperbolic partial differential equations,to a third-order accurate method.The resulting scheme shares main properties with the original method,i.e.,it is based on a wave decomposition at grid cell interfaces,it can be used to approximate hyperbolic problems in divergence form as well as in quasilinear form and limiting is introduced in the form of a wave limiter.
文摘On the basis of inner-system labeling signaling used in the integrated access system,a kind of inner-system labeling algorithm is introduced in this paper, and the fairness of the algorithm for each traffic stream in the integrated-services is analyzed. The base of this algorithm is Class of Services (CoS), and each packet entering the relative independent area (an autonomous system) would be labeled according to the service type or Quality of Service (QoS) in demand,and be scheduled and managed within the system (the system can be enlarged if conforming to the same protocol). The experimental results show that each of the stream rate in the integratedservices would converge to a stable value if the rates of transmitting converge to that of the receiving exponentially, that is, the effective traffic of each stream would be fair.
文摘A kind of packet labeling algorithm for autonomous system is introduced. The fairness of the algorithm for each traffic stream in the integratedservices is analyzed. It is shown that the rate of each stream in the integratedservices would converge to a stable value if the transmitting or forwarding rates converge to that of the receiving exponentially.