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.

Pseudo-random sequence generator based on the generalized Henon map

By analysis and comparison of several chaotic systems that are applied to generate pseudo-random sequence, the generalized Henon map is proposed as a pseudo-random sequence generator. A new algorithm is created to solve the problem of non-uniform distribution of the sequence generated by the generalized Henon map. First, move the decimal point of elements in the sequence to the fight; then, cut off the integer; and finally, quantify it into a binary sequence. Statistical test, security analysis, and the application of image encryption have strongly supported the good random statistical characteristics, high linear complexity, large key space, and great sensitivity of the binary sequence.

Chaotic block iterating method for pseudo-random sequence generator

A pseudo-random sequence generator is a basic tool for cryptography. To realize a pseudo-random sequence generator, a new block iterating method using shifter, multiplier, and adder operations has been introduced. By increasing the iteration of the counter and by performing calculations based on the initial value, an approximate pseudo-random sequence was obtained after exchanging bits. The algorithm and the complexity of the generator were introduced. The result obtained from the calculation shows that the self-correlation of the ＂m＂ block sequence is two-valued; the block field value is [0, 2^m - 1 ], and the block period is 2^m＋8 - 1.

Pseudo-Random Sequences Generator Based on Discrete Hyperchaotic Systems

We first design a discrete hyperchaotic system via piece-wise linear state feedback. The states of the closed loop system are locally expanding in two directions but absolutely bounded on the whole, which implies hyperchaos. Then, we use three suchlike hyperchaotic systems with different feedback gain matrices to design a pseudo-random sequence generator (PRSG). Through a threshold function, three sub-sequences generated from the output of piecewise linear functions are changed into 0-1 sequences. Then, followed by XOR operation, an unpredictable pseudo-random sequence (PRS) is ultimately obtained. The analysis and simulation results indicate that the PRS, generated with hyperchaotic systems, has desirable statistical features.

Adding Pseudo-Random Test Sequence Generator in the Test Simulator for DFT Approach

This paper presents modified version of a realistic test tool suitable to Design For Testability （DFT） and Built-ln Self Test （BIST） environments. A comprehensive tool is developed in the form of a test simulator. The simulator is capable of providing a required goal of test for the Circuit Under Test （CUT）. The simulator uses the approach of fault diagnostics with fault grading procedures to provide the optimum tests. The current version of the simulator embeds features of exhaustive and pseudo-random test generation schemes along with the search solutions of cost effective test goals. The simulator provides facilities of realizing all possible pseudo-random sequence generators with all possible combinations of seeds. The tool is developed on a common Personal Computer （PC） platform and hence no special software is required. Thereby, it is a low cost tool hence economical. The tool is very much suitable for determining realistic test sequences for a targeted goal of testing for any CUT. The developed tool incorporates flexible Graphical User Interface （GUI） procedures and can be operated without any special programming skill. The tool is debugged and tested with the results of many bench mark circuits. Further, this developed tool can be utilized for educational purposes for many courses such as fault-tolerant computing, fault diagnosis, digital electronics, and safe-reliable-testable digital logic designs.

Next Generation Sequencing in Oncological Diagnostics: Hype or Hope?

The understanding of how genetic and epigenetic factors influence tumorigenesis, progression and invasion, is vastly growing since new technologies allow the analysis of the functional genome namely the exome, the transcriptome and the epigenome, besides enabling genome-wide assessment of genetic variations. With the advent of new drugs that are indicated tissue agnostic, depending on certain mutations, there is a growing demand for fast and cost-effective genetic diagnosis. The method in focus that already became an indispensable tool in viral diagnosis is next-generation sequencing (NGS). This approach allows sequencing of literally every DNA molecule in the sample and can either be used to assess numerous genetic markers of one patient at a time, or to assess fewer markers of many patients in parallel, which reduces costs. We submitted 23 samples of different tumor entities to four diagnostic companies with different analysis profiles. The results as disclosed and discussed in this report indicate that so far, the main application of NGS is rather in cancer research than in diagnosis, as none of the reports had a real impact on the therapeutic scheme. We are perfectly aware that such a small cohort cannot be generalized, but considering the costs vs. benefits, NGS should be engaged upon a very stringent evaluation only. However, in cases where obtaining a tissue biopsy is impossible or unfavorable, analysis of liquid biopsy by NGS provides a vital alternative.

Digital chaotic sequence generator based on coupled chaotic systems

Chaotic systems perform well as a new rich source of cryptography and pseudo-random coding. Unfortunately their digital dynamical properties would degrade due to the finite computing precision. Proposed in this paper is a modified digital chaotic sequence generator based on chaotic logistic systems with a coupling structure where one chaotic subsystem generates perturbation signals to disturb the control parameter of the other one. The numerical simulations show that the length of chaotic orbits, the output distribution of chaotic system, and the security of chaotic sequences have been greatly improved. Moreover the chaotic sequence period can be extended at least by one order of magnitude longer than that of the uncoupled logistic system and the difficulty in decrypting increases 2^128＊2^128 times indicating that the dynamical degradation of digital chaos is effectively improved. A field programmable gate array （FPGA） implementation of an algorithm is given and the corresponding experiment shows that the output speed of the generated chaotic sequences can reach 571.4 Mbps indicating that the designed generator can he applied to the real-time video image encryption.

HIERACHICAL STRUCTURES FOR GENERATING PSEUDO-RANDOM SEQUENCES AND ARRAYS

This paper proposes new hierarchical structures for generating pseudorandom sequences and arrays. The principle of the structures is based on a new concept-multi-interleaving. It is the generalization of normal sequence decimation(sampling). The kernal of the structures is a lower speed linear feedback shift register together with several high speed time-division multiplexers arranged hierarchically. These new structures have much higher speed compared with that of other schemes proposed before.

A RANDOM SEQUENCE GENERATOR BASED ON CHAOTIC CIRCUITS

In this paper, a random sequence generator based on chaotic circuits is presented.Fundamental principle and experimental circuit have been carried out in case of Chua's circuit.The statistical results are in good agreement with probability characteristics of random sequence.

Design of Digital Hybrid Chaotic Sequence Generator

The feasibility of the hybrid chaotic sequences as the spreading codes in code divided multiple access(CDMA) system is analyzed. The design and realization of the digital hybrid chaotic sequence generator by very high speed integrated circuit hardware description language(VHDL) are described. A valid hazard canceledl method is presented. Computer simulations show that the stable digital sequence waveforms can be produced. The correlations of the digital hybrid chaotic sequences are compared with those of m-sequences. The results show that the correlations of the digital hybrid chaotic sequences are almost as good as those of m-sequences. The works in this paper explored a road for the practical applications of chaos.

Linear complexity of Ding generalized cyclotomic sequences

Minimal polynomials and linear complexity of binary Ding generalized cyclotomic sequences of order 2 with the two-prime residue ring Zpq are obtained by Bai in 2005. In this paper, we obtain linear complexity and minimal polynomials of all Ding generalized cyclotomic sequences. Our result shows that linear complexity of these sequences takes on the values pq and pq-1 on our necessary and sufficient condition with probability 1/4 and the lower bound （pq - 1）/2 with probability 1/8. This shows that most of these sequences are good. We also obtained that linear complexity and minimal polynomials of these sequences are independent of their orders. This makes it no more difficult in choosing proper p and q.

Linear complexity and autocorrelation of a new class of binary generalized cyclotomic sequences of order two and length pqr

Cyclotomic sequences have good cryptographic properties and are closely related to difference sets.This paper proposes a new class of binary generalized cyclotomic sequences of order two and length pqr.Its linear complexity,minimal polynomial,and autocorrelation are investigated.The results show that these sequences have a large linear complexity when 2∈D1,which means they can resist the Berlekamp-Massey attack.Furthermore,the autocorrelation values are close to 0 with a probability of approximately 1?1/r.Therefore,when r is a big prime,the new sequence has a good autocorrelation.

Cross-domain sequence labelling using language modelling and parameter generating

Sequence labelling(SL)tasks are currently widely studied in the field of natural language processing.Most sequence labelling methods are developed on a large amount of labelled training data via supervised learning,which is time-consuming and expensive.As an alternative,domain adaptation is proposed to train a deep-learning model for sequence labelling in a target domain by exploiting existing labelled training data in related source domains.To this end,the authors propose a Bi-LSTM model to extract more-related knowledge from multi-source domains and learn specific context from the target domain.Further,the language modelling training is also applied to cross-domain adaptability facilitating.The proposed model is extensively evaluated with the named entity recognition and part-of-speech tagging tasks.The empirical results demonstrate the effectiveness of the cross-domain adaption.Our model outperforms the state-of-the-art methods used in both cross-domain tasks and crowd annotation tasks.

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.

A general result on precise asymptotics for linear processes of positively associated sequences

Let {εt; t ∈ Z^＋} be a strictly stationary sequence of associated random variables with mean zeros, let 0〈Eε1^2〈∞ and σ^2=Eε1^2＋1∑j=2^∞ Eε1εj with 0〈σ^2〈∞.{aj;j∈Z^＋} is a sequence of real numbers satisfying ∑j=0^∞｜aj｜〈∞.Define a linear process Xt=∑j=0^∞ ajεt-j,t≥1,and Sn=∑t=1^n Xt,n≥1.Assume that E｜ε1｜^2＋δ′〈 for some δ′〉0 and μ（n）=O（n^-ρ） for some ρ〉0.This paper achieves a general law of precise asymptotics for {Sn}.

FINITE EXTENSIONS OF GENERALIZED BESSEL SEQUENCES TO GENERALIZED FRAMES

The objective of this paper is to investigate the question of modifying a givengeneralized Bessel sequence to yield a generalized frame or a tight generalized frame by finiteextension. Some necessary and sufficient conditions for the finite extensions of generalizedBessel sequences to generalized frames or tight generalized frames are provided, and everyresult is illustrated by the corresponding example.

Ordered Generalized Sequence Spaces and their Duals

The main result of this paper is the identification of the sequential order dual [∧(X)]so containing sequentially order continuous linear functionals on the ordered generalized sequence space ∧(X) with its generalized Kothe dual ∧x(Xso), defined corresponding to the dual pair <X, Xso>.

Linear Complexity of New Generalized Cyclotomic Sequences of Length 2pq

The linear complexity and minimal polynomial of new generalized cyclotomic sequences of order two are investigated.A new generalized cyclotomic sequence Sof length 2pqis defined with an imbalance p+1.The results show that this sequence has high linear complexity.

Generating functions for powers of second-order recurrence sequences

For the sequences satisfying the recurrence relation of the second order,the generating functions for the products of the powers of these sequences are established.This study was from Carlita and Riordan who began a study on closed form of generating functions for powers of second-order recurrence sequences.This investigation was completed by Stnica.Inspired by the recent work of Istva＇n about the non-closed generating functions of the products of the powers of the second-order sequences,the authors give several extensions of Istva＇n＇s results in this paper.

Autocorrelation of Sequences Generated by Single Cycle T-Functions

Cryptographic properties of the single cycle T-function's output sequences are investigated.Bounds of autocorrelation functions of the kth coordinate sequence and bounds of state output sequence are calculated respectively.The Maximum Sidelobe Ratio(MSR) of the kth coordinate sequence and the MSR of state output sequence are given respectively.The bounds of autocorrelation functions show that the values of autocorrelation functions are large when shifts are small.Comparisons of the autocorrelations between the state output sequence and coordinate output sequence are illustrated.The autocorrelation properties demonstrate that T-functions have cryptographic weaknesses and the illustration result shows coordinate output sequences have better autocorrelation than that of state output sequences.