Quantum computing offers unprecedented computational power, enabling simultaneous computations beyond traditional computers. Quantum computers differ significantly from classical computers, necessitating a distinct ap...Quantum computing offers unprecedented computational power, enabling simultaneous computations beyond traditional computers. Quantum computers differ significantly from classical computers, necessitating a distinct approach to algorithm design, which involves taming quantum mechanical phenomena. This paper extends the numbering of computable programs to be applied in the quantum computing context. Numbering computable programs is a theoretical computer science concept that assigns unique numbers to individual programs or algorithms. Common methods include Gödel numbering which encodes programs as strings of symbols or characters, often used in formal systems and mathematical logic. Based on the proposed numbering approach, this paper presents a mechanism to explore the set of possible quantum algorithms. The proposed approach is able to construct useful circuits such as Quantum Key Distribution BB84 protocol, which enables sender and receiver to establish a secure cryptographic key via a quantum channel. The proposed approach facilitates the process of exploring and constructing quantum algorithms.展开更多
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.展开更多
Based on the data of daily precipitation in Lianyungang area from 1951 to 2012 and various climate signal data from the National Climate Center website and the NOAA website,a model for predicting whether the number of...Based on the data of daily precipitation in Lianyungang area from 1951 to 2012 and various climate signal data from the National Climate Center website and the NOAA website,a model for predicting whether the number of rainstorm days in summer in Lianyungang area is large was established by the classical C5. 0 decision tree algorithm. The data samples in 48 years( accounting for about 80% of total number of samples)was as the training set of a model,and the training accuracy rate of the model was 95. 83%. The data samples in the remaining 14 years( accounting for about 20% of total number of samples) were used as the test set of the model to test the model,and the test accuracy of the model was 85. 71%. The results showed that the prediction model of number of rainstorm days in summer constructed by C5. 0 algorithm had high accuracy and was easy to explain. Moreover,it is convenient for meteorological staff to use directly. At the same time,this study provides a new idea for short-term climate prediction of number of rainstorm days in summer.展开更多
A pseudo-random coding side-lobe suppression method based on CLEAN algorithm is introduced.The CLEAN algorithm mainly processes pulse compression results of a pseudo-random coding,and estimates a target＇s distance by...A pseudo-random coding side-lobe suppression method based on CLEAN algorithm is introduced.The CLEAN algorithm mainly processes pulse compression results of a pseudo-random coding,and estimates a target＇s distance by a method named interpolation method,so that we can get an ideal pulse compression result of the target,and then use the adjusted ideal pulse compression side-lobe to cut the actual pulse compression result,so as to achieve the remarkable performance of side-lobe suppression for large targets,and let the adjacent small targets appear.The computer simulations by MATLAB with this method analyze the effect of side-lobe suppression in an ideal or noisy environment.It is proved that this method can effectively solve the problem due to the side-lobe of pseudo-random coding being too high,and can enhance the radar＇s multi-target detection ability.展开更多
In the quantum Monte Carlo(QMC)method,the pseudo-random number generator(PRNG)plays a crucial role in determining the computation time.However,the hidden structure of the PRNG may lead to serious issues such as the br...In the quantum Monte Carlo(QMC)method,the pseudo-random number generator(PRNG)plays a crucial role in determining the computation time.However,the hidden structure of the PRNG may lead to serious issues such as the breakdown of the Markov process.Here,we systematically analyze the performance of different PRNGs on the widely used QMC method known as the stochastic series expansion(SSE)algorithm.To quantitatively compare them,we introduce a quantity called QMC efficiency that can effectively reflect the efficiency of the algorithms.After testing several representative observables of the Heisenberg model in one and two dimensions,we recommend the linear congruential generator as the best choice of PRNG.Our work not only helps improve the performance of the SSE method but also sheds light on the other Markov-chain-based numerical algorithms.展开更多
Random numbers generated by pseudo-random and true random number generators (TRNG) are used in a wide variety of important applications. A TRNG relies on a non-deterministic source to sample random numbers. In this pa...Random numbers generated by pseudo-random and true random number generators (TRNG) are used in a wide variety of important applications. A TRNG relies on a non-deterministic source to sample random numbers. In this paper, we improve the post-processing stage of TRNGs using a heuristic evolutionary algorithm. Our post-processing algorithm decomposes the problem of improving the quality of random numbers into two phases: (i) Exact Histogram Equalization: it modifies the random numbers distribution with a specified output distribution;(ii) Stationarity Enforcement: using genetic algorithms, the output of (ii) is permuted until the random numbers meet wide-sense stationarity. We ensure that the quality of the numbers generated from the genetic algorithm is within a specified level of error defined by the user. We parallelize the genetic algorithm for improved performance. The post-processing is based on the power spectral density of the generated numbers used as a metric. We propose guideline parameters for the evolutionary algorithm to ensure fast convergence, within the first 100 generations, with a standard deviation over the specified quality level of less than 0.45. We also include a TestU01 evaluation over the random numbers generated.展开更多
Static Random Access Memory(SRAM) based Field Programmable Gate Array(FPGA) is widely applied in the field of aerospace, whose anti-SEU(Single Event Upset) capability becomes more and more important. To improve anti-F...Static Random Access Memory(SRAM) based Field Programmable Gate Array(FPGA) is widely applied in the field of aerospace, whose anti-SEU(Single Event Upset) capability becomes more and more important. To improve anti-FPGA SEU capability, the registers of the circuit netlist are tripled and divided into three categories in this study. By the packing algorithm, the registers of triple modular redundancy are loaded into different configurable logic block. At the same time, the packing algorithm considers the effect of large fan-out nets. The experimental results show that the algorithm successfully realize the packing of the register of Triple Modular Redundancy(TMR). Comparing with Timing Versatile PACKing(TVPACK), the algorithm in this study is able to obtain a 11% reduction of the number of the nets in critical path, and a 12% reduction of the time delay in critical path on average when TMR is not considered. Especially, some critical path delay of circuit can be improved about 33%.展开更多
We apply the recent important result of serial sorting of n real numbers in time to the design of a parallel algorithm for sorting real numbers in time and operations. This is the first NC algorithm known to take oper...We apply the recent important result of serial sorting of n real numbers in time to the design of a parallel algorithm for sorting real numbers in time and operations. This is the first NC algorithm known to take operations for sorting real numbers.展开更多
Transmission of data over the internet has become a critical issue as a result of the advancement in technology, since it is possible for pirates to steal the intellectual property of content owners. This paper presen...Transmission of data over the internet has become a critical issue as a result of the advancement in technology, since it is possible for pirates to steal the intellectual property of content owners. This paper presents a new digital watermarking scheme that combines some operators of the Genetic Algorithm (GA) and the Residue Number (RN) System (RNS) to perform encryption on an image, which is embedded into a cover image for the purposes of watermarking. Thus, an image watermarking scheme uses an encrypted image. The secret image is embedded in decomposed frames of the cover image achieved by applying a three-level Discrete Wavelet Transform (DWT). This is to ensure that the secret information is not exposed even when there is a successful attack on the cover information. Content creators can prove ownership of the multimedia content by unveiling the secret information in a court of law. The proposed scheme was tested with sample data using MATLAB2022 and the results of the simulation show a great deal of imperceptibility and robustness as compared to similar existing schemes.展开更多
椭圆曲线数字签名算法(elliptic curve digital signature algorithm,ECDSA)是应用最广的数字签名算法之一,在签名过程中需要计算椭圆曲线上的标量乘法,该操作通常是签名中最耗时的部分.在目前许多密码库的实现中都使用非相邻窗口形式...椭圆曲线数字签名算法(elliptic curve digital signature algorithm,ECDSA)是应用最广的数字签名算法之一,在签名过程中需要计算椭圆曲线上的标量乘法,该操作通常是签名中最耗时的部分.在目前许多密码库的实现中都使用非相邻窗口形式表示临时密钥,从而减少标量乘法的计算时间,但是也使得攻击者能够通过侧信道攻击获取临时密钥的部分信息,恢复签名密钥.使用扩展隐藏数问题提取侧信道轨迹中的信息,并通过格攻击恢复密钥,是针对ECDSA的主流攻击框架之一.基于此,提出了3方面的优化方法:1)邻域动态约束合并策略.通过动态的合并参数可以降低格的维数,并控制攻击过程中已知信息的损失量,使得对于任意的签名均能够以很高成功率恢复密钥.2)对于格中嵌入数进行分析与优化,使得目标向量的欧几里得范数减少约8%,有效提高了攻击的成功率并减少了时间开销.3)提出了一种线性断言方法,能够显著降低格筛法的时间开销.在使用2个签名的情况下以0.99的成功率恢复签名密钥.展开更多
By analyzing the characteristics of low Mach number perfect gas flows, a novel Slightly Compressible Model (SCM) for low Mach number perect gas flows is derived. In view of numerical calculations, this model is proved...By analyzing the characteristics of low Mach number perfect gas flows, a novel Slightly Compressible Model (SCM) for low Mach number perect gas flows is derived. In view of numerical calculations, this model is proved very efficient, for it is kept within thep-v frame but does not have to satisfy the time consuming divergence-free condition in order to get the incompressible Navier-Stokes equation solution. Writing the equations in the form of conservation laws, we have derived the characteristic systems which are necessary for numerical calculations. A cell-centered finite-volume method with flux difference upwind-biased schemes is used for the equation solutions and a new Exact Newton Relaxation (ENR) implicit method is developed. Various computed results are presented to validate the present model. Laminar flow solutions over a circular cylinder with wake developing and vortex shedding are presented. Results for inviscid flow over a sphere are compared in excellent agreement with the exact analytic incompressible solution. Three-dimensional viscous flow solutions over sphere and prolate spheroid are also calculated and compared well with experiments and other incompressible solutions. Finally, good convergent performances are shown for sphere viscous flows.展开更多
The generation of good pseudo-random numbers is the base of many important fields in scientific computing, such as randomized algorithms and numerical solution of stochastic differential equations. In this paper, a cl...The generation of good pseudo-random numbers is the base of many important fields in scientific computing, such as randomized algorithms and numerical solution of stochastic differential equations. In this paper, a class of random number generators （RNGs） based on Weyl sequence is proposed. The uniformity of those RNGs is proved theoretically. Statistical and numerical computations show the efficiency of the methods.展开更多
文摘Quantum computing offers unprecedented computational power, enabling simultaneous computations beyond traditional computers. Quantum computers differ significantly from classical computers, necessitating a distinct approach to algorithm design, which involves taming quantum mechanical phenomena. This paper extends the numbering of computable programs to be applied in the quantum computing context. Numbering computable programs is a theoretical computer science concept that assigns unique numbers to individual programs or algorithms. Common methods include Gödel numbering which encodes programs as strings of symbols or characters, often used in formal systems and mathematical logic. Based on the proposed numbering approach, this paper presents a mechanism to explore the set of possible quantum algorithms. The proposed approach is able to construct useful circuits such as Quantum Key Distribution BB84 protocol, which enables sender and receiver to establish a secure cryptographic key via a quantum channel. The proposed approach facilitates the process of exploring and constructing quantum algorithms.
基金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.
基金Support by Meteorological Open Research Foundation for the Huaihe River Basin(HRM201602)Foundation for Young Scholars of Jiangsu Meteorological Bureau(Q201708,KQ201802)+2 种基金Science and Technology Innovation Team Foundation for Marine Meteorological Forecast Technology of Lianyungang Meteorological BureauKey Technology R&D Program Project of Lianyungang City(SH1634)Special Project for Forecasters of Jiangsu Meteorological Bureau(JSYBY201811,JSYBY201812,JSYBY201810)
文摘Based on the data of daily precipitation in Lianyungang area from 1951 to 2012 and various climate signal data from the National Climate Center website and the NOAA website,a model for predicting whether the number of rainstorm days in summer in Lianyungang area is large was established by the classical C5. 0 decision tree algorithm. The data samples in 48 years( accounting for about 80% of total number of samples)was as the training set of a model,and the training accuracy rate of the model was 95. 83%. The data samples in the remaining 14 years( accounting for about 20% of total number of samples) were used as the test set of the model to test the model,and the test accuracy of the model was 85. 71%. The results showed that the prediction model of number of rainstorm days in summer constructed by C5. 0 algorithm had high accuracy and was easy to explain. Moreover,it is convenient for meteorological staff to use directly. At the same time,this study provides a new idea for short-term climate prediction of number of rainstorm days in summer.
文摘A pseudo-random coding side-lobe suppression method based on CLEAN algorithm is introduced.The CLEAN algorithm mainly processes pulse compression results of a pseudo-random coding,and estimates a target＇s distance by a method named interpolation method,so that we can get an ideal pulse compression result of the target,and then use the adjusted ideal pulse compression side-lobe to cut the actual pulse compression result,so as to achieve the remarkable performance of side-lobe suppression for large targets,and let the adjacent small targets appear.The computer simulations by MATLAB with this method analyze the effect of side-lobe suppression in an ideal or noisy environment.It is proved that this method can effectively solve the problem due to the side-lobe of pseudo-random coding being too high,and can enhance the radar＇s multi-target detection ability.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.12274046,11874094,and 12147102)Chongqing Natural Science Foundation(Grant No.CSTB2022NSCQ-JQX0018)Fundamental Research Funds for the Central Universities(Grant No.2021CDJZYJH-003).
文摘In the quantum Monte Carlo(QMC)method,the pseudo-random number generator(PRNG)plays a crucial role in determining the computation time.However,the hidden structure of the PRNG may lead to serious issues such as the breakdown of the Markov process.Here,we systematically analyze the performance of different PRNGs on the widely used QMC method known as the stochastic series expansion(SSE)algorithm.To quantitatively compare them,we introduce a quantity called QMC efficiency that can effectively reflect the efficiency of the algorithms.After testing several representative observables of the Heisenberg model in one and two dimensions,we recommend the linear congruential generator as the best choice of PRNG.Our work not only helps improve the performance of the SSE method but also sheds light on the other Markov-chain-based numerical algorithms.
文摘Random numbers generated by pseudo-random and true random number generators (TRNG) are used in a wide variety of important applications. A TRNG relies on a non-deterministic source to sample random numbers. In this paper, we improve the post-processing stage of TRNGs using a heuristic evolutionary algorithm. Our post-processing algorithm decomposes the problem of improving the quality of random numbers into two phases: (i) Exact Histogram Equalization: it modifies the random numbers distribution with a specified output distribution;(ii) Stationarity Enforcement: using genetic algorithms, the output of (ii) is permuted until the random numbers meet wide-sense stationarity. We ensure that the quality of the numbers generated from the genetic algorithm is within a specified level of error defined by the user. We parallelize the genetic algorithm for improved performance. The post-processing is based on the power spectral density of the generated numbers used as a metric. We propose guideline parameters for the evolutionary algorithm to ensure fast convergence, within the first 100 generations, with a standard deviation over the specified quality level of less than 0.45. We also include a TestU01 evaluation over the random numbers generated.
基金Supported by the National Natural Science Foundation of China(No.61106033)
文摘Static Random Access Memory(SRAM) based Field Programmable Gate Array(FPGA) is widely applied in the field of aerospace, whose anti-SEU(Single Event Upset) capability becomes more and more important. To improve anti-FPGA SEU capability, the registers of the circuit netlist are tripled and divided into three categories in this study. By the packing algorithm, the registers of triple modular redundancy are loaded into different configurable logic block. At the same time, the packing algorithm considers the effect of large fan-out nets. The experimental results show that the algorithm successfully realize the packing of the register of Triple Modular Redundancy(TMR). Comparing with Timing Versatile PACKing(TVPACK), the algorithm in this study is able to obtain a 11% reduction of the number of the nets in critical path, and a 12% reduction of the time delay in critical path on average when TMR is not considered. Especially, some critical path delay of circuit can be improved about 33%.
文摘We apply the recent important result of serial sorting of n real numbers in time to the design of a parallel algorithm for sorting real numbers in time and operations. This is the first NC algorithm known to take operations for sorting real numbers.
文摘Transmission of data over the internet has become a critical issue as a result of the advancement in technology, since it is possible for pirates to steal the intellectual property of content owners. This paper presents a new digital watermarking scheme that combines some operators of the Genetic Algorithm (GA) and the Residue Number (RN) System (RNS) to perform encryption on an image, which is embedded into a cover image for the purposes of watermarking. Thus, an image watermarking scheme uses an encrypted image. The secret image is embedded in decomposed frames of the cover image achieved by applying a three-level Discrete Wavelet Transform (DWT). This is to ensure that the secret information is not exposed even when there is a successful attack on the cover information. Content creators can prove ownership of the multimedia content by unveiling the secret information in a court of law. The proposed scheme was tested with sample data using MATLAB2022 and the results of the simulation show a great deal of imperceptibility and robustness as compared to similar existing schemes.
文摘椭圆曲线数字签名算法(elliptic curve digital signature algorithm,ECDSA)是应用最广的数字签名算法之一,在签名过程中需要计算椭圆曲线上的标量乘法,该操作通常是签名中最耗时的部分.在目前许多密码库的实现中都使用非相邻窗口形式表示临时密钥,从而减少标量乘法的计算时间,但是也使得攻击者能够通过侧信道攻击获取临时密钥的部分信息,恢复签名密钥.使用扩展隐藏数问题提取侧信道轨迹中的信息,并通过格攻击恢复密钥,是针对ECDSA的主流攻击框架之一.基于此,提出了3方面的优化方法:1)邻域动态约束合并策略.通过动态的合并参数可以降低格的维数,并控制攻击过程中已知信息的损失量,使得对于任意的签名均能够以很高成功率恢复密钥.2)对于格中嵌入数进行分析与优化,使得目标向量的欧几里得范数减少约8%,有效提高了攻击的成功率并减少了时间开销.3)提出了一种线性断言方法,能够显著降低格筛法的时间开销.在使用2个签名的情况下以0.99的成功率恢复签名密钥.
基金The project supported by the Basic Research on Frontier Problems in Fluid and Aerodynamics in Chinathe National Natural Science Foundation of China (19772069)
文摘By analyzing the characteristics of low Mach number perfect gas flows, a novel Slightly Compressible Model (SCM) for low Mach number perect gas flows is derived. In view of numerical calculations, this model is proved very efficient, for it is kept within thep-v frame but does not have to satisfy the time consuming divergence-free condition in order to get the incompressible Navier-Stokes equation solution. Writing the equations in the form of conservation laws, we have derived the characteristic systems which are necessary for numerical calculations. A cell-centered finite-volume method with flux difference upwind-biased schemes is used for the equation solutions and a new Exact Newton Relaxation (ENR) implicit method is developed. Various computed results are presented to validate the present model. Laminar flow solutions over a circular cylinder with wake developing and vortex shedding are presented. Results for inviscid flow over a sphere are compared in excellent agreement with the exact analytic incompressible solution. Three-dimensional viscous flow solutions over sphere and prolate spheroid are also calculated and compared well with experiments and other incompressible solutions. Finally, good convergent performances are shown for sphere viscous flows.
基金Supported by National Natural Science Foundation of China （19871047）and National Key Basic Research Special Fund（1998020306）.
文摘The generation of good pseudo-random numbers is the base of many important fields in scientific computing, such as randomized algorithms and numerical solution of stochastic differential equations. In this paper, a class of random number generators （RNGs） based on Weyl sequence is proposed. The uniformity of those RNGs is proved theoretically. Statistical and numerical computations show the efficiency of the methods.
