Motivated by the business model called“community group buying”(CGB),which has emerged in China and some countries in Southeast Asia,such as Singapore and Indonesia,we develop algorithms that could help CGB platforms...Motivated by the business model called“community group buying”(CGB),which has emerged in China and some countries in Southeast Asia,such as Singapore and Indonesia,we develop algorithms that could help CGB platforms match consumers with stage-stations(the picking up center under the CGB mode).By altering the fundamental design of the existing hierarchy algorithms,improvements are achieved.It is proven that our method has a faster running speed and greater space efficiency.Our algorithms avoid traversal and compress the time complexities of matching a consumer with a stage-station and updating the storage information to O(logM)and O(MlogG),where M is the number of stage-stations and G is that of the platform’s stock-keeping units.Simulation comparisons of our algorithms with the current methods of CGB platforms show that our approaches can effectively reduce delivery costs.An interesting observation of the simula-tions is worthy of note:Increasing G may incur higher costs since it makes inventories more dispersed and delivery prob-lems more complicated.展开更多
A new spectral matching algorithm is proposed by us- ing nonsubsampled contourlet transform and scale-invariant fea- ture transform. The nonsubsampled contourlet transform is used to decompose an image into a low freq...A new spectral matching algorithm is proposed by us- ing nonsubsampled contourlet transform and scale-invariant fea- ture transform. The nonsubsampled contourlet transform is used to decompose an image into a low frequency image and several high frequency images, and the scale-invariant feature transform is employed to extract feature points from the low frequency im- age. A proximity matrix is constructed for the feature points of two related images. By singular value decomposition of the proximity matrix, a matching matrix （or matching result） reflecting the match- ing degree among feature points is obtained. Experimental results indicate that the proposed algorithm can reduce time complexity and possess a higher accuracy.展开更多
An adaptive technique adopting quantum genetic algorithm （QGA） for antenna impedance tuning is presented. Three examples are given with different types of antenna impedance. The frequency range of the dual standards...An adaptive technique adopting quantum genetic algorithm （QGA） for antenna impedance tuning is presented. Three examples are given with different types of antenna impedance. The frequency range of the dual standards is from 1.7 to 2.2 GHz. Simulation results show that the proposed tuning technique can achieve good accuracy of impedance matching and load power. The reflection coefficient and VSWR obtained are also very close to their ideal values. Comparison of the proposed QGA tuning method with conventional genetic algorithm based tuning method is Moreover, the proposed method can be useful for software wireless bands. also given, which shows that the QGA tuning algorithm is much faster. defined radio systems using a single antenna for multiple mobile and展开更多
The rapid identification of planting patterns for major crops in a large irrigated district has vital importance for irrigation management,water fee collection,and crop yield estimation.In this study,the OTSU algorith...The rapid identification of planting patterns for major crops in a large irrigated district has vital importance for irrigation management,water fee collection,and crop yield estimation.In this study,the OTSU algorithm and Mean-Shift algorithm were employed to automatically determine threshold values for mapping two main rotated crop patterns at the pixel scale.A time series analysis was conducted to extract the spatial distribution of rice-wheat and wheat-maize rotations in the Chuanhang irrigation district from 2016 to 2020.The results demonstrate that both threshold segmentation algorithms are reliable in extracting the spatial distribution of the crops,with an overall accuracy exceeding 80%.Additionally,both Kappa coefficients surpass 0.7,indicating better performance by OTSU method.Over the period from 2016 to 2020,the area occupied by rice-wheat rotation cropping ranged from 12500 to 14400 hm 2;whereas wheat-maize rotation cropping exhibited smaller and more variable areas ranging from 19730 to 34070 hm 2.These findings highlight how remote sensing-based approaches can provide reliable support for rapidly and accurately identifying the spatial distribution of main crop rotation patterns within a large irrigation district.展开更多
A simple and effective greedy algorithm for image approximation is proposed. Based on the matching pursuit approach, it is characterized by a reduced computational complexity benefiting from two major modifications. F...A simple and effective greedy algorithm for image approximation is proposed. Based on the matching pursuit approach, it is characterized by a reduced computational complexity benefiting from two major modifications. First, it iteratively finds an approximation by selecting M atoms instead of one at a time. Second, the inner product computations are confined within only a fraction of dictionary atoms at each iteration. The modifications are implemented very efficiently due to the spatial incoherence of the dictionary. Experimental results show that compared with full search matching pursuit, the proposed algorithm achieves a speed-up gain of 14.4-36.7 times while maintaining the approximation quality.展开更多
This paper presents a modified multi-resolution telescopic search algorithm (MRTlcSA) for the block-matching motion estimation. A novel inverse telescopic search is substituted for the conventional telescopic search, ...This paper presents a modified multi-resolution telescopic search algorithm (MRTlcSA) for the block-matching motion estimation. A novel inverse telescopic search is substituted for the conventional telescopic search, that reduces the on-chip memory size and memory bandwidth for VLSI implementation. In addition, strategies of motion track and adaptive search window are applied to reduce the computational complexity of motion estimation. Simulation results show that, compared with the MRTleSA, the proposed algorithm reduces the computational load to only 30% while preserving almost the same image quality. Comparisons on hardware cost and power consumption of the VLSI implementations using the two algorithms are also presented in the paper.展开更多
To find out all dependency relationships in which metaphors probably exist between syntax constituents in a given sentence,a dependency tree matching algorithm oriented to Chinese metaphor processing is proposed based...To find out all dependency relationships in which metaphors probably exist between syntax constituents in a given sentence,a dependency tree matching algorithm oriented to Chinese metaphor processing is proposed based on a research of unordered tree inclusion matching.In this algorithm,the pattern library is composed of formalization dependency syntax trees that are derived from large-scale metaphor sentences.These kinds of metaphor sentences are saved in the pattern library in advance.The main process of this algorithm is up-down searching and bottom-up backtracking revising.The algorithm discovers potential metaphoric structures in Chinese sentences from metaphoric dependency pattern library.Finally,the feasibility and efficiency of the new matching algorithm are further testified by the results of a series of experiments on dependency pattern library.Hence,accurate dependency relationships can be achieved through this algorithm.展开更多
A novel method of matching stiffness and continuous variable damping of an ECAS(electronically controlled air suspension) based on LQG(linear quadratic Gaussian) control was proposed to simultaneously improve the road...A novel method of matching stiffness and continuous variable damping of an ECAS(electronically controlled air suspension) based on LQG(linear quadratic Gaussian) control was proposed to simultaneously improve the road-friendliness and ride comfort of a two-axle school bus.Taking account of the suspension nonlinearities and target-height-dependent variation in suspension characteristics,a stiffness model of the ECAS mounted on the drive axle of the bus was developed based on thermodynamics and the key parameters were obtained through field tests.By determining the proper range of the target height for the ECAS of the fully-loaded bus based on the design requirements of vehicle body bounce frequency,the control algorithm of the target suspension height(i.e.,stiffness) was derived according to driving speed and road roughness.Taking account of the nonlinearities of a continuous variable semi-active damper,the damping force was obtained through the subtraction of the air spring force from the optimum integrated suspension force,which was calculated based on LQG control.Finally,a GA(genetic algorithm)-based matching method between stepped variable damping and stiffness was employed as a benchmark to evaluate the effectiveness of the LQG-based matching method.Simulation results indicate that compared with the GA-based matching method,both dynamic tire force and vehicle body vertical acceleration responses are markedly reduced around the vehicle body bounce frequency employing the LQG-based matching method,with peak values of the dynamic tire force PSD(power spectral density) decreased by 73.6%,60.8% and 71.9% in the three cases,and corresponding reduction are 71.3%,59.4% and 68.2% for the vehicle body vertical acceleration.A strong robustness to variation of driving speed and road roughness is also observed for the LQG-based matching method.展开更多
Optimization efficiencies and mechanisms of simulated annealing, genetic algorithm, differential evolution and downhill simplex differential evolution are compared and analyzed. Simulated annealing and genetic algorit...Optimization efficiencies and mechanisms of simulated annealing, genetic algorithm, differential evolution and downhill simplex differential evolution are compared and analyzed. Simulated annealing and genetic algorithm use a directed random process to search the parameter space for an optimal solution. They include the ability to avoid local minima, but as no gradient information is used, searches may be relatively inefficient. Differential evolution uses information from a distance and azimuth between individuals of a population to search the parameter space, the initial search is effective, but the search speed decreases quickly because differential information between the individuals of population vanishes. Local downhill simplex and global differential evolution methods are developed separately, and combined to produce a hybrid downhill simplex differential evolution algorithm. The hybrid algorithm is sensitive to gradients of the object function and search of the parameter space is effective. These algorithms are applied to the matched field inversion with synthetic data. Optimal values of the parameters, the final values of object function and inversion time is presented and compared.展开更多
针对目前视频拼接技术中的主要问题,即SURF(Speed Up Robust Features)特征提取算法与FLANN(Fast Library or Approximate Nearest Neighbors)特征匹配算法在综采工作面恶劣环境中存在特征点误提取和特征点匹配正确率低的问题,提出一种...针对目前视频拼接技术中的主要问题,即SURF(Speed Up Robust Features)特征提取算法与FLANN(Fast Library or Approximate Nearest Neighbors)特征匹配算法在综采工作面恶劣环境中存在特征点误提取和特征点匹配正确率低的问题,提出一种改进SURF-FLANN的综采工作面视频拼接特征提取与匹配算法。为了提高特征点提取正确率,该方法通过将传统的高斯滤波换为更为先进的双边滤波提取图像中的SURF关键特征点,同时在特征向量中引入特征点4-领域内的特征点描述符信息,从而改进了描述符算子,进一步提高了特征点的描述能力。为了提升特征点匹配速度,提出了R-FLANN(Random Sample Consensus-Fast Library or Approximate Nearest Neighbors)特征匹配算法,该算法利用RANSAC算法获取特征点的匹配先验信息剔除无匹配、误匹配的特征点,从而提高特征点匹配速度。为了验证改进效果,通过消融试验验证了改进SURF-FLANN的特征提取与匹配算法有效提升综采工作面视频图像特征提取和匹配正确率。通过本文方法与SIFT+FLANN,Hairrs与SURF+FLANN的特征提取与匹配算法进行特征点提取与匹配的对比试验,结果表明本文方法特征提取与匹配平均正确率和平均匹配速度最高,分别达到了81.47%和51.47帧/s。通过运用本文方法与SIFT+FLANN,Hairrs与SURF+FLANN的特征提取与匹配算法进行视频图像拼接对比试验,结果表明本文提出的方法在拼接效果清晰度、对比度、熵、拼接速率指标都最好,得到了最佳效果。展开更多
基金supported by the National Natural Science Foundation of China(71991464,71921001)Fundamental Research Funds for the Central Universities,General Program(WK2040000053)Key Program(YD2040002027)。
文摘Motivated by the business model called“community group buying”(CGB),which has emerged in China and some countries in Southeast Asia,such as Singapore and Indonesia,we develop algorithms that could help CGB platforms match consumers with stage-stations(the picking up center under the CGB mode).By altering the fundamental design of the existing hierarchy algorithms,improvements are achieved.It is proven that our method has a faster running speed and greater space efficiency.Our algorithms avoid traversal and compress the time complexities of matching a consumer with a stage-station and updating the storage information to O(logM)and O(MlogG),where M is the number of stage-stations and G is that of the platform’s stock-keeping units.Simulation comparisons of our algorithms with the current methods of CGB platforms show that our approaches can effectively reduce delivery costs.An interesting observation of the simula-tions is worthy of note:Increasing G may incur higher costs since it makes inventories more dispersed and delivery prob-lems more complicated.
基金supported by the National Natural Science Foundation of China (6117212711071002)+1 种基金the Specialized Research Fund for the Doctoral Program of Higher Education (20113401110006)the Innovative Research Team of 211 Project in Anhui University (KJTD007A)
文摘A new spectral matching algorithm is proposed by us- ing nonsubsampled contourlet transform and scale-invariant fea- ture transform. The nonsubsampled contourlet transform is used to decompose an image into a low frequency image and several high frequency images, and the scale-invariant feature transform is employed to extract feature points from the low frequency im- age. A proximity matrix is constructed for the feature points of two related images. By singular value decomposition of the proximity matrix, a matching matrix （or matching result） reflecting the match- ing degree among feature points is obtained. Experimental results indicate that the proposed algorithm can reduce time complexity and possess a higher accuracy.
基金Projects(61102039, 51107034) supported by the National Natural Science Foundation of ChinaProject(2011FJ3080) supported by the Planned Science and Technology Project of Hunan Province ChinaProject supported by Fundamental Research Funds for the Central Universities, China
文摘An adaptive technique adopting quantum genetic algorithm （QGA） for antenna impedance tuning is presented. Three examples are given with different types of antenna impedance. The frequency range of the dual standards is from 1.7 to 2.2 GHz. Simulation results show that the proposed tuning technique can achieve good accuracy of impedance matching and load power. The reflection coefficient and VSWR obtained are also very close to their ideal values. Comparison of the proposed QGA tuning method with conventional genetic algorithm based tuning method is Moreover, the proposed method can be useful for software wireless bands. also given, which shows that the QGA tuning algorithm is much faster. defined radio systems using a single antenna for multiple mobile and
基金Jiangsu Water Science and Technology Project(2021081)。
文摘The rapid identification of planting patterns for major crops in a large irrigated district has vital importance for irrigation management,water fee collection,and crop yield estimation.In this study,the OTSU algorithm and Mean-Shift algorithm were employed to automatically determine threshold values for mapping two main rotated crop patterns at the pixel scale.A time series analysis was conducted to extract the spatial distribution of rice-wheat and wheat-maize rotations in the Chuanhang irrigation district from 2016 to 2020.The results demonstrate that both threshold segmentation algorithms are reliable in extracting the spatial distribution of the crops,with an overall accuracy exceeding 80%.Additionally,both Kappa coefficients surpass 0.7,indicating better performance by OTSU method.Over the period from 2016 to 2020,the area occupied by rice-wheat rotation cropping ranged from 12500 to 14400 hm 2;whereas wheat-maize rotation cropping exhibited smaller and more variable areas ranging from 19730 to 34070 hm 2.These findings highlight how remote sensing-based approaches can provide reliable support for rapidly and accurately identifying the spatial distribution of main crop rotation patterns within a large irrigation district.
文摘A simple and effective greedy algorithm for image approximation is proposed. Based on the matching pursuit approach, it is characterized by a reduced computational complexity benefiting from two major modifications. First, it iteratively finds an approximation by selecting M atoms instead of one at a time. Second, the inner product computations are confined within only a fraction of dictionary atoms at each iteration. The modifications are implemented very efficiently due to the spatial incoherence of the dictionary. Experimental results show that compared with full search matching pursuit, the proposed algorithm achieves a speed-up gain of 14.4-36.7 times while maintaining the approximation quality.
文摘This paper presents a modified multi-resolution telescopic search algorithm (MRTlcSA) for the block-matching motion estimation. A novel inverse telescopic search is substituted for the conventional telescopic search, that reduces the on-chip memory size and memory bandwidth for VLSI implementation. In addition, strategies of motion track and adaptive search window are applied to reduce the computational complexity of motion estimation. Simulation results show that, compared with the MRTleSA, the proposed algorithm reduces the computational load to only 30% while preserving almost the same image quality. Comparisons on hardware cost and power consumption of the VLSI implementations using the two algorithms are also presented in the paper.
基金Project(50474033)supported by the National Natural Science Foundation of China
文摘To find out all dependency relationships in which metaphors probably exist between syntax constituents in a given sentence,a dependency tree matching algorithm oriented to Chinese metaphor processing is proposed based on a research of unordered tree inclusion matching.In this algorithm,the pattern library is composed of formalization dependency syntax trees that are derived from large-scale metaphor sentences.These kinds of metaphor sentences are saved in the pattern library in advance.The main process of this algorithm is up-down searching and bottom-up backtracking revising.The algorithm discovers potential metaphoric structures in Chinese sentences from metaphoric dependency pattern library.Finally,the feasibility and efficiency of the new matching algorithm are further testified by the results of a series of experiments on dependency pattern library.Hence,accurate dependency relationships can be achieved through this algorithm.
基金Projects(51305117,51178158)supported by the National Natural Science Foundation of ChinaProject(20130111120031)supported by the Specialized Research Fund for the Doctoral Program of Higher Education+1 种基金Project(2013M530230)supported by the China Postdoctoral Science FoundationProjects(2012HGQC0015,2011HGBZ0945)supported by the Fundamental Research Funds for the Central Universities,China
文摘A novel method of matching stiffness and continuous variable damping of an ECAS(electronically controlled air suspension) based on LQG(linear quadratic Gaussian) control was proposed to simultaneously improve the road-friendliness and ride comfort of a two-axle school bus.Taking account of the suspension nonlinearities and target-height-dependent variation in suspension characteristics,a stiffness model of the ECAS mounted on the drive axle of the bus was developed based on thermodynamics and the key parameters were obtained through field tests.By determining the proper range of the target height for the ECAS of the fully-loaded bus based on the design requirements of vehicle body bounce frequency,the control algorithm of the target suspension height(i.e.,stiffness) was derived according to driving speed and road roughness.Taking account of the nonlinearities of a continuous variable semi-active damper,the damping force was obtained through the subtraction of the air spring force from the optimum integrated suspension force,which was calculated based on LQG control.Finally,a GA(genetic algorithm)-based matching method between stepped variable damping and stiffness was employed as a benchmark to evaluate the effectiveness of the LQG-based matching method.Simulation results indicate that compared with the GA-based matching method,both dynamic tire force and vehicle body vertical acceleration responses are markedly reduced around the vehicle body bounce frequency employing the LQG-based matching method,with peak values of the dynamic tire force PSD(power spectral density) decreased by 73.6%,60.8% and 71.9% in the three cases,and corresponding reduction are 71.3%,59.4% and 68.2% for the vehicle body vertical acceleration.A strong robustness to variation of driving speed and road roughness is also observed for the LQG-based matching method.
文摘Optimization efficiencies and mechanisms of simulated annealing, genetic algorithm, differential evolution and downhill simplex differential evolution are compared and analyzed. Simulated annealing and genetic algorithm use a directed random process to search the parameter space for an optimal solution. They include the ability to avoid local minima, but as no gradient information is used, searches may be relatively inefficient. Differential evolution uses information from a distance and azimuth between individuals of a population to search the parameter space, the initial search is effective, but the search speed decreases quickly because differential information between the individuals of population vanishes. Local downhill simplex and global differential evolution methods are developed separately, and combined to produce a hybrid downhill simplex differential evolution algorithm. The hybrid algorithm is sensitive to gradients of the object function and search of the parameter space is effective. These algorithms are applied to the matched field inversion with synthetic data. Optimal values of the parameters, the final values of object function and inversion time is presented and compared.
