Using quantum algorithms to solve various problems has attracted widespread attention with the development of quantum computing.Researchers are particularly interested in using the acceleration properties of quantum a...Using quantum algorithms to solve various problems has attracted widespread attention with the development of quantum computing.Researchers are particularly interested in using the acceleration properties of quantum algorithms to solve NP-complete problems.This paper focuses on the well-known NP-complete problem of finding the minimum dominating set in undirected graphs.To expedite the search process,a quantum algorithm employing Grover’s search is proposed.However,a challenge arises from the unknown number of solutions for the minimum dominating set,rendering direct usage of original Grover’s search impossible.Thus,a swap test method is introduced to ascertain the number of iterations required.The oracle,diffusion operators,and swap test are designed with achievable quantum gates.The query complexity is O(1.414^(n))and the space complexity is O(n).To validate the proposed approach,qiskit software package is employed to simulate the quantum circuit,yielding the anticipated results.展开更多
The effects of stage numbers on power dissipation of pipeline analog-to-digital converter （ADC） are studied and a novel design method aiming for power optimization is presented. In this method, a minimum comparator ...The effects of stage numbers on power dissipation of pipeline analog-to-digital converter （ADC） are studied and a novel design method aiming for power optimization is presented. In this method, a minimum comparator number algorithm （MCNA） is first introduced, and then the optimum distribution of resolutions through pipeline ADC stages is deduced by MCNA. Based on the optimum stage-resolution distribution, an optimization method is established, which examines the precise function between ADC power and stage resolutions with a parameter of power ratio （Rp）. For 10-bit pipeline ADC with scaling down technology, the simulation results by using MATLAB CAD tools show that an eight-stage topology with 1-bit RSD correction achieves the power optimization indicated by the power reduction ratio.展开更多
This paper provides a method of producing a minimum cost spanning tree (MCST) using set operations. It studies the data structure for implementation of set operations and the algorithm to be applied to this structure ...This paper provides a method of producing a minimum cost spanning tree (MCST) using set operations. It studies the data structure for implementation of set operations and the algorithm to be applied to this structure and proves the correctness and the complexity of the algorithm. This algorithm uses the FDG (formula to divide elements into groups) to sort (the FDG sorts a sequence of n elements in expected tir O(n)) and uses the method of path compression to find and to unite. Therefore. n produces an MCST of an undirected network having n vertices and e edges in expected time O(eG(n)).展开更多
Workers who conduct regular facility inspections in radioactive environments will inevitably be affected by radiation.Therefore,it is important to optimize the inspection path to ensure that workers are exposed to the...Workers who conduct regular facility inspections in radioactive environments will inevitably be affected by radiation.Therefore,it is important to optimize the inspection path to ensure that workers are exposed to the least amount of radiation.This study proposes a discrete Rao-combined artificial bee colony(ABC)algorithm for planning inspection paths with minimum exposure doses in radioactive environments with obstacles.In this algorithm,retaining the framework of the traditional ABC algorithm,we applied the directional solution update rules of Rao algorithms at the employed bee stage and onlooker bee stage to increase the exploitation ability of the algorithm and implement discretion using the swap operator and swap sequence.To increase the randomness of solution generation,the chaos algorithm was used at the initialization stage.The K-opt operation technique was introduced at the scout bee stage to increase the exploration ability of the algorithm.For path planning in an environment with complex structural obstacles,an obstacle detour technique using a recursive algorithm was applied.To evaluate the performance of the proposed algorithm,we performed experimental simulations in three hypothetical environments and compared the results with those of improved particle swarm optimization,chaos particle swarm optimization,improved ant colony optimization,and discrete Rao’s algorithms.The experimental results show the high performance of the proposed discrete Rao-combined ABC algorithm and its obstacle detour capability.展开更多
To reduce the vibration in the suspension, semi active suspension system was employed. And its CARMA model was built. Two adaptive control schemes, the minimum variance self tuning control algorithm and the pole con...To reduce the vibration in the suspension, semi active suspension system was employed. And its CARMA model was built. Two adaptive control schemes, the minimum variance self tuning control algorithm and the pole configuration self tuning control algorithm, were proposed. The former can make the variance of the output minimum while the latter can make dynamic behavior satisfying. The stability of the two schemes was analyzed. Simulations of them show that the acceleration in the vertical direction has been reduced greatly. The purpose of reducing vibration is realized. The two schemes can reduce the vibration in the suspension and have some practicability.展开更多
Complex multi-area collaborative coverage path planning in dynamic environments poses a significant challenge for multi-fixed-wing UAVs(multi-UAV).This study establishes a comprehensive framework that incorporates UAV...Complex multi-area collaborative coverage path planning in dynamic environments poses a significant challenge for multi-fixed-wing UAVs(multi-UAV).This study establishes a comprehensive framework that incorporates UAV capabilities,terrain,complex areas,and mission dynamics.A novel dynamic collaborative path planning algorithm is introduced,designed to ensure complete coverage of designated areas.This algorithm meticulously optimizes the operation,entry,and transition paths for each UAV,while also establishing evaluation metrics to refine coverage sequences for each area.Additionally,a three-dimensional path is computed utilizing an altitude descent method,effectively integrating twodimensional coverage paths with altitude constraints.The efficacy of the proposed approach is validated through digital simulations and mixed-reality semi-physical experiments across a variety of dynamic scenarios,including both single-area and multi-area coverage by multi-UAV.Results show that the coverage paths generated by this method significantly reduce both computation time and path length,providing a reliable solution for dynamic multi-UAV mission planning in semi-physical environments.展开更多
An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal ...An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal factor(HF),composed of an adaptive local hormonal factor(H l)and an adaptive global hormonal factor(H g),is devised to strengthen the information connection between particles.Using HF,each particle of the swarm can adjust its position self-adaptively to avoid premature phenomena and reach better solution.The computational results validate the effectiveness and stability of the proposed IAPSO,which can not only find optimal or close-to-optimal solutions but also obtain both better and more stability results than the existing particle swarm optimization(PSO)algorithms.展开更多
Traditional short-time fractional Fourier transform(STFrFT)has a single and fixed window function,which can not be adjusted adaptively according to the characteristics of fre-quency and frequency change rate.In order ...Traditional short-time fractional Fourier transform(STFrFT)has a single and fixed window function,which can not be adjusted adaptively according to the characteristics of fre-quency and frequency change rate.In order to overcome the shortcomings,the STFrFT method with adaptive window function is proposed.In this method,the window function of STFrFT is ad-aptively adjusted by establishing a library containing multiple window functions and taking the minimum information entropy as the criterion,so as to obtain a time-frequency distribution that better matches the desired signal.This method takes into account the time-frequency resolution characteristics of STFrFT and the excellent characteristics of adaptive adjustment to window func-tion,improves the time-frequency aggregation on the basis of eliminating cross term interference,and provides a new tool for improving the time-frequency analysis ability of complex modulated sig-nals.展开更多
A new algorithm for fast discovery of sequential patterns to solve the problems of too many candidate sets made by SPADE is presented, which is referred to as middle matching algorithm. Experiments on a large customer...A new algorithm for fast discovery of sequential patterns to solve the problems of too many candidate sets made by SPADE is presented, which is referred to as middle matching algorithm. Experiments on a large customer transaction database consisting of customer_id, transaction time, and transaction items demonstrate that the proposed algorithm performs better than SPADE attributed to its philosophy to generate a candidate set by matching two sequences in the middle place so as to reduce the number of the candidate sets.展开更多
The EAST (HT-7U) superconducting tokamak is a national project of China on fusion research, with a capability of long-pulse (- 1000 s) operation. In order to realize a long-duration steady-state operation of EAST, som...The EAST (HT-7U) superconducting tokamak is a national project of China on fusion research, with a capability of long-pulse (- 1000 s) operation. In order to realize a long-duration steady-state operation of EAST, some significant capability of real-time control is re-quired. It would be very crucial to obtain the current profile parameters and the plasma shapes in real time by a flexible control system. As those discharge parameters cannot be directly measured, so a current profile consistent with the magnetohydrodynamic equilibrium should be evaluated from external magnetic measurements, based on a linearized iterative least square method, which can meet the requirements of the measurements. The arithmetic that the EFIT (equilibrium fitting code) is used for reference will be given in this paper and the computational efforts are reduced by parametrizing the current profile linearly in terms of a number of physical parameters. In order to introduce this reconstruction algorithm clearly, the main hardware design will be listed also.展开更多
The matrix inversion operation is needed in the MMSE decoding algorithm of orthogonal space-time block coding （OSTBC） proposed by Papadias and Foschini. In this paper, an minimum mean square error （MMSE） decoding ...The matrix inversion operation is needed in the MMSE decoding algorithm of orthogonal space-time block coding （OSTBC） proposed by Papadias and Foschini. In this paper, an minimum mean square error （MMSE） decoding algorithm without matrix inversion is proposed, by which the computational complexity can be reduced directly but the decoding performance is not affected.展开更多
In the optimization of train diagrams, selecting the arrival and departure paths of the through gains has a great impact on the dwell time at district stations. In this paper, on the basis of train paths and the throu...In the optimization of train diagrams, selecting the arrival and departure paths of the through gains has a great impact on the dwell time at district stations. In this paper, on the basis of train paths and the through train connection time standard at district stations, we built a mathematical model aiming at minimizing dwell time of through trains at two adjacent district stations, and then converted this into a network flow model to which is added a source and a sink node. Then, we propose a new algorithm for solving the network flow model based on the minimum-cost flow algorithm. A case study for through trains from the Guiyang South Railway Station to the Chongqing West Railway Station shows that the algorithm is reliable and efficient for solving the problem of through train connections, and there is a reduction in the total dwell time that the through trains spend at two adjacent district stations.展开更多
基金Project supported by the National Natural Science Foundation of China(Grant No.62101600)the Science Foundation of China University of Petroleum,Beijing(Grant No.2462021YJRC008)the State Key Laboratory of Cryptology(Grant No.MMKFKT202109).
文摘Using quantum algorithms to solve various problems has attracted widespread attention with the development of quantum computing.Researchers are particularly interested in using the acceleration properties of quantum algorithms to solve NP-complete problems.This paper focuses on the well-known NP-complete problem of finding the minimum dominating set in undirected graphs.To expedite the search process,a quantum algorithm employing Grover’s search is proposed.However,a challenge arises from the unknown number of solutions for the minimum dominating set,rendering direct usage of original Grover’s search impossible.Thus,a swap test method is introduced to ascertain the number of iterations required.The oracle,diffusion operators,and swap test are designed with achievable quantum gates.The query complexity is O(1.414^(n))and the space complexity is O(n).To validate the proposed approach,qiskit software package is employed to simulate the quantum circuit,yielding the anticipated results.
基金Supported by the National Natural Science Foundation of China (No. 60072004)
文摘The effects of stage numbers on power dissipation of pipeline analog-to-digital converter （ADC） are studied and a novel design method aiming for power optimization is presented. In this method, a minimum comparator number algorithm （MCNA） is first introduced, and then the optimum distribution of resolutions through pipeline ADC stages is deduced by MCNA. Based on the optimum stage-resolution distribution, an optimization method is established, which examines the precise function between ADC power and stage resolutions with a parameter of power ratio （Rp）. For 10-bit pipeline ADC with scaling down technology, the simulation results by using MATLAB CAD tools show that an eight-stage topology with 1-bit RSD correction achieves the power optimization indicated by the power reduction ratio.
文摘This paper provides a method of producing a minimum cost spanning tree (MCST) using set operations. It studies the data structure for implementation of set operations and the algorithm to be applied to this structure and proves the correctness and the complexity of the algorithm. This algorithm uses the FDG (formula to divide elements into groups) to sort (the FDG sorts a sequence of n elements in expected tir O(n)) and uses the method of path compression to find and to unite. Therefore. n produces an MCST of an undirected network having n vertices and e edges in expected time O(eG(n)).
文摘Workers who conduct regular facility inspections in radioactive environments will inevitably be affected by radiation.Therefore,it is important to optimize the inspection path to ensure that workers are exposed to the least amount of radiation.This study proposes a discrete Rao-combined artificial bee colony(ABC)algorithm for planning inspection paths with minimum exposure doses in radioactive environments with obstacles.In this algorithm,retaining the framework of the traditional ABC algorithm,we applied the directional solution update rules of Rao algorithms at the employed bee stage and onlooker bee stage to increase the exploitation ability of the algorithm and implement discretion using the swap operator and swap sequence.To increase the randomness of solution generation,the chaos algorithm was used at the initialization stage.The K-opt operation technique was introduced at the scout bee stage to increase the exploration ability of the algorithm.For path planning in an environment with complex structural obstacles,an obstacle detour technique using a recursive algorithm was applied.To evaluate the performance of the proposed algorithm,we performed experimental simulations in three hypothetical environments and compared the results with those of improved particle swarm optimization,chaos particle swarm optimization,improved ant colony optimization,and discrete Rao’s algorithms.The experimental results show the high performance of the proposed discrete Rao-combined ABC algorithm and its obstacle detour capability.
文摘To reduce the vibration in the suspension, semi active suspension system was employed. And its CARMA model was built. Two adaptive control schemes, the minimum variance self tuning control algorithm and the pole configuration self tuning control algorithm, were proposed. The former can make the variance of the output minimum while the latter can make dynamic behavior satisfying. The stability of the two schemes was analyzed. Simulations of them show that the acceleration in the vertical direction has been reduced greatly. The purpose of reducing vibration is realized. The two schemes can reduce the vibration in the suspension and have some practicability.
基金National Natural Science Foundation of China(Grant No.52472417)to provide fund for conducting experiments.
文摘Complex multi-area collaborative coverage path planning in dynamic environments poses a significant challenge for multi-fixed-wing UAVs(multi-UAV).This study establishes a comprehensive framework that incorporates UAV capabilities,terrain,complex areas,and mission dynamics.A novel dynamic collaborative path planning algorithm is introduced,designed to ensure complete coverage of designated areas.This algorithm meticulously optimizes the operation,entry,and transition paths for each UAV,while also establishing evaluation metrics to refine coverage sequences for each area.Additionally,a three-dimensional path is computed utilizing an altitude descent method,effectively integrating twodimensional coverage paths with altitude constraints.The efficacy of the proposed approach is validated through digital simulations and mixed-reality semi-physical experiments across a variety of dynamic scenarios,including both single-area and multi-area coverage by multi-UAV.Results show that the coverage paths generated by this method significantly reduce both computation time and path length,providing a reliable solution for dynamic multi-UAV mission planning in semi-physical environments.
基金Supported by the National Natural Science Foundation of China(51175262)the Research Fund for Doctoral Program of Higher Education of China(20093218110020)+2 种基金the Jiangsu Province Science Foundation for Excellent Youths(BK201210111)the Jiangsu Province Industry-Academy-Research Grant(BY201220116)the Innovative and Excellent Foundation for Doctoral Dissertation of Nanjing University of Aeronautics and Astronautics(BCXJ10-09)
文摘An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal factor(HF),composed of an adaptive local hormonal factor(H l)and an adaptive global hormonal factor(H g),is devised to strengthen the information connection between particles.Using HF,each particle of the swarm can adjust its position self-adaptively to avoid premature phenomena and reach better solution.The computational results validate the effectiveness and stability of the proposed IAPSO,which can not only find optimal or close-to-optimal solutions but also obtain both better and more stability results than the existing particle swarm optimization(PSO)algorithms.
基金supported by the National Natural Science Found-ation of China(No.61571454)Special Fund for Taishan Scholar Project(No.201712072)。
文摘Traditional short-time fractional Fourier transform(STFrFT)has a single and fixed window function,which can not be adjusted adaptively according to the characteristics of fre-quency and frequency change rate.In order to overcome the shortcomings,the STFrFT method with adaptive window function is proposed.In this method,the window function of STFrFT is ad-aptively adjusted by establishing a library containing multiple window functions and taking the minimum information entropy as the criterion,so as to obtain a time-frequency distribution that better matches the desired signal.This method takes into account the time-frequency resolution characteristics of STFrFT and the excellent characteristics of adaptive adjustment to window func-tion,improves the time-frequency aggregation on the basis of eliminating cross term interference,and provides a new tool for improving the time-frequency analysis ability of complex modulated sig-nals.
文摘A new algorithm for fast discovery of sequential patterns to solve the problems of too many candidate sets made by SPADE is presented, which is referred to as middle matching algorithm. Experiments on a large customer transaction database consisting of customer_id, transaction time, and transaction items demonstrate that the proposed algorithm performs better than SPADE attributed to its philosophy to generate a candidate set by matching two sequences in the middle place so as to reduce the number of the candidate sets.
基金The project supported by the research on non-circular plasma controlthe Innovation Project of Magnetic Confinement Fusion Plasma Physics from Chinese Academy of Sciences(No.C03071025)
文摘The EAST (HT-7U) superconducting tokamak is a national project of China on fusion research, with a capability of long-pulse (- 1000 s) operation. In order to realize a long-duration steady-state operation of EAST, some significant capability of real-time control is re-quired. It would be very crucial to obtain the current profile parameters and the plasma shapes in real time by a flexible control system. As those discharge parameters cannot be directly measured, so a current profile consistent with the magnetohydrodynamic equilibrium should be evaluated from external magnetic measurements, based on a linearized iterative least square method, which can meet the requirements of the measurements. The arithmetic that the EFIT (equilibrium fitting code) is used for reference will be given in this paper and the computational efforts are reduced by parametrizing the current profile linearly in terms of a number of physical parameters. In order to introduce this reconstruction algorithm clearly, the main hardware design will be listed also.
文摘The matrix inversion operation is needed in the MMSE decoding algorithm of orthogonal space-time block coding （OSTBC） proposed by Papadias and Foschini. In this paper, an minimum mean square error （MMSE） decoding algorithm without matrix inversion is proposed, by which the computational complexity can be reduced directly but the decoding performance is not affected.
文摘In the optimization of train diagrams, selecting the arrival and departure paths of the through gains has a great impact on the dwell time at district stations. In this paper, on the basis of train paths and the through train connection time standard at district stations, we built a mathematical model aiming at minimizing dwell time of through trains at two adjacent district stations, and then converted this into a network flow model to which is added a source and a sink node. Then, we propose a new algorithm for solving the network flow model based on the minimum-cost flow algorithm. A case study for through trains from the Guiyang South Railway Station to the Chongqing West Railway Station shows that the algorithm is reliable and efficient for solving the problem of through train connections, and there is a reduction in the total dwell time that the through trains spend at two adjacent district stations.
