WorldWideScience

Sample records for pseudorandom generators prgs

  1. A primer on pseudorandom generators

    CERN Document Server

    Goldreich, Oded

    2010-01-01

    A fresh look at the question of randomness was taken in the theory of computing: A distribution is pseudorandom if it cannot be distinguished from the uniform distribution by any efficient procedure. This paradigm, originally associating efficient procedures with polynomial-time algorithms, has been applied with respect to a variety of natural classes of distinguishing procedures. The resulting theory of pseudorandomness is relevant to science at large and is closely related to central areas of computer science, such as algorithmic design, complexity theory, and cryptography. This primer surveys the theory of pseudorandomness, starting with the general paradigm, and discussing various incarnations while emphasizing the case of general-purpose pseudorandom generators (withstanding any polynomial-time distinguisher). Additional topics include the "derandomization" of arbitrary probabilistic polynomial-time algorithms, pseudorandom generators withstanding space-bounded distinguishers, and several natural notions...

  2. a Pseudo-Random Number Generator Employing Multiple RÉNYI Maps

    Science.gov (United States)

    Lui, Oi-Yan; Yuen, Ching-Hung; Wong, Kwok-Wo

    2013-11-01

    The increasing risk along with the drastic development of multimedia data transmission has raised a big concern on data security. A good pseudo-random number generator is an essential tool in cryptography. In this paper, we propose a novel pseudo-random number generator based on the controlled combination of the outputs of several digitized chaotic Rényi maps. The generated pseudo-random sequences have passed both the NIST 800-22 Revision 1a and the DIEHARD tests. Moreover, simulation results show that the proposed pseudo-random number generator requires less operation time than existing generators and is highly sensitive to the seed.

  3. Pseudo-Random Number Generators

    Science.gov (United States)

    Howell, L. W.; Rheinfurth, M. H.

    1984-01-01

    Package features comprehensive selection of probabilistic distributions. Monte Carlo simulations resorted to whenever systems studied not amenable to deterministic analyses or when direct experimentation not feasible. Random numbers having certain specified distribution characteristic integral part of simulations. Package consists of collector of "pseudorandom" number generators for use in Monte Carlo simulations.

  4. Chaos-based Pseudo-random Number Generation

    KAUST Repository

    Barakat, Mohamed L.

    2014-04-10

    Various methods and systems related to chaos-based pseudo-random number generation are presented. In one example, among others, a system includes a pseudo-random number generator (PRNG) to generate a series of digital outputs and a nonlinear post processing circuit to perform an exclusive OR (XOR) operation on a first portion of a current digital output of the PRNG and a permutated version of a corresponding first portion of a previous post processed output to generate a corresponding first portion of a current post processed output. In another example, a method includes receiving at least a first portion of a current output from a PRNG and performing an XOR operation on the first portion of the current PRNG output with a permutated version of a corresponding first portion of a previous post processed output to generate a corresponding first portion of a current post processed output.

  5. Chaos-based Pseudo-random Number Generation

    KAUST Repository

    Barakat, Mohamed L.; Mansingka, Abhinav S.; Radwan, Ahmed Gomaa Ahmed; Salama, Khaled N.

    2014-01-01

    Various methods and systems related to chaos-based pseudo-random number generation are presented. In one example, among others, a system includes a pseudo-random number generator (PRNG) to generate a series of digital outputs and a nonlinear post processing circuit to perform an exclusive OR (XOR) operation on a first portion of a current digital output of the PRNG and a permutated version of a corresponding first portion of a previous post processed output to generate a corresponding first portion of a current post processed output. In another example, a method includes receiving at least a first portion of a current output from a PRNG and performing an XOR operation on the first portion of the current PRNG output with a permutated version of a corresponding first portion of a previous post processed output to generate a corresponding first portion of a current post processed output.

  6. Pseudo-random bit generator based on lag time series

    Science.gov (United States)

    García-Martínez, M.; Campos-Cantón, E.

    2014-12-01

    In this paper, we present a pseudo-random bit generator (PRBG) based on two lag time series of the logistic map using positive and negative values in the bifurcation parameter. In order to hidden the map used to build the pseudo-random series we have used a delay in the generation of time series. These new series when they are mapped xn against xn+1 present a cloud of points unrelated to the logistic map. Finally, the pseudo-random sequences have been tested with the suite of NIST giving satisfactory results for use in stream ciphers.

  7. A Repetition Test for Pseudo-Random Number Generators

    OpenAIRE

    Gil, Manuel; Gonnet, Gaston H.; Petersen, Wesley P.

    2017-01-01

    A new statistical test for uniform pseudo-random number generators (PRNGs) is presented. The idea is that a sequence of pseudo-random numbers should have numbers reappear with a certain probability. The expectation time that a repetition occurs provides the metric for the test. For linear congruential generators (LCGs) failure can be shown theoretically. Empirical test results for a number of commonly used PRNGs are reported, showing that some PRNGs considered to have good statistical propert...

  8. A new pseudorandom number generator based on a complex number chaotic equation

    International Nuclear Information System (INIS)

    Liu Yang; Tong Xiao-Jun

    2012-01-01

    In recent years, various chaotic equation based pseudorandom number generators have been proposed. However, the chaotic equations are all defined in the real number field. In this paper, an equation is proposed and proved to be chaotic in the imaginary axis. And a pseudorandom number generator is constructed based on the chaotic equation. The alteration of the definitional domain of the chaotic equation from the real number field to the complex one provides a new approach to the construction of chaotic equations, and a new method to generate pseudorandom number sequences accordingly. Both theoretical analysis and experimental results show that the sequences generated by the proposed pseudorandom number generator possess many good properties

  9. Pseudorandom Recursions: Small and Fast Pseudorandom Number Generators for Embedded Applications

    Directory of Open Access Journals (Sweden)

    Petruska Gyorgy

    2007-01-01

    Full Text Available Many new small and fast pseudorandom number generators are presented, which pass the most common randomness tests. They perform only a few, nonmultiplicative operations for each generated number, use very little memory, therefore, they are ideal for embedded applications. We present general methods to ensure very long cycles and show, how to create super fast, very small ciphers and hash functions from them.

  10. Pseudorandom Recursions: Small and Fast Pseudorandom Number Generators for Embedded Applications

    Directory of Open Access Journals (Sweden)

    Gyorgy Petruska

    2007-02-01

    Full Text Available Many new small and fast pseudorandom number generators are presented, which pass the most common randomness tests. They perform only a few, nonmultiplicative operations for each generated number, use very little memory, therefore, they are ideal for embedded applications. We present general methods to ensure very long cycles and show, how to create super fast, very small ciphers and hash functions from them.

  11. Pseudo-random number generation using a 3-state cellular automaton

    Science.gov (United States)

    Bhattacharjee, Kamalika; Paul, Dipanjyoti; Das, Sukanta

    This paper investigates the potentiality of pseudo-random number generation of a 3-neighborhood 3-state cellular automaton (CA) under periodic boundary condition. Theoretical and empirical tests are performed on the numbers, generated by the CA, to observe the quality of it as pseudo-random number generator (PRNG). We analyze the strength and weakness of the proposed PRNG and conclude that the selected CA is a good random number generator.

  12. Pseudo-Random Number Generator Based on Coupled Map Lattices

    Science.gov (United States)

    Lü, Huaping; Wang, Shihong; Hu, Gang

    A one-way coupled chaotic map lattice is used for generating pseudo-random numbers. It is shown that with suitable cooperative applications of both chaotic and conventional approaches, the output of the spatiotemporally chaotic system can easily meet the practical requirements of random numbers, i.e., excellent random statistical properties, long periodicity of computer realizations, and fast speed of random number generations. This pseudo-random number generator system can be used as ideal synchronous and self-synchronizing stream cipher systems for secure communications.

  13. Quality pseudo-random number generator

    International Nuclear Information System (INIS)

    Tarasiuk, J.

    1996-01-01

    The pseudo-random number generator (RNG) was written to match needs of nuclear and high-energy physics computation which in some cases require very long and independent random number sequences. In this random number generator the repetition period is about 10 36 what should be sufficient for all computers in the world. In this article the test results of RNG correlation, speed and identity of computations for PC, Sun4 and VAX computer tests are presented

  14. A pseudo-random number generator and its spectral test

    International Nuclear Information System (INIS)

    Wang Lai

    1998-01-01

    The author introduces a pseudo-random number generator and describes its algorithm and C language implementation. The performance of the generator is tested and compared with some well known LCG generators

  15. Efficient pseudorandom generators based on the DDH assumption

    NARCIS (Netherlands)

    Rezaeian Farashahi, R.; Schoenmakers, B.; Sidorenko, A.; Okamoto, T.; Wang, X.

    2007-01-01

    A family of pseudorandom generators based on the decisional Diffie-Hellman assumption is proposed. The new construction is a modified and generalized version of the Dual Elliptic Curve generator proposed by Barker and Kelsey. Although the original Dual Elliptic Curve generator is shown to be

  16. High-Performance Pseudo-Random Number Generation on Graphics Processing Units

    OpenAIRE

    Nandapalan, Nimalan; Brent, Richard P.; Murray, Lawrence M.; Rendell, Alistair

    2011-01-01

    This work considers the deployment of pseudo-random number generators (PRNGs) on graphics processing units (GPUs), developing an approach based on the xorgens generator to rapidly produce pseudo-random numbers of high statistical quality. The chosen algorithm has configurable state size and period, making it ideal for tuning to the GPU architecture. We present a comparison of both speed and statistical quality with other common parallel, GPU-based PRNGs, demonstrating favourable performance o...

  17. Pseudorandom number generation using chaotic true orbits of the Bernoulli map

    Energy Technology Data Exchange (ETDEWEB)

    Saito, Asaki, E-mail: saito@fun.ac.jp [Future University Hakodate, 116-2 Kamedanakano-cho, Hakodate, Hokkaido 041-8655 (Japan); Yamaguchi, Akihiro [Fukuoka Institute of Technology, 3-30-1 Wajiro-higashi, Higashi-ku, Fukuoka 811-0295 (Japan)

    2016-06-15

    We devise a pseudorandom number generator that exactly computes chaotic true orbits of the Bernoulli map on quadratic algebraic integers. Moreover, we describe a way to select the initial points (seeds) for generating multiple pseudorandom binary sequences. This selection method distributes the initial points almost uniformly (equidistantly) in the unit interval, and latter parts of the generated sequences are guaranteed not to coincide. We also demonstrate through statistical testing that the generated sequences possess good randomness properties.

  18. Primitive polynomials selection method for pseudo-random number generator

    Science.gov (United States)

    Anikin, I. V.; Alnajjar, Kh

    2018-01-01

    In this paper we suggested the method for primitive polynomials selection of special type. This kind of polynomials can be efficiently used as a characteristic polynomials for linear feedback shift registers in pseudo-random number generators. The proposed method consists of two basic steps: finding minimum-cost irreducible polynomials of the desired degree and applying primitivity tests to get the primitive ones. Finally two primitive polynomials, which was found by the proposed method, used in pseudorandom number generator based on fuzzy logic (FRNG) which had been suggested before by the authors. The sequences generated by new version of FRNG have low correlation magnitude, high linear complexity, less power consumption, is more balanced and have better statistical properties.

  19. Pseudo-random bit generator based on Chebyshev map

    Science.gov (United States)

    Stoyanov, B. P.

    2013-10-01

    In this paper, we study a pseudo-random bit generator based on two Chebyshev polynomial maps. The novel derivative algorithm shows perfect statistical properties established by number of statistical tests.

  20. Method for Generating Pseudorandom Sequences with the Assured Period Based on R-blocks

    Directory of Open Access Journals (Sweden)

    M. A. Ivanov

    2011-03-01

    Full Text Available The article describes the characteristics of a new class of fast-acting pseudorandom number generators, based on the use of stochastic adders or R-blocks. A new method for generating pseudorandom sequences with the assured length of period is offered.

  1. Pseudorandom Testing – A Study of the Effect of the Generator Type

    Directory of Open Access Journals (Sweden)

    P. Fišer

    2005-01-01

    Full Text Available The test pattern generator produces test vectors that are applied to the tested circuit during pseudo-random testing of combinational circuits. The nature of the generator thus directly influences the fault coverage achieved. In this paper we discuss the influence of the type of pseudo-random pattern generator on stuck-at fault coverage. Linear feedback shift registers (LFSRs are mostly used as test pattern generators, and the generating polynomial is primitive to ensure the maximum period. We have shown that it is not necessary to use primitive polynomials, and moreover that their using is even undesirable in most cases. This fact is documented by statistical graphs. The necessity of the proper choice of a generating polynomial and an LFSR seed is shown here, by designing a mixed-mode BIST for the ISCAS benchmarks.An alternative to LFSRs are cellular automata (CA. We study the effectiveness of CA when used as pseudo-random pattern generators. The observations are documented by statistical results. 

  2. An efficient parallel pseudorandom bit generator based

    Indian Academy of Sciences (India)

    In this paper, an asymmetric coupled map lattice (CML) combining sawtooth map as a local map is presented and its chaotic behaviours are analysed. Based on this asymmetric CML, a pseudorandom bit generator (PRBG) is proposed. The specific parameters of the system that make complicated floating-point computation ...

  3. On pseudorandom generators in NC0

    DEFF Research Database (Denmark)

    Cryan, Mary; Miltersen, Peter Bro

    2001-01-01

    In this paper we consider the question of whether NC 0 circuits can generate pseudorandom distributions. While we leave the general question unanswered, we show – • Generators computed by NC 0 circuits where each output bit depends on at most 3 input bits (i.e, DNC 3 0 circuits) and with stretch ...

  4. Using pseudo-random number generator for making iterative algorithms of hashing data

    International Nuclear Information System (INIS)

    Ivanov, M.A.; Vasil'ev, N.P.; Kozyrskij, B.L.

    2014-01-01

    The method of stochastic data transformation made for usage in cryptographic methods of information protection has been analyzed. The authors prove the usage of cryptographically strong pseudo-random number generators as a basis for Sponge construction. This means that the analysis of the quality of the known methods and tools for assessing the statistical security of pseudo-random number generators can be used effectively [ru

  5. Graphical analysis of some pseudo-random number generators

    OpenAIRE

    Lewis, Peter A. W.

    1986-01-01

    There exist today many 'good' pseudo-random number generators; the problem is to retrieve them. This document discusses three commonly used pseudo- random number generators, the first being RANDU, a notoriously bad generator, but one which is still occasionally used. The next is the widely used prime modulus, multiplicative congruential generator used in LL-RANDOMII, the Naval Postgraduate School random number package, and the last is the random number generator provided for microcomputers wi...

  6. New Trends in Pseudo-Random Number Generation

    Science.gov (United States)

    Gutbrod, F.

    Properties of pseudo-random number generators are reviewed. The emphasis is on correlations between successive random numbers and their suppression by improvement steps. The generators under discussion are the linear congruential generators, lagged Fibonacci generators with various operations, and the improvement techniques combination, shuffling and decimation. The properties of the RANSHI generator are reviewed somewhat more extensively. The transition to 64-bit technology is discussed in several cases. The generators are subject to several tests, which look both for short range and for long range correlations. Some performance figures are given for a Pentium Pro PC. Recommendations are presented in the final chapter.

  7. Modular Transformations, Order-Chaos Transitions and Pseudo-Random Number Generation

    Science.gov (United States)

    Bonelli, Antonio; Ruffo, Stefano

    Successive pairs of pseudo-random numbers generated by standard linear congruential transformations display ordered patterns of parallel lines. We study the "ordered" and "chaotic" distribution of such pairs by solving the eigenvalue problem for two-dimensional modular transformations over integers. We conjecture that the optimal uniformity for pair distribution is obtained when the slope of linear modular eigenspaces takes the value n opt =maxint (p/√ {p-1}), where p is a prime number. We then propose a new generator of pairs of independent pseudo-random numbers, which realizes an optimal uniform distribution (in the "statistical" sense) of points on the unit square (0, 1] × (0, 1]. The method can be easily generalized to the generation of k-tuples of random numbers (with k>2).

  8. About the problem of generating three-dimensional pseudo-random points.

    Science.gov (United States)

    Carpintero, D. D.

    The author demonstrates that a popular pseudo-random number generator is not adequate in some circumstances to generate n-dimensional random points, n > 2. This problem is particularly noxious when direction cosines are generated. He proposes several soultions, among them a good generator that satisfies all statistical criteria.

  9. Stream cipher based on pseudorandom number generation using optical affine transformation

    Science.gov (United States)

    Sasaki, Toru; Togo, Hiroyuki; Tanida, Jun; Ichioka, Yoshiki

    2000-07-01

    We propose a new stream cipher technique for 2D image data which can be implemented by iterative optical transformation. The stream cipher uses a pseudo-random number generator (PRNG) to generate pseudo-random bit sequence. The proposed method for the PRNG is composed of iterative operation of 2D affine transformation achieved by optical components, and modulo-n addition of the transformed images. The method is expected to be executed efficiently by optical parallel processing. We verify performance of the proposed method in terms of security strength and clarify problems on optical implementation by the optical fractal synthesizer.

  10. Hardware implementation of a GFSR pseudo-random number generator

    Science.gov (United States)

    Aiello, G. R.; Budinich, M.; Milotti, E.

    1989-12-01

    We describe the hardware implementation of a pseudo-random number generator of the "Generalized Feedback Shift Register" (GFSR) type. After brief theoretical considerations we describe two versions of the hardware, the tests done and the performances achieved.

  11. Pseudo-Random Number Generators for Vector Processors and Multicore Processors

    DEFF Research Database (Denmark)

    Fog, Agner

    2015-01-01

    Large scale Monte Carlo applications need a good pseudo-random number generator capable of utilizing both the vector processing capabilities and multiprocessing capabilities of modern computers in order to get the maximum performance. The requirements for such a generator are discussed. New ways...

  12. Kolmogorov complexity, pseudorandom generators and statistical models testing

    Czech Academy of Sciences Publication Activity Database

    Šindelář, Jan; Boček, Pavel

    2002-01-01

    Roč. 38, č. 6 (2002), s. 747-759 ISSN 0023-5954 R&D Projects: GA ČR GA102/99/1564 Institutional research plan: CEZ:AV0Z1075907 Keywords : Kolmogorov complexity * pseudorandom generators * statistical models testing Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 0.341, year: 2002

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

    Science.gov (United States)

    Ghersi, Dario; Parakh, Abhishek; Mezei, Mihaly

    2017-12-05

    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. © 2017 Wiley Periodicals, Inc.

  14. Pseudo-random number generators for Monte Carlo simulations on ATI Graphics Processing Units

    Science.gov (United States)

    Demchik, Vadim

    2011-03-01

    Basic uniform pseudo-random number generators are implemented on ATI Graphics Processing Units (GPU). The performance results of the realized generators (multiplicative linear congruential (GGL), XOR-shift (XOR128), RANECU, RANMAR, RANLUX and Mersenne Twister (MT19937)) on CPU and GPU are discussed. The obtained speed up factor is hundreds of times in comparison with CPU. RANLUX generator is found to be the most appropriate for using on GPU in Monte Carlo simulations. The brief review of the pseudo-random number generators used in modern software packages for Monte Carlo simulations in high-energy physics is presented.

  15. Security problems for a pseudorandom sequence generator based on the Chen chaotic system

    Science.gov (United States)

    Özkaynak, Fatih; Yavuz, Sırma

    2013-09-01

    Recently, a novel pseudorandom number generator scheme based on the Chen chaotic system was proposed. In this study, we analyze the security weaknesses of the proposed generator. By applying a brute force attack on a reduced key space, we show that 66% of the generated pseudorandom number sequences can be revealed. Executable C# code is given for the proposed attack. The computational complexity of this attack is O(n), where n is the sequence length. Both mathematical proofs and experimental results are presented to support the proposed attack.

  16. Program pseudo-random number generator for microcomputers

    International Nuclear Information System (INIS)

    Ososkov, G.A.

    1980-01-01

    Program pseudo-random number generators (PNG) intended for the test of control equipment and communication channels are considered. In the case of 8-bit microcomputers it is necessary to assign 4 words of storage to allocate one random number. The proposed economical algorithms of the random number generation are based on the idea of the ''mixing'' of such quarters of the preceeding random number to obtain the next one. Test results of the PNG are displayed for two such generators. A FORTRAN variant of the PNG is presented along with a program realizing the PNG made on the base of the INTEL-8080 autocode

  17. Programmable pseudo-random detector-pulse-pattern generator

    International Nuclear Information System (INIS)

    Putten, R. van der; Nationaal Inst. voor Kernfysica en Hoge-Energiefysica

    1990-01-01

    This report discusses the design and realization of the digital part of the programmable pseudo-random detector pulse-pattern generator. For the design and realization use has been made of F-TTL and high speed special purpose ic's, in particular FAL's (15 ns). The design possibilities offered by the software for pro-gramming of the FAL's have been utilized as much as possible. In this way counters, registers and a state machine with extended control possibilities have been designed and an advanced 8 channel pulse generator has been developed which is controlled via the VME system bus. the generator possesses an internal clock oscillator of 16 MHZ. The moment when a pulse is generated can be adjusted with a step size of 250 ps. 2000 different periods (time windows) can be stored for generating a pattern. (author). 37 refs.; 6 figs

  18. Three-dimensional pseudo-random number generator for implementing in hybrid computer systems

    International Nuclear Information System (INIS)

    Ivanov, M.A.; Vasil'ev, N.P.; Voronin, A.V.; Kravtsov, M.Yu.; Maksutov, A.A.; Spiridonov, A.A.; Khudyakova, V.I.; Chugunkov, I.V.

    2012-01-01

    The algorithm for generating pseudo-random numbers oriented to implementation by using hybrid computer systems is considered. The proposed solution is characterized by a high degree of parallel computing [ru

  19. Accelerating Pseudo-Random Number Generator for MCNP on GPU

    Science.gov (United States)

    Gong, Chunye; Liu, Jie; Chi, Lihua; Hu, Qingfeng; Deng, Li; Gong, Zhenghu

    2010-09-01

    Pseudo-random number generators (PRNG) are intensively used in many stochastic algorithms in particle simulations, artificial neural networks and other scientific computation. The PRNG in Monte Carlo N-Particle Transport Code (MCNP) requires long period, high quality, flexible jump and fast enough. In this paper, we implement such a PRNG for MCNP on NVIDIA's GTX200 Graphics Processor Units (GPU) using CUDA programming model. Results shows that 3.80 to 8.10 times speedup are achieved compared with 4 to 6 cores CPUs and more than 679.18 million double precision random numbers can be generated per second on GPU.

  20. Research of the method of pseudo-random number generation based on asynchronous cellular automata with several active cells

    Directory of Open Access Journals (Sweden)

    Bilan Stepan

    2017-01-01

    Full Text Available To date, there are many tasks that are aimed at studying the dynamic changes in physical processes. These tasks do not give advance known result. The solution of such problems is based on the construction of a dynamic model of the object. Successful structural and functional implementation of the object model can give a positive result in time. This approach uses the task of constructing artificial biological objects. To solve such problems, pseudo-random number generators are used, which also find wide application for information protection tasks. Such generators should have good statistical properties and give a long repetition period of the generated pseudo-random bit sequence. This work is aimed at improving these characteristics. The paper considers the method of forming pseudo-random sequences of numbers on the basis of aperiodic cellular automata with two active cells. A pseudo-random number generator is proposed that generates three bit sequences. The first two bit sequences are formed by the corresponding two active cells in the cellular automaton. The third bit sequence is the result of executing the XOR function over the bits of the first two sequences and it has better characteristics compared to them. The use of cellular automata with two active cells allowed to improve the statistical properties of the formed bit sequence, as well as its repetition period. This is proved by using graphical tests for generators built based on cellular automata using the neighborhoods of von Neumann and Moore. The tests showed high efficiency of the generator based on an asynchronous cellular automaton with the neighborhood of Moore. The proposed pseudo-random number generators have good statistical properties, which makes it possible to use them in information security systems, as well as for simulation tasks of various dynamic processes.

  1. Analyzing logistic map pseudorandom number generators for periodicity induced by finite precision floating-point representation

    International Nuclear Information System (INIS)

    Persohn, K.J.; Povinelli, R.J.

    2012-01-01

    Highlights: ► A chaotic pseudorandom number generator (C-PRNG) poorly explores the key space. ► A C-PRNG is finite and periodic when implemented on a finite precision computer. ► We present a method to determine the period lengths of a C-PRNG. - Abstract: Because of the mixing and aperiodic properties of chaotic maps, such maps have been used as the basis for pseudorandom number generators (PRNGs). However, when implemented on a finite precision computer, chaotic maps have finite and periodic orbits. This manuscript explores the consequences finite precision has on the periodicity of a PRNG based on the logistic map. A comparison is made with conventional methods of generating pseudorandom numbers. The approach used to determine the number, delay, and period of the orbits of the logistic map at varying degrees of precision (3 to 23 bits) is described in detail, including the use of the Condor high-throughput computing environment to parallelize independent tasks of analyzing a large initial seed space. Results demonstrate that in terms of pathological seeds and effective bit length, a PRNG based on the logistic map performs exponentially worse than conventional PRNGs.

  2. Generation of pseudo-random numbers with the use of inverse chaotic transformation

    Directory of Open Access Journals (Sweden)

    Lawnik Marcin

    2018-02-01

    Full Text Available In (Lawnik M., Generation of numbers with the distribution close to uniform with the use of chaotic maps, In: Obaidat M.S., Kacprzyk J., Ören T. (Ed., International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH (28-30 August 2014, Vienna, Austria, SCITEPRESS, 2014 Lawnik discussed a method of generating pseudo-random numbers from uniform distribution with the use of adequate chaotic transformation. The method enables the “flattening” of continuous distributions to uniform one. In this paper a inverse process to the above-mentioned method is presented, and, in consequence, a new manner of generating pseudo-random numbers from a given continuous distribution. The method utilizes the frequency of the occurrence of successive branches of chaotic transformation in the process of “flattening”. To generate the values from the given distribution one discrete and one continuous value of a random variable are required. The presented method does not directly involve the knowledge of the density function or the cumulative distribution function, which is, undoubtedly, a great advantage in comparison with other well-known methods. The described method was analysed on the example of the standard normal distribution.

  3. Very high performance pseudo-random number generation on DAP

    Science.gov (United States)

    Smith, K. A.; Reddaway, S. F.; Scott, D. M.

    1985-07-01

    Since the National DAP Service began at QMC in 1980, extensive use has been made of pseudo-random numbers in Monte Carlo simulation. Matrices of uniform numbers have been produced by various generators: (a) multiplicative ( x+ 1 = 13 13xn mod 2 59); (b) very long period shift register ( x4423 + x271 + 1); (c) multiple shorter period ( x127 + x7 + 1) shift registers generating several matrices per iteration. The above uniform generators can also feed a normal distribution generator that uses the Box-Muller transformation. This paper describes briefly the generators, their implementation and speed. Generator (b) has been greatly speeded-up by re-implementation, and now produces more than 100 × 10 6 high quality 16-bit numbers/s. Generator (c) is under development and will achieve even higher performance, mainly due to producing data in greater bulk. High quality numbers are expected, and performance will range from 400 to 800 × 10 6 numbers/s, depending on how the generator is used.

  4. Pseudo-random number generator for the Sigma 5 computer

    Science.gov (United States)

    Carroll, S. N.

    1983-01-01

    A technique is presented for developing a pseudo-random number generator based on the linear congruential form. The two numbers used for the generator are a prime number and a corresponding primitive root, where the prime is the largest prime number that can be accurately represented on a particular computer. The primitive root is selected by applying Marsaglia's lattice test. The technique presented was applied to write a random number program for the Sigma 5 computer. The new program, named S:RANDOM1, is judged to be superior to the older program named S:RANDOM. For applications requiring several independent random number generators, a table is included showing several acceptable primitive roots. The technique and programs described can be applied to any computer having word length different from that of the Sigma 5.

  5. Generalized hardware post-processing technique for chaos-based pseudorandom number generators

    KAUST Repository

    Barakat, Mohamed L.

    2013-06-01

    This paper presents a generalized post-processing technique for enhancing the pseudorandomness of digital chaotic oscillators through a nonlinear XOR-based operation with rotation and feedback. The technique allows full utilization of the chaotic output as pseudorandom number generators and improves throughput without a significant area penalty. Digital design of a third-order chaotic system with maximum function nonlinearity is presented with verified chaotic dynamics. The proposed post-processing technique eliminates statistical degradation in all output bits, thus maximizing throughput compared to other processing techniques. Furthermore, the technique is applied to several fully digital chaotic oscillators with performance surpassing previously reported systems in the literature. The enhancement in the randomness is further examined in a simple image encryption application resulting in a better security performance. The system is verified through experiment on a Xilinx Virtex 4 FPGA with throughput up to 15.44 Gbit/s and logic utilization less than 0.84% for 32-bit implementations. © 2013 ETRI.

  6. Pseudo-random number generator based on mixing of three chaotic maps

    Science.gov (United States)

    François, M.; Grosges, T.; Barchiesi, D.; Erra, R.

    2014-04-01

    A secure pseudo-random number generator three-mixer is proposed. The principle of the method consists in mixing three chaotic maps produced from an input initial vector. The algorithm uses permutations whose positions are computed and indexed by a standard chaotic function and a linear congruence. The performance of that scheme is evaluated through statistical analysis. Such a cryptosystem lets appear significant cryptographic qualities for a high security level.

  7. Pseudo-random number generation for Brownian Dynamics and Dissipative Particle Dynamics simulations on GPU devices

    International Nuclear Information System (INIS)

    Phillips, Carolyn L.; Anderson, Joshua A.; Glotzer, Sharon C.

    2011-01-01

    Highlights: → Molecular Dynamics codes implemented on GPUs have achieved two-order of magnitude computational accelerations. → Brownian Dynamics and Dissipative Particle Dynamics simulations require a large number of random numbers per time step. → We introduce a method for generating small batches of pseudorandom numbers distributed over many threads of calculations. → With this method, Dissipative Particle Dynamics is implemented on a GPU device without requiring thread-to-thread communication. - Abstract: Brownian Dynamics (BD), also known as Langevin Dynamics, and Dissipative Particle Dynamics (DPD) are implicit solvent methods commonly used in models of soft matter and biomolecular systems. The interaction of the numerous solvent particles with larger particles is coarse-grained as a Langevin thermostat is applied to individual particles or to particle pairs. The Langevin thermostat requires a pseudo-random number generator (PRNG) to generate the stochastic force applied to each particle or pair of neighboring particles during each time step in the integration of Newton's equations of motion. In a Single-Instruction-Multiple-Thread (SIMT) GPU parallel computing environment, small batches of random numbers must be generated over thousands of threads and millions of kernel calls. In this communication we introduce a one-PRNG-per-kernel-call-per-thread scheme, in which a micro-stream of pseudorandom numbers is generated in each thread and kernel call. These high quality, statistically robust micro-streams require no global memory for state storage, are more computationally efficient than other PRNG schemes in memory-bound kernels, and uniquely enable the DPD simulation method without requiring communication between threads.

  8. Distributed Pseudo-Random Number Generation and Its Application to Cloud Database

    OpenAIRE

    Chen, Jiageng; Miyaji, Atsuko; Su, Chunhua

    2014-01-01

    Cloud database is now a rapidly growing trend in cloud computing market recently. It enables the clients run their computation on out-sourcing databases or access to some distributed database service on the cloud. At the same time, the security and privacy concerns is major challenge for cloud database to continue growing. To enhance the security and privacy of the cloud database technology, the pseudo-random number generation (PRNG) plays an important roles in data encryptions and privacy-pr...

  9. Security Flaws in an Efficient Pseudo-Random Number Generator for Low-Power Environments

    Science.gov (United States)

    Peris-Lopez, Pedro; Hernandez-Castro, Julio C.; Tapiador, Juan M. E.; Millán, Enrique San; van der Lubbe, Jan C. A.

    In 2004, Settharam and Rhee tackled the design of a lightweight Pseudo-Random Number Generator (PRNG) suitable for low-power environments (e.g. sensor networks, low-cost RFID tags). First, they explicitly fixed a set of requirements for this primitive. Then, they proposed a PRNG conforming to these requirements and using a free-running timer [9]. We analyze this primitive discovering important security faults. The proposed algorithm fails to pass even relatively non-stringent batteries of randomness such as ENT (i.e. a pseudorandom number sequence test program). We prove that their recommended PRNG has a very short period due to the flawed design of its core. The internal state can be easily revealed, compromising its backward and forward security. Additionally, the rekeying algorithm is defectively designed mainly related to the unpractical value proposed for this purpose.

  10. Pseudo-random number generation for Brownian Dynamics and Dissipative Particle Dynamics simulations on GPU devices

    Science.gov (United States)

    Phillips, Carolyn L.; Anderson, Joshua A.; Glotzer, Sharon C.

    2011-08-01

    Brownian Dynamics (BD), also known as Langevin Dynamics, and Dissipative Particle Dynamics (DPD) are implicit solvent methods commonly used in models of soft matter and biomolecular systems. The interaction of the numerous solvent particles with larger particles is coarse-grained as a Langevin thermostat is applied to individual particles or to particle pairs. The Langevin thermostat requires a pseudo-random number generator (PRNG) to generate the stochastic force applied to each particle or pair of neighboring particles during each time step in the integration of Newton's equations of motion. In a Single-Instruction-Multiple-Thread (SIMT) GPU parallel computing environment, small batches of random numbers must be generated over thousands of threads and millions of kernel calls. In this communication we introduce a one-PRNG-per-kernel-call-per-thread scheme, in which a micro-stream of pseudorandom numbers is generated in each thread and kernel call. These high quality, statistically robust micro-streams require no global memory for state storage, are more computationally efficient than other PRNG schemes in memory-bound kernels, and uniquely enable the DPD simulation method without requiring communication between threads.

  11. Pseudo-random properties of a linear congruential generator investigated by b-adic diaphony

    Science.gov (United States)

    Stoev, Peter; Stoilova, Stanislava

    2017-12-01

    In the proposed paper we continue the study of the diaphony, defined in b-adic number system, and we extend it in different directions. We investigate this diaphony as a tool for estimation of the pseudorandom properties of some of the most used random number generators. This is done by evaluating the distribution of specially constructed two-dimensional nets on the base of the obtained random numbers. The aim is to see how the generated numbers are suitable for calculations in some numerical methods (Monte Carlo etc.).

  12. Pseudo-random number generator based on asymptotic deterministic randomness

    Science.gov (United States)

    Wang, Kai; Pei, Wenjiang; Xia, Haishan; Cheung, Yiu-ming

    2008-06-01

    A novel approach to generate the pseudorandom-bit sequence from the asymptotic deterministic randomness system is proposed in this Letter. We study the characteristic of multi-value correspondence of the asymptotic deterministic randomness constructed by the piecewise linear map and the noninvertible nonlinearity transform, and then give the discretized systems in the finite digitized state space. The statistic characteristics of the asymptotic deterministic randomness are investigated numerically, such as stationary probability density function and random-like behavior. Furthermore, we analyze the dynamics of the symbolic sequence. Both theoretical and experimental results show that the symbolic sequence of the asymptotic deterministic randomness possesses very good cryptographic properties, which improve the security of chaos based PRBGs and increase the resistance against entropy attacks and symbolic dynamics attacks.

  13. Pseudo-random number generator based on asymptotic deterministic randomness

    International Nuclear Information System (INIS)

    Wang Kai; Pei Wenjiang; Xia Haishan; Cheung Yiuming

    2008-01-01

    A novel approach to generate the pseudorandom-bit sequence from the asymptotic deterministic randomness system is proposed in this Letter. We study the characteristic of multi-value correspondence of the asymptotic deterministic randomness constructed by the piecewise linear map and the noninvertible nonlinearity transform, and then give the discretized systems in the finite digitized state space. The statistic characteristics of the asymptotic deterministic randomness are investigated numerically, such as stationary probability density function and random-like behavior. Furthermore, we analyze the dynamics of the symbolic sequence. Both theoretical and experimental results show that the symbolic sequence of the asymptotic deterministic randomness possesses very good cryptographic properties, which improve the security of chaos based PRBGs and increase the resistance against entropy attacks and symbolic dynamics attacks

  14. Quantifiers for randomness of chaotic pseudo-random number generators.

    Science.gov (United States)

    De Micco, L; Larrondo, H A; Plastino, A; Rosso, O A

    2009-08-28

    We deal with randomness quantifiers and concentrate on their ability to discern the hallmark of chaos in time series used in connection with pseudo-random number generators (PRNGs). Workers in the field are motivated to use chaotic maps for generating PRNGs because of the simplicity of their implementation. Although there exist very efficient general-purpose benchmarks for testing PRNGs, we feel that the analysis provided here sheds additional didactic light on the importance of the main statistical characteristics of a chaotic map, namely (i) its invariant measure and (ii) the mixing constant. This is of help in answering two questions that arise in applications: (i) which is the best PRNG among the available ones? and (ii) if a given PRNG turns out not to be good enough and a randomization procedure must still be applied to it, which is the best applicable randomization procedure? Our answer provides a comparative analysis of several quantifiers advanced in the extant literature.

  15. A high-speed on-chip pseudo-random binary sequence generator for multi-tone phase calibration

    Science.gov (United States)

    Gommé, Liesbeth; Vandersteen, Gerd; Rolain, Yves

    2011-07-01

    An on-chip reference generator is conceived by adopting the technique of decimating a pseudo-random binary sequence (PRBS) signal in parallel sequences. This is of great benefit when high-speed generation of PRBS and PRBS-derived signals is the objective. The design implemented standard CMOS logic is available in commercial libraries to provide the logic functions for the generator. The design allows the user to select the periodicity of the PRBS and the PRBS-derived signals. The characterization of the on-chip generator marks its performance and reveals promising specifications.

  16. A high-speed on-chip pseudo-random binary sequence generator for multi-tone phase calibration

    International Nuclear Information System (INIS)

    Gommé, Liesbeth; Vandersteen, Gerd; Rolain, Yves

    2011-01-01

    An on-chip reference generator is conceived by adopting the technique of decimating a pseudo-random binary sequence (PRBS) signal in parallel sequences. This is of great benefit when high-speed generation of PRBS and PRBS-derived signals is the objective. The design implemented standard CMOS logic is available in commercial libraries to provide the logic functions for the generator. The design allows the user to select the periodicity of the PRBS and the PRBS-derived signals. The characterization of the on-chip generator marks its performance and reveals promising specifications

  17. Non-periodic pseudo-random numbers used in Monte Carlo calculations

    Science.gov (United States)

    Barberis, Gaston E.

    2007-09-01

    The generation of pseudo-random numbers is one of the interesting problems in Monte Carlo simulations, mostly because the common computer generators produce periodic numbers. We used simple pseudo-random numbers generated with the simplest chaotic system, the logistic map, with excellent results. The numbers generated in this way are non-periodic, which we demonstrated for 1013 numbers, and they are obtained in a deterministic way, which allows to repeat systematically any calculation. The Monte Carlo calculations are the ideal field to apply these numbers, and we did it for simple and more elaborated cases. Chemistry and Information Technology use this kind of simulations, and the application of this numbers to quantum Monte Carlo and cryptography is immediate. I present here the techniques to calculate, analyze and use these pseudo-random numbers, show that they lack periodicity up to 1013 numbers and that they are not correlated.

  18. Non-periodic pseudo-random numbers used in Monte Carlo calculations

    International Nuclear Information System (INIS)

    Barberis, Gaston E.

    2007-01-01

    The generation of pseudo-random numbers is one of the interesting problems in Monte Carlo simulations, mostly because the common computer generators produce periodic numbers. We used simple pseudo-random numbers generated with the simplest chaotic system, the logistic map, with excellent results. The numbers generated in this way are non-periodic, which we demonstrated for 10 13 numbers, and they are obtained in a deterministic way, which allows to repeat systematically any calculation. The Monte Carlo calculations are the ideal field to apply these numbers, and we did it for simple and more elaborated cases. Chemistry and Information Technology use this kind of simulations, and the application of this numbers to quantum Monte Carlo and cryptography is immediate. I present here the techniques to calculate, analyze and use these pseudo-random numbers, show that they lack periodicity up to 10 13 numbers and that they are not correlated

  19. ACORN—A new method for generating sequences of uniformly distributed Pseudo-random Numbers

    Science.gov (United States)

    Wikramaratna, R. S.

    1989-07-01

    A new family of pseudo-random number generators, the ACORN ( additive congruential random number) generators, is proposed. The resulting numbers are distributed uniformly in the interval [0, 1). The ACORN generators are defined recursively, and the ( k + 1)th order generator is easily derived from the kth order generator. Some theorems concerning the period length are presented and compared with existing results for linear congruential generators. A range of statistical tests are applied to the ACORN generators, and their performance is compared with that of the linear congruential generators and the Chebyshev generators. The tests show the ACORN generators to be statistically superior to the Chebyshev generators, while being statistically similar to the linear congruential generators. However, the ACORN generators execute faster than linear congruential generators for the same statistical faithfulness. The main advantages of the ACORN generator are speed of execution, long period length, and simplicity of coding.

  20. A Bidirectional Generalized Synchronization Theorem-Based Chaotic Pseudo-random Number Generator

    Directory of Open Access Journals (Sweden)

    Han Shuangshuang

    2013-07-01

    Full Text Available Based on a bidirectional generalized synchronization theorem for discrete chaos system, this paper introduces a new 5-dimensional bidirectional generalized chaos synchronization system (BGCSDS, whose prototype is a novel chaotic system introduced in [12]. Numerical simulation showed that two pair variables of the BGCSDS achieve generalized chaos synchronization via a transform H.A chaos-based pseudo-random number generator (CPNG was designed by the new BGCSDS. Using the FIPS-140-2 tests issued by the National Institute of Standard and Technology (NIST verified the randomness of the 1000 binary number sequences generated via the CPNG and the RC4 algorithm respectively. The results showed that all the tested sequences passed the FIPS-140-2 tests. The confidence interval analysis showed the statistical properties of the randomness of the sequences generated via the CPNG and the RC4 algorithm do not have significant differences.

  1. Cryptography, statistics and pseudo-randomness (Part 1)

    NARCIS (Netherlands)

    Brands, S.; Gill, R.D.

    1995-01-01

    In the classical approach to pseudo-random number generators, a generator is considered to perform well if its output sequences pass a battery of statistical tests that has become standard. In recent years, it has turned out that this approach is not satisfactory. Many generators have turned out to

  2. A Fast, High Quality, and Reproducible Parallel Lagged-Fibonacci Pseudorandom Number Generator

    Science.gov (United States)

    Mascagni, Michael; Cuccaro, Steven A.; Pryor, Daniel V.; Robinson, M. L.

    1995-07-01

    We study the suitability of the additive lagged-Fibonacci pseudo-random number generator for parallel computation. This generator has relatively short period with respect to the size of its seed. However, the short period is more than made up for with the huge number of full-period cycles it contains. These different full period cycles are called equivalence classes. We show how to enumerate the equivalence classes and how to compute seeds to select a given equivalence class, In addition, we present some theoretical measures of quality for this generator when used in parallel. Next, we conjecture on the size of these measures of quality for this generator. Extensive empirical evidence supports this conjecture. In addition, a probabilistic interpretation of these measures leads to another conjecture similarly supported by empirical evidence. Finally we give an explicit parallelization suitable for a fully reproducible asynchronous MIMD implementation.

  3. Pseudo-Random Sequences Generated by a Class of One-Dimensional Smooth Map

    Science.gov (United States)

    Wang, Xing-Yuan; Qin, Xue; Xie, Yi-Xin

    2011-08-01

    We extend a class of a one-dimensional smooth map. We make sure that for each desired interval of the parameter the map's Lyapunov exponent is positive. Then we propose a novel parameter perturbation method based on the good property of the extended one-dimensional smooth map. We perturb the parameter r in each iteration by the real number xi generated by the iteration. The auto-correlation function and NIST statistical test suite are taken to illustrate the method's randomness finally. We provide an application of this method in image encryption. Experiments show that the pseudo-random sequences are suitable for this application.

  4. Generation of pseudo-random numbers from given probabilistic distribution with the use of chaotic maps

    Science.gov (United States)

    Lawnik, Marcin

    2018-01-01

    The scope of the paper is the presentation of a new method of generating numbers from a given distribution. The method uses the inverse cumulative distribution function and a method of flattening of probabilistic distributions. On the grounds of these methods, a new construction of chaotic maps was derived, which generates values from a given distribution. The analysis of the new method was conducted on the example of a newly constructed chaotic recurrences, based on the Box-Muller transformation and the quantile function of the exponential distribution. The obtained results certify that the proposed method may be successively applicable for the construction of generators of pseudo-random numbers.

  5. Pseudo-Random Sequences Generated by a Class of One-Dimensional Smooth Map

    International Nuclear Information System (INIS)

    Wang Xing-Yuan; Qin Xue; Xie Yi-Xin

    2011-01-01

    We extend a class of a one-dimensional smooth map. We make sure that for each desired interval of the parameter the map's Lyapunov exponent is positive. Then we propose a novel parameter perturbation method based on the good property of the extended one-dimensional smooth map. We perturb the parameter r in each iteration by the real number x i generated by the iteration. The auto-correlation function and NIST statistical test suite are taken to illustrate the method's randomness finally. We provide an application of this method in image encryption. Experiments show that the pseudo-random sequences are suitable for this application. (general)

  6. Fully digital jerk-based chaotic oscillators for high throughput pseudo-random number generators up to 8.77Gbits/s

    KAUST Repository

    Mansingka, Abhinav S.

    2014-06-18

    This paper introduces fully digital implementations of four di erent systems in the 3rd order jerk-equation based chaotic family using the Euler approximation. The digitization approach enables controllable chaotic systems that reliably provide sinusoidal or chaotic output based on a selection input. New systems are introduced, derived using logical and arithmetic operations between two system implementations of different bus widths, with up to 100x higher maximum Lyapunov exponent than the original jerkequation based chaotic systems. The resulting chaotic output is shown to pass the NIST sp. 800-22 statistical test suite for pseudorandom number generators without post-processing by only eliminating the statistically defective bits. The systems are designed in Verilog HDL and experimentally verified on a Xilinx Virtex 4 FPGA for a maximum throughput of 15.59 Gbits/s for the native chaotic output and 8.77 Gbits/s for the resulting pseudo-random number generators.

  7. Graphical User Interface and Microprocessor Control Enhancement of a Pseudorandom Code Generator

    National Research Council Canada - National Science Library

    Kos, John

    1999-01-01

    .... This thesis addresses the issue of providing automated computer control to previously built, manually controlled hardware incorporating the Stanford Telecom STEL-1032 Pseudo-Random Number (PRN) Coder...

  8. Quantum Hash function and its application to privacy amplification in quantum key distribution, pseudo-random number generation and image encryption

    Science.gov (United States)

    Yang, Yu-Guang; Xu, Peng; Yang, Rui; Zhou, Yi-Hua; Shi, Wei-Min

    2016-01-01

    Quantum information and quantum computation have achieved a huge success during the last years. In this paper, we investigate the capability of quantum Hash function, which can be constructed by subtly modifying quantum walks, a famous quantum computation model. It is found that quantum Hash function can act as a hash function for the privacy amplification process of quantum key distribution systems with higher security. As a byproduct, quantum Hash function can also be used for pseudo-random number generation due to its inherent chaotic dynamics. Further we discuss the application of quantum Hash function to image encryption and propose a novel image encryption algorithm. Numerical simulations and performance comparisons show that quantum Hash function is eligible for privacy amplification in quantum key distribution, pseudo-random number generation and image encryption in terms of various hash tests and randomness tests. It extends the scope of application of quantum computation and quantum information.

  9. Quantum Hash function and its application to privacy amplification in quantum key distribution, pseudo-random number generation and image encryption

    Science.gov (United States)

    Yang, Yu-Guang; Xu, Peng; Yang, Rui; Zhou, Yi-Hua; Shi, Wei-Min

    2016-01-01

    Quantum information and quantum computation have achieved a huge success during the last years. In this paper, we investigate the capability of quantum Hash function, which can be constructed by subtly modifying quantum walks, a famous quantum computation model. It is found that quantum Hash function can act as a hash function for the privacy amplification process of quantum key distribution systems with higher security. As a byproduct, quantum Hash function can also be used for pseudo-random number generation due to its inherent chaotic dynamics. Further we discuss the application of quantum Hash function to image encryption and propose a novel image encryption algorithm. Numerical simulations and performance comparisons show that quantum Hash function is eligible for privacy amplification in quantum key distribution, pseudo-random number generation and image encryption in terms of various hash tests and randomness tests. It extends the scope of application of quantum computation and quantum information. PMID:26823196

  10. Novel pseudo-random number generator based on quantum random walks

    Science.gov (United States)

    Yang, Yu-Guang; Zhao, Qian-Qian

    2016-02-01

    In this paper, we investigate the potential application of quantum computation for constructing pseudo-random number generators (PRNGs) and further construct a novel PRNG based on quantum random walks (QRWs), a famous quantum computation model. The PRNG merely relies on the equations used in the QRWs, and thus the generation algorithm is simple and the computation speed is fast. The proposed PRNG is subjected to statistical tests such as NIST and successfully passed the test. Compared with the representative PRNG based on quantum chaotic maps (QCM), the present QRWs-based PRNG has some advantages such as better statistical complexity and recurrence. For example, the normalized Shannon entropy and the statistical complexity of the QRWs-based PRNG are 0.999699456771172 and 1.799961178212329e-04 respectively given the number of 8 bits-words, say, 16Mbits. By contrast, the corresponding values of the QCM-based PRNG are 0.999448131481064 and 3.701210794388818e-04 respectively. Thus the statistical complexity and the normalized entropy of the QRWs-based PRNG are closer to 0 and 1 respectively than those of the QCM-based PRNG when the number of words of the analyzed sequence increases. It provides a new clue to construct PRNGs and also extends the applications of quantum computation.

  11. Novel pseudo-random number generator based on quantum random walks.

    Science.gov (United States)

    Yang, Yu-Guang; Zhao, Qian-Qian

    2016-02-04

    In this paper, we investigate the potential application of quantum computation for constructing pseudo-random number generators (PRNGs) and further construct a novel PRNG based on quantum random walks (QRWs), a famous quantum computation model. The PRNG merely relies on the equations used in the QRWs, and thus the generation algorithm is simple and the computation speed is fast. The proposed PRNG is subjected to statistical tests such as NIST and successfully passed the test. Compared with the representative PRNG based on quantum chaotic maps (QCM), the present QRWs-based PRNG has some advantages such as better statistical complexity and recurrence. For example, the normalized Shannon entropy and the statistical complexity of the QRWs-based PRNG are 0.999699456771172 and 1.799961178212329e-04 respectively given the number of 8 bits-words, say, 16Mbits. By contrast, the corresponding values of the QCM-based PRNG are 0.999448131481064 and 3.701210794388818e-04 respectively. Thus the statistical complexity and the normalized entropy of the QRWs-based PRNG are closer to 0 and 1 respectively than those of the QCM-based PRNG when the number of words of the analyzed sequence increases. It provides a new clue to construct PRNGs and also extends the applications of quantum computation.

  12. Cryptographic applications of analytic number theory complexity lower bounds and pseudorandomness

    CERN Document Server

    2003-01-01

    The book introduces new ways of using analytic number theory in cryptography and related areas, such as complexity theory and pseudorandom number generation. Key topics and features: - various lower bounds on the complexity of some number theoretic and cryptographic problems, associated with classical schemes such as RSA, Diffie-Hellman, DSA as well as with relatively new schemes like XTR and NTRU - a series of very recent results about certain important characteristics (period, distribution, linear complexity) of several commonly used pseudorandom number generators, such as the RSA generator, Blum-Blum-Shub generator, Naor-Reingold generator, inversive generator, and others - one of the principal tools is bounds of exponential sums, which are combined with other number theoretic methods such as lattice reduction and sieving - a number of open problems of different level of difficulty and proposals for further research - an extensive and up-to-date bibliography Cryptographers and number theorists will find th...

  13. Pseudo-Random Number Generation in Children with High-Functioning Autism and Asperger's Disorder: Further Evidence for a Dissociation in Executive Functioning?

    Science.gov (United States)

    Rinehart, Nicole J.; Bradshaw, John L.; Moss, Simon A.; Brereton, Avril V.; Tonge, Bruce J.

    2006-01-01

    The repetitive, stereotyped and obsessive behaviours, which are core diagnostic features of autism, are thought to be underpinned by executive dysfunction. This study examined executive impairment in individuals with autism and Asperger's disorder using a verbal equivalent of an established pseudo-random number generating task. Different patterns…

  14. Cryptographic pseudo-random sequences from the chaotic Hénon ...

    Indian Academy of Sciences (India)

    2-dimensional chaotic maps for the generation of pseudorandom sequences. 3. ... map. Consider the bit-stream Bx formed by choosing every Pth bit of Sx, ... Similarly, the probability of the linear complexity C assuming the value c(c < N) when.

  15. On the short-term predictability of fully digital chaotic oscillators for pseudo-random number generation

    KAUST Repository

    Radwan, Ahmed Gomaa

    2014-06-18

    This paper presents a digital implementation of a 3rd order chaotic system using the Euler approximation. Short-term predictability is studied in relation to system precision, Euler step size and attractor size and optimal parameters for maximum performance are derived. Defective bits from the native chaotic output are neglected and the remaining pass the NIST SP. 800-22 tests without post-processing. The resulting optimized pseudorandom number generator has throughput up to 17.60 Gbits/s for a 64-bit design experimentally verified on a Xilinx Virtex 4 FPGA with logic utilization less than 1.85%.

  16. On the short-term predictability of fully digital chaotic oscillators for pseudo-random number generation

    KAUST Repository

    Radwan, Ahmed Gomaa; Mansingka, Abhinav S.; Salama, Khaled N.; Zidan, Mohammed A.

    2014-01-01

    This paper presents a digital implementation of a 3rd order chaotic system using the Euler approximation. Short-term predictability is studied in relation to system precision, Euler step size and attractor size and optimal parameters for maximum performance are derived. Defective bits from the native chaotic output are neglected and the remaining pass the NIST SP. 800-22 tests without post-processing. The resulting optimized pseudorandom number generator has throughput up to 17.60 Gbits/s for a 64-bit design experimentally verified on a Xilinx Virtex 4 FPGA with logic utilization less than 1.85%.

  17. Pseudo-random Trees: Multiple Independent Sequence Generators for Parallel and Branching Computations

    Science.gov (United States)

    Halton, John H.

    1989-09-01

    A class of families of linear congruential pseudo-random sequences is defined, for which it is possible to branch at any event without changing the sequence of random numbers used in the original random walk and for which the sequences in different branches show properties analogous to mutual statistical independence. This is a hitherto unavailable, and computationally desirable, tool.

  18. Robust video watermarking via optimization algorithm for quantization of pseudo-random semi-global statistics

    Science.gov (United States)

    Kucukgoz, Mehmet; Harmanci, Oztan; Mihcak, Mehmet K.; Venkatesan, Ramarathnam

    2005-03-01

    In this paper, we propose a novel semi-blind video watermarking scheme, where we use pseudo-random robust semi-global features of video in the three dimensional wavelet transform domain. We design the watermark sequence via solving an optimization problem, such that the features of the mark-embedded video are the quantized versions of the features of the original video. The exact realizations of the algorithmic parameters are chosen pseudo-randomly via a secure pseudo-random number generator, whose seed is the secret key, that is known (resp. unknown) by the embedder and the receiver (resp. by the public). We experimentally show the robustness of our algorithm against several attacks, such as conventional signal processing modifications and adversarial estimation attacks.

  19. Correlations of pseudo-random numbers of multiplicative sequence

    International Nuclear Information System (INIS)

    Bukin, A.D.

    1989-01-01

    An algorithm is suggested for searching with a computer in unit n-dimensional cube the sets of planes where all the points fall whose coordinates are composed of n successive pseudo-random numbers of multiplicative sequence. This effect should be taken into account in Monte-Carlo calculations with definite constructive dimension. The parameters of these planes are obtained for three random number generators. 2 refs.; 2 tabs

  20. The Methods of Implementation of the Three-dimensional Pseudorandom Number Generator DOZEN for Heterogeneous CPU/GPU /FPGA High-performance Systems

    Directory of Open Access Journals (Sweden)

    Nikolay Petrovich Vasilyev

    2015-03-01

    Full Text Available The paper describes the scope of information security protocols based on PRN G in industrial systems. A method for implementing three-dimensional pseudorandom number generator D O Z E N in hybrid systems is provided. The description and results of studies parallel CUDA-version of the algorithm for use in hybrid data centers and high-performance FPGA-version for use in hardware solutions in controlled facilities of SCADA-systems are given.

  1. Expanding Pseudorandom Functions

    DEFF Research Database (Denmark)

    Damgård, Ivan Bjerre; Nielsen, Jesper Buus

    2002-01-01

    Given any weak pseudorandom function, we present a general and efficient technique transforming such a function to a new weak pseudorandom function with an arbitrary length output. This implies, among other things, an encryption mode for block ciphers. The mode is as efficient as known (and widely...... used) encryption modes as CBC mode and counter (CTR) mode, but is provably secure against chosen-plaintext attack (CPA) already if the underlying symmetric cipher is secure against known-plaintext attack (KPA). We prove that CBC, CTR and Jutla’s integrity aware modes do not have this property....... In particular, we prove that when using a KPA secure block cipher, then: CBC mode is KPA secure, but need not be CPA secure, Jutla’s modes need not be CPA secure, and CTR mode need not be even KPA secure. The analysis is done in a concrete security framework....

  2. Pseudorandom numbers: evolutionary models in image processing, biology, and nonlinear dynamic systems

    Science.gov (United States)

    Yaroslavsky, Leonid P.

    1996-11-01

    We show that one can treat pseudo-random generators, evolutionary models of texture images, iterative local adaptive filters for image restoration and enhancement and growth models in biology and material sciences in a unified way as special cases of dynamic systems with a nonlinear feedback.

  3. Determination of spatially dependent transfer function of zero power reactor by using pseudo-random incentive

    International Nuclear Information System (INIS)

    Kostic, Lj.

    1973-01-01

    Specially constructed fast reactivity oscillator was stimulating the zero power reactor by a stimulus which caused pseudo-random reactivity changes. Measuring system included stochastic oscillator BCR-1 supplied by pseudo-random pulses from noise generator GBS-16, instrumental tape-recorder, system for data acquisition and digital computer ZUSE-Z-23. For measuring the spatially dependent transfer function, reactor response was measured at a number of different positions of stochastic oscillator and ionization chamber. In order to keep the reactor system linear, experiment was limited to small reactivity fluctuations. Experimental results were compared to theoretical ones

  4. The synthesis of the correlation function of pseudorandom binary numbers at the output shift register

    Science.gov (United States)

    Galustov, G. G.; Voronin, V. V.

    2017-05-01

    The sequence generator generates a sequence of pseudorandom binary numbers using a linear-feedback shift register (LFSR). This block implements LFSR using a simple shift register generator (SSRG, or Fibonacci) configuration. In this article we introduce the concept of probabilistic binary element provides requirements, which ensure compliance with the criterion of "uniformity" in the implementation of the basic physical generators uniformly distributed random number sequences. Based on these studies, we obtained an analytic relation between the parameters of the binary sequence and parameters of a numerical sequence with the shift register output. The received analytical dependencies can help in evaluating the statistical characteristics of the processes in solving problems of statistical modeling. It is supposed that the formation of the binary sequence output from the binary probabilistic element is produced using a physical noise process. It is shown that the observed errors in statistical modeling using pseudo-random numbers do not occur if the model examines linear systems with constant parameters, but in case models of nonlinear systems, higher order moments can have a Gaussian distribution.

  5. Quantum-key-distribution protocol with pseudorandom bases

    Science.gov (United States)

    Trushechkin, A. S.; Tregubov, P. A.; Kiktenko, E. O.; Kurochkin, Y. V.; Fedorov, A. K.

    2018-01-01

    Quantum key distribution (QKD) offers a way for establishing information-theoretical secure communications. An important part of QKD technology is a high-quality random number generator for the quantum-state preparation and for post-processing procedures. In this work, we consider a class of prepare-and-measure QKD protocols, utilizing additional pseudorandomness in the preparation of quantum states. We study one of such protocols and analyze its security against the intercept-resend attack. We demonstrate that, for single-photon sources, the considered protocol gives better secret key rates than the BB84 and the asymmetric BB84 protocols. However, the protocol strongly requires single-photon sources.

  6. Cryptographic pseudo-random sequence from the spatial chaotic map

    International Nuclear Information System (INIS)

    Sun Fuyan; Liu Shutang

    2009-01-01

    A scheme for pseudo-random binary sequence generation based on the spatial chaotic map is proposed. In order to face the challenge of using the proposed PRBS in cryptography, the proposed PRBS is subjected to statistical tests which are the well-known FIPS-140-1 in the area of cryptography, and correlation properties of the proposed sequences are investigated. The proposed PRBS successfully passes all these tests. Results of statistical testing of the sequences are found encouraging. The results of statistical tests suggest strong candidature for cryptographic applications.

  7. Improving the pseudo-randomness properties of chaotic maps using deep-zoom

    Science.gov (United States)

    Machicao, Jeaneth; Bruno, Odemir M.

    2017-05-01

    A generalized method is proposed to compose new orbits from a given chaotic map. The method provides an approach to examine discrete-time chaotic maps in a "deep-zoom" manner by using k-digits to the right from the decimal separator of a given point from the underlying chaotic map. Interesting phenomena have been identified. Rapid randomization was observed, i.e., chaotic patterns tend to become indistinguishable when compared to the original orbits of the underlying chaotic map. Our results were presented using different graphical analyses (i.e., time-evolution, bifurcation diagram, Lyapunov exponent, Poincaré diagram, and frequency distribution). Moreover, taking advantage of this randomization improvement, we propose a Pseudo-Random Number Generator (PRNG) based on the k-logistic map. The pseudo-random qualities of the proposed PRNG passed both tests successfully, i.e., DIEHARD and NIST, and were comparable with other traditional PRNGs such as the Mersenne Twister. The results suggest that simple maps such as the logistic map can be considered as good PRNG methods.

  8. A symbolic dynamics approach for the complexity analysis of chaotic pseudo-random sequences

    International Nuclear Information System (INIS)

    Xiao Fanghong

    2004-01-01

    By considering a chaotic pseudo-random sequence as a symbolic sequence, authors present a symbolic dynamics approach for the complexity analysis of chaotic pseudo-random sequences. The method is applied to the cases of Logistic map and one-way coupled map lattice to demonstrate how it works, and a comparison is made between it and the approximate entropy method. The results show that this method is applicable to distinguish the complexities of different chaotic pseudo-random sequences, and it is superior to the approximate entropy method

  9. Zone memories and pseudorandom addressing

    International Nuclear Information System (INIS)

    Marino, D.; Mirizzi, N.; Stella, R.; Visaggio, G.

    1975-01-01

    A quantitative comparison between zone memories, pseudorandom addressed memories and an alternative special purpose memory (spread zone memory) in which the distance between any two transformed descriptors, at first adjacent, is independent of the descriptors pair and results the maximum one is presented. This memory has not been particularly considered at present in spite of its efficiency and its simple implementation

  10. A Brain Computer Interface for Robust Wheelchair Control Application Based on Pseudorandom Code Modulated Visual Evoked Potential

    DEFF Research Database (Denmark)

    Mohebbi, Ali; Engelsholm, Signe K.D.; Puthusserypady, Sadasivan

    2015-01-01

    In this pilot study, a novel and minimalistic Brain Computer Interface (BCI) based wheelchair control application was developed. The system was based on pseudorandom code modulated Visual Evoked Potentials (c-VEPs). The visual stimuli in the scheme were generated based on the Gold code...

  11. A cubic map chaos criterion theorem with applications in generalized synchronization based pseudorandom number generator and image encryption.

    Science.gov (United States)

    Yang, Xiuping; Min, Lequan; Wang, Xue

    2015-05-01

    This paper sets up a chaos criterion theorem on a kind of cubic polynomial discrete maps. Using this theorem, Zhou-Song's chaos criterion theorem on quadratic polynomial discrete maps and generalized synchronization (GS) theorem construct an eight-dimensional chaotic GS system. Numerical simulations have been carried out to verify the effectiveness of theoretical results. The chaotic GS system is used to design a chaos-based pseudorandom number generator (CPRNG). Using FIPS 140-2 test suit/Generalized FIPS 140-2, test suit tests the randomness of two 1000 key streams consisting of 20 000 bits generated by the CPRNG, respectively. The results show that there are 99.9%/98.5% key streams to have passed the FIPS 140-2 test suit/Generalized FIPS 140-2 test. Numerical simulations show that the different keystreams have an average 50.001% same codes. The key space of the CPRNG is larger than 2(1345). As an application of the CPRNG, this study gives an image encryption example. Experimental results show that the linear coefficients between the plaintext and the ciphertext and the decrypted ciphertexts via the 100 key streams with perturbed keys are less than 0.00428. The result suggests that the decrypted texts via the keystreams generated via perturbed keys of the CPRNG are almost completely independent on the original image text, and brute attacks are needed to break the cryptographic system.

  12. Pseudo-random generator to allow to an electronic pulse simulator the ability to emulate radioisotopes spectra

    International Nuclear Information System (INIS)

    Lucianna F A; Carrillo M A; Mangussi M J

    2012-01-01

    The present work describes the development of a pseudo-random system to provide to a simulator pulse of radiation detectors the ability to emit pulses patterns similar to those recorded when measuring actual radioisotope. The idea is that the system can emulate characteristic spectral distributions of known radioisotopes, as well as creating individual spectra for specific purposes. This design is based on an improvement in terms of software from earlier development that only supplied predefined amplitude pulses at constant intervals (author)

  13. Pseudo-random data acquisition geometry in 3D seismic survey; Sanjigen jishin tansa ni okeru giji random data shutoku reiauto ni tsuite

    Energy Technology Data Exchange (ETDEWEB)

    Minegishi, M; Tsuburaya, Y [Japan National Oil Corp., Tokyo (Japan). Technology Research Center

    1996-10-01

    Influence of pseudo-random geometry on the imaging for 3D seismic exploration data acquisition has been investigate using a simple model by comparing with the regular geometry. When constituting wave front by the interference of elemental waves, pseudo-random geometry data did not always provide good results. In the case of a point diffractor, the imaging operation, where the constituted wave front was returned to the point diffractor by the interference of elemental waves for the spatial alias records, did not always give clear images. In the case of multi point diffractor, good images were obtained with less noise generation in spite of alias records. There are a lot of diffractors in the actual geological structures, which corresponds to the case of multi point diffractors. Finally, better images could be obtained by inputting records acquired using the pseudo-random geometry rather than by inputting spatial alias records acquired using the regular geometry. 7 refs., 6 figs.

  14. A cubic map chaos criterion theorem with applications in generalized synchronization based pseudorandom number generator and image encryption

    Energy Technology Data Exchange (ETDEWEB)

    Yang, Xiuping, E-mail: yangxiuping-1990@163.com; Min, Lequan, E-mail: minlequan@sina.com; Wang, Xue, E-mail: wangxue-20130818@163.com [Schools of Mathematics and Physics, University of Science and Technology Beijing, Beijing 100083 (China)

    2015-05-15

    This paper sets up a chaos criterion theorem on a kind of cubic polynomial discrete maps. Using this theorem, Zhou-Song's chaos criterion theorem on quadratic polynomial discrete maps and generalized synchronization (GS) theorem construct an eight-dimensional chaotic GS system. Numerical simulations have been carried out to verify the effectiveness of theoretical results. The chaotic GS system is used to design a chaos-based pseudorandom number generator (CPRNG). Using FIPS 140-2 test suit/Generalized FIPS 140-2, test suit tests the randomness of two 1000 key streams consisting of 20 000 bits generated by the CPRNG, respectively. The results show that there are 99.9%/98.5% key streams to have passed the FIPS 140-2 test suit/Generalized FIPS 140-2 test. Numerical simulations show that the different keystreams have an average 50.001% same codes. The key space of the CPRNG is larger than 2{sup 1345}. As an application of the CPRNG, this study gives an image encryption example. Experimental results show that the linear coefficients between the plaintext and the ciphertext and the decrypted ciphertexts via the 100 key streams with perturbed keys are less than 0.00428. The result suggests that the decrypted texts via the keystreams generated via perturbed keys of the CPRNG are almost completely independent on the original image text, and brute attacks are needed to break the cryptographic system.

  15. A high speed digital noise generator

    Science.gov (United States)

    Obrien, J.; Gaffney, B.; Liu, B.

    In testing of digital signal processing hardware, a high speed pseudo-random noise generator is often required to simulate an input noise source to the hardware. This allows the hardware to be exercised in a manner analogous to actual operating conditions. In certain radar and communication environments, a noise generator operating at speeds in excess of 60 MHz may be required. In this paper, a method of generating high speed pseudo-random numbers from an arbitrarily specified distribution (Gaussian, Log-Normal, etc.) using a transformation from a uniform noise source is described. A noise generator operating at 80 MHz has been constructed. Different distributions can be readily obtained by simply changing the ROM set. The hardware and test results will be described. Using this approach, the generation of pseudo-random sequences with arbitrary distributions at word rates in excess of 200 MHz can be readily achieved.

  16. Protocols for data hiding in pseudo-random state

    Science.gov (United States)

    Craver, Scott; Li, Enping; Yu, Jun

    2009-02-01

    An emerging form of steganographic communication uses ciphertext to replace the output of a random or strong pseudo-random number generator. PRNG-driven media, for example computer animated backdrops in video-conferencing channels, can then be used as a covert channel, if the PRNG bits that generated a piece of content can be estimated by the recipient. However, all bits sent over such a channel must be computationally indistinguishable from i.i.d. coin flips. Ciphertext messages and even key exchange datagrams are easily shaped to match this distribution; however, when placing these messages into a continous stream of PRNG bits, the sender is unable to provide synchronization markers, metadata, or error correction to ensure the message's location and proper decoding. In this paper we explore methods for message transmission and steganographic key exchange in such a "coin flip" channel. We establish that key exchange is generally not possible in this channel if an adversary possesses even a modest noise budget. If the warden is not vigilant in adding noise, however, communication is very simple.

  17. Variate generation for probabilistic fracture mechanics and fitness-for-service studies

    International Nuclear Information System (INIS)

    Walker, J.R.

    1987-01-01

    Atomic Energy of Canada Limited is conducting studies in Probabilistic Fracture Mechanics. These studies are being conducted as part of a fitness-for-service programme in support of CANDU reactors. The Monte Carlo analyses, which form part of the Probabilistic Fracture Mechanics studies, require that variates can be sampled from probability density functions. Accurate pseudo-random numbers are necessary for accurate variate generation. This report details the principles of variate generation, and describes the production and testing of pseudo-random numbers. A new algorithm has been produced for the correct performance of the lattice test for the independence of pseudo-random numbers. Two new pseudo-random number generators have been produced. These generators have excellent randomness properties and can be made fully machine-independent. Versions, in FORTRAN, for VAX and CDC computers are given. Accurate and efficient algorithms for the generation of variates from the specialized probability density functions of Probabilistic Fracture Mechanics are given. 38 refs

  18. Lensless digital holography with diffuse illumination through a pseudo-random phase mask.

    Science.gov (United States)

    Bernet, Stefan; Harm, Walter; Jesacher, Alexander; Ritsch-Marte, Monika

    2011-12-05

    Microscopic imaging with a setup consisting of a pseudo-random phase mask, and an open CMOS camera, without an imaging objective, is demonstrated. The pseudo random phase mask acts as a diffuser for an incoming laser beam, scattering a speckle pattern to a CMOS chip, which is recorded once as a reference. A sample which is afterwards inserted somewhere in the optical beam path changes the speckle pattern. A single (non-iterative) image processing step, comparing the modified speckle pattern with the previously recorded one, generates a sharp image of the sample. After a first calibration the method works in real-time and allows quantitative imaging of complex (amplitude and phase) samples in an extended three-dimensional volume. Since no lenses are used, the method is free from lens abberations. Compared to standard inline holography the diffuse sample illumination improves the axial sectioning capability by increasing the effective numerical aperture in the illumination path, and it suppresses the undesired so-called twin images. For demonstration, a high resolution spatial light modulator (SLM) is programmed to act as the pseudo-random phase mask. We show experimental results, imaging microscopic biological samples, e.g. insects, within an extended volume at a distance of 15 cm with a transverse and longitudinal resolution of about 60 μm and 400 μm, respectively.

  19. Pseudo-random tool paths for CNC sub-aperture polishing and other applications.

    Science.gov (United States)

    Dunn, Christina R; Walker, David D

    2008-11-10

    In this paper we first contrast classical and CNC polishing techniques in regard to the repetitiveness of the machine motions. We then present a pseudo-random tool path for use with CNC sub-aperture polishing techniques and report polishing results from equivalent random and raster tool-paths. The random tool-path used - the unicursal random tool-path - employs a random seed to generate a pattern which never crosses itself. Because of this property, this tool-path is directly compatible with dwell time maps for corrective polishing. The tool-path can be used to polish any continuous area of any boundary shape, including surfaces with interior perforations.

  20. Characterization of electron microscopes with binary pseudo-random multilayer test samples

    Science.gov (United States)

    Yashchuk, Valeriy V.; Conley, Raymond; Anderson, Erik H.; Barber, Samuel K.; Bouet, Nathalie; McKinney, Wayne R.; Takacs, Peter Z.; Voronov, Dmitriy L.

    2011-09-01

    Verification of the reliability of metrology data from high quality X-ray optics requires that adequate methods for test and calibration of the instruments be developed. For such verification for optical surface profilometers in the spatial frequency domain, a modulation transfer function (MTF) calibration method based on binary pseudo-random (BPR) gratings and arrays has been suggested [1,2] and proven to be an effective calibration method for a number of interferometric microscopes, a phase shifting Fizeau interferometer, and a scatterometer [5]. Here we describe the details of development of binary pseudo-random multilayer (BPRML) test samples suitable for characterization of scanning (SEM) and transmission (TEM) electron microscopes. We discuss the results of TEM measurements with the BPRML test samples fabricated from a WiSi 2/Si multilayer coating with pseudo-randomly distributed layers. In particular, we demonstrate that significant information about the metrological reliability of the TEM measurements can be extracted even when the fundamental frequency of the BPRML sample is smaller than the Nyquist frequency of the measurements. The measurements demonstrate a number of problems related to the interpretation of the SEM and TEM data. Note that similar BPRML test samples can be used to characterize X-ray microscopes. Corresponding work with X-ray microscopes is in progress.

  1. Characterization of electron microscopes with binary pseudo-random multilayer test samples

    International Nuclear Information System (INIS)

    Yashchuk, Valeriy V.; Conley, Raymond; Anderson, Erik H.; Barber, Samuel K.; Bouet, Nathalie; McKinney, Wayne R.; Takacs, Peter Z.; Voronov, Dmitriy L.

    2011-01-01

    Verification of the reliability of metrology data from high quality X-ray optics requires that adequate methods for test and calibration of the instruments be developed. For such verification for optical surface profilometers in the spatial frequency domain, a modulation transfer function (MTF) calibration method based on binary pseudo-random (BPR) gratings and arrays has been suggested and proven to be an effective calibration method for a number of interferometric microscopes, a phase shifting Fizeau interferometer, and a scatterometer [5]. Here we describe the details of development of binary pseudo-random multilayer (BPRML) test samples suitable for characterization of scanning (SEM) and transmission (TEM) electron microscopes. We discuss the results of TEM measurements with the BPRML test samples fabricated from a WiSi 2 /Si multilayer coating with pseudo-randomly distributed layers. In particular, we demonstrate that significant information about the metrological reliability of the TEM measurements can be extracted even when the fundamental frequency of the BPRML sample is smaller than the Nyquist frequency of the measurements. The measurements demonstrate a number of problems related to the interpretation of the SEM and TEM data. Note that similar BPRML test samples can be used to characterize X-ray microscopes. Corresponding work with X-ray microscopes is in progress.

  2. Generation of pseudo-random numbers

    Science.gov (United States)

    Howell, L. W.; Rheinfurth, M. H.

    1982-01-01

    Practical methods for generating acceptable random numbers from a variety of probability distributions which are frequently encountered in engineering applications are described. The speed, accuracy, and guarantee of statistical randomness of the various methods are discussed.

  3. Measuring long impulse responses with pseudorandom sequences and sweep signals

    DEFF Research Database (Denmark)

    Torras Rosell, Antoni; Jacobsen, Finn

    2010-01-01

    In architectural acoustics, background noise, loudspeaker nonlinearities, and time variances are the most common disturbances that can compromise a measurement. The effects of such disturbances on measurement of long impulse responses with pseudorandom sequences (maximum-length sequences (MLS) an...

  4. Design of Long Period Pseudo-Random Sequences from the Addition of -Sequences over

    Directory of Open Access Journals (Sweden)

    Ren Jian

    2004-01-01

    Full Text Available Pseudo-random sequence with good correlation property and large linear span is widely used in code division multiple access (CDMA communication systems and cryptology for reliable and secure information transmission. In this paper, sequences with long period, large complexity, balance statistics, and low cross-correlation property are constructed from the addition of -sequences with pairwise-prime linear spans (AMPLS. Using -sequences as building blocks, the proposed method proved to be an efficient and flexible approach to construct long period pseudo-random sequences with desirable properties from short period sequences. Applying the proposed method to , a signal set is constructed.

  5. Pseudorandom binary injection of levitons for electron quantum optics

    Science.gov (United States)

    Glattli, D. C.; Roulleau, P.

    2018-03-01

    The recent realization of single-electron sources lets us envision performing electron quantum optics experiments, where electrons can be viewed as flying qubits propagating in a ballistic conductor. To date, all electron sources operate in a periodic electron injection mode, leading to energy spectrum singularities in various physical observables which sometimes hide the bare nature of physical effects. To go beyond this, we propose a spread-spectrum approach where electron flying qubits are injected in a nonperiodic manner following a pseudorandom binary bit pattern. Extending the Floquet scattering theory approach from periodic to spread-spectrum drive, the shot noise of pseudorandom binary sequences of single-electron injection can be calculated for leviton and nonleviton sources. Our new approach allows us to disentangle the physics of the manipulated excitations from that of the injection protocol. In particular, the spread-spectrum approach is shown to provide better knowledge of electronic Hong-Ou-Mandel correlations and to clarify the nature of the pulse train coherence and the role of the dynamical orthogonality catastrophe for noninteger charge injection.

  6. Test Pattern Generator for Mixed Mode BIST

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Hong Sik; Lee, Hang Kyu; Kang, Sung Ho [Yonsei University (Korea, Republic of)

    1998-07-01

    As the increasing integrity of VLSI, the BIST (Built-In Self Test) is used as an effective method to test chips. Generally the pseudo-random test pattern generation is used for BIST. But it requires lots of test patterns when there exist random resistant faults. Therefore deterministic testing is an interesting BIST technique due to the minimal number of test patterns and to its high fault coverage. However this is not applicable since the existing deterministic test pattern generators require too much area overhead despite their efficiency. Therefore we propose a mixed test scheme which applies to the circuit under test, a deterministic test sequence followed by a pseudo-random one. This scheme allows the maximum fault coverage detection to be achieved, furthermore the silicon area overhead of the mixed hardware generator can be reduced. The deterministic test generator is made with a finite state machine and a pseudo-random test generator is made with LFSR(linear feedback shift register). The results of ISCAS circuits show that the maximum fault coverage is guaranteed with small number of test set and little hardware overhead. (author). 15 refs., 10 figs., 4 tabs.

  7. Computer simulation of different designs of pseudo-random time-of-flight velocity analysers for molecular beam scattering experiments

    International Nuclear Information System (INIS)

    Rotzoll, G.

    1982-01-01

    After a brief summary of the pseudo-random time-of-flight (TOF) method, the design criteria for construction of a pseudo-random TOF disc are considered and complemented by computer simulations. The question of resolution and the choice of the sequence length and number of time channels per element are discussed. Moreover, the stability requirements of the chopper motor frequency are investigated. (author)

  8. Preliminary study of pseudorandom binary sequence pulsing of ORELA

    International Nuclear Information System (INIS)

    Larson, N.M.; Olsen, D.K.

    1980-03-01

    It has been suggested that pseudorandom binary sequence (PRBS) pulsing might enhance the performance of the Oak Ridge Electron Linear Accelerator (ORELA) for neutron-induced, time-of-flight (TOF) cross-section measurements. In this technical memorandum, equations are developed for expected count rates, statistical variances, and backgrounds for a pulsing scheme in which a PRBS is superimposed on the periodic equalintensity ORELA bursts. Introduction of the PRBS modification permits neutrons of different energies originating from different bursts to reach the detector simultaneously, and the signal corresponding to a unique flight time to be extracted mathematically. Relative advantages and disadvantages of measurements from conventional and PRBS pulsing modes are discussed in terms of counting statistics and backgrounds. Computer models of TOF spectra are generated for both pulsing modes, using as examples a 20-meter 233 U fission-chamber measurement and a 155-meter 238 U sample-in transmission measurement. Detailed comparisons of PRBS vs conventional results are presented. This study indicates that although PRBS pulsing could enhance ORELA performance for selected measurements, for general ORELA operation the disadvantages from PRBS pulsing probably outweigh the advantages

  9. Cardiorespiratory Kinetics Determined by Pseudo-Random Binary Sequences - Comparisons between Walking and Cycling.

    Science.gov (United States)

    Koschate, J; Drescher, U; Thieschäfer, L; Heine, O; Baum, K; Hoffmann, U

    2016-12-01

    This study aims to compare cardiorespiratory kinetics as a response to a standardised work rate protocol with pseudo-random binary sequences between cycling and walking in young healthy subjects. Muscular and pulmonary oxygen uptake (V̇O 2 ) kinetics as well as heart rate kinetics were expected to be similar for walking and cycling. Cardiac data and V̇O 2 of 23 healthy young subjects were measured in response to pseudo-random binary sequences. Kinetics were assessed applying time series analysis. Higher maxima of cross-correlation functions between work rate and the respective parameter indicate faster kinetics responses. Muscular V̇O 2 kinetics were estimated from heart rate and pulmonary V̇O 2 using a circulatory model. Muscular (walking vs. cycling [mean±SD in arbitrary units]: 0.40±0.08 vs. 0.41±0.08) and pulmonary V̇O 2 kinetics (0.35±0.06 vs. 0.35±0.06) were not different, although the time courses of the cross-correlation functions of pulmonary V̇O 2 showed unexpected biphasic responses. Heart rate kinetics (0.50±0.14 vs. 0.40±0.14; P=0.017) was faster for walking. Regarding the biphasic cross-correlation functions of pulmonary V̇O 2 during walking, the assessment of muscular V̇O 2 kinetics via pseudo-random binary sequences requires a circulatory model to account for cardio-dynamic distortions. Faster heart rate kinetics for walking should be considered by comparing results from cycle and treadmill ergometry. © Georg Thieme Verlag KG Stuttgart · New York.

  10. Generating k-independent variables in constant time

    DEFF Research Database (Denmark)

    Christiani, Tobias Lybecker; Pagh, Rasmus

    2014-01-01

    The generation of pseudorandom elements over finite fields is fundamental to the time, space and randomness complexity of randomized algorithms and data structures. We consider the problem of generating k-independent random values over a finite field F in a word RAM model equipped with constant...

  11. Quasi-Coherent Noise Jamming to LFM Radar Based on Pseudo-random Sequence Phase-modulation

    Directory of Open Access Journals (Sweden)

    N. Tai

    2015-12-01

    Full Text Available A novel quasi-coherent noise jamming method is proposed against linear frequency modulation (LFM signal and pulse compression radar. Based on the structure of digital radio frequency memory (DRFM, the jamming signal is acquired by the pseudo-random sequence phase-modulation of sampled radar signal. The characteristic of jamming signal in time domain and frequency domain is analyzed in detail. Results of ambiguity function indicate that the blanket jamming effect along the range direction will be formed when jamming signal passes through the matched filter. By flexible controlling the parameters of interrupted-sampling pulse and pseudo-random sequence, different covering distances and jamming effects will be achieved. When the jamming power is equivalent, this jamming obtains higher process gain compared with non-coherent jamming. The jamming signal enhances the detection threshold and the real target avoids being detected. Simulation results and circuit engineering implementation validate that the jamming signal covers real target effectively.

  12. Design of Long Period Pseudo-Random Sequences from the Addition of m -Sequences over 𝔽 p

    Directory of Open Access Journals (Sweden)

    Ren Jian

    2004-01-01

    Full Text Available Pseudo-random sequence with good correlation property and large linear span is widely used in code division multiple access (CDMA communication systems and cryptology for reliable and secure information transmission. In this paper, sequences with long period, large complexity, balance statistics, and low cross-correlation property are constructed from the addition of m -sequences with pairwise-prime linear spans (AMPLS. Using m -sequences as building blocks, the proposed method proved to be an efficient and flexible approach to construct long period pseudo-random sequences with desirable properties from short period sequences. Applying the proposed method to 𝔽 2 , a signal set ( ( 2 n − 1 ( 2 m − 1 , ( 2 n + 1 ( 2 m + 1 , ( 2 ( n + 1 / 2 + 1 ( 2 ( m + 1 / 2 + 1 is constructed.

  13. Pseudo-random Aloha for inter-frame soft combining in RFID systems

    DEFF Research Database (Denmark)

    Castiglione, Paolo; Ricciato, Fabio; Popovski, Petar

    2013-01-01

    In this work we consider a recently proposed variant of the classical Framed Slotted-ALOHA where slot selection is based on a pseudo-random function of the message to be transmitted and of the frame index. We couple this feature with convolutional encoding, that allows to perform Inter-frame Soft...... cancellation (instead of combining). Numerical simulation results show that the ISoC scheme brings a noticeable throughput gain over traditional schemes in a dense RFID scenario with multiple concurrent Tag transmissions....

  14. Parallel random number generator for inexpensive configurable hardware cells

    Science.gov (United States)

    Ackermann, J.; Tangen, U.; Bödekker, B.; Breyer, J.; Stoll, E.; McCaskill, J. S.

    2001-11-01

    A new random number generator ( RNG) adapted to parallel processors has been created. This RNG can be implemented with inexpensive hardware cells. The correlation between neighboring cells is suppressed with smart connections. With such connection structures, sequences of pseudo-random numbers are produced. Numerical tests including a self-avoiding random walk test and the simulation of the order parameter and energy of the 2D Ising model give no evidence for correlation in the pseudo-random sequences. Because the new random number generator has suppressed the correlation between neighboring cells which is usually observed in cellular automaton implementations, it is applicable for extended time simulations. It gives an immense speed-up factor if implemented directly in configurable hardware, and has recently been used for long time simulations of spatially resolved molecular evolution.

  15. Non-linear M -sequences Generation Method

    Directory of Open Access Journals (Sweden)

    Z. R. Garifullina

    2011-06-01

    Full Text Available The article deals with a new method for modeling a pseudorandom number generator based on R-blocks. The gist of the method is the replacement of a multi digit XOR element by a stochastic adder in a parallel binary linear feedback shift register scheme.

  16. Planet map generation by tetrahedral subdivision

    DEFF Research Database (Denmark)

    Mogensen, Torben Ægidius

    2010-01-01

    We present a method for generating pseudo-random, zoomable planet maps for games and art.  The method is based on spatial subdivision using tetrahedrons.  This ensures planet maps without discontinuities caused by mapping a flat map onto a sphere. We compare the method to other map...

  17. Chaotic generation of PN sequences : a VLSI implementation

    NARCIS (Netherlands)

    Dornbusch, A.; Pineda de Gyvez, J.

    1999-01-01

    Generation of repeatable pseudo-random sequences with chaotic analog electronics is not feasible using standard circuit topologies. Component variation caused by imperfect fabrication causes the same divergence of output sequences as does varying initial conditions. By quantizing the output of a

  18. Anosov C-systems and random number generators

    Science.gov (United States)

    Savvidy, G. K.

    2016-08-01

    We further develop our previous proposal to use hyperbolic Anosov C-systems to generate pseudorandom numbers and to use them for efficient Monte Carlo calculations in high energy particle physics. All trajectories of hyperbolic dynamical systems are exponentially unstable, and C-systems therefore have mixing of all orders, a countable Lebesgue spectrum, and a positive Kolmogorov entropy. These exceptional ergodic properties follow from the C-condition introduced by Anosov. This condition defines a rich class of dynamical systems forming an open set in the space of all dynamical systems. An important property of C-systems is that they have a countable set of everywhere dense periodic trajectories and their density increases exponentially with entropy. Of special interest are the C-systems defined on higher-dimensional tori. Such C-systems are excellent candidates for generating pseudorandom numbers that can be used in Monte Carlo calculations. An efficient algorithm was recently constructed that allows generating long C-system trajectories very rapidly. These trajectories have good statistical properties and can be used for calculations in quantum chromodynamics and in high energy particle physics.

  19. Quantum random number generator

    Science.gov (United States)

    Soubusta, Jan; Haderka, Ondrej; Hendrych, Martin

    2001-03-01

    Since reflection or transmission of a quantum particle on a beamsplitter is inherently random quantum process, a device built on this principle does not suffer from drawbacks of neither pseudo-random computer generators or classical noise sources. Nevertheless, a number of physical conditions necessary for high quality random numbers generation must be satisfied. Luckily, in quantum optics realization they can be well controlled. We present an easy random number generator based on the division of weak light pulses on a beamsplitter. The randomness of the generated bit stream is supported by passing the data through series of 15 statistical test. The device generates at a rate of 109.7 kbit/s.

  20. Multiplicative congruential generators, their lattice structure, its relation to lattice-sublattice transformations and applications in crystallography

    Science.gov (United States)

    Hornfeck, W.; Harbrecht, B.

    2009-11-01

    An analysis of certain types of multiplicative congruential generators - otherwise known for their application to the sequential generation of pseudo-random numbers - reveals their relation to lattice-sublattice transformations and the coordinate description of crystal structures.

  1. Response inhibition during cue reactivity in problem gamblers: an fMRI study.

    Directory of Open Access Journals (Sweden)

    Ruth J van Holst

    Full Text Available Disinhibition over drug use, enhanced salience of drug use and decreased salience of natural reinforcers are thought to play an important role substance dependence. Whether this is also true for pathological gambling is unclear. To understand the effects of affective stimuli on response inhibition in problem gamblers (PRGs, we designed an affective Go/Nogo to examine the interaction between response inhibition and salience attribution in 16 PRGs and 15 healthy controls (HCs.Four affective blocks were presented with Go trials containing neutral, gamble, positive or negative affective pictures. The No-Go trials in these blocks contained neutral pictures. Outcomes of interest included percentage of impulsive errors and mean reaction times in the different blocks. Brain activity related to No-Go trials was assessed to measure response inhibition in the various affective conditions and brain activity related to Go trials was assessed to measure salience attribution.PRGs made fewer errors during gamble and positive trials than HCs, but were slower during all trials types. Compared to HCs, PRGs activated the dorsolateral prefrontal cortex, anterior cingulate and ventral striatum to a greater extent while viewing gamble pictures. The dorsal lateral and inferior frontal cortex were more activated in PRGs than in HCs while viewing positive and negative pictures. During neutral inhibition, PRGs were slower but similar in accuracy to HCs, and showed more dorsolateral prefrontal and anterior cingulate cortex activity. In contrast, during gamble and positive pictures PRGs performed better than HCs, and showed lower activation of the dorsolateral and anterior cingulate cortex.This study shows that gambling-related stimuli are more salient for PRGs than for HCs. PRGs seem to rely on compensatory brain activity to achieve similar performance during neutral response inhibition. A gambling-related or positive context appears to facilitate response inhibition as

  2. Generation of Random Numbers and Parallel Random Number Streams for Monte Carlo Simulations

    Directory of Open Access Journals (Sweden)

    L. Yu. Barash

    2012-01-01

    Full Text Available Modern methods and libraries for high quality pseudorandom number generation and for generation of parallel random number streams for Monte Carlo simulations are considered. The probability equidistribution property and the parameters when the property holds at dimensions up to logarithm of mesh size are considered for Multiple Recursive Generators.

  3. Cognitive Architecture for Direction of Attention Founded on Subliminal Memory Searches, Pseudorandom and Nonstop

    OpenAIRE

    Burger, J. R.

    2008-01-01

    By way of explaining how a brain works logically, human associative memory is modeled with logical and memory neurons, corresponding to standard digital circuits. The resulting cognitive architecture incorporates basic psychological elements such as short term and long term memory. Novel to the architecture are memory searches using cues chosen pseudorandomly from short term memory. Recalls alternated with sensory images, many tens per second, are analyzed subliminally as an ongoing process, ...

  4. Study on random number generator in Monte Carlo code

    International Nuclear Information System (INIS)

    Oya, Kentaro; Kitada, Takanori; Tanaka, Shinichi

    2011-01-01

    The Monte Carlo code uses a sequence of pseudo-random numbers with a random number generator (RNG) to simulate particle histories. A pseudo-random number has its own period depending on its generation method and the period is desired to be long enough not to exceed the period during one Monte Carlo calculation to ensure the correctness especially for a standard deviation of results. The linear congruential generator (LCG) is widely used as Monte Carlo RNG and the period of LCG is not so long by considering the increasing rate of simulation histories in a Monte Carlo calculation according to the remarkable enhancement of computer performance. Recently, many kinds of RNG have been developed and some of their features are better than those of LCG. In this study, we investigate the appropriate RNG in a Monte Carlo code as an alternative to LCG especially for the case of enormous histories. It is found that xorshift has desirable features compared with LCG, and xorshift has a larger period, a comparable speed to generate random numbers, a better randomness, and good applicability to parallel calculation. (author)

  5. Calibration of Modulation Transfer Function of Surface Profilometers with 1D and 2D Binary Pseudo-random Array Standards

    International Nuclear Information System (INIS)

    Yashchuk, Valeriy V.; McKinney, Wayne R.; Takacs, Peter Z.

    2008-01-01

    We suggest and describe the use of a binary pseudo-random grating as a standard test surface for calibration of the modulation transfer function of microscopes. Results from calibration of a MicromapTM-570 interferometric microscope are presented.

  6. A comparative study of pseudorandom sequences used in a c-VEP based BCI for online wheelchair control

    DEFF Research Database (Denmark)

    Isaksen, Jonas L.; Mohebbi, Ali; Puthusserypady, Sadasivan

    2016-01-01

    In this study, a c-VEP based BCI system was developed to run on three distinctive pseudorandom sequences, namely the m-code, the Gold-code, and the Barker-code. The Visual Evoked Potentials (VEPs) were provoked using these codes. In the online session, subjects controlled a LEGO® Mindstorms® robot...

  7. The impact of patient participation direct enhanced service on patient reference groups in primary care: a qualitative study.

    Science.gov (United States)

    Pollard, Lorraine; Agarwal, Shona; Harrad, Fawn; Lester, Louise; Cross, Ainsley; Wray, Paula; Smith, Gordon; Locke, Anthony; Sinfield, Paul

    2014-01-01

    NHS policy documents continue to make a wide-ranging commitment to patient involvement. The Patient Participation Direct Enhanced Service (PP-DES), launched in 2011, aimed to ensure patients are involved in decisions about the range and quality of services provided and commissioned by their practice through patient reference groups (PRGs). The aim of this exploratory study is to review the impact of the PP-DES (2011-13) on a sample of PRGs and assess how far it has facilitated their involvement in decisions about the services of their general practices. A qualitative methods design, using semi- structured interviews and focus groups, was employed to explore the experiences and views of GP practice staff (n = 24), PRG members (n = 80) at 12 GP practices, and other stakeholders (n = 4). Wide variation in the role and remit of the participating PRGs was found, which broadly ranged from activities to improve practice resources to supporting health promotion activities. The majority of PRG members were unfamiliar with the PP-DES scheme and its aims and purpose. Stakeholders and practice staff felt strongly that the main success of the PP-DES was that it had led to an increase in the number of PRGs being established in the locality. The PP-DES scheme has been a catalyst to establish PRGs. However, the picture was mixed in terms of the PRGs involvement in decisions about the services provided at their general practice as there was wide variation in the PRGs role and remit. The financial incentive alone, provided via the DES scheme, did not secure greater depth of PRG activity and power, however, as social factors were identified as playing an important role in PRGs' level of participation in decision making. Many PRGs have to become more firmly established before they are involved as partners in commissioning decisions at their practice.

  8. Binary pseudorandom test standard to determine the modulation transfer function of optical microscopes

    Science.gov (United States)

    Lacey, Ian; Anderson, Erik H.; Artemiev, Nikolay A.; Babin, Sergey; Cabrini, Stefano; Calafiore, Guiseppe; Chan, Elaine R.; McKinney, Wayne R.; Peroz, Christophe; Takacs, Peter Z.; Yashchuk, Valeriy V.

    2015-09-01

    This work reports on the development of a binary pseudo-random test sample optimized to calibrate the MTF of optical microscopes. The sample consists of a number of 1-D and 2-D patterns, with different minimum sizes of spatial artifacts from 300 nm to 2 microns. We describe the mathematical background, fabrication process, data acquisition and analysis procedure to return spatial frequency based instrument calibration. We show that the developed samples satisfy the characteristics of a test standard: functionality, ease of specification and fabrication, reproducibility, and low sensitivity to manufacturing error.

  9. Nonquadratic Variation of the Blum Blum Shub Pseudorandom Number Generator

    Science.gov (United States)

    2016-09-01

    analyzes it for repetition and periodic behavior . Theoretically, in a random sequence , 95 percent of the values will not exceed T , where T is given by the...excursion of random walks within a sequence . A random walk can be defined in terms of a graph. First, this test changes all zeroes within the tested...Technology (NIST) tests. The original BBS is a quadratic generator that generates bits based on the output of squaring terms in a sequence . The first

  10. 75 FR 984 - Draft Recommended Interim Preliminary Remediation Goals for Dioxin in Soil at CERCLA and RCRA Sites

    Science.gov (United States)

    2010-01-07

    ...The Environmental Protection Agency (EPA or the Agency) is announcing a 50-day public comment period for draft recommended interim preliminary remediation goals (PRGs) developed in the Draft Recommended Interim Preliminary Remediation Goals for Dioxin in Soil at Comprehensive Environmental Response, Compensation, and Liability Act (CERCLA) and Resource Conservation and Recovery Act (RCRA) Sites. EPA's Office of Solid Waste and Emergency and Emergency Response (OSWER) has developed the draft recommended interim PRGs for dioxin in soil. These draft recommended interim PRGs were calculated using existing, peer- reviewed toxicity values and current EPA equations and default exposure assumptions. This Federal Register notice is intended to provide an opportunity for public comment on the draft recommended interim PRGs. EPA will consider any public comments submitted in accordance with this notice and may revise the draft recommended interim PRGs thereafter.

  11. Thermal-hydraulic study of fixed bed nuclear reactor (FBNR), in FCC, BCC and pseudo-random configurations of the core through CFD method

    International Nuclear Information System (INIS)

    Luna, M.; Chavez, I.; Cajas, D.; Santos, R.

    2015-01-01

    The study of thermal-hydraulic performance of a fixed bed nuclear reactor (FBNR) core and the effect of the porosity was studied by the CFD method with 'SolidWorks' software. The representative sections of three different packed beds arrangements were analyzed: face-centered cubic (FCC), body-centered cubic (BCC), and a pseudo-random, with values of porosity of 0.28, 0.33 and 0.53 respectively. The minimum coolant flow required to avoid the phase change for each one of the configurations was determined. The results show that the heat transfer rate increases when the porosity value decreases, and consequently the minimum coolant flow in each configuration. The results of minimum coolant flow were: 728.51 kg/s for the FCC structure, 372.72 kg/s for the BCC, and 304.96 kg/s for the pseudo-random. Meanwhile, the heat transfer coefficients in each packed bed were 6480 W/m 2 *K, 3718 W/m 2 *K and 3042 W/m 2 *K respectively. Finally the pressure drop was calculated, and the results were 0.588 MPa for FCC configuration, 0.033 MPa for BCC and 0.017 MPa for the pseudo-random one. This means that with a higher porosity, the fluid can circulate easier because there are fewer obstacles to cross, so there are fewer energy losses. (authors)

  12. On random number generators providing convergence more rapid than 1/√N

    International Nuclear Information System (INIS)

    Belov, V.A.

    1982-01-01

    To realize the simulation of processes in High Energy Physics a practical test of the efficiency in applying quasirandom numbers to check multiple integration with Monte-Karlo method is presented together with the comparison of the wellknown generators of quasirandom and pseudorandom numbers [ru

  13. PRIMITIVE MATRICES AND GENERATORS OF PSEUDO RANDOM SEQUENCES OF GALOIS

    Directory of Open Access Journals (Sweden)

    A. Beletsky

    2014-04-01

    Full Text Available In theory and practice of information cryptographic protection one of the key problems is the forming a binary pseudo-random sequences (PRS with a maximum length with acceptable statistical characteristics. PRS generators are usually implemented by linear shift register (LSR of maximum period with linear feedback [1]. In this paper we extend the concept of LSR, assuming that each of its rank (memory cell can be in one of the following condition. Let’s call such registers “generalized linear shift register.” The research goal is to develop algorithms for constructing Galois and Fibonacci generalized matrix of n-order over the field , which uniquely determined both the structure of corresponding generalized of n-order LSR maximal period, and formed on their basis Galois PRS generators of maximum length. Thus the article presents the questions of formation the primitive generalized Fibonacci and Galois arbitrary order matrix over the prime field . The synthesis of matrices is based on the use of irreducible polynomials of degree and primitive elements of the extended field generated by polynomial. The constructing methods of Galois and Fibonacci conjugated primitive matrices are suggested. The using possibilities of such matrices in solving the problem of constructing generalized generators of Galois pseudo-random sequences are discussed.

  14. Efficient pseudo-random number generation for monte-carlo simulations using graphic processors

    Science.gov (United States)

    Mohanty, Siddhant; Mohanty, A. K.; Carminati, F.

    2012-06-01

    A hybrid approach based on the combination of three Tausworthe generators and one linear congruential generator for pseudo random number generation for GPU programing as suggested in NVIDIA-CUDA library has been used for MONTE-CARLO sampling. On each GPU thread, a random seed is generated on fly in a simple way using the quick and dirty algorithm where mod operation is not performed explicitly due to unsigned integer overflow. Using this hybrid generator, multivariate correlated sampling based on alias technique has been carried out using both CUDA and OpenCL languages.

  15. Efficient pseudo-random number generation for Monte-Carlo simulations using graphic processors

    International Nuclear Information System (INIS)

    Mohanty, Siddhant; Mohanty, A K; Carminati, F

    2012-01-01

    A hybrid approach based on the combination of three Tausworthe generators and one linear congruential generator for pseudo random number generation for GPU programing as suggested in NVIDIA-CUDA library has been used for MONTE-CARLO sampling. On each GPU thread, a random seed is generated on fly in a simple way using the quick and dirty algorithm where mod operation is not performed explicitly due to unsigned integer overflow. Using this hybrid generator, multivariate correlated sampling based on alias technique has been carried out using both CUDA and OpenCL languages.

  16. Generation and reception of spread-spectrum signals

    Science.gov (United States)

    Moser, R.

    1983-05-01

    The term 'spread-spectrum' implies a technique whereby digitized information is added to a pseudo-random number sequence and the resultant bit stream changes some parameter of the carrier frequency in discrete increments. The discrete modulation of the carrier frequency is usually realized either as a multiple level phase shift keyed or frequency shift keyed signal. The resultant PSK-modulated frequency spectrum is referred to as direct sequence spread-spectrum, whereas the FSK-modulated carrier frequency is referred to as a frequency hopped spread spectrum. These can be considered the major subsets of the more general term 'spread-spectrum'. In discussing signal reception, it is pointed out that active correlation methods are used for channel synchronization when the psuedo random sequences are long or when the processing gain is large, whereas the passive methods may be used for either short pseudo-random noise generation codes or to assist in attaining initial synchronization in long sequence spread-spectrum systems.

  17. An integrable low-cost hardware random number generator

    Science.gov (United States)

    Ranasinghe, Damith C.; Lim, Daihyun; Devadas, Srinivas; Jamali, Behnam; Zhu, Zheng; Cole, Peter H.

    2005-02-01

    A hardware random number generator is different from a pseudo-random number generator; a pseudo-random number generator approximates the assumed behavior of a real hardware random number generator. Simple pseudo random number generators suffices for most applications, however for demanding situations such as the generation of cryptographic keys, requires an efficient and a cost effective source of random numbers. Arbiter-based Physical Unclonable Functions (PUFs) proposed for physical authentication of ICs exploits statistical delay variation of wires and transistors across integrated circuits, as a result of process variations, to build a secret key unique to each IC. Experimental results and theoretical studies show that a sufficient amount of variation exits across IC"s. This variation enables each IC to be identified securely. It is possible to exploit the unreliability of these PUF responses to build a physical random number generator. There exists measurement noise, which comes from the instability of an arbiter when it is in a racing condition. There exist challenges whose responses are unpredictable. Without environmental variations, the responses of these challenges are random in repeated measurements. Compared to other physical random number generators, the PUF-based random number generators can be a compact and a low-power solution since the generator need only be turned on when required. A 64-stage PUF circuit costs less than 1000 gates and the circuit can be implemented using a standard IC manufacturing processes. In this paper we have presented a fast and an efficient random number generator, and analysed the quality of random numbers produced using an array of tests used by the National Institute of Standards and Technology to evaluate the randomness of random number generators designed for cryptographic applications.

  18. Random Generators and Normal Numbers

    OpenAIRE

    Bailey, David H.; Crandall, Richard E.

    2002-01-01

    Pursuant to the authors' previous chaotic-dynamical model for random digits of fundamental constants, we investigate a complementary, statistical picture in which pseudorandom number generators (PRNGs) are central. Some rigorous results are achieved: We establish b-normality for constants of the form $\\sum_i 1/(b^{m_i} c^{n_i})$ for certain sequences $(m_i), (n_i)$ of integers. This work unifies and extends previously known classes of explicit normals. We prove that for coprime $b,c>1$ the...

  19. Pulse Compression Techniques for Laser Generated Ultrasound

    Science.gov (United States)

    Anastasi, R. F.; Madaras, E. I.

    1999-01-01

    Laser generated ultrasound for nondestructive evaluation has an optical power density limit due to rapid high heating that causes material damage. This damage threshold limits the generated ultrasound amplitude, which impacts nondestructive evaluation inspection capability. To increase ultrasound signal levels and improve the ultrasound signal-to-noise ratio without exceeding laser power limitations, it is possible to use pulse compression techniques. The approach illustrated here uses a 150mW laser-diode modulated with a pseudo-random sequence and signal correlation. Results demonstrate the successful generation of ultrasonic bulk waves in aluminum and graphite-epoxy composite materials using a modulated low-power laser diode and illustrate ultrasound bandwidth control.

  20. Pseudo random number generator based on quantum chaotic map

    Science.gov (United States)

    Akhshani, A.; Akhavan, A.; Mobaraki, A.; Lim, S.-C.; Hassan, Z.

    2014-01-01

    For many years dissipative quantum maps were widely used as informative models of quantum chaos. In this paper, a new scheme for generating good pseudo-random numbers (PRNG), based on quantum logistic map is proposed. Note that the PRNG merely relies on the equations used in the quantum chaotic map. The algorithm is not complex, which does not impose high requirement on computer hardware and thus computation speed is fast. In order to face the challenge of using the proposed PRNG in quantum cryptography and other practical applications, the proposed PRNG is subjected to statistical tests using well-known test suites such as NIST, DIEHARD, ENT and TestU01. The results of the statistical tests were promising, as the proposed PRNG successfully passed all these tests. Moreover, the degree of non-periodicity of the chaotic sequences of the quantum map is investigated through the Scale index technique. The obtained result shows that, the sequence is more non-periodic. From these results it can be concluded that, the new scheme can generate a high percentage of usable pseudo-random numbers for simulation and other applications in scientific computing.

  1. Scope of Various Random Number Generators in ant System Approach for TSP

    Science.gov (United States)

    Sen, S. K.; Shaykhian, Gholam Ali

    2007-01-01

    Experimented on heuristic, based on an ant system approach for traveling salesman problem, are several quasi- and pseudo-random number generators. This experiment is to explore if any particular generator is most desirable. Such an experiment on large samples has the potential to rank the performance of the generators for the foregoing heuristic. This is mainly to seek an answer to the controversial issue "which generator is the best in terms of quality of the result (accuracy) as well as cost of producing the result (time/computational complexity) in a probabilistic/statistical sense."

  2. Binary pseudorandom test standard to determine the modulation transfer function of optical microscopes

    Energy Technology Data Exchange (ETDEWEB)

    Novak, Erik; Trolinger, James D.; Lacey, Ian; Anderson, Erik H.; Artemiev, Nikolay A.; Babin, Sergey; Cabrini, Stefano; Calafiore, Guiseppe; Chan, Elaine R.; McKinney, Wayne R.; Peroz, Christophe; Takacs, Peter Z.; Yashchuk, Valeriy V.

    2015-09-01

    This work reports on the development of a binary pseudo-random test sample optimized to calibrate the MTF of optical microscopes. The sample consists of a number of 1-D and 2-D patterns, with different minimum sizes of spatial artifacts from 300 nm to 2 microns. We describe the mathematical background, fabrication process, data acquisition and analysis procedure to return spatial frequency based instrument calibration. We show that the developed samples satisfy the characteristics of a test standard: functionality, ease of specification and fabrication, reproducibility, and low sensitivity to manufacturing error. © (2015) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.

  3. Pseudo-Random Modulation of a Laser Diode for Generating Ultrasonic Longitudinal Waves

    Science.gov (United States)

    Madaras, Eric I.; Anatasi, Robert F.

    2004-01-01

    Laser generated ultrasound systems have historically been more complicated and expensive than conventional piezoelectric based systems, and this fact has relegated the acceptance of laser based systems to niche applications for which piezoelectric based systems are less suitable. Lowering system costs, while improving throughput, increasing ultrasound signal levels, and improving signal-to-noise are goals which will help increase the general acceptance of laser based ultrasound. One current limitation with conventional laser generated ultrasound is a material s damage threshold limit. Increasing the optical power to generate more signal eventually damages the material being tested due to rapid, high heating. Generation limitations for laser based ultrasound suggests the use of pulse modulation techniques as an alternate generation method. Pulse modulation techniques can spread the laser energy over time or space, thus reducing laser power densities and minimizing damage. Previous experiments by various organizations using spatial or temporal pulse modulation have been shown to generate detectable surface, plate, and bulk ultrasonic waves with narrow frequency bandwidths . Using narrow frequency bandwidths improved signal detectability, but required the use of expensive and powerful lasers and opto-electronic systems. The use of a laser diode to generate ultrasound is attractive because of its low cost, small size, light weight, simple optics and modulation capability. The use of pulse compression techniques should allow certain types of laser diodes to produce usable ultrasonic signals. The method also does not need to be limited to narrow frequency bandwidths. The method demonstrated here uses a low power laser diode (approximately 150 mW) that is modulated by controlling the diode s drive current and the resulting signal is recovered by cross correlation. A potential application for this system which is briefly demonstrated is in detecting signals in thick

  4. Radiology and social media: are private practice radiology groups more social than academic radiology departments?

    Science.gov (United States)

    Glover, McKinley; Choy, Garry; Boland, Giles W; Saini, Sanjay; Prabhakar, Anand M

    2015-05-01

    This study assesses the prevalence of use of the most commonly used social media sites among private radiology groups (PRGs) and academic radiology departments (ARDs). The 50 largest PRGs and the 50 ARDs with the highest level of funding from the National Institutes of Health were assessed for presence of a radiology-specific social media account on Facebook, Twitter, Instagram, Pinterest, YouTube, and LinkedIn. Measures of organizational activity and end-user activity were collected, including the number of posts and followers, as appropriate; between-group comparisons were performed. PRGs adopted Facebook 12 months earlier (P = .02) and Twitter 18 months earlier (P = .02) than did ARDs. A total of 76% of PRGs maintained ≥1 account on the social media sites included in the study, compared with 28% of ARDs (P Instagram, 2%. The prevalence of radiology-specific social media accounts for ARDs was: Facebook, 18%; LinkedIn, 0%; Twitter, 24%; YouTube, 6%; Pinterest, 0%; and Instagram, 0%. There was no significant difference between ARDs and PRGs in measures of end-user or organizational activity on Facebook or Twitter. Use of social media in health care is emerging as mainstream, with PRGs being early adopters of Facebook and Twitter in comparison with ARDs. Competitive environments and institutional policies may be strong factors that influence how social media is used by radiologists at the group and department levels. Copyright © 2015 American College of Radiology. Published by Elsevier Inc. All rights reserved.

  5. Preliminary remediation goals for ecological endpoints

    International Nuclear Information System (INIS)

    Efroymson, R.A.; Suter, G.W. II; Sample, B.E.; Jones, D.S.

    1996-07-01

    Preliminary remediation goals (PRGs) are useful for risk assessment and decision making at Comprehensive Environmental Response, Compensation, and Liability Act (CERCLA) sites. PRGs are upper concentration limits for specific chemicals in specific environmental media that are anticipated to protect human health or the environment. They can be used for multiple remedial investigations at multiple facilities. In addition to media and chemicals of potential concern, the development of PRGs generally requires some knowledge or anticipation of future land use. In Preliminary Remediation Goals for Use at the U.S. Department of Energy Oak Ridge Operations Office (Energy Systems 1995), PRGs intended to protect human health were developed with guidance from Risk Assessment Guidance for Superfund: Volume I - Human Health Evaluation Manual, Part B (RAGS) (EPA 1991). However, no guidance was given for PRGs based on ecological risk. The numbers that appear in this volume have, for the most part, been extracted from toxicological benchmarks documents for Oak Ridge National Laboratory (ORNL) and have previously been developed by ORNL. The sources of the quantities, and many of the uncertainties associated with their derivation, are described in this technical memorandum

  6. Preliminary remediation goals for ecological endpoints

    International Nuclear Information System (INIS)

    Efroymson, R.A.; Suter, G.W. II.

    1995-09-01

    Preliminary remediation goals (PRGs) are useful for risk assessment and decision making at Comprehensive Environmental Response, compensation, and Liability Act (CERCLA) sites. PRGs are upper concentration limits for specific chemicals in specific environmental media that are anticipated to protect human health or the environment. They can be used for multiple remedial investigations at multiple facilities. In addition to media and chemicals of potential concern, the development of PRGs generally requires some knowledge or anticipation of future land use. In Preliminary Remediation Goals for Use at the US Department of Energy Oak Ridge Operations Office (Energy Systems 1995), PRGs intended to protect human health were developed with guidance from Risk Assessment Guidance for Superfund: Volume I-Human Health Evaluation Manual, Part B (RAGS) (EPA 1991). However, no guidance was given for PRGs based on ecological risk. The numbers that appear in this volume have, for the most part, been extracted from toxicological benchmarks documents for Oak Ridge National Laboratory (ORNL) and have previously been developed by ORNL. The sources of the quantities, and many of the uncertainties associated with their derivation, are described in this technical memorandum

  7. The simultaneous use of several pseudo-random binary sequences in the identification of linear multivariable dynamic systems

    International Nuclear Information System (INIS)

    Cummins, J.D.

    1965-02-01

    With several white noise sources the various transmission paths of a linear multivariable system may be determined simultaneously. This memorandum considers the restrictions on pseudo-random two state sequences to effect simultaneous identification of several transmission paths and the consequential rejection of cross-coupled signals in linear multivariable systems. The conditions for simultaneous identification are established by an example, which shows that the integration time required is large i.e. tends to infinity, as it does when white noise sources are used. (author)

  8. Pseudo-random arranged color filter array for controlling moiré patterns in display.

    Science.gov (United States)

    Zhou, Yangui; Fan, Hang; An, Sengzhong; Li, Juntao; Wang, Jiahui; Zhou, Jianying; Liu, Yikun

    2015-11-16

    Optical display quality can be degraded by the appearance of moiré pattern occurring in a display system consisting of a basic matrix superimposed with a functional structured optical layer. We propose in this paper a novel pseudo-random arranged color filter array with the table number arranged with an optimal design scenario. We show that the moiré pattern can be significantly reduced with the introduction of the special color filter array. The idea is tested with an experiment that gives rise to a substantially reduced moiré pattern in a display system. It is believed that the novel functional optical structures have significant impact to complex structured display system in general and to the autostereoscopic and integrated display systems in particular.

  9. Frequency characteristic measurement of a fiber optic gyroscope using a correlation spectrum analysis method based on a pseudo-random sequence

    International Nuclear Information System (INIS)

    Li, Yang; Chen, Xingfan; Liu, Cheng

    2015-01-01

    The frequency characteristic is an important indicator of a system’s dynamic performance. The identification of a fiber optic gyroscope (FOG)’s frequency characteristic using a correlation spectrum analysis method based on a pseudo-random sequence is proposed. Taking the angle vibrator as the source of the test rotation stimulation and a pseudo-random sequence as the test signal, the frequency characteristic of a FOG is calculated according to the power spectral density of the rotation rate signal and the cross-power spectral density of the FOG’s output signal and rotation rate signal. A theoretical simulation is done to confirm the validity of this method. An experiment system is built and the test results indicate that the measurement error of the normalized amplitude–frequency response is less than 0.01, that the error of the phase–frequency response is less than 0.3 rad, and the overall measurement accuracy is superior to the traditional frequency-sweep method. By using this method, the FOG’s amplitude–frequency response and phase–frequency response can be measured simultaneously, quickly, accurately, and with a high frequency resolution. The described method meets the requirements of engineering applications. (paper)

  10. Targeted reduction of highly abundant transcripts using pseudo-random primers.

    Science.gov (United States)

    Arnaud, Ophélie; Kato, Sachi; Poulain, Stéphane; Plessy, Charles

    2016-04-01

    Transcriptome studies based on quantitative sequencing can estimate levels of gene expression by measuring target RNA abundance in sequencing libraries. Sequencing costs are proportional to the total number of sequenced reads, and in order to cover rare RNAs, considerable quantities of abundant and identical reads are needed. This major limitation can be addressed by depleting a proportion of the most abundant sequences from the library. However, such depletion strategies involve either extra handling of the input RNA sample or use of a large number of reverse transcription primers, termed not-so-random (NSR) primers, which are costly to synthesize. Taking advantage of the high tolerance of reverse transcriptase to mis-prime, we found that it is possible to use as few as 40 pseudo-random (PS) reverse transcription primers to decrease the rate of undesirable abundant sequences within a library without affecting the overall transcriptome diversity. PS primers are simple to design and can be used to deplete several undesirable RNAs simultaneously, thus creating a flexible tool for enriching transcriptome libraries for rare transcript sequences.

  11. Optimal pseudorandom sequence selection for online c-VEP based BCI control applications

    DEFF Research Database (Denmark)

    Isaksen, Jonas L.; Mohebbi, Ali; Puthusserypady, Sadasivan

    2017-01-01

    to predict the chance of completion and accuracy score. Results: No specific pseudorandom sequence showed superior accuracy on the group basis. When isolating the individual performances with the highest accuracy, time consumption per identification was not significantly increased. The Accuracy Score aids...... is a laborious process. Aims: This study aimed to suggest an efficient method for choosing the optimal stimulus sequence based on a fast test and simple measures to increase the performance and minimize the time consumption for research trials. Methods: A total of 21 healthy subjects were included in an online...... wheelchair control task and completed the same task using stimuli based on the m-code, the gold-code, and the Barker-code. Correct/incorrect identification and time consumption were obtained for each identification. Subject-specific templates were characterized and used in a forward-step first-order model...

  12. Problem of uniqueness in the renewal process generated by the uniform distribution

    Directory of Open Access Journals (Sweden)

    D. Ugrin-Šparac

    1992-01-01

    Full Text Available The renewal process generated by the uniform distribution, when interpreted as a transformation of the uniform distribution into a discrete distribution, gives rise to the question of uniqueness of the inverse image. The paper deals with a particular problem from the described domain, that arose in the construction of a complex stochastic test intended to evaluate pseudo-random number generators. The connection of the treated problem with the question of a unique integral representation of Gamma-function is also mentioned.

  13. Preliminary remediation goals for use at the U.S. Department of Energy Oak Ridge Operations Office

    International Nuclear Information System (INIS)

    1995-06-01

    This report presents Preliminary Remediation Goals (PRGs) for use in human health risk assessment efforts under the United States Department of Energy, Oak Ridge Operations Office Environmental Restoration (ER) Division. Chemical-specific PRGs are concentration goals for individual chemicals for specific medium and land use combinations. The PRGs are referred to as risk-based because they have been calculated using risk assessment procedures. Risk-based calculations set concentration limits using both carcinogenic or noncarcinogenic toxicity values under specific exposure pathways. The PRG is a concentration that is derived from a specified excess cancer risk level or hazard quotient. This report provides the ER Division with standardized PRGs which are integral to the Remedial Investigation/Feasibility Study process. By managing the assumptions and systems used in PRG derivation, the Environmental Restoration Risk Assessment Program will be able to control the level of quality assurance associated with these risk-based guideline values

  14. Preliminary remediation goals for use at the U.S. Department of Energy Oak Ridge Operations Office

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1995-06-01

    This report presents Preliminary Remediation Goals (PRGs) for use in human health risk assessment efforts under the United States Department of Energy, Oak Ridge Operations Office Environmental Restoration (ER) Division. Chemical-specific PRGs are concentration goals for individual chemicals for specific medium and land use combinations. The PRGs are referred to as risk-based because they have been calculated using risk assessment procedures. Risk-based calculations set concentration limits using both carcinogenic or noncarcinogenic toxicity values under specific exposure pathways. The PRG is a concentration that is derived from a specified excess cancer risk level or hazard quotient. This report provides the ER Division with standardized PRGs which are integral to the Remedial Investigation/Feasibility Study process. By managing the assumptions and systems used in PRG derivation, the Environmental Restoration Risk Assessment Program will be able to control the level of quality assurance associated with these risk-based guideline values.

  15. Measuring gas-residence times in large municipal incinerators, by means of a pseudo-random binary signal tracer technique

    International Nuclear Information System (INIS)

    Nasserzadeh, V.; Swithenbank, J.; Jones, B.

    1995-01-01

    The problem of measuring gas-residence time in large incinerators was studied by the pseudo-random binary sequence (PRBS) stimulus tracer response technique at the Sheffield municipal solid-waste incinerator (35 MW plant). The steady-state system was disturbed by the superimposition of small fluctuations in the form of a pseudo-random binary sequence of methane pulses, and the response of the incinerator was determined from the CO 2 concentration in flue gases at the boiler exit, measured with a specially developed optical gas analyser with a high-frequency response. For data acquisition, an on-line PC computer was used together with the LAB Windows software system; the output response was then cross-correlated with the perturbation signal to give the impulse response of the incinerator. There was very good agreement between the gas-residence time for the Sheffield MSW incinerator as calculated by computational fluid dynamics (FLUENT Model) and gas-residence time at the plant as measured by the PRBS tracer technique. The results obtained from this research programme clearly demonstrate that the PRBS stimulus tracer response technique can be successfully and economically used to measure gas-residence times in large incinerator plants. It also suggests that the common commercial practice of characterising the incinerator operation by a single-residence-time parameter may lead to a misrepresentation of the complexities involved in describing the operation of the incineration system. (author)

  16. Non-Stoichiometric SixN Metal-Oxide-Semiconductor Field-Effect Transistor for Compact Random Number Generator with 0.3 Mbit/s Generation Rate

    Science.gov (United States)

    Matsumoto, Mari; Ohba, Ryuji; Yasuda, Shin-ichi; Uchida, Ken; Tanamoto, Tetsufumi; Fujita, Shinobu

    2008-08-01

    The demand for random numbers for security applications is increasing. A conventional random number generator using thermal noise can generate unpredictable high-quality random numbers, but the circuit is extremely large because of large amplifier circuit for a small thermal signal. On the other hand, a pseudo-random number generator is small but the quality of randomness is bad. For a small circuit and a high quality of randomness, we purpose a non-stoichiometric SixN metal-oxide-semiconductor field-effect transistor (MOSFET) noise source device. This device generates a very large noise signal without an amplifier circuit. As a result, it is shown that, utilizing a SiN MOSFET, we can attain a compact random number generator with a high generation rate near 1 Mbit/s, which is suitable for almost all security applications.

  17. On the Periods of the {ranshi} Random Number Generator

    Science.gov (United States)

    Gutbrod, F.

    The stochastic properties of the pseudo-random number generator {ranshi} are discussed, with emphasis on the average period. Within a factor 2 this turns out to be the root of the maximally possible period. The actual set of periods depends on minor details of the algorithm, and the system settles down in one of only a few different cycles. These features are in perfect agreement with absolute random motion in phase space, to the extent allowed by deterministic dynamics.

  18. EPCGen2 Pseudorandom Number Generators: Analysis of J3Gen

    Directory of Open Access Journals (Sweden)

    Alberto Peinado

    2014-04-01

    Full Text Available This paper analyzes the cryptographic security of J3Gen, a promising pseudo random number generator for low-cost passive Radio Frequency Identification (RFID tags. Although J3Gen has been shown to fulfill the randomness criteria set by the EPCglobal Gen2 standard and is intended for security applications, we describe here two cryptanalytic attacks that question its security claims: (i a probabilistic attack based on solving linear equation systems; and (ii a deterministic attack based on the decimation of the output sequence. Numerical results, supported by simulations, show that for the specific recommended values of the configurable parameters, a low number of intercepted output bits are enough to break J3Gen. We then make some recommendations that address these issues.

  19. Theoretical and empirical convergence results for additive congruential random number generators

    Science.gov (United States)

    Wikramaratna, Roy S.

    2010-03-01

    Additive Congruential Random Number (ACORN) generators represent an approach to generating uniformly distributed pseudo-random numbers that is straightforward to implement efficiently for arbitrarily large order and modulus; if it is implemented using integer arithmetic, it becomes possible to generate identical sequences on any machine. This paper briefly reviews existing results concerning ACORN generators and relevant theory concerning sequences that are well distributed mod 1 in k dimensions. It then demonstrates some new theoretical results for ACORN generators implemented in integer arithmetic with modulus M=2[mu] showing that they are a family of generators that converge (in a sense that is defined in the paper) to being well distributed mod 1 in k dimensions, as [mu]=log2M tends to infinity. By increasing k, it is possible to increase without limit the number of dimensions in which the resulting sequences approximate to well distributed. The paper concludes by applying the standard TestU01 test suite to ACORN generators for selected values of the modulus (between 260 and 2150), the order (between 4 and 30) and various odd seed values. On the basis of these and earlier results, it is recommended that an order of at least 9 be used together with an odd seed and modulus equal to 230p, for a small integer value of p. While a choice of p=2 should be adequate for most typical applications, increasing p to 3 or 4 gives a sequence that will consistently pass all the tests in the TestU01 test suite, giving additional confidence in more demanding applications. The results demonstrate that the ACORN generators are a reliable source of uniformly distributed pseudo-random numbers, and that in practice (as suggested by the theoretical convergence results) the quality of the ACORN sequences increases with increasing modulus and order.

  20. A fast random number generator for the Intel Paragon supercomputer

    Science.gov (United States)

    Gutbrod, F.

    1995-06-01

    A pseudo-random number generator is presented which makes optimal use of the architecture of the i860-microprocessor and which is expected to have a very long period. It is therefore a good candidate for use on the parallel supercomputer Paragon XP. In the assembler version, it needs 6.4 cycles for a real∗4 random number. There is a FORTRAN routine which yields identical numbers up to rare and minor rounding discrepancies, and it needs 28 cycles. The FORTRAN performance on other microprocessors is somewhat better. Arguments for the quality of the generator and some numerical tests are given.

  1. Comparison of tool feed influence in CNC polishing between a novel circular-random path and other pseudo-random paths.

    Science.gov (United States)

    Takizawa, Ken; Beaucamp, Anthony

    2017-09-18

    A new category of circular pseudo-random paths is proposed in order to suppress repetitive patterns and improve surface waviness on ultra-precision polished surfaces. Random paths in prior research had many corners, therefore deceleration of the polishing tool affected the surface waviness. The new random path can suppress velocity changes of the polishing tool and thus restrict degradation of the surface waviness, making it suitable for applications with stringent mid-spatial-frequency requirements such as photomask blanks for EUV lithography.

  2. Standard random number generation for MBASIC

    Science.gov (United States)

    Tausworthe, R. C.

    1976-01-01

    A machine-independent algorithm is presented and analyzed for generating pseudorandom numbers suitable for the standard MBASIC system. The algorithm used is the polynomial congruential or linear recurrence modulo 2 method. Numbers, formed as nonoverlapping adjacent 28-bit words taken from the bit stream produced by the formula a sub m + 532 = a sub m + 37 + a sub m (modulo 2), do not repeat within the projected age of the solar system, show no ensemble correlation, exhibit uniform distribution of adjacent numbers up to 19 dimensions, and do not deviate from random runs-up and runs-down behavior.

  3. A Novel Method for Generating Encryption Keys

    Directory of Open Access Journals (Sweden)

    Dascalescu Ana Cristina

    2009-12-01

    Full Text Available The development of the informational society, which has led to an impressive growth of the information volume circulating in the computer networks, has accelerated the evolution and especially the use of modern cryptography instruments. Today, the commercial products use standard cryptographic libraries that implement certified and tested cryptographic algorithms. Instead, the fragility ofencryption algorithms is given by compositional operations like key handling or key generation. In this sense, the article proposes an innovative method to generate pseudorandom numbers which can be used for the construction of secure stream encryption keys. The proposed method is based on the mathematical complements based on the algebra of the finite fields and uses a particularized structure of the linear feedback shift registers.

  4. The additive congruential random number generator--A special case of a multiple recursive generator

    Science.gov (United States)

    Wikramaratna, Roy S.

    2008-07-01

    This paper considers an approach to generating uniformly distributed pseudo-random numbers which works well in serial applications but which also appears particularly well-suited for application on parallel processing systems. Additive Congruential Random Number (ACORN) generators are straightforward to implement for arbitrarily large order and modulus; if implemented using integer arithmetic, it becomes possible to generate identical sequences on any machine. Previously published theoretical analysis has demonstrated that a kth order ACORN sequence approximates to being uniformly distributed in up to k dimensions, for any given k. ACORN generators can be constructed to give period lengths exceeding any given number (for example, with period length in excess of 230p, for any given p). Results of empirical tests have demonstrated that, if p is greater than or equal to 2, then the ACORN generator can be used successfully for generating double precision uniform random variates. This paper demonstrates that an ACORN generator is a particular case of a multiple recursive generator (and, therefore, also a special case of a matrix generator). Both these latter approaches have been widely studied, and it is to be hoped that the results given in the present paper will lead to greater confidence in using the ACORN generators.

  5. Low power laser generated ultrasound: Signal processing for time domain data acquisition

    International Nuclear Information System (INIS)

    Cleary, A; Thursby, G; McKee, C; Armstrong, I; Culshaw, B; Veres, I; Pierce, S G

    2011-01-01

    The use of low power modulated laser diode systems has previously been established as a suitable method for non-destructive laser generation of ultrasound. Using a quasi-continuous optical excitation amplified by an erbium-doped fibre amplifier (EDFA) allows flexible generation of ultrasonic waves, offering control of further parameters such as the frequency content or signal shape. In addition, pseudo-random binary sequences (PRBS) can be used to improve the detected impulse response. Here we compare two sequences, the m-sequence and the Golay code, and discuss the advantages and practical limits of their application with laser diode based optical excitation of ultrasound.

  6. Random number generators in support of Monte Carlo problems in physics

    International Nuclear Information System (INIS)

    Dyadkin, I.G.

    1993-01-01

    The ability to support a modern users' expectations of random number generators to solve problems in physics is analyzed. The capabilities of the newest concepts and the old pseudo-random algorithms are compared. The author is in favor of multiplicative generators. Due to the 64-bit arithmetic of a modern PC, multiplicative generators have a sufficient number of periods (up to 2 62 ) and are quicker to generate and to govern independent sequences for parallel processing. In addition they are able to replicate sub-sequences (without storing their seeds) for each standard trial in any code and to simulate spatial and planar directions and EXP(-x) distributions often needed as ''bricks'' for simulating events in physics. Hundreds of multipliers for multiplicative generators have been tabulated and tested, and the required speeds have been obtained. (author)

  7. Pseudorandom dynamics of frequency combs in free-running quantum cascade lasers

    Science.gov (United States)

    Henry, Nathan; Burghoff, David; Yang, Yang; Hu, Qing; Khurgin, Jacob B.

    2018-01-01

    Recent research has shown that free-running quantum cascade lasers are capable of producing frequency combs in midinfrared and THz regions of the spectrum. Unlike familiar frequency combs originating from mode-locked lasers, these do not require any additional optical elements inside the cavity and have temporal characteristics that are dramatically different from the periodic pulse train of conventional combs. Frequency combs from quantum cascade lasers are characterized by the absence of sharp pulses and strong frequency modulation, periodic with the cavity round trip time but lacking any periodicity within that period. To explicate for this seemingly perplexing behavior, we develop a model of the gain medium using optical Bloch equations that account for hole burning in spectral, spatial, and temporal domains. With this model, we confirm that the most efficient mode of operation of a free-running quantum cascade laser is indeed a pseudorandom frequency-modulated field with nearly constant intensity. We show that the optimum modulation period is commensurate with the gain recovery time of the laser medium and the optimum modulation amplitude is comparable to the gain bandwidth, behavior that has been observed in the experiments.

  8. Efficient implementation of Bailey and Borwein pseudo-random number generator based on normal numbers

    Science.gov (United States)

    Beliakov, G.; Creighton, D.; Johnstone, M.; Wilkin, T.

    2013-08-01

    This paper describes an implementation of a Linear Congruential Generator (LCG) based on the binary representation of the normal number α, and of a combined generator based on that LCG. The base LCG with the modulus 333 provides a quality sequence with the period ≈3.7ṡ1015, which passes all but two statistical tests from BigCrush test suite. We improved on the original implementation by adapting Barrett's modular reduction method, which resulted in four-fold increase in efficiency. The combined generator has the period of ≈1023 and passes all tests from BigCrush suite.

  9. Fast physical random bit generation with chaotic semiconductor lasers

    Science.gov (United States)

    Uchida, Atsushi; Amano, Kazuya; Inoue, Masaki; Hirano, Kunihito; Naito, Sunao; Someya, Hiroyuki; Oowada, Isao; Kurashige, Takayuki; Shiki, Masaru; Yoshimori, Shigeru; Yoshimura, Kazuyuki; Davis, Peter

    2008-12-01

    Random number generators in digital information systems make use of physical entropy sources such as electronic and photonic noise to add unpredictability to deterministically generated pseudo-random sequences. However, there is a large gap between the generation rates achieved with existing physical sources and the high data rates of many computation and communication systems; this is a fundamental weakness of these systems. Here we show that good quality random bit sequences can be generated at very fast bit rates using physical chaos in semiconductor lasers. Streams of bits that pass standard statistical tests for randomness have been generated at rates of up to 1.7 Gbps by sampling the fluctuating optical output of two chaotic lasers. This rate is an order of magnitude faster than that of previously reported devices for physical random bit generators with verified randomness. This means that the performance of random number generators can be greatly improved by using chaotic laser devices as physical entropy sources.

  10. The random signal generator of imitated nuclear radiation pulse

    International Nuclear Information System (INIS)

    Li Dongcang; Yang Lei; Yuan Shulin; Yang Yinghui; Zang Fujia

    2007-01-01

    Based in pseudo-random uniformity number, it produces random numbers of Gaussian distribution and exponential distribution by arithmetic. The hardware is the single-chip microcomputer of 89C51. Program language makes use of Keil C. The output pulse amplitude is Gaussian distribution, exponential distribution or uniformity distribution. Likewise, it has two mode or upwards two. The time alternation of output pulse is both periodic and exponential distribution. The generator has achieved output control of multi-mode distribution, imitated random characteristic of nuclear pulse in amplitude and in time. (authors)

  11. Algoritma The Sieve Of Eratosthenes dan Linear Congruential Generator ( LCG ) Dalam Perancangan Aplikasi Kriptografi RSA

    OpenAIRE

    Fakhriza, M

    2013-01-01

    Kriptografi adalah ilmu untuk menyamarkan pesan agar hanya dikenal baik oleh penyedia dan penerima pesan. Algoritma kunci publik RSA adalah salah satu metode dalam ilmu kriptografi. Dalam algoritma kunci publik RSA, ada kunci privat dan publik, di mana masing-masing kunci menggunakan bilangan acak yang merupakan bilangan prima untuk melakukan enkripsi dan dekripsi.Bilangan acak yang dihasilkan sebenarnya adalah bilangan pseudo-random ('hampir' acak). Linear Congruential Generator (LCG) algor...

  12. Super fast physical-random number generation using laser diode frequency noises

    Science.gov (United States)

    Ushiki, Tetsuro; Doi, Kohei; Maehara, Shinya; Sato, Takashi; Ohkawa, Masashi; Ohdaira, Yasuo

    2011-02-01

    Random numbers can be classified as either pseudo- or physical-random in character. Pseudo-random numbers' periodicity renders them inappropriate for use in cryptographic applications, but naturally-generated physical-random numbers have no calculable periodicity, thereby making them ideally-suited to the task. The laser diode naturally produces a wideband "noise" signal that is believed to have tremendous capacity and great promise, for the rapid generation of physical-random numbers for use in cryptographic applications. We measured a laser diode's output, at a fast photo detector and generated physical-random numbers from frequency noises. We then identified and evaluated the binary-number-line's statistical properties. The result shows that physical-random number generation, at speeds as high as 40Gbps, is obtainable, using the laser diode's frequency noise characteristic.

  13. An X-ray CCD signal generator with true random arrival time

    International Nuclear Information System (INIS)

    Huo Jia; Xu Yuming; Chen Yong; Cui Weiwei; Li Wei; Zhang Ziliang; Han Dawei; Wang Yusan; Wang Juan

    2011-01-01

    An FPGA-based true random signal generator with adjustable amplitude and exponential distribution of time interval is presented. Since traditional true random number generators (TRNG) are resource costly and difficult to transplant, we employed a method of random number generation based on jitter and phase noise in ring oscillators formed by gates in an FPGA. In order to improve the random characteristics, a combination of two different pseudo-random processing circuits is used for post processing. The effects of the design parameters, such as sample frequency are discussed. Statistical tests indicate that the generator can well simulate the timing behavior of random signals with Poisson distribution. The X-ray CCD signal generator will be used in debugging the CCD readout system of the Low Energy X-ray Instrument onboard the Hard X-ray Modulation Telescope (HXMT). (authors)

  14. Parallel computation of nondeterministic algorithms in VLSI

    Energy Technology Data Exchange (ETDEWEB)

    Hortensius, P D

    1987-01-01

    This work examines parallel VLSI implementations of nondeterministic algorithms. It is demonstrated that conventional pseudorandom number generators are unsuitable for highly parallel applications. Efficient parallel pseudorandom sequence generation can be accomplished using certain classes of elementary one-dimensional cellular automata. The pseudorandom numbers appear in parallel on each clock cycle. Extensive study of the properties of these new pseudorandom number generators is made using standard empirical random number tests, cycle length tests, and implementation considerations. Furthermore, it is shown these particular cellular automata can form the basis of efficient VLSI architectures for computations involved in the Monte Carlo simulation of both the percolation and Ising models from statistical mechanics. Finally, a variation on a Built-In Self-Test technique based upon cellular automata is presented. These Cellular Automata-Logic-Block-Observation (CALBO) circuits improve upon conventional design for testability circuitry.

  15. Generating random numbers by means of nonlinear dynamic systems

    Science.gov (United States)

    Zang, Jiaqi; Hu, Haojie; Zhong, Juhua; Luo, Duanbin; Fang, Yi

    2018-07-01

    To introduce the randomness of a physical process to students, a chaotic pendulum experiment was opened in East China University of Science and Technology (ECUST) on the undergraduate level in the physics department. It was shown chaotic motion could be initiated through adjusting the operation of a chaotic pendulum. By using the data of the angular displacements of chaotic motion, random binary numerical arrays can be generated. To check the randomness of generated numerical arrays, the NIST Special Publication 800-20 method was adopted. As a result, it was found that all the random arrays which were generated by the chaotic motion could pass the validity criteria and some of them were even better than the quality of pseudo-random numbers generated by a computer. Through the experiments, it is demonstrated that chaotic pendulum can be used as an efficient mechanical facility in generating random numbers, and can be applied in teaching random motion to the students.

  16. Calibration of Correlation Radiometers Using Pseudo-Random Noise Signals

    Directory of Open Access Journals (Sweden)

    Sebastián Pantoja

    2009-08-01

    Full Text Available The calibration of correlation radiometers, and particularly aperture synthesis interferometric radiometers, is a critical issue to ensure their performance. Current calibration techniques are based on the measurement of the cross-correlation of receivers’ outputs when injecting noise from a common noise source requiring a very stable distribution network. For large interferometric radiometers this centralized noise injection approach is very complex from the point of view of mass, volume and phase/amplitude equalization. Distributed noise injection techniques have been proposed as a feasible alternative, but are unable to correct for the so-called “baseline errors” associated with the particular pair of receivers forming the baseline. In this work it is proposed the use of centralized Pseudo-Random Noise (PRN signals to calibrate correlation radiometers. PRNs are sequences of symbols with a long repetition period that have a flat spectrum over a bandwidth which is determined by the symbol rate. Since their spectrum resembles that of thermal noise, they can be used to calibrate correlation radiometers. At the same time, since these sequences are deterministic, new calibration schemes can be envisaged, such as the correlation of each receiver’s output with a baseband local replica of the PRN sequence, as well as new distribution schemes of calibration signals. This work analyzes the general requirements and performance of using PRN sequences for the calibration of microwave correlation radiometers, and particularizes the study to a potential implementation in a large aperture synthesis radiometer using an optical distribution network.

  17. A contribution to the design of fast code converters for position encoders

    Science.gov (United States)

    Denic, Dragan B.; Dincic, Milan R.; Miljkovic, Goran S.; Peric, Zoran H.

    2016-10-01

    Pseudorandom binary sequences (PRBS) are very useful in many areas of applications. Absolute position encoders based on PRBS have many advantages. However, the pseudorandom code is not directly applicable to the digital electronic systems, hence a converter from pseudorandom to natural binary code is needed. Recently, a fast pseudorandom/natural code converter based on Galois PRBS generator (much faster than previously used converter based on Fibonacci PRBS generator) was proposed. One of the main parts of the Galois code converter is an initial logic. The problem of the design of the initial logic has been solved only for some single values of resolution, but it is still not solved for any value of resolution, which significantly limits the applicability of the fast Galois code converter. This paper solves this problem presenting the solution for the design of the initial logic of the fast Galois pseudorandom/natural code converters used in the pseudorandom position encoders, in general manner, that is for any value of the resolution, allowing for a wide applicability of the fast Galois pseudorandom position encoders. Rigorous mathematical derivation of the formula for the designing of the initial logic is presented. Simulation of the proposed converter is performed in NI MultiSim software. The proposed solution, although developed for pseudorandom position encoders, can be used in many other fields where PRBS are used.

  18. Surface detection performance evaluation of pseudo-random noise continuous wave laser radar

    Science.gov (United States)

    Mitev, Valentin; Matthey, Renaud; Pereira do Carmo, Joao

    2017-11-01

    A number of space missions (including in the ESA Exploration Programme) foreseen a use of laser radar sensor (or lidar) for determination of range between spacecrafts or between spacecraft and ground surface (altimetry). Such sensors need to be compact, robust and power efficient, at the same time with high detection performance. These requirements can be achieved with a Pseudo-Random Noise continuous wave lidar (PRN cw lidar). Previous studies have pointed to the advantages of this lidar with respect to space missions, but they also identified its limitations in high optical background. The progress of the lasers and the detectors in the near IR spectral range requires a re-evaluation of the PRN cw lidar potential. Here we address the performances of this lidar for surface detection (altimetry) in planetary missions. The evaluation is based on the following system configuration: (i) A cw fiber amplifier as lidar transmitter. The seeding laser exhibits a single-frequency spectral line, with subsequent amplitude modulation. The fiber amplifier allows high output power level, keeping the spectral characteristics and the modulation of the seeding light input. (ii) An avalanche photodiode in photon counting detection; (iii) Measurement scenarios representative for Earth, Mercury and Mars.

  19. On a direct algorithm for the generation of log-normal pseudo-random numbers

    CERN Document Server

    Chamayou, J M F

    1976-01-01

    The random variable ( Pi /sub i=1//sup n/X/sub i//X/sub i+n/)/sup 1/ square root 2n/ is used to generate standard log normal variables Lambda (0, 1), where the X/sub i/ are independent uniform variables on (0, 1). (8 refs).

  20. Fast random-number generation using a diode laser's frequency noise characteristic

    Science.gov (United States)

    Takamori, Hiroki; Doi, Kohei; Maehara, Shinya; Kawakami, Kohei; Sato, Takashi; Ohkawa, Masashi; Ohdaira, Yasuo

    2012-02-01

    Random numbers can be classified as either pseudo- or physical-random, in character. Pseudo-random numbers are generated by definite periodicity, so, their usefulness in cryptographic applications is somewhat limited. On the other hand, naturally-generated physical-random numbers have no calculable periodicity, thereby making them ideal for the task. Diode lasers' considerable wideband noise gives them tremendous capacity for generating physical-random numbers, at a high rate of speed. We measured a diode laser's output with a fast photo detector, and evaluated the binary-numbers from the diode laser's frequency noise characteristics. We then identified and evaluated the binary-number-line's statistical properties. We also investigate the possibility that much faster physical-random number parallel-generation is possible, using separate outputs of different optical-path length and character, which we refer to as "coherence collapse".

  1. The MIXMAX random number generator

    Science.gov (United States)

    Savvidy, Konstantin G.

    2015-11-01

    In this paper, we study the randomness properties of unimodular matrix random number generators. Under well-known conditions, these discrete-time dynamical systems have the highly desirable K-mixing properties which guarantee high quality random numbers. It is found that some widely used random number generators have poor Kolmogorov entropy and consequently fail in empirical tests of randomness. These tests show that the lowest acceptable value of the Kolmogorov entropy is around 50. Next, we provide a solution to the problem of determining the maximal period of unimodular matrix generators of pseudo-random numbers. We formulate the necessary and sufficient condition to attain the maximum period and present a family of specific generators in the MIXMAX family with superior performance and excellent statistical properties. Finally, we construct three efficient algorithms for operations with the MIXMAX matrix which is a multi-dimensional generalization of the famous cat-map. First, allowing to compute the multiplication by the MIXMAX matrix with O(N) operations. Second, to recursively compute its characteristic polynomial with O(N2) operations, and third, to apply skips of large number of steps S to the sequence in O(N2 log(S)) operations.

  2. A universal algorithm to generate pseudo-random numbers based on uniform mapping as homeomorphism

    International Nuclear Information System (INIS)

    Fu-Lai, Wang

    2010-01-01

    A specific uniform map is constructed as a homeomorphism mapping chaotic time series into [0,1] to obtain sequences of standard uniform distribution. With the uniform map, a chaotic orbit and a sequence orbit obtained are topologically equivalent to each other so the map can preserve the most dynamic properties of chaotic systems such as permutation entropy. Based on the uniform map, a universal algorithm to generate pseudo random numbers is proposed and the pseudo random series is tested to follow the standard 0–1 random distribution both theoretically and experimentally. The algorithm is not complex, which does not impose high requirement on computer hard ware and thus computation speed is fast. The method not only extends the parameter spaces but also avoids the drawback of small function space caused by constraints on chaotic maps used to generate pseudo random numbers. The algorithm can be applied to any chaotic system and can produce pseudo random sequence of high quality, thus can be a good universal pseudo random number generator. (general)

  3. A universal algorithm to generate pseudo-random numbers based on uniform mapping as homeomorphism

    Science.gov (United States)

    Wang, Fu-Lai

    2010-09-01

    A specific uniform map is constructed as a homeomorphism mapping chaotic time series into [0,1] to obtain sequences of standard uniform distribution. With the uniform map, a chaotic orbit and a sequence orbit obtained are topologically equivalent to each other so the map can preserve the most dynamic properties of chaotic systems such as permutation entropy. Based on the uniform map, a universal algorithm to generate pseudo random numbers is proposed and the pseudo random series is tested to follow the standard 0-1 random distribution both theoretically and experimentally. The algorithm is not complex, which does not impose high requirement on computer hard ware and thus computation speed is fast. The method not only extends the parameter spaces but also avoids the drawback of small function space caused by constraints on chaotic maps used to generate pseudo random numbers. The algorithm can be applied to any chaotic system and can produce pseudo random sequence of high quality, thus can be a good universal pseudo random number generator.

  4. Solution-Processed Carbon Nanotube True Random Number Generator.

    Science.gov (United States)

    Gaviria Rojas, William A; McMorrow, Julian J; Geier, Michael L; Tang, Qianying; Kim, Chris H; Marks, Tobin J; Hersam, Mark C

    2017-08-09

    With the growing adoption of interconnected electronic devices in consumer and industrial applications, there is an increasing demand for robust security protocols when transmitting and receiving sensitive data. Toward this end, hardware true random number generators (TRNGs), commonly used to create encryption keys, offer significant advantages over software pseudorandom number generators. However, the vast network of devices and sensors envisioned for the "Internet of Things" will require small, low-cost, and mechanically flexible TRNGs with low computational complexity. These rigorous constraints position solution-processed semiconducting single-walled carbon nanotubes (SWCNTs) as leading candidates for next-generation security devices. Here, we demonstrate the first TRNG using static random access memory (SRAM) cells based on solution-processed SWCNTs that digitize thermal noise to generate random bits. This bit generation strategy can be readily implemented in hardware with minimal transistor and computational overhead, resulting in an output stream that passes standardized statistical tests for randomness. By using solution-processed semiconducting SWCNTs in a low-power, complementary architecture to achieve TRNG, we demonstrate a promising approach for improving the security of printable and flexible electronics.

  5. A white dwarf companion to the main-sequence star 4 Omicron(1) Orionis and the binary hypothesis for the origin of peculiar red giants

    Science.gov (United States)

    Ake, Thomas B.; Johnson, Hollis R.

    1988-01-01

    Ultraviolet spectra of the peculiar red giants (PRGs) called MS stars are investigated, and the discovery of a white dwarf (WD) companion to the MS star 4 Omicron(1) Orionis is reported. The observations and data analysis are discussed and compared with those for field WDs in order to derive parameters for the WD and the luminosity of the primary. Detection limits for the other MS stars investigated are derived, and the binary hypothesis for PRGs is reviewed.

  6. A new hybrid nonlinear congruential number generator based on higher functional power of logistic maps

    International Nuclear Information System (INIS)

    Cecen, Songul; Demirer, R. Murat; Bayrak, Coskun

    2009-01-01

    We propose a nonlinear congruential pseudorandom number generator consisting of summation of higher order composition of random logistic maps under certain congruential mappings. We change both bifurcation parameters of logistic maps in the interval of U=[3.5599,4) and coefficients of the polynomials in each higher order composition of terms up to degree d. This helped us to obtain a perfect random decorrelated generator which is infinite and aperiodic. It is observed from the simulation results that our new PRNG has good uniformity and power spectrum properties with very flat white noise characteristics. The results are interesting, new and may have applications in cryptography and in Monte Carlo simulations.

  7. Multiprime Blum-Blum-Shub Pseudorandom Number Generator

    Science.gov (United States)

    2016-09-01

    the Internet. Every day, we use the world wide web for activities such as checking the news or looking up food recipes . Encryption is not required...determines the complexity of the sequence. The NIST input recommendations for this test are: • The test requires sequences of n 106 bits. • 500  M  5000...linearcomplexitytest(binin,m= 500 ): k = 6 pi = [0.01047, 0.03125, 0.125, 0.5, 0.25, 0.0625, 0.020833] avg = 0.5*m + (1.0/36)*(9 + (-1)**(m + 1)) - (m/3.0 + 2.0/9

  8. Logistic chaotic maps for binary numbers generations

    International Nuclear Information System (INIS)

    Kanso, Ali; Smaoui, Nejib

    2009-01-01

    Two pseudorandom binary sequence generators, based on logistic chaotic maps intended for stream cipher applications, are proposed. The first is based on a single one-dimensional logistic map which exhibits random, noise-like properties at given certain parameter values, and the second is based on a combination of two logistic maps. The encryption step proposed in both algorithms consists of a simple bitwise XOR operation of the plaintext binary sequence with the keystream binary sequence to produce the ciphertext binary sequence. A threshold function is applied to convert the floating-point iterates into binary form. Experimental results show that the produced sequences possess high linear complexity and very good statistical properties. The systems are put forward for security evaluation by the cryptographic committees.

  9. Preliminary remediation goals for use at the US Department of Energy Oak Ridge Operations Office. Revision 1

    International Nuclear Information System (INIS)

    1996-05-01

    This technical memorandum presents Preliminary Remediation Goals (PRGs) for use in human health risk assessment efforts under the United States Department of Energy, Oak Ridge Operations Office Environmental Restoration (ER) Division. This document provides the ER Division with standardized PRGs which are integral to the Remedial Investigation/Feasibility Study process. They are used during project scooping (Data Quality Objectives development), in screening level risk assessments to support early action or No Further Investigation decisions, and in the baselines risk assessment where they are employed in the selection of chemicals of potential concern. The primary objective of this document is to standardize these values and eliminate any duplication of effort by providing PRGs to all contractors involved in risk activities. In addition, by managing the assumptions and systems used in PRG derivation, the ER Risk Assessment Program will be able to control the level of quality assurance associated with these risk-based guideline values

  10. Preliminary remediation goals for use at the US Department of Energy Oak Ridge Operations Office. Revision 1

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1996-05-01

    This technical memorandum presents Preliminary Remediation Goals (PRGs) for use in human health risk assessment efforts under the United States Department of Energy, Oak Ridge Operations Office Environmental Restoration (ER) Division. This document provides the ER Division with standardized PRGs which are integral to the Remedial Investigation/Feasibility Study process. They are used during project scooping (Data Quality Objectives development), in screening level risk assessments to support early action or No Further Investigation decisions, and in the baselines risk assessment where they are employed in the selection of chemicals of potential concern. The primary objective of this document is to standardize these values and eliminate any duplication of effort by providing PRGs to all contractors involved in risk activities. In addition, by managing the assumptions and systems used in PRG derivation, the ER Risk Assessment Program will be able to control the level of quality assurance associated with these risk-based guideline values.

  11. Digital chaotic sequence generator based on coupled chaotic systems

    International Nuclear Information System (INIS)

    Shu-Bo, Liu; Jing, Sun; Jin-Shuo, Liu; Zheng-Quan, Xu

    2009-01-01

    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 be applied to the real-time video image encryption. (general)

  12. Improved diagonal queue medical image steganography using Chaos theory, LFSR, and Rabin cryptosystem.

    Science.gov (United States)

    Jain, Mamta; Kumar, Anil; Choudhary, Rishabh Charan

    2017-06-01

    In this article, we have proposed an improved diagonal queue medical image steganography for patient secret medical data transmission using chaotic standard map, linear feedback shift register, and Rabin cryptosystem, for improvement of previous technique (Jain and Lenka in Springer Brain Inform 3:39-51, 2016). The proposed algorithm comprises four stages, generation of pseudo-random sequences (pseudo-random sequences are generated by linear feedback shift register and standard chaotic map), permutation and XORing using pseudo-random sequences, encryption using Rabin cryptosystem, and steganography using the improved diagonal queues. Security analysis has been carried out. Performance analysis is observed using MSE, PSNR, maximum embedding capacity, as well as by histogram analysis between various Brain disease stego and cover images.

  13. Efficient image or video encryption based on spatiotemporal chaos system

    International Nuclear Information System (INIS)

    Lian Shiguo

    2009-01-01

    In this paper, an efficient image/video encryption scheme is constructed based on spatiotemporal chaos system. The chaotic lattices are used to generate pseudorandom sequences and then encrypt image blocks one by one. By iterating chaotic maps for certain times, the generated pseudorandom sequences obtain high initial-value sensitivity and good randomness. The pseudorandom-bits in each lattice are used to encrypt the Direct Current coefficient (DC) and the signs of the Alternating Current coefficients (ACs). Theoretical analysis and experimental results show that the scheme has good cryptographic security and perceptual security, and it does not affect the compression efficiency apparently. These properties make the scheme a suitable choice for practical applications.

  14. Dual EC : a standardized back door

    NARCIS (Netherlands)

    Bernstein, D.J.; Lange, T.; Niederhagen, R.F.

    2015-01-01

    Dual EC is an algorithm to compute pseudorandom numbers starting from some random input. Dual EC was standardized by NIST, ANSI, and ISO among other algorithms to generate pseudorandom numbers. For a long time this algorithm was considered suspicious -- the entity designing the algorithm could have

  15. Implementation of a RANLUX Based Pseudo-Random Number Generator in FPGA Using VHDL and Impulse C

    OpenAIRE

    Agnieszka Dąbrowska-Boruch; Grzegorz Gancarczyk; Kazimierz Wiatr

    2014-01-01

    Monte Carlo simulations are widely used e.g. in the field of physics and molecular modelling. The main role played in these is by the high performance random number generators, such as RANLUX or MERSSENE TWISTER. In this paper the authors introduce the world's first implementation of the RANLUX algorithm on an FPGA platform for high performance computing purposes. A significant speed-up of one generator instance over 60 times, compared with a graphic card based solution, can be noticed. Compa...

  16. Range walk error correction and modeling on Pseudo-random photon counting system

    Science.gov (United States)

    Shen, Shanshan; Chen, Qian; He, Weiji

    2017-08-01

    Signal to noise ratio and depth accuracy are modeled for the pseudo-random ranging system with two random processes. The theoretical results, developed herein, capture the effects of code length and signal energy fluctuation are shown to agree with Monte Carlo simulation measurements. First, the SNR is developed as a function of the code length. Using Geiger-mode avalanche photodiodes (GMAPDs), longer code length is proven to reduce the noise effect and improve SNR. Second, the Cramer-Rao lower bound on range accuracy is derived to justify that longer code length can bring better range accuracy. Combined with the SNR model and CRLB model, it is manifested that the range accuracy can be improved by increasing the code length to reduce the noise-induced error. Third, the Cramer-Rao lower bound on range accuracy is shown to converge to the previously published theories and introduce the Gauss range walk model to range accuracy. Experimental tests also converge to the presented boundary model in this paper. It has been proven that depth error caused by the fluctuation of the number of detected photon counts in the laser echo pulse leads to the depth drift of Time Point Spread Function (TPSF). Finally, numerical fitting function is used to determine the relationship between the depth error and the photon counting ratio. Depth error due to different echo energy is calibrated so that the corrected depth accuracy is improved to 1cm.

  17. Random digital encryption secure communication system

    Science.gov (United States)

    Doland, G. D. (Inventor)

    1982-01-01

    The design of a secure communication system is described. A product code, formed from two pseudorandom sequences of digital bits, is used to encipher or scramble data prior to transmission. The two pseudorandom sequences are periodically changed at intervals before they have had time to repeat. One of the two sequences is transmitted continuously with the scrambled data for synchronization. In the receiver portion of the system, the incoming signal is compared with one of two locally generated pseudorandom sequences until correspondence between the sequences is obtained. At this time, the two locally generated sequences are formed into a product code which deciphers the data from the incoming signal. Provision is made to ensure synchronization of the transmitting and receiving portions of the system.

  18. An On-Demand Optical Quantum Random Number Generator with In-Future Action and Ultra-Fast Response.

    Science.gov (United States)

    Stipčević, Mario; Ursin, Rupert

    2015-06-09

    Random numbers are essential for our modern information based society e.g. in cryptography. Unlike frequently used pseudo-random generators, physical random number generators do not depend on complex algorithms but rather on a physical process to provide true randomness. Quantum random number generators (QRNG) do rely on a process, which can be described by a probabilistic theory only, even in principle. Here we present a conceptually simple implementation, which offers a 100% efficiency of producing a random bit upon a request and simultaneously exhibits an ultra low latency. A careful technical and statistical analysis demonstrates its robustness against imperfections of the actual implemented technology and enables to quickly estimate randomness of very long sequences. Generated random numbers pass standard statistical tests without any post-processing. The setup described, as well as the theory presented here, demonstrate the maturity and overall understanding of the technology.

  19. Verification of EPA's " Preliminary remediation goals for radionuclides" (PRG) electronic calculator

    Energy Technology Data Exchange (ETDEWEB)

    Stagich, B. H. [Savannah River Site (SRS), Aiken, SC (United States). Savannah River National Lab. (SRNL)

    2017-03-29

    The U.S. Environmental Protection Agency (EPA) requested an external, independent verification study of their “Preliminary Remediation Goals for Radionuclides” (PRG) electronic calculator. The calculator provides information on establishing PRGs for radionuclides at Comprehensive Environmental Response, Compensation, and Liability Act (CERCLA) sites with radioactive contamination (Verification Study Charge, Background). These risk-based PRGs set concentration limits using carcinogenic toxicity values under specific exposure conditions (PRG User’s Guide, Section 1). The purpose of this verification study is to ascertain that the computer codes has no inherit numerical problems with obtaining solutions as well as to ensure that the equations are programmed correctly.

  20. Synchronization of random bit generators based on coupled chaotic lasers and application to cryptography.

    Science.gov (United States)

    Kanter, Ido; Butkovski, Maria; Peleg, Yitzhak; Zigzag, Meital; Aviad, Yaara; Reidler, Igor; Rosenbluh, Michael; Kinzel, Wolfgang

    2010-08-16

    Random bit generators (RBGs) constitute an important tool in cryptography, stochastic simulations and secure communications. The later in particular has some difficult requirements: high generation rate of unpredictable bit strings and secure key-exchange protocols over public channels. Deterministic algorithms generate pseudo-random number sequences at high rates, however, their unpredictability is limited by the very nature of their deterministic origin. Recently, physical RBGs based on chaotic semiconductor lasers were shown to exceed Gbit/s rates. Whether secure synchronization of two high rate physical RBGs is possible remains an open question. Here we propose a method, whereby two fast RBGs based on mutually coupled chaotic lasers, are synchronized. Using information theoretic analysis we demonstrate security against a powerful computational eavesdropper, capable of noiseless amplification, where all parameters are publicly known. The method is also extended to secure synchronization of a small network of three RBGs.

  1. Implementation of LT codes based on chaos

    International Nuclear Information System (INIS)

    Zhou Qian; Li Liang; Chen Zengqiang; Zhao Jiaxiang

    2008-01-01

    Fountain codes provide an efficient way to transfer information over erasure channels like the Internet. LT codes are the first codes fully realizing the digital fountain concept. They are asymptotically optimal rateless erasure codes with highly efficient encoding and decoding algorithms. In theory, for each encoding symbol of LT codes, its degree is randomly chosen according to a predetermined degree distribution, and its neighbours used to generate that encoding symbol are chosen uniformly at random. Practical implementation of LT codes usually realizes the randomness through pseudo-randomness number generator like linear congruential method. This paper applies the pseudo-randomness of chaotic sequence in the implementation of LT codes. Two Kent chaotic maps are used to determine the degree and neighbour(s) of each encoding symbol. It is shown that the implemented LT codes based on chaos perform better than the LT codes implemented by the traditional pseudo-randomness number generator. (general)

  2. On Sequence Lengths of Some Special External Exclusive OR Type LFSR Structures – Study and Analysis

    Directory of Open Access Journals (Sweden)

    A Ahmad

    2014-12-01

    Full Text Available The study of the length of pseudo-random binary sequences generated by Linear- Feedback Shift Registers (LFSRs plays an important role in the design approaches of built-in selftest, cryptosystems, and other applications. However, certain LFSR structures might not be appropriate in some situations. Given that determining the length of generated pseudo-random binary sequence is a complex task, therefore, before using an LFSR structure, it is essential to investigate the length and the properties of the sequence. This paper investigates some conditions and LFSR’s structures, which restrict the pseudo-random binary sequences’ generation to a certain fixed length. The outcomes of this paper are presented in the form of theorems, simulations, and analyses. We believe that these outcomes are of great importance to the designers of built-in self-test equipment, cryptosystems, and other applications such as radar, CDMA, error correction, and Monte Carlo simulation.

  3. Search for a perfect generator of random numbers

    International Nuclear Information System (INIS)

    Musyck, E.

    1977-01-01

    Theoretical tests have been carried out by COVEYOU and MAC PHERSON to verify the applications of the LEHMER algorithm. In a similar way, a theoretical method is proposed to evaluate in a rigorous way the random character of numbers generated by a shift register. This theory introduces the concept of ''degree of randomness'' of the elements, taken in a definite order, of a shift register. It permits making the judicious choice of the elements of the shift register which will produce the bits of the random numbers. On the other hand, a calculation method is developed in order to verify the primitive character of any shift register of high complexity. A new test, called ''slice test'', of empirical and theoretical use is also described; it constitutes a significant contribution to the understanding of certain properties of pseudo-random sequences. As a practical example, a random number generator structure formed with 32 bits, built out of a shift register with 61 elements and 60 modulo-2 adder circuits was made. The author is convinced that this generator can be considered to be practically perfect for all empirical applications of random numbers, particularly for the solution of Monte-Carlo problems. (author)

  4. Subrandom methods for multidimensional nonuniform sampling.

    Science.gov (United States)

    Worley, Bradley

    2016-08-01

    Methods of nonuniform sampling that utilize pseudorandom number sequences to select points from a weighted Nyquist grid are commonplace in biomolecular NMR studies, due to the beneficial incoherence introduced by pseudorandom sampling. However, these methods require the specification of a non-arbitrary seed number in order to initialize a pseudorandom number generator. Because the performance of pseudorandom sampling schedules can substantially vary based on seed number, this can complicate the task of routine data collection. Approaches such as jittered sampling and stochastic gap sampling are effective at reducing random seed dependence of nonuniform sampling schedules, but still require the specification of a seed number. This work formalizes the use of subrandom number sequences in nonuniform sampling as a means of seed-independent sampling, and compares the performance of three subrandom methods to their pseudorandom counterparts using commonly applied schedule performance metrics. Reconstruction results using experimental datasets are also provided to validate claims made using these performance metrics. Copyright © 2016 Elsevier Inc. All rights reserved.

  5. Aptaligner: automated software for aligning pseudorandom DNA X-aptamers from next-generation sequencing data.

    Science.gov (United States)

    Lu, Emily; Elizondo-Riojas, Miguel-Angel; Chang, Jeffrey T; Volk, David E

    2014-06-10

    Next-generation sequencing results from bead-based aptamer libraries have demonstrated that traditional DNA/RNA alignment software is insufficient. This is particularly true for X-aptamers containing specialty bases (W, X, Y, Z, ...) that are identified by special encoding. Thus, we sought an automated program that uses the inherent design scheme of bead-based X-aptamers to create a hypothetical reference library and Markov modeling techniques to provide improved alignments. Aptaligner provides this feature as well as length error and noise level cutoff features, is parallelized to run on multiple central processing units (cores), and sorts sequences from a single chip into projects and subprojects.

  6. A Novel Memcapacitor Model and Its Application for Generating Chaos

    Directory of Open Access Journals (Sweden)

    Guangyi Wang

    2016-01-01

    Full Text Available Memristor and memcapacitor are new nonlinear devices with memory. We present a novel memcapacitor model that has the capability of capturing the behavior of a memcapacitor. Based on this model we also design a chaotic oscillator circuit that contains a HP memristor and the memcapacitor model for generating good pseudorandom sequences. Its dynamic behaviors, including equilibrium points, stability, and bifurcation characteristics, are analyzed in detail. It is found that the proposed oscillator can exhibit some complex phenomena, such as chaos, hyperchaos, coexisting attractors, abrupt chaos, and some novel bifurcations. Moreover, a scheme for digitally realizing this oscillator is provided by using the digital signal processor (DSP technology. Then the random characteristics of the chaotic binary sequences generated from the oscillator are tested via the test suit of National Institute of Standards and Technology (NIST. The tested randomness definitely reaches the standards of NIST and is better than that of the well-known Lorenz system.

  7. A new sentence generator providing material for maximum reading speed measurement.

    Science.gov (United States)

    Perrin, Jean-Luc; Paillé, Damien; Baccino, Thierry

    2015-12-01

    A new method is proposed to generate text material for assessing maximum reading speed of adult readers. The described procedure allows one to generate a vast number of equivalent short sentences. These sentences can be displayed for different durations in order to determine the reader's maximum speed using a psychophysical threshold algorithm. Each sentence is built so that it is either true or false according to common knowledge. The actual reading is verified by asking the reader to determine the truth value of each sentence. We based our design on the generator described by Crossland et al. and upgraded it. The new generator handles concepts distributed in an ontology, which allows an easy determination of the sentences' truth value and control of lexical and psycholinguistic parameters. In this way many equivalent sentence can be generated and displayed to perform the measurement. Maximum reading speed scores obtained with pseudo-randomly chosen sentences from the generator were strongly correlated with maximum reading speed scores obtained with traditional MNREAD sentences (r = .836). Furthermore, the large number of sentences that can be generated makes it possible to perform repeated measurements, since the possibility of a reader learning individual sentences is eliminated. Researchers interested in within-reader performance variability could use the proposed method for this purpose.

  8. Binary pseudo-random gratings and arrays for calibration of the modulation transfer function of surface profilometers: recent developments

    Energy Technology Data Exchange (ETDEWEB)

    Barber, Samuel K.; Soldate, Paul; Anderson, Erik H.; Cambie, Rossana; Marchesini, Stefano; McKinney, Wanye R.; Takacs, Peter Z.; Voronov, Dmitry L.; Yashchuk, Valeriy V.

    2009-07-07

    The major problem of measurement of a power spectral density (PSD) distribution of the surface heights with surface profilometers arises due to the unknown Modulation Transfer Function (MTF) of the instruments. The MTF tends to distort the PSD at higher spatial frequencies. It has been suggested [Proc. SPIE 7077-7, (2007), Opt. Eng. 47 (7), 073602-1-5 (2008)] that the instrumental MTF of a surface profiler can be precisely measured using standard test surfaces based on binary pseudo-random (BPR) patterns. In the cited work, a one dimensional (1D) realization of the suggested method based on use of BPR gratings has been demonstrated. Here, we present recent achievements made in fabricating and using two-dimensional (2D) BPR arrays that allow for a direct 2D calibration of the instrumental MTF. The 2D BPRAs were used as standard test surfaces for 2D MTF calibration of the MicromapTM-570 interferometric microscope with all available objectives. The effects of fabrication imperfections on the efficiency of calibration are also discussed.

  9. Binary Pseudo-Random Gratings and Arrays for Calibration of Modulation Transfer Functions of Surface Profilometers

    Energy Technology Data Exchange (ETDEWEB)

    Barber, Samuel K.; Anderson, Erik D.; Cambie, Rossana; McKinney, Wayne R.; Takacs, Peter Z.; Stover, John C.; Voronov, Dmitriy L.; Yashchuk, Valeriy V.

    2009-09-11

    A technique for precise measurement of the modulation transfer function (MTF), suitable for characterization of a broad class of surface profilometers, is investigated in detail. The technique suggested in [Proc. SPIE 7077-7, (2007), Opt. Eng. 47(7), 073602-1-5 (2008)]is based on use of binary pseudo-random (BPR) gratings and arrays as standard MTF test surfaces. Unlike most conventional test surfaces, BPR gratings and arrays possess white-noise-like inherent power spectral densities (PSD), allowing the direct determination of the one- and two-dimensional MTF, respectively, with a sensitivity uniform over the entire spatial frequency range of a profiler. In the cited work, a one dimensional realization of the suggested method based on use of BPR gratings has been demonstrated. Here, a high-confidence of the MTF calibration technique is demonstrated via cross comparison measurements of a number of two dimensional BPR arrays using two different interferometric microscopes and a scatterometer. We also present the results of application of the experimentally determined MTF correction to the measurement taken with the MicromapTM-570 interferometric microscope of the surface roughness of a super-polished test mirror. In this particular case, without accounting for the instrumental MTF, the surface rms roughness over half of the instrumental spatial frequency bandwidth would be underestimated by a factor of approximately 1.4.

  10. Pseudo-noise generator using UNMBER SIEVE''. Kazu furui wo mochiita giji ransu seiseiki

    Energy Technology Data Exchange (ETDEWEB)

    Kyan, S.; Teruya, H. (University of the Ryukyus, Okinawa (Japan). College of Engineering)

    1992-09-01

    In data communications which require secrecy, the Vernam cipher method is often used because of its simple principle and high security. It is necessary for this method to generate key streams as random numbers. The conventional generating methods using linear feedback shift register (LFSR) or data encryption standard(DES) have some problems in and security and circuit complexity. This paper proposes a pseudo-noise generator of relatively simple structure using number sieve, and describes its structure and security. The pseudo-noise generator consists of the number sieve circuit combined With shift resistors of figures of 8 prime numbers from 2 to 19 and other resisters containing AND in feedback area. The total number of keys that can be selected is 3.8[times]10[sup 25], which is not readable from the aspect of calculation volume. Concerning a model of the number sieve circuit with shift resistors which are reduced to 4, linear complexity, which is part of evaluation standard for the security of pseudo-random numbers for cipher, and hamming distance for different keys are examined. 10 refs., 8 figs., 3 tabs.

  11. Production of a pseudo-random square wave using a shift register with binary feedbacks; Generation d'un creneau pseudo-aleatoire par un registre a decalage a contre-reaction binaire

    Energy Technology Data Exchange (ETDEWEB)

    Stern, T E; Cazemajou, J; Macherez, B; Valat, J; Vignon, A

    1964-07-01

    We summarize here the theoretical basis for the production of square wave having the values '1' or '0', the switching times being 'pseudo-random'. More precisely, the square-wave may or may not change value at regular time intervals of length {delta}, with probability approximately. 5 for each alternative. The wave-form is obtained by means of a shift-register having modulo-2 feedback. If the interval {delta} and the feedback connections are well chosen, it is possible to produce a waveform whose autocorrelation function is very close to a Dirac delta function. The square-wave therefore behaves like a quantized white noise, which has very interesting properties in cross-correlation techniques. (authors) [French] On resume ici les bases theoriques permettant d'obtenir un creneau prenant les valeurs '1' ou '0', les instants de commutation etant pseudo-aleatoires. Plus exactement, le creneau a la possibilite de changer (ou de ne pas changer) d'etat a intervalles de temps reguliers, separes par intervalle elementaire {delta}, chacune des deux possibilites possedant une probabilite d'apparition tres voisine de 0,5. Le creneau est obtenu par un registre a decalage (shift register) a contre-reactions logiques modulo-2. Si l'intervalle {delta} et les contre-reactions sont judicieusement choisis, il est possible d'obtenir pour le creneau une fonction d'autocorrelation triangulaire tres voisine d'une impulsion de Dirac. Par suite le creneau se comporte comme un bruit blanc quantifie possedant de tres interessantes proprietes pour les techniques statistiques d'intercorrelation. (auteurs)

  12. Humans can consciously generate random number sequences: a possible test for artificial intelligence.

    Science.gov (United States)

    Persaud, Navindra

    2005-01-01

    Computer algorithms can only produce seemingly random or pseudorandom numbers whereas certain natural phenomena, such as the decay of radioactive particles, can be utilized to produce truly random numbers. In this study, the ability of humans to generate random numbers was tested in healthy adults. Subjects were simply asked to generate and dictate random numbers. Generated numbers were tested for uniformity, independence and information density. The results suggest that humans can generate random numbers that are uniformly distributed, independent of one another and unpredictable. If humans can generate sequences of random numbers then neural networks or forms of artificial intelligence, which are purported to function in ways essentially the same as the human brain, should also be able to generate sequences of random numbers. Elucidating the precise mechanism by which humans generate random number sequences and the underlying neural substrates may have implications in the cognitive science of decision-making. It is possible that humans use their random-generating neural machinery to make difficult decisions in which all expected outcomes are similar. It is also possible that certain people, perhaps those with neurological or psychiatric impairments, are less able or unable to generate random numbers. If the random-generating neural machinery is employed in decision making its impairment would have profound implications in matters of agency and free will.

  13. Recommendations and illustrations for the evaluation of photonic random number generators

    Science.gov (United States)

    Hart, Joseph D.; Terashima, Yuta; Uchida, Atsushi; Baumgartner, Gerald B.; Murphy, Thomas E.; Roy, Rajarshi

    2017-09-01

    The never-ending quest to improve the security of digital information combined with recent improvements in hardware technology has caused the field of random number generation to undergo a fundamental shift from relying solely on pseudo-random algorithms to employing optical entropy sources. Despite these significant advances on the hardware side, commonly used statistical measures and evaluation practices remain ill-suited to understand or quantify the optical entropy that underlies physical random number generation. We review the state of the art in the evaluation of optical random number generation and recommend a new paradigm: quantifying entropy generation and understanding the physical limits of the optical sources of randomness. In order to do this, we advocate for the separation of the physical entropy source from deterministic post-processing in the evaluation of random number generators and for the explicit consideration of the impact of the measurement and digitization process on the rate of entropy production. We present the Cohen-Procaccia estimate of the entropy rate h (𝜖 ,τ ) as one way to do this. In order to provide an illustration of our recommendations, we apply the Cohen-Procaccia estimate as well as the entropy estimates from the new NIST draft standards for physical random number generators to evaluate and compare three common optical entropy sources: single photon time-of-arrival detection, chaotic lasers, and amplified spontaneous emission.

  14. Recommendations and illustrations for the evaluation of photonic random number generators

    Directory of Open Access Journals (Sweden)

    Joseph D. Hart

    2017-09-01

    Full Text Available The never-ending quest to improve the security of digital information combined with recent improvements in hardware technology has caused the field of random number generation to undergo a fundamental shift from relying solely on pseudo-random algorithms to employing optical entropy sources. Despite these significant advances on the hardware side, commonly used statistical measures and evaluation practices remain ill-suited to understand or quantify the optical entropy that underlies physical random number generation. We review the state of the art in the evaluation of optical random number generation and recommend a new paradigm: quantifying entropy generation and understanding the physical limits of the optical sources of randomness. In order to do this, we advocate for the separation of the physical entropy source from deterministic post-processing in the evaluation of random number generators and for the explicit consideration of the impact of the measurement and digitization process on the rate of entropy production. We present the Cohen-Procaccia estimate of the entropy rate h(,τ as one way to do this. In order to provide an illustration of our recommendations, we apply the Cohen-Procaccia estimate as well as the entropy estimates from the new NIST draft standards for physical random number generators to evaluate and compare three common optical entropy sources: single photon time-of-arrival detection, chaotic lasers, and amplified spontaneous emission.

  15. DNA based random key generation and management for OTP encryption.

    Science.gov (United States)

    Zhang, Yunpeng; Liu, Xin; Sun, Manhui

    2017-09-01

    One-time pad (OTP) is a principle of key generation applied to the stream ciphering method which offers total privacy. The OTP encryption scheme has proved to be unbreakable in theory, but difficult to realize in practical applications. Because OTP encryption specially requires the absolute randomness of the key, its development has suffered from dense constraints. DNA cryptography is a new and promising technology in the field of information security. DNA chromosomes storing capabilities can be used as one-time pad structures with pseudo-random number generation and indexing in order to encrypt the plaintext messages. In this paper, we present a feasible solution to the OTP symmetric key generation and transmission problem with DNA at the molecular level. Through recombinant DNA technology, by using only sender-receiver known restriction enzymes to combine the secure key represented by DNA sequence and the T vector, we generate the DNA bio-hiding secure key and then place the recombinant plasmid in implanted bacteria for secure key transmission. The designed bio experiments and simulation results show that the security of the transmission of the key is further improved and the environmental requirements of key transmission are reduced. Analysis has demonstrated that the proposed DNA-based random key generation and management solutions are marked by high security and usability. Published by Elsevier B.V.

  16. Synchronous Generator Model Parameter Estimation Based on Noisy Dynamic Waveforms

    Science.gov (United States)

    Berhausen, Sebastian; Paszek, Stefan

    2016-01-01

    In recent years, there have occurred system failures in many power systems all over the world. They have resulted in a lack of power supply to a large number of recipients. To minimize the risk of occurrence of power failures, it is necessary to perform multivariate investigations, including simulations, of power system operating conditions. To conduct reliable simulations, the current base of parameters of the models of generating units, containing the models of synchronous generators, is necessary. In the paper, there is presented a method for parameter estimation of a synchronous generator nonlinear model based on the analysis of selected transient waveforms caused by introducing a disturbance (in the form of a pseudorandom signal) in the generator voltage regulation channel. The parameter estimation was performed by minimizing the objective function defined as a mean square error for deviations between the measurement waveforms and the waveforms calculated based on the generator mathematical model. A hybrid algorithm was used for the minimization of the objective function. In the paper, there is described a filter system used for filtering the noisy measurement waveforms. The calculation results of the model of a 44 kW synchronous generator installed on a laboratory stand of the Institute of Electrical Engineering and Computer Science of the Silesian University of Technology are also given. The presented estimation method can be successfully applied to parameter estimation of different models of high-power synchronous generators operating in a power system.

  17. RANDNA: a random DNA sequence generator.

    Science.gov (United States)

    Piva, Francesco; Principato, Giovanni

    2006-01-01

    Monte Carlo simulations are useful to verify the significance of data. Genomic regularities, such as the nucleotide correlations or the not uniform distribution of the motifs throughout genomic or mature mRNA sequences, exist and their significance can be checked by means of the Monte Carlo test. The test needs good quality random sequences in order to work, moreover they should have the same nucleotide distribution as the sequences in which the regularities have been found. Random DNA sequences are also useful to estimate the background score of an alignment, that is a threshold below which the resulting score is merely due to chance. We have developed RANDNA, a free software which allows to produce random DNA or RNA sequences setting both their length and the percentage of nucleotide composition. Sequences having the same nucleotide distribution of exonic, intronic or intergenic sequences can be generated. Its graphic interface makes it possible to easily set the parameters that characterize the sequences being produced and saved in a text format file. The pseudo-random number generator function of Borland Delphi 6 is used, since it guarantees a good randomness, a long cycle length and a high speed. We have checked the quality of sequences generated by the software, by means of well-known tests, both by themselves and versus genuine random sequences. We show the good quality of the generated sequences. The software, complete with examples and documentation, is freely available to users from: http://www.introni.it/en/software.

  18. Efficient Sampling of the Structure of Crypto Generators' State Transition Graphs

    Science.gov (United States)

    Keller, Jörg

    Cryptographic generators, e.g. stream cipher generators like the A5/1 used in GSM networks or pseudo-random number generators, are widely used in cryptographic network protocols. Basically, they are finite state machines with deterministic transition functions. Their state transition graphs typically cannot be analyzed analytically, nor can they be explored completely because of their size which typically is at least n = 264. Yet, their structure, i.e. number and sizes of weakly connected components, is of interest because a structure deviating significantly from expected values for random graphs may form a distinguishing attack that indicates a weakness or backdoor. By sampling, one randomly chooses k nodes, derives their distribution onto connected components by graph exploration, and extrapolates these results to the complete graph. In known algorithms, the computational cost to determine the component for one randomly chosen node is up to O(√n), which severely restricts the sample size k. We present an algorithm where the computational cost to find the connected component for one randomly chosen node is O(1), so that a much larger sample size k can be analyzed in a given time. We report on the performance of a prototype implementation, and about preliminary analysis for several generators.

  19. A fast image encryption system based on chaotic maps with finite precision representation

    International Nuclear Information System (INIS)

    Kwok, H.S.; Tang, Wallace K.S.

    2007-01-01

    In this paper, a fast chaos-based image encryption system with stream cipher structure is proposed. In order to achieve a fast throughput and facilitate hardware realization, 32-bit precision representation with fixed point arithmetic is assumed. The major core of the encryption system is a pseudo-random keystream generator based on a cascade of chaotic maps, serving the purpose of sequence generation and random mixing. Unlike the other existing chaos-based pseudo-random number generators, the proposed keystream generator not only achieves a very fast throughput, but also passes the statistical tests of up-to-date test suite even under quantization. The overall design of the image encryption system is to be explained while detail cryptanalysis is given and compared with some existing schemes

  20. Digital circuit for the introduction and later removal of dither from an analog signal

    Science.gov (United States)

    Borgen, Gary S.

    1994-05-01

    An electronics circuit is presented for accurately digitizing an analog audio or like data signal into a digital equivalent signal by introducing dither into the analog signal and then subsequently removing the dither from the digitized signal prior to its conversion to an analog signal which is a substantial replica of the incoming analog audio or like data signal. The electronics circuit of the present invention is characterized by a first pseudo-random number generator which generates digital random noise signals or dither for addition to the digital equivalent signal and a second pseudo-random number generator which generates subtractive digital random noise signals for the subsequent removal of dither from the digital equivalent signal prior its conversion to the analog replica signal.

  1. Generation of pseudo-random sequences for spread spectrum systems

    Science.gov (United States)

    Moser, R.; Stover, J.

    1985-05-01

    The characteristics of pseudo random radio signal sequences (PRS) are explored. The randomness of the PSR is a matter of artificially altering the sequence of binary digits broadcast. Autocorrelations of the two sequences shifted in time, if high, determine if the signals are the same and thus allow for position identification. Cross-correlation can also be calculated between sequences. Correlations closest to zero are obtained with large volume of prime numbers in the sequences. Techniques for selecting optimal and maximal lengths for the sequences are reviewed. If the correlations are near zero in the sequences, then signal channels can accommodate multiple users. Finally, Gold codes are discussed as a technique for maximizing the code lengths.

  2. A Multi-Threaded Cryptographic Pseudorandom Number Generator Test Suite

    Science.gov (United States)

    2016-09-01

    bitcoin thieves, Google releases patch. (2013, Aug. 16). SiliconANGLE. [Online]. Available: http://siliconangle.com/blog/2013/ 08/16/android-crypto-prng...flaw-aided- bitcoin -thieves-google-releases-patch/ [5] M. Gondree. (2014, Sep. 28). NPS POSIX thread pool library. [Online]. Available: https

  3. An efficient parallel pseudorandom bit generator based on an ...

    Indian Academy of Sciences (India)

    bit sequences pass all of the NIST SP800-22 statistical tests. ... local map, the chaotic behaviours of which depend only on the local map parameter, ..... 3, 4, ..., N. Thus, one-bit change of a 64-bit IV can result in 8(N − 2) + 1 bits change for 32N ...

  4. Performance analysis of chaotic and white watermarks in the presence of common watermark attacks

    Energy Technology Data Exchange (ETDEWEB)

    Mooney, Aidan [Department of Computer Science, NUI Maynooth, Co. Kildare (Ireland)], E-mail: amooney@cs.nuim.ie; Keating, John G. [Department of Computer Science, NUI Maynooth, Co. Kildare (Ireland)], E-mail: john.keating@nuim.ie; Heffernan, Daniel M. [Department of Mathematical Physics, NUI Maynooth, Co. Kildare (Ireland); School of Theoretical Physics, Dublin Institute for Advanced Studies, Dublin 4 (Ireland)], E-mail: dmh@thphys.nuim.ie

    2009-10-15

    Digital watermarking is a technique that aims to embed a piece of information permanently into some digital media, which may be used at a later stage to prove owner authentication and attempt to provide protection to documents. The most common watermark types used to date are pseudorandom number sequences which possess a white spectrum. Chaotic watermark sequences have been receiving increasing interest recently and have been shown to be an alternative to the pseudorandom watermark types. In this paper the performance of pseudorandom watermarks and chaotic watermarks in the presence of common watermark attacks is performed. The chaotic watermarks are generated from the iteration of the skew tent map, the Bernoulli map and the logistic map. The analysis focuses on the watermarked images after they have been subjected to common image distortion attacks. The capacities of each of these images are also calculated. It is shown that signals generated from lowpass chaotic signals have superior performance over the other signal types analysed for the attacks studied.

  5. Analysis of entropy extraction efficiencies in random number generation systems

    Science.gov (United States)

    Wang, Chao; Wang, Shuang; Chen, Wei; Yin, Zhen-Qiang; Han, Zheng-Fu

    2016-05-01

    Random numbers (RNs) have applications in many areas: lottery games, gambling, computer simulation, and, most importantly, cryptography [N. Gisin et al., Rev. Mod. Phys. 74 (2002) 145]. In cryptography theory, the theoretical security of the system calls for high quality RNs. Therefore, developing methods for producing unpredictable RNs with adequate speed is an attractive topic. Early on, despite the lack of theoretical support, pseudo RNs generated by algorithmic methods performed well and satisfied reasonable statistical requirements. However, as implemented, those pseudorandom sequences were completely determined by mathematical formulas and initial seeds, which cannot introduce extra entropy or information. In these cases, “random” bits are generated that are not at all random. Physical random number generators (RNGs), which, in contrast to algorithmic methods, are based on unpredictable physical random phenomena, have attracted considerable research interest. However, the way that we extract random bits from those physical entropy sources has a large influence on the efficiency and performance of the system. In this manuscript, we will review and discuss several randomness extraction schemes that are based on radiation or photon arrival times. We analyze the robustness, post-processing requirements and, in particular, the extraction efficiency of those methods to aid in the construction of efficient, compact and robust physical RNG systems.

  6. Analysis of heart rate and oxygen uptake kinetics studied by two different pseudo-random binary sequence work rate amplitudes.

    Science.gov (United States)

    Drescher, U; Koschate, J; Schiffer, T; Schneider, S; Hoffmann, U

    2017-06-01

    The aim of the study was to compare the kinetics responses of heart rate (HR), pulmonary (V˙O 2 pulm) and predicted muscular (V˙O 2 musc) oxygen uptake between two different pseudo-random binary sequence (PRBS) work rate (WR) amplitudes both below anaerobic threshold. Eight healthy individuals performed two PRBS WR protocols implying changes between 30W and 80W and between 30W and 110W. HR and V˙O 2 pulm were measured beat-to-beat and breath-by-breath, respectively. V˙O 2 musc was estimated applying the approach of Hoffmann et al. (Eur J Appl Physiol 113: 1745-1754, 2013) considering a circulatory model for venous return and cross-correlation functions (CCF) for the kinetics analysis. HR and V˙O 2 musc kinetics seem to be independent of WR intensity (p>0.05). V˙O 2 pulm kinetics show prominent differences in the lag of the CCF maximum (39±9s; 31±4s; p<0.05). A mean difference of 14W between the PRBS WR amplitudes impacts venous return significantly, while HR and V˙O 2 musc kinetics remain unchanged. Copyright © 2017 Elsevier B.V. All rights reserved.

  7. [A magnetic therapy apparatus with an adaptable electromagnetic spectrum for the treatment of prostatitis and gynecopathies].

    Science.gov (United States)

    Kuz'min, A A; Meshkovskiĭ, D V; Filist, S A

    2008-01-01

    Problems of engineering and algorithm development of magnetic therapy apparatuses with pseudo-random radiation spectrum within the audio range for treatment of prostatitis and gynecopathies are considered. A typical design based on a PIC 16F microcontroller is suggested. It includes a keyboard, LCD indicator, audio amplifier, inducer, and software units. The problem of pseudo-random signal generation within the audio range is considered. A series of rectangular pulses is generated on a random-length interval on the basis of a three-component random vector. This series provides the required spectral characteristics of the therapeutic magnetic field and their adaptation to the therapeutic conditions and individual features of the patient.

  8. Information hiding technology and application analysis based on decimal expansion of irrational numbers

    Science.gov (United States)

    Liu, Xiaoyong; Lu, Pei; Shao, Jianxin; Cao, Haibin; Zhu, Zhenmin

    2017-10-01

    In this paper, an information hiding method using decimal expansion of irrational numbers to generate random phase mask is proposed. Firstly, the decimal expansion parts of irrational numbers generate pseudo-random sequences using a new coding schemed, the irrational number and start and end bit numbers were used as keys in image information hiding. Secondly, we apply the coding schemed to the double phase encoding system, the pseudo-random sequences are taken to generate random phase masks. The mean square error is used to calculate the quality of the recovered image information. Finally, two tests had been carried out to verify the security of our method; the experimental results demonstrate that the cipher image has such features, strong robustness, key sensitivity, and resistance to brute force attack.

  9. Design and test of component circuits of an integrated quantum voltage noise source for Johnson noise thermometry

    International Nuclear Information System (INIS)

    Yamada, Takahiro; Maezawa, Masaaki; Urano, Chiharu

    2015-01-01

    Highlights: • We demonstrated RSFQ digital components of a new quantum voltage noise source. • A pseudo-random number generator and variable pulse number multiplier are designed. • Fabrication process is based on four Nb wiring layers and Nb/AlOx/Nb junctions. • The circuits successfully operated with wide dc bias current margins, 80–120%. - Abstract: We present design and testing of a pseudo-random number generator (PRNG) and a variable pulse number multiplier (VPNM) which are digital circuit subsystems in an integrated quantum voltage noise source for Jonson noise thermometry. Well-defined, calculable pseudo-random patterns of single flux quantum pulses are synthesized with the PRNG and multiplied digitally with the VPNM. The circuit implementation on rapid single flux quantum technology required practical circuit scales and bias currents, 279 junctions and 33 mA for the PRNG, and 1677 junctions and 218 mA for the VPNM. We confirmed the circuit operation with sufficiently wide margins, 80–120%, with respect to the designed bias currents.

  10. Design and test of component circuits of an integrated quantum voltage noise source for Johnson noise thermometry

    Energy Technology Data Exchange (ETDEWEB)

    Yamada, Takahiro, E-mail: yamada-takahiro@aist.go.jp [Nanoelectronics Research Institute, National Institute of Advanced Industrial Science and Technology, Central 2, Umezono 1-1-1, Tsukuba, Ibaraki 305-8568 (Japan); Maezawa, Masaaki [Nanoelectronics Research Institute, National Institute of Advanced Industrial Science and Technology, Central 2, Umezono 1-1-1, Tsukuba, Ibaraki 305-8568 (Japan); Urano, Chiharu [National Metrology Institute of Japan, National Institute of Advanced Industrial Science and Technology, Central 3, Umezono 1-1-1, Tsukuba, Ibaraki 305-8563 (Japan)

    2015-11-15

    Highlights: • We demonstrated RSFQ digital components of a new quantum voltage noise source. • A pseudo-random number generator and variable pulse number multiplier are designed. • Fabrication process is based on four Nb wiring layers and Nb/AlOx/Nb junctions. • The circuits successfully operated with wide dc bias current margins, 80–120%. - Abstract: We present design and testing of a pseudo-random number generator (PRNG) and a variable pulse number multiplier (VPNM) which are digital circuit subsystems in an integrated quantum voltage noise source for Jonson noise thermometry. Well-defined, calculable pseudo-random patterns of single flux quantum pulses are synthesized with the PRNG and multiplied digitally with the VPNM. The circuit implementation on rapid single flux quantum technology required practical circuit scales and bias currents, 279 junctions and 33 mA for the PRNG, and 1677 junctions and 218 mA for the VPNM. We confirmed the circuit operation with sufficiently wide margins, 80–120%, with respect to the designed bias currents.

  11. Calibration of the modulation transfer function of surface profilometers with binary pseudo-random test standards: expanding the application range

    International Nuclear Information System (INIS)

    Yashchuk, Valeriy V.; Anderson, Erik H.; Barber, Samuel K.; Bouet, Nathalie; Cambie, Rossana; Conley, Raymond; McKinney, Wayne R.; Takacs, Peter Z.; Voronov, Dmitriy L.

    2011-01-01

    A modulation transfer function (MTF) calibration method based on binary pseudo-random (BPR) gratings and arrays (Proc. SPIE 7077-7 (2007), Opt. Eng. 47, 073602 (2008)) has been proven to be an effective MTF calibration method for a number of interferometric microscopes and a scatterometer (Nucl. Instr. and Meth. A616, 172 (2010)). Here we report on a further expansion of the application range of the method. We describe the MTF calibration of a 6 inch phase shifting Fizeau interferometer. Beyond providing a direct measurement of the interferometer's MTF, tests with a BPR array surface have revealed an asymmetry in the instrument's data processing algorithm that fundamentally limits its bandwidth. Moreover, the tests have illustrated the effects of the instrument's detrending and filtering procedures on power spectral density measurements. The details of the development of a BPR test sample suitable for calibration of scanning and transmission electron microscopes are also presented. Such a test sample is realized as a multilayer structure with the layer thicknesses of two materials corresponding to BPR sequence. The investigations confirm the universal character of the method that makes it applicable to a large variety of metrology instrumentation with spatial wavelength bandwidths from a few nanometers to hundreds of millimeters.

  12. GASPRNG: GPU accelerated scalable parallel random number generator library

    Science.gov (United States)

    Gao, Shuang; Peterson, Gregory D.

    2013-04-01

    Graphics processors represent a promising technology for accelerating computational science applications. Many computational science applications require fast and scalable random number generation with good statistical properties, so they use the Scalable Parallel Random Number Generators library (SPRNG). We present the GPU Accelerated SPRNG library (GASPRNG) to accelerate SPRNG in GPU-based high performance computing systems. GASPRNG includes code for a host CPU and CUDA code for execution on NVIDIA graphics processing units (GPUs) along with a programming interface to support various usage models for pseudorandom numbers and computational science applications executing on the CPU, GPU, or both. This paper describes the implementation approach used to produce high performance and also describes how to use the programming interface. The programming interface allows a user to be able to use GASPRNG the same way as SPRNG on traditional serial or parallel computers as well as to develop tightly coupled programs executing primarily on the GPU. We also describe how to install GASPRNG and use it. To help illustrate linking with GASPRNG, various demonstration codes are included for the different usage models. GASPRNG on a single GPU shows up to 280x speedup over SPRNG on a single CPU core and is able to scale for larger systems in the same manner as SPRNG. Because GASPRNG generates identical streams of pseudorandom numbers as SPRNG, users can be confident about the quality of GASPRNG for scalable computational science applications. Catalogue identifier: AEOI_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEOI_v1_0.html Program obtainable from: CPC Program Library, Queen’s University, Belfast, N. Ireland Licensing provisions: UTK license. No. of lines in distributed program, including test data, etc.: 167900 No. of bytes in distributed program, including test data, etc.: 1422058 Distribution format: tar.gz Programming language: C and CUDA. Computer: Any PC or

  13. On the practical exploitability of dual EC in TLS implementations

    NARCIS (Netherlands)

    Checkoway, S.; Fredrikson, M.; Niederhagen, R.F.; Everspaugh, A.; Green, M.; Lange, T.; Ristenpart, T.; Bernstein, D.J.; Maskiewicz, J,; Shacham, H.

    2014-01-01

    This paper analyzes the actual cost of attacking TLS implementations that use NIST’s Dual EC pseudorandom number generator, assuming that the attacker generated the constants used in Dual EC. It has been known for several years that an attacker generating these constants and seeing a long enough

  14. Analisis Teoritis dan Empiris Uji Craps dari Diehard Battery of Randomness Test untuk Pengujian Pembangkit Bilangan Acaksemu

    Directory of Open Access Journals (Sweden)

    Sari Agustini Hafman

    2013-05-01

    Full Text Available According to Kerchoffs (1883, the security system should only rely on cryptographic keys which is used in that system. Generally, the key sequences are generated by a Pseudo Random Number Generator (PRNG or Random Number Generator (RNG. There are three types of randomness sequences that generated by the RNG and PRNG i.e. pseudorandom sequence, cryptographically secure pseudorandom sequences, and real random sequences. Several statistical tests, including diehard battery of tests of randomness, is used to check the type of randomness sequences that generated by PRNG or RNG. Due to its purpose, the principle on taking the testing parameters and the test statistic are associated with the validity of the conclusion produced by a statistical test, then the theoretical analysis is performed by applying a variety of statistical theory to evaluate craps test, one of the test included in the diehard battery of randomness tests. Craps test, inspired by craps game, aims to examine whether a PRNG produces an independent and identically distributed (iid pseudorandom sequences. To demonstrate the process to produce a test statistics equation and to show how craps games applied on that test, will be carried out theoretical analysis by applying a variety of statistical theory. Furthermore, empirical observations will be done by applying craps test on a PRNG in order to check the test effectiveness in detecting the distribution and independency of sequences which produced by PRNG

  15. Towards the generation of random bits at terahertz rates based on a chaotic semiconductor laser

    International Nuclear Information System (INIS)

    Kanter, Ido; Aviad, Yaara; Reidler, Igor; Cohen, Elad; Rosenbluh, Michael

    2010-01-01

    Random bit generators (RBGs) are important in many aspects of statistical physics and crucial in Monte-Carlo simulations, stochastic modeling and quantum cryptography. The quality of a RBG is measured by the unpredictability of the bit string it produces and the speed at which the truly random bits can be generated. Deterministic algorithms generate pseudo-random numbers at high data rates as they are only limited by electronic hardware speed, but their unpredictability is limited by the very nature of their deterministic origin. It is widely accepted that the core of any true RBG must be an intrinsically non-deterministic physical process, e.g. measuring thermal noise from a resistor. Owing to low signal levels, such systems are highly susceptible to bias, introduced by amplification, and to small nonrandom external perturbations resulting in a limited generation rate, typically less than 100M bit/s. We present a physical random bit generator, based on a chaotic semiconductor laser, having delayed optical feedback, which operates reliably at rates up to 300Gbit/s. The method uses a high derivative of the digitized chaotic laser intensity and generates the random sequence by retaining a number of the least significant bits of the high derivative value. The method is insensitive to laser operational parameters and eliminates the necessity for all external constraints such as incommensurate sampling rates and laser external cavity round trip time. The randomness of long bit strings is verified by standard statistical tests.

  16. Towards the generation of random bits at terahertz rates based on a chaotic semiconductor laser

    Science.gov (United States)

    Kanter, Ido; Aviad, Yaara; Reidler, Igor; Cohen, Elad; Rosenbluh, Michael

    2010-06-01

    Random bit generators (RBGs) are important in many aspects of statistical physics and crucial in Monte-Carlo simulations, stochastic modeling and quantum cryptography. The quality of a RBG is measured by the unpredictability of the bit string it produces and the speed at which the truly random bits can be generated. Deterministic algorithms generate pseudo-random numbers at high data rates as they are only limited by electronic hardware speed, but their unpredictability is limited by the very nature of their deterministic origin. It is widely accepted that the core of any true RBG must be an intrinsically non-deterministic physical process, e.g. measuring thermal noise from a resistor. Owing to low signal levels, such systems are highly susceptible to bias, introduced by amplification, and to small nonrandom external perturbations resulting in a limited generation rate, typically less than 100M bit/s. We present a physical random bit generator, based on a chaotic semiconductor laser, having delayed optical feedback, which operates reliably at rates up to 300Gbit/s. The method uses a high derivative of the digitized chaotic laser intensity and generates the random sequence by retaining a number of the least significant bits of the high derivative value. The method is insensitive to laser operational parameters and eliminates the necessity for all external constraints such as incommensurate sampling rates and laser external cavity round trip time. The randomness of long bit strings is verified by standard statistical tests.

  17. Assessment of the suitability of different random number generators for Monte Carlo simulations in gamma-ray spectrometry

    International Nuclear Information System (INIS)

    Cornejo Diaz, N.; Vergara Gil, A.; Jurado Vargas, M.

    2010-01-01

    The Monte Carlo method has become a valuable numerical laboratory framework in which to simulate complex physical systems. It is based on the generation of pseudo-random number sequences by numerical algorithms called random generators. In this work we assessed the suitability of different well-known random number generators for the simulation of gamma-ray spectrometry systems during efficiency calibrations. The assessment was carried out in two stages. The generators considered (Delphi's linear congruential, mersenne twister, XorShift, multiplier with carry, universal virtual array, and non-periodic logistic map based generator) were first evaluated with different statistical empirical tests, including moments, correlations, uniformity, independence of terms and the DIEHARD battery of tests. In a second step, an application-specific test was conducted by implementing the generators in our Monte Carlo program DETEFF and comparing the results obtained with them. The calculations were performed with two different CPUs, for a typical HpGe detector and a water sample in Marinelli geometry, with gamma-rays between 59 and 1800 keV. For the Non-periodic Logistic Map based generator, dependence of the most significant bits was evident. This explains the bias, in excess of 5%, of the efficiency values obtained with this generator. The results of the application-specific assessment and the statistical performance of the other algorithms studied indicate their suitability for the Monte Carlo simulation of gamma-ray spectrometry systems for efficiency calculations.

  18. Assessment of the suitability of different random number generators for Monte Carlo simulations in gamma-ray spectrometry.

    Science.gov (United States)

    Díaz, N Cornejo; Gil, A Vergara; Vargas, M Jurado

    2010-03-01

    The Monte Carlo method has become a valuable numerical laboratory framework in which to simulate complex physical systems. It is based on the generation of pseudo-random number sequences by numerical algorithms called random generators. In this work we assessed the suitability of different well-known random number generators for the simulation of gamma-ray spectrometry systems during efficiency calibrations. The assessment was carried out in two stages. The generators considered (Delphi's linear congruential, mersenne twister, XorShift, multiplier with carry, universal virtual array, and non-periodic logistic map based generator) were first evaluated with different statistical empirical tests, including moments, correlations, uniformity, independence of terms and the DIEHARD battery of tests. In a second step, an application-specific test was conducted by implementing the generators in our Monte Carlo program DETEFF and comparing the results obtained with them. The calculations were performed with two different CPUs, for a typical HpGe detector and a water sample in Marinelli geometry, with gamma-rays between 59 and 1800 keV. For the Non-periodic Logistic Map based generator, dependence of the most significant bits was evident. This explains the bias, in excess of 5%, of the efficiency values obtained with this generator. The results of the application-specific assessment and the statistical performance of the other algorithms studied indicate their suitability for the Monte Carlo simulation of gamma-ray spectrometry systems for efficiency calculations. Copyright 2009 Elsevier Ltd. All rights reserved.

  19. Binary pseudo-random patterned structures for modulation transfer function calibration and resolution characterization of a full-field transmission soft x-ray microscope

    Energy Technology Data Exchange (ETDEWEB)

    Yashchuk, V. V., E-mail: VVYashchuk@lbl.gov; Chan, E. R.; Lacey, I. [Advanced Light Source, Lawrence Berkeley National Laboratory, Berkeley, California 94720 (United States); Fischer, P. J. [Center for X-Ray Optics, Lawrence Berkeley National Laboratory, Berkeley, California 94720 (United States); Physics Department, University of California Santa Cruz, Santa Cruz, California 94056 (United States); Conley, R. [Advance Photon Source, Argonne National Laboratory, Argonne, Illinois 60439 (United States); National Synchrotron Light Source II, Brookhaven National Laboratory, Upton, New York 11973 (United States); McKinney, W. R. [Diablo Valley College, 321 Golf Club Road, Pleasant Hill, California 94523 (United States); Artemiev, N. A. [KLA-Tencor Corp., 1 Technology Drive, Milpitas, California 95035 (United States); Bouet, N. [National Synchrotron Light Source II, Brookhaven National Laboratory, Upton, New York 11973 (United States); Cabrini, S. [Molecular Foundry, Lawrence Berkeley National Laboratory, Berkeley, California 94720 (United States); Calafiore, G.; Peroz, C.; Babin, S. [aBeam Technologies, Inc., Hayward, California 94541 (United States)

    2015-12-15

    We present a modulation transfer function (MTF) calibration method based on binary pseudo-random (BPR) one-dimensional sequences and two-dimensional arrays as an effective method for spectral characterization in the spatial frequency domain of a broad variety of metrology instrumentation, including interferometric microscopes, scatterometers, phase shifting Fizeau interferometers, scanning and transmission electron microscopes, and at this time, x-ray microscopes. The inherent power spectral density of BPR gratings and arrays, which has a deterministic white-noise-like character, allows a direct determination of the MTF with a uniform sensitivity over the entire spatial frequency range and field of view of an instrument. We demonstrate the MTF calibration and resolution characterization over the full field of a transmission soft x-ray microscope using a BPR multilayer (ML) test sample with 2.8 nm fundamental layer thickness. We show that beyond providing a direct measurement of the microscope’s MTF, tests with the BPRML sample can be used to fine tune the instrument’s focal distance. Our results confirm the universality of the method that makes it applicable to a large variety of metrology instrumentation with spatial wavelength bandwidths from a few nanometers to hundreds of millimeters.

  20. Binary pseudo-random patterned structures for modulation transfer function calibration and resolution characterization of a full-field transmission soft x-ray microscope

    International Nuclear Information System (INIS)

    Yashchuk, V. V.; Chan, E. R.; Lacey, I.; Fischer, P. J.; Conley, R.; McKinney, W. R.; Artemiev, N. A.; Bouet, N.; Cabrini, S.; Calafiore, G.; Peroz, C.; Babin, S.

    2015-01-01

    We present a modulation transfer function (MTF) calibration method based on binary pseudo-random (BPR) one-dimensional sequences and two-dimensional arrays as an effective method for spectral characterization in the spatial frequency domain of a broad variety of metrology instrumentation, including interferometric microscopes, scatterometers, phase shifting Fizeau interferometers, scanning and transmission electron microscopes, and at this time, x-ray microscopes. The inherent power spectral density of BPR gratings and arrays, which has a deterministic white-noise-like character, allows a direct determination of the MTF with a uniform sensitivity over the entire spatial frequency range and field of view of an instrument. We demonstrate the MTF calibration and resolution characterization over the full field of a transmission soft x-ray microscope using a BPR multilayer (ML) test sample with 2.8 nm fundamental layer thickness. We show that beyond providing a direct measurement of the microscope’s MTF, tests with the BPRML sample can be used to fine tune the instrument’s focal distance. Our results confirm the universality of the method that makes it applicable to a large variety of metrology instrumentation with spatial wavelength bandwidths from a few nanometers to hundreds of millimeters

  1. Hardware Realization of Chaos-based Symmetric Video Encryption

    KAUST Repository

    Ibrahim, Mohamad A.

    2013-01-01

    This thesis reports original work on hardware realization of symmetric video encryption using chaos-based continuous systems as pseudo-random number generators. The thesis also presents some of the serious degradations caused by digitally

  2. CERN, World's largest particle physics lab, selects Progress SonicMQ

    CERN Document Server

    2007-01-01

    "Progress Software Corporation (NADAQ: PRGS), a global supplier of application insfrastructure software used to develop, deploy, integrate and manage business applications, today announced that CERN the world's largest physis laboratory and particle accelerator, has chosen Progress® SonicMQ® for mission-critical message delivery." (1 page)

  3. Verification of EPA's ''Preliminary Remediation Goals for radionuclides'' (PRG) electronic calculator

    Energy Technology Data Exchange (ETDEWEB)

    Jannik, Tim [Savannah River Site (SRS), Aiken, SC (United States). Savannah River National Lab. (SRNL); Stagich, Brooke [Savannah River Site (SRS), Aiken, SC (United States). Savannah River National Lab. (SRNL)

    2015-08-28

    The U.S. Environmental Protection Agency (EPA) requested an external, independent verification study of their updated “Preliminary Remediation Goals for Radionuclides” (PRG) electronic calculator. The calculator provides PRGs for radionuclides that are used as a screening tool at Comprehensive Environmental Response, Compensation, and Liability Act (CERCLA) and Resource Conservation and Recovery Act (RCRA) sites. These risk-based PRGs establish concentration limits under specific exposure scenarios. The purpose of this verification study is to determine that the calculator has no inherit numerical problems with obtaining solutions as well as to ensure that the equations are programmed correctly. There are 167 equations used in the calculator. To verify the calculator, all equations for each of seven receptor types (resident, construction worker, outdoor and indoor worker, recreator, farmer, and composite worker) were hand calculated using the default parameters. The same four radionuclides (Am-241, Co-60, H-3, and Pu-238) were used for each calculation for consistency throughout.

  4. Random Numbers and Quantum Computers

    Science.gov (United States)

    McCartney, Mark; Glass, David

    2002-01-01

    The topic of random numbers is investigated in such a way as to illustrate links between mathematics, physics and computer science. First, the generation of random numbers by a classical computer using the linear congruential generator and logistic map is considered. It is noted that these procedures yield only pseudo-random numbers since…

  5. Parallel Monte Carlo Particle Transport and the Quality of Random Number Generators: How Good is Good Enough?

    International Nuclear Information System (INIS)

    Procassini, R J; Beck, B R

    2004-01-01

    It might be assumed that use of a ''high-quality'' random number generator (RNG), producing a sequence of ''pseudo random'' numbers with a ''long'' repetition period, is crucial for producing unbiased results in Monte Carlo particle transport simulations. While several theoretical and empirical tests have been devised to check the quality (randomness and period) of an RNG, for many applications it is not clear what level of RNG quality is required to produce unbiased results. This paper explores the issue of RNG quality in the context of parallel, Monte Carlo transport simulations in order to determine how ''good'' is ''good enough''. This study employs the MERCURY Monte Carlo code, which incorporates the CNPRNG library for the generation of pseudo-random numbers via linear congruential generator (LCG) algorithms. The paper outlines the usage of random numbers during parallel MERCURY simulations, and then describes the source and criticality transport simulations which comprise the empirical basis of this study. A series of calculations for each test problem in which the quality of the RNG (period of the LCG) is varied provides the empirical basis for determining the minimum repetition period which may be employed without producing a bias in the mean integrated results

  6. Generalized hardware post-processing technique for chaos-based pseudorandom number generators

    KAUST Repository

    Barakat, Mohamed L.; Mansingka, Abhinav S.; Radwan, Ahmed Gomaa; Salama, Khaled N.

    2013-01-01

    reported systems in the literature. The enhancement in the randomness is further examined in a simple image encryption application resulting in a better security performance. The system is verified through experiment on a Xilinx Virtex 4 FPGA

  7. Self-Powered Random Number Generator Based on Coupled Triboelectric and Electrostatic Induction Effects at the Liquid-Dielectric Interface.

    Science.gov (United States)

    Yu, Aifang; Chen, Xiangyu; Cui, Haotian; Chen, Libo; Luo, Jianjun; Tang, Wei; Peng, Mingzeng; Zhang, Yang; Zhai, Junyi; Wang, Zhong Lin

    2016-12-27

    Modern cryptography increasingly employs random numbers generated from physical sources in lieu of conventional software-based pseudorandom numbers, primarily owing to the great demand of unpredictable, indecipherable cryptographic keys from true random numbers for information security. Thus, far, the sole demonstration of true random numbers has been generated through thermal noise and/or quantum effects, which suffers from expensive and complex equipment. In this paper, we demonstrate a method for self-powered creation of true random numbers by using triboelectric technology to collect random signals from nature. This random number generator based on coupled triboelectric and electrostatic induction effects at the liquid-dielectric interface includes an elaborately designed triboelectric generator (TENG) with an irregular grating structure, an electronic-optical device, and an optical-electronic device. The random characteristics of raindrops are harvested through TENG and consequently transformed and converted by electronic-optical device and an optical-electronic device with a nonlinear characteristic. The cooperation of the mechanical, electrical, and optical signals ensures that the generator possesses complex nonlinear input-output behavior and contributes to increased randomness. The random number sequences are deduced from final electrical signals received by an optical-electronic device using a familiar algorithm. These obtained random number sequences exhibit good statistical characteristics, unpredictability, and unrepeatability. Our study supplies a simple, practical, and effective method to generate true random numbers, which can be widely used in cryptographic protocols, digital signatures, authentication, identification, and other information security fields.

  8. Cellular Automata-Based Parallel Random Number Generators Using FPGAs

    Directory of Open Access Journals (Sweden)

    David H. K. Hoe

    2012-01-01

    Full Text Available Cellular computing represents a new paradigm for implementing high-speed massively parallel machines. Cellular automata (CA, which consist of an array of locally connected processing elements, are a basic form of a cellular-based architecture. The use of field programmable gate arrays (FPGAs for implementing CA accelerators has shown promising results. This paper investigates the design of CA-based pseudo-random number generators (PRNGs using an FPGA platform. To improve the quality of the random numbers that are generated, the basic CA structure is enhanced in two ways. First, the addition of a superrule to each CA cell is considered. The resulting self-programmable CA (SPCA uses the superrule to determine when to make a dynamic rule change in each CA cell. The superrule takes its inputs from neighboring cells and can be considered itself a second CA working in parallel with the main CA. When implemented on an FPGA, the use of lookup tables in each logic cell removes any restrictions on how the super-rules should be defined. Second, a hybrid configuration is formed by combining a CA with a linear feedback shift register (LFSR. This is advantageous for FPGA designs due to the compactness of the LFSR implementations. A standard software package for statistically evaluating the quality of random number sequences known as Diehard is used to validate the results. Both the SPCA and the hybrid CA/LFSR were found to pass all the Diehard tests.

  9. Design and test of component circuits of an integrated quantum voltage noise source for Johnson noise thermometry

    Science.gov (United States)

    Yamada, Takahiro; Maezawa, Masaaki; Urano, Chiharu

    2015-11-01

    We present design and testing of a pseudo-random number generator (PRNG) and a variable pulse number multiplier (VPNM) which are digital circuit subsystems in an integrated quantum voltage noise source for Jonson noise thermometry. Well-defined, calculable pseudo-random patterns of single flux quantum pulses are synthesized with the PRNG and multiplied digitally with the VPNM. The circuit implementation on rapid single flux quantum technology required practical circuit scales and bias currents, 279 junctions and 33 mA for the PRNG, and 1677 junctions and 218 mA for the VPNM. We confirmed the circuit operation with sufficiently wide margins, 80-120%, with respect to the designed bias currents.

  10. Chaos Enhanced Differential Evolution in the Task of Evolutionary Control of Selected Set of Discrete Chaotic Systems

    Directory of Open Access Journals (Sweden)

    Roman Senkerik

    2014-01-01

    Full Text Available Evolutionary technique differential evolution (DE is used for the evolutionary tuning of controller parameters for the stabilization of set of different chaotic systems. The novelty of the approach is that the selected controlled discrete dissipative chaotic system is used also as the chaotic pseudorandom number generator to drive the mutation and crossover process in the DE. The idea was to utilize the hidden chaotic dynamics in pseudorandom sequences given by chaotic map to help differential evolution algorithm search for the best controller settings for the very same chaotic system. The optimizations were performed for three different chaotic systems, two types of case studies and developed cost functions.

  11. A Summary and Perspective of Recent IRIS Assessments and Impact on Planning Environmental Investigations

    Science.gov (United States)

    2011-03-30

    or remediation  Used with regulatory values to determine cleanup levels  Risk-based screening levels (aka PRGs, RBCs, RSLs) ►Screen sites early in...Final IRIS Values for Hydrogen Cyanide and Cyanide Salts (September 2010)  New Oral noncancer RfD = 0.0006 mg/kg- day; male reproduction effects

  12. Nonlinear analysis of renal autoregulation in rats using principal dynamic modes

    DEFF Research Database (Denmark)

    Marmarelis, V Z; Chon, K H; Holstein-Rathlou, N H

    1999-01-01

    This article presents results of the use of a novel methodology employing principal dynamic modes (PDM) for modeling the nonlinear dynamics of renal autoregulation in rats. The analyzed experimental data are broadband (0-0.5 Hz) blood pressure-flow data generated by pseudorandom forcing and colle......This article presents results of the use of a novel methodology employing principal dynamic modes (PDM) for modeling the nonlinear dynamics of renal autoregulation in rats. The analyzed experimental data are broadband (0-0.5 Hz) blood pressure-flow data generated by pseudorandom forcing...... and collected in normotensive and hypertensive rats for two levels of pressure forcing (as measured by the standard deviation of the pressure fluctuation). The PDMs are computed from first-order and second-order kernel estimates obtained from the data via the Laguerre expansion technique. The results...

  13. Sharp lower bounds on the extractable randomness from non-uniform sources

    NARCIS (Netherlands)

    Skoric, B.; Obi, C.; Verbitskiy, E.A.; Schoenmakers, B.

    2011-01-01

    Extraction of uniform randomness from (noisy) non-uniform sources is an important primitive in many security applications, e.g. (pseudo-)random number generators, privacy-preserving biometrics, and key storage based on Physical Unclonable Functions. Generic extraction methods exist, using universal

  14. Locating multiple optima using particle swarm optimization

    CSIR Research Space (South Africa)

    Brits, R

    2007-01-01

    Full Text Available in [37]). Faure-sequences are distributed with high uniformity within a n-dimensional unit cube. Other pseudo-random uniform number generators, such as Sobol-sequences [33], may also be used. Main swarm training: In the nbest algorithm, overlapping...

  15. Measurement time and statistics for a noise thermometer with a synthetic-noise reference

    Science.gov (United States)

    White, D. R.; Benz, S. P.; Labenski, J. R.; Nam, S. W.; Qu, J. F.; Rogalla, H.; Tew, W. L.

    2008-08-01

    This paper describes methods for reducing the statistical uncertainty in measurements made by noise thermometers using digital cross-correlators and, in particular, for thermometers using pseudo-random noise for the reference signal. First, a discrete-frequency expression for the correlation bandwidth for conventional noise thermometers is derived. It is shown how an alternative frequency-domain computation can be used to eliminate the spectral response of the correlator and increase the correlation bandwidth. The corresponding expressions for the uncertainty in the measurement of pseudo-random noise in the presence of uncorrelated thermal noise are then derived. The measurement uncertainty in this case is less than that for true thermal-noise measurements. For pseudo-random sources generating a frequency comb, an additional small reduction in uncertainty is possible, but at the cost of increasing the thermometer's sensitivity to non-linearity errors. A procedure is described for allocating integration times to further reduce the total uncertainty in temperature measurements. Finally, an important systematic error arising from the calculation of ratios of statistical variables is described.

  16. A quick and easy improvement of Monte Carlo codes for simulation

    Science.gov (United States)

    Lebrere, A.; Talhi, R.; Tripathy, M.; Pyée, M.

    The simulation of trials of independent random variables of given distribution is a critical element of running Monte-Carlo codes. This is usually performed by using pseudo-random number generators (and in most cases linearcongruential ones). We present here an alternative way to generate sequences with given statistical properties. This sequences are purely deterministic and are given by closed formulae, and can give in some cases better results than classical generators.

  17. Vowel Generation for Children with Cerebral Palsy using Myocontrol of a Speech Synthesizer

    Directory of Open Access Journals (Sweden)

    Chuanxin M Niu

    2015-01-01

    Full Text Available For children with severe cerebral palsy (CP, social and emotional interactions can be significantly limited due to impaired speech motor function. However, if it is possible to extract continuous voluntary control signals from the electromyograph (EMG of limb muscles, then EMG may be used to drive the synthesis of intelligible speech with controllable speed, intonation and articulation. We report an important first step: the feasibility of controlling a vowel synthesizer using non-speech muscles. A classic formant-based speech synthesizer is adapted to allow the lowest two formants to be controlled by surface EMG from skeletal muscles. EMG signals are filtered using a non-linear Bayesian filtering algorithm that provides the high bandwidth and accuracy required for speech tasks. The frequencies of the first two formants determine points in a 2D plane, and vowels are targets on this plane. We focus on testing the overall feasibility of producing intelligible English vowels with myocontrol using two straightforward EMG-formant mappings. More mappings can be tested in the future to optimize the intelligibility. Vowel generation was tested on 10 healthy adults and 4 patients with dyskinetic CP. Five English vowels were generated by subjects in pseudo-random order, after only 10 minutes of device familiarization. The fraction of vowels correctly identified by 4 naive listeners exceeded 80% for the vowels generated by healthy adults and 57% for vowels generated by patients with CP. Our goal is a continuous virtual voice with personalized intonation and articulation that will restore not only the intellectual content but also the social and emotional content of speech for children and adults with severe movement disorders.

  18. Generació de nombres aleatóris mitjançant les fluctuacions del buit quàntic

    OpenAIRE

    Abellan Sanchez, Carlos

    2013-01-01

    [ANGLÈS] Random numbers are extensively used in a broad range of applications. Nevertheless, there are two main markets from a commercial point of view: (i) secure communications and (ii) stochastic simulation. According to the generation rate and quality of the random numbers required, different approaches have been used so far, most of them based on pseudo-random number generation. However, these type of generators have already started showing weakness both in the quality and the generation...

  19. Wideband propagation measurements at 30.3 GHz through a pecan orchard in Texas

    Science.gov (United States)

    Papazian, Peter B.; Jones, David L.; Espeland, Richard H.

    1992-09-01

    Wideband propagation measurements were made in a pecan orchard in Texas during April and August of 1990 to examine the propagation characteristics of millimeter-wave signals through vegetation. Measurements were made on tree obstructed paths with and without leaves. The study presents narrowband attenuation data at 9.6 and 28.8 GHz as well as wideband impulse response measurements at 30.3 GHz. The wideband probe (Violette et al., 1983), provides amplitude and delay of reflected and scattered signals and bit-error rate. This is accomplished using a 500 MBit/sec pseudo-random code to BPSK modulate a 28.8 GHz carrier. The channel impulse response is then extracted by cross correlating the received pseudo-random sequence with a locally generated replica.

  20. Rational Approximations of the Inverse Gaussian Function.

    Science.gov (United States)

    Byars, Jackson A.; Roscoe, John T.

    There are at least two situations in which the behavioral scientist wishes to transform uniformly distributed data into normally distributed data: (1) In studies of sampling distributions where uniformly distributed pseudo-random numbers are generated by a computer but normally distributed numbers are desired; and (2) In measurement applications…

  1. AER synthetic generation in hardware for bio-inspired spiking systems

    Science.gov (United States)

    Linares-Barranco, Alejandro; Linares-Barranco, Bernabe; Jimenez-Moreno, Gabriel; Civit-Balcells, Anton

    2005-06-01

    Address Event Representation (AER) is an emergent neuromorphic interchip communication protocol that allows for real-time virtual massive connectivity between huge number neurons located on different chips. By exploiting high speed digital communication circuits (with nano-seconds timings), synaptic neural connections can be time multiplexed, while neural activity signals (with mili-seconds timings) are sampled at low frequencies. Also, neurons generate 'events' according to their activity levels. More active neurons generate more events per unit time, and access the interchip communication channel more frequently, while neurons with low activity consume less communication bandwidth. When building multi-chip muti-layered AER systems it is absolutely necessary to have a computer interface that allows (a) to read AER interchip traffic into the computer and visualize it on screen, and (b) convert conventional frame-based video stream in the computer into AER and inject it at some point of the AER structure. This is necessary for test and debugging of complex AER systems. This paper addresses the problem of converting, in a computer, a conventional frame-based video stream into the spike event based representation AER. There exist several proposed software methods for synthetic generation of AER for bio-inspired systems. This paper presents a hardware implementation for one method, which is based on Linear-Feedback-Shift-Register (LFSR) pseudo-random number generation. The sequence of events generated by this hardware, which follows a Poisson distribution like a biological neuron, has been reconstructed using two AER integrator cells. The error of reconstruction for a set of images that produces different traffic loads of event in the AER bus is used as evaluation criteria. A VHDL description of the method, that includes the Xilinx PCI Core, has been implemented and tested using a general purpose PCI-AER board. This PCI-AER board has been developed by authors, and uses

  2. Heartbeats Do Not Make Good Pseudo-Random Number Generators: An Analysis of the Randomness of Inter-Pulse Intervals

    Directory of Open Access Journals (Sweden)

    Lara Ortiz-Martin

    2018-01-01

    Full Text Available The proliferation of wearable and implantable medical devices has given rise to an interest in developing security schemes suitable for these systems and the environment in which they operate. One area that has received much attention lately is the use of (human biological signals as the basis for biometric authentication, identification and the generation of cryptographic keys. The heart signal (e.g., as recorded in an electrocardiogram has been used by several researchers in the last few years. Specifically, the so-called Inter-Pulse Intervals (IPIs, which is the time between two consecutive heartbeats, have been repeatedly pointed out as a potentially good source of entropy and are at the core of various recent authentication protocols. In this work, we report the results of a large-scale statistical study to determine whether such an assumption is (or not upheld. For this, we have analyzed 19 public datasets of heart signals from the Physionet repository, spanning electrocardiograms from 1353 subjects sampled at different frequencies and with lengths that vary between a few minutes and several hours. We believe this is the largest dataset on this topic analyzed in the literature. We have then applied a standard battery of randomness tests to the extracted IPIs. Under the algorithms described in this paper and after analyzing these 19 public ECG datasets, our results raise doubts about the use of IPI values as a good source of randomness for cryptographic purposes. This has repercussions both in the security of some of the protocols proposed up to now and also in the design of future IPI-based schemes.

  3. FPGA based fast synchronous serial multi-wire links synchronization

    Science.gov (United States)

    Pozniak, Krzysztof T.

    2013-10-01

    The paper debates synchronization method of multi-wire, serial link of constant latency, by means of pseudo-random numbers generators. The solution was designed for various families of FPGA circuits. There were debated synchronization algorithm and functional structure of parameterized transmitter and receiver modules. The modules were realized in VHDL language in a behavioral form.

  4. Estimation of equivalent dose and its uncertainty in the OSL SAR protocol when count numbers do not follow a Poisson distribution

    International Nuclear Information System (INIS)

    Bluszcz, Andrzej; Adamiec, Grzegorz; Heer, Aleksandra J.

    2015-01-01

    The current work focuses on the estimation of equivalent dose and its uncertainty using the single aliquot regenerative protocol in optically stimulated luminescence measurements. The authors show that the count numbers recorded with the use of photomultiplier tubes are well described by negative binomial distributions, different ones for background counts and photon induced counts. This fact is then exploited in pseudo-random count number generation and simulations of D e determination assuming a saturating exponential growth. A least squares fitting procedure is applied using different types of weights to determine whether the obtained D e 's and their error estimates are unbiased and accurate. A weighting procedure is suggested that leads to almost unbiased D e estimates. It is also shown that the assumption of Poisson distribution in D e estimation may lead to severe underestimation of the D e error. - Highlights: • Detailed analysis of statistics of count numbers in luminescence readers. • Generation of realistically scattered pseudo-random numbers of counts in luminescence measurements. • A practical guide for stringent analysis of D e values and errors assessment.

  5. PSO algorithm enhanced with Lozi Chaotic Map - Tuning experiment

    Energy Technology Data Exchange (ETDEWEB)

    Pluhacek, Michal; Senkerik, Roman; Zelinka, Ivan [Tomas Bata University in Zlín, Faculty of Applied Informatics Department of Informatics and Artificial Intelligence nám. T.G. Masaryka 5555, 760 01 Zlín (Czech Republic)

    2015-03-10

    In this paper it is investigated the effect of tuning of control parameters of the Lozi Chaotic Map employed as a chaotic pseudo-random number generator for the particle swarm optimization algorithm. Three different benchmark functions are selected from the IEEE CEC 2013 competition benchmark set. The Lozi map is extensively tuned and the performance of PSO is evaluated.

  6. The LFSR and BCA VHDL Models for Built-in Self-test Circuits

    Directory of Open Access Journals (Sweden)

    J. Mitrych

    2002-04-01

    Full Text Available The various test structures are proposed for BIST techniques [1],[2]. A typical structure used for generation of pseudo-random test setsis the linear feedback shift register (LFSR. The BIST techniques havewide application in testing whole devices and embedded components. Wefocus on the analysis of the state coverage, fault coverage, andoptimal structure of BIST schemes.

  7. PSO algorithm enhanced with Lozi Chaotic Map - Tuning experiment

    International Nuclear Information System (INIS)

    Pluhacek, Michal; Senkerik, Roman; Zelinka, Ivan

    2015-01-01

    In this paper it is investigated the effect of tuning of control parameters of the Lozi Chaotic Map employed as a chaotic pseudo-random number generator for the particle swarm optimization algorithm. Three different benchmark functions are selected from the IEEE CEC 2013 competition benchmark set. The Lozi map is extensively tuned and the performance of PSO is evaluated

  8. Detection of M-Sequences from Spike Sequence in Neuronal Networks

    Directory of Open Access Journals (Sweden)

    Yoshi Nishitani

    2012-01-01

    Full Text Available In circuit theory, it is well known that a linear feedback shift register (LFSR circuit generates pseudorandom bit sequences (PRBS, including an M-sequence with the maximum period of length. In this study, we tried to detect M-sequences known as a pseudorandom sequence generated by the LFSR circuit from time series patterns of stimulated action potentials. Stimulated action potentials were recorded from dissociated cultures of hippocampal neurons grown on a multielectrode array. We could find several M-sequences from a 3-stage LFSR circuit (M3. These results show the possibility of assembling LFSR circuits or its equivalent ones in a neuronal network. However, since the M3 pattern was composed of only four spike intervals, the possibility of an accidental detection was not zero. Then, we detected M-sequences from random spike sequences which were not generated from an LFSR circuit and compare the result with the number of M-sequences from the originally observed raster data. As a result, a significant difference was confirmed: a greater number of “0–1” reversed the 3-stage M-sequences occurred than would have accidentally be detected. This result suggests that some LFSR equivalent circuits are assembled in neuronal networks.

  9. Fast integration using quasi-random numbers

    International Nuclear Information System (INIS)

    Bossert, J.; Feindt, M.; Kerzel, U.

    2006-01-01

    Quasi-random numbers are specially constructed series of numbers optimised to evenly sample a given s-dimensional volume. Using quasi-random numbers in numerical integration converges faster with a higher accuracy compared to the case of pseudo-random numbers. The basic properties of quasi-random numbers are introduced, various generators are discussed and the achieved gain is illustrated by examples

  10. Fast integration using quasi-random numbers

    Science.gov (United States)

    Bossert, J.; Feindt, M.; Kerzel, U.

    2006-04-01

    Quasi-random numbers are specially constructed series of numbers optimised to evenly sample a given s-dimensional volume. Using quasi-random numbers in numerical integration converges faster with a higher accuracy compared to the case of pseudo-random numbers. The basic properties of quasi-random numbers are introduced, various generators are discussed and the achieved gain is illustrated by examples.

  11. Extended substitution-diffusion based image cipher using chaotic standard map

    Science.gov (United States)

    Kumar, Anil; Ghose, M. K.

    2011-01-01

    This paper proposes an extended substitution-diffusion based image cipher using chaotic standard map [1] and linear feedback shift register to overcome the weakness of previous technique by adding nonlinearity. The first stage consists of row and column rotation and permutation which is controlled by the pseudo-random sequences which is generated by standard chaotic map and linear feedback shift register, second stage further diffusion and confusion is obtained in the horizontal and vertical pixels by mixing the properties of the horizontally and vertically adjacent pixels, respectively, with the help of chaotic standard map. The number of rounds in both stage are controlled by combination of pseudo-random sequence and original image. The performance is evaluated from various types of analysis such as entropy analysis, difference analysis, statistical analysis, key sensitivity analysis, key space analysis and speed analysis. The experimental results illustrate that performance of this is highly secured and fast.

  12. Chaos Enhanced Differential Evolution in the Task of Evolutionary Control of Discrete Chaotic LOZI Map

    Directory of Open Access Journals (Sweden)

    Roman Senkerik

    2016-01-01

    Full Text Available In this paper, evolutionary technique Differential Evolution (DE is used for the evolutionary tuning of controller parameters for the stabilization of selected discrete chaotic system, which is the two-dimensional Lozi map. The novelty of the approach is that the selected controlled discrete dissipative chaotic system is used within Chaos enhanced heuristic concept as the chaotic pseudo-random number generator to drive the mutation and crossover process in the DE. The idea was to utilize the hidden chaotic dynamics in pseudo-random sequences given by chaotic map to help Differential evolution algorithm in searching for the best controller settings for the same chaotic system. The optimizations were performed for three different required final behavior of the chaotic system, and two types of developed cost function. To confirm the robustness of presented approach, comparisons with canonical DE strategy and PSO algorithm have been performed.

  13. Generalized double-humped logistic map-based medical image encryption

    Directory of Open Access Journals (Sweden)

    Samar M. Ismail

    2018-03-01

    Full Text Available This paper presents the design of the generalized Double Humped (DH logistic map, used for pseudo-random number key generation (PRNG. The generalized parameter added to the map provides more control on the map chaotic range. A new special map with a zooming effect of the bifurcation diagram is obtained by manipulating the generalization parameter value. The dynamic behavior of the generalized map is analyzed, including the study of the fixed points and stability ranges, Lyapunov exponent, and the complete bifurcation diagram. The option of designing any specific map is made possible through changing the general parameter increasing the randomness and controllability of the map. An image encryption algorithm is introduced based on pseudo-random sequence generation using the proposed generalized DH map offering secure communication transfer of medical MRI and X-ray images. Security analyses are carried out to consolidate system efficiency including: key sensitivity and key-space analyses, histogram analysis, correlation coefficients, MAE, NPCR and UACI calculations. System robustness against noise attacks has been proved along with the NIST test ensuring the system efficiency. A comparison between the proposed system with respect to previous works is presented.

  14. Monte Carlo simulation with the Gate software using grid computing

    International Nuclear Information System (INIS)

    Reuillon, R.; Hill, D.R.C.; Gouinaud, C.; El Bitar, Z.; Breton, V.; Buvat, I.

    2009-03-01

    Monte Carlo simulations are widely used in emission tomography, for protocol optimization, design of processing or data analysis methods, tomographic reconstruction, or tomograph design optimization. Monte Carlo simulations needing many replicates to obtain good statistical results can be easily executed in parallel using the 'Multiple Replications In Parallel' approach. However, several precautions have to be taken in the generation of the parallel streams of pseudo-random numbers. In this paper, we present the distribution of Monte Carlo simulations performed with the GATE software using local clusters and grid computing. We obtained very convincing results with this large medical application, thanks to the EGEE Grid (Enabling Grid for E-science), achieving in one week computations that could have taken more than 3 years of processing on a single computer. This work has been achieved thanks to a generic object-oriented toolbox called DistMe which we designed to automate this kind of parallelization for Monte Carlo simulations. This toolbox, written in Java is freely available on SourceForge and helped to ensure a rigorous distribution of pseudo-random number streams. It is based on the use of a documented XML format for random numbers generators statuses. (authors)

  15. CMOS Compressed Imaging by Random Convolution

    OpenAIRE

    Jacques, Laurent; Vandergheynst, Pierre; Bibet, Alexandre; Majidzadeh, Vahid; Schmid, Alexandre; Leblebici, Yusuf

    2009-01-01

    We present a CMOS imager with built-in capability to perform Compressed Sensing. The adopted sensing strategy is the random Convolution due to J. Romberg. It is achieved by a shift register set in a pseudo-random configuration. It acts as a convolutive filter on the imager focal plane, the current issued from each CMOS pixel undergoing a pseudo-random redirection controlled by each component of the filter sequence. A pseudo-random triggering of the ADC reading is finally applied to comp...

  16. Seasonal nutrient dynamics and biomass quality of giant reed (Arundo donax L. and miscanthus (Miscanthus x giganteus Greef et Deuter as energy crops

    Directory of Open Access Journals (Sweden)

    Nicoletta Nassi o Di Nasso

    2011-08-01

    Full Text Available The importance of energy crops in displacing fossil fuels within the energy sector in Europe is growing. Among energy crops, the use of perennial rhizomatous grasses (PRGs seems promising owing to their high productivity and their nutrient recycling that occurs during senescence. In particular, nutrient requirements and biomass quality have a fundamental relevance to biomass systems efficiency. The objective of our study was to compare giant reed (Arundo donax L. and miscanthus (Miscanthus × giganteus Greef et Deuter in terms of nutrient requirements and cellulose, hemicelluloses and lignin content. This aim was to identify, in the Mediterranean environment, the optimal harvest time that may combine, beside a high biomass yield, high nutrient use efficiency and a good biomass quality for second generation biofuel production. The research was carried out in 2009, in San Piero a Grado, Pisa (Central Italy; latitude 43°41’ N, longitude 10°21’ E, on seven-year-old crops in a loam soil characterised by good water availability. Maximum above-ground nutrient contents were generally found in summer. Subsequently, a decrease was recorded; this suggested a nutrient remobilisation from above-ground biomass to rhizomes. In addition, miscanthus showed the highest N, P, and K use efficiency, probably related to its higher yield and its C4 pathway. Regarding biomass quality, stable values of cellulose (38%, hemicelluloses (25% and lignin (8% were reported from July onwards in both crops. Hence, these components appear not to be discriminative parameters in the choice of the harvest time in the Mediterranean environment. In conclusion, our results highlighted that, in our environment, a broad harvest period (from late autumn to winter seems suitable for these PRGs. However, further research is required to evaluate the role of rhizomes in nutrient storage and supply during the growing season, as well as ecological and productive performances in marginal

  17. The Coin Problem  and Pseudorandomness for Branching Programs

    DEFF Research Database (Denmark)

    Brody, Joshua; Verbin, Elad

    2010-01-01

    in the model of emph{read-once width-$w$ branching programs}. We prove that in order to succeed in this model, $beta$ must be at least $1/ (log n)^{Theta(w)}$. For constant $w$ this is tight by considering the recursive tribes function, and for other values of $w$ this is nearly tight by considering other read...... be distinguished by small-width read-once branching programs. We suggest one application for this kind of theorems: we prove that Nisan's Generator fools width-$w$ read-once emph{regular} branching programs, using seed length $O(w^4 log n log log n + log n log (1/eps))$. For $w=eps=Theta(1)$, this seed length...

  18. Cortical regions involved in the generation of musical structures during improvisation in pianists.

    Science.gov (United States)

    Bengtsson, Sara L; Csíkszentmihályi, Mihály; Ullén, Fredrik

    2007-05-01

    Studies on simple pseudorandom motor and cognitive tasks have shown that the dorsolateral prefrontal cortex and rostral premotor areas are involved in free response selection. We used functional magnetic resonance imaging to investigate whether these brain regions are also involved in free generation of responses in a more complex creative behavior: musical improvisation. Eleven professional pianists participated in the study. In one condition, Improvise, the pianist improvised on the basis of a visually displayed melody. In the control condition, Reproduce, the participant reproduced his previous improvisation from memory. Participants were able to reproduce their improvisations with a high level of accuracy, and the contrast Improvise versus Reproduce was thus essentially matched in terms of motor output and sensory feedback. However, the Improvise condition required storage in memory of the improvisation. We therefore also included a condition FreeImp, where the pianist improvised but was instructed not to memorize his performance. To locate brain regions involved in musical creation, we investigated the activations in the Improvise-Reproduce contrast that were also present in FreeImp contrasted with a baseline rest condition. Activated brain regions included the right dorsolateral prefrontal cortex, the presupplementary motor area, the rostral portion of the dorsal premotor cortex, and the left posterior part of the superior temporal gyrus. We suggest that these regions are part of a network involved in musical creation, and discuss their possible functional roles.

  19. FPGA Based Test Module for Error Bit Evaluation in Serial Links

    Directory of Open Access Journals (Sweden)

    J. Kolouch

    2006-04-01

    Full Text Available A test module for serial links is described. In the link transmitter, one module generates pseudorandom pulse signal that is transmitted by the link. Second module located in the link receiver generates the same signal and compares it to the received signal. Errors caused by the signal transmission can be then detected and results sent to a master computer for further processing like statistical evaluation. The module can be used for long-term error monitoring without need for human operator presence.

  20. Hyperchaotic encryption based on multi-scroll piecewise linear Systems

    Czech Academy of Sciences Publication Activity Database

    García-Martínez, M.; Ontanon-García, L.J.; Campos-Cantón, E.; Čelikovský, Sergej

    2015-01-01

    Roč. 270, č. 1 (2015), s. 413-424 ISSN 0096-3003 R&D Projects: GA ČR GA13-20433S Institutional support: RVO:67985556 Keywords : Hyperchaotic encryption * Piecewise linear systems * Stream cipher * Pseudo-random bit generator * Chaos theory * Multi-scrollattractors Subject RIV: BC - Control Systems Theory Impact factor: 1.345, year: 2015 http://library.utia.cas.cz/separaty/2015/TR/celikovsky-0446895.pdf

  1. Efficient sampling algorithms for Monte Carlo based treatment planning

    International Nuclear Information System (INIS)

    DeMarco, J.J.; Solberg, T.D.; Chetty, I.; Smathers, J.B.

    1998-01-01

    Efficient sampling algorithms are necessary for producing a fast Monte Carlo based treatment planning code. This study evaluates several aspects of a photon-based tracking scheme and the effect of optimal sampling algorithms on the efficiency of the code. Four areas were tested: pseudo-random number generation, generalized sampling of a discrete distribution, sampling from the exponential distribution, and delta scattering as applied to photon transport through a heterogeneous simulation geometry. Generalized sampling of a discrete distribution using the cutpoint method can produce speedup gains of one order of magnitude versus conventional sequential sampling. Photon transport modifications based upon the delta scattering method were implemented and compared with a conventional boundary and collision checking algorithm. The delta scattering algorithm is faster by a factor of six versus the conventional algorithm for a boundary size of 5 mm within a heterogeneous geometry. A comparison of portable pseudo-random number algorithms and exponential sampling techniques is also discussed

  2. Anti-deterministic behaviour of discrete systems that are less predictable than noise

    Science.gov (United States)

    Urbanowicz, Krzysztof; Kantz, Holger; Holyst, Janusz A.

    2005-05-01

    We present a new type of deterministic dynamical behaviour that is less predictable than white noise. We call it anti-deterministic (AD) because time series corresponding to the dynamics of such systems do not generate deterministic lines in recurrence plots for small thresholds. We show that although the dynamics is chaotic in the sense of exponential divergence of nearby initial conditions and although some properties of AD data are similar to white noise, the AD dynamics is in fact, less predictable than noise and hence is different from pseudo-random number generators.

  3. MCMCpack: Markov Chain Monte Carlo in R

    Directory of Open Access Journals (Sweden)

    Andrew D. Martin

    2011-08-01

    Full Text Available We introduce MCMCpack, an R package that contains functions to perform Bayesian inference using posterior simulation for a number of statistical models. In addition to code that can be used to fit commonly used models, MCMCpack also contains some useful utility functions, including some additional density functions and pseudo-random number generators for statistical distributions, a general purpose Metropolis sampling algorithm, and tools for visualization.

  4. MIMS circuit scrapbook V.I.

    CERN Document Server

    Mims, Forrest

    2000-01-01

    Here it is--a collection of Forrest Mims's classic work from the original Popular Electronics magazine! Using commonly available components and remarkable ingenuity, Forrest shows you how to build and experiment with circuits like these:analog computers color organs digital phase-locked loops frequency-to-voltage and voltage-to-frequency converters interval timers LED oscilloscopes light wave communicators magnetic field sensors optoelectronics pseudorandom number generators tone sequencers and much, much, more!

  5. Application of quasi-random numbers for simulation

    International Nuclear Information System (INIS)

    Kazachenko, O.N.; Takhtamyshev, G.G.

    1985-01-01

    Application of the Monte-Carlo method for multidimensional integration is discussed. The main goal is to check the statement that the application of quasi-random numbers instead of regular pseudo-random numbers provides more rapid convergency. The Sobol, Richtmayer and Halton algorithms of quasi-random sequences are described. Over 50 tests to compare these quasi-random numbers as well as pseudo-random numbers were fulfilled. In all cases quasi-random numbers have clearly demonstrated a more rapid convergency as compared with pseudo-random ones. Positive test results on quasi-random trend in Monte-Carlo method seem very promising

  6. Finite Precision Logistic Map between Computational Efficiency and Accuracy with Encryption Applications

    Directory of Open Access Journals (Sweden)

    Wafaa S. Sayed

    2017-01-01

    Full Text Available Chaotic systems appear in many applications such as pseudo-random number generation, text encryption, and secure image transfer. Numerical solutions of these systems using digital software or hardware inevitably deviate from the expected analytical solutions. Chaotic orbits produced using finite precision systems do not exhibit the infinite period expected under the assumptions of infinite simulation time and precision. In this paper, digital implementation of the generalized logistic map with signed parameter is considered. We present a fixed-point hardware realization of a Pseudo-Random Number Generator using the logistic map that experiences a trade-off between computational efficiency and accuracy. Several introduced factors such as the used precision, the order of execution of the operations, parameter, and initial point values affect the properties of the finite precision map. For positive and negative parameter cases, the studied properties include bifurcation points, output range, maximum Lyapunov exponent, and period length. The performance of the finite precision logistic map is compared in the two cases. A basic stream cipher system is realized to evaluate the system performance for encryption applications for different bus sizes regarding the encryption key size, hardware requirements, maximum clock frequency, NIST and correlation, histogram, entropy, and Mean Absolute Error analyses of encrypted images.

  7. Quadratic Sieve integer factorization using Hadoop

    OpenAIRE

    Ghebregiorgish, Semere Tsehaye

    2012-01-01

    Master's thesis in Computer Science Integer factorization problem is one of the most important parts in the world of cryptography. The security of the widely-used public-key cryptographic algorithm, RSA [1], and the Blum Blum Shub cryptographic pseudorandom number generator [2] heavily depend on the presumed difficulty of factoring a number to its prime constituents. As the size of the number to be factored gets larger, the difficulty of the problem increases enormously. Thi...

  8. Additively Homomorphic UC commitments with Optimal Amortized Overhead

    DEFF Research Database (Denmark)

    Cascudo Pueyo, Ignacio; Damgård, Ivan Bjerre; David, Bernardo Machado

    2015-01-01

    We propose the first UC secure commitment scheme with (amortized) computational complexity linear in the size of the string committed to. After a preprocessing phase based on oblivious transfer, that only needs to be done once and for all, our scheme only requires a pseudorandom generator and a l......, our basic scheme has amortised concrete efficiency comparable with previous protocols in the Random Oracle Model even though it is constructed in the plain model....

  9. Frequency response testing at Experimental Breeder Reactor II using discrete-level periodic signals

    International Nuclear Information System (INIS)

    Rhodes, W.D.; Larson, H.A.

    1990-01-01

    The Experimental Breeder Reactor 2 (EBR-2) reactivity-to-power frequency-response function was measured with pseudo-random, discrete-level, periodic signals. The reactor power deviation was small with insignificant perturbation of normal operation and in-place irradiation experiments. Comparison of results with measured rod oscillator data and with theoretical predictions show good agreement. Moreover, measures of input signal quality (autocorrelation function and energy spectra) confirm the ability to enable this type of frequency response determination at EBR-2. Measurements were made with the pseudo-random binary sequence, quadratic residue binary sequence, pseudo-random ternary sequence, and the multifrequency binary sequence. 10 refs., 7 figs., 3 tabs

  10. Development of Pseudorandom Binary Arrays for Calibration of Surface Profile Metrology Tools

    International Nuclear Information System (INIS)

    Barber, S.K.; Takacs, P.; Soldate, P.; Anderson, E.H.; Cambie, R.; McKinney, W.R.; Voronov, D.L.; Yashchuk, V.V.

    2009-01-01

    measured and simulated PSD distributions gives the MTF of the instrument. The applicability of the MTF concept to phase map measurements with optical interferometric microscopes needs to be experimentally verified as the optical tool and algorithms may introduce nonlinear artifacts into the process. In previous work [V. V. Yashchuk et al., Proc. SPIE 6704, 670408 (2007); Valeriy V. Yashchuk et al., Opt. Eng. (Bellingham) 47, 073602 (2008)] the instrumental MTF of a surface profiler was precisely measured using reference test surfaces based on binary pseudorandom (BPR) gratings. Here, the authors present results of fabricating and using two-dimensional (2D) BPR arrays that allow for a direct 2D calibration of the instrumental MTF. BPR sequences are widely used in engineering and communication applications such as global position systems and wireless communication protocols. The ideal BPR pattern has a flat 'white noise' response over the entire range of spatial frequencies of interest. The BPR array used here is based on the uniformly redundant array (URA) prescription [E. E. Fenimore and T. M. Cannon, Appl. Opt. 17, 337 (1978)] initially used for x-ray and gamma ray astronomy applications. The URA's superior imaging capability originates from the fact that its cyclical autocorrelation function very closely approximates a delta function, which produces a flat PSD. Three different size BPR array patterns were fabricated by electron beam lithography and induction coupled plasma etching of silicon. The basic size units were 200, 400, and 600 nm. Two different etch processes were used, CF 4 /Ar and HBr, which resulted in undercut and vertical sidewall profiles, respectively. The 2D BPR arrays were used as standard test surfaces for MTF calibration of the MicroMap(trademark)-570 interferometric microscope using all available objectives. The MicroMap(trademark)-570 interferometric microscope uses incoherent illumination from a tungsten filament source and common path modulated

  11. Parallelization of a Monte Carlo particle transport simulation code

    Science.gov (United States)

    Hadjidoukas, P.; Bousis, C.; Emfietzoglou, D.

    2010-05-01

    We have developed a high performance version of the Monte Carlo particle transport simulation code MC4. The original application code, developed in Visual Basic for Applications (VBA) for Microsoft Excel, was first rewritten in the C programming language for improving code portability. Several pseudo-random number generators have been also integrated and studied. The new MC4 version was then parallelized for shared and distributed-memory multiprocessor systems using the Message Passing Interface. Two parallel pseudo-random number generator libraries (SPRNG and DCMT) have been seamlessly integrated. The performance speedup of parallel MC4 has been studied on a variety of parallel computing architectures including an Intel Xeon server with 4 dual-core processors, a Sun cluster consisting of 16 nodes of 2 dual-core AMD Opteron processors and a 200 dual-processor HP cluster. For large problem size, which is limited only by the physical memory of the multiprocessor server, the speedup results are almost linear on all systems. We have validated the parallel implementation against the serial VBA and C implementations using the same random number generator. Our experimental results on the transport and energy loss of electrons in a water medium show that the serial and parallel codes are equivalent in accuracy. The present improvements allow for studying of higher particle energies with the use of more accurate physical models, and improve statistics as more particles tracks can be simulated in low response time.

  12. Simulating efficiently the evolution of DNA sequences.

    Science.gov (United States)

    Schöniger, M; von Haeseler, A

    1995-02-01

    Two menu-driven FORTRAN programs are described that simulate the evolution of DNA sequences in accordance with a user-specified model. This general stochastic model allows for an arbitrary stationary nucleotide composition and any transition-transversion bias during the process of base substitution. In addition, the user may define any hypothetical model tree according to which a family of sequences evolves. The programs suggest the computationally most inexpensive approach to generate nucleotide substitutions. Either reproducible or non-repeatable simulations, depending on the method of initializing the pseudo-random number generator, can be performed. The corresponding options are offered by the interface menu.

  13. Analysis of time in establishing synchronization radio communication system with expanded spectrum conditions for communication with mobile robots

    Science.gov (United States)

    Latinovic, T. S.; Kalabic, S. B.; Barz, C. R.; Petrica, P. Paul; Pop-Vădean, A.

    2018-01-01

    This paper analyzes the influence of the Doppler Effect on the length of time to establish synchronization pseudorandom sequences in radio communications systems with an expanded spectrum. Also, this paper explores the possibility of using secure wireless communication for modular robots. Wireless communication could be used for local and global communication. We analyzed a radio communication system integrator, including the two effects of the Doppler signal on the duration of establishing synchronization of the received and locally generated pseudorandom sequence. The effects of the impact of the variability of the phase were analyzed between the said sequences and correspondence of the phases of these signals with the interval of time of acquisition of received sequences. An analysis of these impacts is essential in the transmission of signal and protection of the transfer of information in the communication systems with an expanded range (telecommunications, mobile telephony, Global Navigation Satellite System GNSS, and wireless communication). Results show that wireless communication can provide a safety approach for communication with mobile robots.

  14. Three Essays on Education Reform in the United States. PRGS Dissertation

    Science.gov (United States)

    Scherer, Ethan

    2014-01-01

    It has long been thought that the United States education system is the great equalizer, lifting less advantaged children out of poverty and improving their chances for success in adulthood. The opportunity for economic and social mobility depends heavily, however, on access to high quality education. Recent research has raised concerns about…

  15. Rapid Acquisition of Choice and Timing and the Provenance of the Terminal-Link Effect

    Science.gov (United States)

    Kyonka, Elizabeth G. E.; Grace, Randolph C.

    2010-01-01

    Eight pigeons responded in a concurrent-chains procedure in which terminal-link schedules changed pseudorandomly across sessions. Pairs of terminal-link delays either summed to 15 s or to 45 s. Across sessions, the location of the shorter terminal link changed according to a pseudorandom binary sequence. On some terminal links, food was withheld…

  16. Lecture note on neutron and photon transport calculation with MCNP

    International Nuclear Information System (INIS)

    Sakurai, Kiyoshi

    2003-01-01

    This paper is a lecture note on the continuous energy Monte Carlo method. The contents are as follows; history of the Monte Carlo study, continuous energy Monte Carlo codes, libraries, evaluation method for calculation results, integral emergent particle density equation, pseudorandom number, random walk, variance reduction techniques, MCNP weight window method, MCNP weight window generator, exponential transform, estimators, criticality problem and research subjects. This paper is a textbook for beginners on the Monte Carlo calculation. (author)

  17. Analysis of a Scenario for Chaotic Quantal Slowing Down of Inspiration

    Science.gov (United States)

    2013-01-01

    On exposure to opiates, preparations from rat brain stems have been observed to continue to produce regular expiratory signals, but to fail to produce some inspiratory signals. The numbers of expirations between two successive inspirations form an apparently random sequence. Here, we propose an explanation based on the qualitative theory of dynamical systems. A relatively simple scenario for the dynamics of interaction between the generators of expiratory and inspiratory signals produces pseudo-random behaviour of the type observed. PMID:24040967

  18. Application of random numbers at computerized simulation of proton magnetic resonance signals

    International Nuclear Information System (INIS)

    Populyakh, S.N.; Sapiga, A.V.

    2006-01-01

    One calculated numerically spectra of proton magnetic resonance of water molecules diffusing along the regular positions in a natrolite. One reached adequate conformity of the experimental and the calculated spectra within wide temperature range including a transition region. To ensure calculations one used generators of the pseudorandom Markov sequences. The numerical analysis, in particular, has shown that at the binary Markov process the time period when physical value remains unchanged is described by the random value with exponential distribution [ru

  19. Neural cryptography with feedback.

    Science.gov (United States)

    Ruttor, Andreas; Kinzel, Wolfgang; Shacham, Lanir; Kanter, Ido

    2004-04-01

    Neural cryptography is based on a competition between attractive and repulsive stochastic forces. A feedback mechanism is added to neural cryptography which increases the repulsive forces. Using numerical simulations and an analytic approach, the probability of a successful attack is calculated for different model parameters. Scaling laws are derived which show that feedback improves the security of the system. In addition, a network with feedback generates a pseudorandom bit sequence which can be used to encrypt and decrypt a secret message.

  20. A Fast Enhanced Secure Image Chaotic Cryptosystem Based on Hybrid Chaotic Magic Transform

    Directory of Open Access Journals (Sweden)

    Srinivas Koppu

    2017-01-01

    Full Text Available An enhanced secure image chaotic cryptosystem has been proposed based on hybrid CMT-Lanczos algorithm. We have achieved fast encryption and decryption along with privacy of images. The pseudorandom generator has been used along with Lanczos algorithm to generate root characteristics and eigenvectors. Using hybrid CMT image, pixels are shuffled to accomplish excellent randomness. Compared with existing methods, the proposed method had more robustness to various attacks: brute-force attack, known cipher plaintext, chosen-plaintext, security key space, key sensitivity, correlation analysis and information entropy, and differential attacks. Simulation results show that the proposed methods give better result in protecting images with low-time complexity.

  1. Noise-Induced Synchronization among Sub-RF CMOS Analog Oscillators for Skew-Free Clock Distribution

    Science.gov (United States)

    Utagawa, Akira; Asai, Tetsuya; Hirose, Tetsuya; Amemiya, Yoshihito

    We present on-chip oscillator arrays synchronized by random noises, aiming at skew-free clock distribution on synchronous digital systems. Nakao et al. recently reported that independent neural oscillators can be synchronized by applying temporal random impulses to the oscillators [1], [2]. We regard neural oscillators as independent clock sources on LSIs; i. e., clock sources are distributed on LSIs, and they are forced to synchronize through the use of random noises. We designed neuron-based clock generators operating at sub-RF region (CMOS implementation with 0.25-μm CMOS parameters. Through circuit simulations, we demonstrate that i) the clock generators are certainly synchronized by pseudo-random noises and ii) clock generators exhibited phase-locked oscillations even if they had small device mismatches.

  2. Extracting random numbers from quantum tunnelling through a single diode.

    Science.gov (United States)

    Bernardo-Gavito, Ramón; Bagci, Ibrahim Ethem; Roberts, Jonathan; Sexton, James; Astbury, Benjamin; Shokeir, Hamzah; McGrath, Thomas; Noori, Yasir J; Woodhead, Christopher S; Missous, Mohamed; Roedig, Utz; Young, Robert J

    2017-12-19

    Random number generation is crucial in many aspects of everyday life, as online security and privacy depend ultimately on the quality of random numbers. Many current implementations are based on pseudo-random number generators, but information security requires true random numbers for sensitive applications like key generation in banking, defence or even social media. True random number generators are systems whose outputs cannot be determined, even if their internal structure and response history are known. Sources of quantum noise are thus ideal for this application due to their intrinsic uncertainty. In this work, we propose using resonant tunnelling diodes as practical true random number generators based on a quantum mechanical effect. The output of the proposed devices can be directly used as a random stream of bits or can be further distilled using randomness extraction algorithms, depending on the application.

  3. Cryptanalysis of Selected Block Ciphers

    DEFF Research Database (Denmark)

    Alkhzaimi, Hoda A.

    , pseudorandom number generators, and authenticated encryption designs. For this reason a multitude of initiatives over the years has been established to provide a secure and sound designs for block ciphers as in the calls for Data Encryption Standard (DES) and Advanced Encryption Standard (AES), lightweight...... ciphers initiatives, and the Competition for Authenticated Encryption: Security, Applicability, and Robustness (CAESAR). In this thesis, we first present cryptanalytic results on different ciphers. We propose attack named the Invariant Subspace Attack. It is utilized to break the full block cipher...

  4. PECASE: New Directions for Silicon Integrated Optics

    Science.gov (United States)

    2013-04-30

    The associated circuit is shown in Fig. 1. We note that Rl could indicate the input to a transimpedance amplifier (TIA), or simply a 50-Ω...and B. Razavi. ൒-Gb/s limiting amplifier and laser/modulator driver in 0.18-µm CMOS technology." IEEE Journal of Solid-State Circuits 38(12) 2138...A pair of differential 40Gb/s 215-1 pseudorandom binary sequence (PRBS) was generated by a Centellax TG1P4A PRBS source, amplified by a pair of

  5. Distribution of some sequences of points on elliptic curves

    DEFF Research Database (Denmark)

    Lange, Tanja; Shparlinski, Igor

    2007-01-01

    We estimate character sums over points on elliptic curves over a finite field of q elements. Pseudorandom sequences can be constructed by taking linear combinations with small coefficients (for example, from the set {−1, 0, 1}) of a fixed vector of points, which forms the seed of the generator. We...... consider several particular cases of this general approach which are of special practical interest and have occurred in the literature. For each of them we show that the resulting sequence has good uniformity of distribution properties....

  6. Security analysis of chaotic communication systems based on Volterra-Wiener-Korenberg model

    International Nuclear Information System (INIS)

    Lei Min; Meng Guang; Feng Zhengjin

    2006-01-01

    Pseudo-randomicity is an important cryptological characteristic for proof of encryption algorithms. This paper proposes a nonlinear detecting method based on Volterra-Wiener-Korenberg model and suggests an autocorrelation function to analyze the pseudo-randomicity of chaotic secure systems under different sampling interval. The results show that: (1) the increase of the order of the chaotic transmitter will not necessarily result in a high degree of security; (2) chaotic secure systems have higher and stronger pseudo-randomicity at sparse sampling interval due to the similarity of chaotic time series to the noise; (3) Volterra-Wiener-Korenberg method can also give a further appropriate sparse sampling interval for improving the security of chaotic secure communication systems. For unmasking chaotic communication systems, the Volterra-Wiener-Korenberg technique can be applied to analyze the chaotic time series with surrogate data

  7. Deep Learning for Magnetic Resonance Fingerprinting: A New Approach for Predicting Quantitative Parameter Values from Time Series.

    Science.gov (United States)

    Hoppe, Elisabeth; Körzdörfer, Gregor; Würfl, Tobias; Wetzl, Jens; Lugauer, Felix; Pfeuffer, Josef; Maier, Andreas

    2017-01-01

    The purpose of this work is to evaluate methods from deep learning for application to Magnetic Resonance Fingerprinting (MRF). MRF is a recently proposed measurement technique for generating quantitative parameter maps. In MRF a non-steady state signal is generated by a pseudo-random excitation pattern. A comparison of the measured signal in each voxel with the physical model yields quantitative parameter maps. Currently, the comparison is done by matching a dictionary of simulated signals to the acquired signals. To accelerate the computation of quantitative maps we train a Convolutional Neural Network (CNN) on simulated dictionary data. As a proof of principle we show that the neural network implicitly encodes the dictionary and can replace the matching process.

  8. Cascade Chaotic System With Applications.

    Science.gov (United States)

    Zhou, Yicong; Hua, Zhongyun; Pun, Chi-Man; Chen, C L Philip

    2015-09-01

    Chaotic maps are widely used in different applications. Motivated by the cascade structure in electronic circuits, this paper introduces a general chaotic framework called the cascade chaotic system (CCS). Using two 1-D chaotic maps as seed maps, CCS is able to generate a huge number of new chaotic maps. Examples and evaluations show the CCS's robustness. Compared with corresponding seed maps, newly generated chaotic maps are more unpredictable and have better chaotic performance, more parameters, and complex chaotic properties. To investigate applications of CCS, we introduce a pseudo-random number generator (PRNG) and a data encryption system using a chaotic map generated by CCS. Simulation and analysis demonstrate that the proposed PRNG has high quality of randomness and that the data encryption system is able to protect different types of data with a high-security level.

  9. Possibilities and testing of CPRNG in block cipher mode of operation PM-DC-LM

    Energy Technology Data Exchange (ETDEWEB)

    Zacek, Petr; Jasek, Roman; Malanik, David [Faculty of applied Informatics, Tomas Bata University in Zlin, Zlin, Czech Republic zacek@fai.utb.cz, jasek@fai.utb.cz, dmalanik@fai.utb.cz (Czech Republic)

    2016-06-08

    This paper discusses the chaotic pseudo-random number generator (CPRNG), which is used in block cipher mode of operation called PM-DC-LM. PM-DC-LM is one of possible subversions of general PM mode. In this paper is not discussed the design of PM-DC-LM, but only CPRNG as a part of it because designing is written in other papers. Possibilities, how to change or to improve CPRNG are mentioned. The final part is devoted for a little testing of CPRNG and some testing data are shown.

  10. Possibilities and testing of CPRNG in block cipher mode of operation PM-DC-LM

    Science.gov (United States)

    Zacek, Petr; Jasek, Roman; Malanik, David

    2016-06-01

    This paper discusses the chaotic pseudo-random number generator (CPRNG), which is used in block cipher mode of operation called PM-DC-LM. PM-DC-LM is one of possible subversions of general PM mode. In this paper is not discussed the design of PM-DC-LM, but only CPRNG as a part of it because designing is written in other papers. Possibilities, how to change or to improve CPRNG are mentioned. The final part is devoted for a little testing of CPRNG and some testing data are shown.

  11. The smoothing and fast Fourier transformation of experimental X-ray and neutron data from amorphous materials

    International Nuclear Information System (INIS)

    Dixon, M.; Wright, A.C.; Hutchinson, P.

    1977-01-01

    The application of fast Fourier transformation techniques to the analysis of experimental X-ray and neutron diffraction patterns from amorphous materials is discussed and compared with conventional techniques using Filon's quadrature. The fast Fourier transform package described also includes cubic spline smoothing and has been extensively tested, using model data to which statistical errors have been added by means of a pseudo-random number generator with Gaussian shaper. Neither cubic spline nor hand smoothing has much effect on the resulting transform since the noise removed is of too high a frequency. (Auth.)

  12. Possibilities and testing of CPRNG in block cipher mode of operation PM-DC-LM

    International Nuclear Information System (INIS)

    Zacek, Petr; Jasek, Roman; Malanik, David

    2016-01-01

    This paper discusses the chaotic pseudo-random number generator (CPRNG), which is used in block cipher mode of operation called PM-DC-LM. PM-DC-LM is one of possible subversions of general PM mode. In this paper is not discussed the design of PM-DC-LM, but only CPRNG as a part of it because designing is written in other papers. Possibilities, how to change or to improve CPRNG are mentioned. The final part is devoted for a little testing of CPRNG and some testing data are shown.

  13. Detect Image Tamper by Semi-Fragile Digital Watermarking

    Institute of Scientific and Technical Information of China (English)

    LIUFeilong; WANGYangsheng

    2004-01-01

    To authenticate the integrity of image while resisting some valid image processing such as JPEG compression, a semi-fragile image watermarking is described. Image name, one of the image features, has been used as the key of pseudo-random function to generate the special watermarks for the different image. Watermarks are embedded by changing the relationship between the blocks' DCT DC coefficients, and the image tamper are detected with the relationship of these DCT DC coefficients.Experimental results show that the proposed technique can resist JPEG compression, and detect image tamper in the meantime.

  14. A comparative study of chaotic and white noise signals in digital watermarking

    International Nuclear Information System (INIS)

    Mooney, Aidan; Keating, John G.; Pitas, Ioannis

    2008-01-01

    Digital watermarking is an ever increasing and important discipline, especially in the modern electronically-driven world. Watermarking aims to embed a piece of information into digital documents which their owner can use to prove that the document is theirs, at a later stage. In this paper, performance analysis of watermarking schemes is performed on white noise sequences and chaotic sequences for the purpose of watermark generation. Pseudorandom sequences are compared with chaotic sequences generated from the chaotic skew tent map. In particular, analysis is performed on highpass signals generated from both these watermark generation schemes, along with analysis on lowpass watermarks and white noise watermarks. This analysis focuses on the watermarked images after they have been subjected to common image distortion attacks. It is shown that signals generated from highpass chaotic signals have superior performance than highpass noise signals, in the presence of such attacks. It is also shown that watermarks generated from lowpass chaotic signals have superior performance over the other signal types analysed

  15. Private random numbers produced by entangled ions and certified by Bell's theorem

    Science.gov (United States)

    Hayes, David; Matsukevich, Dzmitry; Maunz, Peter; Monroe, Chris; Olmschenk, Steven

    2010-03-01

    It has been shown that entangled particles can be used to generate numbers whose privacy and randomness are guaranteed by the violation of a Bell inequality [1,2]. The authenticity of the bit stream produced is guaranteed when the system used can close the detection loophole and when the entangled particles are non-interacting. We report the use of remotely located trapped ions with near perfect state detection efficiency as a private random number generator. By entangling the ions through photon interference and choosing the measurement settings using a pseudo-random number generator, we measure a CHSH correlation function that is more than seven standard deviations above the classical limit. With a total of 3016 events, we are able to certify the generation of 42 new random numbers with 99% confidence. [1] S. Pironio et al.(submitted to Nature, arXiv:0911.3427) [2] Colbeck, R. PhD Dissertation (2007)

  16. Exploring Monte Carlo Simulation Strategies for Geoscience Applications

    Science.gov (United States)

    Blais, J.; Grebenitcharsky, R.; Zhang, Z.

    2008-12-01

    Computer simulations are an increasingly important area of geoscience research and development. At the core of stochastic or Monte Carlo simulations are the random number sequences that are assumed to be distributed with specific characteristics. Computer generated random numbers, uniformly distributed on [0, 1], can be very different depending on the selection of pseudo-random number (PRN), quasi-random number (QRN) or chaotic random number (CRN) generators. In the evaluation of some definite integrals, the expected error variances are generally of different orders for the same number of random numbers. A comparative analysis of these three strategies has been carried out for geodetic and related applications in planar and spherical contexts. Based on these computational experiments, conclusions and recommendations concerning their performance and error variances are included.

  17. Bad Seeds Sprout Perilous Dynamics: Stochastic Thermostat Induced Trajectory Synchronization in Biomolecules.

    Science.gov (United States)

    Sindhikara, Daniel J; Kim, Seonah; Voter, Arthur F; Roitberg, Adrian E

    2009-06-09

    Molecular dynamics simulations starting from different initial conditions are commonly used to mimic the behavior of an experimental ensemble. We show in this article that when a Langevin thermostat is used to maintain constant temperature during such simulations, extreme care must be taken when choosing the random number seeds to prevent statistical correlation among the MD trajectories. While recent studies have shown that stochastically thermostatted trajectories evolving within a single potential basin with identical random number seeds tend to synchronize, we show that there is a synchronization effect even for complex, biologically relevant systems. We demonstrate this effect in simulations of alanine trimer and pentamer and in a simulation of a temperature-jump experiment for peptide folding of a 14-residue peptide. Even in replica-exchange simulations, in which the trajectories are at different temperatures, we find partial synchronization occurring when the same random number seed is employed. We explain this by extending the recent derivation of the synchronization effect for two trajectories in a harmonic well to the case in which the trajectories are at two different temperatures. Our results suggest several ways in which mishandling selection of a pseudorandom number generator initial seed can lead to corruption of simulation data. Simulators can fall into this trap in simple situations such as neglecting to specifically indicate different random seeds in either parallel or sequential restart simulations, utilizing a simulation package with a weak pseudorandom number generator, or using an advanced simulation algorithm that has not been programmed to distribute initial seeds.

  18. Photonic compressive sensing enabled data efficient time stretch optical coherence tomography

    Science.gov (United States)

    Mididoddi, Chaitanya K.; Wang, Chao

    2018-03-01

    Photonic time stretch (PTS) has enabled real time spectral domain optical coherence tomography (OCT). However, this method generates a torrent of massive data at GHz stream rate, which requires capturing as per Nyquist principle. If the OCT interferogram signal is sparse in Fourier domain, which is always true for samples with limited number of layers, it can be captured at lower (sub-Nyquist) acquisition rate as per compressive sensing method. In this work we report a data compressed PTS-OCT system based on photonic compressive sensing with 66% compression with low acquisition rate of 50MHz and measurement speed of 1.51MHz per depth profile. A new method has also been proposed to improve the system with all-optical random pattern generation, which completely avoids electronic bottleneck in traditional binary pseudorandom binary sequence (PRBS) generators.

  19. Performance Analysis of Parallel Mathematical Subroutine library PARCEL

    International Nuclear Information System (INIS)

    Yamada, Susumu; Shimizu, Futoshi; Kobayashi, Kenichi; Kaburaki, Hideo; Kishida, Norio

    2000-01-01

    The parallel mathematical subroutine library PARCEL (Parallel Computing Elements) has been developed by Japan Atomic Energy Research Institute for easy use of typical parallelized mathematical codes in any application problems on distributed parallel computers. The PARCEL includes routines for linear equations, eigenvalue problems, pseudo-random number generation, and fast Fourier transforms. It is shown that the results of performance for linear equations routines exhibit good parallelization efficiency on vector, as well as scalar, parallel computers. A comparison of the efficiency results with the PETSc (Portable Extensible Tool kit for Scientific Computations) library has been reported. (author)

  20. Why and how did Israel adopt activity-based hospital payment? The Procedure-Related Group incremental reform.

    Science.gov (United States)

    Brammli-Greenberg, Shuli; Waitzberg, Ruth; Perman, Vadim; Gamzu, Ronni

    2016-10-01

    Historically, Israel paid its non-profit hospitals on a perdiem (PD) basis. Recently, like other OECD countries, Israel has moved to activity-based payments. While most countries have adopted a diagnostic related group (DRG) payment system, Israel has chosen a Procedure-Related Group (PRG) system. This differs from the DRG system because it classifies patients by procedure rather than diagnosis. In Israel, the PRG system was found to be more feasible given the lack of data and information needed in the DRG classification system. The Ministry of Health (MoH) chose a payment scheme that depends only on inhouse creation of PRG codes and costing, thus avoiding dependence on hospital data. The PRG tariffs are priced by a joint Health and Finance Ministry commission and updated periodically. Moreover, PRGs are believed to achieve the same main efficiency objectives as DRGs: increasing the volume of activity, shortening unnecessary hospitalization days, and reducing the gaps between the costs and prices of activities. The PRG system is being adopted through an incremental reform that started in 2002 and was accelerated in 2010. The Israeli MoH involved the main players in the hospital market in the consolidation of this potentially controversial reform in order to avoid opposition. The reform was implemented incrementally in order to preserve the balance of resource allocation and overall expenditures of the system, thus becoming budget neutral. Yet, as long as gaps remain between marginal costs and prices of procedures, PRGs will not attain all their objectives. Moreover, it is still crucial to refine PRG rates to reflect the severity of cases, in order to tackle incentives for selection of patients within each procedure. Copyright © 2016 The Author(s). Published by Elsevier Ireland Ltd.. All rights reserved.

  1. PRGdb 3.0: a comprehensive platform for prediction and analysis of plant disease resistance genes.

    Science.gov (United States)

    Osuna-Cruz, Cristina M; Paytuvi-Gallart, Andreu; Di Donato, Antimo; Sundesha, Vicky; Andolfo, Giuseppe; Aiese Cigliano, Riccardo; Sanseverino, Walter; Ercolano, Maria R

    2018-01-04

    The Plant Resistance Genes database (PRGdb; http://prgdb.org) has been redesigned with a new user interface, new sections, new tools and new data for genetic improvement, allowing easy access not only to the plant science research community but also to breeders who want to improve plant disease resistance. The home page offers an overview of easy-to-read search boxes that streamline data queries and directly show plant species for which data from candidate or cloned genes have been collected. Bulk data files and curated resistance gene annotations are made available for each plant species hosted. The new Gene Model view offers detailed information on each cloned resistance gene structure to highlight shared attributes with other genes. PRGdb 3.0 offers 153 reference resistance genes and 177 072 annotated candidate Pathogen Receptor Genes (PRGs). Compared to the previous release, the number of putative genes has been increased from 106 to 177 K from 76 sequenced Viridiplantae and algae genomes. The DRAGO 2 tool, which automatically annotates and predicts (PRGs) from DNA and amino acid with high accuracy and sensitivity, has been added. BLAST search has been implemented to offer users the opportunity to annotate and compare their own sequences. The improved section on plant diseases displays useful information linked to genes and genomes to connect complementary data and better address specific needs. Through, a revised and enlarged collection of data, the development of new tools and a renewed portal, PRGdb 3.0 engages the plant science community in developing a consensus plan to improve knowledge and strategies to fight diseases that afflict main crops and other plants. © The Author(s) 2017. Published by Oxford University Press on behalf of Nucleic Acids Research.

  2. It Takes a Village: Network Effects on Rural Education in Afghanistan. PRGS Dissertation

    Science.gov (United States)

    Hoover, Matthew Amos

    2014-01-01

    Often, development organizations confront a tradeoff between program priorities and operational constraints. These constraints may be financial, capacity, or logistical; regardless, the tradeoff often requires sacrificing portions of a program. This work is concerned with figuring out how, when constrained, an organization or program manager can…

  3. A RFID grouping proof protocol for medication safety of inpatient.

    Science.gov (United States)

    Huang, Hsieh-Hong; Ku, Cheng-Yuan

    2009-12-01

    In order to provide enhanced medication safety for inpatients, the medical mechanism which adopts the modified grouping proof protocol is proposed in this paper. By using the grouping proof protocol, the medical staffs could confirm the authentication and integrity of a group of Radio-Frequency Identification (RFID) tags which are embedded on inpatient bracelets and the containers of drugs. This mechanism is designed to be compatible with EPCglobal Class-1 Generation-2 standard which is the most popular specification of RFID tags. Due to the light-weight computational capacity of passive tags, only the pseudo-random number generator (PRNG) and cyclic redundancy code (CRC) are allowed to be used in the communication protocol. Furthermore, a practical scenario of using this proposed mechanism in hospital to examine the medication safety is also presented.

  4. An Ultra-light PRNG Passing Strict Randomness Tests and Suitable for Low Cost Tags

    Directory of Open Access Journals (Sweden)

    OZCANHAN, M. H.

    2016-08-01

    Full Text Available A pseudo-random number generator for low-cost RFID tags is presented. The scheme is simple, sequential and secure, yet has a high performance. Despite its lowest hardware complexity, our proposal represents a better alternative than previous proposals for low-cost tags. The scheme is based on the well-founded pseudo random number generator, Mersenne Twister. The proposed generator takes low-entropy seeds extracted from a physical characteristic of the tag and produces outputs that pass popular randomness tests. Contrarily, previous proposal tests are based on random number inputs from a popular online source, which are simply unavailable to tags. The high performance and satisfactory randomness of present work are supported by extensive test results and compared with similar previous works. Comparison using proven estimation formulae indicates that our proposal has the best hardware complexity, power consumption, and the least cost.

  5. Chaotic Image Encryption Algorithm Based on Circulant Operation

    Directory of Open Access Journals (Sweden)

    Xiaoling Huang

    2013-01-01

    Full Text Available A novel chaotic image encryption scheme based on the time-delay Lorenz system is presented in this paper with the description of Circulant matrix. Making use of the chaotic sequence generated by the time-delay Lorenz system, the pixel permutation is carried out in diagonal and antidiagonal directions according to the first and second components. Then, a pseudorandom chaotic sequence is generated again from time-delay Lorenz system using all components. Modular operation is further employed for diffusion by blocks, in which the control parameter is generated depending on the plain-image. Numerical experiments show that the proposed scheme possesses the properties of a large key space to resist brute-force attack, sensitive dependence on secret keys, uniform distribution of gray values in the cipher-image, and zero correlation between two adjacent cipher-image pixels. Therefore, it can be adopted as an effective and fast image encryption algorithm.

  6. Self generation, small generation, and embedded generation issues

    International Nuclear Information System (INIS)

    2001-01-01

    The New Brunswick Market Design Committee for electric power restructuring has been directed to examine issues regarding cogeneration and small-scale, on-site generation and how they will fit within the framework of the bilateral contract market. The Committee will also have to deal with issues of generation embedded in a distribution system. The Committee has defined cogeneration as the simultaneous production of electricity and useful thermal energy. Self-generation has been defined as small-scale power generation by an end-user, while embedded generation has been defined as a generation facility that is located within a distribution utility but is not directly connected to the transmission system. The Committee has postponed its decision on whether embedded generation will be eligible to participate under the bilateral contract market for electricity. This report discusses general issues such as the physical support of generation, market support of generation, transition issues and policy issues. It also discusses generation support issues such as operating reserves, transmission tariff issues, and distribution tariffs. Market support issues such as transmission access for generation sales were also considered, along with market access for generation sales, and net metering for behind the meter generation. 7 refs., 1 tab

  7. A study of the effect of intermediate structure in the fission cross section of 239Pu on self-shielding factors

    International Nuclear Information System (INIS)

    Ganesan, S.

    1978-01-01

    A set of energy dependent fission widths of 1 + spin state corresponding to the recommended fission cross sections of Sowerby et al is evaluated by adjustment in the energy region 600 ev to 25 Kev. Corresponding to these mean fission widths of 1 + spin state, the intermediate resonance parameters based on Weigmann's formulation of Struitinsky's double humped fission barrier model are then obtained. Pseudorandom resonances are generated with and without the intermediate structure in the mean fission but leading to the same value of infinite dilution fission cross section. The effect of the intermediate structure on the self shielding factors was then investigated. (author)

  8. Antirandom Testing: A Distance-Based Approach

    Directory of Open Access Journals (Sweden)

    Shen Hui Wu

    2008-01-01

    Full Text Available Random testing requires each test to be selected randomly regardless of the tests previously applied. This paper introduces the concept of antirandom testing where each test applied is chosen such that its total distance from all previous tests is maximum. This spans the test vector space to the maximum extent possible for a given number of vectors. An algorithm for generating antirandom tests is presented. Compared with traditional pseudorandom testing, antirandom testing is found to be very effective when a high-fault coverage needs to be achieved with a limited number of test vectors. The superiority of the new approach is even more significant for testing bridging faults.

  9. An experimental applications of impedance measurements by spectral analysis to electrochemistry and corrosion

    International Nuclear Information System (INIS)

    Castro, E.B.; Vilche, J.R.; Milocco, R.H.

    1984-01-01

    An impedance measurement system based on the spectral analysis of excitation and response signals was implemented using a pseudo-random binary sequence in the generation of the electrical perturbation signal. The spectral density functions were estimated through finite Fourier transforms of the original time history records by fast computation of Fourier series. Experimental results obtained using the FFT algorithm in the developed impedance measurement system which covers a wide frequency range, 10 KHz >= f >= 1 mHz, are given both for dummy cells representing conventional electric circuits in electrochemistry and corrosion systems and for the Fe/acidic chloride solution interfaces under different polarization conditions. (C.L.B.) [pt

  10. Distorted estimates of implicit and explicit learning in applications of the process-dissociation procedure to the SRT task.

    Science.gov (United States)

    Stahl, Christoph; Barth, Marius; Haider, Hilde

    2015-12-01

    We investigated potential biases affecting the validity of the process-dissociation (PD) procedure when applied to sequence learning. Participants were or were not exposed to a serial reaction time task (SRTT) with two types of pseudo-random materials. Afterwards, participants worked on a free or cued generation task under inclusion and exclusion instructions. Results showed that pre-experimental response tendencies, non-associative learning of location frequencies, and the usage of cue locations introduced bias to PD estimates. These biases may lead to erroneous conclusions regarding the presence of implicit and explicit knowledge. Potential remedies for these problems are discussed. Copyright © 2015 Elsevier Inc. All rights reserved.

  11. A novel chaotic stream cipher and its application to palmprint template protection

    International Nuclear Information System (INIS)

    Heng-Jian, Li; Jia-Shu, Zhang

    2010-01-01

    Based on a coupled nonlinear dynamic filter (NDF), a novel chaotic stream cipher is presented in this paper and employed to protect palmprint templates. The chaotic pseudorandom bit generator (PRBG) based on a coupled NDF, which is constructed in an inverse flow, can generate multiple bits at one iteration and satisfy the security requirement of cipher design. Then, the stream cipher is employed to generate cancelable competitive code palmprint biometrics for template protection. The proposed cancelable palmprint authentication system depends on two factors: the palmprint biometric and the password/token. Therefore, the system provides high-confidence and also protects the user's privacy. The experimental results of verification on the Hong Kong PolyU Palmprint Database show that the proposed approach has a large template re-issuance ability and the equal error rate can achieve 0.02%. The performance of the palmprint template protection scheme proves the good practicability and security of the proposed stream cipher. (general)

  12. A novel chaotic stream cipher and its application to palmprint template protection

    Science.gov (United States)

    Li, Heng-Jian; Zhang, Jia-Shu

    2010-04-01

    Based on a coupled nonlinear dynamic filter (NDF), a novel chaotic stream cipher is presented in this paper and employed to protect palmprint templates. The chaotic pseudorandom bit generator (PRBG) based on a coupled NDF, which is constructed in an inverse flow, can generate multiple bits at one iteration and satisfy the security requirement of cipher design. Then, the stream cipher is employed to generate cancelable competitive code palmprint biometrics for template protection. The proposed cancelable palmprint authentication system depends on two factors: the palmprint biometric and the password/token. Therefore, the system provides high-confidence and also protects the user's privacy. The experimental results of verification on the Hong Kong PolyU Palmprint Database show that the proposed approach has a large template re-issuance ability and the equal error rate can achieve 0.02%. The performance of the palmprint template protection scheme proves the good practicability and security of the proposed stream cipher.

  13. An investigation of error correcting techniques for OMV and AXAF

    Science.gov (United States)

    Ingels, Frank; Fryer, John

    1991-01-01

    The original objectives of this project were to build a test system for the NASA 255/223 Reed/Solomon encoding/decoding chip set and circuit board. This test system was then to be interfaced with a convolutional system at MSFC to examine the performance of the concantinated codes. After considerable work, it was discovered that the convolutional system could not function as needed. This report documents the design, construction, and testing of the test apparatus for the R/S chip set. The approach taken was to verify the error correcting behavior of the chip set by injecting known error patterns onto data and observing the results. Error sequences were generated using pseudo-random number generator programs, with Poisson time distribution between errors and Gaussian burst lengths. Sample means, variances, and number of un-correctable errors were calculated for each data set before testing.

  14. Feature Selection and Parameters Optimization of SVM Using Particle Swarm Optimization for Fault Classification in Power Distribution Systems.

    Science.gov (United States)

    Cho, Ming-Yuan; Hoang, Thi Thom

    2017-01-01

    Fast and accurate fault classification is essential to power system operations. In this paper, in order to classify electrical faults in radial distribution systems, a particle swarm optimization (PSO) based support vector machine (SVM) classifier has been proposed. The proposed PSO based SVM classifier is able to select appropriate input features and optimize SVM parameters to increase classification accuracy. Further, a time-domain reflectometry (TDR) method with a pseudorandom binary sequence (PRBS) stimulus has been used to generate a dataset for purposes of classification. The proposed technique has been tested on a typical radial distribution network to identify ten different types of faults considering 12 given input features generated by using Simulink software and MATLAB Toolbox. The success rate of the SVM classifier is over 97%, which demonstrates the effectiveness and high efficiency of the developed method.

  15. Complexity Analysis and DSP Implementation of the Fractional-Order Lorenz Hyperchaotic System

    Directory of Open Access Journals (Sweden)

    Shaobo He

    2015-12-01

    Full Text Available The fractional-order hyperchaotic Lorenz system is solved as a discrete map by applying the Adomian decomposition method (ADM. Lyapunov Characteristic Exponents (LCEs of this system are calculated according to this deduced discrete map. Complexity of this system versus parameters are analyzed by LCEs, bifurcation diagrams, phase portraits, complexity algorithms. Results show that this system has rich dynamical behaviors. Chaos and hyperchaos can be generated by decreasing fractional order q in this system. It also shows that the system is more complex when q takes smaller values. SE and C 0 complexity algorithms provide a parameter choice criteria for practice applications of fractional-order chaotic systems. The fractional-order system is implemented by digital signal processor (DSP, and a pseudo-random bit generator is designed based on the implemented system, which passes the NIST test successfully.

  16. J3Gen: A PRNG for Low-Cost Passive RFID

    Directory of Open Access Journals (Sweden)

    Jordi Herrera-Joancomartí

    2013-03-01

    Full Text Available Pseudorandom number generation (PRNG is the main security tool in low-cost passive radio-frequency identification (RFID technologies, such as EPC Gen2. We present a lightweight PRNG design for low-cost passive RFID tags, named J3Gen. J3Gen is based on a linear feedback shift register (LFSR configured with multiple feedback polynomials. The polynomials are alternated during the generation of sequences via a physical source of randomness. J3Gen successfully handles the inherent linearity of LFSR based PRNGs and satisfies the statistical requirements imposed by the EPC Gen2 standard. A hardware implementation of J3Gen is presented and evaluated with regard to different design parameters, defining the key-equivalence security and nonlinearity of the design. The results of a SPICE simulation confirm the power-consumption suitability of the proposal.

  17. Feature Selection and Parameters Optimization of SVM Using Particle Swarm Optimization for Fault Classification in Power Distribution Systems

    Directory of Open Access Journals (Sweden)

    Ming-Yuan Cho

    2017-01-01

    Full Text Available Fast and accurate fault classification is essential to power system operations. In this paper, in order to classify electrical faults in radial distribution systems, a particle swarm optimization (PSO based support vector machine (SVM classifier has been proposed. The proposed PSO based SVM classifier is able to select appropriate input features and optimize SVM parameters to increase classification accuracy. Further, a time-domain reflectometry (TDR method with a pseudorandom binary sequence (PRBS stimulus has been used to generate a dataset for purposes of classification. The proposed technique has been tested on a typical radial distribution network to identify ten different types of faults considering 12 given input features generated by using Simulink software and MATLAB Toolbox. The success rate of the SVM classifier is over 97%, which demonstrates the effectiveness and high efficiency of the developed method.

  18. Close to Optimally Secure Variants of GCM

    Directory of Open Access Journals (Sweden)

    Ping Zhang

    2018-01-01

    Full Text Available The Galois/Counter Mode of operation (GCM is a widely used nonce-based authenticated encryption with associated data mode which provides the birthday-bound security in the nonce-respecting scenario; that is, it is secure up to about 2n/2 adversarial queries if all nonces used in the encryption oracle are never repeated, where n is the block size. It is an open problem to analyze whether GCM security can be improved by using some simple operations. This paper presents a positive response for this problem. Firstly, we introduce two close to optimally secure pseudorandom functions and derive their security bound by the hybrid technique. Then, we utilize these pseudorandom functions that we design and a universal hash function to construct two improved versions of GCM, called OGCM-1 and OGCM-2. OGCM-1 and OGCM-2 are, respectively, provably secure up to approximately 2n/67(n-12 and 2n/67 adversarial queries in the nonce-respecting scenario if the underlying block cipher is a secure pseudorandom permutation. Finally, we discuss the properties of OGCM-1 and OGCM-2 and describe the future works.

  19. Variable length adjacent partitioning for PTS based PAPR reduction of OFDM signal

    International Nuclear Information System (INIS)

    Ibraheem, Zeyid T.; Rahman, Md. Mijanur; Yaakob, S. N.; Razalli, Mohammad Shahrazel; Kadhim, Rasim A.

    2015-01-01

    Peak-to-Average power ratio (PAPR) is a major drawback in OFDM communication. It leads the power amplifier into nonlinear region operation resulting into loss of data integrity. As such, there is a strong motivation to find techniques to reduce PAPR. Partial Transmit Sequence (PTS) is an attractive scheme for this purpose. Judicious partitioning the OFDM data frame into disjoint subsets is a pivotal component of any PTS scheme. Out of the existing partitioning techniques, adjacent partitioning is characterized by an attractive trade-off between cost and performance. With an aim of determining effects of length variability of adjacent partitions, we performed an investigation into the performances of a variable length adjacent partitioning (VL-AP) and fixed length adjacent partitioning in comparison with other partitioning schemes such as pseudorandom partitioning. Simulation results with different modulation and partitioning scenarios showed that fixed length adjacent partition had better performance compared to variable length adjacent partitioning. As expected, simulation results showed a slightly better performance of pseudorandom partitioning technique compared to fixed and variable adjacent partitioning schemes. However, as the pseudorandom technique incurs high computational complexities, adjacent partitioning schemes were still seen as favorable candidates for PAPR reduction

  20. Variable length adjacent partitioning for PTS based PAPR reduction of OFDM signal

    Energy Technology Data Exchange (ETDEWEB)

    Ibraheem, Zeyid T.; Rahman, Md. Mijanur; Yaakob, S. N.; Razalli, Mohammad Shahrazel; Kadhim, Rasim A. [School of Computer and Communication Engineering, Universiti Malaysia Perlis, 02600 Arau, Perlis (Malaysia)

    2015-05-15

    Peak-to-Average power ratio (PAPR) is a major drawback in OFDM communication. It leads the power amplifier into nonlinear region operation resulting into loss of data integrity. As such, there is a strong motivation to find techniques to reduce PAPR. Partial Transmit Sequence (PTS) is an attractive scheme for this purpose. Judicious partitioning the OFDM data frame into disjoint subsets is a pivotal component of any PTS scheme. Out of the existing partitioning techniques, adjacent partitioning is characterized by an attractive trade-off between cost and performance. With an aim of determining effects of length variability of adjacent partitions, we performed an investigation into the performances of a variable length adjacent partitioning (VL-AP) and fixed length adjacent partitioning in comparison with other partitioning schemes such as pseudorandom partitioning. Simulation results with different modulation and partitioning scenarios showed that fixed length adjacent partition had better performance compared to variable length adjacent partitioning. As expected, simulation results showed a slightly better performance of pseudorandom partitioning technique compared to fixed and variable adjacent partitioning schemes. However, as the pseudorandom technique incurs high computational complexities, adjacent partitioning schemes were still seen as favorable candidates for PAPR reduction.

  1. Magnet Free Generators - 3rd Generation Wind Turbine Generators

    DEFF Research Database (Denmark)

    Jensen, Bogi Bech; Mijatovic, Nenad; Henriksen, Matthew Lee

    2013-01-01

    This paper presents an introduction to superconducting wind turbine generators, which are often referred to as 3rd generation wind turbine generators. Advantages and challenges of superconducting generators are presented with particular focus on possible weight and efficiency improvements. A comp...

  2. Revision of J3Gen and Validity of the Attacks by Peinado et al.

    Directory of Open Access Journals (Sweden)

    Alberto Peinado

    2015-05-01

    Full Text Available This letter is the reply to: Remarks on Peinado et al.’s Analysis of J3Gen by J. Garcia-Alfaro, J. Herrera-Joancomartí and J. Melià-Seguí published in Sensors 2015, 15, 6217–6220. Peinado et al. cryptanalyzed the pseudorandom number generator proposed by Melià-Seguí et al., describing two possible attacks. Later, Garcia-Alfaro claimed that one of this attack did not hold in practice because the assumptions made by Peinado et al. were not correct. This letter reviews those remarks, showing that J3Gen is anyway flawed and that, without further information, the interpretation made by Peinado et al. seems to be correct.

  3. Random Numbers and Monte Carlo Methods

    Science.gov (United States)

    Scherer, Philipp O. J.

    Many-body problems often involve the calculation of integrals of very high dimension which cannot be treated by standard methods. For the calculation of thermodynamic averages Monte Carlo methods are very useful which sample the integration volume at randomly chosen points. After summarizing some basic statistics, we discuss algorithms for the generation of pseudo-random numbers with given probability distribution which are essential for all Monte Carlo methods. We show how the efficiency of Monte Carlo integration can be improved by sampling preferentially the important configurations. Finally the famous Metropolis algorithm is applied to classical many-particle systems. Computer experiments visualize the central limit theorem and apply the Metropolis method to the traveling salesman problem.

  4. Time gated phase-correlation distributed Brillouin fibre sensor

    Science.gov (United States)

    Denisov, Andrey; Soto, Marcelo A.; Thévenaz, Luc

    2013-05-01

    A random access distributed Brillouin fibre sensor is presented, based on phase modulation using a pseudo-random bit sequence (PRBS) together with time gating. The standard phase-correlation technique is known to show a noise level increasing linearly with the number of measured points due to weak gratings generated randomly along the whole sensing fibre. Here we show how intensity modulated pump and time gated detection significantly improve the signal-tonoise ratio (SNR) of the system with no impact on the spatial resolution. A measurement with 1.1 cm spatial resolution over 3.3 km is demonstrated, representing 300'000 equivalent points. The limitations of the proposed technique are discussed through the paper.

  5. Quasi-Monte Carlo methods: applications to modeling of light transport in tissue

    Science.gov (United States)

    Schafer, Steven A.

    1996-05-01

    Monte Carlo modeling of light propagation can accurately predict the distribution of light in scattering materials. A drawback of Monte Carlo methods is that they converge inversely with the square root of the number of iterations. Theoretical considerations suggest that convergence which scales inversely with the first power of the number of iterations is possible. We have previously shown that one can obtain at least a portion of that improvement by using van der Corput sequences in place of a conventional pseudo-random number generator. Here, we present our further analysis, and show that quasi-Monte Carlo methods do have limited applicability to light scattering problems. We also discuss potential improvements which may increase the applicability.

  6. Inclusive Bottom Production in $p \\bar{p}$ Collisions at $\\sqrt{s}$ = 1.8-TeV at D0 Central Detector Region

    Energy Technology Data Exchange (ETDEWEB)

    Oguri, Vitor [Rio de Janeiro, CBPF

    1995-08-01

    The inclusive b-quark cross section at center of mass energy of 1:8 TeV, at the Fermilab Tevatron $p\\bar{p}$ Collider, is determined from the inclusive muon cross section, with data taken during 1992-1993 at D0 detector. The analyses were realized in the detector central region. The global efficiency components were estimated from the pseudo-random event generator ISAJET, from cosmic ray data and from D0 muon data itself. The $b$-quark cross section seems to be well described by next to leading order (NLO) QCD prediction for the rapidity $\\mid y \\mid$ < 1:0 and transverse momentum greater than 6:0 GeV kinematical region

  7. Polar ring galaxies in the Galaxy Zoo

    Science.gov (United States)

    Finkelman, Ido; Funes, José G.; Brosch, Noah

    2012-05-01

    We report observations of 16 candidate polar-ring galaxies (PRGs) identified by the Galaxy Zoo project in the Sloan Digital Sky Survey (SDSS) data base. Deep images of five galaxies are available in the SDSS Stripe82 data base, while to reach similar depth we observed the remaining galaxies with the 1.8-m Vatican Advanced Technology Telescope. We derive integrated magnitudes and u-r colours for the host and ring components and show continuum-subtracted Hα+[N II] images for seven objects. We present a basic morphological and environmental analysis of the galaxies and discuss their properties in comparison with other types of early-type galaxies. Follow-up photometric and spectroscopic observations will allow a kinematic confirmation of the nature of these systems and a more detailed analysis of their stellar populations.

  8. Resolving the range ambiguity in OFDR using digital signal processing

    International Nuclear Information System (INIS)

    Riesen, Nicolas; Lam, Timothy T-Y; Chow, Jong H

    2014-01-01

    A digitally range-gated variant of optical frequency domain reflectometry is demonstrated which overcomes the beat note ambiguity when sensing beyond a single frequency sweep. The range-gating is achieved using a spread spectrum technique involving time-stamping of the optical signal using high-frequency pseudorandom phase modulation. The reflections from different sections of fiber can then be isolated in the time domain by digitally inverting the phase modulation using appropriately-delayed copies of the pseudorandom noise code. Since the technique overcomes the range ambiguity in OFDR, it permits high sweep repetition rates without sacrificing range, thus allowing for high-bandwidth sensing over long lengths of fiber. This is demonstrated for the case of quasi-distributed sensing. (paper)

  9. Fragmentation of percolation cluster perimeters

    Science.gov (United States)

    Debierre, Jean-Marc; Bradley, R. Mark

    1996-05-01

    We introduce a model for the fragmentation of porous random solids under the action of an external agent. In our model, the solid is represented by a bond percolation cluster on the square lattice and bonds are removed only at the external perimeter (or `hull') of the cluster. This model is shown to be related to the self-avoiding walk on the Manhattan lattice and to the disconnection events at a diffusion front. These correspondences are used to predict the leading and the first correction-to-scaling exponents for several quantities defined for hull fragmentation. Our numerical results support these predictions. In addition, the algorithm used to construct the perimeters reveals itself to be a very efficient tool for detecting subtle correlations in the pseudo-random number generator used. We present a quantitative test of two generators which supports recent results reported in more systematic studies.

  10. The probabilistic method of WWER fuel rod strength estimation using the START-3 code

    International Nuclear Information System (INIS)

    Bibilashvili, Yu.K.; Medvedev, A.V.; Bogatyr, S.M.; Sokolov, F.F.; Khramtsov, M.V.

    2001-01-01

    During the last years probability methods of studying were widely used to determine the influence exerted by the geometry, technology and performance parameters of a fuel rod on the characteristics of its condition. Despite the diversity of probability methods their basis is formed by the simplest schema of the Monte-Carlo method (MC). This schema assumes a great number of the realizations of a random value and the statistical assessment of its characteristics. To generate random values, use is usually made of a pseudo-random number generator. The application of the quasi-random sequence elements in place of the latter substantially reduces the machine time since it promotes a quicker convergence of the method. Probability methods used to study the characteristics of a fuel rod condition can be considered to be an auxiliary means of deterministic calculations that allows the assessment of the conservatism degree of design calculations. (author)

  11. Commanding Generation Y: How Generation X Military Leaders Can Better Utilize Generational Tendencies

    Science.gov (United States)

    2013-03-21

    generation ( Baby Boomers ). Although the profession of arms is a time-honored tradition steeped in discipline...senior leadership generational tendencies. Command; Leadership; Generation ; Baby Boomer ; Generation X; Generation Y Unclass Unclass Unclass UU 32 USMC...enable commanders to better lead Generation Y within the U.S. military. Discussion: Baby Boomers , Generation X, and Generation Y are

  12. Evaluating the Impacts of School Nutrition and Physical Activity Policies on Child Health. PRGS Dissertation

    Science.gov (United States)

    Fernandes, Meenakshi Maria

    2010-01-01

    This dissertation evaluates the impact of elementary school policies on child health behaviors and obesity in the United States. Two chapters address nutrition policies, two chapters address physical activity policies, and a final chapter estimates the health care cost savings associated with a decline in childhood obesity prevalence. The use of…

  13. Optical encryption using pseudorandom complex spatial modulation.

    Science.gov (United States)

    Sarkadi, Tamás; Koppa, Pál

    2012-12-01

    In this paper we propose a new (to our knowledge) complex spatial modulation method to encode data pages applicable in double random phase encryption (DRPE) to make the system more resistant to brute-force attack. The proposed modulation method uses data page pixels with random phase and amplitude values with the condition that the intensity of the interference of light from two adjacent pixels should correspond to the encoded information. A differential phase contrast technique is applied to recover the data page at the output of the system. We show that the proposed modulation method can enhance the robustness of the DRPE technique using point spread function analysis. Key space expansion is determined by numeric model calculations.

  14. Multiple regression models for energy use in air-conditioned office buildings in different climates

    International Nuclear Information System (INIS)

    Lam, Joseph C.; Wan, Kevin K.W.; Liu Dalong; Tsang, C.L.

    2010-01-01

    An attempt was made to develop multiple regression models for office buildings in the five major climates in China - severe cold, cold, hot summer and cold winter, mild, and hot summer and warm winter. A total of 12 key building design variables were identified through parametric and sensitivity analysis, and considered as inputs in the regression models. The coefficient of determination R 2 varies from 0.89 in Harbin to 0.97 in Kunming, indicating that 89-97% of the variations in annual building energy use can be explained by the changes in the 12 parameters. A pseudo-random number generator based on three simple multiplicative congruential generators was employed to generate random designs for evaluation of the regression models. The difference between regression-predicted and DOE-simulated annual building energy use are largely within 10%. It is envisaged that the regression models developed can be used to estimate the likely energy savings/penalty during the initial design stage when different building schemes and design concepts are being considered.

  15. Manual for the ELL (2) - parser generator and tree generator generator

    OpenAIRE

    Heckmann, Reinhold

    1986-01-01

    Regular right part grammars extended by tree generator specifications are interpreted by a combined parser generator and tree generator that produces an ELL(2) parser. This parser is able to translate programs of the specified language into abstract syntax trees according to the tree specifications in the generator input.

  16. European Nicotinamide Diabetes Intervention Trial (ENDIT)

    DEFF Research Database (Denmark)

    Gale, E A M; Bingley, P J; Emmett, C L

    2004-01-01

    with a pseudorandom number generator and we used size balanced blocks of four and stratified by age and national group. Primary outcome was development of diabetes, as defined by WHO criteria. Analysis was done on an intention-to-treat basis. FINDINGS: There was no difference in the development of diabetes between...... secretion. INTERPRETATION: Large-scale controlled trials of interventions designed to prevent the onset of type 1 diabetes are feasible, but nicotinamide was ineffective at the dose we used.......BACKGROUND: Results of studies in animals and human beings suggest that type 1 diabetes is preventable. Nicotinamide prevents autoimmune diabetes in animal models, possibly through inhibition of the DNA repair enzyme poly-ADP-ribose polymerase and prevention of beta-cell NAD depletion. We aimed...

  17. Statistical auditing and randomness test of lotto k/N-type games

    Science.gov (United States)

    Coronel-Brizio, H. F.; Hernández-Montoya, A. R.; Rapallo, F.; Scalas, E.

    2008-11-01

    One of the most popular lottery games worldwide is the so-called “lotto k/N”. It considers N numbers 1,2,…,N from which k are drawn randomly, without replacement. A player selects k or more numbers and the first prize is shared amongst those players whose selected numbers match all of the k randomly drawn. Exact rules may vary in different countries. In this paper, mean values and covariances for the random variables representing the numbers drawn from this kind of game are presented, with the aim of using them to audit statistically the consistency of a given sample of historical results with theoretical values coming from a hypergeometric statistical model. The method can be adapted to test pseudorandom number generators.

  18. Tunable and reconfigurable multi-tap microwave photonic filter based on dynamic Brillouin gratings in fibers.

    Science.gov (United States)

    Sancho, J; Primerov, N; Chin, S; Antman, Y; Zadok, A; Sales, S; Thévenaz, L

    2012-03-12

    We propose and experimentally demonstrate new architectures to realize multi-tap microwave photonic filters, based on the generation of a single or multiple dynamic Brillouin gratings in polarization maintaining fibers. The spectral range and selectivity of the proposed periodic filters is extensively tunable, simply by reconfiguring the positions and the number of dynamic gratings along the fiber respectively. In this paper, we present a complete analysis of three different configurations comprising a microwave photonic filter implementation: a simple notch-type Mach-Zehnder approach with a single movable dynamic grating, a multi-tap performance based on multiple dynamic gratings and finally a stationary grating configuration based on the phase modulation of two counter-propagating optical waves by a common pseudo-random bit sequence (PRBS).

  19. A cryptosystem based on elementary cellular automata

    Science.gov (United States)

    Abdo, A. A.; Lian, Shiguo; Ismail, I. A.; Amin, M.; Diab, H.

    2013-01-01

    Based on elementary cellular automata, a new image encryption algorithm is proposed in this paper. In this algorithm, a special kind of periodic boundary cellular automata with unity attractors is used. From the viewpoint of security, the number of cellular automata attractor states are changed with respect to the encrypted image, and different key streams are used to encrypt different plain images. The cellular neural network with chaotic properties is used as the generator of a pseudo-random key stream. Theoretical analysis and experimental results have both confirmed that the proposed algorithm possesses high security level and good performances against differential and statistical attacks. The comparison with other existing schemes is given, which shows the superiority of the proposal scheme.

  20. Image Watermarking Scheme for Specifying False Positive Probability and Bit-pattern Embedding

    Science.gov (United States)

    Sayama, Kohei; Nakamoto, Masayoshi; Muneyasu, Mitsuji; Ohno, Shuichi

    This paper treats a discrete wavelet transform(DWT)-based image watermarking with considering the false positive probability and bit-pattern embedding. We propose an iterative embedding algorithm of watermarking signals which are K sets pseudo-random numbers generated by a secret key. In the detection, K correlations between the watermarked DWT coefficients and watermark signals are computed by using the secret key. L correlations are made available for the judgment of the watermark presence with specified false positive probability, and the other K-L correlations are corresponding to the bit-pattern signal. In the experiment, we show the detection results with specified false positive probability and the bit-pattern recovery, and the comparison of the proposed method against JPEG compression, scaling down and cropping.

  1. [Digital signal processing of a novel neuron discharge model stimulation strategy for cochlear implants].

    Science.gov (United States)

    Yang, Yiwei; Xu, Yuejin; Miu, Jichang; Zhou, Linghong; Xiao, Zhongju

    2012-10-01

    To apply the classic leakage integrate-and-fire models, based on the mechanism of the generation of physiological auditory stimulation, in the information processing coding of cochlear implants to improve the auditory result. The results of algorithm simulation in digital signal processor (DSP) were imported into Matlab for a comparative analysis. Compared with CIS coding, the algorithm of membrane potential integrate-and-fire (MPIF) allowed more natural pulse discharge in a pseudo-random manner to better fit the physiological structures. The MPIF algorithm can effectively solve the problem of the dynamic structure of the delivered auditory information sequence issued in the auditory center and allowed integration of the stimulating pulses and time coding to ensure the coherence and relevance of the stimulating pulse time.

  2. A paeudorandom pulser technique for the correction of dead-time and pile-up losses in γ-ray spectrometry

    International Nuclear Information System (INIS)

    Doerfel, G.; Kluge, W.; Kubsch, M.

    1983-01-01

    A pseudorandom pulser and its application in high precision gamma-ray spectrometry is described. A pulse train suitable for modelling dead-time and pile-up effects is obtained by an AND-connection of delayed pulse sequences delivered by a maximum length shift register generator. The heart of the problem consists in finding the appropriate delay indices and in implementing these indices by 'add and shift'. The related conditions and rules are described. These conditions ensure the occurrence of multiple pulses according to the binomial and Poisson distribution, respectively, within a predetermined range of multiplicity as well as ensuring other statistical properties. Results are given in a form comparable with the description of the results of a well-known international test. (orig.)

  3. Compressive laser ranging.

    Science.gov (United States)

    Babbitt, Wm Randall; Barber, Zeb W; Renner, Christoffer

    2011-12-15

    Compressive sampling has been previously proposed as a technique for sampling radar returns and determining sparse range profiles with a reduced number of measurements compared to conventional techniques. By employing modulation on both transmission and reception, compressive sensing in ranging is extended to the direct measurement of range profiles without intermediate measurement of the return waveform. This compressive ranging approach enables the use of pseudorandom binary transmit waveforms and return modulation, along with low-bandwidth optical detectors to yield high-resolution ranging information. A proof-of-concept experiment is presented. With currently available compact, off-the-shelf electronics and photonics, such as high data rate binary pattern generators and high-bandwidth digital optical modulators, compressive laser ranging can readily achieve subcentimeter resolution in a compact, lightweight package.

  4. On the Numerical Accuracy of Spreadsheets

    Directory of Open Access Journals (Sweden)

    Alejandro C. Frery

    2010-10-01

    Full Text Available This paper discusses the numerical precision of five spreadsheets (Calc, Excel, Gnumeric, NeoOffice and Oleo running on two hardware platforms (i386 and amd64 and on three operating systems (Windows Vista, Ubuntu Intrepid and Mac OS Leopard. The methodology consists of checking the number of correct significant digits returned by each spreadsheet when computing the sample mean, standard deviation, first-order autocorrelation, F statistic in ANOVA tests, linear and nonlinear regression and distribution functions. A discussion about the algorithms for pseudorandom number generation provided by these platforms is also conducted. We conclude that there is no safe choice among the spreadsheets here assessed: they all fail in nonlinear regression and they are not suited for Monte Carlo experiments.

  5. Exploring Various Monte Carlo Simulations for Geoscience Applications

    Science.gov (United States)

    Blais, R.

    2010-12-01

    Computer simulations are increasingly important in geoscience research and development. At the core of stochastic or Monte Carlo simulations are the random number sequences that are assumed to be distributed with specific characteristics. Computer generated random numbers, uniformly distributed on (0, 1), can be very different depending on the selection of pseudo-random number (PRN), or chaotic random number (CRN) generators. Equidistributed quasi-random numbers (QRNs) can also be used in Monte Carlo simulations. In the evaluation of some definite integrals, the resulting error variances can even be of different orders of magnitude. Furthermore, practical techniques for variance reduction such as Importance Sampling and Stratified Sampling can be implemented to significantly improve the results. A comparative analysis of these strategies has been carried out for computational applications in planar and spatial contexts. Based on these experiments, and on examples of geodetic applications of gravimetric terrain corrections and gravity inversion, conclusions and recommendations concerning their performance and general applicability are included.

  6. Investigating Factorial Invariance of Latent Variables Across Populations When Manifest Variables Are Missing Completely.

    Science.gov (United States)

    Widaman, Keith F; Grimm, Kevin J; Early, Dawnté R; Robins, Richard W; Conger, Rand D

    2013-07-01

    Difficulties arise in multiple-group evaluations of factorial invariance if particular manifest variables are missing completely in certain groups. Ad hoc analytic alternatives can be used in such situations (e.g., deleting manifest variables), but some common approaches, such as multiple imputation, are not viable. At least 3 solutions to this problem are viable: analyzing differing sets of variables across groups, using pattern mixture approaches, and a new method using random number generation. The latter solution, proposed in this article, is to generate pseudo-random normal deviates for all observations for manifest variables that are missing completely in a given sample and then to specify multiple-group models in a way that respects the random nature of these values. An empirical example is presented in detail comparing the 3 approaches. The proposed solution can enable quantitative comparisons at the latent variable level between groups using programs that require the same number of manifest variables in each group.

  7. Image Encryption Scheme Based on Balanced Two-Dimensional Cellular Automata

    Directory of Open Access Journals (Sweden)

    Xiaoyan Zhang

    2013-01-01

    Full Text Available Cellular automata (CA are simple models of computation which exhibit fascinatingly complex behavior. Due to the universality of CA model, it has been widely applied in traditional cryptography and image processing. The aim of this paper is to present a new image encryption scheme based on balanced two-dimensional cellular automata. In this scheme, a random image with the same size of the plain image to be encrypted is first generated by a pseudo-random number generator with a seed. Then, the random image is evoluted alternately with two balanced two-dimensional CA rules. At last, the cipher image is obtained by operating bitwise XOR on the final evolution image and the plain image. This proposed scheme possesses some advantages such as very large key space, high randomness, complex cryptographic structure, and pretty fast encryption/decryption speed. Simulation results obtained from some classical images at the USC-SIPI database demonstrate the strong performance of the proposed image encryption scheme.

  8. Selection of the Climate Parameters for a Building Envelopes and Indoor Climate Systems Design

    Directory of Open Access Journals (Sweden)

    Oleg Samarin

    2017-09-01

    Full Text Available The current research considers the principles of selection of the climate information needed for the building envelope and indoor climate design and adopted in Russia and some European countries. Special reference has been made to the shortcoming of methodologies that include the notion of a typical year, and the advantages of climate data sets generated via software-based designs, using pseudo-random number generators. The results of the average temperature of the coldest five-day period with various supplies were calculated using the numerical Monte-Carlo simulations, as well as the current climate data. It has been shown that there is a fundamental overlap between the statistical distribution of temperatures of both instances and the possibility of implementation a probabilistic-statistical method principle in the development of certain climate data, relative to envelopes and thermal conditions of a building. The calculated values were combined with the analytic expression of the normal law of random distribution and the correlations needed for the main parameter selection.

  9. Exploring pseudo- and chaotic random Monte Carlo simulations

    Science.gov (United States)

    Blais, J. A. Rod; Zhang, Zhan

    2011-07-01

    Computer simulations are an increasingly important area of geoscience research and development. At the core of stochastic or Monte Carlo simulations are the random number sequences that are assumed to be distributed with specific characteristics. Computer-generated random numbers, uniformly distributed on (0, 1), can be very different depending on the selection of pseudo-random number (PRN) or chaotic random number (CRN) generators. In the evaluation of some definite integrals, the resulting error variances can even be of different orders of magnitude. Furthermore, practical techniques for variance reduction such as importance sampling and stratified sampling can be applied in most Monte Carlo simulations and significantly improve the results. A comparative analysis of these strategies has been carried out for computational applications in planar and spatial contexts. Based on these experiments, and on some practical examples of geodetic direct and inverse problems, conclusions and recommendations concerning their performance and general applicability are included.

  10. Cryptanalysis of a family of 1D unimodal maps

    Science.gov (United States)

    Md Said, Mohamad Rushdan; Hina, Aliyu Danladi; Banerjee, Santo

    2017-07-01

    In this paper, we proposed a topologically conjugate map, equivalent to the well known logistic map. This constructed map is defined on the integer domain [0, 2n) with a view to be used as a random number generator (RNG) based on an integer domain as is the required in classical cryptography. The maps were found to have a one to one correspondence between points in their respective defining intervals defined on an n-bits precision. The dynamics of the proposed map similar with that of the logistic map, in terms of the Lyapunov exponents with the control parameter. This similarity between the curves indicates topological conjugacy between the maps. With a view to be applied in cryptography as a Pseudo-Random number generator (PRNG), the complexity of the constructed map as a source of randomness is determined using both the permutation entropy (PE) and the Lempel-Ziv (LZ-76) complexity measures, and the results are compared with numerical simulations.

  11. Dynamic Parameter-Control Chaotic System.

    Science.gov (United States)

    Hua, Zhongyun; Zhou, Yicong

    2016-12-01

    This paper proposes a general framework of 1-D chaotic maps called the dynamic parameter-control chaotic system (DPCCS). It has a simple but effective structure that uses the outputs of a chaotic map (control map) to dynamically control the parameter of another chaotic map (seed map). Using any existing 1-D chaotic map as the control/seed map (or both), DPCCS is able to produce a huge number of new chaotic maps. Evaluations and comparisons show that chaotic maps generated by DPCCS are very sensitive to their initial states, and have wider chaotic ranges, better unpredictability and more complex chaotic behaviors than their seed maps. Using a chaotic map of DPCCS as an example, we provide a field-programmable gate array design of this chaotic map to show the simplicity of DPCCS in hardware implementation, and introduce a new pseudo-random number generator (PRNG) to investigate the applications of DPCCS. Analysis and testing results demonstrate the excellent randomness of the proposed PRNG.

  12. Fault Diagnosis for Distribution Networks Using Enhanced Support Vector Machine Classifier with Classical Multidimensional Scaling

    Directory of Open Access Journals (Sweden)

    Ming-Yuan Cho

    2017-09-01

    Full Text Available In this paper, a new fault diagnosis techniques based on time domain reflectometry (TDR method with pseudo-random binary sequence (PRBS stimulus and support vector machine (SVM classifier has been investigated to recognize the different types of fault in the radial distribution feeders. This novel technique has considered the amplitude of reflected signals and the peaks of cross-correlation (CCR between the reflected and incident wave for generating fault current dataset for SVM. Furthermore, this multi-layer enhanced SVM classifier is combined with classical multidimensional scaling (CMDS feature extraction algorithm and kernel parameter optimization to increase training speed and improve overall classification accuracy. The proposed technique has been tested on a radial distribution feeder to identify ten different types of fault considering 12 input features generated by using Simulink software and MATLAB Toolbox. The success rate of SVM classifier is over 95% which demonstrates the effectiveness and the high accuracy of proposed method.

  13. A Generalized Stability Theorem for Discrete-Time Nonautonomous Chaos System with Applications

    Directory of Open Access Journals (Sweden)

    Mei Zhang

    2015-01-01

    Full Text Available Firstly, this study introduces a definition of generalized stability (GST in discrete-time nonautonomous chaos system (DNCS, which is an extension for chaos generalized synchronization. Secondly, a constructive theorem of DNCS has been proposed. As an example, a GST DNCS is constructed based on a novel 4-dimensional discrete chaotic map. Numerical simulations show that the dynamic behaviors of this map have chaotic attractor characteristics. As one application, we design a chaotic pseudorandom number generator (CPRNG based on the GST DNCS. We use the SP800-22 test suite to test the randomness of four 100-key streams consisting of 1,000,000 bits generated by the CPRNG, the RC4 algorithm, the ZUC algorithm, and a 6-dimensional CGS-based CPRNG, respectively. The numerical results show that the randomness performances of the two CPRNGs are promising. In addition, theoretically the key space of the CPRNG is larger than 21116. As another application, this study designs a stream avalanche encryption scheme (SAES in RGB image encryption. The results show that the GST DNCS is able to generate the avalanche effects which are similar to those generated via ideal CPRNGs.

  14. A perturbation method to the tent map based on Lyapunov exponent and its application

    Science.gov (United States)

    Cao, Lv-Chen; Luo, Yu-Ling; Qiu, Sen-Hui; Liu, Jun-Xiu

    2015-10-01

    Perturbation imposed on a chaos system is an effective way to maintain its chaotic features. A novel parameter perturbation method for the tent map based on the Lyapunov exponent is proposed in this paper. The pseudo-random sequence generated by the tent map is sent to another chaos function — the Chebyshev map for the post processing. If the output value of the Chebyshev map falls into a certain range, it will be sent back to replace the parameter of the tent map. As a result, the parameter of the tent map keeps changing dynamically. The statistical analysis and experimental results prove that the disturbed tent map has a highly random distribution and achieves good cryptographic properties of a pseudo-random sequence. As a result, it weakens the phenomenon of strong correlation caused by the finite precision and effectively compensates for the digital chaos system dynamics degradation. Project supported by the Guangxi Provincial Natural Science Foundation, China (Grant No. 2014GXNSFBA118271), the Research Project of Guangxi University, China (Grant No. ZD2014022), the Fund from Guangxi Provincial Key Laboratory of Multi-source Information Mining & Security, China (Grant No. MIMS14-04), the Fund from the Guangxi Provincial Key Laboratory of Wireless Wideband Communication & Signal Processing, China (Grant No. GXKL0614205), the Education Development Foundation and the Doctoral Research Foundation of Guangxi Normal University, the State Scholarship Fund of China Scholarship Council (Grant No. [2014]3012), and the Innovation Project of Guangxi Graduate Education, China (Grant No. YCSZ2015102).

  15. Comparing Generative and Inter-generative Subjectivity in Post-Revolutionary Academic Generations in Iran

    Directory of Open Access Journals (Sweden)

    mehran Sohrabzadeh

    2010-01-01

    Full Text Available Comparative study of different post-revolutionary generation has been broadly applied by social scientists; among them some believe there is a gulf between generations, while some others endorsing some small differences among generations, emphasis that this variety is natural. Avoiding being loyal to any of these two views, the present study attempts to compare three different post-revolutionary academic generations using theory of “generative objects” which explores generations’ view about their behaviors, Beliefs, and historical monuments. Sampling was carried among 3 generations; firstly ones who were student in 60s and now are experienced faculties in the university, secondly ones who are recently employed as faculty members, and finally who are now students in universities. Results show that in all 3 generations there are essential in-generation similarities, while comparatively there are some differentiations in inter-generative analysis.

  16. Trip generation characteristics of special generators

    Science.gov (United States)

    2010-03-01

    Special generators are introduced in the sequential four-step modeling procedure to represent certain types of facilities whose trip generation characteristics are not fully captured by the standard trip generation module. They are also used in the t...

  17. Distributed generation induction and permanent magnet generators

    CERN Document Server

    Lai, L

    2007-01-01

    Distributed power generation is a technology that could help to enable efficient, renewable energy production both in the developed and developing world. It includes all use of small electric power generators, whether located on the utility system, at the site of a utility customer, or at an isolated site not connected to the power grid. Induction generators (IGs) are the cheapest and most commonly used technology, compatible with renewable energy resources. Permanent magnet (PM) generators have traditionally been avoided due to high fabrication costs; however, compared with IGs they are more reliable and productive. Distributed Generation thoroughly examines the principles, possibilities and limitations of creating energy with both IGs and PM generators. It takes an electrical engineering approach in the analysis and testing of these generators, and includes diagrams and extensive case study examples o better demonstrate how the integration of energy sources can be accomplished. The book also provides the ...

  18. Dynamic video encryption algorithm for H.264/AVC based on a spatiotemporal chaos system.

    Science.gov (United States)

    Xu, Hui; Tong, Xiao-Jun; Zhang, Miao; Wang, Zhu; Li, Ling-Hao

    2016-06-01

    Video encryption schemes mostly employ the selective encryption method to encrypt parts of important and sensitive video information, aiming to ensure the real-time performance and encryption efficiency. The classic block cipher is not applicable to video encryption due to the high computational overhead. In this paper, we propose the encryption selection control module to encrypt video syntax elements dynamically which is controlled by the chaotic pseudorandom sequence. A novel spatiotemporal chaos system and binarization method is used to generate a key stream for encrypting the chosen syntax elements. The proposed scheme enhances the resistance against attacks through the dynamic encryption process and high-security stream cipher. Experimental results show that the proposed method exhibits high security and high efficiency with little effect on the compression ratio and time cost.

  19. Fast and powerful hashing using tabulation

    DEFF Research Database (Denmark)

    Thorup, Mikkel

    2017-01-01

    Randomized algorithms are often enjoyed for their simplicity, but the hash functions employed to yield the desired probabilistic guarantees are often too complicated to be practical. Here, we survey recent results on how simple hashing schemes based on tabulation provide unexpectedly strong......, linear probing and Cuckoo hashing. Next, we consider twisted tabulation where one input character is "twisted" in a simple way. The resulting hash function has powerful distributional properties: Chernoffstyle tail bounds and a very small bias for minwise hashing. This is also yields an extremely fast...... pseudorandom number generator that is provably good for many classic randomized algorithms and data-structures. Finally, we consider double tabulation where we compose two simple tabulation functions, applying one to the output of the other, and show that this yields very high independence in the classic...

  20. On the computer simulation of the EPR-Bohm experiment

    International Nuclear Information System (INIS)

    McGoveran, D.O.; Noyes, H.P.; Manthey, M.J.

    1988-12-01

    We argue that supraluminal correlation without supraluminal signaling is a necessary consequence of any finite and discrete model for physics. Every day, the commercial and military practice of using encrypted communication based on correlated, pseudo-random signals illustrates this possibility. All that is needed are two levels of computational complexity which preclude using a smaller system to detect departures from ''randomness'' in the larger system. Hence the experimental realizations of the EPR-Bohm experiment leave open the question of whether the world of experience is ''random'' or pseudo-random. The latter possibility could be demonstrated experimentally if a complexity parameter related to the arm length and switching time in an Aspect-type realization of the EPR-Bohm experiment is sufficiently small compared to the number of reliable total counts which can be obtained in practice. 6 refs

  1. Steam-Generator Integrity Program/Steam-Generator Group Project

    International Nuclear Information System (INIS)

    1982-10-01

    The Steam Generator Integrity Program (SGIP) is a comprehensive effort addressing issues of nondestructive test (NDT) reliability, inservice inspection (ISI) requirements, and tube plugging criteria for PWR steam generators. In addition, the program has interactive research tasks relating primary side decontamination, secondary side cleaning, and proposed repair techniques to nondestructive inspectability and primary system integrity. The program has acquired a service degraded PWR steam generator for research purposes. This past year a research facility, the Steam Generator Examination Facility (SGEF), specifically designed for nondestructive and destructive examination tasks of the SGIP was completed. The Surry generator previously transported to the Hanford Reservation was then inserted into the SGEF. Nondestructive characterization of the generator from both primary and secondary sides has been initiated. Decontamination of the channelhead cold leg side was conducted. Radioactive field maps were established in the steam generator, at the generator surface and in the SGEF

  2. Refrigeration generation using expander-generator units

    Science.gov (United States)

    Klimenko, A. V.; Agababov, V. S.; Koryagin, A. V.; Baidakova, Yu. O.

    2016-05-01

    The problems of using the expander-generator unit (EGU) to generate refrigeration, along with electricity were considered. It is shown that, on the level of the temperatures of refrigeration flows using the EGU, one can provide the refrigeration supply of the different consumers: ventilation and air conditioning plants and industrial refrigerators and freezers. The analysis of influence of process parameters on the cooling power of the EGU, which depends on the parameters of the gas expansion process in the expander and temperatures of cooled environment, was carried out. The schematic diagram of refrigeration generation plant based on EGU is presented. The features and advantages of EGU to generate refrigeration compared with thermotransformer of steam compressive and absorption types were shown, namely: there is no need to use the energy generated by burning fuel to operate the EGU; beneficial use of the heat delivered to gas from the flow being cooled in equipment operating on gas; energy production along with refrigeration generation, which makes it possible to create, using EGU, the trigeneration plants without using the energy power equipment. It is shown that the level of the temperatures of refrigeration flows, which can be obtained by using the EGU on existing technological decompression stations of the transported gas, allows providing the refrigeration supply of various consumers. The information that the refrigeration capacity of an expander-generator unit not only depends on the parameters of the process of expansion of gas flowing in the expander (flow rate, temperatures and pressures at the inlet and outlet) but it is also determined by the temperature needed for a consumer and the initial temperature of the flow of the refrigeration-carrier being cooled. The conclusion was made that the expander-generator units can be used to create trigeneration plants both at major power plants and at small energy.

  3. Power Generation for River and Tidal Generators

    Energy Technology Data Exchange (ETDEWEB)

    Muljadi, Eduard [National Renewable Energy Lab. (NREL), Golden, CO (United States); Wright, Alan [National Renewable Energy Lab. (NREL), Golden, CO (United States); Gevorgian, Vahan [National Renewable Energy Lab. (NREL), Golden, CO (United States); Donegan, James [Ocean Renewable Power Company (ORPC), Portland, ME (United States); Marnagh, Cian [Ocean Renewable Power Company (ORPC), Portland, ME (United States); McEntee, Jarlath [Ocean Renewable Power Company (ORPC), Portland, ME (United States)

    2016-06-01

    Renewable energy sources are the second largest contributor to global electricity production, after fossil fuels. The integration of renewable energy continued to grow in 2014 against a backdrop of increasing global energy consumption and a dramatic decline in oil prices during the second half of the year. As renewable generation has become less expensive during recent decades, and it becomes more accepted by the global population, the focus on renewable generation has expanded from primarily wind and solar to include new types with promising future applications, such as hydropower generation, including river and tidal generation. Today, hydropower is considered one of the most important renewable energy sources. In river and tidal generation, the input resource flow is slower but also steadier than it is in wind or solar generation, yet the level of water turbulent flow may vary from one place to another. This report focuses on hydrokinetic power conversion.

  4. Golden Ratio Versus Pi as Random Sequence Sources for Monte Carlo Integration

    Science.gov (United States)

    Sen, S. K.; Agarwal, Ravi P.; Shaykhian, Gholam Ali

    2007-01-01

    We discuss here the relative merits of these numbers as possible random sequence sources. The quality of these sequences is not judged directly based on the outcome of all known tests for the randomness of a sequence. Instead, it is determined implicitly by the accuracy of the Monte Carlo integration in a statistical sense. Since our main motive of using a random sequence is to solve real world problems, it is more desirable if we compare the quality of the sequences based on their performances for these problems in terms of quality/accuracy of the output. We also compare these sources against those generated by a popular pseudo-random generator, viz., the Matlab rand and the quasi-random generator ha/ton both in terms of error and time complexity. Our study demonstrates that consecutive blocks of digits of each of these numbers produce a good random sequence source. It is observed that randomly chosen blocks of digits do not have any remarkable advantage over consecutive blocks for the accuracy of the Monte Carlo integration. Also, it reveals that pi is a better source of a random sequence than theta when the accuracy of the integration is concerned.

  5. Estimation of perfusion properties with MR Fingerprinting Arterial Spin Labeling.

    Science.gov (United States)

    Wright, Katherine L; Jiang, Yun; Ma, Dan; Noll, Douglas C; Griswold, Mark A; Gulani, Vikas; Hernandez-Garcia, Luis

    2018-03-12

    In this study, the acquisition of ASL data and quantification of multiple hemodynamic parameters was explored using a Magnetic Resonance Fingerprinting (MRF) approach. A pseudo-continuous ASL labeling scheme was used with pseudo-randomized timings to acquire the MRF ASL data in a 2.5 min acquisition. A large dictionary of MRF ASL signals was generated by combining a wide range of physical and hemodynamic properties with the pseudo-random MRF ASL sequence and a two-compartment model. The acquired signals were matched to the dictionary to provide simultaneous quantification of cerebral blood flow, tissue time-to-peak, cerebral blood volume, arterial time-to-peak, B 1 , and T 1. A study in seven healthy volunteers resulted in the following values across the population in grey matter (mean ± standard deviation): cerebral blood flow of 69.1 ± 6.1 ml/min/100 g, arterial time-to-peak of 1.5 ± 0.1 s, tissue time-to-peak of 1.5 ± 0.1 s, T 1 of 1634 ms, cerebral blood volume of 0.0048 ± 0.0005. The CBF measurements were compared to standard pCASL CBF estimates using a one-compartment model, and a Bland-Altman analysis showed good agreement with a minor bias. Repeatability was tested in five volunteers in the same exam session, and no statistical difference was seen. In addition to this validation, the MRF ASL acquisition's sensitivity to the physical and physiological parameters of interest was studied numerically. Copyright © 2018 Elsevier Inc. All rights reserved.

  6. A Threshold Pseudorandom Function Construction and Its Applications

    DEFF Research Database (Denmark)

    Nielsen, Jesper Buus

    2002-01-01

    We give the first construction of a practical threshold pseudo- random function.The protocol for evaluating the function is efficient enough that it can be used to replace random oracles in some protocols relying on such oracles. In particular, we show how to transform the efficient...... cryptographically secure Byzantine agreement protocol by Cachin, Kursawe and Shoup for the random oracle model into a cryptographically secure protocol for the complexity theoretic model without loosing efficiency or resilience,thereby constructing an efficient and optimally resilient Byzantine agreement protocol...

  7. Alternative energy and distributed generation: thinking generations ahead

    International Nuclear Information System (INIS)

    Hunt, P.D.

    2001-01-01

    Alternative Energy will be discussed in the context of Distributed Generation, which is defined as a delivery platform for micro-power generation, close to the end-users, that can also supplement regional electricity grids. Many references in the paper pertain to Alberta. This is for two reasons: First, familiarity by the author, and more importantly, Alberta is the first region in Canada that has de-regulated it's electricity sector. De-regulation allows independent and smaller power generators to enter the market. Focussing on Alberta, with some references to other Canadian provinces and USA, electricity consumption trends will be reviewed and the pressures to decentralize electricity generation discussed. Re-structuring of the electricity sector, convergence of power generation and natural gas industries, advances in technologies, and environmental concerns are collectively contributing to the creation of a new business called 'Distributed Generation'. Efficiency benefits of combined heat and power associated with the more prominent emerging distributed generation technologies like micro-turbines and fuel cells, will be highlighted. Areas of research, development and demonstration that will enable the successful deployment of Distributed Generation will be suggested with respect to Generation Technologies, Systems Controls, Supporting Infrastructure, and Socio-Political Barriers. Estimates of investments in the various alternative energy technologies will be presented. Using current trends and emerging technologies the Paper will conclude with some predictions of future scenarios. (author)

  8. Generative Contexts: Generating value between community and educational settings

    Directory of Open Access Journals (Sweden)

    Dan Lyles

    2016-12-01

    Full Text Available As educators and researchers, the authors of this paper participated, at different points in time, in a National Science Foundation funded research program to place culturally responsive education into generative justice frameworks. We discovered that the mechanisms to create generative contexts—contexts where value can possibly be returned to the community where the people generating that value live and work—in-school, after-school, and not-school were not uniform and required individual attention and care. One can think of generative contexts as the educational preconditions for generative justice. We aim to show how generative contexts are crucial to understanding a larger theory of generative justice. To do this we provide three examples of generative contexts. First is a generative context in-school, where a technology teacher brought a community hairstylist into her classroom to help teach computer programming through cornrow braiding; a skill relevant to her African American students. Next is a generative context after-school where a student demonstrates soldering skills that she learned from family members. The third is a not-school “E-Waste to Makerspace” workshop where students created garden-technology designs for low-income communities. 

  9. Non-Darwinian evolution for the source detection of atmospheric releases

    Science.gov (United States)

    Cervone, Guido; Franzese, Pasquale

    2011-08-01

    A non-Darwinian evolutionary algorithm is presented as search engine to identify the characteristics of a source of atmospheric pollutants, given a set of concentration measurements. The algorithm drives iteratively a forward dispersion model from tentative sources toward the real source. The solutions of non-Darwinian evolution processes are not generated through pseudo-random operators, unlike traditional evolutionary algorithms, but through a reasoning process based on machine learning rule generation and instantiation. The new algorithm is tested with both a synthetic case and with the Prairie Grass field experiment. To further test the capabilities of the algorithm to work in real-world scenarios, the source identification of all Prairie Grass releases was performed with a decreasing number of sensor measurements, and a relationship is found between the precision of the solution, the number of sensors available, and the levels of concentration measured by the sensors. The proposed methodology can be used for a variety of optimization problems, and is particularly suited for problems where the operations needed for evaluating new candidate solutions are computationally expensive.

  10. Butterfly Encryption Scheme for Resource-Constrained Wireless Networks

    Directory of Open Access Journals (Sweden)

    Raghav V. Sampangi

    2015-09-01

    Full Text Available Resource-constrained wireless networks are emerging networks such as Radio Frequency Identification (RFID and Wireless Body Area Networks (WBAN that might have restrictions on the available resources and the computations that can be performed. These emerging technologies are increasing in popularity, particularly in defence, anti-counterfeiting, logistics and medical applications, and in consumer applications with growing popularity of the Internet of Things. With communication over wireless channels, it is essential to focus attention on securing data. In this paper, we present an encryption scheme called Butterfly encryption scheme. We first discuss a seed update mechanism for pseudorandom number generators (PRNG, and employ this technique to generate keys and authentication parameters for resource-constrained wireless networks. Our scheme is lightweight, as in it requires less resource when implemented and offers high security through increased unpredictability, owing to continuously changing parameters. Our work focuses on accomplishing high security through simplicity and reuse. We evaluate our encryption scheme using simulation, key similarity assessment, key sequence randomness assessment, protocol analysis and security analysis.

  11. Butterfly Encryption Scheme for Resource-Constrained Wireless Networks.

    Science.gov (United States)

    Sampangi, Raghav V; Sampalli, Srinivas

    2015-09-15

    Resource-constrained wireless networks are emerging networks such as Radio Frequency Identification (RFID) and Wireless Body Area Networks (WBAN) that might have restrictions on the available resources and the computations that can be performed. These emerging technologies are increasing in popularity, particularly in defence, anti-counterfeiting, logistics and medical applications, and in consumer applications with growing popularity of the Internet of Things. With communication over wireless channels, it is essential to focus attention on securing data. In this paper, we present an encryption scheme called Butterfly encryption scheme. We first discuss a seed update mechanism for pseudorandom number generators (PRNG), and employ this technique to generate keys and authentication parameters for resource-constrained wireless networks. Our scheme is lightweight, as in it requires less resource when implemented and offers high security through increased unpredictability, owing to continuously changing parameters. Our work focuses on accomplishing high security through simplicity and reuse. We evaluate our encryption scheme using simulation, key similarity assessment, key sequence randomness assessment, protocol analysis and security analysis.

  12. Elastic properties of dense solid phases of hard cyclic pentamers and heptamers in two dimensions.

    Science.gov (United States)

    Wojciechowski, K W; Tretiakov, K V; Kowalik, M

    2003-03-01

    Systems of model planar, nonconvex, hard-body "molecules" of fivefold and sevenfold symmetry axes are studied by constant pressure Monte Carlo simulations with variable shape of the periodic box. The molecules, referred to as pentamers (heptamers), are composed of five (seven) identical hard disks "atoms" with centers forming regular pentagons (heptagons) of sides equal to the disk diameter. The elastic compliances of defect-free solid phases are computed by analysis of strain fluctuations and the reference (equilibrium) state is determined within the same run in which the elastic properties are computed. Results obtained by using pseudorandom number generators based on the idea proposed by Holian and co-workers [Holian et al., Phys. Rev. E 50, 1607 (1994)] are in good agreement with the results generated by DRAND48. It is shown that singular behavior of the elastic constants near close packing is in agreement with the free volume approximation; the coefficients of the leading singularities are estimated. The simulations prove that the highest density structures of heptamers (in which the molecules cannot rotate) are auxetic, i.e., show negative Poisson ratios.

  13. Teaching Millennials and Generation Z: Bridging the Generational Divide.

    Science.gov (United States)

    Shatto, Bobbi; Erwin, Kelly

    2017-02-01

    Most undergraduate students today are part of the millennial generation. However, the next wave of students-Generation Z-are just beginning to enter universities. Although these groups share many similarities, they each have unique characteristics that create challenges in the classroom. Incorporating technology, engaging students with adaptive learning activities, and understanding basic generational differences are ways to limit the effects of generational conflict while keeping both millennials and Generation Z students engaged in learning. It is important to understand basic differences and distinctions across generations for developing pedagogy that reaches these unique student populations.

  14. Cheaper power generation from surplus steam generating capacities

    International Nuclear Information System (INIS)

    Gupta, K.

    1996-01-01

    Prior to independence most industries had their own captive power generation. Steam was generated in own medium/low pressure boilers and passed through extraction condensing turbines for power generation. Extraction steam was used for process. With cheaper power made available in Nehru era by undertaking large hydro power schemes, captive power generation in industries was almost abandoned except in sugar and large paper factories, which were high consumers of steam. (author)

  15. A novel random-pulser concept for empirical reliability studies of complex systems

    International Nuclear Information System (INIS)

    Priesmeyer, H.G.

    1985-01-01

    The concept of a computer-controlled pseudo-random pulser is described, which is able to produce pulse sequences obeying statistical distributions, used in probability assessments of safety technology. It shall be used in empirical investigations of the reliability of complex systems. (orig.) [de

  16. The different generation of nuclear reactors from Generation-1 to Generation-4

    International Nuclear Information System (INIS)

    Cognet, G.

    2010-01-01

    In this work author deals with the history of the development of nuclear reactors from Generation-1 to Generation-4. The fuel cycle and radioactive waste management as well as major accidents are presented, too.

  17. A large capacity turbine generator for nuclear power generation

    International Nuclear Information System (INIS)

    Maeda, Susumu; Miki, Takahiro; Suzuki, Kazuichi

    2000-01-01

    In future large capacity nuclear power plant, capacity of a generator to be applied will be 1800 MVA of the largest class in the world. In response to this, the Mitsubishi Electric Co., Ltd. began to carry out element technology verification of a four-pole large capacity turbine generator mainly using upgrading technique of large capacity, since 1994 fiscal year. And, aiming at reliability verification of the 1800 MVA class generator, a model generator with same cross-section as that of an actual one was manufactured, to carry out some verifications on its electrified tests, and so on. Every performance evaluation result of tests on the model generator were good, and high reliability to design and manufacturing technique of the 1800 MVA class generator could be verified. In future, on the base of these technologies, further upgrading of reliability on the large capacity turbine generator for nuclear power generation is intended to be carried out. (G.K.)

  18. Prefrontal-limbic Functional Connectivity during Acquisition and Extinction of Conditioned Fear.

    Science.gov (United States)

    Barrett, Douglas W; Gonzalez-Lima, F

    2018-04-15

    This study is a new analysis to obtain novel metabolic data on the functional connectivity of prefrontal-limbic regions in Pavlovian fear acquisition and extinction of tone-footshock conditioning. Mice were analyzed with the fluorodeoxyglucose (FDG) autoradiographic method to metabolically map regional brain activity. New FDG data were sampled from the nuclei of the habenula and other regions implicated in aversive conditioning, such as infralimbic cortex, amygdala and periaqueductal gray regions. The activity patterns among these regions were inter-correlated during acquisition, extinction or pseudorandom training to develop a functional connectivity model. Two subdivisions of the habenular complex showed increased activity after acquisition relative to extinction, with the pseudorandom group intermediate between the other two groups. Significant acquisition activation effects were also found in centromedial amygdala, dorsomedial and ventrolateral periaqueductal gray. FDG uptake increases during extinction were found only in dorsal and ventral infralimbic cortex. The overall pattern of activity correlations between these regions revealed extensive but differential functional connectivity during acquisition and extinction training, with less functional connectivity found after pseudorandom training. Interestingly, habenula nuclei showed a distinct pattern of inter-correlations with amygdala nuclei during extinction. The functional connectivity model revealed changing interactions among infralimbic cortex, amygdala, habenula and periaqueductal gray regions through the stages of Pavlovian fear acquisition and extinction. This study provided new data on the contributions of the habenula to fear conditioning, and revealed previously unreported infralimbic-amygdala-habenula-periaqueductal gray interactions implicated in acquisition and extinction of conditioned fear. Copyright © 2018 IBRO. Published by Elsevier Ltd. All rights reserved.

  19. Accelerating execution of the integrated TIGER series Monte Carlo radiation transport codes

    Science.gov (United States)

    Smith, L. M.; Hochstedler, R. D.

    1997-02-01

    Execution of the integrated TIGER series (ITS) of coupled electron/photon Monte Carlo radiation transport codes has been accelerated by modifying the FORTRAN source code for more efficient computation. Each member code of ITS was benchmarked and profiled with a specific test case that directed the acceleration effort toward the most computationally intensive subroutines. Techniques for accelerating these subroutines included replacing linear search algorithms with binary versions, replacing the pseudo-random number generator, reducing program memory allocation, and proofing the input files for geometrical redundancies. All techniques produced identical or statistically similar results to the original code. Final benchmark timing of the accelerated code resulted in speed-up factors of 2.00 for TIGER (the one-dimensional slab geometry code), 1.74 for CYLTRAN (the two-dimensional cylindrical geometry code), and 1.90 for ACCEPT (the arbitrary three-dimensional geometry code).

  20. Accelerating execution of the integrated TIGER series Monte Carlo radiation transport codes

    International Nuclear Information System (INIS)

    Smith, L.M.; Hochstedler, R.D.

    1997-01-01

    Execution of the integrated TIGER series (ITS) of coupled electron/photon Monte Carlo radiation transport codes has been accelerated by modifying the FORTRAN source code for more efficient computation. Each member code of ITS was benchmarked and profiled with a specific test case that directed the acceleration effort toward the most computationally intensive subroutines. Techniques for accelerating these subroutines included replacing linear search algorithms with binary versions, replacing the pseudo-random number generator, reducing program memory allocation, and proofing the input files for geometrical redundancies. All techniques produced identical or statistically similar results to the original code. Final benchmark timing of the accelerated code resulted in speed-up factors of 2.00 for TIGER (the one-dimensional slab geometry code), 1.74 for CYLTRAN (the two-dimensional cylindrical geometry code), and 1.90 for ACCEPT (the arbitrary three-dimensional geometry code)

  1. High performance integer arithmetic circuit design on FPGA architecture, implementation and design automation

    CERN Document Server

    Palchaudhuri, Ayan

    2016-01-01

    This book describes the optimized implementations of several arithmetic datapath, controlpath and pseudorandom sequence generator circuits for realization of high performance arithmetic circuits targeted towards a specific family of the high-end Field Programmable Gate Arrays (FPGAs). It explores regular, modular, cascadable, and bit-sliced architectures of these circuits, by directly instantiating the target FPGA-specific primitives in the HDL. Every proposed architecture is justified with detailed mathematical analyses. Simultaneously, constrained placement of the circuit building blocks is performed, by placing the logically related hardware primitives in close proximity to one another by supplying relevant placement constraints in the Xilinx proprietary “User Constraints File”. The book covers the implementation of a GUI-based CAD tool named FlexiCore integrated with the Xilinx Integrated Software Environment (ISE) for design automation of platform-specific high-performance arithmetic circuits from us...

  2. Generational diversity.

    Science.gov (United States)

    Kramer, Linda W

    2010-01-01

    Generational diversity has proven challenges for nurse leaders, and generational values may influence ideas about work and career planning. This article discusses generational gaps, influencing factors and support, and the various generational groups present in today's workplace as well as the consequences of need addressing these issues. The article ends with a discussion of possible solutions.

  3. A viable technology to generate third-generation biofuel

    DEFF Research Database (Denmark)

    Singh, Anoop; Olsen, Stig Irving; Nigam, Poonam Singh

    2011-01-01

    First generation biofuels are commercialized at large as the production technologies are well developed. However, to grow the raw materials, there is a great need to compromise with food security, which made first generation biofuels not so much promising. The second generation of biofuels does...

  4. Motor/generator

    Science.gov (United States)

    Hickam, Christopher Dale [Glasford, IL

    2008-05-13

    A motor/generator is provided for connecting between a transmission input shaft and an output shaft of a prime mover. The motor/generator may include a motor/generator housing, a stator mounted to the motor/generator housing, a rotor mounted at least partially within the motor/generator housing and rotatable about a rotor rotation axis, and a transmission-shaft coupler drivingly coupled to the rotor. The transmission-shaft coupler may include a clamp, which may include a base attached to the rotor and a plurality of adjustable jaws.

  5. Wind Generators

    Science.gov (United States)

    1989-01-01

    When Enerpro, Inc. president, Frank J. Bourbeau, attempted to file a patent on a system for synchronizing a wind generator to the electric utility grid, he discovered Marshall Space Flight Center's Frank Nola's power factor controller. Bourbeau advanced the technology and received a NASA license and a patent for his Auto Synchronous Controller (ASC). The ASC reduces generator "inrush current," which occurs when large generators are abruptly brought on line. It controls voltage so the generator is smoothly connected to the utility grid when it reaches its synchronous speed, protecting the components from inrush current damage. Generator efficiency is also increased in light winds by applying lower than rated voltage. Wind energy is utilized to drive turbines to generate electricity for utility companies.

  6. [Intel random number generator-based true random number generator].

    Science.gov (United States)

    Huang, Feng; Shen, Hong

    2004-09-01

    To establish a true random number generator on the basis of certain Intel chips. The random numbers were acquired by programming using Microsoft Visual C++ 6.0 via register reading from the random number generator (RNG) unit of an Intel 815 chipset-based computer with Intel Security Driver (ISD). We tested the generator with 500 random numbers in NIST FIPS 140-1 and X(2) R-Squared test, and the result showed that the random number it generated satisfied the demand of independence and uniform distribution. We also compared the random numbers generated by Intel RNG-based true random number generator and those from the random number table statistically, by using the same amount of 7500 random numbers in the same value domain, which showed that the SD, SE and CV of Intel RNG-based random number generator were less than those of the random number table. The result of u test of two CVs revealed no significant difference between the two methods. Intel RNG-based random number generator can produce high-quality random numbers with good independence and uniform distribution, and solves some problems with random number table in acquisition of the random numbers.

  7. Modeling and Simulation of Generator Side Converter of Doubly Fed Induction Generator-Based Wind Power Generation System

    DEFF Research Database (Denmark)

    Guo, Yougui; Zeng, Ping; Blaabjerg, Frede

    2010-01-01

    A real wind power generation system is given in this paper. SVM control strategy and vector control is applied for generator side converter and doubly fed induction generator respectively. First the mathematical models of the wind turbine rotor, drive train, generator side converter are described...

  8. Cavity quantum electrodynamics with three-dimensional photonic bandgap crystals

    NARCIS (Netherlands)

    Vos, Willem L.; Woldering, L.A.; Ghulinyan, M.; Pavesi, L.

    2015-01-01

    This paper is Chapter 8 of the book "Light Localisation and Lasing: Random and Pseudorandom Photonic Structures", edited by Mher Ghulinyan and Lorenzo Pavesi (Cambridge University Press, Cambridge, 2015). It provides an overview of much recent work on 3D photonic crystals with a complete photonic

  9. XMSS : a practical forward secure signature scheme based on minimal security assumptions

    NARCIS (Netherlands)

    Buchmann, Johannes; Dahmen, Erik; Hülsing, Andreas; Yang, B.-Y.

    2011-01-01

    We present the hash-based signature scheme XMSS. It is the first provably (forward) secure and practical signature scheme with minimal security requirements: a pseudorandom and a second preimage resistant (hash) function family. Its signature size is reduced to less than 25% compared to the best

  10. Second harmonic generation and sum frequency generation

    International Nuclear Information System (INIS)

    Pellin, M.J.; Biwer, B.M.; Schauer, M.W.; Frye, J.M.; Gruen, D.M.

    1990-01-01

    Second harmonic generation and sum frequency generation are increasingly being used as in situ surface probes. These techniques are coherent and inherently surface sensitive by the nature of the mediums response to intense laser light. Here we will review these two techniques using aqueous corrosion as an example problem. Aqueous corrosion of technologically important materials such as Fe, Ni and Cr proceeds from a reduced metal surface with layer by layer growth of oxide films mitigated by compositional changes in the chemical makeup of the growing film. Passivation of the metal surface is achieved after growth of only a few tens of atomic layers of metal oxide. Surface Second Harmonic Generation and a related nonlinear laser technique, Sum Frequency Generation have demonstrated an ability to probe the surface composition of growing films even in the presence of aqueous solutions. 96 refs., 4 figs

  11. Next generation of weather generators on web service framework

    Science.gov (United States)

    Chinnachodteeranun, R.; Hung, N. D.; Honda, K.; Ines, A. V. M.

    2016-12-01

    Weather generator is a statistical model that synthesizes possible realization of long-term historical weather in future. It generates several tens to hundreds of realizations stochastically based on statistical analysis. Realization is essential information as a crop modeling's input for simulating crop growth and yield. Moreover, they can be contributed to analyzing uncertainty of weather to crop development stage and to decision support system on e.g. water management and fertilizer management. Performing crop modeling requires multidisciplinary skills which limit the usage of weather generator only in a research group who developed it as well as a barrier for newcomers. To improve the procedures of performing weather generators as well as the methodology to acquire the realization in a standard way, we implemented a framework for providing weather generators as web services, which support service interoperability. Legacy weather generator programs were wrapped in the web service framework. The service interfaces were implemented based on an international standard that was Sensor Observation Service (SOS) defined by Open Geospatial Consortium (OGC). Clients can request realizations generated by the model through SOS Web service. Hierarchical data preparation processes required for weather generator are also implemented as web services and seamlessly wired. Analysts and applications can invoke services over a network easily. The services facilitate the development of agricultural applications and also reduce the workload of analysts on iterative data preparation and handle legacy weather generator program. This architectural design and implementation can be a prototype for constructing further services on top of interoperable sensor network system. This framework opens an opportunity for other sectors such as application developers and scientists in other fields to utilize weather generators.

  12. Lexicon generation methods, lexicon generation devices, and lexicon generation articles of manufacture

    Science.gov (United States)

    Carter, Richard J [Richland, WA; McCall, Jonathon D [West Richland, WA; Whitney, Paul D [Richland, WA; Gregory, Michelle L [Richland, WA; Turner, Alan E [Kennewick, WA; Hetzler, Elizabeth G [Kennewick, WA; White, Amanda M [Kennewick, WA; Posse, Christian [Seattle, WA; Nakamura, Grant C [Kennewick, WA

    2010-10-26

    Lexicon generation methods, computer implemented lexicon editing methods, lexicon generation devices, lexicon editors, and articles of manufacture are described according to some aspects. In one aspect, a lexicon generation method includes providing a seed vector indicative of occurrences of a plurality of seed terms within a plurality of text items, providing a plurality of content vectors indicative of occurrences of respective ones of a plurality of content terms within the text items, comparing individual ones of the content vectors with respect to the seed vector, and responsive to the comparing, selecting at least one of the content terms as a term of a lexicon usable in sentiment analysis of text.

  13. Simulation of processes in a SSNTD exposed by monoenergetic neutrons

    Science.gov (United States)

    Meyer, P.; Fromm, M.; Groetz, J. E.; Torrealba, F.; Chambaudet, A.

    1998-03-01

    The nuclear track technique is based on the registering of latent track ions in a solid state dielectric material (Solid State Nuclear Track Detector) which will be chemically etched in order to be observed and analysed using microscopic analysis tools. The purpose of this study is to observe how a polymeric detector irradiated by a neutron fluence can explain the intensity of ionizing radiations to which structures, electronic components or living organism are exposed. To do this, it is necessary to take into account on the one hand the production of ionizing particles in the detector, and on the other hand the efficacy of their detection. The model we propose must be able to link the number of etched tracks and their parameters to the neutron fluence. The use of both a Monte Carlo code which determines the number of recoil nuclei and a computed model of etched track parameters calculations is needed. The Monte Carlo code performs a simulation of neutron-nucleus elastic collision in the detector. We compute the number of recoil nuclei produced between the surface and a depth of 20 μm in the detector. The computer code assigns six pseudo-random numbers ( xE, zE, a, b, c, α) to each neutron having an energy EN and an angle of incidence and give the results of calculations. We used statistical tests (the moments of the origin of order n and of the average of order n, the χ2 test, the gap test, the Pearson test, the run-up run-down test and the serial test) to check the quality of our pseudo-random number generator. Finally, we will compare the calculated results of the response of the SSNTD (tracks cm -2) with the experimental ones to validate the simulation.

  14. Chaos and complexity by design

    Energy Technology Data Exchange (ETDEWEB)

    Roberts, Daniel A. [Center for Theoretical Physics and Department of Physics,Massachusetts Institute of Technology, Cambridge, Massachusetts 02139 (United States); School of Natural Sciences, Institute for Advanced Study,Princeton, NJ 08540 (United States); Yoshida, Beni [Perimeter Institute for Theoretical Physics,Waterloo, Ontario N2L 2Y5 (Canada)

    2017-04-20

    We study the relationship between quantum chaos and pseudorandomness by developing probes of unitary design. A natural probe of randomness is the “frame potential,” which is minimized by unitary k-designs and measures the 2-norm distance between the Haar random unitary ensemble and another ensemble. A natural probe of quantum chaos is out-of-time-order (OTO) four-point correlation functions. We show that the norm squared of a generalization of out-of-time-order 2k-point correlators is proportional to the kth frame potential, providing a quantitative connection between chaos and pseudorandomness. Additionally, we prove that these 2k-point correlators for Pauli operators completely determine the k-fold channel of an ensemble of unitary operators. Finally, we use a counting argument to obtain a lower bound on the quantum circuit complexity in terms of the frame potential. This provides a direct link between chaos, complexity, and randomness.

  15. Chaos and complexity by design

    International Nuclear Information System (INIS)

    Roberts, Daniel A.; Yoshida, Beni

    2017-01-01

    We study the relationship between quantum chaos and pseudorandomness by developing probes of unitary design. A natural probe of randomness is the “frame potential,” which is minimized by unitary k-designs and measures the 2-norm distance between the Haar random unitary ensemble and another ensemble. A natural probe of quantum chaos is out-of-time-order (OTO) four-point correlation functions. We show that the norm squared of a generalization of out-of-time-order 2k-point correlators is proportional to the kth frame potential, providing a quantitative connection between chaos and pseudorandomness. Additionally, we prove that these 2k-point correlators for Pauli operators completely determine the k-fold channel of an ensemble of unitary operators. Finally, we use a counting argument to obtain a lower bound on the quantum circuit complexity in terms of the frame potential. This provides a direct link between chaos, complexity, and randomness.

  16. Instant Generation

    Science.gov (United States)

    Loveland, Elaina

    2017-01-01

    Generation Z students (born between 1995-2010) have replaced millennials on college campuses. Generation Z students are entrepreneurial, desire practical skills with their education, and are concerned about the cost of college. This article presents what need to be known about this new generation of students.

  17. Radionuclide generators

    International Nuclear Information System (INIS)

    Lambrecht, R.M.; Wollongong Univ.; Tomiyoshi, K.; Sekine, T.

    1997-01-01

    The present status and future directions of research and development on radionuclide generator technology are reported. The recent interest to develop double-neutron capture reactions for production of in vivo generators; neutron rich nuclides for radio-immunotherapeutic pharmaceuticals: and advances with ultra-short lived generators is highlighted. Emphasis is focused on: production of the parent radionuclide; the selection and the evaluation of support materials and eluents with respect to the resultant radiochemical yield of the daughter, and the breakthrough of the radionuclide parent: and, the uses of radionuclide generators in radiopharmaceutical chemistry, biomedical and industrial applications. The 62 Zn → 62 Cu, 66 Ni → 66 Cu, 103m Rh → 103 Rh, 188 W → 188 Re and the 225 Ac → 221 Fr → 213 Bi generators are predicted to be emphasized for future development. Coverage of the 99 Mo → 99m Tc generator was excluded, as it the subject of another review. The literature search ended June, 1996. (orig.)

  18. Cylindrical neutron generator

    Science.gov (United States)

    Leung, Ka-Ngo [Hercules, CA

    2008-04-22

    A cylindrical neutron generator is formed with a coaxial RF-driven plasma ion source and target. A deuterium (or deuterium and tritium) plasma is produced by RF excitation in a cylindrical plasma ion generator using an RF antenna. A cylindrical neutron generating target is coaxial with the ion generator, separated by plasma and extraction electrodes which contain many slots. The plasma generator emanates ions radially over 360.degree. and the cylindrical target is thus irradiated by ions over its entire circumference. The plasma generator and target may be as long as desired. The plasma generator may be in the center and the neutron target on the outside, or the plasma generator may be on the outside and the target on the inside. In a nested configuration, several concentric targets and plasma generating regions are nested to increase the neutron flux.

  19. Leading Generation Y

    National Research Council Canada - National Science Library

    Newman, Jill M

    2008-01-01

    .... Whether referred to as the Millennial Generation, Generation Y or the Next Generation, the Army needs to consider the gap between Boomers, Generation X and the Soldiers that fill our junior ranks...

  20. Random pulse generator

    International Nuclear Information System (INIS)

    Guo Ya'nan; Jin Dapeng; Zhao Dixin; Liu Zhen'an; Qiao Qiao; Chinese Academy of Sciences, Beijing

    2007-01-01

    Due to the randomness of radioactive decay and nuclear reaction, the signals from detectors are random in time. But normal pulse generator generates periodical pulses. To measure the performances of nuclear electronic devices under random inputs, a random generator is necessary. Types of random pulse generator are reviewed, 2 digital random pulse generators are introduced. (authors)

  1. Generation Z: Educating and Engaging the Next Generation of Students

    Science.gov (United States)

    Seemiller, Corey; Grace, Meghan

    2017-01-01

    In 1995, the Internet was born. So, too, was Generation Z. The oldest of this post-Millennial generation arrived to college in 2013, and more than four years later, Generation Z students fill the nation's classrooms, campus programs, and residence halls. In order to recruit, educate, and graduate this new generational cohort effectively, educators…

  2. Large signal simulation of photonic crystal Fano laser

    DEFF Research Database (Denmark)

    Zali, Aref Rasoulzadeh; Yu, Yi; Moravvej-Farshi, Mohammad Kazem

    2017-01-01

    be modulated at frequencies exceeding 1 THz which is much higher than its corresponding relaxation oscillation frequency. Large signal simulation of the Fano laser is also investigated based on pseudorandom bit sequence at 0.5 Tbit/s. It shows eye patterns are open at such high modulation frequency, verifying...

  3. Application of statistical method for FBR plant transient computation

    International Nuclear Information System (INIS)

    Kikuchi, Norihiro; Mochizuki, Hiroyasu

    2014-01-01

    Highlights: • A statistical method with a large trial number up to 10,000 is applied to the plant system analysis. • A turbine trip test conducted at the “Monju” reactor is selected as a plant transient. • A reduction method of trial numbers is discussed. • The result with reduced trial number can express the base regions of the computed distribution. -- Abstract: It is obvious that design tolerances, errors included in operation, and statistical errors in empirical correlations effect on the transient behavior. The purpose of the present study is to apply above mentioned statistical errors to a plant system computation in order to evaluate the statistical distribution contained in the transient evolution. A selected computation case is the turbine trip test conducted at 40% electric power of the prototype fast reactor “Monju”. All of the heat transport systems of “Monju” are modeled with the NETFLOW++ system code which has been validated using the plant transient tests of the experimental fast reactor Joyo, and “Monju”. The effects of parameters on upper plenum temperature are confirmed by sensitivity analyses, and dominant parameters are chosen. The statistical errors are applied to each computation deck by using a pseudorandom number and the Monte-Carlo method. The dSFMT (Double precision SIMD-oriented Fast Mersenne Twister) that is developed version of Mersenne Twister (MT), is adopted as the pseudorandom number generator. In the present study, uniform random numbers are generated by dSFMT, and these random numbers are transformed to the normal distribution by the Box–Muller method. Ten thousands of different computations are performed at once. In every computation case, the steady calculation is performed for 12,000 s, and transient calculation is performed for 4000 s. In the purpose of the present statistical computation, it is important that the base regions of distribution functions should be calculated precisely. A large number of

  4. Chaos optimization algorithms based on chaotic maps with different probability distribution and search speed for global optimization

    Science.gov (United States)

    Yang, Dixiong; Liu, Zhenjun; Zhou, Jilei

    2014-04-01

    Chaos optimization algorithms (COAs) usually utilize the chaotic map like Logistic map to generate the pseudo-random numbers mapped as the design variables for global optimization. Many existing researches indicated that COA can more easily escape from the local minima than classical stochastic optimization algorithms. This paper reveals the inherent mechanism of high efficiency and superior performance of COA, from a new perspective of both the probability distribution property and search speed of chaotic sequences generated by different chaotic maps. The statistical property and search speed of chaotic sequences are represented by the probability density function (PDF) and the Lyapunov exponent, respectively. Meanwhile, the computational performances of hybrid chaos-BFGS algorithms based on eight one-dimensional chaotic maps with different PDF and Lyapunov exponents are compared, in which BFGS is a quasi-Newton method for local optimization. Moreover, several multimodal benchmark examples illustrate that, the probability distribution property and search speed of chaotic sequences from different chaotic maps significantly affect the global searching capability and optimization efficiency of COA. To achieve the high efficiency of COA, it is recommended to adopt the appropriate chaotic map generating the desired chaotic sequences with uniform or nearly uniform probability distribution and large Lyapunov exponent.

  5. Optimising generators

    Energy Technology Data Exchange (ETDEWEB)

    Guerra, E.J.; Garcia, A.O.; Graffigna, F.M.; Verdu, C.A. (IMPSA (Argentina). Generators Div.)

    1994-11-01

    A new computer tool, the ARGEN program, has been developed for dimensioning large hydroelectric generators. This results in better designs, and reduces calculation time for engineers. ARGEN performs dimensional tailoring of salient pole synchronous machines in generators, synchronous condensers, and generator-motors. The operation and uses of ARGEN are explained and its advantages are listed in this article. (UK)

  6. DC Motor control using motor-generator set with controlled generator field

    Science.gov (United States)

    Belsterling, Charles A.; Stone, John

    1982-01-01

    A d.c. generator is connected in series opposed to the polarity of a d.c. power source supplying a d.c. drive motor. The generator is part of a motor-generator set, the motor of which is supplied from the power source connected to the motor. A generator field control means varies the field produced by at least one of the generator windings in order to change the effective voltage output. When the generator voltage is exactly equal to the d.c. voltage supply, no voltage is applied across the drive motor. As the field of the generator is reduced, the drive motor is supplied greater voltage until the full voltage of the d.c. power source is supplied when the generator has zero field applied. Additional voltage may be applied across the drive motor by reversing and increasing the reversed field on the generator. The drive motor may be reversed in direction from standstill by increasing the generator field so that a reverse voltage is applied across the d.c. motor.

  7. Small private key MQPKS on an embedded microprocessor.

    Science.gov (United States)

    Seo, Hwajeong; Kim, Jihyun; Choi, Jongseok; Park, Taehwan; Liu, Zhe; Kim, Howon

    2014-03-19

    Multivariate quadratic (MQ) cryptography requires the use of long public and private keys to ensure a sufficient security level, but this is not favorable to embedded systems, which have limited system resources. Recently, various approaches to MQ cryptography using reduced public keys have been studied. As a result of this, at CHES2011 (Cryptographic Hardware and Embedded Systems, 2011), a small public key MQ scheme, was proposed, and its feasible implementation on an embedded microprocessor was reported at CHES2012. However, the implementation of a small private key MQ scheme was not reported. For efficient implementation, random number generators can contribute to reduce the key size, but the cost of using a random number generator is much more complex than computing MQ on modern microprocessors. Therefore, no feasible results have been reported on embedded microprocessors. In this paper, we propose a feasible implementation on embedded microprocessors for a small private key MQ scheme using a pseudo-random number generator and hash function based on a block-cipher exploiting a hardware Advanced Encryption Standard (AES) accelerator. To speed up the performance, we apply various implementation methods, including parallel computation, on-the-fly computation, optimized logarithm representation, vinegar monomials and assembly programming. The proposed method reduces the private key size by about 99.9% and boosts signature generation and verification by 5.78% and 12.19% than previous results in CHES2012.

  8. Small Private Key PKS on an Embedded Microprocessor

    Science.gov (United States)

    Seo, Hwajeong; Kim, Jihyun; Choi, Jongseok; Park, Taehwan; Liu, Zhe; Kim, Howon

    2014-01-01

    Multivariate quadratic ( ) cryptography requires the use of long public and private keys to ensure a sufficient security level, but this is not favorable to embedded systems, which have limited system resources. Recently, various approaches to cryptography using reduced public keys have been studied. As a result of this, at CHES2011 (Cryptographic Hardware and Embedded Systems, 2011), a small public key scheme, was proposed, and its feasible implementation on an embedded microprocessor was reported at CHES2012. However, the implementation of a small private key scheme was not reported. For efficient implementation, random number generators can contribute to reduce the key size, but the cost of using a random number generator is much more complex than computing on modern microprocessors. Therefore, no feasible results have been reported on embedded microprocessors. In this paper, we propose a feasible implementation on embedded microprocessors for a small private key scheme using a pseudo-random number generator and hash function based on a block-cipher exploiting a hardware Advanced Encryption Standard (AES) accelerator. To speed up the performance, we apply various implementation methods, including parallel computation, on-the-fly computation, optimized logarithm representation, vinegar monomials and assembly programming. The proposed method reduces the private key size by about 99.9% and boosts signature generation and verification by 5.78% and 12.19% than previous results in CHES2012. PMID:24651722

  9. Generational Differences in Work Attitudes : A comparative analysis of Generation Y and preceding generations from companies in Sweden

    OpenAIRE

    Sajjadi, Amir; Åkesson Castillo, Lars Christian Felipe; Sun, Bicen

    2012-01-01

    Introduction: A population that can live and work longer has resulted in a wider range of generations being active in the workplace simultaneously and the diverse multi-generational work environment is a new challenge for human resource management. The most recent generation that is entering the job market is Generation Y, which is also referred to as Millennials. Currently, organizations and Human Resource departments are facing the issue of Generation Y entering the workforce and the issue ...

  10. Digital generation, net generation, millennials, Y generation: reflecting about the relation between the youths and digital technologies

    OpenAIRE

    Martins, Cristina; Pontifícia Universidade Católica do Rio Grande do Sul (PUCRS) Rede La Salle

    2015-01-01

    This study aimed is critically reflect on the relationship of the youths with the TD, by discussing the generational approach. This approach in different researches linked the youths, through terms like Digital Generation, Net Generation, Millennials and Y Generation, creating stereotypes and excluding social, cultural, economic and political perspectives. The results of this qualitative research, based on reflections through literature, sees reality of Brazilian youths that do not have acces...

  11. Isotope generator

    International Nuclear Information System (INIS)

    1979-01-01

    The patent describes an isotope generator incorporating the possibility of stopping elution before the elution vessel is completely full. Sterile ventilation of the whole system can then occur, including of both generator reservoir and elution vessel. A sterile, and therefore pharmaceutically acceptable, elution fluid is thus obtained and the interior of the generator is not polluted with non-sterile air. (T.P.)

  12. Hardware Realization of Chaos-based Symmetric Video Encryption

    KAUST Repository

    Ibrahim, Mohamad A.

    2013-05-01

    This thesis reports original work on hardware realization of symmetric video encryption using chaos-based continuous systems as pseudo-random number generators. The thesis also presents some of the serious degradations caused by digitally implementing chaotic systems. Subsequently, some techniques to eliminate such defects, including the ultimately adopted scheme are listed and explained in detail. Moreover, the thesis describes original work on the design of an encryption system to encrypt MPEG-2 video streams. Information about the MPEG-2 standard that fits this design context is presented. Then, the security of the proposed system is exhaustively analyzed and the performance is compared with other reported systems, showing superiority in performance and security. The thesis focuses more on the hardware and the circuit aspect of the system’s design. The system is realized on Xilinx Vetrix-4 FPGA with hardware parameters and throughput performance surpassing conventional encryption systems.

  13. The Scythe Statistical Library: An Open Source C++ Library for Statistical Computation

    Directory of Open Access Journals (Sweden)

    Daniel Pemstein

    2011-08-01

    Full Text Available The Scythe Statistical Library is an open source C++ library for statistical computation. It includes a suite of matrix manipulation functions, a suite of pseudo-random number generators, and a suite of numerical optimization routines. Programs written using Scythe are generally much faster than those written in commonly used interpreted languages, such as R and proglang{MATLAB}; and can be compiled on any system with the GNU GCC compiler (and perhaps with other C++ compilers. One of the primary design goals of the Scythe developers has been ease of use for non-expert C++ programmers. Ease of use is provided through three primary mechanisms: (1 operator and function over-loading, (2 numerous pre-fabricated utility functions, and (3 clear documentation and example programs. Additionally, Scythe is quite flexible and entirely extensible because the source code is available to all users under the GNU General Public License.

  14. A novel image encryption algorithm using chaos and reversible cellular automata

    Science.gov (United States)

    Wang, Xingyuan; Luan, Dapeng

    2013-11-01

    In this paper, a novel image encryption scheme is proposed based on reversible cellular automata (RCA) combining chaos. In this algorithm, an intertwining logistic map with complex behavior and periodic boundary reversible cellular automata are used. We split each pixel of image into units of 4 bits, then adopt pseudorandom key stream generated by the intertwining logistic map to permute these units in confusion stage. And in diffusion stage, two-dimensional reversible cellular automata which are discrete dynamical systems are applied to iterate many rounds to achieve diffusion on bit-level, in which we only consider the higher 4 bits in a pixel because the higher 4 bits carry almost the information of an image. Theoretical analysis and experimental results demonstrate the proposed algorithm achieves a high security level and processes good performance against common attacks like differential attack and statistical attack. This algorithm belongs to the class of symmetric systems.

  15. On the Complexity of Additively Homomorphic UC Commitments

    DEFF Research Database (Denmark)

    Trifiletti, Roberto; Nielsen, Jesper Buus; Frederiksen, Tore Kasper

    2016-01-01

    as the commitment protocol by Garay \\emph{et al.} from Eurocrypt 2014. A main technical improvement over the scheme mentioned above, and other schemes based on using error correcting codes for UC commitment, we develop a new technique which allows to based the extraction property on erasure decoding as opposed...... to error correction. This allows to use a code with significantly smaller minimal distance and allows to use codes without efficient decoding. Our scheme only relies on standard assumptions. Specifically we require a pseudorandom number generator, a linear error correcting code and an ideal oblivious......, we manage to add the additive homo- morphic property, while at the same time reducing the constants. In fact, when opening a large enough batch of commitments we achieve an amor- tized communication complexity converging to the length of the message committed to, i.e., we achieve close to rate 1...

  16. Generation unit selection via capital asset pricing model for generation planning

    Energy Technology Data Exchange (ETDEWEB)

    Romy Cahyadi; K. Jo Min; Chung-Hsiao Wang; Nick Abi-Samra [College of Engineering, Ames, IA (USA)

    2003-11-01

    The USA's electric power industry is undergoing substantial regulatory and organizational changes. Such changes introduce substantial financial risk in generation planning. In order to incorporate the financial risk into the capital investment decision process of generation planning, this paper develops and analyses a generation unit selection process via the capital asset pricing model (CAPM). In particular, utilizing realistic data on gas-fired, coal-fired, and wind power generation units, the authors show which and how concrete steps can be taken for generation planning purposes. It is hoped that the generation unit selection process will help utilities in the area of effective and efficient generation planning when financial risks are considered. 20 refs., 14 tabs.

  17. The Employees of Baby Boomers Generation, Generation X, Generation Y and Generation Z in Selected Czech Corporations as Conceivers of Development and Competitiveness in their Corporation

    Directory of Open Access Journals (Sweden)

    Bejtkovský Jiří

    2016-12-01

    Full Text Available The corporations using the varied workforce can supply a greater variety of solutions to problems in service, sourcing, and allocation of their resources. The current labor market mentions four generations that are living and working today: the Baby boomers generation, the Generation X, the Generation Y and the Generation Z. The differences between generations can affect the way corporations recruit and develop teams, deal with change, motivate, stimulate and manage employees, and boost productivity, competitiveness and service effectiveness. A corporation’s success and competitiveness depend on its ability to embrace diversity and realize the competitive advantages and benefits. The aim of this paper is to present the current generation of employees (the employees of Baby Boomers Generation, Generation X, Generation Y and Generation Z in the labor market by secondary research and then to introduce the results of primary research that was implemented in selected corporations in the Czech Republic. The contribution presents a view of some of the results of quantitative and qualitative research conducted in selected corporations in the Czech Republic. These researches were conducted in 2015 on a sample of 3,364 respondents, and the results were analyzed. Two research hypotheses and one research question have been formulated. The verification or rejection of null research hypothesis was done through the statistical method of the Pearson’s Chi-square test. It was found that perception of the choice of superior from a particular generation does depend on the age of employees in selected corporations. It was also determined that there are statistically significant dependences between the preference for eterogeneous or homogeneous cooperation and the age of employees in selected corporations.

  18. Gamma ray generator

    Science.gov (United States)

    Firestone, Richard B; Reijonen, Jani

    2014-05-27

    An embodiment of a gamma ray generator includes a neutron generator and a moderator. The moderator is coupled to the neutron generator. The moderator includes a neutron capture material. In operation, the neutron generator produces neutrons and the neutron capture material captures at least some of the neutrons to produces gamma rays. An application of the gamma ray generator is as a source of gamma rays for calibration of gamma ray detectors.

  19. Semi-Supervised Generation with Cluster-aware Generative Models

    DEFF Research Database (Denmark)

    Maaløe, Lars; Fraccaro, Marco; Winther, Ole

    2017-01-01

    Deep generative models trained with large amounts of unlabelled data have proven to be powerful within the domain of unsupervised learning. Many real life data sets contain a small amount of labelled data points, that are typically disregarded when training generative models. We propose the Clust...... a log-likelihood of −79.38 nats on permutation invariant MNIST, while also achieving competitive semi-supervised classification accuracies. The model can also be trained fully unsupervised, and still improve the log-likelihood performance with respect to related methods.......Deep generative models trained with large amounts of unlabelled data have proven to be powerful within the domain of unsupervised learning. Many real life data sets contain a small amount of labelled data points, that are typically disregarded when training generative models. We propose the Cluster...

  20. Generation unit selection via capital asset pricing model for generation planning

    Energy Technology Data Exchange (ETDEWEB)

    Cahyadi, Romy; Jo Min, K. [College of Engineering, Ames, IA (United States); Chunghsiao Wang [LG and E Energy Corp., Louisville, KY (United States); Abi-Samra, Nick [Electric Power Research Inst., Palo Alto, CA (United States)

    2003-07-01

    The electric power industry in many parts of U.S.A. is undergoing substantial regulatory and organizational changes. Such changes introduce substantial financial risk in generation planning. In order to incorporate the financial risk into the capital investment decision process of generation planning, in this paper, we develop and analyse a generation unit selection process via the capital asset pricing model (CAPM). In particular, utilizing realistic data on gas-fired, coal-fired, and wind power generation units, we show which and how concrete steps can be taken for generation planning purposes. It is hoped that the generation unit selection process developed in this paper will help utilities in the area of effective and efficient generation planning when financial risks are considered. (Author)

  1. Cryptographic pseudo-random sequences from the chaotic Hénon ...

    Indian Academy of Sciences (India)

    dimensional discrete-time Hénon map is proposed. Properties of the proposed sequences pertaining to linear complexity, linear complexity profile, correlation and auto-correlation are investigated. All these properties of the sequences suggest a ...

  2. Solar thermoelectric generator

    Science.gov (United States)

    Toberer, Eric S.; Baranowski, Lauryn L.; Warren, Emily L.

    2016-05-03

    Solar thermoelectric generators (STEGs) are solid state heat engines that generate electricity from concentrated sunlight. A novel detailed balance model for STEGs is provided and applied to both state-of-the-art and idealized materials. STEGs can produce electricity by using sunlight to heat one side of a thermoelectric generator. While concentrated sunlight can be used to achieve extremely high temperatures (and thus improved generator efficiency), the solar absorber also emits a significant amount of black body radiation. This emitted light is the dominant loss mechanism in these generators. In this invention, we propose a solution to this problem that eliminates virtually all of the emitted black body radiation. This enables solar thermoelectric generators to operate at higher efficiency and achieve said efficient with lower levels of optical concentration. The solution is suitable for both single and dual axis solar thermoelectric generators.

  3. Generating Units

    Data.gov (United States)

    Department of Homeland Security — Generating Units are any combination of physically connected generators, reactors, boilers, combustion turbines, and other prime movers operated together to produce...

  4. Understanding portable generators

    Energy Technology Data Exchange (ETDEWEB)

    Hills, A.; Hawkins, B. [Guelph Univ., ON (Canada); Clarke, S. [Ontario Ministry of Agriculture, Food and Rural Affairs, Toronto, ON (Canada)

    2000-06-01

    This factsheet is intended to help consumers select a small portable generator for emergency electrical needs. Interest in standby generators has been heightened ever since the prolonged power outage in Eastern Ontario and Southwestern Quebec during the 1998 ice storm and the concern over Y2K related outages. Farmers, in particular, have been reassessing their need for emergency electrical power supply. This document presents some of the factors that should be considered when purchasing and operating a portable generator in the 3 to 12 kW size. It provides a detailed review of power quality and describes the use of tractor-driven power-take-off generators of 15 kW and larger. Several manufacturers make portable generators in many sizes with a whole range of features. This document includes a table depicting generator Feature/Benefit analysis to help consumers understand the differences between features and benefits. A second table provides a check list for generator feature/benefits. Specific details for the operations of various generators are available from manufacturers, distributors and electrical contractors. 2 tabs., 1 fig.

  5. Generativity Does Not Necessarily Satisfy All Your Needs: Associations among Cultural Demand for Generativity, Generative Concern, Generative Action, and Need Satisfaction in the Elderly in Four Cultures

    Science.gov (United States)

    Hofer, Jan; Busch, Holger; Au, Alma; Polácková Šolcová, Iva; Tavel, Peter; Tsien Wong, Teresa

    2016-01-01

    The present study examines the association between various facets of generativity, that is, cultural demand for generativity, generative concern, and generative action, with the satisfaction of the needs for relatedness, competence, and autonomy in samples of elderly from Cameroon, China (Hong Kong), the Czech Republic, and Germany. Participants…

  6. Knowing Generation Y: a new generation of nurses in practice.

    Science.gov (United States)

    Chung, Stephanie M

    Generation Y is commonly defined as those people born between 1980 and 2000, now aged in their 20s and 30s. Their grandparents experienced post-World War II reconstruction, their parents the economic boom of the 1980s. There are currently 81 million individuals in the Generation Y cohort in the USA, making it the second-largest, and possibly most influential, cohort since World War II (Manion, 2009). Members of Generation Y are diverse, technologically advanced and vocal about their opinions. They tend to resist traditional hierarchy, want recognition/reward for achievements and distrust institutions. Knowing these characteristics is useful for nurse managers, preceptors and team members working with members of Generation Y. Studies have proven that Generation Y is challenging the nursing workforce through rapid turnover (Cogin, 2012). This article explores a theoretical model that predicts retention and/or turnover of nurses in light of Generation Y behaviours and motivators-for example, moving from agency to agency rather than devoting many years to a single practice. Further research is needed to find out whether these behaviours and motivators are unique to Generation Y alone.

  7. FlexibleSUSY-A spectrum generator generator for supersymmetric models

    Science.gov (United States)

    Athron, Peter; Park, Jae-hyeon; Stöckinger, Dominik; Voigt, Alexander

    2015-05-01

    We introduce FlexibleSUSY, a Mathematica and C++ package, which generates a fast, precise C++ spectrum generator for any SUSY model specified by the user. The generated code is designed with both speed and modularity in mind, making it easy to adapt and extend with new features. The model is specified by supplying the superpotential, gauge structure and particle content in a SARAH model file; specific boundary conditions e.g. at the GUT, weak or intermediate scales are defined in a separate FlexibleSUSY model file. From these model files, FlexibleSUSY generates C++ code for self-energies, tadpole corrections, renormalization group equations (RGEs) and electroweak symmetry breaking (EWSB) conditions and combines them with numerical routines for solving the RGEs and EWSB conditions simultaneously. The resulting spectrum generator is then able to solve for the spectrum of the model, including loop-corrected pole masses, consistent with user specified boundary conditions. The modular structure of the generated code allows for individual components to be replaced with an alternative if available. FlexibleSUSY has been carefully designed to grow as alternative solvers and calculators are added. Predefined models include the MSSM, NMSSM, E6SSM, USSM, R-symmetric models and models with right-handed neutrinos.

  8. Elastic properties of dense solid phases of hard cyclic pentamers and heptamers in two dimensions

    International Nuclear Information System (INIS)

    Wojciechowski, K.W.; Tretiakov, K.V.; Kowalik, M.

    2003-02-01

    Systems of model plannar, non-convex, hard-body 'molecules' of five-fold and seven-fold symmetry axes are studied by constant pressure Monte Carlo simulations with variable shape of the periodic box. The molecules, referred to as pentamers (heptamers) are composed of five (seven) identical hard discs-'atoms' with centers forming regular pentagons (heptagons) of sides equal to the disc diameter. The elastic compliances of defect-free solid phases are computed by analysis of strain fluctuations and the reference (equilibrium) state is determined within the same run in which the elastic properties are computed. Results obtained by using pseudo-random number generators based on the idea proposed by Holian and co-workers [B. L. Holian et al., Phys. Rev. E50, 1607 (1994)] are in good agreement with the results generated by DRAND48. It is shown that singular behavior of the elastic constants near close packing is in agreement with the free volume approximation; the coefficients of the leading singularities are estimated. The simulations prove that the highest density structures of heptamers (in which the molecules cannot rotate) are auxetic, i.e. show negative Poisson ratios. (author)

  9. Generator for radionuclide

    International Nuclear Information System (INIS)

    Weisner, P.S.; Forrest, T.R.F.

    1985-01-01

    This invention provides a radionuclide generator of the kind in which a parent radionuclide, adsorbed on a column of particulate material, generates a daughter radionuclide which is periodically removed from the column. This invention is particularly concerned with technetium generators using single collection vials. The generator comprises a column, a first reservoir for the eluent, a second reservoir to contain the volume of eluent required for a single elution, and means connecting the first reservoir to the second reservoir and the second reservoir to the column. Such a generator is particularly suitable for operation by vacuum elution

  10. Advancing the CANDU reactor: From generation to generation

    International Nuclear Information System (INIS)

    Hopwood, Jerry; Duffey, Romney B.; Yu, Steven; Torgerson, Dave F.

    2006-01-01

    Emphasizing safety, reliability and economics, the CANDU reactor development strategy is one of continuous improvement, offering value and assured support to customers worldwide. The Advanced CANDU Reactor (ACR-1000) generation, designed by Atomic Energy of Canada Limited (AECL), meets the new economic expectation for low-cost power generation with high capacity factors. The ACR is designed to meet customer needs for reduced capital cost, shorter construction schedule, high plant capacity factor, low operating cost, increased operating life, simple component replacement, enhanced safety features, and low environmental impact. The ACR-1000 design evolved from the internationally successful medium-sized pressure tube reactor (PTR) CANDU 6 and incorporates operational feedback from eight utilities that operate 31 CANDU units. This technical paper provides a brief description of the main features of the ACR-1000, and its major role in the development path of the generations of the pressure tube reactor concept. The motivation, philosophy and design approach being taken for future generation of CANDU pressure tube reactors are described

  11. The Perceived Work Ethic of K-12 Teachers by Generational Status: Generation X vs. Baby Boom Generation

    Science.gov (United States)

    Petty, Gregory C.

    2013-01-01

    This was an investigation of the work ethic of K-12 educators from Generation X and Baby Boomer generations. Teachers of the baby boom generation were born between 1946 and 1964, and many are beginning to retire. There is an impending teacher shortage due to the large numbers of this group retiring or leaving the profession. School administrators…

  12. Steam generator life cycle management: Ontario Power Generation (OPG) experience

    International Nuclear Information System (INIS)

    Maruska, C.C.

    2002-01-01

    A systematic managed process for steam generators has been implemented at Ontario Power Generation (OPG) nuclear stations for the past several years. One of the key requirements of this managed process is to have in place long range Steam Generator Life Cycle Management (SG LCM) plans for each unit. The primary goal of these plans is to maximize the value of the nuclear facility through safe and reliable steam generator operation over the expected life of the units. The SG LCM plans integrate and schedule all steam generator actions such as inspection, operation, maintenance, modifications, repairs, assessments, R and D, performance monitoring and feedback. This paper discusses OPG steam generator life cycle management experience to date, including successes, failures and how lessons learned have been re-applied. The discussion includes relevant examples from each of the operating stations: Pickering B and Darlington. It also includes some of the experience and lessons learned from the activities carried out to refurbish the steam generators at Pickering A after several years in long term lay-up. The paper is structured along the various degradation modes that have been observed to date at these sites, including monitoring and mitigating actions taken and future plans. (author)

  13. Radio-isotope generator

    International Nuclear Information System (INIS)

    Benjamins, H.M.

    1983-01-01

    A device is claimed for interrupting an elution process in a radioisotope generator before an elution vial is entirely filled. The generator is simultaneously exposed to sterile air both in the direction of the generator column and of the elution vial

  14. Experimental Testing of a Van De Graaff Generator as an Electromagnetic Pulse Generator

    Science.gov (United States)

    2016-07-01

    EXPERIMENTAL TESTING OF A VAN DE GRAAFF GENERATOR AS AN ELECTROMAGNETIC PULSE GENERATOR THESIS...protection in the United States AFIT-ENP-MS-16-S-075 EXPERIMENTAL TESTING OF A VAN DE GRAAFF GENERATOR AS AN ELECTROMAGNETIC PULSE GENERATOR...RELEASE; DISTRIBUTION UNLIMITED. AFIT-ENP-MS-16-S-075 EXPERIMENTAL TESTING OF A VAN DE GRAAFF GENERATOR AS AN ELECTROMAGNETIC PULSE GENERATOR

  15. GeneratorSE: A Sizing Tool for Variable-Speed Wind Turbine Generators

    Energy Technology Data Exchange (ETDEWEB)

    Sethuraman, Latha [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Dykes, Katherine L [National Renewable Energy Laboratory (NREL), Golden, CO (United States)

    2017-09-22

    This report documents a set of analytical models employed by the optimization algorithms within the GeneratorSE framework. The initial values and boundary conditions employed for the generation of the various designs and initial estimates for basic design dimensions, masses, and efficiency for the four different models of generators are presented and compared with empirical data collected from previous studies and some existing commercial turbines. These models include designs applicable for variable-speed, high-torque application featuring direct-drive synchronous generators and low-torque application featuring induction generators. In all of the four models presented, the main focus of optimization is electromagnetic design with the exception of permanent-magnet and wire-wound synchronous generators, wherein the structural design is also optimized. Thermal design is accommodated in GeneratorSE as a secondary attribute by limiting the winding current densities to acceptable limits. A preliminary validation of electromagnetic design was carried out by comparing the optimized magnetic loading against those predicted by numerical simulation in FEMM4.2, a finite-element software for analyzing electromagnetic and thermal physics problems for electrical machines. For direct-drive synchronous generators, the analytical models for the structural design are validated by static structural analysis in ANSYS.

  16. HTGR steam generator development

    International Nuclear Information System (INIS)

    Schuetzenduebel, W.G.; Hunt, P.S.; Weber, M.

    1976-01-01

    More than 40 gas-cooled reactor plants have produced in excess of 400 reactor years of operating experience which have proved a reasonably high rate of gas-cooled reactor steam generator availability. The steam generators used in these reactors include single U-tube and straight-tube steam generators as well as meander type and helically wound or involute tube steam generators. It appears that modern reactors are being equipped with helically wound steam generators of the once-through type as the end product of steam generator evolution in gas-cooled reactor plants. This paper provides a general overview of gas-cooled reactor steam generator evolution and operating experience and shows how design criteria and constraints, research and development, and experience data are factored into the design/development of modern helically wound tube steam generators for the present generation of gas-cooled reactors

  17. Distributed generation - customer owned generation - Duke Energy case study

    Energy Technology Data Exchange (ETDEWEB)

    Iung, Anderson M. [Duke Energy International, Geracao Paranapanema S.A., SP (Brazil). Market Analysis Dept.; Ribeiro, Paulo F. [Calvin College, Grand Rapids, MI (United States); Oliveira, A.R. [Centro Federal de Educacao Tecnologica de Minas Gerais (CEFET-MG), Belo Horizonte, MG (Brazil)

    2009-07-01

    Distributed generation (DG) is getting more attractive. Although unit costs show strong economies of scale for all generation technology types, there is a potential niche market for DG technology to drive growth in addition to environmental concern issues. Duke Energy encourages the installation of cost effective small scale costumer owned generation. The objective of this article is to evaluate some aspects of DG connection in the Duke's distribution system regarding power quality, voltage stability, system protection, power balance control policy and the economical viability. (author)

  18. Comparing Generation X and Generation Y on their preferred emotional leadership style

    OpenAIRE

    Kraus, Markus

    2017-01-01

    Research Question: What are the differences and similarities between employees of Generation X and Gen-eration Y and do these generations prefer different emotional leadership styles? Methods: Empirical study across different organizations using an online survey to examine potential dif-ferences in the emotional leadership style preferences of Generation X and Y. Results: The results of the theoretical part demonstrate an increasing tendency of similarities between Generation X and Y with res...

  19. Compact neutron generator

    Science.gov (United States)

    Leung, Ka-Ngo; Lou, Tak Pui

    2005-03-22

    A compact neutron generator has at its outer circumference a toroidal shaped plasma chamber in which a tritium (or other) plasma is generated. A RF antenna is wrapped around the plasma chamber. A plurality of tritium ion beamlets are extracted through spaced extraction apertures of a plasma electrode on the inner surface of the toroidal plasma chamber and directed inwardly toward the center of neutron generator. The beamlets pass through spaced acceleration and focusing electrodes to a neutron generating target at the center of neutron generator. The target is typically made of titanium tubing. Water is flowed through the tubing for cooling. The beam can be pulsed rapidly to achieve ultrashort neutron bursts. The target may be moved rapidly up and down so that the average power deposited on the surface of the target may be kept at a reasonable level. The neutron generator can produce fast neutrons from a T-T reaction which can be used for luggage and cargo interrogation applications. A luggage or cargo inspection system has a pulsed T-T neutron generator or source at the center, surrounded by associated gamma detectors and other components for identifying explosives or other contraband.

  20. Security Analysis of 7-Round MISTY1 against Higher Order Differential Attacks

    Science.gov (United States)

    Tsunoo, Yukiyasu; Saito, Teruo; Shigeri, Maki; Kawabata, Takeshi

    MISTY1 is a 64-bit block cipher that has provable security against differential and linear cryptanalysis. MISTY1 is one of the algorithms selected in the European NESSIE project, and it has been recommended for Japanese e-Government ciphers by the CRYPTREC project. This paper shows that higher order differential attacks can be successful against 7-round versions of MISTY1 with FL functions. The attack on 7-round MISTY1 can recover a partial subkey with a data complexity of 254.1 and a computational complexity of 2120.8, which signifies the first successful attack on 7-round MISTY1 with no limitation such as a weak key. This paper also evaluates the complexity of this higher order differential attack on MISTY1 in which the key schedule is replaced by a pseudorandom function. It is shown that resistance to the higher order differential attack is not substantially improved even in 7-round MISTY1 in which the key schedule is replaced by a pseudorandom function.

  1. Development of Ultrasonic Pulse Compression Using Golay Codes

    International Nuclear Information System (INIS)

    Kim, Young H.; Kim, Young Gil; Jeong, Peter

    1994-01-01

    Conventional ultrasonic flaw detection system uses a large amplitude narrow pulse to excite a transducer. However, these systems are limited in pulse energy. An excessively large amplitude causes a dielectric breakage of the transducer, and an excessively long pulse causes decrease of the resolution. Using the pulse compression, a long pulse of pseudorandom signal can be used without sacrificing resolution by signal correlation. In the present work, the pulse compression technique was implemented into an ultrasonic system. Golay code was used as a pseudorandom signal in this system, since pair sum of autocorrelations has no sidelobe. The equivalent input pulse of the Golay code was derived to analyze the pulse compression system. Throughout the experiment, the pulse compression technique has demonstrated for its improved SNR(signal to noise ratio) by reducing the system's white noise. And the experimental data also indicated that the SNR enhancement was proportional to the square root of the code length used. The technique seems to perform particularly well with highly energy-absorbent materials such as polymers, plastics and rubbers

  2. Microwatt thermoelectric generator

    International Nuclear Information System (INIS)

    Goslee, D.E.

    1976-01-01

    A microwatt thermoelectric generator suitable for implanting in the body is described. The disclosed generator utilizes a nuclear energy source. Provision is made for temporary electrical connection to the generator for testing purposes, and for ensuring that the heat generated by the nuclear source does not bypass the pile. Also disclosed is a getter which is resistant to shrinkage during sintering, and a foil configuration for controlling the radiation of heat from the nuclear source to the hot plate of the pile

  3. Microwatt thermoelectric generator

    International Nuclear Information System (INIS)

    Goslee, D.E.; Bustard, T.S.

    1976-01-01

    A microwatt thermoelectric generator suitable for implanting in the body is described. The generator utilizes a nuclear energy source. Provision is made for temporary electrical connection to the generator for testing purposes, and for ensuring that the heat generated by the nuclear source does not bypass the pile. Also disclosed is a getter which is resistant to shrinkage during sintering, and a foil configuration for controlling the radiation of heat from the nuclear source to the hot plate of the pile

  4. Third generation coaching

    DEFF Research Database (Denmark)

    Stelter, Reinhard

    2014-01-01

    Third generation coaching unfolds a new universe for coaching and coaching psychology in the framework of current social research, new learning theories and discourses about personal leadership. Third generation coaching views coaching in a societal perspective. Coaching has become important...... transformation. Coaching thus facilitates new reflections and perspectives, as well as empowerment and support for self-Bildung processes. Third generation coaching focuses on the coach and the coachee in their narrative collaborative partnership. Unlike first generation coaching, where the goal is to help...

  5. Experiment of Neutron Generation by Using Prototype D-D Neutron Generator

    International Nuclear Information System (INIS)

    Kim, In Jung; Kim, Suk Kwon; Park, Chang Su; Jung, Nam Suk; Jung, Hwa Dong; Park, Ji Young; Hwang, Yong Seok; Choi, H.D.

    2005-01-01

    Experiment of neutron generation was performed by using a prototype D-D neutron generator. The characteristics of D-D neutron generation in drive-in target was studied. The increment of neutron yield by increasing ion beam energy was investigated, too

  6. Magnetic field generation device for magnetohydrodynamic electric power generation

    International Nuclear Information System (INIS)

    Kuriyama, Yoshihiko.

    1993-01-01

    An existent magnetic field generation device for magnetohydrodynamic electric power generation comprises at least a pair of permanent magnets disposed to an inner circumferential surface of a yoke having such a cross sectional area that two pairs of parallel sides are present, in which different magnetic poles are opposed while interposing a flow channel for a conductive fluid therebetween. Then, first permanent magnets which generate main magnetic fields are disposed each at a gap sandwiching a plane surface including a center axis of a flow channel for the conductive fluid. Second permanent magnets which generate auxiliary magnetic fields are disposed to an inner circumferential surface of a yoke intersecting the yoke to which the first permanent magnets are disposed. The magnetic poles on the side of the flow channel for the second permanent magnets have identical polarity with that of the magnetic poles of the adjacent first permanent magnets. As a result, a magnetic flux density in the flow channel for the conductive fluid can be kept homogeneous and at a high level from a position of the axial line of the flow channel to the outer circumference, thereby enabling to remarkably improve a power generation efficiency. (N.H.)

  7. Evaluation of the efficiency and fault density of software generated by code generators

    Science.gov (United States)

    Schreur, Barbara

    1993-01-01

    Flight computers and flight software are used for GN&C (guidance, navigation, and control), engine controllers, and avionics during missions. The software development requires the generation of a considerable amount of code. The engineers who generate the code make mistakes and the generation of a large body of code with high reliability requires considerable time. Computer-aided software engineering (CASE) tools are available which generates code automatically with inputs through graphical interfaces. These tools are referred to as code generators. In theory, code generators could write highly reliable code quickly and inexpensively. The various code generators offer different levels of reliability checking. Some check only the finished product while some allow checking of individual modules and combined sets of modules as well. Considering NASA's requirement for reliability, an in house manually generated code is needed. Furthermore, automatically generated code is reputed to be as efficient as the best manually generated code when executed. In house verification is warranted.

  8. Conceptualizing Media Generations: the Print-, Online- and Individualized Generations

    DEFF Research Database (Denmark)

    Westlund, Oscar; A Färdigh, Mathias

    2012-01-01

    During the 1990s news publishers established an online presence and in the 2000s they developed cross-media news work. This has resulted in changing news accessing habits, with varied magnitude among generations. This article aims to construct theoretically sound news media generations, through...... statistical analysis of data from a nationally representative scientific omnibus survey conducted in 2010. Firstly the article presents a descriptive and explanatory analysis of how eight generational cohorts utilize news in print and/or online and/or mobile. Secondly these findings are used for merging...... highest of online only news accessing (Pearson’s r = .135). The heterogeneous news usage patterns exhibited by the individualized generation (1980s-1990s) were accommodated for by two cohorts. The online cohort shows high probability for online-only news usage (49%) and a positive correlation (Pearson’s r...

  9. NEGATIVE GATE GENERATOR

    Science.gov (United States)

    Jones, C.S.; Eaton, T.E.

    1958-02-01

    This patent relates to pulse generating circuits and more particularly to rectangular pulse generators. The pulse generator of the present invention incorporates thyratrons as switching elements to discharge a first capacitor through a load resistor to initiate and provide the body of a Pulse, and subsequently dlscharge a second capacitor to impress the potential of its charge, with opposite potential polarity across the load resistor to terminate the pulse. Accurate rectangular pulses in the millimicrosecond range are produced across a low impedance by this generator.

  10. Microwatt thermoelectric generator

    International Nuclear Information System (INIS)

    Hittman, F.; Bustard, T.S.

    1976-01-01

    A microwatt thermoelectric generator suitable for implanting in the body is described. The generator utilizes a nuclear energy source. Provision is made for temporary electrical connection to the generator for testing purposes, and for ensuring that the heat generated by the nuclear source does not bypass the pile. Also disclosed is a getter which is resistant to shrinkage during sintering, and a foil configuration for controlling the radiation of heat from the nuclear source to the hot plate of the pile. 2 claims, 4 drawing figures

  11. Microwatt thermoelectric generator

    International Nuclear Information System (INIS)

    Barr, H.N.

    1978-01-01

    A microwatt thermoelectric generator suitable for implanting in the body is described. The disclosed generator utilizes a nuclear energy source. Provision is made for temporary electrical connection to the generator for testing purposes, and for ensuring that the heat generated by the nuclear source does not bypass the pile. Also disclosed is a getter which is resistant to shrinkage during sintering, and a foil configuration for controlling the radiation of heat from the nuclear source to the hot plate of the pile. 4 claims, 4 figures

  12. Steam generator

    International Nuclear Information System (INIS)

    Fenet, J.-C.

    1980-01-01

    Steam generator particularly intended for use in the coolant system of a pressurized water reactor for vaporizing a secondary liquid, generally water, by the primary cooling liquid of the reactor and comprising special arrangements for drying the steam before it leaves the generator [fr

  13. Logarithmic-function generator

    Science.gov (United States)

    Caron, P. R.

    1975-01-01

    Solid-state logarithmic-function generator is compact and provides improved accuracy. Generator includes a stable multivibrator feeding into RC circuit. Resulting exponentially decaying voltage is compared with input signal. Generator output is proportional to time required for exponential voltage to decay from preset reference level to level of input signal.

  14. Highly optimized simulations on single- and multi-GPU systems of the 3D Ising spin glass model

    Science.gov (United States)

    Lulli, M.; Bernaschi, M.; Parisi, G.

    2015-11-01

    We present a highly optimized implementation of a Monte Carlo (MC) simulator for the three-dimensional Ising spin-glass model with bimodal disorder, i.e., the 3D Edwards-Anderson model running on CUDA enabled GPUs. Multi-GPU systems exchange data by means of the Message Passing Interface (MPI). The chosen MC dynamics is the classic Metropolis one, which is purely dissipative, since the aim was the study of the critical off-equilibrium relaxation of the system. We focused on the following issues: (i) the implementation of efficient memory access patterns for nearest neighbours in a cubic stencil and for lagged-Fibonacci-like pseudo-Random Numbers Generators (PRNGs); (ii) a novel implementation of the asynchronous multispin-coding Metropolis MC step allowing to store one spin per bit and (iii) a multi-GPU version based on a combination of MPI and CUDA streams. Cubic stencils and PRNGs are two subjects of very general interest because of their widespread use in many simulation codes.

  15. Mean-Field Critical Behavior and Ergodicity Break in a Nonequilibrium One-Dimensional Rsos Growth Model

    Science.gov (United States)

    Mendonça, J. Ricardo G.

    We investigate the nonequilibrium roughening transition of a one-dimensional restricted solid-on-solid model by directly sampling the stationary probability density of a suitable order parameter as the surface adsorption rate varies. The shapes of the probability density histograms suggest a typical Ginzburg-Landau scenario for the phase transition of the model, and estimates of the "magnetic" exponent seem to confirm its mean-field critical behavior. We also found that the flipping times between the metastable phases of the model scale exponentially with the system size, signaling the breaking of ergodicity in the thermodynamic limit. Incidentally, we discovered that a closely related model not considered before also displays a phase transition with the same critical behavior as the original model. Our results support the usefulness of off-critical histogram techniques in the investigation of nonequilibrium phase transitions. We also briefly discuss in the appendix a good and simple pseudo-random number generator used in our simulations.

  16. A generalization of resource-bounded measure, with an application (Extended abstract)

    Science.gov (United States)

    Buhrman, Harry; van Melkebeek, Dieter; Regan, Kenneth W.; Sivakumar, D.; Strauss, Martin

    We introduce resource-bounded betting games, and propose a generalization of Lutz's resource-bounded measure in which the choice of next string to bet on is fully adaptive. Lutz's martingales are equivalent to betting games constrained to bet on strings in lexicographic order. We show that if strong pseudo-random number generators exist, then betting games are equivalent to martingales, for measure on E and EXP. However, we construct betting games that succeed on certain classes whose Lutz measures are important open problems: the class of polynomial-time Turing-complete languages in EXP, and its superclass of polynomial-time Turing-autoreducible languages. If an EXP-martingale succeeds on either of these classes, or if betting games have the "finite union property" possessed by Lutz's measure, one obtains the non-relativizable consequence BPP ≠ EXP. We also show that if EXP ≠ MA, then the polynomial-time truth-table-autoreducible languages have Lutz measure zero, whereas if EXP = BPP, they have measure one.

  17. Cross-correlation analysis of Ge/Li/ spectra

    International Nuclear Information System (INIS)

    MacDonald, R.; Robertson, A.; Kennett, T.J.; Prestwich, W.V.

    1974-01-01

    A sensitive technique is proposed for activation analysis using cross-correlation and improved spectral orthogonality achieved through use of a rectangular zero area digital filter. To test the accuracy and reliability of the cross-correlation procedure five spectra obtained with a Ge/Li detector were combined in different proportions. Gaussian distributed statistics were then added to the composite spectra by means of a pseudo-random number generator. The basis spectra used were 76 As, 82 Br, 72 Ga, 77 Ge, and room background. In general, when the basis spectra were combined in roughly comparable proportions the accuracy of the techique proved to be excelent (>1%). However, of primary importance was the ability of the correlation technique to identify low intensity components in the presence of high intensity components. It was found that the detection threshold for Ge, for example, was not reached until the Ge content in the unfiltered spectrum was <0.16%. (T.G.)

  18. Increasing average period lengths by switching of robust chaos maps in finite precision

    Science.gov (United States)

    Nagaraj, N.; Shastry, M. C.; Vaidya, P. G.

    2008-12-01

    Grebogi, Ott and Yorke (Phys. Rev. A 38, 1988) have investigated the effect of finite precision on average period length of chaotic maps. They showed that the average length of periodic orbits (T) of a dynamical system scales as a function of computer precision (ɛ) and the correlation dimension (d) of the chaotic attractor: T ˜ɛ-d/2. In this work, we are concerned with increasing the average period length which is desirable for chaotic cryptography applications. Our experiments reveal that random and chaotic switching of deterministic chaotic dynamical systems yield higher average length of periodic orbits as compared to simple sequential switching or absence of switching. To illustrate the application of switching, a novel generalization of the Logistic map that exhibits Robust Chaos (absence of attracting periodic orbits) is first introduced. We then propose a pseudo-random number generator based on chaotic switching between Robust Chaos maps which is found to successfully pass stringent statistical tests of randomness.

  19. Early-childhood housing mobility and subsequent PTSD in adolescence: a Moving to Opportunity reanalysis [version 1; referees: 2 approved

    Directory of Open Access Journals (Sweden)

    David C. Norris

    2016-05-01

    Full Text Available In a 2014 report on adolescent mental health outcomes in the Moving to Opportunity for Fair Housing Demonstration (MTO, Kessler et al. reported that, at 10- to 15-year follow-up, boys from households randomized to an experimental housing voucher intervention experienced 12-month prevalence of post-traumatic stress disorder (PTSD at several times the rate of boys from control households. We reanalyze this finding here, bringing to light a PTSD outcome imputation procedure used in the original analysis, but not described in the study report. By bootstrapping with repeated draws from the frequentist sampling distribution of the imputation model used by Kessler et al., and by varying two pseudorandom number generator seeds that fed their analysis, we account for several purely statistical components of the uncertainty inherent in their imputation procedure. We also discuss other sources of uncertainty in this procedure that were not accessible to a formal reanalysis.

  20. Applied number theory

    CERN Document Server

    Niederreiter, Harald

    2015-01-01

    This textbook effectively builds a bridge from basic number theory to recent advances in applied number theory. It presents the first unified account of the four major areas of application where number theory plays a fundamental role, namely cryptography, coding theory, quasi-Monte Carlo methods, and pseudorandom number generation, allowing the authors to delineate the manifold links and interrelations between these areas.  Number theory, which Carl-Friedrich Gauss famously dubbed the queen of mathematics, has always been considered a very beautiful field of mathematics, producing lovely results and elegant proofs. While only very few real-life applications were known in the past, today number theory can be found in everyday life: in supermarket bar code scanners, in our cars’ GPS systems, in online banking, etc.  Starting with a brief introductory course on number theory in Chapter 1, which makes the book more accessible for undergraduates, the authors describe the four main application areas in Chapters...

  1. Broadband diffuse terahertz wave scattering by flexible metasurface with randomized phase distribution.

    Science.gov (United States)

    Zhang, Yin; Liang, Lanju; Yang, Jing; Feng, Yijun; Zhu, Bo; Zhao, Junming; Jiang, Tian; Jin, Biaobing; Liu, Weiwei

    2016-05-26

    Suppressing specular electromagnetic wave reflection or backward radar cross section is important and of broad interests in practical electromagnetic engineering. Here, we present a scheme to achieve broadband backward scattering reduction through diffuse terahertz wave reflection by a flexible metasurface. The diffuse scattering of terahertz wave is caused by the randomized reflection phase distribution on the metasurface, which consists of meta-particles of differently sized metallic patches arranged on top of a grounded polyimide substrate simply through a certain computer generated pseudorandom sequence. Both numerical simulations and experimental results demonstrate the ultralow specular reflection over a broad frequency band and wide angle of incidence due to the re-distribution of the incident energy into various directions. The diffuse scattering property is also polarization insensitive and can be well preserved when the flexible metasurface is conformably wrapped on a curved reflective object. The proposed design opens up a new route for specular reflection suppression, and may be applicable in stealth and other technology in the terahertz spectrum.

  2. An imaging escape gated MPWC for hard X-ray astronomy

    International Nuclear Information System (INIS)

    Ubertini, P.; Bazzano, A.; Boccaccini, L.; La Padula, C.; Mastropietro, M.; Patriarca, R.; Polcaro, V.F.; Barbareschi, L.; Perotti, F.; Villa, G.; Butler, R.C.; Di Cocco, G.; Spada, G.; Charalambous, P.; Dean, A.J.; Stephen, J.B.

    1983-01-01

    A scientific forward step in the hard X-ray and soft gamma-ray astronomy will only be possible with the use of a new generation of space borne instruments. Their main characteristics have to be the two-dimensional imaging capability over a large collecting area and the fine spectral resolution in order to discriminate between the weak signal coming from cosmic sources to be detected and the strong background induced by cosmic rays, in the space environment, on the detector. To reach this goal we have developed a new hard X-ray position sensitive proportional counter operating with the escape gate technique in the range 15-150 keV, to be used together with a pseudo-random coded mask in order to obtain sky images. The detector is a high pressure (5 bar) xenon-argon-isobutane filled chamber with a spatial resolution of 30x2 mm and a spectral resolution of 5% at 60 keV on the sensitive area of 3000 cm 2 . (orig.)

  3. Imaging escape gated MPWC for hard X-ray astronomy

    Energy Technology Data Exchange (ETDEWEB)

    Ubertini, P.; Bazzano, A.; Boccaccini, L.; La Padula, C.; Mastropietro, M.; Patriarca, R.; Polcaro, V.F.; Barbareschi, L.; Perotti, F.; Villa, G.

    1983-11-15

    A scientific forward step in the hard X-ray and soft gamma-ray astronomy will only be possible with the use of a new generation of space borne instruments. Their main characteristics have to be the two-dimensional imaging capability over a large collecting area and the fine spectral resolution in order to discriminate between the weak signal coming from cosmic sources to be detected and the strong background induced by cosmic rays, in the space environment, on the detector. To reach this goal we have developed a new hard X-ray position sensitive proportional counter operating with the escape gate technique in the range 15-150 keV, to be used together with a pseudo-random coded mask in order to obtain sky images. The detector is a high pressure (5 bar) xenon-argon-isobutane filled chamber with a spatial resolution of 30x2 mm and a spectral resolution of 5% at 60 keV on the sensitive area of 3000 cm/sup 2/.

  4. Optical image encryption using chaos-based compressed sensing and phase-shifting interference in fractional wavelet domain

    Science.gov (United States)

    Liu, Qi; Wang, Ying; Wang, Jun; Wang, Qiong-Hua

    2018-02-01

    In this paper, a novel optical image encryption system combining compressed sensing with phase-shifting interference in fractional wavelet domain is proposed. To improve the encryption efficiency, the volume data of original image are decreased by compressed sensing. Then the compacted image is encoded through double random phase encoding in asymmetric fractional wavelet domain. In the encryption system, three pseudo-random sequences, generated by three-dimensional chaos map, are used as the measurement matrix of compressed sensing and two random-phase masks in the asymmetric fractional wavelet transform. It not only simplifies the keys to storage and transmission, but also enhances our cryptosystem nonlinearity to resist some common attacks. Further, holograms make our cryptosystem be immune to noises and occlusion attacks, which are obtained by two-step-only quadrature phase-shifting interference. And the compression and encryption can be achieved in the final result simultaneously. Numerical experiments have verified the security and validity of the proposed algorithm.

  5. The Effects of Low Income Housing Tax Credit Developments on Neighborhoods.

    Science.gov (United States)

    Baum-Snow, Nathaniel; Marion, Justin

    2009-06-01

    This paper evaluates the impacts of new housing developments funded with the Low Income Housing Tax Credit (LIHTC), the largest federal project based housing program in the U.S., on the neighborhoods in which they are built. A discontinuity in the formula determining the magnitude of tax credits as a function of neighborhood characteristics generates pseudo-random assignment in the number of low income housing units built in similar sets of census tracts. Tracts where projects are awarded 30 percent higher tax credits receive approximately six more low income housing units on a base of seven units per tract. These additional new low income developments cause homeowner turnover to rise, raise property values in declining areas and reduce incomes in gentrifying areas in neighborhoods near the 30th percentile of the income distribution. LIHTC units significantly crowd out nearby new rental construction in gentrifying areas but do not displace new construction in stable or declining areas.

  6. SLATEC-4.1, Subroutine Library for Solution of Mathematical Problems

    International Nuclear Information System (INIS)

    Boland, W.R.

    1999-01-01

    1 - Description of problem or function: SLATEC4.1 is a large collection of FORTRAN mathematical subprograms brought together in a joint effort by the Air Force Phillips Laboratory, Lawrence Livermore National Laboratory, Los Alamos National Laboratory, Magnetic Fusion Energy Computing Center, National Institute of Standards and Technology, Sandia National Laboratories (Albuquerque and Livermore), and Oak Ridge National Laboratory. SLATEC is characterized by portability, good numerical technology, good documentation, robustness, and quality assurance. The library can be divided into the following subsections following the lines of the GAMS classification system: Error Analysis, Elementary and Special Functions, Elementary Vector Operations, Solutions of Systems of Linear Equations, Eigen analysis, QR Decomposition, Singular Value Decomposition, Overdetermined or Underdetermined Systems, Interpolation, Solution of Nonlinear Equations, Optimization, Quadrature, Ordinary Differential Equations, Partial Differential Equations, Fast Fourier Transforms, Approximation, Pseudo-random Number Generation, Sorting, Machine Constants, and Diagnostics and Error Handling. 2 - Method of solution: This information is provided by comments within the individual library subroutines

  7. Composite electric generator equipped with steam generator for heating reactor coolant

    International Nuclear Information System (INIS)

    Watabe, Masaharu; Soman, Yoshindo; Kawanishi, Kohei; Ota, Masato.

    1997-01-01

    The present invention concerns a composite electric generator having coolants, as a heating source, of a PWR type reactor or a thermonuclear reactor. An electric generator driving gas turbine is disposed, and a superheater using a high temperature exhaust gas of the gas turbine as a heating source is disposed, and main steams are superheated by the superheater to elevate the temperature at the inlet of the turbine. This can increase the electric generation capacity as well as increase the electric generation efficiency. In addition, since the humidity in the vicinity of the exit of the steam turbine is reduced, occurrence of loss and erosion can be suppressed. When cooling water of the thermonuclear reactor is used, the electric power generated by the electric generator driven by the gas turbine can be used upon start of the thermonuclear reactor, and it is not necessary to dispose a large scaled special power source in the vicinity, which is efficient. (N.H.)

  8. Quantum random number generator

    Science.gov (United States)

    Pooser, Raphael C.

    2016-05-10

    A quantum random number generator (QRNG) and a photon generator for a QRNG are provided. The photon generator may be operated in a spontaneous mode below a lasing threshold to emit photons. Photons emitted from the photon generator may have at least one random characteristic, which may be monitored by the QRNG to generate a random number. In one embodiment, the photon generator may include a photon emitter and an amplifier coupled to the photon emitter. The amplifier may enable the photon generator to be used in the QRNG without introducing significant bias in the random number and may enable multiplexing of multiple random numbers. The amplifier may also desensitize the photon generator to fluctuations in power supplied thereto while operating in the spontaneous mode. In one embodiment, the photon emitter and amplifier may be a tapered diode amplifier.

  9. Hydrogen generator characteristics for storage of renewably-generated energy

    International Nuclear Information System (INIS)

    Kotowicz, Janusz; Bartela, Łukasz; Węcel, Daniel; Dubiel, Klaudia

    2017-01-01

    The paper presents a methodology for determining the efficiency of a hydrogen generator taking the power requirements of its auxiliary systems into account. Authors present results of laboratory experiments conducted on a hydrogen generator containing a PEM water electrolyzer for a wide range of device loads. On the basis of measurements, the efficiency characteristics of electrolyzers were determined, including that of an entire hydrogen generator using a monitored power supply for its auxiliary devices. Based on the results of the experimental tests, the authors have proposed generalized characteristics of hydrogen generator efficiency. These characteristics were used for analyses of a Power-to-Gas system cooperating with a 40 MW wind farm with a known yearly power distribution. It was assumed that nightly-produced hydrogen is injected into the natural gas transmission system. An algorithm for determining the thermodynamic and economic characteristics of a Power-to-Gas installation is proposed. These characteristics were determined as a function of the degree of storage of the energy produced in a Renewable Energy Sources (RES) installation, defined as the ratio of the amount of electricity directed to storage to the annual amount of electricity generated in the RES installation. Depending on the degree of storage, several quantities were determined. - Highlights: • The efficiency characteristics of PEM electrolyzer are determined. • Generalized characteristics of hydrogen generator efficiency are proposed. • Method of choice of electrolyser nominal power for Power-to-Gas system was proposed. • Development of Power-to-Gas systems requires implementation of support mechanisms.

  10. Sound generator

    NARCIS (Netherlands)

    Berkhoff, Arthur P.

    2008-01-01

    A sound generator, particularly a loudspeaker, configured to emit sound, comprising a rigid element (2) enclosing a plurality of air compartments (3), wherein the rigid element (2) has a back side (B) comprising apertures (4), and a front side (F) that is closed, wherein the generator is provided

  11. Sound generator

    NARCIS (Netherlands)

    Berkhoff, Arthur P.

    2010-01-01

    A sound generator, particularly a loudspeaker, configured to emit sound, comprising a rigid element (2) enclosing a plurality of air compartments (3), wherein the rigid element (2) has a back side (B) comprising apertures (4), and a front side (F) that is closed, wherein the generator is provided

  12. Sound generator

    NARCIS (Netherlands)

    Berkhoff, Arthur P.

    2007-01-01

    A sound generator, particularly a loudspeaker, configured to emit sound, comprising a rigid element (2) enclosing a plurality of air compartments (3), wherein the rigid element (2) has a back side (B) comprising apertures (4), and a front side (F) that is closed, wherein the generator is provided

  13. Free piston linear generator for low grid power generation

    Directory of Open Access Journals (Sweden)

    Abdalla Izzeldin

    2017-01-01

    Full Text Available Generating power is of great importance nowadays across the world. However, recently, the world became aware of the climatic changes due to the greenhouse effect caused by CO2 emissions and began seeking solutions to reduce the negative impact on the environment. Besides, the exhaustion of fossil fuels and their environmental impact, make it is crucial to develop clean energy sources, and efforts are focused on developing and improving the efficiency of all energy consuming systems. The tubular permanent magnet linear generators (TPMLGs are the best candidate for energy converters. Despite being suffering problem of attraction force between permanent magnets and stator teeth, to eliminate such attraction force, ironless-stator could be considered. Thus, they could waive the presence of any magnetic attraction between the moving and stator part. This paper presents the design and analysis of ironless -cored TPMLG for low grid power generation. The main advantages of this generator are the low cogging force and high efficiency. Therefore, the magnetic field computation of the proposed generator has been performed by applying a magnetic vector potential and utilizing a 2-D finite element analysis (FEA. Moreover, the experimental results for the current profile, pressure profile and velocity profile have been presented.

  14. Emotion-driven level generation

    OpenAIRE

    Togelius, Julian; Yannakakis, Georgios N.

    2016-01-01

    This chapter examines the relationship between emotions and level generation. Grounded in the experience-driven procedural content generation framework we focus on levels and introduce a taxonomy of approaches for emotion-driven level generation. We then review four characteristic level generators of our earlier work that exemplify each one of the approaches introduced. We conclude the chapter with our vision on the future of emotion-driven level generation.

  15. Small Private Key MQPKS on an Embedded Microprocessor

    Directory of Open Access Journals (Sweden)

    Hwajeong Seo

    2014-03-01

    Full Text Available Multivariate quadratic (MQ cryptography requires the use of long public and private keys to ensure a sufficient security level, but this is not favorable to embedded systems, which have limited system resources. Recently, various approaches to MQ cryptography using reduced public keys have been studied. As a result of this, at CHES2011 (Cryptographic Hardware and Embedded Systems, 2011, a small public key MQ scheme, was proposed, and its feasible implementation on an embedded microprocessor was reported at CHES2012. However, the implementation of a small private key MQ scheme was not reported. For efficient implementation, random number generators can contribute to reduce the key size, but the cost of using a random number generator is much more complex than computing MQ on modern microprocessors. Therefore, no feasible results have been reported on embedded microprocessors. In this paper, we propose a feasible implementation on embedded microprocessors for a small private key MQ scheme using a pseudo-random number generator and hash function based on a block-cipher exploiting a hardware Advanced Encryption Standard (AES accelerator. To speed up the performance, we apply various implementation methods, including parallel computation, on-the-fly computation, optimized logarithm representation, vinegar monomials and assembly programming. The proposed method reduces the private key size by about 99.9% and boosts signature generation and verification by 5.78% and 12.19% than previous results in CHES2012.

  16. Design of improved controller for thermoelectric generator used in distributed generation

    Energy Technology Data Exchange (ETDEWEB)

    Molina, M.G. [CONICET, Instituto de Energia Electrica, Universidad Nacional de San Juan, Av. Libertador San Martin Oeste, 1109, J5400ARL, San Juan (Argentina); Juanico, L.E. [CONICET, Centro Atomico Bariloche, 8400 Bariloche (Argentina); Rinalde, G.F.; Taglialavore, E.; Gortari, S. [Centro Atomico Bariloche, 8400 Bariloche (Argentina)

    2010-06-15

    This paper investigates the application of thermal generation based on solid-state devices such as thermoelectric generators (TEGs) as a novel technological alternative of distributed generation (DG). The full detailed modeling and the dynamic simulation of a three-phase grid-connected TEG used as a dispersed generator is studied. Moreover, a new control scheme of the TEG is proposed, which consists of a multi-level hierarchical structure and incorporates a maximum power point tracker (MPPT) for better use of the thermal resource. In addition, reactive power compensation of the electric grid is included, operating simultaneously and independently of the active power generation. Validation of models and control schemes is performed by using the MATLAB/Simulink environment. Moreover, a small-scale TEG experimental set-up was employed to demonstrate the accuracy of proposed models. (author)

  17. Generative Semantics.

    Science.gov (United States)

    King, Margaret

    The first section of this paper deals with the attempts within the framework of transformational grammar to make semantics a systematic part of linguistic description, and outlines the characteristics of the generative semantics position. The second section takes a critical look at generative semantics in its later manifestations, and makes a case…

  18. Talkin' 'bout My Generation

    Science.gov (United States)

    Rickes, Persis C.

    2010-01-01

    The monikers are many: (1) "Generation Y"; (2) "Echo Boomers"; (3) "GenMe"; (4) the "Net Generation"; (5) "RenGen"; and (6) "Generation Next". One name that appears to be gaining currency is "Millennials," perhaps as a way to better differentiate the current generation from its…

  19. Work Values across Generations

    Science.gov (United States)

    Hansen, Jo-Ida C.; Leuty, Melanie E.

    2012-01-01

    Mainstream publication discussions of differences in generational cohorts in the workplace suggest that individuals of more recent generations, such as Generation X and Y, have different work values than do individuals of the Silent and Baby Boom generations. Although extant research suggests that age may influence work values, few of the…

  20. TFTR Motor Generator

    International Nuclear Information System (INIS)

    Murray, J.G.; Bronner, G.; Horton, M.

    1977-01-01

    A general description is given of 475 MVA pulsed motor generators for TFTR at Princeton Plasma Physics Laboratory. Two identical generators operating in parallel are capable of supplying 950 MVA for an equivalent square pulse of 6.77 seconds and 4,500 MJ at 0.7 power factor to provide the energy for the pulsed electrical coils and heating system for TFTR. The description includes the operational features of the 15,000 HP wound rotor motors driving each generator with its starting equipment and cycloconverter for controlling speed, power factor, and regulating line voltage during load pulsing where the generator speed changes from 87.5 to 60 Hz frequency variation to provide the 4,500 MJ or energy. The special design characteristics such as fatigue stress calculations for 10 6 cycles of operation, forcing factor on exciter to provide regulation, and low generator impedance are reviewed