Analysis of pseudo-random number generators in QMC-SSE method

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.

Arithmetic Operations of Generalized Trapezoidal Picture Fuzzy Numbers by Vertex Method

In this article, we define the arithmetic operations of generalized trapezoidal picture fuzzy numbers by vertex method which is assembled on a combination of the (α, γ, β)-cut concept and standard interval analysis. Various related properties are explored. Finally, some computations of picture fuzzy functions over generalized picture fuzzy variables are illustrated by using our proposed technique.

Bounds on the absorbant number of generalized Kautz digraphs

The generalized Kautz digraphs have many good properties as interconnection network topologies. In this note, the bounds of the absorbant number for the generalized Kautz digraph are given, and some sufficient conditions for the absorbant number of the generalized Kautz digraph attaining the bounds are presented.

Extensions of An Approach to Generalized Fibonacci and Lucas Numbers with Binomial Coefficients

The purpose of this paper is to give the extensions of some identities involving generalized Fibonacci and Lucas numbers with binomial coefficients.These results generalize the identities by Gulec,Taskara and Uslu in Appl.Math.Lett.23(2010)68-72 and Appl.Math.Comput.220(2013)482-486.

Defogging computational ghost imaging via eliminating photon number fluctuation and a cycle generative adversarial network

Imaging through fluctuating scattering media such as fog is of challenge since it seriously degrades the image quality.We investigate how the image quality of computational ghost imaging is reduced by fluctuating fog and how to obtain a high-quality defogging ghost image. We show theoretically and experimentally that the photon number fluctuations introduced by fluctuating fog is the reason for ghost image degradation. An algorithm is proposed to process the signals collected by the computational ghost imaging device to eliminate photon number fluctuations of different measurement events. Thus, a high-quality defogging ghost image is reconstructed even though fog is evenly distributed on the optical path. A nearly 100% defogging ghost image is obtained by further using a cycle generative adversarial network to process the reconstructed defogging image.

Elliptic Curve Point Multiplication by Generalized Mersenne Numbers

Montgomery modular multiplication in the residue number system （RNS） can be applied for elliptic curve cryptography. In this work, unified modular multipliers over generalized Mersenne numbers are proposed for RNS Montgomery modular multiplication, which enables efficient elliptic curve point multiplication （ECPM）. Meanwhile, the elliptic curve arithmetic with ECPM is performed by mixed coordinates and adjusted for hardware implementation. In addition, the conversion between RNS and the binary number system is also discussed. Compared with the results in the literature, our hardware architecture for ECPM demonstrates high performance. A 256-bit ECPM in Xilinx XC2VP100 field programmable gate array device （FPGA） can be performed in 1.44 ms, costing 22147 slices, 45 dedicated multipliers, and 8.25K bits of random access memories （RAMs）.

Generalized Harmonic Numbers Hn,k,r (α,β) with Combinatorial Sequences

In this paper, we observe the generalized Harmonic numbers Hn,k,r (α,β). Using generating function, we investigate some new identities involving generalized Harmonic numbers Hn,k,r (α,β) with Changhee sequences, Daehee sequences, Degenerate Changhee-Genoocchi sequences, Two kinds of degenerate Stirling numbers. Using Riordan arrays, we explore interesting relations between these polynomials, Apostol Bernoulli sequences, Apostol Euler sequences, Apostol Genoocchi sequences.

Generalized Central Factorial Numbers with Odd Arguments

In this paper, we consider r-generalization of the central factorial numbers with odd arguments of the first and second kind. Mainly, we obtain various identities and properties related to these numbers. Matrix representation and the relation between these numbers and Pascal matrix are given. Furthermore, the distributions of the signless r-central factorial numbers are derived. In addition, connections between these numbers and the Legendre-Stirling numbers are given.

The Generalized <i>r</i>-Whitney Numbers

In this paper, we define the generalized r-Whitney numbers of the first and second kind. Moreover, we drive the generalized Whitney numbers of the first and second kind. The recurrence relations and the generating functions of these numbers are derived. The relations between these numbers and generalized Stirling numbers of the first and second kind are deduced. Furthermore, some special cases are given. Finally, matrix representation of the relations between Whitney and Stirling numbers is given.

COMPONENTWISE CONDITION NUMBERS FOR GENERALIZED MATRIX INVERSION AND LINEAR LEAST SQUARES

We present componentwise condition numbers for the problems of MoorePenrose generalized matrix inversion and linear least squares. Also, the condition numbers for these condition numbers are given.

Products of Odd Numbers or Prime Number Can Generate the Three Members’ Families of Fermat Last Theorem and the Theorem Is Valid for Summation of Squares of More Than Two Natural Numbers

Fermat’s last theorem, had the statement that there are no natural numbers A, B, and C such that An + Bn = Cn, in which n is a natural number greater than 2. We have shown that any product of two odd numbers can generate Fermat or Pythagoras triple (A, B, C) following n = 2 and also it is applicable A2 + B2 + C2 + D2 + so on =An2 where all are natural numbers.

Total Domination number of Generalized Petersen Graphs

Generalized Petersen graphs are an important class of commonly used interconnection networks and have been studied . The total domination number of generalized Petersen graphs P(m,2) is obtained in this paper.

Operator Formulas Involving Generalized Stirling Number Derived by Virtue of Normal Ordering of Vacuum Projector

By virtue of the normal ordering of vacuum projector we directly derive some new complicated operatoridentities, regarding to the generalized Stirling number.

Generalizations of Some Formulas of the Reciprocal Sum and Alternating Sum for Generalized Lucas Numbers

The purpose of this article is to provide the inversion relationships between the reciprocal sum S（1, 2,…, m） and the alternating sum T（1, 2,…, m） for generalized Lucas numbers which generalizes the Melham＇s results.

A Robust Low Power Chaos-Based Truly Random Number Generator

This paper presents a low power,truly random number generator （TRNG） based on a simple chaotic map of the Bernoulli shift,which is extended to remain robustness in implementation. The map is realized by switched-current techniques that can fully integrate it in a cryptosystem on a chip. A pipelined architecture post-processed by a simple XOR circuit is used to improve the entropy. The TRNG is fabricated in an HJTC 0.18μm CMOS mixed signal process,and the statistical properties are investigated by measurement results. The power consumption is only 1.42mW and the truly random output bit rate is 10Mbit/s.

A Hybrid Random Number Generator Using Single Electron Tunneling Junctions and MOS Transistors

This paper proposes a novel single electron random number generator （RNG）. The generator consists of multiple tunneling junctions （MTJ） and a hybrid single electron transistor （SET）/MOS output circuit. It is an oscillator-based RNG. MTJ is used to implement a high-frequency oscillator, which uses the inherent physical randomness in tunneling events of the MTJ to achieve large frequency drift. The hybrid SET and MOS output circuit is used to amplify and buffer the output signal of the MTJ oscillator. The RNG circuit generates high-quality random digital sequences with a simple structure. The operation speed of this circuit is as high as 1GHz. The circuit also has good driven capability and low power dissipation. This novel random number generator is a promising device for future cryptographic systems and communication applications.

一些包含广义高阶Fibonacci-Lucas数的恒等式

本文建立了一些包含广艾高阶Fibonacci—Lucas数的恒等式.

Generalizations of Euler Numbers and Euler Numbers of Higher Order

The purpose of this paper is to define the generalized Euler numbers and the generalized Euler numbers of higher order, their recursion formula and some properties were established, accordingly Euler numbers and Euler numbers of higher order were extended.

Post-processing Free Quantum Random Number Generator Based on Avalanche Photodiode Array

Quantum random number generators adopting single negligible dead time of avalanche photodiodes （APDs） photon detection have been restricted due to the non- We propose a new approach based on an APD array to improve the generation rate of random numbers significantly. This method compares the detectors＇ responses to consecutive optical pulses and generates the random sequence. We implement a demonstration experiment to show its simplicity, compactness and scalability. The generated numbers are proved to be unbiased, post-processing free, ready to use, and their randomness is verified by using the national institute of standard technology statistical test suite. The random bit generation efficiency is as high as 32.8% and the potential generation rate adopting the 32× 32 APD array is up to tens of Gbits/s.

GENERALIZED WEAK FUNCTIONS

In this paper the authors introduce some new ideas on generalized numbers and generalized weak functions. They prove that the product of any two weak functions is a generalized weak function. So in particular they solve the problem of the multiplication of two generalized functions.