关于渐近随机的GFSR序列的设计

Ｔｏｏｔｉｌｌ等人提出了一种渐近的随机Ｔａｕｓｗｏｒｔｈｅ序列,并给出了一个偶然发现的此种序列,但直到现在尚未有人提出一个寻求此种序列的系统性的方法,本文中我们将给出一种设计ＧＦＳＲ序 算法,所产生的序列近似地满足渐近随机性,我们的算法基于反复地运用由Ｆｕｓｈｉｍｉ提出的算法,由现在的算法所设计出来的序列不有一种附加的好处,即其十中抽一的序列也是近似地渐近随机的,文中给出了一些数字例子。     

激光引信探测技术研究

分析了激光引信探测技术发展状况及工作原理。针对目前在研的激光引信探测的关键问题,即激光引信的前倾探测和伪随机码探测技术进行了分析。得出两个结论:激光引信对目标的45°前倾探测获得了一定的探测提前量,更有利于识别目标,也可以获得最佳起爆参数;伪随机码体制激光引信探测技术在保密性和抗有源干扰性能等方面比普通脉冲体制激光引信都有本质的提高。     

Comparison of a quantum random number generator with pseudorandom number generators for their use in molecular Monte Carlo simulations

Four pseudorandom number generators were compared with a physical, quantum‐based random number generator using the NIST suite of statistical tests, which only the quantum‐based random number generator could successfully pass. We then measured the effect of the five random number generators on various calculated properties in different Markov‐chain Monte Carlo simulations. Two types of systems were tested: conformational sampling of a small molecule in aqueous solution and liquid methanol under constant temperature and pressure. The results show that poor quality pseudorandom number generators produce results that deviate significantly from those obtained with the quantum‐based random number generator, particularly in the case of the small molecule in aqueous solution setup. In contrast, the widely used Mersenne Twister pseudorandom generator and a 64‐bit Linear Congruential Generator with a scrambler produce results that are statistically indistinguishable from those obtained with the quantum‐based random number generator. © 2017 Wiley Periodicals, Inc.     

Conjugate Image Plane Correlator with Holographic Disk Memory

A conjugate image plane correlator with holographic disk memory is proposed. Optical correlation between conjugate images reconstructed from a holographic disk and an input image on liquid-crystal television is executed with the rotation of the disk. Regardless of Fourier hologram recording with the pseudorandom diffuser, it is found possible to take out the diffuser from the original hologram recording scheme using an image reconstruction process and to get correlation signals between input and reconstructed conjugate images in the output plane of a two-lens imaging system. Generation of conjugate replicas with high contrast causes exact matching with an input image which results in high recognition performance for autocorrelation signals. The transfer function of an optical system can be controlled by adjustment of either hologram size or hologram area illuminated with a laser beam. Hence, the output intensity distribution can be adjusted by selecting a proper pupil function and the size of an output pupil defined by the input pupil size and the optical system magnification factor. The real-time character recognition by optical parallel high-speed processing for two dimensional images with position normalization is demonstrated.     

一种确定混沌伪随机序列复杂度的模糊关系熵测度

将模糊关系的概念引入混沌伪随机序列复杂度的测度方法之中,提出了一种新的混沌伪随机序列复杂度测度方法——模糊关系熵(fuzzy relationship entropy,简记为F-REn)测度方法,并推导了F-REn的两个基本性质.仿真结果表明,该测度方法能够有效测度混沌伪随机序列的复杂度,与近似熵(ApEn)测度方法和符号熵测度方法相比,F-REn测度具有更加好的对序列符号空间的适用性、更加小的对测量维度的敏感性和更加强的对分辨率参数的鲁棒性. 关键词： 混沌伪随机序列 模糊理论 复杂度     

On the Average Distribution of Inversive Pseudorandom Numbers

The inversive congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. The authors have recently introduced a new method for obtaining nontrivial upper bounds on the multidimensional discrepancy of inversive congruential pseudorandom numbers in parts of the period. This method has also been used to study the multidimensional distribution of several other similar families of pseudorandom numbers. Here we apply this method to show that, “on average” over all initial values, much stronger results than those known for “individual” sequences can be obtained.     

On pseudorandom properties of multiplicative functions

In an earlier paper [3] Cassaigne et al studied the pseudorandom properties of the Liouville function. In this paper some of their results are generalized and sharpened considerably. This revised version was published online in June 2006 with corrections to the Cover Date.     

Uses and abuses of statistical simulation

More and more problems are being tackled by simulation as large computing costs per hour approach those of mathematicians' time. Abuses of simulation arise from ignorance or careless use of little understood procedures, and some of the fundamental tools of the subject are much less well understood than commonly supposed. This is illustrated here by the saga of pseudorandom number generators, normal variate generators and the analysis of queueing system simulations. On the positive side, genuinely new uses of simulation are appearing, particularly in statistical inference. These are exemplified by recursive algorithms for simulating complex systems and simulation-based likelihood inference for point processes.     

On a family of pseudorandom binary sequences

Recently, numerous constructions have been given for finite pseudorandom binary sequences. However, in many applications, e.g., in cryptography one needs large families of good pseudorandom sequences. Very Recently L.~Goubin, C.~Mauduit, A.~Sárkzy succeeded in constructing large families of pseudorandom binary sequences based on the Legendre symbol. In this paper we will generate another type of large family of pseudorandom sequences by using the notion of index (discrete logarithm).