Since real world communication channels are not error free, the coded data transmitted on them may be corrupted, and block based image coding systems are vulnerable to transmission impairment. So the best neighborh...Since real world communication channels are not error free, the coded data transmitted on them may be corrupted, and block based image coding systems are vulnerable to transmission impairment. So the best neighborhood match method using genetic algorithm is used to conceal the error blocks. Experimental results show that the searching space can be greatly reduced by using genetic algorithm compared with exhaustive searching method, and good image quality is achieved. The peak signal noise ratios(PSNRs) of the restored images are increased greatly.展开更多
A universal locking model for single ion optical clocks was built based on a simple integrator and a double integrator.Different integrator algorithm parameters have been analyzed in both numerical simulations and exp...A universal locking model for single ion optical clocks was built based on a simple integrator and a double integrator.Different integrator algorithm parameters have been analyzed in both numerical simulations and experiments.The frequency variation measured by the comparison of two optical clocks coincides well with the simulation results for different second integrator parameters.According to the experimental results,the sensitivity of the servo error influenced by laser frequency drift with the addition of a double integrator was suppressed by a factor of 107.In a week-long comparison of optical clocks,the relative uncertainty of the servo error is determined to be 1.9×10^(-18),which is meaningful for the systematic uncertainty of the transportable single^(40)Ca^(+)ion optical clock entering the 10^(-18)level.展开更多
This study investigates the effects of systematic errors in phase inversions on the success rate and number of iterations in the optimized quantum random-walk search algorithm. Using the geometric description of this ...This study investigates the effects of systematic errors in phase inversions on the success rate and number of iterations in the optimized quantum random-walk search algorithm. Using the geometric description of this algorithm, a model of the algorithm with phase errors is established, and the relationship between the success rate of the algorithm, the database size, the number of iterations, and the phase error is determined. For a given database size, we obtain both the maximum success rate of the algorithm and the required number of iterations when phase errors are present in the algorithm. Analyses and numerical simulations show that the optimized quantum random-walk search algorithm is more robust against phase errors than Grover＇s algorithm.展开更多
Proper fixture design is crucial to obtain the better product quality according to the design specification during the workpiece fabrication. Locator layout planning is one of the most important tasks in the fixture ...Proper fixture design is crucial to obtain the better product quality according to the design specification during the workpiece fabrication. Locator layout planning is one of the most important tasks in the fixture design process. However, the design of a fixture relies heavily on the designerts expertise and experience up to now. Therefore, a new approach to loeator layout determination for workpieces with arbitrary complex surfaces is pro- posed for the first time. Firstly, based on the fuzzy judgment method, the proper locating reference and locator - numbers are determined with consideration of surface type, surface area and position tolerance. Secondly, the lo- cator positions are optimized by genetic algorithm（GA）. Finally, a typical example shows that the approach is su- perior to the experiential method and can improve positioning accuracy effectively.展开更多
An adaptive method for the solution of compressible flows is described. The idea results from the desire for an efficient grid system,and an accurate and robust solution method are used to resolve flow features of the...An adaptive method for the solution of compressible flows is described. The idea results from the desire for an efficient grid system,and an accurate and robust solution method are used to resolve flow features of the interest. The adaptation flow solution is proposed,including the detection of flow features based on the matrix error; the mesh adaptation using the mesh movement,the mesh refinement,the mesh coarsening,and their combination. The feature detection based on the matrix error can maintain the high resolution property for shock waves of the one-dimensional approximate Riemann solver and the higher order reconstruction scheme. The high grid efficiency is obtained with the anisotropically directional grid corresponding to feature directions,and the error of the flow-field is averaged. The procedure and its application to flow solutions of shock waves are described. Results validate that the method is reliable.展开更多
现有无源定位闭式算法均考虑视距(Line of Sight,LOS)环境,无法直接应用于存在遮挡的城市环境低空无人机目标定位等场景,同时,非视距(Non-Line of Sight,NLOS)优化定位算法计算效率较低。针对这些问题,本文开展中继辅助下的单站目标定...现有无源定位闭式算法均考虑视距(Line of Sight,LOS)环境,无法直接应用于存在遮挡的城市环境低空无人机目标定位等场景,同时,非视距(Non-Line of Sight,NLOS)优化定位算法计算效率较低。针对这些问题,本文开展中继辅助下的单站目标定位研究,通过引入中继收发器对目标信号进行转发,构造两条路径从而规避遮挡问题,同时考虑中继和观测站位置存在随机误差,提出了一种闭式算法来确定未知目标位置。该算法分为3个步骤:首先利用校准目标-中继收发器-观测站这一路径的额外信息,修正中继和观测站位置;随后基于未知目标-中继收发器-观测站获取的观测信息,通过引入额外变量的方式构建伪线性方程,利用加权最小二乘技术给出目标位置粗略估计;最后进一步挖掘目标位置与额外变量的非线性关系,再次构建矩阵方程并给出目标位置最终估计解。经过理论剖析与仿真验证,所提出的算法在可接受的测量误差和观测站点位置误差范围内,能够逼近克拉美罗下界(Cramer-Rao Lower Bound,CRLB)。展开更多
Forward-backward algorithm, used by watermark decoder for correcting non-binary synchronization errors, requires to traverse a very large scale trellis in order to achieve the proper posterior probability, leading to ...Forward-backward algorithm, used by watermark decoder for correcting non-binary synchronization errors, requires to traverse a very large scale trellis in order to achieve the proper posterior probability, leading to high computational complexity. In order to reduce the number of the states involved in the computation, an adaptive pruning method for the trellis is proposed. In this scheme, we prune the states which have the low forward-backward quantities below a carefully-chosen threshold. Thus, a wandering trellis with much less states is achieved, which contains most of the states with quite high probability. Simulation results reveal that, with the proper scaling factor, significant complexity reduction in the forward-backward algorithm is achieved at the expense of slight performance degradation.展开更多
For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. ...For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently. Numerical simulations show that this modified method outperforms standard BP algorithm with an obvious performance improvement.展开更多
In Mobile Ad-hoc Networks (MANETs), routing protocols directly affect various indices of network Quality of Service (QoS), so they play an important role in network performance. To address the drawbacks associated wit...In Mobile Ad-hoc Networks (MANETs), routing protocols directly affect various indices of network Quality of Service (QoS), so they play an important role in network performance. To address the drawbacks associated with traditional routing protocols in MANETs, such as poor anti-fading performance and slow convergence rate, for basic Dynamic Source Routing (DSR), we propose a new routing model based on Grover's searching algorithm. With this new routing model, each node maintains a node vector function, and all the nodes can obtain a node probability vector using Grover's algorithm, and then select an optimal routing according to node probability. Simulation results show that compared with DSR, this new routing protocol can effectively extend the network lifetime, as well as reduce the network delay and the number of routing hops. It can also significantly improve the anti-jamming capability of the network.展开更多
A smoothing algorithm for energy spectrum based on differential nonlinearity(DNL) error elimination with total counts conservation for high-energy particle detector systems is presented. It is physics based and is onl...A smoothing algorithm for energy spectrum based on differential nonlinearity(DNL) error elimination with total counts conservation for high-energy particle detector systems is presented. It is physics based and is only determined by the DNL error of analog-to-digital converter device itself. From the experimental results, this algorithm slightly improves both noise performance and energy resolution, while greatly reduces the testing errors by almost a half compared to their original values. In addition, the reduced-x^2 statistic for evaluating the Gaussian fitting goodness is significantly reduced by almost two orders after smoothing. As a typical verification example,this algorithm is successfully applied in the ground calibration of the Low Energy X-ray Instrument onboard the Hard X-ray Modulation Telescope(HXMT-LE) satellite,lending it a powerful, nondestructive and low-cost tool for both calibration and data processing for high-energy particle detector systems.展开更多
Several kind of new numerical schemes for the stationary Navier-Stokes equations based on the virtue of Inertial Manifold and Approximate Inertial Manifold, which we call them inertial algorithms in this paper, togeth...Several kind of new numerical schemes for the stationary Navier-Stokes equations based on the virtue of Inertial Manifold and Approximate Inertial Manifold, which we call them inertial algorithms in this paper, together with their error estimations are presented. All these algorithms are constructed under an uniform frame, that is to construct some kind of new projections for the Sobolev space in which the true solution is sought. It is shown that the proposed inertial algorithms can greatly improve the convergence rate of the standard Galerkin approximate solution with lower computing effort. And some numerical examples are also given to verify results of this paper.展开更多
In this paper, a posteriori error estimates for the generalized Schwartz method with Dirichlet boundary conditions on the interfaces for advection-diffusion equation with second order boundary value problems are prove...In this paper, a posteriori error estimates for the generalized Schwartz method with Dirichlet boundary conditions on the interfaces for advection-diffusion equation with second order boundary value problems are proved by using the Euler time scheme combined with Galerkin spatial method. Furthermore, an asymptotic behavior in Sobolev norm is de- duced using Benssoussau-Lions＇ algorithm. Finally, the results of some numerical experiments are presented to support the theory.展开更多
文摘Since real world communication channels are not error free, the coded data transmitted on them may be corrupted, and block based image coding systems are vulnerable to transmission impairment. So the best neighborhood match method using genetic algorithm is used to conceal the error blocks. Experimental results show that the searching space can be greatly reduced by using genetic algorithm compared with exhaustive searching method, and good image quality is achieved. The peak signal noise ratios(PSNRs) of the restored images are increased greatly.
基金the National Key Research and Development Program of China(Grant No.2017YFA0304404)the National Natural Science Foundation of China(Grant No.11674357)。
文摘A universal locking model for single ion optical clocks was built based on a simple integrator and a double integrator.Different integrator algorithm parameters have been analyzed in both numerical simulations and experiments.The frequency variation measured by the comparison of two optical clocks coincides well with the simulation results for different second integrator parameters.According to the experimental results,the sensitivity of the servo error influenced by laser frequency drift with the addition of a double integrator was suppressed by a factor of 107.In a week-long comparison of optical clocks,the relative uncertainty of the servo error is determined to be 1.9×10^(-18),which is meaningful for the systematic uncertainty of the transportable single^(40)Ca^(+)ion optical clock entering the 10^(-18)level.
基金Project supported by the National Basic Research Program of China(Grant No.2013CB338002)
文摘This study investigates the effects of systematic errors in phase inversions on the success rate and number of iterations in the optimized quantum random-walk search algorithm. Using the geometric description of this algorithm, a model of the algorithm with phase errors is established, and the relationship between the success rate of the algorithm, the database size, the number of iterations, and the phase error is determined. For a given database size, we obtain both the maximum success rate of the algorithm and the required number of iterations when phase errors are present in the algorithm. Analyses and numerical simulations show that the optimized quantum random-walk search algorithm is more robust against phase errors than Grover＇s algorithm.
基金Supported by the Natural Science Foundation of Jiangxi Province(2009GZC0104)the Science and Technology Research Project of Jiangxi Provincial Department of Education(GJJ10521)~~
文摘Proper fixture design is crucial to obtain the better product quality according to the design specification during the workpiece fabrication. Locator layout planning is one of the most important tasks in the fixture design process. However, the design of a fixture relies heavily on the designerts expertise and experience up to now. Therefore, a new approach to loeator layout determination for workpieces with arbitrary complex surfaces is pro- posed for the first time. Firstly, based on the fuzzy judgment method, the proper locating reference and locator - numbers are determined with consideration of surface type, surface area and position tolerance. Secondly, the lo- cator positions are optimized by genetic algorithm（GA）. Finally, a typical example shows that the approach is su- perior to the experiential method and can improve positioning accuracy effectively.
文摘An adaptive method for the solution of compressible flows is described. The idea results from the desire for an efficient grid system,and an accurate and robust solution method are used to resolve flow features of the interest. The adaptation flow solution is proposed,including the detection of flow features based on the matrix error; the mesh adaptation using the mesh movement,the mesh refinement,the mesh coarsening,and their combination. The feature detection based on the matrix error can maintain the high resolution property for shock waves of the one-dimensional approximate Riemann solver and the higher order reconstruction scheme. The high grid efficiency is obtained with the anisotropically directional grid corresponding to feature directions,and the error of the flow-field is averaged. The procedure and its application to flow solutions of shock waves are described. Results validate that the method is reliable.
文摘现有无源定位闭式算法均考虑视距(Line of Sight,LOS)环境,无法直接应用于存在遮挡的城市环境低空无人机目标定位等场景,同时,非视距(Non-Line of Sight,NLOS)优化定位算法计算效率较低。针对这些问题,本文开展中继辅助下的单站目标定位研究,通过引入中继收发器对目标信号进行转发,构造两条路径从而规避遮挡问题,同时考虑中继和观测站位置存在随机误差,提出了一种闭式算法来确定未知目标位置。该算法分为3个步骤:首先利用校准目标-中继收发器-观测站这一路径的额外信息,修正中继和观测站位置;随后基于未知目标-中继收发器-观测站获取的观测信息,通过引入额外变量的方式构建伪线性方程,利用加权最小二乘技术给出目标位置粗略估计;最后进一步挖掘目标位置与额外变量的非线性关系,再次构建矩阵方程并给出目标位置最终估计解。经过理论剖析与仿真验证,所提出的算法在可接受的测量误差和观测站点位置误差范围内,能够逼近克拉美罗下界(Cramer-Rao Lower Bound,CRLB)。
基金supported in part by National Natural Science Foundation of China (61101114, 61671324) the Program for New Century Excellent Talents in University (NCET-12-0401)
文摘Forward-backward algorithm, used by watermark decoder for correcting non-binary synchronization errors, requires to traverse a very large scale trellis in order to achieve the proper posterior probability, leading to high computational complexity. In order to reduce the number of the states involved in the computation, an adaptive pruning method for the trellis is proposed. In this scheme, we prune the states which have the low forward-backward quantities below a carefully-chosen threshold. Thus, a wandering trellis with much less states is achieved, which contains most of the states with quite high probability. Simulation results reveal that, with the proper scaling factor, significant complexity reduction in the forward-backward algorithm is achieved at the expense of slight performance degradation.
基金Project supported by the National Natural Science Foundation of China(Grant No.60972046)Grant from the National Defense Pre-Research Foundation of China
文摘For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently. Numerical simulations show that this modified method outperforms standard BP algorithm with an obvious performance improvement.
基金supported by Zhejiang Provincial Key Laboratory of Communication Networks and Applications and National Natural Science Foundation of China under Grant No.60872020
文摘In Mobile Ad-hoc Networks (MANETs), routing protocols directly affect various indices of network Quality of Service (QoS), so they play an important role in network performance. To address the drawbacks associated with traditional routing protocols in MANETs, such as poor anti-fading performance and slow convergence rate, for basic Dynamic Source Routing (DSR), we propose a new routing model based on Grover's searching algorithm. With this new routing model, each node maintains a node vector function, and all the nodes can obtain a node probability vector using Grover's algorithm, and then select an optimal routing according to node probability. Simulation results show that compared with DSR, this new routing protocol can effectively extend the network lifetime, as well as reduce the network delay and the number of routing hops. It can also significantly improve the anti-jamming capability of the network.
基金supported by the HXMT Projectthe National Natural Science Foundation of China(No.11603027)
文摘A smoothing algorithm for energy spectrum based on differential nonlinearity(DNL) error elimination with total counts conservation for high-energy particle detector systems is presented. It is physics based and is only determined by the DNL error of analog-to-digital converter device itself. From the experimental results, this algorithm slightly improves both noise performance and energy resolution, while greatly reduces the testing errors by almost a half compared to their original values. In addition, the reduced-x^2 statistic for evaluating the Gaussian fitting goodness is significantly reduced by almost two orders after smoothing. As a typical verification example,this algorithm is successfully applied in the ground calibration of the Low Energy X-ray Instrument onboard the Hard X-ray Modulation Telescope(HXMT-LE) satellite,lending it a powerful, nondestructive and low-cost tool for both calibration and data processing for high-energy particle detector systems.
基金Subsidized by the Special Funds for Major State Basic Research ProjectsG1999032801-07,NSFC(10101020,10001028)Tian Yuan Funds(TY10126004)
文摘Several kind of new numerical schemes for the stationary Navier-Stokes equations based on the virtue of Inertial Manifold and Approximate Inertial Manifold, which we call them inertial algorithms in this paper, together with their error estimations are presented. All these algorithms are constructed under an uniform frame, that is to construct some kind of new projections for the Sobolev space in which the true solution is sought. It is shown that the proposed inertial algorithms can greatly improve the convergence rate of the standard Galerkin approximate solution with lower computing effort. And some numerical examples are also given to verify results of this paper.
文摘In this paper, a posteriori error estimates for the generalized Schwartz method with Dirichlet boundary conditions on the interfaces for advection-diffusion equation with second order boundary value problems are proved by using the Euler time scheme combined with Galerkin spatial method. Furthermore, an asymptotic behavior in Sobolev norm is de- duced using Benssoussau-Lions＇ algorithm. Finally, the results of some numerical experiments are presented to support the theory.
