Aimed at a multiple traveling salesman problem(MTSP)with multiple depots and closed paths,this paper proposes a k-means clustering donkey and a smuggler algorithm(KDSA).The algorithm first uses the k-means clustering ...Aimed at a multiple traveling salesman problem(MTSP)with multiple depots and closed paths,this paper proposes a k-means clustering donkey and a smuggler algorithm(KDSA).The algorithm first uses the k-means clustering method to divide all cities into several categories based on the center of various samples;the large-scale MTSP is divided into multiple separate traveling salesman problems(TSPs),and the TSP is solved through the DSA.The proposed algorithm adopts a solution strategy of clustering first and then carrying out,which can not only greatly reduce the search space of the algorithm but also make the search space more fully explored so that the optimal solution of the problem can be more quickly obtained.The experimental results from solving several test cases in the TSPLIB database show that compared with other related intelligent algorithms,the K-DSA has good solving performance and computational efficiency in MTSPs of different scales,especially with large-scale MTSP and when the convergence speed is faster;thus,the advantages of this algorithm are more obvious compared to other algorithms.展开更多
Region partition(RP) is the key technique to the finite element parallel computing(FEPC),and its performance has a decisive influence on the entire process of analysis and computation.The performance evaluation index ...Region partition(RP) is the key technique to the finite element parallel computing(FEPC),and its performance has a decisive influence on the entire process of analysis and computation.The performance evaluation index of RP method for the three-dimensional finite element model(FEM) has been given.By taking the electric field of aluminum reduction cell(ARC) as the research object,the performance of two classical RP methods,which are Al-NASRA and NGUYEN partition(ANP) algorithm and the multi-level partition(MLP) method,has been analyzed and compared.The comparison results indicate a sound performance of ANP algorithm,but to large-scale models,the computing time of ANP algorithm increases notably.This is because the ANP algorithm determines only one node based on the minimum weight and just adds the elements connected to the node into the sub-region during each iteration.To obtain the satisfied speed and the precision,an improved dynamic self-adaptive ANP(DSA-ANP) algorithm has been proposed.With consideration of model scale,complexity and sub-RP stage,the improved algorithm adaptively determines the number of nodes and selects those nodes with small enough weight,and then dynamically adds these connected elements.The proposed algorithm has been applied to the finite element analysis(FEA) of the electric field simulation of ARC.Compared with the traditional ANP algorithm,the computational efficiency of the proposed algorithm has been shortened approximately from 260 s to 13 s.This proves the superiority of the improved algorithm on computing time performance.展开更多
Two utility-optimization dynamic subcarrier allocation(DSA) algorithms are designed for single carrier frequency division multiple access system(SC-FDMA).The two proposed algorithms aim to support diverse transmission...Two utility-optimization dynamic subcarrier allocation(DSA) algorithms are designed for single carrier frequency division multiple access system(SC-FDMA).The two proposed algorithms aim to support diverse transmission capacity requirements in wireless networks,which consider both the channel state information(CSI) and the capacity requirements of each user by setting appropriate utility functions.Simulation results show that with considerable lower computational complexity,the first utility-optimization algorithm can meet the system capacity requirements of each user effectively.However,the rate-sum capacity performance is poor.Furthermore,the second proposed utility-optimization algorithm can contribute a better trade-off between system rate-sum capacity requirement and the capacity requirements of each user by introducing the signal to noise ratio(SNR) information to the utility function based on the first utility-optimization algorithm,which can improve the user requirements processing capability as well as achieve a better sum-rate capacity.展开更多
电子印章在我国电子政务和电子商务领域正发挥着越来越重要的作用,基于数字签名和数字水印的电子印章解决方案还在发展完善中。该文遵循Domino—PDF—DSA这一技术路线,综合运用Lotus平台的PKI技术和PDF的数字签名技术,借助Notes C API和...电子印章在我国电子政务和电子商务领域正发挥着越来越重要的作用,基于数字签名和数字水印的电子印章解决方案还在发展完善中。该文遵循Domino—PDF—DSA这一技术路线,综合运用Lotus平台的PKI技术和PDF的数字签名技术,借助Notes C API和PDF API作二次开发,将电子印章图像作为Notes ID文件的扩展部分,在Lotus平台上实现了对PDF文档加盖电子印章的应用系统。展开更多
基金the Natural Science Basic Research Program of Shaanxi(2021JQ-368).
文摘Aimed at a multiple traveling salesman problem(MTSP)with multiple depots and closed paths,this paper proposes a k-means clustering donkey and a smuggler algorithm(KDSA).The algorithm first uses the k-means clustering method to divide all cities into several categories based on the center of various samples;the large-scale MTSP is divided into multiple separate traveling salesman problems(TSPs),and the TSP is solved through the DSA.The proposed algorithm adopts a solution strategy of clustering first and then carrying out,which can not only greatly reduce the search space of the algorithm but also make the search space more fully explored so that the optimal solution of the problem can be more quickly obtained.The experimental results from solving several test cases in the TSPLIB database show that compared with other related intelligent algorithms,the K-DSA has good solving performance and computational efficiency in MTSPs of different scales,especially with large-scale MTSP and when the convergence speed is faster;thus,the advantages of this algorithm are more obvious compared to other algorithms.
基金Project(61273187)supported by the National Natural Science Foundation of ChinaProject(61321003)supported by the Foundation for Innovative Research Groups of the National Natural Science Foundation of China
文摘Region partition(RP) is the key technique to the finite element parallel computing(FEPC),and its performance has a decisive influence on the entire process of analysis and computation.The performance evaluation index of RP method for the three-dimensional finite element model(FEM) has been given.By taking the electric field of aluminum reduction cell(ARC) as the research object,the performance of two classical RP methods,which are Al-NASRA and NGUYEN partition(ANP) algorithm and the multi-level partition(MLP) method,has been analyzed and compared.The comparison results indicate a sound performance of ANP algorithm,but to large-scale models,the computing time of ANP algorithm increases notably.This is because the ANP algorithm determines only one node based on the minimum weight and just adds the elements connected to the node into the sub-region during each iteration.To obtain the satisfied speed and the precision,an improved dynamic self-adaptive ANP(DSA-ANP) algorithm has been proposed.With consideration of model scale,complexity and sub-RP stage,the improved algorithm adaptively determines the number of nodes and selects those nodes with small enough weight,and then dynamically adds these connected elements.The proposed algorithm has been applied to the finite element analysis(FEA) of the electric field simulation of ARC.Compared with the traditional ANP algorithm,the computational efficiency of the proposed algorithm has been shortened approximately from 260 s to 13 s.This proves the superiority of the improved algorithm on computing time performance.
基金Supported by the National Basic Research Program of China(No.61393010101-1)the Defense-related Science & Technology Pre-Research Project of Shipbuilding Institute(No.10J3.1.6)
文摘Two utility-optimization dynamic subcarrier allocation(DSA) algorithms are designed for single carrier frequency division multiple access system(SC-FDMA).The two proposed algorithms aim to support diverse transmission capacity requirements in wireless networks,which consider both the channel state information(CSI) and the capacity requirements of each user by setting appropriate utility functions.Simulation results show that with considerable lower computational complexity,the first utility-optimization algorithm can meet the system capacity requirements of each user effectively.However,the rate-sum capacity performance is poor.Furthermore,the second proposed utility-optimization algorithm can contribute a better trade-off between system rate-sum capacity requirement and the capacity requirements of each user by introducing the signal to noise ratio(SNR) information to the utility function based on the first utility-optimization algorithm,which can improve the user requirements processing capability as well as achieve a better sum-rate capacity.
文摘电子印章在我国电子政务和电子商务领域正发挥着越来越重要的作用,基于数字签名和数字水印的电子印章解决方案还在发展完善中。该文遵循Domino—PDF—DSA这一技术路线,综合运用Lotus平台的PKI技术和PDF的数字签名技术,借助Notes C API和PDF API作二次开发,将电子印章图像作为Notes ID文件的扩展部分,在Lotus平台上实现了对PDF文档加盖电子印章的应用系统。
