Quantum singular value thresholding(QSVT) algorithm,as a core module of many mathematical models,seeks the singular values of a sparse and low rank matrix exceeding a threshold and their associated singular vectors.Th...Quantum singular value thresholding(QSVT) algorithm,as a core module of many mathematical models,seeks the singular values of a sparse and low rank matrix exceeding a threshold and their associated singular vectors.The existing all-qubit QSVT algorithm demands lots of ancillary qubits,remaining a huge challenge for realization on nearterm intermediate-scale quantum computers.In this paper,we propose a hybrid QSVT(HQSVT) algorithm utilizing both discrete variables(DVs) and continuous variables(CVs).In our algorithm,raw data vectors are encoded into a qubit system and the following data processing is fulfilled by hybrid quantum operations.Our algorithm requires O [log(MN)] qubits with0(1) qumodes and totally performs 0(1) operations,which significantly reduces the space and runtime consumption.展开更多
A new classification algorithm for web mining is proposed on the basis of general classification algorithm for data mining in order to implement personalized information services. The building tree method of detecting...A new classification algorithm for web mining is proposed on the basis of general classification algorithm for data mining in order to implement personalized information services. The building tree method of detecting class threshold is used for construction of decision tree according to the concept of user expectation so as to find classification rules in different layers. Compared with the traditional C4.5 algorithm, the disadvantage of excessive adaptation in C4.5 has been improved so that classification results not only have much higher accuracy but also statistic meaning.展开更多
基于快速傅里叶变换的快速迭代收缩阈值算法(fast iterative shrinkage threshold algorithm based on fast Fourier transform, FFT-FISTA)具有较高的计算效率,但其忽略点扩散函数的空间变化及卷绕误差,造成声源识别性能的损失,为此提...基于快速傅里叶变换的快速迭代收缩阈值算法(fast iterative shrinkage threshold algorithm based on fast Fourier transform, FFT-FISTA)具有较高的计算效率,但其忽略点扩散函数的空间变化及卷绕误差,造成声源识别性能的损失,为此提出基于函数波束形成的改进FFT-FISTA算法。改进算法以函数波束形成输出作为FFT-FISTA算法的迭代输入,建立函数波束形成、声源分布及升幂空间转移不变点扩散函数的线性方程组,基于周期边界条件下的快速傅里叶变换进行迭代求解,使被运算的非周期函数变为一个周期函数,解决补零边界带来的波数泄漏问题,可提高运算准确性,进一步提升成像性能;通过指数运算锐化点扩散函数主瓣,拓展点扩散函数空间转移不变性假设的适用性。仿真和试验结果表明,相较于常规FFT-FISTA算法,改进算法能提升成像空间分辨率及动态范围,扩大FFT-FISTA算法的有效成像区域,压缩气体泄漏试验结果验证了改进算法的有效性。展开更多
In general conditions, most blind source separation algorithms are established on noisy-free model and ignore the noise that affects the quality of separated sources. Firstly, this paper introduces an improved natural...In general conditions, most blind source separation algorithms are established on noisy-free model and ignore the noise that affects the quality of separated sources. Firstly, this paper introduces an improved natural gradient algorithm based on bias removal technology to estimate the demixing matrix under noisy environment. Then the discrete wavelet transform technology is applied to the separated signals to further remove noise. In order to improve the separation effect, this paper analyzes the deficiency of hard threshold and soft threshold, and proposes a new wavelet threshold function based on the wavelet decomposition and reconfiguration. The simulations have verified that this method improves the signal noise ratio （SNR） of the separation results and the separation precision.展开更多
A multipath source self repair routing (MSSRR) algorithm for mobile ad hoc networks is proposed. By using multiple paths which can be repaired by themselves to transmit packets alternately, the network's load is b...A multipath source self repair routing (MSSRR) algorithm for mobile ad hoc networks is proposed. By using multiple paths which can be repaired by themselves to transmit packets alternately, the network's load is balanced, the link state in the network can be checked in time, the number of the times the route discovery mechanism starts is decreased. If only one route which will be broken can be used to transmit the packets, the route discovery mechanism is restarted.The algorithm is implemented on the basis of dynamic source routing (DSR). The effect of MSSRR on lifetime of the access from the source to the destination and the overhead is discussed. Compared with the performance of DSR,it can be seen that the algorithm can improve the performance of the network obviously and the overhead almost does not increase if the average hop count is larger.展开更多
基金Project supported by the Key Research and Development Program of Guangdong Province,China(Grant No.2018B030326001)the National Natural Science Foundation of China(Grant Nos.61521001,12074179,and 11890704)。
文摘Quantum singular value thresholding(QSVT) algorithm,as a core module of many mathematical models,seeks the singular values of a sparse and low rank matrix exceeding a threshold and their associated singular vectors.The existing all-qubit QSVT algorithm demands lots of ancillary qubits,remaining a huge challenge for realization on nearterm intermediate-scale quantum computers.In this paper,we propose a hybrid QSVT(HQSVT) algorithm utilizing both discrete variables(DVs) and continuous variables(CVs).In our algorithm,raw data vectors are encoded into a qubit system and the following data processing is fulfilled by hybrid quantum operations.Our algorithm requires O [log(MN)] qubits with0(1) qumodes and totally performs 0(1) operations,which significantly reduces the space and runtime consumption.
文摘A new classification algorithm for web mining is proposed on the basis of general classification algorithm for data mining in order to implement personalized information services. The building tree method of detecting class threshold is used for construction of decision tree according to the concept of user expectation so as to find classification rules in different layers. Compared with the traditional C4.5 algorithm, the disadvantage of excessive adaptation in C4.5 has been improved so that classification results not only have much higher accuracy but also statistic meaning.
文摘基于快速傅里叶变换的快速迭代收缩阈值算法(fast iterative shrinkage threshold algorithm based on fast Fourier transform, FFT-FISTA)具有较高的计算效率,但其忽略点扩散函数的空间变化及卷绕误差,造成声源识别性能的损失,为此提出基于函数波束形成的改进FFT-FISTA算法。改进算法以函数波束形成输出作为FFT-FISTA算法的迭代输入,建立函数波束形成、声源分布及升幂空间转移不变点扩散函数的线性方程组,基于周期边界条件下的快速傅里叶变换进行迭代求解,使被运算的非周期函数变为一个周期函数,解决补零边界带来的波数泄漏问题,可提高运算准确性,进一步提升成像性能;通过指数运算锐化点扩散函数主瓣,拓展点扩散函数空间转移不变性假设的适用性。仿真和试验结果表明,相较于常规FFT-FISTA算法,改进算法能提升成像空间分辨率及动态范围,扩大FFT-FISTA算法的有效成像区域,压缩气体泄漏试验结果验证了改进算法的有效性。
基金supported by the Key Item of Science and Technology Program of Xiangtan City,Hunan Province,China under Grant No. ZJ20071008
文摘In general conditions, most blind source separation algorithms are established on noisy-free model and ignore the noise that affects the quality of separated sources. Firstly, this paper introduces an improved natural gradient algorithm based on bias removal technology to estimate the demixing matrix under noisy environment. Then the discrete wavelet transform technology is applied to the separated signals to further remove noise. In order to improve the separation effect, this paper analyzes the deficiency of hard threshold and soft threshold, and proposes a new wavelet threshold function based on the wavelet decomposition and reconfiguration. The simulations have verified that this method improves the signal noise ratio （SNR） of the separation results and the separation precision.
文摘A multipath source self repair routing (MSSRR) algorithm for mobile ad hoc networks is proposed. By using multiple paths which can be repaired by themselves to transmit packets alternately, the network's load is balanced, the link state in the network can be checked in time, the number of the times the route discovery mechanism starts is decreased. If only one route which will be broken can be used to transmit the packets, the route discovery mechanism is restarted.The algorithm is implemented on the basis of dynamic source routing (DSR). The effect of MSSRR on lifetime of the access from the source to the destination and the overhead is discussed. Compared with the performance of DSR,it can be seen that the algorithm can improve the performance of the network obviously and the overhead almost does not increase if the average hop count is larger.
