Measurement-based one-way quantum computation, which uses cluster states as resources, provides an efficient model to perforrn computation. However, few of the continuous variable （CV） quantum algorithms and classic...Measurement-based one-way quantum computation, which uses cluster states as resources, provides an efficient model to perforrn computation. However, few of the continuous variable （CV） quantum algorithms and classical algorithms based on one-way quantum computation were proposed. In this work, we propose a method to implement the classical Hadamard transform algorithm utilizing the CV cluster state. Compared with classical computation, only half operations are required when it is operated in the one-way CV quantum computer. As an example, we present a concrete scheme of four-mode classical Hadamard transform algorithm with a four-partite CV cluster state. This method connects the quantum computer and the classical algorithms, which shows the feasibility of running classical algorithms in a quantum computer efficiently.展开更多
Lots of noises and heterogeneous objects with various sizes coexist in a complex image,such as an ore image;the classical image thresholding method cannot effectively distinguish between ores.To segment ore objects wi...Lots of noises and heterogeneous objects with various sizes coexist in a complex image,such as an ore image;the classical image thresholding method cannot effectively distinguish between ores.To segment ore objects with various sizes simultaneously,two adaptive windows in the image were chosen for each pixel;the gray value of windows was calculated by Otsu＇s threshold method.To extract the object skeleton,the definition principle of distance transformation templates was proposed.The ores linked together in a binary image were separated by distance transformation and gray reconstruction.The seed region of each object was picked up from the local maximum gray region of the reconstruction image.Starting from these seed regions,the watershed method was used to segment ore object effectively.The proposed algorithm marks and segments most objects from complex images precisely.展开更多
Direct algorithm of wavelet transform (WT) is the numerical algorithmobtained from the integral formula of WT by directly digitization. Some problems on realizing thealgorithm are studied. Some conclusions on the dire...Direct algorithm of wavelet transform (WT) is the numerical algorithmobtained from the integral formula of WT by directly digitization. Some problems on realizing thealgorithm are studied. Some conclusions on the direct algorithm of discrete wavelet transform (DWT),such as discrete convolution operation formula of wavelet coefficients and wavelet components,sampling principle and technology to wavelets, deciding method for scale range of wavelets, measuresto solve edge effect problem, etc, are obtained. The realization of direct algorithm of continuouswavelet transform (CWT) is also studied. The computing cost of direct algorithm and Mallat algorithmof DWT are still studied, and the computing formulae are obtained. These works are beneficial todeeply understand WT and Mallat algorithm. Examples in the end show that direct algorithm can alsobe applied widely.展开更多
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.展开更多
To eliminate the aliasing that appeared during the measurement of multi-components nonstationary signals, a novel kind of anti-aliasing algorithm based on the short time Fourier transform （STFT） is brought forward. ...To eliminate the aliasing that appeared during the measurement of multi-components nonstationary signals, a novel kind of anti-aliasing algorithm based on the short time Fourier transform （STFT） is brought forward. First the physical essence of aliasing that occurs is analyzed; second the interpolation algorithm model is setup based on the Hamming window; then the fast implementation of the algorithm using the Newton iteration method is given. Using the numerical simulation the feasibility of algorithm is validated. Finally, the electrical circuit experiment shows the practicality of the algorithm in the electrical engineering.展开更多
The purpose of the Combined Economic Emission Dispatch(CEED)of electric power is to offer the most exceptional schedule for production units,which must run with both low fuel costs and emission levels concurrently,the...The purpose of the Combined Economic Emission Dispatch(CEED)of electric power is to offer the most exceptional schedule for production units,which must run with both low fuel costs and emission levels concurrently,thereby meeting the lack of system equality and inequality constraints.Economic and emissions dispatching has become a primary and significant concern in power system networks.Consequences of using non-renewable fuels as input to exhaust power systems with toxic gas emissions and depleted resources for future generations.The optimal power allocation to generators serves as a solution to this problem.Emission dispatch reduces emissions while ignoring economic considerations.A collective strategy known as Combined Economic and Emission Dispatch is utilized to resolve the above-mentioned problems and investigate the trade-off relationship between fuel cost and emissions.Consequently,this work manages the Substantial Augmented Transformative Algorithm(SATA)to take care of the Combined Economic Emission Dispatch Problem(CEEDP)of warm units while fulfilling imperatives,for example,confines on generator limit,diminish the fuel cost,lessen the emission and decrease the force misfortune.SATA is a stochastic streamlining process that relies upon the development and knowledge of swarms.The goal is to minimize the total fuel cost of fossil-based thermal power generation units that generate and cause environmental pollution.The algorithm searches for solutions in the search space from the smallest to the largest in the case of forwarding search.The simulation of the proposed system is developed using MATLAB Simulink software.Simulation results show the effectiveness and practicability of this method in terms of economic and emission dispatching issues.The performance of the proposed system is compared with existing Artificial Bee Colony-Particle Swarm Optimization(ABC-PSO),Simulated Annealing(SA),and Differential Evolution(DE)methods.The fuel cost and gas emission of the proposed system are 128904$/hr and 138094.4652$/hr.展开更多
A new algorithm for clipping line segments by a rectangular window on rectangular coordinate system is presented in this paper. The algorithm is very different to the other line clipping algorithms. For the line segme...A new algorithm for clipping line segments by a rectangular window on rectangular coordinate system is presented in this paper. The algorithm is very different to the other line clipping algorithms. For the line segments that cannot be identified as completely inside or outside the window by simple testings, this algorithm applies affine transformations (the shearing transformations) to the line segments and the window, and changes the slopes of the line segments and the shape of the window. Thus, it is clear for the line segment to be outside or inside of the window. If the line segments intersect the window, the algorithm immediately (no solving equations) gets the intersection points. Having applied the inverse transformations to the intersection points, the algorithm has the final results. The algorithm is successful to avoid the complex classifications and computations. Besides, the algorithm is effective to simplify the processes of finding the intersection points. Comparing to some classical algorithms, the algorithm of this paper is faster for clipping line segments and more efficient for calculations.展开更多
基金Supported by the National Natural Science Foundation of China under Grant Nos 11504024,61502041,61602045 and 61602046the National Key Research and Development Program of China under Grant No 2016YFA0302600
文摘Measurement-based one-way quantum computation, which uses cluster states as resources, provides an efficient model to perforrn computation. However, few of the continuous variable （CV） quantum algorithms and classical algorithms based on one-way quantum computation were proposed. In this work, we propose a method to implement the classical Hadamard transform algorithm utilizing the CV cluster state. Compared with classical computation, only half operations are required when it is operated in the one-way CV quantum computer. As an example, we present a concrete scheme of four-mode classical Hadamard transform algorithm with a four-partite CV cluster state. This method connects the quantum computer and the classical algorithms, which shows the feasibility of running classical algorithms in a quantum computer efficiently.
基金supported by the National Key Technologies R & D Program of China (No.2009BAB48B02)the National High-Tech Research and Development Program of China (Nos.2010AA060278600 and 2008AA062101)
文摘Lots of noises and heterogeneous objects with various sizes coexist in a complex image,such as an ore image;the classical image thresholding method cannot effectively distinguish between ores.To segment ore objects with various sizes simultaneously,two adaptive windows in the image were chosen for each pixel;the gray value of windows was calculated by Otsu＇s threshold method.To extract the object skeleton,the definition principle of distance transformation templates was proposed.The ores linked together in a binary image were separated by distance transformation and gray reconstruction.The seed region of each object was picked up from the local maximum gray region of the reconstruction image.Starting from these seed regions,the watershed method was used to segment ore object effectively.The proposed algorithm marks and segments most objects from complex images precisely.
基金This project is supported by National Natural Science Foundation of China (No.50135050)
文摘Direct algorithm of wavelet transform (WT) is the numerical algorithmobtained from the integral formula of WT by directly digitization. Some problems on realizing thealgorithm are studied. Some conclusions on the direct algorithm of discrete wavelet transform (DWT),such as discrete convolution operation formula of wavelet coefficients and wavelet components,sampling principle and technology to wavelets, deciding method for scale range of wavelets, measuresto solve edge effect problem, etc, are obtained. The realization of direct algorithm of continuouswavelet transform (CWT) is also studied. The computing cost of direct algorithm and Mallat algorithmof DWT are still studied, and the computing formulae are obtained. These works are beneficial todeeply understand WT and Mallat algorithm. Examples in the end show that direct algorithm can alsobe applied widely.
基金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.
基金the National Natural Science Foundation of China (90407007 60372001).
文摘To eliminate the aliasing that appeared during the measurement of multi-components nonstationary signals, a novel kind of anti-aliasing algorithm based on the short time Fourier transform （STFT） is brought forward. First the physical essence of aliasing that occurs is analyzed; second the interpolation algorithm model is setup based on the Hamming window; then the fast implementation of the algorithm using the Newton iteration method is given. Using the numerical simulation the feasibility of algorithm is validated. Finally, the electrical circuit experiment shows the practicality of the algorithm in the electrical engineering.
文摘The purpose of the Combined Economic Emission Dispatch(CEED)of electric power is to offer the most exceptional schedule for production units,which must run with both low fuel costs and emission levels concurrently,thereby meeting the lack of system equality and inequality constraints.Economic and emissions dispatching has become a primary and significant concern in power system networks.Consequences of using non-renewable fuels as input to exhaust power systems with toxic gas emissions and depleted resources for future generations.The optimal power allocation to generators serves as a solution to this problem.Emission dispatch reduces emissions while ignoring economic considerations.A collective strategy known as Combined Economic and Emission Dispatch is utilized to resolve the above-mentioned problems and investigate the trade-off relationship between fuel cost and emissions.Consequently,this work manages the Substantial Augmented Transformative Algorithm(SATA)to take care of the Combined Economic Emission Dispatch Problem(CEEDP)of warm units while fulfilling imperatives,for example,confines on generator limit,diminish the fuel cost,lessen the emission and decrease the force misfortune.SATA is a stochastic streamlining process that relies upon the development and knowledge of swarms.The goal is to minimize the total fuel cost of fossil-based thermal power generation units that generate and cause environmental pollution.The algorithm searches for solutions in the search space from the smallest to the largest in the case of forwarding search.The simulation of the proposed system is developed using MATLAB Simulink software.Simulation results show the effectiveness and practicability of this method in terms of economic and emission dispatching issues.The performance of the proposed system is compared with existing Artificial Bee Colony-Particle Swarm Optimization(ABC-PSO),Simulated Annealing(SA),and Differential Evolution(DE)methods.The fuel cost and gas emission of the proposed system are 128904$/hr and 138094.4652$/hr.
文摘A new algorithm for clipping line segments by a rectangular window on rectangular coordinate system is presented in this paper. The algorithm is very different to the other line clipping algorithms. For the line segments that cannot be identified as completely inside or outside the window by simple testings, this algorithm applies affine transformations (the shearing transformations) to the line segments and the window, and changes the slopes of the line segments and the shape of the window. Thus, it is clear for the line segment to be outside or inside of the window. If the line segments intersect the window, the algorithm immediately (no solving equations) gets the intersection points. Having applied the inverse transformations to the intersection points, the algorithm has the final results. The algorithm is successful to avoid the complex classifications and computations. Besides, the algorithm is effective to simplify the processes of finding the intersection points. Comparing to some classical algorithms, the algorithm of this paper is faster for clipping line segments and more efficient for calculations.
