WorldWideScience

Sample records for efficient pseudo-random number

  1. 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.

  2. 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.

  3. 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.

  4. 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.

  5. 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.

  6. 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

  7. Long period pseudo random number sequence generator

    Science.gov (United States)

    Wang, Charles C. (Inventor)

    1989-01-01

    A circuit for generating a sequence of pseudo random numbers, (A sub K). There is an exponentiator in GF(2 sup m) for the normal basis representation of elements in a finite field GF(2 sup m) each represented by m binary digits and having two inputs and an output from which the sequence (A sub K). Of pseudo random numbers is taken. One of the two inputs is connected to receive the outputs (E sub K) of maximal length shift register of n stages. There is a switch having a pair of inputs and an output. The switch outputs is connected to the other of the two inputs of the exponentiator. One of the switch inputs is connected for initially receiving a primitive element (A sub O) in GF(2 sup m). Finally, there is a delay circuit having an input and an output. The delay circuit output is connected to the other of the switch inputs and the delay circuit input is connected to the output of the exponentiator. Whereby after the exponentiator initially receives the primitive element (A sub O) in GF(2 sup m) through the switch, the switch can be switched to cause the exponentiator to receive as its input a delayed output A(K-1) from the exponentiator thereby generating (A sub K) continuously at the output of the exponentiator. The exponentiator in GF(2 sup m) is novel and comprises a cyclic-shift circuit; a Massey-Omura multiplier; and, a control logic circuit all operably connected together to perform the function U(sub i) = 92(sup i) (for n(sub i) = 1 or 1 (for n(subi) = 0).

  8. 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...

  9. 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...

  10. 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

  11. 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.

  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. 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.

  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. 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.

  16. 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

  17. 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.

  18. 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.

  19. 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

  20. 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.

  1. 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.

  2. 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.

  3. 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.

  4. Fully Digital Chaotic Oscillators Applied to Pseudo Random Number Generation

    KAUST Repository

    Mansingka, Abhinav S.

    2012-05-01

    adapted for pseudo random number generation by truncating statistically defective bits. Finally, a novel post-processing technique using the Fibonacci series is proposed and implemented with a non-autonomous driven hyperchaotic system to provide pseudo random number generators with high nonlinear complexity and controllable period length that enables full utilization of all branches of the chaotic output as statistically secure pseudo random output.

  5. 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.

  6. Properties making a chaotic system a good Pseudo Random Number Generator

    OpenAIRE

    Falcioni, Massimo; Palatella, Luigi; Pigolotti, Simone; Vulpiani, Angelo

    2005-01-01

    We discuss two properties making a deterministic algorithm suitable to generate a pseudo random sequence of numbers: high value of Kolmogorov-Sinai entropy and high-dimensionality. We propose the multi dimensional Anosov symplectic (cat) map as a Pseudo Random Number Generator. We show what chaotic features of this map are useful for generating Pseudo Random Numbers and investigate numerically which of them survive in the discrete version of the map. Testing and comparisons with other generat...

  7. An empirical test of pseudo random number generators by means of an exponential decaying process

    International Nuclear Information System (INIS)

    Coronel B, H.F.; Hernandez M, A.R.; Jimenez M, M.A.; Mora F, L.E.

    2007-01-01

    Empirical tests for pseudo random number generators based on the use of processes or physical models have been successfully used and are considered as complementary to theoretical tests of randomness. In this work a statistical methodology for evaluating the quality of pseudo random number generators is presented. The method is illustrated in the context of the so-called exponential decay process, using some pseudo random number generators commonly used in physics. (Author)

  8. 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.

  9. Simulation of a directed random-walk model: the effect of pseudo-random-number correlations

    OpenAIRE

    Shchur, L. N.; Heringa, J. R.; Blöte, H. W. J.

    1996-01-01

    We investigate the mechanism that leads to systematic deviations in cluster Monte Carlo simulations when correlated pseudo-random numbers are used. We present a simple model, which enables an analysis of the effects due to correlations in several types of pseudo-random-number sequences. This model provides qualitative understanding of the bias mechanism in a class of cluster Monte Carlo algorithms.

  10. 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.

  11. 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

  12. 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

  13. 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...

  14. 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.

  15. 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

  16. 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)

  17. 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.

  18. 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.

  19. 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.

  20. 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...

  1. Pseudo-random-number generators and the square site percolation threshold.

    Science.gov (United States)

    Lee, Michael J

    2008-09-01

    Selected pseudo-random-number generators are applied to a Monte Carlo study of the two-dimensional square-lattice site percolation model. A generator suitable for high precision calculations is identified from an application specific test of randomness. After extended computation and analysis, an ostensibly reliable value of p_{c}=0.59274598(4) is obtained for the percolation threshold.

  2. 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).

  3. 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.

  4. 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...

  5. 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.

  6. 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.

  7. 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.

  8. 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.

  9. 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.

  10. 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.

  11. 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.

  12. 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.

  13. Development and testing of high performance pseudo random number generator for Monte Carlo simulation

    International Nuclear Information System (INIS)

    Chakraborty, Brahmananda

    2009-01-01

    Random number plays an important role in any Monte Carlo simulation. The accuracy of the results depends on the quality of the sequence of random numbers employed in the simulation. These include randomness of the random numbers, uniformity of their distribution, absence of correlation and long period. In a typical Monte Carlo simulation of particle transport in a nuclear reactor core, the history of a particle from its birth in a fission event until its death by an absorption or leakage event is tracked. The geometry of the core and the surrounding materials are exactly modeled in the simulation. To track a neutron history one needs random numbers for determining inter collision distance, nature of the collision, the direction of the scattered neutron etc. Neutrons are tracked in batches. In one batch approximately 2000-5000 neutrons are tracked. The statistical accuracy of the results of the simulation depends on the total number of particles (number of particles in one batch multiplied by the number of batches) tracked. The number of histories to be generated is usually large for a typical radiation transport problem. To track a very large number of histories one needs to generate a long sequence of independent random numbers. In other words the cycle length of the random number generator (RNG) should be more than the total number of random numbers required for simulating the given transport problem. The number of bits of the machine generally limits the cycle length. For a binary machine of p bits the maximum cycle length is 2 p . To achieve higher cycle length in the same machine one has to use either register arithmetic or bit manipulation technique

  14. An empirical test of pseudo random number generators by means of an exponential decaying process; Una prueba empirica de generadores de numeros pseudoaleatorios mediante un proceso de decaimiento exponencial

    Energy Technology Data Exchange (ETDEWEB)

    Coronel B, H.F.; Hernandez M, A.R.; Jimenez M, M.A. [Facultad de Fisica e Inteligencia Artificial, Universidad Veracruzana, A.P. 475, Xalapa, Veracruz (Mexico); Mora F, L.E. [CIMAT, A.P. 402, 36000 Guanajuato (Mexico)]. e-mail: hcoronel@uv.mx

    2007-07-01

    Empirical tests for pseudo random number generators based on the use of processes or physical models have been successfully used and are considered as complementary to theoretical tests of randomness. In this work a statistical methodology for evaluating the quality of pseudo random number generators is presented. The method is illustrated in the context of the so-called exponential decay process, using some pseudo random number generators commonly used in physics. (Author)

  15. 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…

  16. 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.

  17. 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

  18. 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.

  19. 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...

  20. 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%.

  1. 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%.

  2. Fully digital 1-D, 2-D and 3-D multiscroll chaos as hardware pseudo random number generators

    KAUST Repository

    Mansingka, Abhinav S.

    2012-10-07

    This paper introduces the first fully digital implementation of 1-D, 2-D and 3-D multiscroll chaos using the sawtooth nonlinearity in a 3rd order ODE with the Euler approximation. Systems indicate chaotic behaviour through phase space boundedness and positive Lyapunov exponent. Low-significance bits form a PRNG and pass all tests in the NIST SP. 800-22 suite without post-processing. Real-time control of the number of scrolls allows distinct output streams with 2-D and 3-D multiscroll chaos enabling greater controllability. The proposed PRNGs are experimentally verified on a Xilinx Virtex 4 FPGA with logic utilization less than 1.25%, throughput up to 5.25 Gbits/s and up to 512 distinct output streams with low cross-correlation.

  3. 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.

  4. Pseudo random signal processing theory and application

    CERN Document Server

    Zepernick, Hans-Jurgen

    2013-01-01

    In recent years, pseudo random signal processing has proven to be a critical enabler of modern communication, information, security and measurement systems. The signal's pseudo random, noise-like properties make it vitally important as a tool for protecting against interference, alleviating multipath propagation and allowing the potential of sharing bandwidth with other users. Taking a practical approach to the topic, this text provides a comprehensive and systematic guide to understanding and using pseudo random signals. Covering theoretical principles, design methodologies and applications

  5. Pseudo Random Coins Show More Heads Than Tails

    OpenAIRE

    Bauke, Heiko; Mertens, Stephan

    2003-01-01

    Tossing a coin is the most elementary Monte Carlo experiment. In a computer the coin is replaced by a pseudo random number generator. It can be shown analytically and by exact enumerations that popular random number generators are not capable of imitating a fair coin: pseudo random coins show more heads than tails. This bias explains the empirically observed failure of some random number generators in random walk experiments. It can be traced down to the special role of the value zero in the ...

  6. 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

  7. 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.

  8. 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.

  9. 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

  10. 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.

  11. 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)

  12. 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.

  13. 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.

  14. 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.

  15. 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.

  16. 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.

  17. 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.

  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. 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.

  20. 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

  1. 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.

  2. 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.

  3. 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)

  4. 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.

  5. 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

  6. 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.

  7. 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.

  8. 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.

  9. 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.

  10. 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

  11. Multi-kW coherent combining of fiber lasers seeded with pseudo random phase modulated light

    Science.gov (United States)

    Flores, Angel; Ehrehreich, Thomas; Holten, Roger; Anderson, Brian; Dajani, Iyad

    2016-03-01

    We report efficient coherent beam combining of five kilowatt-class fiber amplifiers with a diffractive optical element (DOE). Based on a master oscillator power amplifier (MOPA) configuration, the amplifiers were seeded with pseudo random phase modulated light. Each non-polarization maintaining fiber amplifier was optically path length matched and provides approximately 1.2 kW of near diffraction-limited output power (measured M2polarization control. A low power sample of the combined beam after the DOE provided an error signal for active phase locking which was performed via Locking of Optical Coherence by Single-Detector Electronic-Frequency Tagging (LOCSET). After phase stabilization, the beams were coherently combined via the 1x5 DOE. A total combined output power of 4.9 kW was achieved with 82% combining efficiency and excellent beam quality (M2splitter loss was 5%. Similarly, losses due in part to non-ideal polarization, ASE content, uncorrelated wavefront errors, and misalignment errors contributed to the efficiency reduction.

  12. 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.

  13. Interference Suppression Performance of Automotive UWB Radars Using Pseudo Random Sequences

    Directory of Open Access Journals (Sweden)

    I. Pasya

    2015-12-01

    Full Text Available Ultra wideband (UWB automotive radars have attracted attention from the viewpoint of reducing traffic accidents. The performance of automotive radars may be degraded by interference from nearby radars using the same frequency. In this study, a scenario where two cars pass each other on a road was considered. Considering the utilization of cross-polarization, the desired-to-undesired signal power ratio (DUR was found to vary approximately from -10 to 30 dB. Different pseudo random sequences were employed for spectrum spreading the different radar signals to mitigate the interference effects. This paper evaluates the interference suppression provided by maximum length sequence (MLS and Gold sequence (GS through numerical simulations of the radar’s performance in terms of probability of false alarm and probability of detection. It was found that MLS and GS yielded nearly the same performance when the DUR is -10 dB (worst case; for example when fixing the probability of false alarm to 0.0001, the probabilities of detection were 0.964 and 0.946 respectively. The GS are more advantageous than MLS due to larger number of different sequences having the same length in GS than in MLS.

  14. 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.

  15. 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.

  16. 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.

  17. 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.

  18. 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.

  19. 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.

  20. 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....

  1. 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.

  2. 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).

  3. 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.

  4. 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.

  5. Design of an Ultra-wideband Pseudo Random Coded MIMO Radar Based on Radio Frequency Switches

    Directory of Open Access Journals (Sweden)

    Su Hai

    2017-02-01

    Full Text Available A Multiple-Input Multiple-Output (MIMO ultra-wideband radar can detect the range and azimuth information of targets in real time. It is widely used for geological surveys, life rescue, through-wall tracking, and other military or civil fields. This paper presents the design of an ultra-wideband pseudo random coded MIMO radar that is based on Radio Frequency (RF switches and implements a MIMO radar system. RF switches are employed to reduce cost and complexity of the system. As the switch pressure value is limited, the peak power of the transmitting signal is 18 dBm. The ultra-wideband radar echo is obtained by hybrid sampling, and pulse compression is computed by Digital Signal Processors (DSPs embedded in an Field-Programmable Gate Array (FPGA to simplify the signal process. The experiment illustrates that the radar system can detect the range and azimuth information of targets in real time.

  6. Reactor dynamics experiment of nuclear ship Mutsu using pseudo random signal (II). The second experiment

    International Nuclear Information System (INIS)

    Hayashi, Koji; Shimazaki, Junya; Nabeshima, Kunihiko; Ochiai, Masaaki; Shinohara, Yoshikuni; Inoue, Kimihiko.

    1995-01-01

    In order to investigate dynamics of the reactor plant of the nuclear ship Mutsu, the second reactor noise experiment using pseudo random binary sequences (PRBS) was performed on August 30, 1991 in the third experimental navigation. The experiments using both reactivity and load disturbances were performed at 50% of reactor power and under a quiet sea condition. Each PRBS was applied by manual operation of the control rod or the main steam valve. Various signals of the plant responses and of the acceleration of ship motion were measured. Furthermore, natural reactor noise signals were measured after each PRBS experiment in order to evaluate the effects of the PRBS disturbances. This paper summarizes the planning of the experiment, the instruction for the experiment and logs, the data recording conditions, recorded signal wave forms and the results of power spectral analysis. (author)

  7. Covert Communication in MIMO-OFDM System Using Pseudo Random Location of Fake Subcarriers

    Directory of Open Access Journals (Sweden)

    Rizky Pratama Hudhajanto

    2016-08-01

    Full Text Available Multiple-Input Multiple-Output Orthogonal Frequency Division Multiplexing (MIMO-OFDM is the most used wireless transmission scheme in the world. However, its security is the interesting problem to discuss if we want to use this scheme to transmit a sensitive data, such as in the military and commercial communication systems. In this paper, we propose a new method to increase the security of MIMO-OFDM system using the change of location of fake subcarrier. The fake subcarriers’ location is generated per packet of data using Pseudo Random sequence generator. The simulation results show that the proposed scheme does not decrease the performance of conventional MIMO-OFDM. The attacker or eavesdropper gets worse Bit Error Rate (BER than the legal receiver compared to the conventional MIMO-OFDM system.

  8. Reactor dynamics experiment of nuclear ship Mutsu using pseudo random signal (III). The third experiment

    International Nuclear Information System (INIS)

    Hayashi, Koji; Shimazaki, Junya; Nabeshima, Kunihiko; Ochiai, Masaaki; Shinohara, Yoshikuni; Inoue, Kimihiko.

    1995-03-01

    In order to investigate dynamics of the reactor plant of the nuclear ship Mutsu, the third reactor noise experiment using pseudo random binary sequences (PRBS) was performed on September 16, 1991 in the third experimental navigation. The experiments using both reactivity and load disturbances were performed at 70% of reactor power and under a normal sea condition. Each PRBS was applied by manual operation of the control rod or the main steam valve. Various signals of the plant responses and of the acceleration of ship motion were measured. Furthermore, natural reactor noise signals were measured after each PRBS experiment in order to evaluate the effects of the PRBS disturbances. This paper summarizes the planning of the experiment, the instruction for the experiment and logs, the data recording conditions, recorded signal wave forms and the results of power spectral analysis. (author)

  9. Design of a Handheld Pseudo Random Coded UWB Radar for Human Sensing

    Directory of Open Access Journals (Sweden)

    Xia Zheng-huan

    2015-10-01

    Full Text Available This paper presents the design of a handheld pseudo random coded Ultra-WideBand (UWB radar for human sensing. The main tasks of the radar are to track the moving human object and extract the human respiratory frequency. In order to achieve perfect penetrability and good range resolution, m sequence with a carrier of 800 MHz is chosen as the transmitting signal. The modulated m-sequence can be generated directly by the high-speed DAC and FPGA to reduce the size of the radar system, and the mean power of the transmitting signal is 5 dBm. The receiver has two receiving channels based on hybrid sampling, the first receiving channel is to sample the reference signal and the second receiving channel is to obtain the radar echo. The real-time pulse compression is computed in parallel with a group of on-chip DSP48E slices in FPGA to improve the scanning rate of the radar system. Additionally, the algorithms of moving target tracking and life detection are implemented using Intel’s micro-processor, and the detection results are sent to the micro displayer fixed on the helmet. The experimental results show that the moving target located at less than 16 m far away from the wall can be tracked, and the respiratory frequency of the static human at less than 14 m far away from the wall can be extracted.

  10. Least squares deconvolution for leak detection with a pseudo random binary sequence excitation

    Science.gov (United States)

    Nguyen, Si Tran Nguyen; Gong, Jinzhe; Lambert, Martin F.; Zecchin, Aaron C.; Simpson, Angus R.

    2018-01-01

    Leak detection and localisation is critical for water distribution system pipelines. This paper examines the use of the time-domain impulse response function (IRF) for leak detection and localisation in a pressurised water pipeline with a pseudo random binary sequence (PRBS) signal excitation. Compared to the conventional step wave generated using a single fast operation of a valve closure, a PRBS signal offers advantageous correlation properties, in that the signal has very low autocorrelation for lags different from zero and low cross correlation with other signals including noise and other interference. These properties result in a significant improvement in the IRF signal to noise ratio (SNR), leading to more accurate leak localisation. In this paper, the estimation of the system IRF is formulated as an optimisation problem in which the l2 norm of the IRF is minimised to suppress the impact of noise and interference sources. Both numerical and experimental data are used to verify the proposed technique. The resultant estimated IRF provides not only accurate leak location estimation, but also good sensitivity to small leak sizes due to the improved SNR.

  11. Reactor dynamics experiment of N.S. Mutsu using pseudo random signal. 1

    International Nuclear Information System (INIS)

    Hayashi, Koji; Nabeshima, Kunihiko; Shinohara, Yoshikuni; Shimazaki, Junya; Inoue, Kimihiko; Ochiai, Masaaki.

    1993-10-01

    In order to investigate dynamics of the reactor plant of the nuclear ship Mutsu, reactor noise experiments using pseudo random binary sequences (PRBS) have been planned, and a preliminary experiment was performed on March 4, 1991 in the first experimental navigation with the aim of checking the experimental procedures and conditions. The experiments using both reactivity and load disturbances were performed at 70 % of reactor power and under a quiet sea condition. Each PRBS was applied by manual operation of the control rod or the main steam valve. Various signals of the plant responses and of the acceleration of ship motion were measured. From the results obtained, we confirmed that (1) the procedures and experimental conditions determined prior to the experiment were suitable for performing the PRBS experiments, (2) when the PRBS disturbances were applied, the plant state remained quite stable, and (3) the quality of the measured data is adequate for the purpose of dynamics analysis. This paper summarizes the planning and preparation of the experiment, the instruction for the experiment and logs, the data recording conditions, recorded signal wave forms and the results of power spectral analysis. (author)

  12. 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.

  13. 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)

  14. 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

  15. 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)

  16. 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.

  17. 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

  18. 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)

  19. 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.

  20. 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

  1. 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.

  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. Fully digital 1-D, 2-D and 3-D multiscroll chaos as hardware pseudo random number generators

    KAUST Repository

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

    2012-01-01

    This paper introduces the first fully digital implementation of 1-D, 2-D and 3-D multiscroll chaos using the sawtooth nonlinearity in a 3rd order ODE with the Euler approximation. Systems indicate chaotic behaviour through phase space boundedness

  4. 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.).

  5. Cooperative multi-user detection and ranging based on pseudo-random codes

    Directory of Open Access Journals (Sweden)

    C. Morhart

    2009-05-01

    Full Text Available We present an improved approach for a Round Trip Time of Flight distance measurement system. The system is intended for the usage in a cooperative localisation system for automotive applications. Therefore, it is designed to address a large number of communication partners per measurement cycle. By using coded signals in a time divison multiple access order, we can detect a large number of pedestrian sensors with just one car sensor. We achieve this by using very short transmit bursts in combination with a real time correlation algorithm. Futhermore, the correlation approach offers real time data, concerning the time of arrival, that can serve as a trigger impulse for other comunication systems. The distance accuracy of the correlation result was further increased by adding a fourier interpolation filter. The system performance was checked with a prototype at 2.4 GHz. We reached a distance measurement accuracy of 12 cm at a range up to 450 m.

  6. 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.

    2010-01-01

    We discuss the results of SEM and TEM measurements with the BPRML test samples fabricated from a BPRML (WSi2/Si with fundamental layer thickness of 3 nm) with a Dual Beam FIB (focused ion beam)/SEM technique. 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.

  7. 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.

  8. 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)

  9. 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…

  10. 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.

  11. Effects of cetane number on HCCI combustion efficiency and emissions

    Energy Technology Data Exchange (ETDEWEB)

    Hosseini, V.; Neill, W.S.; Guo, H.; Chippior, W.L. [National Research Council of Canada, Ottawa, ON (Canada); Fairbridge, C. [Natural Resources Canada, Ottawa, ON (Canada); Mitchell, K. [Shell Canada Ltd., Calgary, AB (Canada)

    2009-07-01

    Homogeneous charge compression ignition (HCCI) is a form of internal combustion in which well-mixed fuel and oxidizer are compressed to the point of auto-ignition. This exothermic reaction releases chemical energy into a sensible form that can be transformed in an engine into work and heat. The effects of cetane number on HCCI combustion efficiency and emissions were examined in this presentation. The presentation discussed the experimental setup, fuels, experimental procedures, and results. The setup included an enhanced fuel injector/vaporizer consisting of an OEM gasoline port fuel injector, air blast for improved atomization, and heated section to improved vaporization. A minimally processed and low cetane number fuel derived from oil sands was used as the base fuel in the study. Two sets of experiments were devised and described to evaluate each test fuel. One set used controlled input conditions exhaust gas recirculation (EGR)-air-fuel ratio (AFR) while the other set employed controlled engine outputs (such as speed and load). Results were presented for hydroprocessing; cetane improver addition; blending with supercetane renewable diesel; and a comparison of fuels with similar cetane numbers. It was concluded that increasing the fuel cetane number shifted the AFR-EGR operating window for HCCI combustion towards higher AFT (leaner mixtures) and reduced the cyclic variations. tabs., figs.

  12. 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.

  13. 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)

  14. 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.

  15. Evidence of significant bias in an elementary random number generator

    International Nuclear Information System (INIS)

    Borgwaldt, H.; Brandl, V.

    1981-03-01

    An elementary pseudo random number generator for isotropically distributed unit vectors in 3-dimensional space has ben tested for bias. This generator uses the IBM-suplied routine RANDU and a transparent rejection technique. The tests show clearly that non-randomness in the pseudo random numbers generated by the primary IBM generator leads to bias in the order of 1 percent in estimates obtained from the secondary random number generator. FORTRAN listings of 4 variants of the random number generator called by a simple test programme and output listings are included for direct reference. (orig.) [de

  16. Efficient Information Hiding Based on Theory of Numbers

    Directory of Open Access Journals (Sweden)

    Yanjun Liu

    2018-01-01

    Full Text Available Data hiding is an efficient technique that conceals secret data into a digital medium. In 2006, Zhang and Wang proposed a data hiding scheme called exploiting modification direction (EMD which has become a milestone in the field of data hiding. In recent years, many EMD-type data hiding schemes have been developed, but their embedding capacity remains restricted. In this paper, a novel data hiding scheme based on the combination of Chinese remainder theorem (CRT and a new extraction function is proposed. By the proposed scheme, the cover image is divided into non-overlapping pixel groups for embedding to increase the embedding capacity. Experimental results show that the embedding capacity of the proposed scheme is significantly higher (greater than 2.5 bpp than previously proposed schemes while ensuring very good visual quality of the stego image. In addition, security analysis is given to show that the proposed scheme can resist visual attack.

  17. 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.

  18. 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.

  19. Reducing the memory size in the study of statistical properties of the pseudo-random number generators, focused on solving problems of cryptographic information protection

    International Nuclear Information System (INIS)

    Chugunkov, I.V.

    2014-01-01

    The report contains the description of an approach based on calculation of missing sets quantity, which allows to reduce memory usage needed for implementation of statistical tests. Information about estimation procedure of test statistics derived as a result of using this approach is also provided [ru

  20. 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.

  1. 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

  2. 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

  3. 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.

  4. A true random number generator based on mouse movement and chaotic cryptography

    International Nuclear Information System (INIS)

    Hu Yue; Liao Xiaofeng; Wong, Kwok-wo; Zhou Qing

    2009-01-01

    True random number generators are in general more secure than pseudo random number generators. In this paper, we propose a novel true random number generator which generates a 256-bit random number by computer mouse movement. It is cheap, convenient and universal for personal computers. To eliminate the effect of similar movement patterns generated by the same user, three chaos-based approaches, namely, discretized 2D chaotic map permutation, spatiotemporal chaos and 'MASK' algorithm, are adopted to post-process the captured mouse movements. Random bits generated by three users are tested using NIST statistical tests. Both the spatiotemporal chaos approach and the 'MASK' algorithm pass the tests successfully. However, the latter has a better performance in terms of efficiency and effectiveness and so is more practical for common personal computer applications.

  5. 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)

  6. On efficiency of fire simulation realization: parallelization with greater number of computational meshes

    Science.gov (United States)

    Valasek, Lukas; Glasa, Jan

    2017-12-01

    Current fire simulation systems are capable to utilize advantages of high-performance computer (HPC) platforms available and to model fires efficiently in parallel. In this paper, efficiency of a corridor fire simulation on a HPC computer cluster is discussed. The parallel MPI version of Fire Dynamics Simulator is used for testing efficiency of selected strategies of allocation of computational resources of the cluster using a greater number of computational cores. Simulation results indicate that if the number of cores used is not equal to a multiple of the total number of cluster node cores there are allocation strategies which provide more efficient calculations.

  7. Aerodynamic efficiency of a bio-inspired flapping wing rotor at low Reynolds number

    OpenAIRE

    Li, Hao; Guo, Shijun

    2018-01-01

    This study investigates the aerodynamic efficiency of a bioinspired flapping wing rotor kinematics which combines an active vertical flapping motion and a passive horizontal rotation induced by aerodynamic thrust. The aerodynamic efficiencies for producing both vertical lift and horizontal thrust of the wing are obtained using a quasi-steady aerodynamic model and two-dimensional (2D) CFD analysis at Reynolds number of 2500. The calculated efficiency data show that both efficiencies (propulsiv...

  8. 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.

  9. 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.

  10. True random numbers from amplified quantum vacuum.

    Science.gov (United States)

    Jofre, M; Curty, M; Steinlechner, F; Anzolin, G; Torres, J P; Mitchell, M W; Pruneri, V

    2011-10-10

    Random numbers are essential for applications ranging from secure communications to numerical simulation and quantitative finance. Algorithms can rapidly produce pseudo-random outcomes, series of numbers that mimic most properties of true random numbers while quantum random number generators (QRNGs) exploit intrinsic quantum randomness to produce true random numbers. Single-photon QRNGs are conceptually simple but produce few random bits per detection. In contrast, vacuum fluctuations are a vast resource for QRNGs: they are broad-band and thus can encode many random bits per second. Direct recording of vacuum fluctuations is possible, but requires shot-noise-limited detectors, at the cost of bandwidth. We demonstrate efficient conversion of vacuum fluctuations to true random bits using optical amplification of vacuum and interferometry. Using commercially-available optical components we demonstrate a QRNG at a bit rate of 1.11 Gbps. The proposed scheme has the potential to be extended to 10 Gbps and even up to 100 Gbps by taking advantage of high speed modulation sources and detectors for optical fiber telecommunication devices.

  11. Photon-number-resolving SSPDs with system detection efficiency over 50% at telecom range

    Science.gov (United States)

    Zolotov, P.; Divochiy, A.; Vakhtomin, Yu.; Moshkova, M.; Morozov, P.; Seleznev, V.; Smirnov, K.

    2018-02-01

    We used technology of making high-efficiency superconducting single-photon detectors as a basis for improvement of photon-number-resolving devices. By adding optical cavity and using an improved NbN superconducting film, we enhanced previously reported system detection efficiency at telecom range for such detectors. Our results show that implementation of optical cavity helps to develop four-section device with quantum efficiency over 50% at 1.55 µm. Performed experimental studies of detecting multi-photon optical pulses showed irregularities over defining multi-photon through single-photon quantum efficiency.

  12. Aerodynamic efficiency of a bioinspired flapping wing rotor at low Reynolds number.

    Science.gov (United States)

    Li, H; Guo, S

    2018-03-01

    This study investigates the aerodynamic efficiency of a bioinspired flapping wing rotor kinematics which combines an active vertical flapping motion and a passive horizontal rotation induced by aerodynamic thrust. The aerodynamic efficiencies for producing both vertical lift and horizontal thrust of the wing are obtained using a quasi-steady aerodynamic model and two-dimensional (2D) CFD analysis at Reynolds number of 2500. The calculated efficiency data show that both efficiencies (propulsive efficiency- η p , and efficiency for producing lift- P f ) of the wing are optimized at Strouhal number ( St ) between 0.1 and 0.5 for a range of wing pitch angles (upstroke angle of attack α u less than 45°); the St for high P f ( St  = 0.1 ∼ 0.3) is generally lower than for high η p ( St  = 0.2 ∼ 0.5), while the St for equilibrium rotation states lies between the two. Further systematic calculations show that the natural equilibrium of the passive rotating wing automatically converges to high-efficiency states: above 85% of maximum P f can be obtained for a wide range of prescribed wing kinematics. This study provides insight into the aerodynamic efficiency of biological flyers in cruising flight, as well as practical applications for micro air vehicle design.

  13. Noise-free high-efficiency photon-number-resolving detectors

    International Nuclear Information System (INIS)

    Rosenberg, Danna; Lita, Adriana E.; Miller, Aaron J.; Nam, Sae Woo

    2005-01-01

    High-efficiency optical detectors that can determine the number of photons in a pulse of monochromatic light have applications in a variety of physics studies, including post-selection-based entanglement protocols for linear optics quantum computing and experiments that simultaneously close the detection and communication loopholes of Bell's inequalities. Here we report on our demonstration of fiber-coupled, noise-free, photon-number-resolving transition-edge sensors with 88% efficiency at 1550 nm. The efficiency of these sensors could be made even higher at any wavelength in the visible and near-infrared spectrum without resulting in a higher dark-count rate or degraded photon-number resolution

  14. Efficient testing of the homogeneity, scale parameters and number of components in the Rayleigh mixture

    International Nuclear Information System (INIS)

    Stehlik, M.; Ososkov, G.A.

    2003-01-01

    The statistical problem to expand the experimental distribution of transverse momenta into Rayleigh distribution is considered. A high-efficient testing procedure for testing the hypothesis of the homogeneity of the observed measurements which is optimal in the sense of Bahadur is constructed. The exact likelihood ratio (LR) test of the scale parameter of the Rayleigh distribution is proposed for cases when the hypothesis of homogeneity holds. Otherwise the efficient procedure for testing the number of components in the mixture is also proposed

  15. 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.

  16. Effects of the number of people on efficient capture and sample collection: A lion case study

    Directory of Open Access Journals (Sweden)

    Sam M. Ferreira

    2013-05-01

    Full Text Available Certain carnivore research projects and approaches depend on successful capture of individuals of interest. The number of people present at a capture site may determine success of a capture. In this study 36 lion capture cases in the Kruger National Park were used to evaluate whether the number of people present at a capture site influenced lion response rates and whether the number of people at a sampling site influenced the time it took to process the collected samples. The analyses suggest that when nine or fewer people were present, lions appeared faster at a call-up locality compared with when there were more than nine people. The number of people, however, did not influence the time it took to process the lions. It is proposed that efficient lion capturing should spatially separate capture and processing sites and minimise the number of people at a capture site.

  17. Effects of the number of people on efficient capture and sample collection: a lion case study.

    Science.gov (United States)

    Ferreira, Sam M; Maruping, Nkabeng T; Schoultz, Darius; Smit, Travis R

    2013-05-24

    Certain carnivore research projects and approaches depend on successful capture of individuals of interest. The number of people present at a capture site may determine success of a capture. In this study 36 lion capture cases in the Kruger National Park were used to evaluate whether the number of people present at a capture site influenced lion response rates and whether the number of people at a sampling site influenced the time it took to process the collected samples. The analyses suggest that when nine or fewer people were present, lions appeared faster at a call-up locality compared with when there were more than nine people. The number of people, however, did not influence the time it took to process the lions. It is proposed that efficient lion capturing should spatially separate capture and processing sites and minimise the number of people at a capture site.

  18. Cost efficiency with triangular fuzzy number input prices: An application of DEA

    International Nuclear Information System (INIS)

    Bagherzadeh Valami, H.

    2009-01-01

    The cost efficiency model (CE) has been considered by researchers as a Data Envelopment Analysis (DEA) model for evaluating the efficiency of DMUs. In this model, the possibility of producing the outputs of a target DMU is evaluated by the input prices of the DMU. This provides a criterion for evaluating the CE of DMUs. The main contribution of this paper is to provide an approach for generalizing the CE of DMUs when their input prices are triangular fuzzy numbers, where preliminary concepts of fuzzy theory and CE, are directly used.

  19. Efficient Raman generation in a waveguide: A route to ultrafast quantum random number generation

    Energy Technology Data Exchange (ETDEWEB)

    England, D. G.; Bustard, P. J.; Moffatt, D. J.; Nunn, J.; Lausten, R.; Sussman, B. J., E-mail: ben.sussman@nrc.ca [National Research Council of Canada, 100 Sussex Drive, Ottawa, Ontario K1A 0R6 (Canada)

    2014-02-03

    The inherent uncertainty in quantum mechanics offers a source of true randomness which can be used to produce unbreakable cryptographic keys. We discuss the development of a high-speed random number generator based on the quantum phase fluctuations in spontaneously initiated stimulated Raman scattering (SISRS). We utilize the tight confinement and long interaction length available in a Potassium Titanyl Phosphate waveguide to generate highly efficient SISRS using nanojoule pulse energies, reducing the high pump power requirements of the previous approaches. We measure the random phase of the Stokes output using a simple interferometric setup to yield quantum random numbers at 145 Mbps.

  20. An efficient algorithm for generating random number pairs drawn from a bivariate normal distribution

    Science.gov (United States)

    Campbell, C. W.

    1983-01-01

    An efficient algorithm for generating random number pairs from a bivariate normal distribution was developed. Any desired value of the two means, two standard deviations, and correlation coefficient can be selected. Theoretically the technique is exact and in practice its accuracy is limited only by the quality of the uniform distribution random number generator, inaccuracies in computer function evaluation, and arithmetic. A FORTRAN routine was written to check the algorithm and good accuracy was obtained. Some small errors in the correlation coefficient were observed to vary in a surprisingly regular manner. A simple model was developed which explained the qualities aspects of the errors.

  1. 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.

  2. Random number generators and the Metropolis algorithm: application to various problems in physics and mechanics as an introduction to computational physics

    International Nuclear Information System (INIS)

    Calvayrac, Florent

    2005-01-01

    We present known and new applications of pseudo random numbers and of the Metropolis algorithm to phenomena of physical and mechanical interest, such as the search of simple clusters isomers with interactive visualization, or vehicle motion planning. The progression towards complicated problems was used with first-year graduate students who wrote most of the programs presented here. We argue that the use of pseudo random numbers in simulation and extrema research programs in teaching numerical methods in physics allows one to get quick programs and physically meaningful and demonstrative results without recurring to the advanced numerical analysis methods

  3. 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.

  4. Regulation of Coordination Number over Single Co Sites: Triggering the Efficient Electroreduction of CO2.

    Science.gov (United States)

    Wang, Xiaoqian; Chen, Zhao; Zhao, Xuyan; Yao, Tao; Chen, Wenxing; You, Rui; Zhao, Changming; Wu, Geng; Wang, Jing; Huang, Weixin; Yang, Jinlong; Hong, Xun; Wei, Shiqiang; Wu, Yuen; Li, Yadong

    2018-02-12

    The design of active, selective, and stable CO 2 reduction electrocatalysts is still challenging. A series of atomically dispersed Co catalysts with different nitrogen coordination numbers were prepared and their CO 2 electroreduction catalytic performance was explored. The best catalyst, atomically dispersed Co with two-coordinate nitrogen atoms, achieves both high selectivity and superior activity with 94 % CO formation Faradaic efficiency and a current density of 18.1 mA cm -2 at an overpotential of 520 mV. The CO formation turnover frequency reaches a record value of 18 200 h -1 , surpassing most reported metal-based catalysts under comparable conditions. Our experimental and theoretical results demonstrate that lower a coordination number facilitates activation of CO 2 to the CO 2 .- intermediate and hence enhances CO 2 electroreduction activity. © 2018 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

  5. Efficient Detection of Copy Number Mutations in PMS2 Exons with a Close Homolog.

    Science.gov (United States)

    Herman, Daniel S; Smith, Christina; Liu, Chang; Vaughn, Cecily P; Palaniappan, Selvi; Pritchard, Colin C; Shirts, Brian H

    2018-07-01

    Detection of 3' PMS2 copy-number mutations that cause Lynch syndrome is difficult because of highly homologous pseudogenes. To improve the accuracy and efficiency of clinical screening for these mutations, we developed a new method to analyze standard capture-based, next-generation sequencing data to identify deletions and duplications in PMS2 exons 9 to 15. The approach captures sequences using PMS2 targets, maps sequences randomly among regions with equal mapping quality, counts reads aligned to homologous exons and introns, and flags read count ratios outside of empirically derived reference ranges. The method was trained on 1352 samples, including 8 known positives, and tested on 719 samples, including 17 known positives. Clinical implementation of the first version of this method detected new mutations in the training (N = 7) and test (N = 2) sets that had not been identified by our initial clinical testing pipeline. The described final method showed complete sensitivity in both sample sets and false-positive rates of 5% (training) and 7% (test), dramatically decreasing the number of cases needing additional mutation evaluation. This approach leveraged the differences between gene and pseudogene to distinguish between PMS2 and PMS2CL copy-number mutations. These methods enable efficient and sensitive Lynch syndrome screening for 3' PMS2 copy-number mutations and may be applied similarly to other genomic regions with highly homologous pseudogenes. Copyright © 2018 American Society for Investigative Pathology and the Association for Molecular Pathology. Published by Elsevier Inc. All rights reserved.

  6. 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.

  7. Copy number aberrations landscape of a breast tumor, connection with the efficiency of neoadjuvant chemotherapy

    Science.gov (United States)

    Ibragimova, M. K.; Tsyganov, M. M.; Slonimskaya, E. M.; Litviakov, N. V.

    2017-09-01

    The research involved 80 patients diagnosed with breast cancer (BC). Each patient had their tumor biopsy material sampled before their treatment. We studied the tumor tissue using the CytoScan HD Array (Affymetrix, USA) microarray to evaluate the CNA landscape. We studied the frequency of segmental and numerical CNA occurrence, their association with the efficiency of neoadjuvant chemotherapy (NAC). We found that the biggest number of amplifications (with frequency over 60%) were found on in the following locuses; 1q32.1 1q32.3, 1q42.13, 1q42.2, 1q43. The biggest frequency of deletions (more than in 58% of the patients) was found in these locuses: 16q21, 16q23.2, 16q23.3, 17p12, 17p13.1. However, we found the locuses with full absence of segmental chromosome anomalies. We observed trisomy most frequently in the 7, 8, 12, and 17 chromosomes, and monosomy in the 3, 4, 9, 11, 18, and X-chromosomes. We demonstrated the connection between the high frequency of cytobands with CNA in the patients' tumors and the efficiency of NAC. We also identified the cytobands, whose CNA are linked to the response to NAC.

  8. Distance Education, Efficiency and Scientific Management: Some Doubts. ESTR Occasional Paper Number 12.

    Science.gov (United States)

    Campion, Mick

    The theme of the 1983 Australian and South Pacific External Studies Association concerned developing efficient teaching-learning systems and efficient management systems. Such an emphasis on efficiency was symptomatic in the United States' educational arena to a commitment to the practices of scientific management. The central role accorded to…

  9. 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.

  10. 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)

  11. Low Working Memory Capacity Impedes both Efficiency and Learning of Number Transcoding in Children

    Science.gov (United States)

    Camos, Valerie

    2008-01-01

    This study aimed to evaluate the impact of individual differences in working memory capacity on number transcoding. A recently proposed model, ADAPT (a developmental asemantic procedural transcoding model), accounts for the development of number transcoding from verbal form to Arabic form by two mechanisms: the learning of new production rules…

  12. Effect of the number of two-wheeled containers at a gathering point on energetic workload and work efficiency

    NARCIS (Netherlands)

    Kuijer, P. Paul F M; Frings-Dresen, Monique H W; Van Der Beek, Allard J.; Van Dieën, Jaap H.; Visser, Bart

    2000-01-01

    The effect of the number of two-wheeled containers at a gathering point on the energetic workload and the work efficiency in refuse collecting was studied. The results showed that the size of the gathering point had no effect on the energetic workload. However, the size of the gathering point had an

  13. 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.

  14. 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.

  15. 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.

  16. Efficient high speed communications over electrical powerlines for a large number of users

    Energy Technology Data Exchange (ETDEWEB)

    Lee, J.; Tripathi, K.; Latchman, H.A. [Florida Univ., Gainesville, FL (United States). Dept. of Electrical and Computer Engineering

    2007-07-01

    Affordable broadband Internet communication is currently available for residential use via cable modem and other forms of digital subscriber lines (DSL). Powerline communication (PLC) systems were never considered seriously for communications due to their low speed and high development cost. However, due to technological advances PLCs are now spreading to local area networks and broadband over power line systems. This paper presented a newly proposed modification to the standard HomePlug 1.0 MAC protocol to make it a constant contention window-based scheme. The HomePlug 1.0 was developed based on orthogonal frequency division multiplexing (OFDM) and carrier sense multiple access with collision avoidance (CSMA/CA). It is currently the most commonly used technology of power line communications, supporting a transmission rate of up to 14 Mbps on the power line. However, the throughput performance of this original scheme becomes critical when the number of users increases. For that reason, a constant contention window based medium access control protocol algorithm of HomePlug 1.0 was proposed under the assumption that the number of active stations is known. An analytical framework based on Markov Chains was developed in order to model this modified protocol under saturation conditions. Modeling results accurately matched the actual performance of the system. This paper revealed that the performance can be improved significantly if the variables were parameterized in terms of the number of active stations. 15 refs., 1 tab., 6 figs.

  17. Numerically Simulated Impact of Gas Prandtl Number and Flow Model on Efficiency of the Machine-less Energetic Separation Device

    Directory of Open Access Journals (Sweden)

    K. S. Egorov

    2015-01-01

    Full Text Available The presented paper regards the influence of one of similarity criteria – the Prandtl number of gas (Pr - on the efficiency of the machine-less energetic separation device (Leontiev pipe, using numerical modeling in ANSYS software. This device, equally as Rank-Hilsch and Hartman-Schprenger pipes, is designed to separate one gas flow into two flows with different temperatures. One flow (supersonic streams out of the pipe with a temperature higher than initial and the other (subsonic flows out with a temperature lower than initial. This direction of energetic separation is true if the Prandtl number is less than 1 that corresponds to gases.The Prandtl number affects the efficiency of running Leontiev pipe indirectly both through a temperature difference on which a temperature recovery factor has an impact and through a thermal conductivity coefficient that shows the impact of heat transfer intensity between gas and solid wall.The Prandtl number range in the course of research was from 0.1 to 0.7. The Prandtl number value equal to 0.7 corresponds to the air or pure gases (for example, inert argon gas. The Prandtl number equal to 0.2 corresponds to the mixtures of inert gases such as helium-xenon.The numerical modeling completed for the supersonic flow with Mach number 2.0 shows that efficiency of the machine-less energetic separation device has been increased approximately 2 times with the Prandtl number decreasing from 0.7 to 0.2. Moreover, for the counter-flow scheme this effect is a little higher due to its larger heat efficiency in comparison with the straight-flow one.Also, the research shows that the main problem for the further increase of the Leontiev pipe efficiency is a small value of thermal conductivity coefficient, which requires an intensification of the heat exchange, especially in the supersonic flow. It can be obtained, for example, by using a system of oblique shock waves in the supersonic channel.

  18. Efficiency of ablative plasma energy transfer into a massive aluminum target using different atomic number ablators

    Czech Academy of Sciences Publication Activity Database

    Kasperczuk, A.; Pisarczyk, T.; Chodukowski, T.; Kalinowska, Z.; Stepniewski, W.; Jach, K.; Swierczynski, R.; Renner, Oldřich; Šmíd, Michal; Ullschmied, Jiří; Cikhart, J.; Klír, D.; Kubeš, P.; Řezáč, K.; Krouský, Eduard; Pfeifer, Miroslav; Skála, Jiří

    2015-01-01

    Roč. 33, č. 3 (2015), s. 379-386 ISSN 0263-0346 R&D Projects: GA MŠk ED1.1.00/02.0061; GA MŠk(CZ) LD14089 EU Projects: European Commission(XE) 284464 - LASERLAB-EUROPE Grant - others:ELI Beamlines(XE) CZ.1.05/1.1.00/02.0061; AVČR(CZ) M100101208 Institutional support: RVO:68378271 ; RVO:61389021 Keywords : ablator atomic number * crater volume * laser energy transfer * plasma ablative pressure Subject RIV: BL - Plasma and Gas Discharge Physics; BH - Optics, Masers, Lasers (UFP-V) Impact factor: 1.649, year: 2015

  19. Efficiency of Human Epiphyseal Chondrocytes with Differential Replication Numbers for Cellular Therapy Products

    Directory of Open Access Journals (Sweden)

    Michiyo Nasu

    2016-01-01

    Full Text Available The cell-based therapy for cartilage or bone requires a large number of cells; serial passages of chondrocytes are, therefore, needed. However, fates of expanded chondrocytes from extra fingers remain unclarified. The chondrocytes from human epiphyses morphologically changed from small polygonal cells to bipolar elongated spindle cells and to large polygonal cells with degeneration at early passages. Gene of type II collagen was expressed in the cells only at a primary culture (Passage 0 and Passage 1 (P1 cells. The nodules by implantation of P0 to P8 cells were composed of cartilage and perichondrium. The cartilage consisted of chondrocytes with round nuclei and type II collagen-positive matrix, and the perichondrium consisted of spindle cells with type I collage-positive matrix. The cartilage and perichondrium developed to bone with marrow cavity through enchondral ossification. Chondrogenesis and osteogenesis by epiphyseal chondrocytes depended on replication number in culture. It is noteworthy to take population doubling level in correlation with pharmaceutical efficacy into consideration when we use chondrocytes for cell-based therapies.

  20. The effect of Reynolds number on the propulsive efficiency of a biomorphic pulsed-jet underwater vehicle

    International Nuclear Information System (INIS)

    Moslemi, Ali A; Krueger, Paul S

    2011-01-01

    The effect of Reynolds number on the propulsive efficiency of pulsed-jet propulsion was studied experimentally on a self-propelled, pulsed-jet underwater vehicle, dubbed Robosquid due to the similarity of its propulsion system with squid. Robosquid was tested for jet slug length-to-diameter ratios (L/D) in the range 2-6 and dimensionless frequency (St L ) in the range 0.2-0.6 in a glycerin-water mixture. Digital particle image velocimetry was used for measuring the impulse and energy of jet pulses from the velocity and vorticity fields of the jet flow to calculate the pulsed-jet propulsive efficiency, and compare it with an equivalent steady jet system. Robosquid's Reynolds number (Re) based on average vehicle velocity and vehicle diameter ranged between 37 and 60. The current results for propulsive efficiency were compared to the previously published results in water where Re ranged between 1300 and 2700. The results showed that the average propulsive efficiency decreased by 26% as the average Re decreased from 2000 to 50 while the ratio of pulsed-jet to steady jet efficiency (η P /η P,ss ) increased up to 0.15 (26%) as the Re decreased over the same range and for similar pulsing conditions. The improved η P /η P,ss at lower Re suggests that pulsed-jet propulsion can be used as an efficient propulsion system for millimeter-scale propulsion applications. The Re = 37-60 conditions in the present investigation, showed a reduced dependence of η P and η P /η P,ss on L/D compared to higher Re results. This may be due to the lack of clearly observed vortex ring pinch-off as L/D increased for this Re regime.

  1. RESEARCHES REGARDING THE INFLUENCE OF THE NUMBER OF CUMULAR CELLS LAYER OVER THE OOCYTE MATURATION EFFICIENCY

    Directory of Open Access Journals (Sweden)

    V. CARABĂ

    2009-05-01

    Full Text Available During the experiments we have carried out with imature oocyte collected from the ovarian follicles, wefound a variety of oocyte-cumulus complexes. We got the following experiment in order to understand therole of cumular cells on the achievement of the cytoplasma and oocyte nucleus maturation. We select theoocyte-cumulus complexes collected both from cows and sows according to the number of cumular celllayers and we watched their development to the blastocyst stade. Thus, we achieved three groups of COC(oocyte-cumulus complexes.One group was made of oocyte without cumular cells, the second group had a layer of cumular cells andthe third group had many layers of cumular cells. we performed an incubation of all these types of COCin TCM-199 enriched with 20% of bovine fetal serum. Because only 1,2 oocyte of the ones who lack thecumular cells layer had maturation signs during cultivation in the thermostat versus 55 and 115,respectively, of the ones that had many cellular layers, presents a solid evidence that cumular cells areindispensable for the maturation and even to the fecundation process. The cumular cells perform adecisive role on the cytoplasma and oocyte nucleus maturation process.

  2. Effects of donor fibroblast cell type and transferred cloned embryo number on the efficiency of pig cloning.

    Science.gov (United States)

    Li, Zicong; Shi, Junsong; Liu, Dewu; Zhou, Rong; Zeng, Haiyu; Zhou, Xiu; Mai, Ranbiao; Zeng, Shaofen; Luo, Lvhua; Yu, Wanxian; Zhang, Shouquan; Wu, Zhenfang

    2013-02-01

    Currently, cloning efficiency in pigs is very low. Donor cell type and number of cloned embryos transferred to an individual surrogate are two major factors that affect the successful rate of somatic cell nuclear transfer (SCNT) in pigs. This study aimed to compare the influence of different donor fibroblast cell types and different transferred embryo numbers on recipients' pregnancy rate and delivery rate, the average number of total clones born, clones born alive and clones born healthy per litter, and the birth rate of healthy clones (=total number of healthy cloned piglets born /total number of transferred cloned embryos). Three types of donor fibroblasts were tested in large-scale production of cloned pigs, including fetal fibroblasts (FFBs) from four genetically similar Western swine breeds of Pietrain (P), Duroc (D), Landrace (L), and Yorkshire (Y), which are referred to as P,D,LY-FFBs, adult fibroblasts (AFBs) from the same four breeds, which are designated P,D,L,Y-AFBs, and AFBs from a Chinese pig breed of Laiwu (LW), which is referred to as LW-AFBs. Within each donor fibroblast cell type group, five transferred cloned embryo number groups were tested. In each embryo number group, 150-199, 200-249, 250-299, 300-349, or 350-450 cloned embryos were transferred to each individual recipient sow. For the entire experiment, 92,005 cloned embryos were generated from nearly 115,000 matured oocytes and transferred to 328 recipients; in total, 488 cloned piglets were produced. The results showed that the mean clones born healthy per litter resulted from transfer of embryos cloned from LW-AFBs (2.53 ± 0.34) was similar with that associated with P,D,L,Y-FFBs (2.72 ± 0.29), but was significantly higher than that resulted from P,D,L,Y-AFBs (1.47 ± 0.18). Use of LW-AFBs as donor cells for SCNT resulted in a significantly higher pregnancy rate (72.00% vs. 59.30% and 48.11%) and delivery rate (60.00% vs. 45.93% and 35.85%) for cloned embryo recipients, and a

  3. Testing random number generators for Monte Carlo applications

    International Nuclear Information System (INIS)

    Sim, L.H.

    1992-01-01

    Central to any system for modelling radiation transport phenomena using Monte Carlo techniques is the method by which pseudo random numbers are generated. This method is commonly referred to as the Random Number Generator (RNG). It is usually a computer implemented mathematical algorithm which produces a series of numbers uniformly distributed on the interval [0,1]. If this series satisfies certain statistical tests for randomness, then for practical purposes the pseudo random numbers in the series can be considered to be random. Tests of this nature are important not only for new RNGs but also to test the implementation of known RNG algorithms in different computer environments. Six RNGs have been tested using six statistical tests and one visual test. The statistical tests are the moments, frequency (digit and number), serial, gap, and poker tests. The visual test is a simple two dimensional ordered pair display. In addition the RNGs have been tested in a specific Monte Carlo application. This type of test is often overlooked, however it is important that in addition to satisfactory performance in statistical tests, the RNG be able to perform effectively in the applications of interest. The RNGs tested here are based on a variety of algorithms, including multiplicative and linear congruential, lagged Fibonacci, and combination arithmetic and lagged Fibonacci. The effect of the Bays-Durham shuffling algorithm on the output of a known bad RNG has also been investigated. 18 refs., 11 tabs., 4 figs. of

  4. 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.

  5. 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)

  6. An efficient reconstruction algorithm for differential phase-contrast tomographic images from a limited number of views

    International Nuclear Information System (INIS)

    Sunaguchi, Naoki; Yuasa, Tetsuya; Gupta, Rajiv; Ando, Masami

    2015-01-01

    The main focus of this paper is reconstruction of tomographic phase-contrast image from a set of projections. We propose an efficient reconstruction algorithm for differential phase-contrast computed tomography that can considerably reduce the number of projections required for reconstruction. The key result underlying this research is a projection theorem that states that the second derivative of the projection set is linearly related to the Laplacian of the tomographic image. The proposed algorithm first reconstructs the Laplacian image of the phase-shift distribution from the second-derivative of the projections using total variation regularization. The second step is to obtain the phase-shift distribution by solving a Poisson equation whose source is the Laplacian image previously reconstructed under the Dirichlet condition. We demonstrate the efficacy of this algorithm using both synthetically generated simulation data and projection data acquired experimentally at a synchrotron. The experimental phase data were acquired from a human coronary artery specimen using dark-field-imaging optics pioneered by our group. Our results demonstrate that the proposed algorithm can reduce the number of projections to approximately 33% as compared with the conventional filtered backprojection method, without any detrimental effect on the image quality

  7. 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.

  8. THE EFFECT OF THE REYNOLDS NUMBER OF AIR FLOW TO THE PARTICLE COLLECTION EFFICIENCY OF A FIBROUS FILTER MEDIUM WITH CYLINDRICAL SECTION

    Directory of Open Access Journals (Sweden)

    George P. Kouropoulos

    2014-01-01

    Full Text Available At this study an attempt for the theoretical approach of the Re ynolds number effect of air flow to the particle collection efficiency of a fibrous fil ter with cylindrical section will be made. Initially, a report of the air filtration models to fibrous filter media will be presented along with an explanation of both the parameters and the physical quantities which govern the air filtration process. Furthermore, the resul ting equation from the mathematical model will be applied to a real filter medium and the characteristic curves of filter efficiency will be drawn. The change of a filter medi um efficiency with regard to the Reynolds number of air flow that passes through the filt er, derived from the curves, will be studied. The general conclusion that we have is that as the Reynolds number of filtered air increases, the collection efficiency of the filter decreases.

  9. Are numbers, size and brightness equally efficient in orienting visual attention? Evidence from an eye-tracking study.

    Directory of Open Access Journals (Sweden)

    Hermann Bulf

    Full Text Available A number of studies have shown strong relations between numbers and oriented spatial codes. For example, perceiving numbers causes spatial shifts of attention depending upon numbers' magnitude, in a way suggestive of a spatially oriented, mental representation of numbers. Here, we investigated whether this phenomenon extends to non-symbolic numbers, as well as to the processing of the continuous dimensions of size and brightness, exploring whether different quantitative dimensions are equally mapped onto space. After a numerical (symbolic Arabic digits or non-symbolic arrays of dots; Experiment 1 or a non-numerical cue (shapes of different size or brightness level; Experiment 2 was presented, participants' saccadic response to a target that could appear either on the left or the right side of the screen was registered using an automated eye-tracker system. Experiment 1 showed that, both in the case of Arabic digits and dot arrays, right targets were detected faster when preceded by large numbers, and left targets were detected faster when preceded by small numbers. Participants in Experiment 2 were faster at detecting right targets when cued by large-sized shapes and left targets when cued by small-sized shapes, whereas brightness cues did not modulate the detection of peripheral targets. These findings indicate that looking at a symbolic or a non-symbolic number induces attentional shifts to a peripheral region of space that is congruent with the numbers' relative position on a mental number line, and that a similar shift in visual attention is induced by looking at shapes of different size. More specifically, results suggest that, while the dimensions of number and size spontaneously map onto an oriented space, the dimension of brightness seems to be independent at a certain level of magnitude elaboration from the dimensions of spatial extent and number, indicating that not all continuous dimensions are equally mapped onto space.

  10. Are numbers, size and brightness equally efficient in orienting visual attention? Evidence from an eye-tracking study.

    Science.gov (United States)

    Bulf, Hermann; Macchi Cassia, Viola; de Hevia, Maria Dolores

    2014-01-01

    A number of studies have shown strong relations between numbers and oriented spatial codes. For example, perceiving numbers causes spatial shifts of attention depending upon numbers' magnitude, in a way suggestive of a spatially oriented, mental representation of numbers. Here, we investigated whether this phenomenon extends to non-symbolic numbers, as well as to the processing of the continuous dimensions of size and brightness, exploring whether different quantitative dimensions are equally mapped onto space. After a numerical (symbolic Arabic digits or non-symbolic arrays of dots; Experiment 1) or a non-numerical cue (shapes of different size or brightness level; Experiment 2) was presented, participants' saccadic response to a target that could appear either on the left or the right side of the screen was registered using an automated eye-tracker system. Experiment 1 showed that, both in the case of Arabic digits and dot arrays, right targets were detected faster when preceded by large numbers, and left targets were detected faster when preceded by small numbers. Participants in Experiment 2 were faster at detecting right targets when cued by large-sized shapes and left targets when cued by small-sized shapes, whereas brightness cues did not modulate the detection of peripheral targets. These findings indicate that looking at a symbolic or a non-symbolic number induces attentional shifts to a peripheral region of space that is congruent with the numbers' relative position on a mental number line, and that a similar shift in visual attention is induced by looking at shapes of different size. More specifically, results suggest that, while the dimensions of number and size spontaneously map onto an oriented space, the dimension of brightness seems to be independent at a certain level of magnitude elaboration from the dimensions of spatial extent and number, indicating that not all continuous dimensions are equally mapped onto space.

  11. 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."

  12. Systematic errors due to linear congruential random-number generators with the Swendsen-Wang algorithm: a warning.

    Science.gov (United States)

    Ossola, Giovanni; Sokal, Alan D

    2004-08-01

    We show that linear congruential pseudo-random-number generators can cause systematic errors in Monte Carlo simulations using the Swendsen-Wang algorithm, if the lattice size is a multiple of a very large power of 2 and one random number is used per bond. These systematic errors arise from correlations within a single bond-update half-sweep. The errors can be eliminated (or at least radically reduced) by updating the bonds in a random order or in an aperiodic manner. It also helps to use a generator of large modulus (e.g., 60 or more bits).

  13. Effect of the number of two-wheeled containers at a gathering point on the energetic workload and work efficiency in refuse collecting

    NARCIS (Netherlands)

    Kuijer, P. Paul F. M.; van der Beek, Allard J.; van Dieën, Jaap H.; Visser, Bart; Frings-Dresen, Monique H. W.

    2002-01-01

    The effect of the number of two-wheeled containers at a gathering point on the energetic workload and the work efficiency in refuse collecting was studied in order to design an optimal gathering point for two-wheeled containers. Three sizes of gathering points were investigated, i.e. with 2, 16 and

  14. Factor-Reduced Human Induced Pluripotent Stem Cells Efficiently Differentiate into Neurons Independent of the Number of Reprogramming Factors

    Directory of Open Access Journals (Sweden)

    Andreas Hermann

    2016-01-01

    Full Text Available Reprogramming of somatic cells into induced pluripotent stem cells (iPSCs by overexpression of the transcription factors OCT4, SOX2, KLF4, and c-Myc holds great promise for the development of personalized cell replacement therapies. In an attempt to minimize the risk of chromosomal disruption and to simplify reprogramming, several studies demonstrated that a reduced set of reprogramming factors is sufficient to generate iPSC. We recently showed that a reduction of reprogramming factors in murine cells not only reduces reprogramming efficiency but also may worsen subsequent differentiation. To prove whether this is also true for human cells, we compared the efficiency of neuronal differentiation of iPSC generated from fetal human neural stem cells with either one (OCT4; hiPSC1F-NSC or two (OCT4, KLF4; hiPSC2F-NSC reprogramming factors with iPSC produced from human fibroblasts using three (hiPSC3F-FIB or four reprogramming factors (hiPSC4F-FIB. After four weeks of coculture with PA6 stromal cells, neuronal differentiation of hiPSC1F-NSC and hiPSC2F-NSC was as efficient as iPSC3F-FIB or iPSC4F-FIB. We conclude that a reduction of reprogramming factors in human cells does reduce reprogramming efficiency but does not alter subsequent differentiation into neural lineages. This is of importance for the development of future application of iPSC in cell replacement therapies.

  15. The effect of the number of transferred embryos, the interval between nuclear transfer and embryo transfer, and the transfer pattern on pig cloning efficiency.

    Science.gov (United States)

    Rim, Chol Ho; Fu, Zhixin; Bao, Lei; Chen, Haide; Zhang, Dan; Luo, Qiong; Ri, Hak Chol; Huang, Hefeng; Luan, Zhidong; Zhang, Yan; Cui, Chun; Xiao, Lei; Jong, Ui Myong

    2013-12-01

    To improve the efficiency of producing cloned pigs, we investigated the influence of the number of transferred embryos, the culturing interval between nuclear transfer (NT) and embryo transfer, and the transfer pattern (single oviduct or double oviduct) on cloning efficiency. The results demonstrated that transfer of either 150-200 or more than 200NT embryos compared to transfer of 100-150 embryos resulted in a significantly higher pregnancy rate (48 ± 16, 50 ± 16 vs. 29 ± 5%, pcloning efficiency is achieved by adjusting the number and in vitro culture time of reconstructed embryos as well as the embryo transfer pattern. Copyright © 2013 Elsevier B.V. All rights reserved.

  16. Estimation of absolute microglial cell numbers in mouse fascia dentata using unbiased and efficient stereological cell counting principles

    DEFF Research Database (Denmark)

    Wirenfeldt, Martin; Dalmau, Ishar; Finsen, Bente

    2003-01-01

    Stereology offers a set of unbiased principles to obtain precise estimates of total cell numbers in a defined region. In terms of microglia, which in the traumatized and diseased CNS is an extremely dynamic cell population, the strength of stereology is that the resultant estimate is unaffected...... of microglia, although with this thickness, the intensity of the staining is too high to distinguish single cells. Lectin histochemistry does not visualize microglia throughout the section and, accordingly, is not suited for the optical fractionator. The mean total number of Mac-1+ microglial cells...... in the unilateral dentate gyrus of the normal young adult male C57BL/6 mouse was estimated to be 12,300 (coefficient of variation (CV)=0.13) with a mean coefficient of error (CE) of 0.06. The perspective of estimating microglial cell numbers using stereology is to establish a solid basis for studying the dynamics...

  17. Octree indexing of DICOM images for voxel number reduction and improvement of Monte Carlo simulation computing efficiency

    International Nuclear Information System (INIS)

    Hubert-Tremblay, Vincent; Archambault, Louis; Tubic, Dragan; Roy, Rene; Beaulieu, Luc

    2006-01-01

    The purpose of the present study is to introduce a compression algorithm for the CT (computed tomography) data used in Monte Carlo simulations. Performing simulations on the CT data implies large computational costs as well as large memory requirements since the number of voxels in such data reaches typically into hundreds of millions voxels. CT data, however, contain homogeneous regions which could be regrouped to form larger voxels without affecting the simulation's accuracy. Based on this property we propose a compression algorithm based on octrees: in homogeneous regions the algorithm replaces groups of voxels with a smaller number of larger voxels. This reduces the number of voxels while keeping the critical high-density gradient area. Results obtained using the present algorithm on both phantom and clinical data show that compression rates up to 75% are possible without losing the dosimetric accuracy of the simulation

  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. Application of the methods of statistical analysis of pseudo-random signals to the interpretation of fields trials on the atmospheric transport of active products and to estimate of confidence limits

    International Nuclear Information System (INIS)

    Olivari, D.

    1984-01-01

    An attempt is made at identifying the most important factors which introduce difficulties in the analysis of results from tests on pollutant dispersal: the unsteadiness of the phenomenon, the effect of external uncontrollable parameters, and the inherent complexity of the problem itself. The basic models for prediction of dispersion of passive contaminants are discussed, and in particular a Lagrangian approach which seems to provide accurate results. For the analysis of results many problems arise. First the need of computing for the results the statistical quantities which describe them: the mean, the variance and higher order moments are important. It is shown that there is no easy solution if the duration and/or the number of independent ''events'' to be analyzed are too limited. The probability density function provides the most useful information, but is not easy to measure. A family of functions is recalled which predict reasonably well the trend of the pdf. Then the role of intermittency is shown in some detail. Its importance cannot be underestimated and its relationship to pdf and the effects on measurements are shown to be rather complex. Finally, an example is made to show the effects of the variance of external factors

  20. Does Pelletizing Catalysts Influence the Efficiency Number of Activity Measurements? Spectrochemical Engineering Considerations for an Accurate Operando Study

    DEFF Research Database (Denmark)

    Rasmussen, Søren Birk; Perez-Ferreras, Susana; Banares, Miguel A.

    2013-01-01

    of, for example, support oxides might take place, which in turn affects the pore size distribution and the porosity of the catalyst, leading to the observation of lower activity values due to decreased catalyst efficiency. This phenomenon can also apply to conventional activity measurements......, in the cases that pelletizing and recrushing of samples are performed to obtain adequate particle size fractions for the catalytic bed. A case study of an operand investigation of a V2O3-WO3/TiO2-sepiolite catalyst is used as an example, and simple calculations of the influence of catalyst activity...... and internal pore diffusion properties are considered in this paper for the evaluation of catalyst performance in, for example, operando reactors. Thus, it is demonstrated that with a pelletizing pressure of...

  1. Efficient DoA Tracking of Variable Number of Moving Stochastic EM Sources in Far-Field Using PNN-MLP Model

    Directory of Open Access Journals (Sweden)

    Zoran Stanković

    2015-01-01

    Full Text Available An efficient neural network-based approach for tracking of variable number of moving electromagnetic (EM sources in far-field is proposed in the paper. Electromagnetic sources considered here are of stochastic radiation nature, mutually uncorrelated, and at arbitrary angular distance. The neural network model is based on combination of probabilistic neural network (PNN and the Multilayer Perceptron (MLP networks and it performs real-time calculations in two stages, determining at first the number of moving sources present in an observed space sector in specific moments in time and then calculating their angular positions in azimuth plane. Once successfully trained, the neural network model is capable of performing an accurate and efficient direction of arrival (DoA estimation within the training boundaries which is illustrated on the appropriate example.

  2. 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".

  3. 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.

  4. Cell-killing efficiency and number of platinum atoms binding to DNA, RNA and protein molecules of HeLa cells treated with combinations of hyperthermia and carboplatin

    International Nuclear Information System (INIS)

    Akaboshi, M.; Kawai, K.; Tanaka, Y.; Takada, J.; Sumino, T.

    1999-01-01

    The effect of hyperthermia on the cell killing efficiency of Pt atoms binding to DNA, RNA and protein molecules of HeLa cells treated with cis-diamine(1,1-cyclobutanedicarboxylato)platinum(II) (CBDCA) was examined. HeLa S-3 cells were treated with 195m Pt-radiolabeled CBDCA for 60 minutes at various temperatures, and the relationship between the lethal effect and the number of Pt atoms binding to DNA, RNA and proteins was examined. The mean lethal concentration (D 0 ) of carboplatin for a 60 min-treatment at 0, 25, 37, 40, 42 and 44 deg C was 671.2, 201.5, 67.3, 33.4, 20.2 and 15.6 μM, respectively. By using identically treated cells, the number of Pt-atoms combined with DNA, RNA and protein molecules were determined in the subcellular fractions. Thus, the D 0 's given as the drug concentrations were replaced with the number of Pt-atoms combined in each fraction. Then, the cell-killing efficiency of the Pt atom was expressed as the reciprocal of the number of Pt-atoms combined and was calculated for each molecule. The efficiency for DNA molecules was 0.699, 1.42, 2.65, 4.84, 7.74 and 8.28x10 4 nucleotides, respectively, for the conditions described above. From 0 to 44 deg C, the cell-killing efficiency of Pt atoms increased by a factor of 11.9. (author)

  5. Stable and efficient retrospective 4D-MRI using non-uniformly distributed quasi-random numbers

    Science.gov (United States)

    Breuer, Kathrin; Meyer, Cord B.; Breuer, Felix A.; Richter, Anne; Exner, Florian; Weng, Andreas M.; Ströhle, Serge; Polat, Bülent; Jakob, Peter M.; Sauer, Otto A.; Flentje, Michael; Weick, Stefan

    2018-04-01

    The purpose of this work is the development of a robust and reliable three-dimensional (3D) Cartesian imaging technique for fast and flexible retrospective 4D abdominal MRI during free breathing. To this end, a non-uniform quasi random (NU-QR) reordering of the phase encoding (k y –k z ) lines was incorporated into 3D Cartesian acquisition. The proposed sampling scheme allocates more phase encoding points near the k-space origin while reducing the sampling density in the outer part of the k-space. Respiratory self-gating in combination with SPIRiT-reconstruction is used for the reconstruction of abdominal data sets in different respiratory phases (4D-MRI). Six volunteers and three patients were examined at 1.5 T during free breathing. Additionally, data sets with conventional two-dimensional (2D) linear and 2D quasi random phase encoding order were acquired for the volunteers for comparison. A quantitative evaluation of image quality versus scan times (from 70 s to 626 s) for the given sampling schemes was obtained by calculating the normalized mutual information (NMI) for all volunteers. Motion estimation was accomplished by calculating the maximum derivative of a signal intensity profile of a transition (e.g. tumor or diaphragm). The 2D non-uniform quasi-random distribution of phase encoding lines in Cartesian 3D MRI yields more efficient undersampling patterns for parallel imaging compared to conventional uniform quasi-random and linear sampling. Median NMI values of NU-QR sampling are the highest for all scan times. Therefore, within the same scan time 4D imaging could be performed with improved image quality. The proposed method allows for the reconstruction of motion artifact reduced 4D data sets with isotropic spatial resolution of 2.1  ×  2.1  ×  2.1 mm3 in a short scan time, e.g. 10 respiratory phases in only 3 min. Cranio-caudal tumor displacements between 23 and 46 mm could be observed. NU-QR sampling enables for stable 4D

  6. A hybrid method of grey relational analysis and data envelopment analysis for evaluating and selecting efficient suppliers plus a novel ranking method for grey numbers

    Directory of Open Access Journals (Sweden)

    Mohsen Sayyah Markabi

    2014-10-01

    Full Text Available Purpose: Evaluation and selection of efficient suppliers is one of the key issues in supply chain management which depends on wide range of qualitative and quantitative criteria. The aim of this research is to develop a mathematical model for evaluating and selecting efficient suppliers when faced with supply and demand uncertainties.Design/methodology/approach: In this research Grey Relational Analysis (GRA and Data Envelopment Analysis (DEA are used to evaluate and select efficient suppliers under uncertainties. Furthermore, a novel ranking method is introduced for the units that their efficiencies are obtained in the form of interval grey numbers.Findings: The study indicates that the proposed model in addition to providing satisfactory and acceptable results avoids time-consuming computations and consequently reduces the solution time. To name another advantage of the proposed model, we can point out that it enables us to make decision based on different levels of risk.Originality/value: The paper presents a mathematical model for evaluating and selecting efficient suppliers in a stochastic environment so that companies can use in order to make better decisions.

  7. Random number generators tested on quantum Monte Carlo simulations.

    Science.gov (United States)

    Hongo, Kenta; Maezono, Ryo; Miura, Kenichi

    2010-08-01

    We have tested and compared several (pseudo) random number generators (RNGs) applied to a practical application, ground state energy calculations of molecules using variational and diffusion Monte Carlo metheds. A new multiple recursive generator with 8th-order recursion (MRG8) and the Mersenne twister generator (MT19937) are tested and compared with the RANLUX generator with five luxury levels (RANLUX-[0-4]). Both MRG8 and MT19937 are proven to give the same total energy as that evaluated with RANLUX-4 (highest luxury level) within the statistical error bars with less computational cost to generate the sequence. We also tested the notorious implementation of linear congruential generator (LCG), RANDU, for comparison. (c) 2010 Wiley Periodicals, Inc.

  8. Application modeling ipv6 (internet protocol version 6) on e-id card for identification number for effectiveness and efficiency of registration process identification of population

    Science.gov (United States)

    Pardede, A. M. H.; Maulita, Y.; Buaton, R.

    2018-03-01

    When someone wants to be registered in an institution such as Birth Certificate, School, Higher Education, e-ID card, Tax, BPJS, Bank, Driving License, Passport and others then have to register and do registration one by one and have registration number or account respectively agency. It may be said that everyone is bothered with the registration process, from the moment of birth must be registered to be registered as a resident, to enter the school must also registration, it is considered ineffective and efficient because one must continue to register one by one and there is repetition of ownership registration number which vary each agency. Seeing these problems need to find a solution or attempt how to keep the affairs of registration is not repetitive and quite once and the number applies to all agencies. The presence of the latest technology that IPv6 brings opportunities for the efficiency and effectiveness of the registration system. The method used in this research is the exploration and modeling of system development with NDLC (Network Development Life Cycle) to produce a model to build IPv6 implementation on e-ID card. The results of the study will show that the public has one registration number.

  9. Efficient collection of peripheral blood stem cells using the Fresenius AS104 in chronic myelocytic leukemia patients with very high numbers of platelets.

    Science.gov (United States)

    Komatsu, F; Ishida, Y

    1997-04-01

    For chronic myelocytic leukemia patients with very high numbers of platelets, we describe an efficient method for the collection of peripheral blood stem cells (PBSC) using the Fresenius AS104 cell separator. In these patients, it is difficult to collect a sufficient number of PBSC, due to the platelet band interfering with the machine's red cell interface sensor. We, therefore, tried a manual adjustment of the device. The collection phase was set automatically. When the whole blood began to separate into the red cell layer and plasma (plus mononuclear cell) layer, the red cell interface setting of "7:1" was changed to "OFF," and the plasma pump flow rate was controlled manually in order to locate the interface position 1 cm from the outside wall of the centrifuge chamber. After the collection phase, the procedure was returned to the automatic setting. By repeating this procedure, we were able to collect large numbers of PBSC.

  10. The binding efficiency of RPA to telomeric G-strands folded into contiguous G-quadruplexes is independent of the number of G4 units.

    Science.gov (United States)

    Lancrey, Astrid; Safa, Layal; Chatain, Jean; Delagoutte, Emmanuelle; Riou, Jean-François; Alberti, Patrizia; Saintomé, Carole

    2018-03-01

    Replication protein A (RPA) is a single-stranded DNA binding protein involved in replication and in telomere maintenance. During telomere replication, G-quadruplexes (G4) can accumulate on the lagging strand template and need to be resolved. It has been shown that human RPA is able to unfold a single G4. Nevertheless, the G-strand of human telomeres is prone to fold into higher-order structures formed by contiguous G-quadruplexes. To understand how RPA deals with these structures, we studied its interaction with telomeric G-strands folding into an increasing number of contiguous G4s. The aim of this study was to determine whether the efficiency of binding/unfolding of hRPA to telomeric G-strands depends on the number of G4 units. Our data show that the number n of contiguous G4 units (n ≥ 2) does not affect the efficiency of hRPA to coat transiently exposed single-stranded telomeric G-strands. This feature may be essential in preventing instability due to G4 structures during telomere replication. Copyright © 2017 Elsevier B.V. and Société Française de Biochimie et Biologie Moléculaire (SFBBM). All rights reserved.

  11. Room temperature PL efficiency of InGaN/GaN quantum well structures with prelayers as a function of number of quantum wells

    International Nuclear Information System (INIS)

    Christian, George M.; Hammersley, Simon; Davies, Matthew J.; Dawson, Philip; Kappers, Menno J.; Massabuau, Fabien C.P.; Oliver, Rachel A.; Humphreys, Colin J.

    2016-01-01

    We report on the effects of varying the number of quantum wells (QWs) in an InGaN/GaN multiple QW (MQW) structure containing a 23 nm thick In0.05Ga0.95N prelayer doped with Si. The calculated conduction and valence bands for the structures show an increasing total electric field across the QWs with increasing number of QWs. This is due to the reduced strength of the surface polarisation field, which opposes the built-in field across the QWs, as its range is increased over thicker samples. Low temperature photoluminescence (PL) measurements show a red shifted QW emission peak energy, which is attributed to the enhanced quantum confined Stark effect with increasing total field strength across the QWs. Low temperature PL time decay measurements and room temperature internal quantum efficiency (IQE) measurements show decreasing radiative recombination rates and decreasing IQE, respectively, with increasing number of QWs. These are attributed to the increased spatial separation of the electron and hole wavefunctions, consistent with the calculated band profiles. It is also shown that, for samples with fewer QWs, the reduction of the total field across the QWs makes the radiative recombination rate sufficiently fast that it is competitive with the efficiency losses associated with the thermal escape of carriers. (copyright 2016 The Authors. Phys. Status Solidi C published by WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim)

  12. 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

  13. Use of a generalized Stokes number to determine the aerodynamic capture efficiency of non-Stokesian particles from a compressible gas flow

    Science.gov (United States)

    Israel, R.; Rosner, D. E.

    1983-01-01

    The aerodynamic capture efficiency of small but nondiffusing particles suspended in a high-speed stream flowing past a target is known to be influenced by parameters governing small particle inertia, departures from the Stokes drag law, and carrier fluid compressibility. By defining an effective Stokes number in terms of the actual (prevailing) particle stopping distance, local fluid viscosity, and inviscid fluid velocity gradient at the target nose, it is shown that these effects are well correlated in terms of a 'standard' (cylindrical collector, Stokes drag, incompressible flow, sq rt Re much greater than 1) capture efficiency curve. Thus, a correlation follows that simplifies aerosol capture calculations in the parameter range already included in previous numerical solutions, allows rational engineering predictions of deposition in situations not previously specifically calculated, and should facilitate the presentation of performance data for gas cleaning equipment and aerosol instruments.

  14. An Efficient Symmetric Searchable Encryption Scheme for Cloud Storage

    Directory of Open Access Journals (Sweden)

    Xiuxiu Jiang

    2017-05-01

    Full Text Available Symmetric searchable encryption for cloud storage enables users to retrieve the documents they want in a privacy-preserving way, which has become a hotspot of research. In this paper, we propose an efficient keyword search scheme over encrypted cloud data. We firstly adopt a structure named as inverted matrix (IM to build search index. The IM is consisted of index vectors, each of which is associated with a keyword. Then we map a keyword to an address used to locate the corresponding index vector. Finally, we mask index vectors with pseudo-random bits to obtain an encrypted enlarged inverted matrix (EEIM. Through the security analysis and experimental evaluation, we demonstrate the privacy and efficiency of our scheme respectively. In addition, we further consider two extended practical search situations, i.e., occurrence queries and dynamic user management, and then give two relevant schemes.

  15. 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

  16. DOE/Industrial Technologies Program DOE Award Number DE-FG36-05GO15099 Plant Wide Energy Efficiency Assessment Pilgrims Pride Corporation – Mt Pleasant Facility

    Energy Technology Data Exchange (ETDEWEB)

    Paper, Riyaz; Dooley, Bill; Turpish, William J; Symonds, Mark; Carswell, Needham

    2007-04-13

    The U. S. Department of Energy’s (DOE) Industrial Technologies Program (ITP), through Oak Ridge National Laboratory, is supporting plant wide energy efficiency assessments that will lead to substantial improvements in industrial efficiency, waste reduction, productivity, and global competitiveness in industries identified in ITP’s Industries of the Future. The stated goal of the assessments is to develop a comprehensive strategy at manufacturing locations that will significantly increase plant productivity, profitability, and energy efficiency, and reduce environmental emissions. ITP awarded a contract to Pilgrim’s Pride Corporation to conduct a plant wide energy efficiency assessment for their Mt Pleasant Facility in Mt Pleasant, Texas. Pilgrim’s Pride Corporation is the largest poultry company in the U.S. and Mexico producing nearly 9 billion pounds of poultry per year. Pilgrim's Pride products are sold to foodservice, retail and frozen entrée customers. Pilgrim's Pride owns and operates 37 chicken processing plants (34 in the U.S. and three in Mexico), 12 prepared foods plants and one turkey processing plant. Thirty-five feed mills and 49 hatcheries support these plants. Pilgrim's Pride is ranked number 382 on 2006's FORTUNE 500 list and net sales were $7.4 billion. In Mt. Pleasant, Texas, Pilgrim's Pride operates one of the largest prepared foods plants in the United States, with the capability of producing 2,000 different products and the capacity to turn out more than 7 million pounds of finished goods per week. The facility is divided into distinct departments: East Kill, West Kill, Prepared Foods, Protein Conversion, Wastewater Treatment, and Truck Shop. Facility processes include killing, eviscerating, refrigeration, baking, frying, and protein conversion. Pilgrim’s Pride formed a team to complete the plant wide energy efficiency assessment. The scope of work for this project was to: provide the analysis of departmental

  17. 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.

  18. 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)

  19. 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.

  20. Disruption of prefoldin-2 protein synthesis in root-knot nematodes via host-mediated gene silencing efficiently reduces nematode numbers and thus protects plants.

    Science.gov (United States)

    Ajjappala, Hemavathi; Chung, Ha Young; Sim, Joon-Soo; Choi, Inchan; Hahn, Bum-Soo

    2015-03-01

    The aim of this study is to demonstrate the feasibility of down-regulating endogeneous prefoldin-2 root-knot nematode transcripts by expressing dsRNA with sequence identity to the nematode gene in tobacco roots under the influence of strong Arabidopsis ubiquitin (UBQ1) promoter. Root-knot nematodes (RKNs) are sedentary endoparasites infecting a wide range of plant species. They parasitise the root system, thereby disrupting water and nutrient uptake and causing major reductions in crop yields. The most reliable means of controlling RKNs is via the use of soil fumigants such as methyl bromide. With the emergence of RNA interference (RNAi) technology, which permits host-mediated nematode gene silencing, a new strategy to control plant pathogens has become available. In the present study, we investigated host-induced RNAi gene silencing of prefoldin-2 in transgenic Nicotiana benthamiana. Reductions in prefoldin-2 mRNA transcript levels were observed when nematodes were soaked in a dsRNA solution in vitro. Furthermore, nematode reproduction was suppressed in RNAi transgenic lines, as evident by reductions in the numbers of root knots (by 34-60 % in independent RNAi lines) and egg masses (by 33-58 %). Endogenous expression of prefoldin-2, analysed via real-time polymerase chain reaction and Western blotting, revealed that the gene was strongly expressed in the pre-parasitic J2 stage. Our observations demonstrate the relevance and potential importance of targeting the prefoldin gene during the nematode life cycle. The work also suggests that further improvements in silencing efficiency in economically important crops can be accomplished using RNAi directed against plant-parasitic nematodes.

  1. 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)

  2. 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.

  3. 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.

  4. [Absolute numbers of peripheral blood CD34+ hematopoietic stem cells prior to a leukapheresis procedure as a parameter predicting the efficiency of stem cell collection].

    Science.gov (United States)

    Galtseva, I V; Davydova, Yu O; Gaponova, T V; Kapranov, N M; Kuzmina, L A; Troitskaya, V V; Gribanova, E O; Kravchenko, S K; Mangasarova, Ya K; Zvonkov, E E; Parovichnikova, E N; Mendeleeva, L P; Savchenko, V G

    To identify a parameter predicting a collection of at least 2·106 CD34+ hematopoietic stem cells (HSC)/kg body weight per leukapheresis (LA) procedure. The investigation included 189 patients with hematological malignancies and 3 HSC donors, who underwent mobilization of stem cells with their subsequent collection by LA. Absolute numbers of peripheral blood leukocytes and CD34+ cells before a LA procedure, as well as a number of CD34+ cells/kg body weight (BW) in the LA product stored on the same day were determined in each patient (donor). There was no correlation between the number of leukocytes and that of stored CD34+ cells/kg BW. There was a close correlation between the count of peripheral blood CD34+ cells prior to LA and that of collected CD34+ cells calculated with reference to kg BW. The optimal absolute blood CD34+ cell count was estimated to 20 per µl, at which a LA procedure makes it possible to collect 2·106 or more CD34+ cells/kg BW.

  5. Portfolio-Scale Optimization of Customer Energy Efficiency Incentive and Marketing: Cooperative Research and Development Final Report, CRADA Number CRD-13-535

    Energy Technology Data Exchange (ETDEWEB)

    Brackney, Larry J. [National Renewable Energy Lab. (NREL), Golden, CO (United States)

    2016-02-17

    North East utility National Grid (NGrid) is developing a portfolio-scale application of OpenStudio designed to optimize incentive and marketing expenditures for their energy efficiency (EE) programs. NGrid wishes to leverage a combination of geographic information systems (GIS), public records, customer data, and content from the Building Component Library (BCL) to form a JavaScript Object Notation (JSON) input file that is consumed by an OpenStudio-based expert system for automated model generation. A baseline model for each customer building will be automatically tuned using electricity and gas consumption data, and a set of energy conservation measures (ECMs) associated with each NGrid incentive program will be applied to the model. The simulated energy performance and return on investment (ROI) will be compared with customer hurdle rates and available incentives to A) optimize the incentive required to overcome the customer hurdle rate and B) determine if marketing activity associated with the specific ECM is warranted for that particular customer. Repeated across their portfolio, this process will enable NGrid to substantially optimize their marketing and incentive expenditures, targeting those customers that will likely adopt and benefit from specific EE programs.

  6. 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)

  7. 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.

  8. 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.

  9. Hupa Numbers.

    Science.gov (United States)

    Bennett, Ruth, Ed.; And Others

    An introduction to the Hupa number system is provided in this workbook, one in a series of numerous materials developed to promote the use of the Hupa language. The book is written in English with Hupa terms used only for the names of numbers. The opening pages present the numbers from 1-10, giving the numeral, the Hupa word, the English word, and…

  10. Triangular Numbers

    Indian Academy of Sciences (India)

    Admin

    Triangular number, figurate num- ber, rangoli, Brahmagupta–Pell equation, Jacobi triple product identity. Figure 1. The first four triangular numbers. Left: Anuradha S Garge completed her PhD from. Pune University in 2008 under the supervision of Prof. S A Katre. Her research interests include K-theory and number theory.

  11. Proth Numbers

    Directory of Open Access Journals (Sweden)

    Schwarzweller Christoph

    2015-02-01

    Full Text Available In this article we introduce Proth numbers and prove two theorems on such numbers being prime [3]. We also give revised versions of Pocklington’s theorem and of the Legendre symbol. Finally, we prove Pepin’s theorem and that the fifth Fermat number is not prime.

  12. Sagan numbers

    OpenAIRE

    Mendonça, J. Ricardo G.

    2012-01-01

    We define a new class of numbers based on the first occurrence of certain patterns of zeros and ones in the expansion of irracional numbers in a given basis and call them Sagan numbers, since they were first mentioned, in a special case, by the North-american astronomer Carl E. Sagan in his science-fiction novel "Contact." Sagan numbers hold connections with a wealth of mathematical ideas. We describe some properties of the newly defined numbers and indicate directions for further amusement.

  13. Eulerian numbers

    CERN Document Server

    Petersen, T Kyle

    2015-01-01

    This text presents the Eulerian numbers in the context of modern enumerative, algebraic, and geometric combinatorics. The book first studies Eulerian numbers from a purely combinatorial point of view, then embarks on a tour of how these numbers arise in the study of hyperplane arrangements, polytopes, and simplicial complexes. Some topics include a thorough discussion of gamma-nonnegativity and real-rootedness for Eulerian polynomials, as well as the weak order and the shard intersection order of the symmetric group. The book also includes a parallel story of Catalan combinatorics, wherein the Eulerian numbers are replaced with Narayana numbers. Again there is a progression from combinatorics to geometry, including discussion of the associahedron and the lattice of noncrossing partitions. The final chapters discuss how both the Eulerian and Narayana numbers have analogues in any finite Coxeter group, with many of the same enumerative and geometric properties. There are four supplemental chapters throughout, ...

  14. Transfinite Numbers

    Indian Academy of Sciences (India)

    Transfinite Numbers. What is Infinity? S M Srivastava. In a series of revolutionary articles written during the last quarter of the nineteenth century, the great Ger- man mathematician Georg Cantor removed the age-old mistrust of infinity and created an exceptionally beau- tiful and useful theory of transfinite numbers. This is.

  15. Chocolate Numbers

    OpenAIRE

    Ji, Caleb; Khovanova, Tanya; Park, Robin; Song, Angela

    2015-01-01

    In this paper, we consider a game played on a rectangular $m \\times n$ gridded chocolate bar. Each move, a player breaks the bar along a grid line. Each move after that consists of taking any piece of chocolate and breaking it again along existing grid lines, until just $mn$ individual squares remain. This paper enumerates the number of ways to break an $m \\times n$ bar, which we call chocolate numbers, and introduces four new sequences related to these numbers. Using various techniques, we p...

  16. Number theory

    CERN Document Server

    Andrews, George E

    1994-01-01

    Although mathematics majors are usually conversant with number theory by the time they have completed a course in abstract algebra, other undergraduates, especially those in education and the liberal arts, often need a more basic introduction to the topic.In this book the author solves the problem of maintaining the interest of students at both levels by offering a combinatorial approach to elementary number theory. In studying number theory from such a perspective, mathematics majors are spared repetition and provided with new insights, while other students benefit from the consequent simpl

  17. 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.

  18. 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.

  19. Nice numbers

    CERN Document Server

    Barnes, John

    2016-01-01

    In this intriguing book, John Barnes takes us on a journey through aspects of numbers much as he took us on a geometrical journey in Gems of Geometry. Similarly originating from a series of lectures for adult students at Reading and Oxford University, this book touches a variety of amusing and fascinating topics regarding numbers and their uses both ancient and modern. The author intrigues and challenges his audience with both fundamental number topics such as prime numbers and cryptography, and themes of daily needs and pleasures such as counting one's assets, keeping track of time, and enjoying music. Puzzles and exercises at the end of each lecture offer additional inspiration, and numerous illustrations accompany the reader. Furthermore, a number of appendices provides in-depth insights into diverse topics such as Pascal’s triangle, the Rubik cube, Mersenne’s curious keyboards, and many others. A theme running through is the thought of what is our favourite number. Written in an engaging and witty sty...

  20. Number names and number understanding

    DEFF Research Database (Denmark)

    Ejersbo, Lisser Rye; Misfeldt, Morten

    2014-01-01

    This paper concerns the results from the first year of a three-year research project involving the relationship between Danish number names and their corresponding digits in the canonical base 10 system. The project aims to develop a system to help the students’ understanding of the base 10 syste...... the Danish number names are more complicated than in other languages. Keywords: A research project in grade 0 and 1th in a Danish school, Base-10 system, two-digit number names, semiotic, cognitive perspectives....

  1. Funny Numbers

    Directory of Open Access Journals (Sweden)

    Theodore M. Porter

    2012-12-01

    Full Text Available The struggle over cure rate measures in nineteenth-century asylums provides an exemplary instance of how, when used for official assessments of institutions, these numbers become sites of contestation. The evasion of goals and corruption of measures tends to make these numbers “funny” in the sense of becoming dis-honest, while the mismatch between boring, technical appearances and cunning backstage manipulations supplies dark humor. The dangers are evident in recent efforts to decentralize the functions of governments and corporations using incen-tives based on quantified targets.

  2. Transcendental numbers

    CERN Document Server

    Murty, M Ram

    2014-01-01

    This book provides an introduction to the topic of transcendental numbers for upper-level undergraduate and graduate students. The text is constructed to support a full course on the subject, including descriptions of both relevant theorems and their applications. While the first part of the book focuses on introducing key concepts, the second part presents more complex material, including applications of Baker’s theorem, Schanuel’s conjecture, and Schneider’s theorem. These later chapters may be of interest to researchers interested in examining the relationship between transcendence and L-functions. Readers of this text should possess basic knowledge of complex analysis and elementary algebraic number theory.

  3. Transfinite Numbers

    Indian Academy of Sciences (India)

    this is a characteristic difference between finite and infinite sets and created an immensely useful branch of mathematics based on this idea which had a great impact on the whole of mathe- matics. For example, the question of what is a number (finite or infinite) is almost a philosophical one. However Cantor's work turned it ...

  4. Experimental Method for Plotting S-N Curve with a Small Number of Specimens

    Directory of Open Access Journals (Sweden)

    Strzelecki Przemysław

    2016-12-01

    Full Text Available The study presents two approaches to plotting an S-N curve based on the experimental results. The first approach is commonly used by researchers and presented in detail in many studies and standard documents. The model uses a linear regression whose parameters are estimated by using the least squares method. A staircase method is used for an unlimited fatigue life criterion. The second model combines the S-N curve defined as a straight line and the record of random occurrence of the fatigue limit. A maximum likelihood method is used to estimate the S-N curve parameters. Fatigue data for C45+C steel obtained in the torsional bending test were used to compare the estimated S-N curves. For pseudo-random numbers generated by using the Mersenne Twister algorithm, the estimated S-N curve for 10 experimental results plotted by using the second model, estimates the fatigue life in the scatter band of the factor 3. The result gives good approximation, especially regarding the time required to plot the S-N curve.

  5. 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.

  6. 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 ...

  7. 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 composite materials where attenuation is high and signal amplitude and bandwidth are at a premium.

  8. 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.

  9. 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.

  10. A novel chaos-based image encryption scheme with an efficient permutation-diffusion mechanism

    Science.gov (United States)

    Ye, Ruisong

    2011-10-01

    This paper proposes a novel chaos-based image encryption scheme with an efficient permutation-diffusion mechanism, in which permuting the positions of image pixels incorporates with changing the gray values of image pixels to confuse the relationship between cipher-image and plain-image. In the permutation process, a generalized Arnold map is utilized to generate one chaotic orbit used to get two index order sequences for the permutation of image pixel positions; in the diffusion process, a generalized Arnold map and a generalized Bernoulli shift map are employed to yield two pseudo-random gray value sequences for a two-way diffusion of gray values. The yielded gray value sequences are not only sensitive to the control parameters and initial conditions of the considered chaotic maps, but also strongly depend on the plain-image processed, therefore the proposed scheme can resist statistical attack, differential attack, known-plaintext as well as chosen-plaintext attack. Experimental results are carried out with detailed analysis to demonstrate that the proposed image encryption scheme possesses large key space to resist brute-force attack as well.

  11. Photon number projection using non-number-resolving detectors

    International Nuclear Information System (INIS)

    Rohde, Peter P; Webb, James G; Huntington, Elanor H; Ralph, Timothy C

    2007-01-01

    Number-resolving photo-detection is necessary for many quantum optics experiments, especially in the application of entangled state preparation. Several schemes have been proposed for approximating number-resolving photo-detection using non-number-resolving detectors. Such techniques include multi-port detection and time-division multiplexing. We provide a detailed analysis and comparison of different number-resolving detection schemes, with a view to creating a useful reference for experimentalists. We show that the ideal architecture for projective measurements is a function of the detector's dark count and efficiency parameters. We also describe a process for selecting an appropriate topology given actual experimental component parameters

  12. Jet Inlet Efficiency

    Science.gov (United States)

    2013-08-08

    AFRL-RW-EG-TR-2014-044 Jet Inlet Efficiency Nigel Plumb Taylor Sykes-Green Keith Williams John Wohleber Munitions Aerodynamics Sciences...CONTRACT NUMBER N/A 5b. GRANT NUMBER N/A 5c. PROGRAM ELEMENT NUMBER N/A 6. AUTHOR(S) Nigel Plumb Taylor Sykes-Green Keith Williams John

  13. Offsetting efficiency

    International Nuclear Information System (INIS)

    Katz, M.

    1995-01-01

    Whichever way the local distribution company (LDC) tries to convert residential customers to gas or expand their use of it, the process itself has become essential for the natural gas industry. The amount of gas used by each residential customer has been decreasing for 25 years -- since the energy crisis of the early 1970s. It's a direct result of better-insulated homes and more-efficient gas appliances, and that trend is continuing. So, LDCs have a choice of either finding new users and uses for gas, or recognizing that their throughput per customer is going to continue declining. The paper discusses strategies that several gas utilities are using to increase the number of gas appliances in the customer's homes. These and other strategies keep the gas industry optimistic about the future of the residential market: A.G.A. has projected that by 2010 demand will expand, from 1994's 5.1 quadrillion Btu (quads) to 5.7 quads, even with continued improvements in appliance efficiency. That estimate, however, will depend on the industry-s utilities and whether they keep converting, proselytizing, persuading and influencing customers to use more natural gas

  14. Number Sense on the Number Line

    Science.gov (United States)

    Woods, Dawn Marie; Ketterlin Geller, Leanne; Basaraba, Deni

    2018-01-01

    A strong foundation in early number concepts is critical for students' future success in mathematics. Research suggests that visual representations, like a number line, support students' development of number sense by helping them create a mental representation of the order and magnitude of numbers. In addition, explicitly sequencing instruction…

  15. FabV/Triclosan Is an Antibiotic-Free and Cost-Effective Selection System for Efficient Maintenance of High and Medium-Copy Number Plasmids in Escherichia coli.

    Science.gov (United States)

    Ali, Syed A; Chew, Yik Wei

    2015-01-01

    Antibiotic resistance genes and antibiotics are frequently used to maintain plasmid vectors in bacterial hosts such as Escherichia coli. Due to the risk of spread of antibiotic resistance, the regulatory authorities discourage the use of antibiotic resistance genes/antibiotics for the maintenance of plasmid vectors in certain biotechnology applications. Overexpression of E. coli endogenous fabI gene and subsequent selection on Triclosan has been proposed as a practical alternative to traditional antibiotic selection systems. Unfortunately, overexpression of fabI cannot be used to select medium-copy number plasmids, typically used for the expression of heterologous proteins in E. coli. Here we report that Vibrio cholera FabV, a functional homologue of E. coli FabI, can be used as a suitable marker for the selection and maintenance of both high and medium-copy number plasmid vectors in E. coli.

  16. The Super Patalan Numbers

    OpenAIRE

    Richardson, Thomas M.

    2014-01-01

    We introduce the super Patalan numbers, a generalization of the super Catalan numbers in the sense of Gessel, and prove a number of properties analagous to those of the super Catalan numbers. The super Patalan numbers generalize the super Catalan numbers similarly to how the Patalan numbers generalize the Catalan numbers.

  17. 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...

  18. Efficient STFT

    International Nuclear Information System (INIS)

    Aamir, K.M.; Maud, M.A.

    2004-01-01

    Small perturbations in signals (or any time series), at some particular instant, affect the whole frequency spectrum due to the global function e/sup j omega t/ in Fourier Transform formulation. However, the Fourier spectrum does not convey the time instant at which the perturbation occurred. Consequently the information on the particular time instance of occurrence of that perturbation is lost when spectrum is observed. Apparently Fourier analysis seems to be inadequate in such situations. This inadequacy is overcome by the use of Short Time Fourier Transform (STFT), which keeps track of time as well as frequency information. In STFT analysis, a fixed length window, say of length N, is moved sample by sample as the data arrives. The Discrete Fourier Transform (DFT) of this fixed window of length N is calculated using Fast Fourier Transform (FFT) algorithm. If the total number of points is M > N, the computational complexity of this scheme works out to be at least ((M-N) N log/sub 2/N). On the other hand, STFT is shown to be of computational complexity 6NM and 8NM in the literature. In this paper, two algorithms are presented which compute the same STFT more efficiently. The computational complexity of the proposed algorithms works out to be MN of one algorithm and even lesser in the other algorithm. This reduction in complexity becomes significant for large data sets. This algorithm also remains valid if a stationary part of signal is skipped. (author)

  19. Energy efficiency

    International Nuclear Information System (INIS)

    2010-01-01

    After a speech of the CEA's (Commissariat a l'Energie Atomique) general administrator about energy efficiency as a first rank challenge for the planet and for France, this publications proposes several contributions: a discussion of the efficiency of nuclear energy, an economic analysis of R and D's value in the field of fourth generation fast reactors, discussions about biofuels and the relationship between energy efficiency and economic competitiveness, and a discussion about solar photovoltaic efficiency

  20. Number words and number symbols a cultural history of numbers

    CERN Document Server

    Menninger, Karl

    1992-01-01

    Classic study discusses number sequence and language and explores written numerals and computations in many cultures. "The historian of mathematics will find much to interest him here both in the contents and viewpoint, while the casual reader is likely to be intrigued by the author's superior narrative ability.

  1. Generation of photon number states

    International Nuclear Information System (INIS)

    Waks, Edo; Diamanti, Eleni; Yamamoto, Yoshihisa

    2006-01-01

    The visible light photon counter (VLPC) has the capability to discriminate photon number states, in contrast to conventional photon counters which can only detect the presence or absence of photons. We use this capability, along with the process of parametric down-conversion, to generate photon number states. We experimentally demonstrate generation of states containing 1, 2, 3 and 4 photons with high fidelity. We then explore the effect the detection efficiency of the VLPC has on the generation rate and fidelity of the created states

  2. Diamond Fuzzy Number

    Directory of Open Access Journals (Sweden)

    T. Pathinathan

    2015-01-01

    Full Text Available In this paper we define diamond fuzzy number with the help of triangular fuzzy number. We include basic arithmetic operations like addition, subtraction of diamond fuzzy numbers with examples. We define diamond fuzzy matrix with some matrix properties. We have defined Nested diamond fuzzy number and Linked diamond fuzzy number. We have further classified Right Linked Diamond Fuzzy number and Left Linked Diamond Fuzzy number. Finally we have verified the arithmetic operations for the above mentioned types of Diamond Fuzzy Numbers.

  3. Those fascinating numbers

    CERN Document Server

    Koninck, Jean-Marie De

    2009-01-01

    Who would have thought that listing the positive integers along with their most remarkable properties could end up being such an engaging and stimulating adventure? The author uses this approach to explore elementary and advanced topics in classical number theory. A large variety of numbers are contemplated: Fermat numbers, Mersenne primes, powerful numbers, sublime numbers, Wieferich primes, insolite numbers, Sastry numbers, voracious numbers, to name only a few. The author also presents short proofs of miscellaneous results and constantly challenges the reader with a variety of old and new n

  4. Building Numbers from Primes

    Science.gov (United States)

    Burkhart, Jerry

    2009-01-01

    Prime numbers are often described as the "building blocks" of natural numbers. This article shows how the author and his students took this idea literally by using prime factorizations to build numbers with blocks. In this activity, students explore many concepts of number theory, including the relationship between greatest common factors and…

  5. Introduction to number theory

    CERN Document Server

    Vazzana, Anthony; Garth, David

    2007-01-01

    One of the oldest branches of mathematics, number theory is a vast field devoted to studying the properties of whole numbers. Offering a flexible format for a one- or two-semester course, Introduction to Number Theory uses worked examples, numerous exercises, and two popular software packages to describe a diverse array of number theory topics.

  6. On the number of special numbers

    Indian Academy of Sciences (India)

    without loss of any generality to be the first k primes), then the equation a + b = c has .... This is an elementary exercise in partial summation (see [12]). Thus ... This is easily done by inserting a stronger form of the prime number theorem into the.

  7. RANDOMNESS of Numbers DEFINITION(QUERY:WHAT? V HOW?) ONLY Via MAXWELL-BOLTZMANN CLASSICAL-Statistics(MBCS) Hot-Plasma VS. Digits-Clumping Log-Law NON-Randomness Inversion ONLY BOSE-EINSTEIN QUANTUM-Statistics(BEQS) .

    Science.gov (United States)

    Siegel, Z.; Siegel, Edward Carl-Ludwig

    2011-03-01

    RANDOMNESS of Numbers cognitive-semantics DEFINITION VIA Cognition QUERY: WHAT???, NOT HOW?) VS. computer-``science" mindLESS number-crunching (Harrel-Sipser-...) algorithmics Goldreich "PSEUDO-randomness"[Not.AMS(02)] mea-culpa is ONLY via MAXWELL-BOLTZMANN CLASSICAL-STATISTICS(NOT FDQS!!!) "hot-plasma" REPULSION VERSUS Newcomb(1881)-Weyl(1914;1916)-Benford(1938) "NeWBe" logarithmic-law digit-CLUMPING/ CLUSTERING NON-Randomness simple Siegel[AMS Joint.Mtg.(02)-Abs. # 973-60-124] algebraic-inversion to THE QUANTUM and ONLY BEQS preferentially SEQUENTIALLY lower-DIGITS CLUMPING/CLUSTERING with d = 0 BEC, is ONLY VIA Siegel-Baez FUZZYICS=CATEGORYICS (SON OF TRIZ)/"Category-Semantics"(C-S), latter intersection/union of Lawvere(1964)-Siegel(1964)] category-theory (matrix: MORPHISMS V FUNCTORS) "+" cognitive-semantics'' (matrix: ANTONYMS V SYNONYMS) yields Siegel-Baez FUZZYICS=CATEGORYICS/C-S tabular list-format matrix truth-table analytics: MBCS RANDOMNESS TRUTH/EMET!!!

  8. Pseudo-random neutron time-of-flight spectroscopy using a Van de Graaff accelerator as neutron source

    International Nuclear Information System (INIS)

    Duquesne, Henry; Schmitt, Andre; Poussot, Rene; Pelicier, Henri.

    1976-05-01

    The classical experiments of neutron time-of-flight spectrometry on bulk multiplying media are using recurrent neutron bursts from a linear accelerator. The adaptation of the ion beam issued from the Cadarache Van de Graaff accelerator is described with the test experiments which were effected. Both methods are compared with respect to the accuracy obtained, the energy resolution and the time consumed [fr

  9. Identification of some cross flow heat exchanger dynamic responses by measurement with low level binary pseudo-random input signals

    International Nuclear Information System (INIS)

    Corran, E.R.; Cummins, J.D.; Hopkinson, A.

    1964-02-01

    An experiment was performed to assess the usefulness of the binary cross-correlation method in the context of the identification problem. An auxiliary burner was excited with a discrete interval binary code and the response to the perturbation of the input heat was observed by recording the variations of the primary inlet, primary outlet and secondary outlet temperatures. The observations were analysed to yield cross-correlation functions and frequency responses were subsequently determined between primary inlet and primary outlet temperatures and also between primary inlet and secondary outlet temperatures. The analysis verified (1) that these dynamic responses of this cross flow heat exchanger may be predicted theoretically, (2) in so far as this heat exchanger is representative of the generality of plant, that the binary cross-correlation method provides adequate identification of plant dynamics for control purposes in environments where small input variations and low signal to noise ratio are obligatory. (author)

  10. p-adic numbers

    OpenAIRE

    Grešak, Rozalija

    2015-01-01

    The field of real numbers is usually constructed using Dedekind cuts. In these thesis we focus on the construction of the field of real numbers using metric completion of rational numbers using Cauchy sequences. In a similar manner we construct the field of p-adic numbers, describe some of their basic and topological properties. We follow by a construction of complex p-adic numbers and we compare them with the ordinary complex numbers. We conclude the thesis by giving a motivation for the int...

  11. On the number of special numbers

    Indian Academy of Sciences (India)

    We now apply the theory of the Thue equation to obtain an effective bound on m. Indeed, by Lemma 3.2, we can write m2 = ba3 and m2 − 4 = cd3 with b, c cubefree. By the above, both b, c are bounded since they are cubefree and all their prime factors are less than e63727. Now we have a finite number of. Thue equations:.

  12. Number projection method

    International Nuclear Information System (INIS)

    Kaneko, K.

    1987-01-01

    A relationship between the number projection and the shell model methods is investigated in the case of a single-j shell. We can find a one-to-one correspondence between the number projected and the shell model states

  13. Numbers and brains.

    Science.gov (United States)

    Gallistel, C R

    2017-12-01

    The representation of discrete and continuous quantities appears to be ancient and pervasive in animal brains. Because numbers are the natural carriers of these representations, we may discover that in brains, it's numbers all the way down.

  14. Juggling Efficiency

    DEFF Research Database (Denmark)

    Andersen, Rikke Sand; Vedsted, Peter

    2015-01-01

    on institutional logics, we illustrate how a logic of efficiency organise and give shape to healthcare seeking practices as they manifest in local clinical settings. Overall, patient concerns are reconfigured to fit the local clinical setting and healthcare professionals and patients are required to juggle...... efficiency in order to deal with uncertainties and meet more complex or unpredictable needs. Lastly, building on the empirical case of cancer diagnostics, we discuss the implications of the pervasiveness of the logic of efficiency in the clinical setting and argue that provision of medical care in today......'s primary care settings requires careful balancing of increasing demands of efficiency, greater complexity of biomedical knowledge and consideration for individual patient needs....

  15. Number in Dinka

    DEFF Research Database (Denmark)

    Andersen, Torben

    2014-01-01

    had a marked singular and an unmarked plural. Synchronically, however, the singular is arguably the basic member of the number category as revealed by the use of the two numbers. In addition, some nouns have a collective form, which is grammatically singular. Number also plays a role...

  16. Safety-in-numbers

    DEFF Research Database (Denmark)

    Elvik, Rune; Bjørnskau, Torkel

    2017-01-01

    Highlights •26 studies of the safety-in-numbers effect are reviewed. •The existence of a safety-in-numbers effect is confirmed. •Results are consistent. •Causes of the safety-in-numbers effect are incompletely known....

  17. Discovery: Prime Numbers

    Science.gov (United States)

    de Mestre, Neville

    2008-01-01

    Prime numbers are important as the building blocks for the set of all natural numbers, because prime factorisation is an important and useful property of all natural numbers. Students can discover them by using the method known as the Sieve of Eratosthenes, named after the Greek geographer and astronomer who lived from c. 276-194 BC. Eratosthenes…

  18. Asymptotic numbers: Pt.1

    International Nuclear Information System (INIS)

    Todorov, T.D.

    1980-01-01

    The set of asymptotic numbers A as a system of generalized numbers including the system of real numbers R, as well as infinitely small (infinitesimals) and infinitely large numbers, is introduced. The detailed algebraic properties of A, which are unusual as compared with the known algebraic structures, are studied. It is proved that the set of asymptotic numbers A cannot be isomorphically embedded as a subspace in any group, ring or field, but some particular subsets of asymptotic numbers are shown to be groups, rings, and fields. The algebraic operation, additive and multiplicative forms, and the algebraic properties are constructed in an appropriate way. It is shown that the asymptotic numbers give rise to a new type of generalized functions quite analogous to the distributions of Schwartz allowing, however, the operation multiplication. A possible application of these functions to quantum theory is discussed

  19. 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...

  20. Cataloging Efficiency and Effectiveness.

    Science.gov (United States)

    McCain, Cheryl; Shorten, Jay

    2002-01-01

    Reports on a survey of academic libraries that was conducted to supplement findings of cost studies by providing measures of efficiency and effectiveness for cataloging departments based on reported productivity, number of staff, task distribution, and quality measures including backlogs, authority control, and database maintenance. Identifies…

  1. Merging {DBMs} Efficiently

    DEFF Research Database (Denmark)

    David, Alexandre

    2005-01-01

    In this paper we present different algorithms to reduce the number of DBMs in federations by merging them. Federations are unions of DBMs and are used to represent non-convex zones. Inclusion checking between DBMs is a limited technique to reduce the size of federations and how to choose some DBMs...... to merge them into a larger one is a combi-natorial problem. We present a number of simple but efficient techniques to avoid searching the combinations while still being able to merge any number of DBMs...

  2. Predicting Lotto Numbers

    DEFF Research Database (Denmark)

    Jørgensen, Claus Bjørn; Suetens, Sigrid; Tyran, Jean-Robert

    numbers based on recent drawings. While most players pick the same set of numbers week after week without regards of numbers drawn or anything else, we find that those who do change, act on average in the way predicted by the law of small numbers as formalized in recent behavioral theory. In particular......We investigate the “law of small numbers” using a unique panel data set on lotto gambling. Because we can track individual players over time, we can measure how they react to outcomes of recent lotto drawings. We can therefore test whether they behave as if they believe they can predict lotto......, on average they move away from numbers that have recently been drawn, as suggested by the “gambler’s fallacy”, and move toward numbers that are on streak, i.e. have been drawn several weeks in a row, consistent with the “hot hand fallacy”....

  3. Invitation to number theory

    CERN Document Server

    Ore, Oystein

    2017-01-01

    Number theory is the branch of mathematics concerned with the counting numbers, 1, 2, 3, … and their multiples and factors. Of particular importance are odd and even numbers, squares and cubes, and prime numbers. But in spite of their simplicity, you will meet a multitude of topics in this book: magic squares, cryptarithms, finding the day of the week for a given date, constructing regular polygons, pythagorean triples, and many more. In this revised edition, John Watkins and Robin Wilson have updated the text to bring it in line with contemporary developments. They have added new material on Fermat's Last Theorem, the role of computers in number theory, and the use of number theory in cryptography, and have made numerous minor changes in the presentation and layout of the text and the exercises.

  4. Improving efficiency in stereology

    DEFF Research Database (Denmark)

    Keller, Kresten Krarup; Andersen, Ina Trolle; Andersen, Johnnie Bremholm

    2013-01-01

    of the study was to investigate the time efficiency of the proportionator and the autodisector on virtual slides compared with traditional methods in a practical application, namely the estimation of osteoclast numbers in paws from mice with experimental arthritis and control mice. Tissue slides were scanned......, a proportionator sampling and a systematic, uniform random sampling were simulated. We found that the proportionator was 50% to 90% more time efficient than systematic, uniform random sampling. The time efficiency of the autodisector on virtual slides was 60% to 100% better than the disector on tissue slides. We...... conclude that both the proportionator and the autodisector on virtual slides may improve efficiency of cell counting in stereology....

  5. Batch efficiency

    Energy Technology Data Exchange (ETDEWEB)

    Schwickerath, Ulrich; Silva, Ricardo; Uria, Christian, E-mail: Ulrich.Schwickerath@cern.c, E-mail: Ricardo.Silva@cern.c [CERN IT, 1211 Geneve 23 (Switzerland)

    2010-04-01

    A frequent source of concern for resource providers is the efficient use of computing resources in their centers. This has a direct impact on requests for new resources. There are two different but strongly correlated aspects to be considered: while users are mostly interested in a good turn-around time for their jobs, resource providers are mostly interested in a high and efficient usage of their available resources. Both things, the box usage and the efficiency of individual user jobs, need to be closely monitored so that the sources of the inefficiencies can be identified. At CERN, the Lemon monitoring system is used for both purposes. Examples of such sources are poorly written user code, inefficient access to mass storage systems, and dedication of resources to specific user groups. As a first step for improvements CERN has launched a project to develop a scheduler add-on that allows careful overloading of worker nodes that run idle jobs.

  6. The adventure of numbers

    CERN Document Server

    Godefroy, Gilles

    2004-01-01

    Numbers are fascinating. The fascination begins in childhood, when we first learn to count. It continues as we learn arithmetic, algebra, geometry, and so on. Eventually, we learn that numbers not only help us to measure the world, but also to understand it and, to some extent, to control it. In The Adventure of Numbers, Gilles Godefroy follows the thread of our expanding understanding of numbers to lead us through the history of mathematics. His goal is to share the joy of discovering and understanding this great adventure of the mind. The development of mathematics has been punctuated by a n

  7. Predicting Lotto Numbers

    DEFF Research Database (Denmark)

    Suetens, Sigrid; Galbo-Jørgensen, Claus B.; Tyran, Jean-Robert Karl

    2016-01-01

    We investigate the ‘law of small numbers’ using a data set on lotto gambling that allows us to measure players’ reactions to draws. While most players pick the same set of numbers week after week, we find that those who do change react on average as predicted by the law of small numbers...... as formalized in recent behavioral theory. In particular, players tend to bet less on numbers that have been drawn in the preceding week, as suggested by the ‘gambler’s fallacy’, and bet more on a number if it was frequently drawn in the recent past, consistent with the ‘hot-hand fallacy’....

  8. Beurling generalized numbers

    CERN Document Server

    Diamond, Harold G; Cheung, Man Ping

    2016-01-01

    "Generalized numbers" is a multiplicative structure introduced by A. Beurling to study how independent prime number theory is from the additivity of the natural numbers. The results and techniques of this theory apply to other systems having the character of prime numbers and integers; for example, it is used in the study of the prime number theorem (PNT) for ideals of algebraic number fields. Using both analytic and elementary methods, this book presents many old and new theorems, including several of the authors' results, and many examples of extremal behavior of g-number systems. Also, the authors give detailed accounts of the L^2 PNT theorem of J. P. Kahane and of the example created with H. L. Montgomery, showing that additive structure is needed for proving the Riemann hypothesis. Other interesting topics discussed are propositions "equivalent" to the PNT, the role of multiplicative convolution and Chebyshev's prime number formula for g-numbers, and how Beurling theory provides an interpretation of the ...

  9. Intuitive numbers guide decisions

    Directory of Open Access Journals (Sweden)

    Ellen Peters

    2008-12-01

    Full Text Available Measuring reaction times to number comparisons is thought to reveal a processing stage in elementary numerical cognition linked to internal, imprecise representations of number magnitudes. These intuitive representations of the mental number line have been demonstrated across species and human development but have been little explored in decision making. This paper develops and tests hypotheses about the influence of such evolutionarily ancient, intuitive numbers on human decisions. We demonstrate that individuals with more precise mental-number-line representations are higher in numeracy (number skills consistent with previous research with children. Individuals with more precise representations (compared to those with less precise representations also were more likely to choose larger, later amounts over smaller, immediate amounts, particularly with a larger proportional difference between the two monetary outcomes. In addition, they were more likely to choose an option with a larger proportional but smaller absolute difference compared to those with less precise representations. These results are consistent with intuitive number representations underlying: a perceived differences between numbers, b the extent to which proportional differences are weighed in decisions, and, ultimately, c the valuation of decision options. Human decision processes involving numbers important to health and financial matters may be rooted in elementary, biological processes shared with other species.

  10. Numbers, sequences and series

    CERN Document Server

    Hirst, Keith

    1994-01-01

    Number and geometry are the foundations upon which mathematics has been built over some 3000 years. This book is concerned with the logical foundations of number systems from integers to complex numbers. The author has chosen to develop the ideas by illustrating the techniques used throughout mathematics rather than using a self-contained logical treatise. The idea of proof has been emphasised, as has the illustration of concepts from a graphical, numerical and algebraic point of view. Having laid the foundations of the number system, the author has then turned to the analysis of infinite proc

  11. Templates, Numbers & Watercolors.

    Science.gov (United States)

    Clemesha, David J.

    1990-01-01

    Describes how a second-grade class used large templates to draw and paint five-digit numbers. The lesson integrated artistic knowledge and vocabulary with their mathematics lesson in place value. Students learned how draftspeople use templates, and they studied number paintings by Charles Demuth and Jasper Johns. (KM)

  12. 47 CFR 52.11 - North American Numbering Council.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 3 2010-10-01 2010-10-01 false North American Numbering Council. 52.11 Section... recommendations, reached through consensus, that foster efficient and impartial number administration; (c) Initially resolving disputes, through consensus, that foster efficient and impartial number administration...

  13. Residual number processing in dyscalculia.

    Science.gov (United States)

    Cappelletti, Marinella; Price, Cathy J

    2014-01-01

    Developmental dyscalculia - a congenital learning disability in understanding numerical concepts - is typically associated with parietal lobe abnormality. However, people with dyscalculia often retain some residual numerical abilities, reported in studies that otherwise focused on abnormalities in the dyscalculic brain. Here we took a different perspective by focusing on brain regions that support residual number processing in dyscalculia. All participants accurately performed semantic and categorical colour-decision tasks with numerical and non-numerical stimuli, with adults with dyscalculia performing slower than controls in the number semantic tasks only. Structural imaging showed less grey-matter volume in the right parietal cortex in people with dyscalculia relative to controls. Functional MRI showed that accurate number semantic judgements were maintained by parietal and inferior frontal activations that were common to adults with dyscalculia and controls, with higher activation for participants with dyscalculia than controls in the right superior frontal cortex and the left inferior frontal sulcus. Enhanced activation in these frontal areas was driven by people with dyscalculia who made faster rather than slower numerical decisions; however, activation could not be accounted for by response times per se, because it was greater for fast relative to slow dyscalculics but not greater for fast controls relative to slow dyscalculics. In conclusion, our results reveal two frontal brain regions that support efficient number processing in dyscalculia.

  14. Residual number processing in dyscalculia

    Directory of Open Access Journals (Sweden)

    Marinella Cappelletti

    2014-01-01

    Full Text Available Developmental dyscalculia – a congenital learning disability in understanding numerical concepts – is typically associated with parietal lobe abnormality. However, people with dyscalculia often retain some residual numerical abilities, reported in studies that otherwise focused on abnormalities in the dyscalculic brain. Here we took a different perspective by focusing on brain regions that support residual number processing in dyscalculia. All participants accurately performed semantic and categorical colour-decision tasks with numerical and non-numerical stimuli, with adults with dyscalculia performing slower than controls in the number semantic tasks only. Structural imaging showed less grey-matter volume in the right parietal cortex in people with dyscalculia relative to controls. Functional MRI showed that accurate number semantic judgements were maintained by parietal and inferior frontal activations that were common to adults with dyscalculia and controls, with higher activation for participants with dyscalculia than controls in the right superior frontal cortex and the left inferior frontal sulcus. Enhanced activation in these frontal areas was driven by people with dyscalculia who made faster rather than slower numerical decisions; however, activation could not be accounted for by response times per se, because it was greater for fast relative to slow dyscalculics but not greater for fast controls relative to slow dyscalculics. In conclusion, our results reveal two frontal brain regions that support efficient number processing in dyscalculia.

  15. Residual number processing in dyscalculia☆

    Science.gov (United States)

    Cappelletti, Marinella; Price, Cathy J.

    2013-01-01

    Developmental dyscalculia – a congenital learning disability in understanding numerical concepts – is typically associated with parietal lobe abnormality. However, people with dyscalculia often retain some residual numerical abilities, reported in studies that otherwise focused on abnormalities in the dyscalculic brain. Here we took a different perspective by focusing on brain regions that support residual number processing in dyscalculia. All participants accurately performed semantic and categorical colour-decision tasks with numerical and non-numerical stimuli, with adults with dyscalculia performing slower than controls in the number semantic tasks only. Structural imaging showed less grey-matter volume in the right parietal cortex in people with dyscalculia relative to controls. Functional MRI showed that accurate number semantic judgements were maintained by parietal and inferior frontal activations that were common to adults with dyscalculia and controls, with higher activation for participants with dyscalculia than controls in the right superior frontal cortex and the left inferior frontal sulcus. Enhanced activation in these frontal areas was driven by people with dyscalculia who made faster rather than slower numerical decisions; however, activation could not be accounted for by response times per se, because it was greater for fast relative to slow dyscalculics but not greater for fast controls relative to slow dyscalculics. In conclusion, our results reveal two frontal brain regions that support efficient number processing in dyscalculia. PMID:24266008

  16. Random number generation

    International Nuclear Information System (INIS)

    Coveyou, R.R.

    1974-01-01

    The subject of random number generation is currently controversial. Differing opinions on this subject seem to stem from implicit or explicit differences in philosophy; in particular, from differing ideas concerning the role of probability in the real world of physical processes, electronic computers, and Monte Carlo calculations. An attempt is made here to reconcile these views. The role of stochastic ideas in mathematical models is discussed. In illustration of these ideas, a mathematical model of the use of random number generators in Monte Carlo calculations is constructed. This model is used to set up criteria for the comparison and evaluation of random number generators. (U.S.)

  17. Algebraic number theory

    CERN Document Server

    Weiss, Edwin

    1998-01-01

    Careful organization and clear, detailed proofs characterize this methodical, self-contained exposition of basic results of classical algebraic number theory from a relatively modem point of view. This volume presents most of the number-theoretic prerequisites for a study of either class field theory (as formulated by Artin and Tate) or the contemporary treatment of analytical questions (as found, for example, in Tate's thesis).Although concerned exclusively with algebraic number fields, this treatment features axiomatic formulations with a considerable range of applications. Modem abstract te

  18. Advanced number theory

    CERN Document Server

    Cohn, Harvey

    1980-01-01

    ""A very stimulating book ... in a class by itself."" - American Mathematical MonthlyAdvanced students, mathematicians and number theorists will welcome this stimulating treatment of advanced number theory, which approaches the complex topic of algebraic number theory from a historical standpoint, taking pains to show the reader how concepts, definitions and theories have evolved during the last two centuries. Moreover, the book abounds with numerical examples and more concrete, specific theorems than are found in most contemporary treatments of the subject.The book is divided into three parts

  19. The emergence of number

    CERN Document Server

    Crossley, John N

    1987-01-01

    This book presents detailed studies of the development of three kinds of number. In the first part the development of the natural numbers from Stone-Age times right up to the present day is examined not only from the point of view of pure history but also taking into account archaeological, anthropological and linguistic evidence. The dramatic change caused by the introduction of logical theories of number in the 19th century is also treated and this part ends with a non-technical account of the very latest developments in the area of Gödel's theorem. The second part is concerned with the deve

  20. Professor Stewart's incredible numbers

    CERN Document Server

    Stewart, Ian

    2015-01-01

    Ian Stewart explores the astonishing properties of numbers from 1 to10 to zero and infinity, including one figure that, if you wrote it out, would span the universe. He looks at every kind of number you can think of - real, imaginary, rational, irrational, positive and negative - along with several you might have thought you couldn't think of. He explains the insights of the ancient mathematicians, shows how numbers have evolved through the ages, and reveals the way numerical theory enables everyday life. Under Professor Stewart's guidance you will discover the mathematics of codes,

  1. Fundamentals of number theory

    CERN Document Server

    LeVeque, William J

    1996-01-01

    This excellent textbook introduces the basics of number theory, incorporating the language of abstract algebra. A knowledge of such algebraic concepts as group, ring, field, and domain is not assumed, however; all terms are defined and examples are given - making the book self-contained in this respect.The author begins with an introductory chapter on number theory and its early history. Subsequent chapters deal with unique factorization and the GCD, quadratic residues, number-theoretic functions and the distribution of primes, sums of squares, quadratic equations and quadratic fields, diopha

  2. Numbers and computers

    CERN Document Server

    Kneusel, Ronald T

    2015-01-01

    This is a book about numbers and how those numbers are represented in and operated on by computers. It is crucial that developers understand this area because the numerical operations allowed by computers, and the limitations of those operations, especially in the area of floating point math, affect virtually everything people try to do with computers. This book aims to fill this gap by exploring, in sufficient but not overwhelming detail, just what it is that computers do with numbers. Divided into two parts, the first deals with standard representations of integers and floating point numb

  3. Elementary theory of numbers

    CERN Document Server

    Sierpinski, Waclaw

    1988-01-01

    Since the publication of the first edition of this work, considerable progress has been made in many of the questions examined. This edition has been updated and enlarged, and the bibliography has been revised.The variety of topics covered here includes divisibility, diophantine equations, prime numbers (especially Mersenne and Fermat primes), the basic arithmetic functions, congruences, the quadratic reciprocity law, expansion of real numbers into decimal fractions, decomposition of integers into sums of powers, some other problems of the additive theory of numbers and the theory of Gaussian

  4. On powerful numbers

    Directory of Open Access Journals (Sweden)

    R. A. Mollin

    1986-01-01

    Full Text Available A powerful number is a positive integer n satisfying the property that p2 divides n whenever the prime p divides n; i.e., in the canonical prime decomposition of n, no prime appears with exponent 1. In [1], S.W. Golomb introduced and studied such numbers. In particular, he asked whether (25,27 is the only pair of consecutive odd powerful numbers. This question was settled in [2] by W.A. Sentance who gave necessary and sufficient conditions for the existence of such pairs. The first result of this paper is to provide a generalization of Sentance's result by giving necessary and sufficient conditions for the existence of pairs of powerful numbers spaced evenly apart. This result leads us naturally to consider integers which are representable as a proper difference of two powerful numbers, i.e. n=p1−p2 where p1 and p2 are powerful numbers with g.c.d. (p1,p2=1. Golomb (op.cit. conjectured that 6 is not a proper difference of two powerful numbers, and that there are infinitely many numbers which cannot be represented as a proper difference of two powerful numbers. The antithesis of this conjecture was proved by W.L. McDaniel [3] who verified that every non-zero integer is in fact a proper difference of two powerful numbers in infinitely many ways. McDaniel's proof is essentially an existence proof. The second result of this paper is a simpler proof of McDaniel's result as well as an effective algorithm (in the proof for explicitly determining infinitely many such representations. However, in both our proof and McDaniel's proof one of the powerful numbers is almost always a perfect square (namely one is always a perfect square when n≢2(mod4. We provide in §2 a proof that all even integers are representable in infinitely many ways as a proper nonsquare difference; i.e., proper difference of two powerful numbers neither of which is a perfect square. This, in conjunction with the odd case in [4], shows that every integer is representable in

  5. Brief history of numbers

    CERN Document Server

    Corry, Leo

    2015-01-01

    The world around us is saturated with numbers. They are a fundamental pillar of our modern society, and accepted and used with hardly a second thought. But how did this state of affairs come to be? In this book, Leo Corry tells the story behind the idea of number from the early days of the Pythagoreans, up until the turn of the twentieth century. He presents an overview of how numbers were handled and conceived in classical Greek mathematics, in the mathematics of Islam, in European mathematics of the middle ages and the Renaissance, during the scientific revolution, all the way through to the

  6. Elementary number theory

    CERN Document Server

    Dudley, Underwood

    2008-01-01

    Ideal for a first course in number theory, this lively, engaging text requires only a familiarity with elementary algebra and the properties of real numbers. Author Underwood Dudley, who has written a series of popular mathematics books, maintains that the best way to learn mathematics is by solving problems. In keeping with this philosophy, the text includes nearly 1,000 exercises and problems-some computational and some classical, many original, and some with complete solutions. The opening chapters offer sound explanations of the basics of elementary number theory and develop the fundamenta

  7. Quantum random-number generator based on a photon-number-resolving detector

    International Nuclear Information System (INIS)

    Ren Min; Wu, E; Liang Yan; Jian Yi; Wu Guang; Zeng Heping

    2011-01-01

    We demonstrated a high-efficiency quantum random number generator which takes inherent advantage of the photon number distribution randomness of a coherent light source. This scheme was realized by comparing the photon flux of consecutive pulses with a photon number resolving detector. The random bit generation rate could reach 2.4 MHz with a system clock of 6.0 MHz, corresponding to a random bit generation efficiency as high as 40%. The random number files passed all the stringent statistical tests.

  8. Volume 9 Number 1

    African Journals Online (AJOL)

    OLUWOLE

    Agro-Science Journal of Tropical Agriculture, Food, Environment and Extension. Volume 9 Number 1 ... of persistent dumping of cheap subsidized food imports from developed ... independence of the inefficiency effects in the two estimation ...

  9. High Reynolds Number Turbulence

    National Research Council Canada - National Science Library

    Smits, Alexander J

    2007-01-01

    The objectives of the grant were to provide a systematic study to fill the gap between existing research on low Reynolds number turbulent flows to the kinds of turbulent flows encountered on full-scale vehicles...

  10. Crunching the Numbers

    International Development Research Centre (IDRC) Digital Library (Canada)

    Operating a Demographic Surveillance System (DSS) like this one requires a blend of high-tech number-crunching ability and .... views follow a standardized format that takes several ... general levels of health and to the use of health services.

  11. 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.

  12. Solar Indices - Sunspot Numbers

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — Collection includes a variety of indices related to solar activity contributed by a number of national and private solar observatories located worldwide. This...

  13. Really big numbers

    CERN Document Server

    Schwartz, Richard Evan

    2014-01-01

    In the American Mathematical Society's first-ever book for kids (and kids at heart), mathematician and author Richard Evan Schwartz leads math lovers of all ages on an innovative and strikingly illustrated journey through the infinite number system. By means of engaging, imaginative visuals and endearing narration, Schwartz manages the monumental task of presenting the complex concept of Big Numbers in fresh and relatable ways. The book begins with small, easily observable numbers before building up to truly gigantic ones, like a nonillion, a tredecillion, a googol, and even ones too huge for names! Any person, regardless of age, can benefit from reading this book. Readers will find themselves returning to its pages for a very long time, perpetually learning from and growing with the narrative as their knowledge deepens. Really Big Numbers is a wonderful enrichment for any math education program and is enthusiastically recommended to every teacher, parent and grandparent, student, child, or other individual i...

  14. The Congruent Number Problem

    Indian Academy of Sciences (India)

    One could endlessly churn out congruent numbers following the method in Box 1 without being certain when a given number n (or n x m 2, for some integer m) will ap- pear on the list. Continuing in this way ·would exhaust one's computing resources, not to mention one's patience! Also, this procedure is of no avail if n is not ...

  15. The Brothel Phone Number

    DEFF Research Database (Denmark)

    Korsby, Trine Mygind

    2017-01-01

    Taking a point of departure in negotiations for access to a phone number for a brothel abroad, the article demonstrates how a group of pimps in Eastern Romania attempt to extend their local business into the rest of the EU. The article shows how the phone number works as a micro-infrastructure in......Taking a point of departure in negotiations for access to a phone number for a brothel abroad, the article demonstrates how a group of pimps in Eastern Romania attempt to extend their local business into the rest of the EU. The article shows how the phone number works as a micro...... in turn cultivate and maximize uncertainty about themselves in others. When making the move to go abroad into unknown terrains, accessing the infrastructure generated by the phone number can provide certainty and consolidate one’s position within criminal networks abroad. However, at the same time......, mishandling the phone number can be dangerous and in that sense produce new doubts and uncertainties....

  16. Report number codes

    Energy Technology Data Exchange (ETDEWEB)

    Nelson, R.N. (ed.)

    1985-05-01

    This publication lists all report number codes processed by the Office of Scientific and Technical Information. The report codes are substantially based on the American National Standards Institute, Standard Technical Report Number (STRN)-Format and Creation Z39.23-1983. The Standard Technical Report Number (STRN) provides one of the primary methods of identifying a specific technical report. The STRN consists of two parts: The report code and the sequential number. The report code identifies the issuing organization, a specific program, or a type of document. The sequential number, which is assigned in sequence by each report issuing entity, is not included in this publication. Part I of this compilation is alphabetized by report codes followed by issuing installations. Part II lists the issuing organization followed by the assigned report code(s). In both Parts I and II, the names of issuing organizations appear for the most part in the form used at the time the reports were issued. However, for some of the more prolific installations which have had name changes, all entries have been merged under the current name.

  17. Report number codes

    International Nuclear Information System (INIS)

    Nelson, R.N.

    1985-05-01

    This publication lists all report number codes processed by the Office of Scientific and Technical Information. The report codes are substantially based on the American National Standards Institute, Standard Technical Report Number (STRN)-Format and Creation Z39.23-1983. The Standard Technical Report Number (STRN) provides one of the primary methods of identifying a specific technical report. The STRN consists of two parts: The report code and the sequential number. The report code identifies the issuing organization, a specific program, or a type of document. The sequential number, which is assigned in sequence by each report issuing entity, is not included in this publication. Part I of this compilation is alphabetized by report codes followed by issuing installations. Part II lists the issuing organization followed by the assigned report code(s). In both Parts I and II, the names of issuing organizations appear for the most part in the form used at the time the reports were issued. However, for some of the more prolific installations which have had name changes, all entries have been merged under the current name

  18. Energy efficiency

    International Nuclear Information System (INIS)

    Marvillet, Ch.; Tochon, P.; Mercier, P.

    2004-01-01

    World energy demand is constantly rising. This is a legitimate trend, insofar as access to energy enables enhanced quality of life and sanitation levels for populations. On the other hand, such increased consumption generates effects that may be catastrophic for the future of the planet (climate change, environmental imbalance), should this growth conform to the patterns followed, up to recent times, by most industrialized countries. Reduction of greenhouse gas emissions, development of new energy sources and energy efficiency are seen as the major challenges to be taken up for the world of tomorrow. In France, the National Energy Debate indeed emphasized, in 2003, the requirement to control both demand for, and offer of, energy, through a strategic orientation law for energy. The French position corresponds to a slightly singular situation - and a privileged one, compared to other countries - owing to massive use of nuclear power for electricity generation. This option allows France to be responsible for a mere 2% of worldwide greenhouse gas emissions. Real advances can nonetheless still be achieved as regards improved energy efficiency, particularly in the transportation and residential-tertiary sectors, following the lead, in this respect, shown by industry. These two sectors indeed account for over half of the country CO 2 emissions (26% and 25% respectively). With respect to transportation, the work carried out by CEA on the hydrogen pathway, energy converters, and electricity storage has been covered by the preceding chapters. As regards housing, a topic addressed by one of the papers in this chapter, investigations at CEA concern integration of the various devices enabling value-added use of renewable energies. At the same time, the organization is carrying through its activity in the extensive area of heat exchangers, allowing industry to benefit from improved understanding in the modeling of flows. An activity evidenced by advances in energy efficiency for

  19. Efficient convolutional sparse coding

    Science.gov (United States)

    Wohlberg, Brendt

    2017-06-20

    Computationally efficient algorithms may be applied for fast dictionary learning solving the convolutional sparse coding problem in the Fourier domain. More specifically, efficient convolutional sparse coding may be derived within an alternating direction method of multipliers (ADMM) framework that utilizes fast Fourier transforms (FFT) to solve the main linear system in the frequency domain. Such algorithms may enable a significant reduction in computational cost over conventional approaches by implementing a linear solver for the most critical and computationally expensive component of the conventional iterative algorithm. The theoretical computational cost of the algorithm may be reduced from O(M.sup.3N) to O(MN log N), where N is the dimensionality of the data and M is the number of elements in the dictionary. This significant improvement in efficiency may greatly increase the range of problems that can practically be addressed via convolutional sparse representations.

  20. Efficiency in Microfinance Cooperatives

    Directory of Open Access Journals (Sweden)

    HARTARSKA, Valentina

    2012-12-01

    Full Text Available In recognition of cooperatives’ contribution to the socio-economic well-being of their participants, the United Nations has declared 2012 as the International Year of Cooperatives. Microfinance cooperatives make a large part of the microfinance industry. We study efficiency of microfinance cooperatives and provide estimates of the optimal size of such organizations. We employ the classical efficiency analysis consisting of estimating a system of equations and identify the optimal size of microfinance cooperatives in terms of their number of clients (outreach efficiency, as well as dollar value of lending and deposits (sustainability. We find that microfinance cooperatives have increasing returns to scale which means that the vast majority can lower cost if they become larger. We calculate that the optimal size is around $100 million in lending and half of that in deposits. We find less robust estimates in terms of reaching many clients with a range from 40,000 to 180,000 borrowers.

  1. A Numbers Game

    DEFF Research Database (Denmark)

    Levin, Bruce R; McCall, Ingrid C.; Perrot, Veronique

    2017-01-01

    We postulate that the inhibition of growth and low rates of mortality of bacteria exposed to ribosome-binding antibiotics deemed bacteriostatic can be attributed almost uniquely to these drugs reducing the number of ribosomes contributing to protein synthesis, i.e., the number of effective......-targeting bacteriostatic antibiotics, the time before these bacteria start to grow again when the drugs are removed, referred to as the post-antibiotic effect (PAE), is markedly greater for constructs with fewer rrn operons than for those with more rrn operons. We interpret the results of these other experiments reported...... here as support for the hypothesis that the reduction in the effective number of ribosomes due to binding to these structures provides a sufficient explanation for the action of bacteriostatic antibiotics that target these structures....

  2. The LHC in numbers

    CERN Multimedia

    Alizée Dauvergne

    2010-01-01

    What makes the LHC the biggest particle accelerator in the world? Here are some of the numbers that characterise the LHC, and their equivalents in terms that are easier for us to imagine.   Feature Number Equivalent Circumference ~ 27 km   Distance covered by beam in 10 hours ~ 10 billion km a round trip to Neptune Number of times a single proton travels around the ring each second 11 245   Speed of protons first entering the LHC 299 732 500 m/s 99.9998 % of the speed of light Speed of protons when they collide 299 789 760 m/s 99.9999991 % of the speed of light Collision temperature ~ 1016 °C ove...

  3. Algebraic theory of numbers

    CERN Document Server

    Samuel, Pierre

    2008-01-01

    Algebraic number theory introduces students not only to new algebraic notions but also to related concepts: groups, rings, fields, ideals, quotient rings and quotient fields, homomorphisms and isomorphisms, modules, and vector spaces. Author Pierre Samuel notes that students benefit from their studies of algebraic number theory by encountering many concepts fundamental to other branches of mathematics - algebraic geometry, in particular.This book assumes a knowledge of basic algebra but supplements its teachings with brief, clear explanations of integrality, algebraic extensions of fields, Gal

  4. Analytic number theory

    CERN Document Server

    Iwaniec, Henryk

    2004-01-01

    Analytic Number Theory distinguishes itself by the variety of tools it uses to establish results, many of which belong to the mainstream of arithmetic. One of the main attractions of analytic number theory is the vast diversity of concepts and methods it includes. The main goal of the book is to show the scope of the theory, both in classical and modern directions, and to exhibit its wealth and prospects, its beautiful theorems and powerful techniques. The book is written with graduate students in mind, and the authors tried to balance between clarity, completeness, and generality. The exercis

  5. CONFUSION WITH TELEPHONE NUMBERS

    CERN Multimedia

    Telecom Service

    2002-01-01

    he area code is now required for all telephone calls within Switzerland. Unfortunately this is causing some confusion. CERN has received complaints that incoming calls intended for CERN mobile phones are being directed to private subscribers. This is caused by mistakenly dialing the WRONG code (e.g. 022) in front of the mobile number. In order to avoid these problems, please inform your correspondents that the correct numbers are: 079 201 XXXX from Switzerland; 0041 79 201 XXXX from other countries. Telecom Service

  6. CONFUSION WITH TELEPHONE NUMBERS

    CERN Multimedia

    Telecom Service

    2002-01-01

    The area code is now required for all telephone calls within Switzerland. Unfortunately this is causing some confusion. CERN has received complaints that incoming calls intended for CERN mobile phones are being directed to private subscribers. This is caused by mistakenly dialing the WRONG code (e.g. 022) in front of the mobile number. In order to avoid these problems, please inform your correspondents that the correct numbers are: 079 201 XXXX from Switzerland; 0041 79 201 XXXX from other countries. Telecom Service  

  7. Earthquake number forecasts testing

    Science.gov (United States)

    Kagan, Yan Y.

    2017-10-01

    We study the distributions of earthquake numbers in two global earthquake catalogues: Global Centroid-Moment Tensor and Preliminary Determinations of Epicenters. The properties of these distributions are especially required to develop the number test for our forecasts of future seismic activity rate, tested by the Collaboratory for Study of Earthquake Predictability (CSEP). A common assumption, as used in the CSEP tests, is that the numbers are described by the Poisson distribution. It is clear, however, that the Poisson assumption for the earthquake number distribution is incorrect, especially for the catalogues with a lower magnitude threshold. In contrast to the one-parameter Poisson distribution so widely used to describe earthquake occurrences, the negative-binomial distribution (NBD) has two parameters. The second parameter can be used to characterize the clustering or overdispersion of a process. We also introduce and study a more complex three-parameter beta negative-binomial distribution. We investigate the dependence of parameters for both Poisson and NBD distributions on the catalogue magnitude threshold and on temporal subdivision of catalogue duration. First, we study whether the Poisson law can be statistically rejected for various catalogue subdivisions. We find that for most cases of interest, the Poisson distribution can be shown to be rejected statistically at a high significance level in favour of the NBD. Thereafter, we investigate whether these distributions fit the observed distributions of seismicity. For this purpose, we study upper statistical moments of earthquake numbers (skewness and kurtosis) and compare them to the theoretical values for both distributions. Empirical values for the skewness and the kurtosis increase for the smaller magnitude threshold and increase with even greater intensity for small temporal subdivision of catalogues. The Poisson distribution for large rate values approaches the Gaussian law, therefore its skewness

  8. IMPLEMENTATION OF NEURAL - CRYPTOGRAPHIC SYSTEM USING FPGA

    Directory of Open Access Journals (Sweden)

    KARAM M. Z. OTHMAN

    2011-08-01

    Full Text Available Modern cryptography techniques are virtually unbreakable. As the Internet and other forms of electronic communication become more prevalent, electronic security is becoming increasingly important. Cryptography is used to protect e-mail messages, credit card information, and corporate data. The design of the cryptography system is a conventional cryptography that uses one key for encryption and decryption process. The chosen cryptography algorithm is stream cipher algorithm that encrypt one bit at a time. The central problem in the stream-cipher cryptography is the difficulty of generating a long unpredictable sequence of binary signals from short and random key. Pseudo random number generators (PRNG have been widely used to construct this key sequence. The pseudo random number generator was designed using the Artificial Neural Networks (ANN. The Artificial Neural Networks (ANN providing the required nonlinearity properties that increases the randomness statistical properties of the pseudo random generator. The learning algorithm of this neural network is backpropagation learning algorithm. The learning process was done by software program in Matlab (software implementation to get the efficient weights. Then, the learned neural network was implemented using field programmable gate array (FPGA.

  9. 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.

  10. Colour by Numbers

    Science.gov (United States)

    Wetherell, Chris

    2017-01-01

    This is an edited extract from the keynote address given by Dr. Chris Wetherell at the 26th Biennial Conference of the Australian Association of Mathematics Teachers Inc. The author investigates the surprisingly rich structure that exists within a simple arrangement of numbers: the times tables.

  11. The magic of numbers

    CERN Document Server

    Bell, Eric Temple

    1991-01-01

    From one of the foremost interpreters for lay readers of the history and meaning of mathematics: a stimulating account of the origins of mathematical thought and the development of numerical theory. It probes the work of Pythagoras, Galileo, Berkeley, Einstein, and others, exploring how ""number magic"" has influenced religion, philosophy, science, and mathematics

  12. ALARA notes, Number 8

    International Nuclear Information System (INIS)

    Khan, T.A.; Baum, J.W.; Beckman, M.C.

    1993-10-01

    This document contains information dealing with the lessons learned from the experience of nuclear plants. In this issue the authors tried to avoid the 'tyranny' of numbers and concentrated on the main lessons learned. Topics include: filtration devices for air pollution abatement, crack repair and inspection, and remote handling equipment

  13. Uniform random number generators

    Science.gov (United States)

    Farr, W. R.

    1971-01-01

    Methods are presented for the generation of random numbers with uniform and normal distributions. Subprogram listings of Fortran generators for the Univac 1108, SDS 930, and CDC 3200 digital computers are also included. The generators are of the mixed multiplicative type, and the mathematical method employed is that of Marsaglia and Bray.

  14. Key numbers: Energy

    International Nuclear Information System (INIS)

    1994-01-01

    The key numbers of energy give statistical data related to production, consumption, and to foreign trade of each energy in the World and in France. A chapter is dedicated to environment and brings quantitative elements on pollutant emissions connected to energy uses

  15. The numbers game

    Directory of Open Access Journals (Sweden)

    Oli Brown

    2008-10-01

    Full Text Available Estimates of the potential number of ‘climate changemigrants’ vary hugely. In order to persuade policymakers ofthe need to act and to provide a sound basis for appropriateresponses, there is an urgent need for better analysis, betterdata and better predictions.

  16. Introducing Complex Numbers

    Science.gov (United States)

    Trudgian, Timothy

    2009-01-01

    One of the difficulties in any teaching of mathematics is to bridge the divide between the abstract and the intuitive. Throughout school one encounters increasingly abstract notions, which are more and more difficult to relate to everyday experiences. This article examines a familiar approach to thinking about negative numbers, that is an…

  17. Typical Complexity Numbers

    Indian Academy of Sciences (India)

    First page Back Continue Last page Overview Graphics. Typical Complexity Numbers. Say. 1000 tones,; 100 Users,; Transmission every 10 msec. Full Crosstalk cancellation would require. Full cancellation requires a matrix multiplication of order 100*100 for all the tones. 1000*100*100*100 operations every second for the ...

  18. Littlewood and Number Theory

    Indian Academy of Sciences (India)

    IAS Admin

    improved by Selberg [4] in 1941 who showed that a pos- ... be seen by entries of his first letter to G H Hardy in ... tary in the technical sense of the word, employed com- ..... III: On the expression of a number as a sum of primes, Acta Math.,.

  19. Efficiency of competitions

    Science.gov (United States)

    Ben-Naim, E.; Hengartner, N. W.

    2007-08-01

    League competition is investigated using random processes and scaling techniques. In our model, a weak team can upset a strong team with a fixed probability. Teams play an equal number of head-to-head matches and the team with the largest number of wins is declared to be the champion. The total number of games needed for the best team to win the championship with high certainty T grows as the cube of the number of teams N , i.e., Ttilde N3 . This number can be substantially reduced using preliminary rounds where teams play a small number of games and subsequently, only the top teams advance to the next round. When there are k rounds, the total number of games needed for the best team to emerge as champion, Tk , scales as follows, Tk˜Nγk with γk=[1-(2/3)k+1]-1 . For example, γk=9/5,27/19,81/65 for k=1,2,3 . These results suggest an algorithm for how to infer the best team using a schedule that is linear in N . We conclude that league format is an ineffective method of determining the best team, and that sequential elimination from the bottom up is fair and efficient.

  20. Low Reynolds Number Vehicles

    Science.gov (United States)

    1985-02-01

    of the blade. The Darrieus VAWT has more complex aerodynamics. This type of wind turbine produces power as a result of the tangential thrust as...Horizontal Axis Propeller-Type b) Verticle Axis Darrieus -Type Figure 78. Wind Turbine Configurations 0 6 Q K [_ 2 -, C 4 UJ UJ...Sailplanes 23 5.2 Wind Turbines 23 6. CONCLUDING REMARKS 24 7. RECOMMENDATIONS FOR FUTURE RESEARCH 24 REFERENCES 25 FIGURES 32 yv/ LOW REYNOLDS NUMBER

  1. Topics in number theory

    CERN Document Server

    LeVeque, William J

    2002-01-01

    Classic two-part work now available in a single volume assumes no prior theoretical knowledge on reader's part and develops the subject fully. Volume I is a suitable first course text for advanced undergraduate and beginning graduate students. Volume II requires a much higher level of mathematical maturity, including a working knowledge of the theory of analytic functions. Contents range from chapters on binary quadratic forms to the Thue-Siegel-Roth Theorem and the Prime Number Theorem. Includes numerous problems and hints for their solutions. 1956 edition. Supplementary Reading. List of Symb

  2. Drawing a random number

    DEFF Research Database (Denmark)

    Wanscher, Jørgen Bundgaard; Sørensen, Majken Vildrik

    2006-01-01

    Random numbers are used for a great variety of applications in almost any field of computer and economic sciences today. Examples ranges from stock market forecasting in economics, through stochastic traffic modelling in operations research to photon and ray tracing in graphics. The construction...... distributions into others with most of the required characteristics. In essence, a uniform sequence which is transformed into a new sequence with the required distribution. The subject of this article is to consider the well known highly uniform Halton sequence and modifications to it. The intent is to generate...

  3. Robust efficient video fingerprinting

    Science.gov (United States)

    Puri, Manika; Lubin, Jeffrey

    2009-02-01

    We have developed a video fingerprinting system with robustness and efficiency as the primary and secondary design criteria. In extensive testing, the system has shown robustness to cropping, letter-boxing, sub-titling, blur, drastic compression, frame rate changes, size changes and color changes, as well as to the geometric distortions often associated with camcorder capture in cinema settings. Efficiency is afforded by a novel two-stage detection process in which a fast matching process first computes a number of likely candidates, which are then passed to a second slower process that computes the overall best match with minimal false alarm probability. One key component of the algorithm is a maximally stable volume computation - a three-dimensional generalization of maximally stable extremal regions - that provides a content-centric coordinate system for subsequent hash function computation, independent of any affine transformation or extensive cropping. Other key features include an efficient bin-based polling strategy for initial candidate selection, and a final SIFT feature-based computation for final verification. We describe the algorithm and its performance, and then discuss additional modifications that can provide further improvement to efficiency and accuracy.

  4. Embedded systems design with special arithmetic and number systems

    CERN Document Server

    Sousa, Leonel; Chang, Chip-Hong

    2017-01-01

    This book introduces readers to alternative approaches to designing efficient embedded systems using unconventional number systems. The authors describe various systems that can be used for designing efficient embedded and application-specific processors, such as Residue Number System, Logarithmic Number System, Redundant Binary Number System Double-Base Number System, Decimal Floating Point Number System and Continuous Valued Number System. Readers will learn the strategies and trade-offs of using unconventional number systems in application-specific processors and be able to apply and design appropriate arithmetic operations from these number systems to boost the performance of digital systems. • Serves as a single-source reference to designing embedded systems with unconventional number systems • Covers theory as well as implementation on application-specific processors • Explains mathematical concepts in a manner accessible to readers with diverse backgrounds.

  5. [The power of numbers].

    Science.gov (United States)

    van Gijn, J

    2000-01-01

    The round figure for the current year has stirred people's minds in anticipation. Numbers have acquired great significance also in today's medical science. The Paris physician Pierre Charles Alexandre Louis (1787-1872) is considered the founding father of the numerical method in medicine. At first the principle of aggregating data from different individuals aroused much resistance and even disgust: Claude Bernard was a leading figure among those who warned that one will never find a mean in nature, and that grouping findings together obscures the true relationship between biological phenomena. True enough, statistical significance is not a characteristic of nature itself. Significant differences or risk reductions do not necessarily imply clinical relevance, and results obtained in a group of patients are rarely applicable to an individual patient in the consultation room. Likewise, the health of a human being cannot be captured in biochemical, radiological or other technical measures, nor in disease-specific scales that reduce well-being to one or two digits. The editors of this journal will remain keen on publishing numerical studies that contribute to evidence-based medicine, but at the same time they will continue to foster the art of reporting illness from the point of view of the sick person.

  6. Evaluation of railway transportation efficiency based on super-cross efficiency

    Science.gov (United States)

    Kuang, Xiuyuan

    2018-01-01

    The efficiency of railway transportation is an important index. It can measure the development of railway transportation enterprises, and the efficiency of railway transportation has become a hot issue in the study of railway development. Data envelopment analysis (DEA) has been widely applied to railway efficiency analysis. In this paper, BBC model and super-cross efficiency model are constructed by using DEA theory, taking the 18 Railway Bureau as the research object, with the mileage, the number of employees, locomotive number, average daily loading number as input indicators, the passenger turnover, freight turnover and transport income as output indicators, then calculated and evaluated comprehensive efficiency, pure technical efficiency and scale efficiency. We get that the super-cross efficiency is more in line with the actual situation. Getting the super-cross efficiency is more in line with the actual situation.

  7. Lepton family number violation

    International Nuclear Information System (INIS)

    Herczeg, P.

    1999-01-01

    At present there is evidence from neutrino oscillation searches that the neutrinos are in fact massive particles and that they mix. If confirmed, this would imply that the conservation of LFN is not exact. Lepton family number violation (LFNV) has been searched for with impressive sensitivities in many processes involving charged leptons. The present experimental limits on some of them (those which the author shall consider here) are shown in Table 1. These stringent limits are not inconsistent with the neutrino oscillation results since, given the experimental bounds on the masses of the known neutrinos and the neutrino mass squared differences required by the oscillation results, the effects of LFNV from neutrino mixing would be too small to be seen elsewhere (see Section 2). The purpose of experiments searching for LFNV involving the charged leptons is to probe the existence of other sources of LFNV. Such sources are present in many extensions of the SM. In this lecture the author shall discuss some of the possibilities, focusing on processes that require muon beams. Other LFNV processes, such as the decays of the kaons and of the τ, provide complementary information. In the next Section he shall consider some sources of LFNV that do not require an extension of the gauge group of the SM (the added leptons or Higgs bosons may of course originate from models with extended gauge groups). In Section 3 he discusses LFNV in left-right symmetric models. In Section 4 he considers LFNV in supersymmetric models, first in R-parity conserving supersymmetric grand unified models, and then in the minimal supersymmetric standard model with R-parity violation. The last section is a brief summary of the author's conclusions

  8. Measuring Tax Efficiency

    DEFF Research Database (Denmark)

    Raimondos-Møller, Pascalis; Woodland, Alan D.

    2004-01-01

    This paper introduces an index of tax optimality thatmeasures the distance of some current tax structure from the optimal taxstructure in the presence of public goods. In doing so, we derive a [0, 1]number that reveals immediately how far the current tax configurationis from the optimal one and......, thereby, the degree of efficiency of a taxsystem. We call this number the Tax Optimality Index. We show howthe basic method can be altered in order to derive a revenue equivalentuniform tax, which measures the size of the public sector. A numericalexample is used to illustrate the method developed.......JEL Code: H21, H41.Keywords: Tax optimality index, excess burden, distance function.Authors Affiliations: Raimondos-Møller: Copenhagen Business School, CEPR,CESifo, and EPRU. Woodland: University of Sydney....

  9. Straight flavor of Binary Number in Decimal Number System

    OpenAIRE

    MD. Abdul Awal Ansary; Sushanta Acharjee

    2012-01-01

    Different number systems are available on the basis of their base numbers. For instance, decimal number system is of base 10, hexadecimal number system which base is 16 and, Binary number system which base is 2 etc. Some numbers systems are easy to understand by the human being and some are easy to understand by electronics machine for instance digital computers. Computers only can understand data and instructions that are stored in binary form, though we input the data and instruction in dec...

  10. 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)

  11. Neutrino number of the universe

    International Nuclear Information System (INIS)

    Kolb, E.W.

    1981-01-01

    The influence of grand unified theories on the lepton number of the universe is reviewed. A scenario is presented for the generation of a large (>> 1) lepton number and a small (<< 1) baryon number. 15 references

  12. Adaptive Origami for Efficiently Folded Structures

    Science.gov (United States)

    2016-02-01

    heating. Although a large fold angle at a high temperature is desirable in order to extrapolate the origami geometry toward closure, more emphasis is...AFRL-RQ-WP-TR-2016-0020 ADAPTIVE ORIGAMI FOR EFFICIENTLY FOLDED STRUCTURES James J. Joo and Greg Reich Design and Analysis Branch... ORIGAMI FOR EFFICIENTLY FOLDED STRUCTURES 5a. CONTRACT NUMBER In-house 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 61102F 6. AUTHOR(S) James J

  13. [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.

  14. Employing online quantum random number generators for generating truly random quantum states in Mathematica

    Science.gov (United States)

    Miszczak, Jarosław Adam

    2013-01-01

    numbers generated by quantum real number generator. Reasons for new version: Added support for the high-speed on-line quantum random number generator and improved methods for retrieving lists of random numbers. Summary of revisions: The presented version provides two signicant improvements. The first one is the ability to use the on-line Quantum Random Number Generation service developed by PicoQuant GmbH and the Nano-Optics groups at the Department of Physics of Humboldt University. The on-line service supported in the version 2.0 of the TRQS package provides faster access to true randomness sources constructed using the laws of quantum physics. The service is freely available at https://qrng.physik.hu-berlin.de/. The use of this service allows using the presented package with the need of a physical quantum random number generator. The second improvement introduced in this version is the ability to retrieve arrays of random data directly for the used source. This increases the speed of the random number generation, especially in the case of an on-line service, where it reduces the time necessary to establish the connection. Thanks to the speed improvement of the presented version, the package can now be used in simulations requiring larger amounts of random data. Moreover, the functions for generating random numbers provided by the current version of the package more closely follow the pattern of functions for generating pseudo- random numbers provided in Mathematica. Additional comments: Speed comparison: The implementation of the support for the QRNG on-line service provides a noticeable improvement in the speed of random number generation. For the samples of real numbers of size 101; 102,…,107 the times required to generate these samples using Quantis USB device and QRNG service are compared in Fig. 1. The presented results show that the use of the on-line service provides faster access to random numbers. One should note, however, that the speed gain can increase or

  15. Language and number: a bilingual training study.

    Science.gov (United States)

    Spelke, E S; Tsivkin, S

    2001-01-01

    Three experiments investigated the role of a specific language in human representations of number. Russian-English bilingual college students were taught new numerical operations (Experiment 1), new arithmetic equations (Experiments 1 and 2), or new geographical or historical facts involving numerical or non-numerical information (Experiment 3). After learning a set of items in each of their two languages, subjects were tested for knowledge of those items, and new items, in both languages. In all the studies, subjects retrieved information about exact numbers more effectively in the language of training, and they solved trained problems more effectively than untrained problems. In contrast, subjects retrieved information about approximate numbers and non-numerical facts with equal efficiency in their two languages, and their training on approximate number facts generalized to new facts of the same type. These findings suggest that a specific, natural language contributes to the representation of large, exact numbers but not to the approximate number representations that humans share with other mammals. Language appears to play a role in learning about exact numbers in a variety of contexts, a finding with implications for practice in bilingual education. The findings prompt more general speculations about the role of language in the development of specifically human cognitive abilities.

  16. Bell numbers, determinants and series

    Indian Academy of Sciences (India)

    In this article, we study Bell numbers and Uppuluri Carpenter numbers. We obtain various expressions and relations between them. These include polynomial recurrences and expressions as determinants of certain matrices of binomial coefficients. Keywords. p-adic series; Bell numbers. 1. Introduction. Bell numbers, Bn [2] ...

  17. White papers on freight efficiency.

    Science.gov (United States)

    2016-05-31

    A number of stakeholders met with the ultimate goal of identifying inefficiencies faced by the freight system and putting forward a set of : strategies to achieve a more efficient freight system. In doing so, a key first step was to provide insight a...

  18. Efficiency measures for industrial organization

    NARCIS (Netherlands)

    ten Raa, Thijs; Ray, Subhash C.; Kumbhakar, Subal C.; Dua, Pami

    2015-01-01

    The aim of the paper is to measure the efficiency of an industry, and to decompose it in firm efficiencies—which indicate how close firms approximate best practices—and an organization efficiency—which indicates the degree of optimality of the number of firms and their distribution. The latter

  19. Cosmic numbers the numbers that define our universe

    CERN Document Server

    Stein, James D

    2011-01-01

    Our fascination with numbers begins when we are children and continues throughout our lives. We start counting our fingers and toes and end up balancing checkbooks and calculating risk. So powerful is the appeal of numbers that many people ascribe to them a mystical significance. Other numbers go beyond the supernatural, working to explain our universe and how it behaves. In Cosmic Numbers , mathematics professor James D. Stein traces the discovery, evolution, and interrelationships of the numbers that define our world. Everyone knows about the speed of light and absolute zero, but numbers lik

  20. Fermion number in supersymmetric models

    International Nuclear Information System (INIS)

    Mainland, G.B.; Tanaka, K.

    1975-01-01

    The two known methods for introducing a conserved fermion number into supersymmetric models are discussed. While the introduction of a conserved fermion number often requires that the Lagrangian be massless or that bosons carry fermion number, a model is discussed in which masses can be introduced via spontaneous symmetry breaking and fermion number is conserved at all stages without assigning fermion number to bosons. (U.S.)

  1. Energy efficient data centers

    Energy Technology Data Exchange (ETDEWEB)

    Tschudi, William; Xu, Tengfang; Sartor, Dale; Koomey, Jon; Nordman, Bruce; Sezgen, Osman

    2004-03-30

    Data Center facilities, prevalent in many industries and institutions are essential to California's economy. Energy intensive data centers are crucial to California's industries, and many other institutions (such as universities) in the state, and they play an important role in the constantly evolving communications industry. To better understand the impact of the energy requirements and energy efficiency improvement potential in these facilities, the California Energy Commission's PIER Industrial Program initiated this project with two primary focus areas: First, to characterize current data center electricity use; and secondly, to develop a research ''roadmap'' defining and prioritizing possible future public interest research and deployment efforts that would improve energy efficiency. Although there are many opinions concerning the energy intensity of data centers and the aggregate effect on California's electrical power systems, there is very little publicly available information. Through this project, actual energy consumption at its end use was measured in a number of data centers. This benchmark data was documented in case study reports, along with site-specific energy efficiency recommendations. Additionally, other data center energy benchmarks were obtained through synergistic projects, prior PG&E studies, and industry contacts. In total, energy benchmarks for sixteen data centers were obtained. For this project, a broad definition of ''data center'' was adopted which included internet hosting, corporate, institutional, governmental, educational and other miscellaneous data centers. Typically these facilities require specialized infrastructure to provide high quality power and cooling for IT equipment. All of these data center types were considered in the development of an estimate of the total power consumption in California. Finally, a research ''roadmap'' was developed

  2. Evaluation of Key Dependent S-Box Based Data Security Algorithm using Hamming Distance and Balanced Output

    Directory of Open Access Journals (Sweden)

    Balajee Maram K.

    2016-02-01

    Full Text Available Data security is a major issue because of rapid evolution of data communication over unsecured internetwork. Here the proposed system is concerned with the problem of randomly generated S-box. The generation of S-box depends on Pseudo-Random-Number-Generators and shared-secret-key. The process of Pseudo-Random-Number-Generator depends on large prime numbers. All Pseudo-Random-Numbers are scrambled according to shared-secret-key. After scrambling, the S-box is generated. In this research, large prime numbers are the inputs to the Pseudo-Random-Number-Generator. The proposed S-box will reduce the complexity of S-box generation. Based on S-box parameters, it experimentally investigates the quality and robustness of the proposed algorithm which was tested. It yields better results with the S-box parameters like Hamming Distance, Balanced Output and Avalanche Effect and can be embedded to popular cryptography algorithms

  3. Seniority Number in Valence Bond Theory.

    Science.gov (United States)

    Chen, Zhenhua; Zhou, Chen; Wu, Wei

    2015-09-08

    In this work, a hierarchy of valence bond (VB) methods based on the concept of seniority number, defined as the number of singly occupied orbitals in a determinant or an orbital configuration, is proposed and applied to the studies of the potential energy curves (PECs) of H8, N2, and C2 molecules. It is found that the seniority-based VB expansion converges more rapidly toward the full configuration interaction (FCI) or complete active space self-consistent field (CASSCF) limit and produces more accurate PECs with smaller nonparallelity errors than its molecular orbital (MO) theory-based analogue. Test results reveal that the nonorthogonal orbital-based VB theory provides a reverse but more efficient way to truncate the complete active Hilbert space by seniority numbers.

  4. Energy efficiency fallacies revisited

    International Nuclear Information System (INIS)

    Brookes, Leonard

    2000-01-01

    A number of governments including that of the UK subscribe to the belief that a national program devoted to raising energy efficiency throughout the economy provides a costless - indeed profitable - route to meeting international environmental obligations. This is a seductive policy. It constitutes the proverbial free lunch - not only avoiding politically unpopular measures like outlawing, taxing or rationing offending fuels or expanding non-carboniferous sources of energy like nuclear power but doing so with economic benefit. The author of this contribution came to doubt the validity of this solution when it was offered as a way of mitigating the effect of the OPEC price hikes of the 1970s, maintaining that economically justified improvement in energy efficiency led to higher levels of energy consumption at the economy-wide level than in the absence of any efficiency response. More fundamentally, he argues that there is no case for preferentially singling out energy, from among all the resources available to us, for efficiency maximisation. The least damaging policy is to determine targets, enact the restrictive measures needed to curb consumption, and then leave it to consumers - intermediate and final - to reallocate all the resources available to them to best effect subject to the new enacted constraints and any others they might be experiencing. There is no reason to suppose that it is right for all the economic adjustment following a new resource constraint to take the form of improvements in the productivity of that resource alone. As many others have argued, any action to impose resource constraint entails an inevitable economic cost in the shape of a reduction in production and consumption possibilities: there would be no free lunch. In the last few years debate about the validity of these contentions has blossomed, especially under the influence of writers on the western side of the Atlantic. In this contribution the author outlines the original arguments

  5. The Mental Number Line in Dyscalculia: Impaired Number Sense or Access from Symbolic Numbers?

    Science.gov (United States)

    Lafay, Anne; St-Pierre, Marie-Catherine; Macoir, Joël

    2017-01-01

    Numbers may be manipulated and represented mentally over a compressible number line oriented from left to right. According to numerous studies, one of the primary reasons for dyscalculia is related to improper understanding of the mental number line. Children with dyscalculia usually show difficulty when they have to place Arabic numbers on a…

  6. THE RELATIONSHIP BETWEEN NUMBER NAMES AND NUMBER CONCEPTS

    DEFF Research Database (Denmark)

    Ejersbo, Lisser Rye; Misfeldt, Morten

    Different countries have different names for numbers. These names are often related in a regular way to the base-10 place value system used for writing numbers as digits. However, in several languages, this regularity breaks down (e.g., between 10 and 20), and there is limited knowledge of how th......, a second, regular set of number names is introduced in primary school. The study’s findings suggest that the regularity of number names influences the development of number concepts and creates a positive impact on the understanding of the base-10 system....

  7. High-efficiency CARM

    Energy Technology Data Exchange (ETDEWEB)

    Bratman, V.L.; Kol`chugin, B.D.; Samsonov, S.V.; Volkov, A.B. [Institute of Applied Physics, Nizhny Novgorod (Russian Federation)

    1995-12-31

    The Cyclotron Autoresonance Maser (CARM) is a well-known variety of FEMs. Unlike the ubitron in which electrons move in a periodical undulator field, in the CARM the particles move along helical trajectories in a uniform magnetic field. Since it is much simpler to generate strong homogeneous magnetic fields than periodical ones for a relatively low electron energy ({Brit_pounds}{le}1-3 MeV) the period of particles` trajectories in the CARM can be sufficiently smaller than in the undulator in which, moreover, the field decreases rapidly in the transverse direction. In spite of this evident advantage, the number of papers on CARM is an order less than on ubitron, which is apparently caused by the low (not more than 10 %) CARM efficiency in experiments. At the same time, ubitrons operating in two rather complicated regimes-trapping and adiabatic deceleration of particles and combined undulator and reversed guiding fields - yielded efficiencies of 34 % and 27 %, respectively. The aim of this work is to demonstrate that high efficiency can be reached even for a simplest version of the CARM. In order to reduce sensitivity to an axial velocity spread of particles, a short interaction length where electrons underwent only 4-5 cyclotron oscillations was used in this work. Like experiments, a narrow anode outlet of a field-emission electron gun cut out the {open_quotes}most rectilinear{close_quotes} near-axis part of the electron beam. Additionally, magnetic field of a small correcting coil compensated spurious electron oscillations pumped by the anode aperture. A kicker in the form of a sloping to the axis frame with current provided a control value of rotary velocity at a small additional velocity spread. A simple cavity consisting of a cylindrical waveguide section restricted by a cut-off waveguide on the cathode side and by a Bragg reflector on the collector side was used as the CARM-oscillator microwave system.

  8. Energy efficiency: 2004 world overview

    International Nuclear Information System (INIS)

    2004-01-01

    Since 1992 the World Energy Council (WEC) has been collaborating with ADEME (Agency for Environment and Energy Efficiency, France) on a joint project 'Energy Efficiency Policies and Indicators'. APERC (Asia Pacific Energy Research Centre) and OLADE (Latin American Energy Organisation) have also participated in the study, which has been monitoring and evaluating energy efficiency policies and their impacts around the world. WEC Member Committees have been providing data and information and ENERDATA (France) has provided technical assistance. This report, published in August 2004, presents and evaluates energy efficiency policies in 63 countries, with a specific focus on five policy measures, for which in-depth case studies were prepared by selected experts: - Minimum energy efficiency standards for household electrical appliances; - Innovative energy efficiency funds; - Voluntary/negotiated agreements on energy efficiency/ CO 2 ; - Local energy information centres; - Packages of measures. In particular, the report identifies the policy measures, which have proven to be the most effective, and can be recommended to countries which have recently embarked on the development and implementation of energy demand management policies. During the past ten years, the Kyoto Protocol and, more recently, emerging concerns about security of supply have raised, both the public and the political profile of energy efficiency. Almost all OECD countries and an increasing number of other countries are implementing energy efficiency policies adapted to their national circumstances. In addition to the market instruments (voluntary agreements, labels, information, etc.), regulatory measures are widely introduced where the market fails to give the right signals (buildings, appliances). In developing countries, energy efficiency is equally important, even if the drivers are different compared to industrialized countries. Reduction of greenhouse gas emissions and local pollution often have a

  9. The theory of algebraic numbers

    CERN Document Server

    Pollard, Harry

    1998-01-01

    An excellent introduction to the basics of algebraic number theory, this concise, well-written volume examines Gaussian primes; polynomials over a field; algebraic number fields; and algebraic integers and integral bases. After establishing a firm introductory foundation, the text explores the uses of arithmetic in algebraic number fields; the fundamental theorem of ideal theory and its consequences; ideal classes and class numbers; and the Fermat conjecture. 1975 edition. References. List of Symbols. Index.

  10. Elementary number theory with programming

    CERN Document Server

    Lewinter, Marty

    2015-01-01

    A successful presentation of the fundamental concepts of number theory and computer programming Bridging an existing gap between mathematics and programming, Elementary Number Theory with Programming provides a unique introduction to elementary number theory with fundamental coverage of computer programming. Written by highly-qualified experts in the fields of computer science and mathematics, the book features accessible coverage for readers with various levels of experience and explores number theory in the context of programming without relying on advanced prerequisite knowledge and con

  11. Distribution theory of algebraic numbers

    CERN Document Server

    Yang, Chung-Chun

    2008-01-01

    The book timely surveys new research results and related developments in Diophantine approximation, a division of number theory which deals with the approximation of real numbers by rational numbers. The book is appended with a list of challenging open problems and a comprehensive list of references. From the contents: Field extensions Algebraic numbers Algebraic geometry Height functions The abc-conjecture Roth''s theorem Subspace theorems Vojta''s conjectures L-functions.

  12. Generalized Bernoulli-Hurwitz numbers and the universal Bernoulli numbers

    International Nuclear Information System (INIS)

    Ônishi, Yoshihiro

    2011-01-01

    The three fundamental properties of the Bernoulli numbers, namely, the von Staudt-Clausen theorem, von Staudt's second theorem, and Kummer's original congruence, are generalized to new numbers that we call generalized Bernoulli-Hurwitz numbers. These are coefficients in the power series expansion of a higher-genus algebraic function with respect to a suitable variable. Our generalization differs strongly from previous works. Indeed, the order of the power of the modulus prime in our Kummer-type congruences is exactly the same as in the trigonometric function case (namely, Kummer's own congruence for the original Bernoulli numbers), and as in the elliptic function case (namely, H. Lang's extension for the Hurwitz numbers). However, in other past results on higher-genus algebraic functions, the modulus was at most half of its value in these classical cases. This contrast is clarified by investigating the analogue of the three properties above for the universal Bernoulli numbers. Bibliography: 34 titles.

  13. 2016 Gainesville Number Theory Conference

    CERN Document Server

    Garvan, Frank

    2017-01-01

    Gathered from the 2016 Gainesville Number Theory Conference honoring Krishna Alladi on his 60th birthday, these proceedings present recent research in number theory. Extensive and detailed, this volume features 40 articles by leading researchers on topics in analytic number theory, probabilistic number theory, irrationality and transcendence, Diophantine analysis, partitions, basic hypergeometric series, and modular forms. Readers will also find detailed discussions of several aspects of the path-breaking work of Srinivasa Ramanujan and its influence on current research. Many of the papers were motivated by Alladi's own research on partitions and q-series as well as his earlier work in number theory.  Alladi is well known for his contributions in number theory and mathematics. His research interests include combinatorics, discrete mathematics, sieve methods, probabilistic and analytic number theory, Diophantine approximations, partitions and q-series identities. Graduate students and researchers will find th...

  14. Solution of Stochastic Nonlinear PDEs Using Automated Wiener-Hermite Expansion

    KAUST Repository

    Al-Juhani, Amnah; El-Beltagy, Mohamed

    2014-01-01

    directly involved in the computations. One does not have to rely on pseudo random number generators, and there is no need to solve the SDEs repeatedly for many realizations. Instead, the deterministic system is solved only once. For previous research

  15. 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.

  16. Hardware Realization of Chaos Based Symmetric Image Encryption

    KAUST Repository

    Barakat, Mohamed L.

    2012-01-01

    This thesis presents a novel work on hardware realization of symmetric image encryption utilizing chaos based continuous systems as pseudo random number generators. Digital implementation of chaotic systems results in serious degradations

  17. 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

  18. Efficiency improvements in transport

    Energy Technology Data Exchange (ETDEWEB)

    Schramm, J. [Technical Univ. of Denmark. DTU Mechanical Engineering, Kgs. Lyngby (Denmark); Christensen, Linda; Jensen, Thomas C. [Technical Univ. of Denmark. DTU Transport, Kgs. Lyngby (Denmark)

    2012-11-15

    Transport of people, personal belongings and goods in private cars is fundamental to our modern welfare society and economic growth, and has grown steadily over many decades. Motor fuels have been based almost entirely on crude oil for the last century. During the last couple of decades engines built for traditional fuels have become more advanced and efficient; this has reduced fuel consumption by around 40% and emissions by more than 90%. Only in the same time span have we begun to look at alternatives to fossil fuels. Biofuels such as biodiesel, bioethanol, biomethanol and biogas can replace petrol and diesel, and in recent years algae have shown a new potential for diesel fuel. Natural gas is also becoming an interesting fuel due to its large resources worldwide. GTL, CTL and BTL are liquid fuels produced from solid or gaseous sources. GTL and CTL are expensive to produce and not very CO{sub 2}-friendly, but they are easily introduced and need little investment in infrastructure and vehicles. DME is an excellent fuel for diesel engines. Methanol and DME produced from biomass are among the most CO{sub 2}-reducing fuels and at the same time the most energy-efficient renewable fuels. Fuel cell vehicles (FCVs) are currently fuelled by hydrogen, but other fuels are also possible. There are, however, several barriers to the implementation of fuel cell vehicles. In particular, a hydrogen infrastructure needs to be developed. Electric vehicles (EVs) have the advantage that energy conversion is centralised at the power plant where it can be done at optimum efficiency and emissions. EVs have to be charged at home, and also away from home when travelling longer distances. With an acceptable fast charging infrastructure at least 85% of the one-car families in Denmark could be potential EV customers. Range improvements resulting from better batteries are expected to create a large increase in the number of EVs in Denmark between 2020 and 2030. The hybrid electric vehicle

  19. 90 measurement of technical efficiency and its determinants in crop ...

    African Journals Online (AJOL)

    OLUWOLE AKINNAGBE

    They found that education, number of working animals, credit per acre and number of extension visits significantly increased cost efficiency while large land holding size significantly decreased cost efficiency. In single estimation approach of the technical efficiency model for Indian farmers,. Colli et al (1998), found that years ...

  20. Generation of sub-Poissonian photon number distribution

    DEFF Research Database (Denmark)

    Grønbech-Jensen, N.; Ramanujam, P. S.

    1990-01-01

    An optimization of a nonlinear Mach-Zehnder interferometer to produce sub-Poissonian photon number distribution is proposed. We treat the system quantum mechanically and estimate the mirror parameters, the nonlinearity of the medium in the interferometer, and the input power to obtain minimal...... output uncertainty in the photon number. The power efficiency of the system is shown to be high....

  1. Strictly-regular number system and data structures

    DEFF Research Database (Denmark)

    Elmasry, Amr Ahmed Abd Elmoneim; Jensen, Claus; Katajainen, Jyrki

    2010-01-01

    We introduce a new number system that we call the strictly-regular system, which efficiently supports the operations: digit-increment, digit-decrement, cut, concatenate, and add. Compared to other number systems, the strictly-regular system has distinguishable properties. It is superior to the re...

  2. Group-ID based RFID Mutual Authentication

    Directory of Open Access Journals (Sweden)

    LEE, Y.

    2013-11-01

    Full Text Available For passive type RFID tags, EPCglobal Class 1 Generation-2 Revision is used widely as a de facto standard. As it was designed for low cost, it is quite vulnerable to security issues, such as privacy concerns. This paper presents a new RFID mutual authentication protocol, which is designed to be configured on EPC Gen2 platform and to meet various security requirements while providing efficiency using PRNG (Pseudo Random Number Generator. Group-ID is used to minimize the authentication time. Security analysis of the proposed protocol is discussed.

  3. Bernoulli numbers and zeta functions

    CERN Document Server

    Arakawa, Tsuneo; Kaneko, Masanobu

    2014-01-01

    Two major subjects are treated in this book. The main one is the theory of Bernoulli numbers and the other is the theory of zeta functions. Historically, Bernoulli numbers were introduced to give formulas for the sums of powers of consecutive integers. The real reason that they are indispensable for number theory, however, lies in the fact that special values of the Riemann zeta function can be written by using Bernoulli numbers. This leads to more advanced topics, a number of which are treated in this book: Historical remarks on Bernoulli numbers and the formula for the sum of powers of consecutive integers; a formula for Bernoulli numbers by Stirling numbers; the Clausen–von Staudt theorem on the denominators of Bernoulli numbers; Kummer's congruence between Bernoulli numbers and a related theory of p-adic measures; the Euler–Maclaurin summation formula; the functional equation of the Riemann zeta function and the Dirichlet L functions, and their special values at suitable integers; various formulas of ...

  4. Compendium of Experimental Cetane Numbers

    Energy Technology Data Exchange (ETDEWEB)

    Yanowitz, Janet [Ecoengineering, Sharonville, OH (United States); Ratcliff, Matthew A. [National Renewable Energy Lab. (NREL), Golden, CO (United States); McCormick, Robert L. [National Renewable Energy Lab. (NREL), Golden, CO (United States); Taylor, J. D. [National Renewable Energy Lab. (NREL), Golden, CO (United States); Murphy, M. J. [Battelle, Columbus, OH (United States)

    2017-02-22

    This report is an updated version of the 2014 Compendium of Experimental Cetane Number Data and presents a compilation of measured cetane numbers for pure chemical compounds. It includes all available single-compound cetane number data found in the scientific literature up until December 2016 as well as a number of previously unpublished values, most measured over the past decade at the National Renewable Energy Laboratory. This version of the compendium contains cetane values for 496 pure compounds, including 204 hydrocarbons and 292 oxygenates. 176 individual measurements are new to this version of the compendium, all of them collected using ASTM Method D6890, which utilizes an Ignition Quality Tester (IQT) a type of constant-volume combustion chamber. For many compounds, numerous measurements are included, often collected by different researchers using different methods. The text of this document is unchanged from the 2014 version, except for the numbers of compounds in Section 3.1, the Appendices, Table 1. Primary Cetane Number Data Sources and Table 2. Number of Measurements Included in Compendium. Cetane number is a relative ranking of a fuel's autoignition characteristics for use in compression ignition engines. It is based on the amount of time between fuel injection and ignition, also known as ignition delay. The cetane number is typically measured either in a single-cylinder engine or a constant-volume combustion chamber. Values in the previous compendium derived from octane numbers have been removed and replaced with a brief analysis of the correlation between cetane numbers and octane numbers. The discussion on the accuracy and precision of the most commonly used methods for measuring cetane number has been expanded, and the data have been annotated extensively to provide additional information that will help the reader judge the relative reliability of individual results.

  5. Hospital Competition, Technical Efficiency, and Quality

    OpenAIRE

    C. L. Chua; Alfons Palangkaraya; Jongsay Yong

    2009-01-01

    This paper studies the link between competition and technical efficiency of public hospitals in the State of Victoria, Australia by accounting both quantity and quality of hospital output using a two-stage semi-parametric model of hospital production and Data Envelopment Analysis. On the one hand, it finds a positive relationship between efficiency and competition measured by the Hirschman-Herfindahl Index (HHI). On the other, it finds that efficiency and the number of competing hospitals, in...

  6. Dynamic Virtual Credit Card Numbers

    Science.gov (United States)

    Molloy, Ian; Li, Jiangtao; Li, Ninghui

    Theft of stored credit card information is an increasing threat to e-commerce. We propose a dynamic virtual credit card number scheme that reduces the damage caused by stolen credit card numbers. A user can use an existing credit card account to generate multiple virtual credit card numbers that are either usable for a single transaction or are tied with a particular merchant. We call the scheme dynamic because the virtual credit card numbers can be generated without online contact with the credit card issuers. These numbers can be processed without changing any of the infrastructure currently in place; the only changes will be at the end points, namely, the card users and the card issuers. We analyze the security requirements for dynamic virtual credit card numbers, discuss the design space, propose a scheme using HMAC, and prove its security under the assumption the underlying function is a PRF.

  7. Number-unconstrained quantum sensing

    Science.gov (United States)

    Mitchell, Morgan W.

    2017-12-01

    Quantum sensing is commonly described as a constrained optimization problem: maximize the information gained about an unknown quantity using a limited number of particles. Important sensors including gravitational wave interferometers and some atomic sensors do not appear to fit this description, because there is no external constraint on particle number. Here, we develop the theory of particle-number-unconstrained quantum sensing, and describe how optimal particle numbers emerge from the competition of particle-environment and particle-particle interactions. We apply the theory to optical probing of an atomic medium modeled as a resonant, saturable absorber, and observe the emergence of well-defined finite optima without external constraints. The results contradict some expectations from number-constrained quantum sensing and show that probing with squeezed beams can give a large sensitivity advantage over classical strategies when each is optimized for particle number.

  8. Efficient Collision Detection in a Simulated Hydrocyclone

    NARCIS (Netherlands)

    van Eijkeren, D.F.; Krebs, T.; Hoeijmakers, Hendrik Willem Marie

    2015-01-01

    Hydrocyclones enhance oil–water separation efficiency compared to conventional separation methods. An efficient collision detection scheme with Np ln Np dependency on the number of particles is proposed. The scheme is developed to investigate the importance of particle–particle interaction for flow

  9. Violation of local realism versus detection efficiency

    International Nuclear Information System (INIS)

    Massar, Serge; Pironio, Stefano

    2003-01-01

    We put bounds on the minimum detection efficiency necessary to violate local realism in Bell experiments. These bounds depend on simple parameters like the number of measurement settings or the dimensionality of the entangled quantum state. We derive them by constructing explicit local hidden variable models which reproduce the quantum correlations for sufficiently small detectors efficiency

  10. Schmidt number for quantum operations

    International Nuclear Information System (INIS)

    Huang Siendong

    2006-01-01

    To understand how entangled states behave under local quantum operations is an open problem in quantum-information theory. The Jamiolkowski isomorphism provides a natural way to study this problem in terms of quantum states. We introduce the Schmidt number for quantum operations by this duality and clarify how the Schmidt number of a quantum state changes under a local quantum operation. Some characterizations of quantum operations with Schmidt number k are also provided

  11. Random number generation and creativity.

    Science.gov (United States)

    Bains, William

    2008-01-01

    A previous paper suggested that humans can generate genuinely random numbers. I tested this hypothesis by repeating the experiment with a larger number of highly numerate subjects, asking them to call out a sequence of digits selected from 0 through 9. The resulting sequences were substantially non-random, with an excess of sequential pairs of numbers and a deficit of repeats of the same number, in line with previous literature. However, the previous literature suggests that humans generate random numbers with substantial conscious effort, and distractions which reduce that effort reduce the randomness of the numbers. I reduced my subjects' concentration by asking them to call out in another language, and with alcohol - neither affected the randomness of their responses. This suggests that the ability to generate random numbers is a 'basic' function of the human mind, even if those numbers are not mathematically 'random'. I hypothesise that there is a 'creativity' mechanism, while not truly random, provides novelty as part of the mind's defence against closed programming loops, and that testing for the effects seen here in people more or less familiar with numbers or with spontaneous creativity could identify more features of this process. It is possible that training to perform better at simple random generation tasks could help to increase creativity, through training people to reduce the conscious mind's suppression of the 'spontaneous', creative response to new questions.

  12. Unsolved problems in number theory

    CERN Document Server

    Guy, Richard K

    1994-01-01

    Unsolved Problems in Number Theory contains discussions of hundreds of open questions, organized into 185 different topics. They represent numerous aspects of number theory and are organized into six categories: prime numbers, divisibility, additive number theory, Diophantine equations, sequences of integers, and miscellaneous. To prevent repetition of earlier efforts or duplication of previously known results, an extensive and up-to-date collection of references follows each problem. In the second edition, not only extensive new material has been added, but corrections and additions have been included throughout the book.

  13. Complex numbers in n dimensions

    CERN Document Server

    Olariu, Silviu

    2002-01-01

    Two distinct systems of hypercomplex numbers in n dimensions are introduced in this book, for which the multiplication is associative and commutative, and which are rich enough in properties such that exponential and trigonometric forms exist and the concepts of analytic n-complex function, contour integration and residue can be defined. The first type of hypercomplex numbers, called polar hypercomplex numbers, is characterized by the presence in an even number of dimensions greater or equal to 4 of two polar axes, and by the presence in an odd number of dimensions of one polar axis. The other type of hypercomplex numbers exists as a distinct entity only when the number of dimensions n of the space is even, and since the position of a point is specified with the aid of n/2-1 planar angles, these numbers have been called planar hypercomplex numbers. The development of the concept of analytic functions of hypercomplex variables was rendered possible by the existence of an exponential form of the n-complex numbe...

  14. A Research on a Certain Family of Numbers and Polynomials Related to Stirling Numbers, Central Factorial Numbers, and Euler Numbers

    Directory of Open Access Journals (Sweden)

    J. Y. Kang

    2013-01-01

    Full Text Available Recently, many mathematicians have studied different kinds of the Euler, Bernoulli, and Genocchi numbers and polynomials. In this paper, we give another definition of polynomials Ũn(x. We observe an interesting phenomenon of “scattering” of the zeros of the polynomials Ũn(x in complex plane. We find out some identities and properties related to polynomials Ũn(x. Finally, we also derive interesting relations between polynomials Ũn(x, Stirling numbers, central factorial numbers, and Euler numbers.

  15. BKP and projective Hurwitz numbers

    Science.gov (United States)

    Natanzon, Sergey M.; Orlov, Aleksandr Yu.

    2017-06-01

    We consider d-fold branched coverings of the projective plane RP^2 and show that the hypergeometric tau function of the BKP hierarchy of Kac and van de Leur is the generating function for weighted sums of the related Hurwitz numbers. In particular, we get the RP^2 analogues of the CP^1 generating functions proposed by Okounkov and by Goulden and Jackson. Other examples are Hurwitz numbers weighted by the Hall-Littlewood and by the Macdonald polynomials. We also consider integrals of tau functions which generate Hurwitz numbers related to base surfaces with arbitrary Euler characteristics sc {e}, in particular projective Hurwitz numbers sc {e}=1.

  16. Prandtl number of toroidal plasmas

    International Nuclear Information System (INIS)

    Itoh, K.; Itoh, S.; Fukuyama, A.; Yagi, M.; Azumi, M.

    1993-06-01

    Theory of the L-mode confinement in toroidal plasmas is developed. The Prandtl number, the ratio between the ion viscosity and the thermal conductivity is obtained for the anomalous transport process which is caused by the self-sustained turbulence in the toroidal plasma. It is found that the Prandtl number is of order unity both for the ballooning mode turbulence in tokamaks and for the interchange mode turbulence in helical system. The influence on the anomalous transport and fluctuation level is evaluated. Hartmann number and magnetic Prandtl number are also discussed. (author)

  17. Export support of renewable energy industries, grant number 1, deliverable number 3. Final report

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1998-01-14

    The United States Export Council for Renewable Energy (US/ECRE), a consortium of six industry associations, promotes the interests of the renewable energy and energy efficiency member companies which provide goods and services in biomass, geothermal, hydropower, passive solar, photovoltaics, solar thermal, wind, wood energy, and energy efficiency technologies. US/ECRE`s mission is to catalyze export markets for renewable energy and energy efficiency technologies worldwide. Under this grant, US/ECRE has conducted a number of in-house activities, as well as to manage activities by member trade associations, affiliate organizations and non-member contractors and consultants. The purpose of this document is to report on grant coordination and effectiveness.

  18. Export support of renewable energy industries. Task number 1, deliverable number 3. Final report

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1998-01-14

    The United States Export Council for Renewable Energy (US/ECRE), a consortium of six industry associations, promotes the interests of the renewable energy and energy efficiency member companies which provide goods and services in biomass, geothermal, hydropower, passive solar, photovoltaics, solar thermal, wind, wood energy, and energy efficiency technologies. US/ECRE`s mission is to catalyze export markets for renewable energy and energy efficiency technologies worldwide. Under this grant, US/ECRE has conducted a number of in-house activities, as well as to manage activities by member trade associations, affiliate organizations and non-member contractors and consultants. The purpose of this document is to report on task coordination and effectiveness.

  19. The Efficiency of Educational Production

    DEFF Research Database (Denmark)

    Bogetoft, Peter; Heinesen, Eskil; Tranæs, Torben

    the educational sector, both in terms of a large number of students enrolled in educational programmes and a high completion rate. The methodology used is to compare (benchmark) Denmark with a relevant group of countries and to calculate how much cheaper Denmark could teach the same number of students...... to explain the higher costs of upper secondary education. On the output side, if earnings and levels of employment among those who complete their education are taken into account, then Denmark is in fact found to be efficient. However, this high level of efficiency has become less clear-cut in recent years......Denmark, Norway, New Zealand, Canada and the USA are the OECD countries that spend most on education, measured in relation to GDP. Focusing in particular on upper secondary education, this paper examines whether the heavy expenditure on education in Denmark is matched by high output from...

  20. Efficiency of contactors

    International Nuclear Information System (INIS)

    Orth, D.A.; Graham, F.R.; Holt, D.L.

    1986-01-01

    The Savannah River Plant has two separations plants that began Purex operations in 1954 and 1955 with pump-mix mixer-settlers as contactors to process nuclear fuels. The only changes to the extraction equipment were replacement of most of the mixer-settlers in one plant with larger units in 1959, and the further replacement of the large 1A bank with a bank of rapid-contact centrifugal contactors in 1966. Improved performance of the old units has become highly desirable, and an experimental program is underway. Good contact between the phases, and adequate settling without entrainment of the opposite phase are required for high efficiency operation of the mixer-settlers. Factors that determine efficiency are mixer design, drop size generated, and phase coalescence properties. The original development work and accumulated plant data confirm that the tip speed of a given impeller design determines the throughput capacity and extraction performance. An experimental unit with three full-scale stages has been constructed and is being utilized to test different impeller designs; reduced pumping and better mixing with lower speeds appear to be the key factors for improvement. Decontamination performance of the rapid-contact centrifugal contactors is limited by the number of scrub contacts and the time of contact because of slowly equilibrating fission product species. Where solvent degradation is not a factor, the longer scrub contact of mixer-settlers gives better decontamination than the centrifugals. This kinetic effect can be overcome with long scrub contacts that follow the initial short extraction and short scrub contacts in the centrifugal contactors. A hybrid experimental unit with both rapid contact sections and longer contact scrub sections is under development to establish the degree of improvement that might be attained

  1. Generalized r-Lah numbers

    Indian Academy of Sciences (India)

    016-0309-0. Generalized r-Lah numbers. MARK SHATTUCK. Department of ...... of Dowling lattices, Discrete Math. 312. (2012) 2337–2348. [7] Hsu L C and Shiue P J-S, A unified approach to generalized Stirling numbers, Adv. Appl. Math.

  2. Number theory and its history

    CERN Document Server

    Ore, Oystein

    1988-01-01

    A prominent mathematician presents the principal ideas and methods of number theory within a historical and cultural framework. Oystein Ore's fascinating, accessible treatment requires only a basic knowledge of algebra. Topics include prime numbers, the Aliquot parts, linear indeterminate problems, congruences, Euler's theorem, classical construction problems, and many other subjects.

  3. Investigating the Randomness of Numbers

    Science.gov (United States)

    Pendleton, Kenn L.

    2009-01-01

    The use of random numbers is pervasive in today's world. Random numbers have practical applications in such far-flung arenas as computer simulations, cryptography, gambling, the legal system, statistical sampling, and even the war on terrorism. Evaluating the randomness of extremely large samples is a complex, intricate process. However, the…

  4. Fractions, Number Lines, Third Graders

    Science.gov (United States)

    Cramer, Kathleen; Ahrendt, Sue; Monson, Debra; Wyberg, Terry; Colum, Karen

    2017-01-01

    The Common Core State Standards for Mathematics (CCSSM) (CCSSI 2010) outlines ambitious goals for fraction learning, starting in third grade, that include the use of the number line model. Understanding and constructing fractions on a number line are particularly complex tasks. The current work of the authors centers on ways to successfully…

  5. On Counting the Rational Numbers

    Science.gov (United States)

    Almada, Carlos

    2010-01-01

    In this study, we show how to construct a function from the set N of natural numbers that explicitly counts the set Q[superscript +] of all positive rational numbers using a very intuitive approach. The function has the appeal of Cantor's function and it has the advantage that any high school student can understand the main idea at a glance…

  6. Core Knowledge, Language, and Number

    Science.gov (United States)

    Spelke, Elizabeth S.

    2017-01-01

    The natural numbers may be our simplest, most useful, and best-studied abstract concepts, but their origins are debated. I consider this debate in the context of the proposal, by Gallistel and Gelman, that natural number system is a product of cognitive evolution and the proposal, by Carey, that it is a product of human cultural history. I offer a…

  7. The Algebra of Complex Numbers.

    Science.gov (United States)

    LePage, Wilbur R.

    This programed text is an introduction to the algebra of complex numbers for engineering students, particularly because of its relevance to important problems of applications in electrical engineering. It is designed for a person who is well experienced with the algebra of real numbers and calculus, but who has no experience with complex number…

  8. Path-fan Ramsey numbers

    NARCIS (Netherlands)

    Salman, M.; Broersma, Haitze J.

    2003-01-01

    For two given graphs $G$ and $H$, the Ramsey number $R(G,H)$ is the smallest positive integer $p$ such that for every graph $F$ on $p$ vertices the following holds: either $F$ contains $G$ as a subgraph or the complement of $F$ contains $H$ as a subgraph. In this paper, we study the Ramsey numbers

  9. Path-fan Ramsey numbers

    NARCIS (Netherlands)

    Salman, M.; Broersma, Haitze J.

    For two given graphs $F$ and $H$, the Ramsey number $R(F,H)$ is the smallest positive integer $p$ such that for every graph $G$ on $p$ vertices the following holds: either $G$ contains $F$ as a subgraph or the complement of $G$ contains $H$ as a subgraph. In this paper, we study the Ramsey numbers

  10. Path-kipas Ramsey numbers

    NARCIS (Netherlands)

    Salman, M.; Broersma, Haitze J.

    2007-01-01

    For two given graphs $F$ and $H$, the Ramsey number $R(F,H)$ is the smallest positive integer $p$ such that for every graph $G$ on $p$ vertices the following holds: either $G$ contains $F$ as a subgraph or the complement of $G$ contains $H$ as a subgraph. In this paper, we study the Ramsey numbers

  11. China's energy efficiency target 2010

    International Nuclear Information System (INIS)

    Yang Ming

    2008-01-01

    The Chinese government has set an ambitious target: reducing China's energy intensity by 20%, or 4.36% each year between 2006 and 2010 on the 2005 level. Real data showed that China missed its target in 2006, having reduced its energy intensity only by 1.3%. The objective of this study is to evaluate the feasibility and potential of the Chinese to achieve the target. This paper presents issues of macro-economy, population migration, energy savings, and energy efficiency policy measures to achieve the target. A top-down approach was used to analyse the relationship between the Chinese economic development and energy demand cycles and to identify the potentials of energy savings in sub-sectors of the Chinese economy. A number of factors that contribute to China's energy intensity are identified in a number of energy-intensive sectors. This paper concludes that China needs to develop its economy at its potential GDP growth rate; strengthen energy efficiency auditing, monitoring and verification; change its national economy from a heavy-industry-dominated mode to a light industry or a commerce-dominated mode; phase out inefficient equipment in industrial sectors; develop mass and fast railway transportation; and promote energy-efficient technologies at the end use. This paper transfers key messages to policy makers for designing their policy to achieve China's energy efficiency target

  12. Numerical calculation of particle collection efficiency in an ...

    Indian Academy of Sciences (India)

    Theoretical and numerical research has been previously done on ESPs to predict the efficiency ... Lagrangian simulations of particle transport in wire–plate ESP were .... The collection efficiency can be defined as the ratio of the number of ...

  13. From natural numbers to quaternions

    CERN Document Server

    Kramer, Jürg

    2017-01-01

    This textbook offers an invitation to modern algebra through number systems of increasing complexity, beginning with the natural numbers and culminating with Hamilton's quaternions. Along the way, the authors carefully develop the necessary concepts and methods from abstract algebra: monoids, groups, rings, fields, and skew fields. Each chapter ends with an appendix discussing related topics from algebra and number theory, including recent developments reflecting the relevance of the material to current research. The present volume is intended for undergraduate courses in abstract algebra or elementary number theory. The inclusion of exercises with solutions also makes it suitable for self-study and accessible to anyone with an interest in modern algebra and number theory.

  14. Generalized Bernoulli-Hurwitz numbers and the universal Bernoulli numbers

    Energy Technology Data Exchange (ETDEWEB)

    Onishi, Yoshihiro [Faculty of Education Human Sciences, University of Yamanashi, Takeda, Kofu (Japan)

    2011-10-31

    The three fundamental properties of the Bernoulli numbers, namely, the von Staudt-Clausen theorem, von Staudt's second theorem, and Kummer's original congruence, are generalized to new numbers that we call generalized Bernoulli-Hurwitz numbers. These are coefficients in the power series expansion of a higher-genus algebraic function with respect to a suitable variable. Our generalization differs strongly from previous works. Indeed, the order of the power of the modulus prime in our Kummer-type congruences is exactly the same as in the trigonometric function case (namely, Kummer's own congruence for the original Bernoulli numbers), and as in the elliptic function case (namely, H. Lang's extension for the Hurwitz numbers). However, in other past results on higher-genus algebraic functions, the modulus was at most half of its value in these classical cases. This contrast is clarified by investigating the analogue of the three properties above for the universal Bernoulli numbers. Bibliography: 34 titles.

  15. RAM-efficient external memory sorting

    DEFF Research Database (Denmark)

    Arge, Lars; Thorup, Mikkel

    2013-01-01

    In recent years a large number of problems have been considered in external memory models of computation, where the complexity measure is the number of blocks of data that are moved between slow external memory and fast internal memory (also called I/Os). In practice, however, internal memory time...... often dominates the total running time once I/O-efficiency has been obtained. In this paper we study algorithms for fundamental problems that are simultaneously I/O-efficient and internal memory efficient in the RAM model of computation....

  16. The Mortensen Rule and Efficient Coordination Unemployment

    DEFF Research Database (Denmark)

    Kennes, John; King, Ian; Julien, Benoit

    2006-01-01

    We apply the efficiency axioms of [Mortensen, D. (1982). Efficiency of mating, racing and related games. American Economic Review, 72 968–979.] to a set of matching games involving coordination frictions between buyers. These games include markets with finite numbers of buyers and sellers...... and markets with infinite numbers of heterogeneous buyers and homogenous sellers. We show that the Mortensen rule, but not the Hosios rule, gives constrained efficient allocations. We also show that the Mortensen rule is implemented by a simple auction...

  17. Low energy fermion number violation

    International Nuclear Information System (INIS)

    Peccei, R.D.

    1989-01-01

    After a brief aside on charge quantization in the standard electroweak theory, I concentrate on various aspects of anomaly induced fermion number violation in the standard model. A critical analysis of the role of sphalerons for the universe's baryon asymmetry is presented and the importance of calculating directly fermion number violating Green's functions is stressed. A physical interpretation of the recent observation of Ringwald, that coherent effects in the electroweak theory lead to catastrophic fermion number violation at 100 TeV, is discussed. Possible quantum effects which might spoil this semi-classical picture are examined

  18. Finding numbers in the brain.

    Science.gov (United States)

    Gallistel, C R

    2017-02-19

    After listing functional constraints on what numbers in the brain must do, I sketch the two's complement fixed-point representation of numbers because it has stood the test of time and because it illustrates the non-obvious ways in which an effective coding scheme may operate. I briefly consider its neurobiological implementation. It is easier to imagine its implementation at the cell-intrinsic molecular level, with thermodynamically stable, volumetrically minimal polynucleotides encoding the remembered numbers, than at the circuit level, with plastic synapses encoding them.This article is part of a discussion meeting issue 'The origins of numerical abilities'. © 2017 The Author(s).

  19. Fundamental number theory with applications

    CERN Document Server

    Mollin, Richard A

    2008-01-01

    An update of the most accessible introductory number theory text available, Fundamental Number Theory with Applications, Second Edition presents a mathematically rigorous yet easy-to-follow treatment of the fundamentals and applications of the subject. The substantial amount of reorganizing makes this edition clearer and more elementary in its coverage. New to the Second Edition           Removal of all advanced material to be even more accessible in scope           New fundamental material, including partition theory, generating functions, and combinatorial number theory           Expa

  20. Performance of Savonius Blade Waterwheel with Variation of Blade Number

    Science.gov (United States)

    Sule, L.; Rompas, P. T. D.

    2018-02-01

    The utilization of water energy source is mainly used as a provider of electrical energy through hydroelectric power. The potential utilization of water flow energy is relatively small. The objective of this study is to know the best blade of Savonius waterwheel with various variables such as water discharge, blade number, and loading. The data used the efficiency of waterwheel, variation of blade number, variable water discharge, and loading in the shaft. The test results have shown that the performances of a top-water mill with the semicircular curve where the variation in the number of blades are 4, 6, and 8 at discharge and loading of 0.01587 m3/s and 1000 grams respectively were 9.945%, 13.929%, and 17.056% respectively. The blades number of 8 obtained the greatest performance. The more number of blades the greater the efficiency of the waterwheel Savonius.

  1. Mitochondrial DNA Copy Number in Sleep Duration Discordant Monozygotic Twins

    DEFF Research Database (Denmark)

    Wrede, Joanna E; Mengel-From, Jonas; Buchwald, Dedra

    2015-01-01

    STUDY OBJECTIVES: Mitochondrial DNA (mtDNA) copy number is an important component of mitochondrial function and varies with age, disease, and environmental factors. We aimed to determine whether mtDNA copy number varies with habitual differences in sleep duration within pairs of monozygotic twins...... structure to assess within-pair effects of sleep duration on mtDNA copy number. MEASUREMENTS AND RESULTS: Mean within-pair sleep duration difference per 24 hours was 94.3 minutes (SD 62.6 min). We found reduced sleep duration (β = 0.06; 95% CI 0.004, 0.12; P sleep efficiency (β = 0.51; 95% CI 0.......06, 0.95; P DNA copy number within twin pairs. Thus every 1-minute decrease in actigraphy-defined sleep duration was associated with a decrease in mtDNA copy number of 0.06. Likewise, a 1% decrease in actigraphy-defined sleep efficiency was associated...

  2. Experimental Study of the Effect of Octane Number on the

    Directory of Open Access Journals (Sweden)

    Raed R. Jasem

    2013-05-01

    Full Text Available The experiments had been carried out using two stroke, single cylinder type (TD113, with compression ratio of (7.3:1 Coupled to hydraulic dynamometer type (TD115.          The results showed that there is  enhancement   of the engine  performance  with increasing octane number. This appears clearly when comparing the results of performance with fuel of 75 and 95 octane number.The torque increases 10% at speed of 2750 RPM. The break power also increases 18% when the octane number changed from 75 to 95 at 3000 RPM of engine speed. The same change in octane number will increase the thermal efficiency by 9% at 2300 RPM of engine speed. The break specific fuel consumption decreases at the same ratio of thermal efficiency 9% but at 2400 RPM. The less fuel consumption happens at 2400 RPM for octane number 95. 

  3. Classical theory of algebraic numbers

    CERN Document Server

    Ribenboim, Paulo

    2001-01-01

    Gauss created the theory of binary quadratic forms in "Disquisitiones Arithmeticae" and Kummer invented ideals and the theory of cyclotomic fields in his attempt to prove Fermat's Last Theorem These were the starting points for the theory of algebraic numbers, developed in the classical papers of Dedekind, Dirichlet, Eisenstein, Hermite and many others This theory, enriched with more recent contributions, is of basic importance in the study of diophantine equations and arithmetic algebraic geometry, including methods in cryptography This book has a clear and thorough exposition of the classical theory of algebraic numbers, and contains a large number of exercises as well as worked out numerical examples The Introduction is a recapitulation of results about principal ideal domains, unique factorization domains and commutative fields Part One is devoted to residue classes and quadratic residues In Part Two one finds the study of algebraic integers, ideals, units, class numbers, the theory of decomposition, iner...

  4. Microcomputer Unit: Generating Random Numbers.

    Science.gov (United States)

    Haigh, William E.

    1986-01-01

    Presents an activity, suitable for students in grades 6-12, on generating random numbers. Objectives, equipment needed, list of prerequisite experiences, instructional strategies, and ready-to-copy student worksheets are included. (JN)

  5. Number theory via Representation theory

    Indian Academy of Sciences (India)

    2014-11-09

    Number theory via Representation theory. Eknath Ghate. November 9, 2014. Eightieth Annual Meeting, Chennai. Indian Academy of Sciences1. 1. This is a non-technical 20 minute talk intended for a general Academy audience.

  6. SEVIS By the Numbers 2014

    Data.gov (United States)

    Department of Homeland Security — SEVIS by the Numbers is a quarterly report that highlights nonimmigrant student and exchange visitor trends, values and information using data from the Student and...

  7. SEVIS By the Numbers 2016

    Data.gov (United States)

    Department of Homeland Security — SEVIS by the Numbers is a quarterly report that highlights nonimmigrant student and exchange visitor trends, values and information using data from the Student and...

  8. Additive theory of prime numbers

    CERN Document Server

    Hua, L K

    2009-01-01

    Loo-Keng Hua was a master mathematician, best known for his work using analytic methods in number theory. In particular, Hua is remembered for his contributions to Waring's Problem and his estimates of trigonometric sums. Additive Theory of Prime Numbers is an exposition of the classic methods as well as Hua's own techniques, many of which have now also become classic. An essential starting point is Vinogradov's mean-value theorem for trigonometric sums, which Hua usefully rephrases and improves. Hua states a generalized version of the Waring-Goldbach problem and gives asymptotic formulas for the number of solutions in Waring's Problem when the monomial x^k is replaced by an arbitrary polynomial of degree k. The book is an excellent entry point for readers interested in additive number theory. It will also be of value to those interested in the development of the now classic methods of the subject.

  9. Advanced number theory with applications

    CERN Document Server

    Mollin, Richard A

    2009-01-01

    Algebraic Number Theory and Quadratic Fields Algebraic Number Fields The Gaussian Field Euclidean Quadratic Fields Applications of Unique Factorization Ideals The Arithmetic of Ideals in Quadratic Fields Dedekind Domains Application to Factoring Binary Quadratic Forms Basics Composition and the Form Class Group Applications via Ambiguity Genus Representation Equivalence Modulo p Diophantine Approximation Algebraic and Transcendental Numbers Transcendence Minkowski's Convex Body Theorem Arithmetic Functions The Euler-Maclaurin Summation Formula Average Orders The Riemann zeta-functionIntroduction to p-Adic AnalysisSolving Modulo pn Introduction to Valuations Non-Archimedean vs. Archimedean Valuations Representation of p-Adic NumbersDirichlet: Characters, Density, and Primes in Progression Dirichlet Characters Dirichlet's L-Function and Theorem Dirichlet DensityApplications to Diophantine Equations Lucas-Lehmer Theory Generalized Ramanujan-Nagell Equations Bachet's Equation The Fermat Equation Catalan and the A...

  10. Integral Presentations of Catalan Numbers

    Science.gov (United States)

    Dana-Picard, Thierry

    2010-01-01

    We compute in three different ways the same definite parametric integral. By-products are the derivation of a combinatorial identity and two integral presentations of Catalan numbers. One of them leads to a presentation using the [gamma] function.

  11. Numbers their history and meaning

    CERN Document Server

    Flegg, Graham

    2003-01-01

    Readable, jargon-free book examines the earliest endeavors to count and record numbers, initial attempts to solve problems by using equations, and origins of infinite cardinal arithmetic. "Surprisingly exciting." - Choice.

  12. Poison control center - emergency number

    Science.gov (United States)

    For a POISON EMERGENCY call: 1-800-222-1222 ANYWHERE IN THE UNITED STATES This national hotline number will let you ... is a free and confidential service. All local poison control centers in the United States use this ...

  13. Women In Numbers - Europe workshop

    CERN Document Server

    Bucur, Alina; Feigon, Brooke; Schneps, Leila

    2015-01-01

    Covering topics in graph theory, L-functions, p-adic geometry, Galois representations, elliptic fibrations, genus 3 curves and bad reduction, harmonic analysis, symplectic groups and mould combinatorics, this volume presents a collection of papers covering a wide swath of number theory emerging from the third iteration of the international Women in Numbers conference, “Women in Numbers - Europe” (WINE), held on October 14–18, 2013 at the CIRM-Luminy mathematical conference center in France. While containing contributions covering a wide range of cutting-edge topics in number theory, the volume emphasizes those concrete approaches that make it possible for graduate students and postdocs to begin work immediately on research problems even in highly complex subjects.

  14. Digital random-number generator

    Science.gov (United States)

    Brocker, D. H.

    1973-01-01

    For binary digit array of N bits, use N noise sources to feed N nonlinear operators; each flip-flop in digit array is set by nonlinear operator to reflect whether amplitude of generator which feeds it is above or below mean value of generated noise. Fixed-point uniform distribution random number generation method can also be used to generate random numbers with other than uniform distribution.

  15. Random numbers from vacuum fluctuations

    International Nuclear Information System (INIS)

    Shi, Yicheng; Kurtsiefer, Christian; Chng, Brenda

    2016-01-01

    We implement a quantum random number generator based on a balanced homodyne measurement of vacuum fluctuations of the electromagnetic field. The digitized signal is directly processed with a fast randomness extraction scheme based on a linear feedback shift register. The random bit stream is continuously read in a computer at a rate of about 480 Mbit/s and passes an extended test suite for random numbers.

  16. Numbers for reducible cubic scrolls

    Directory of Open Access Journals (Sweden)

    Israel Vainsencher

    2004-12-01

    Full Text Available We show how to compute the number of reducible cubic scrolls of codimension 2 in (math blackboard symbol Pn incident to the appropriate number of linear spaces.Mostramos como calcular o número de rolos cúbicos redutíveis de codimensão 2 em (math blackboard symbol Pn incidentes a espaços lineares apropriados.

  17. Random numbers from vacuum fluctuations

    Energy Technology Data Exchange (ETDEWEB)

    Shi, Yicheng; Kurtsiefer, Christian, E-mail: christian.kurtsiefer@gmail.com [Department of Physics, National University of Singapore, 2 Science Drive 3, Singapore 117542 (Singapore); Center for Quantum Technologies, National University of Singapore, 3 Science Drive 2, Singapore 117543 (Singapore); Chng, Brenda [Center for Quantum Technologies, National University of Singapore, 3 Science Drive 2, Singapore 117543 (Singapore)

    2016-07-25

    We implement a quantum random number generator based on a balanced homodyne measurement of vacuum fluctuations of the electromagnetic field. The digitized signal is directly processed with a fast randomness extraction scheme based on a linear feedback shift register. The random bit stream is continuously read in a computer at a rate of about 480 Mbit/s and passes an extended test suite for random numbers.

  18. Banner prints social security numbers

    OpenAIRE

    Robbins RA

    2014-01-01

    No abstract available. Article truncated at 150 words. The Monday edition of the Arizona Republic contained a story with potential interest to our readers. On the most recent address labels of Banner Health's magazine, Smart & Healthy, the addressee's Social Security or Medicare identification numbers, which are often identical to their Social Security numbers (1). The magazine was mailed to more than 50,000 recipients in Arizona late last week. The recipients are members of the Medicare Pion...

  19. Software for calculation the number of lamps, luminaries and its distribution in the environment aiming the efficient use of electric power; Software para o calculo do numero de lampadas, luminarias e da distribuicao no ambiente visando o uso eficiente da energia eletrica

    Energy Technology Data Exchange (ETDEWEB)

    Souza, Teofilo Miguel de; Bianchi, Inacio [Universidade Estadual Paulista (UNESP), Guaratingueta, SP (Brazil). Dept. de Engenharia Eletrica. Centro de Energias Renovaveis], e-mail: teofilo@feg.unesp.br, e-mail: ibianchi@feg.unesp.br

    2004-07-01

    In Brazil artificial lighting contributes with expressive value to electric power consumption. Good performance of lighting system depends of criterion fixed on the electric design conception that takes into account the information about lamps, environment and type of work carried on the local. This paper presents an easy of use and low computational requirements software used to choice lamps, fixtures and its lay-out aiming a good and efficient illumination system design. Its textual format results are displayed at the video monitor, and stored in files, and can be printed and attached to the technical memorial report. So, a presentation of several design options can be furnished quickly through the software for an economic pre-analysis of illumination design. (author)

  20. Higher-order Nielsen numbers

    Directory of Open Access Journals (Sweden)

    Saveliev Peter

    2005-01-01

    Full Text Available Suppose , are manifolds, are maps. The well-known coincidence problem studies the coincidence set . The number is called the codimension of the problem. More general is the preimage problem. For a map and a submanifold of , it studies the preimage set , and the codimension is . In case of codimension , the classical Nielsen number is a lower estimate of the number of points in changing under homotopies of , and for an arbitrary codimension, of the number of components of . We extend this theory to take into account other topological characteristics of . The goal is to find a "lower estimate" of the bordism group of . The answer is the Nielsen group defined as follows. In the classical definition, the Nielsen equivalence of points of based on paths is replaced with an equivalence of singular submanifolds of based on bordisms. We let , then the Nielsen group of order is the part of preserved under homotopies of . The Nielsen number of order is the rank of this group (then . These numbers are new obstructions to removability of coincidences and preimages. Some examples and computations are provided.

  1. Dimensionless numbers in additive manufacturing

    Science.gov (United States)

    Mukherjee, T.; Manvatkar, V.; De, A.; DebRoy, T.

    2017-02-01

    The effects of many process variables and alloy properties on the structure and properties of additively manufactured parts are examined using four dimensionless numbers. The structure and properties of components made from 316 Stainless steel, Ti-6Al-4V, and Inconel 718 powders for various dimensionless heat inputs, Peclet numbers, Marangoni numbers, and Fourier numbers are studied. Temperature fields, cooling rates, solidification parameters, lack of fusion defects, and thermal strains are examined using a well-tested three-dimensional transient heat transfer and fluid flow model. The results show that lack of fusion defects in the fabricated parts can be minimized by strengthening interlayer bonding using high values of dimensionless heat input. The formation of harmful intermetallics such as laves phases in Inconel 718 can be suppressed using low heat input that results in a small molten pool, a steep temperature gradient, and a fast cooling rate. Improved interlayer bonding can be achieved at high Marangoni numbers, which results in vigorous circulation of liquid metal, larger pool dimensions, and greater depth of penetration. A high Fourier number ensures rapid cooling, low thermal distortion, and a high ratio of temperature gradient to the solidification growth rate with a greater tendency of plane front solidification.

  2. Grammatical typology and frequency analysis: number availability and number use

    Directory of Open Access Journals (Sweden)

    Dunstan Brown

    2013-12-01

    Full Text Available The Smith-Stark hierarchy, a version of the Animacy Hierarchy, offers a typology of the cross-linguistic availability of number. The hierarchy predicts that the availability of number is not arbitrary. For any language, if the expression of plural is available to a noun, it is available to any noun of a semantic category further to the left of the hierarchy. In this article we move one step further by showing that the structure of the hierarchy can be observed in a statistical model of number use in Russian. We also investigate three co-variates: plural preference, pluralia tantum and irregularity effects; these account for an item's behaviour being different than that solely expected from its animacy position.

  3. Reconsidering energy efficiency

    International Nuclear Information System (INIS)

    Goldoni, Giovanni

    2007-01-01

    Energy and environmental policies are reconsidering energy efficiency. In a perfect market, rational and well informed consumers reach economic efficiency which, at the given prices of energy and capital, corresponds to physical efficiency. In the real world, market failures and cognitive frictions distort the consumers from perfectly rational and informed choices. Green incentive schemes aim at balancing market failures and directing consumers toward more efficient goods and services. The problem is to fine tune the incentive schemes [it

  4. Energy efficiency; Efficacite energetique

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    2006-06-15

    This road-map proposes by the Group Total aims to inform the public on the energy efficiency. It presents the energy efficiency and intensity around the world with a particular focus on Europe, the energy efficiency in industry and Total commitment. (A.L.B.)

  5. From Natural Numbers to Numbers and Curves in Nature - II

    Indian Academy of Sciences (India)

    line grows from C towards both left and right. Suppose ... Let there be n steps of growth to the left, and n-l to the right. Then n .... right-hand spirals is 8 and that of left-hand .... [4] I Stewart, Nature's Numbers - Discovering Order and Pattern in the.

  6. Number Meaning and Number Grammar in English and Spanish

    Science.gov (United States)

    Bock, Kathryn; Carreiras, Manuel; Meseguer, Enrique

    2012-01-01

    Grammatical agreement makes different demands on speakers of different languages. Being widespread in the languages of the world, the features of agreement systems offer valuable tests of how language affects deep-seated domains of human cognition and categorization. Number agreement is one such domain, with intriguing evidence that typological…

  7. Development of fuel number reader by ultrasonic imaging techniques

    International Nuclear Information System (INIS)

    Omote, T.; Yoshida, T.

    1991-01-01

    This paper reports on a spent fuel ID number reader using ultrasonic imaging techniques that has been developed to realize efficient and automatic verification of fuel numbers, thereby to reduce mental load and radiation exposure for operators engaged in the verification task. The ultrasonic imaging techniques for automatic fuel number recognition are described. High-speed and high reliability imaging of the spent fuel ID number are obtained by using linear array type ultrasonic probe. The ultrasonic wave is scanned by switching array probe in vertical direction, and scanned mechanically in horizontal direction. Time for imaging of spent fuel ID number on assembly was confirmed less than three seconds by these techniques. And it can recognize spent fuel ID number even if spent fuel ID number can not be visualized by an optical method because of depositing fuel number regions by soft card. In order to recognize spent fuel ID number more rapidly and more reliably, coded fuel number expressed by plural separate recesses form is developed. Every coded fuel number consists of six small holes (about 1 mm dia.) and can be marked adjacent to the existing fuel number expressed by letters and numbers

  8. Experimental determination of Ramsey numbers.

    Science.gov (United States)

    Bian, Zhengbing; Chudak, Fabian; Macready, William G; Clark, Lane; Gaitan, Frank

    2013-09-27

    Ramsey theory is a highly active research area in mathematics that studies the emergence of order in large disordered structures. Ramsey numbers mark the threshold at which order first appears and are extremely difficult to calculate due to their explosive rate of growth. Recently, an algorithm that can be implemented using adiabatic quantum evolution has been proposed that calculates the two-color Ramsey numbers R(m,n). Here we present results of an experimental implementation of this algorithm and show that it correctly determines the Ramsey numbers R(3,3) and R(m,2) for 4≤m≤8. The R(8,2) computation used 84 qubits of which 28 were computational qubits. This computation is the largest experimental implementation of a scientifically meaningful adiabatic evolution algorithm that has been done to date.

  9. Stream ciphers and number theory

    CERN Document Server

    Cusick, Thomas W; Renvall, Ari R

    2004-01-01

    This is the unique book on cross-fertilisations between stream ciphers and number theory. It systematically and comprehensively covers known connections between the two areas that are available only in research papers. Some parts of this book consist of new research results that are not available elsewhere. In addition to exercises, over thirty research problems are presented in this book. In this revised edition almost every chapter was updated, and some chapters were completely rewritten. It is useful as a textbook for a graduate course on the subject, as well as a reference book for researchers in related fields. · Unique book on interactions of stream ciphers and number theory. · Research monograph with many results not available elsewhere. · A revised edition with the most recent advances in this subject. · Over thirty research problems for stimulating interactions between the two areas. · Written by leading researchers in stream ciphers and number theory.

  10. Sequences, groups, and number theory

    CERN Document Server

    Rigo, Michel

    2018-01-01

    This collaborative book presents recent trends on the study of sequences, including combinatorics on words and symbolic dynamics, and new interdisciplinary links to group theory and number theory. Other chapters branch out from those areas into subfields of theoretical computer science, such as complexity theory and theory of automata. The book is built around four general themes: number theory and sequences, word combinatorics, normal numbers, and group theory. Those topics are rounded out by investigations into automatic and regular sequences, tilings and theory of computation, discrete dynamical systems, ergodic theory, numeration systems, automaton semigroups, and amenable groups.  This volume is intended for use by graduate students or research mathematicians, as well as computer scientists who are working in automata theory and formal language theory. With its organization around unified themes, it would also be appropriate as a supplemental text for graduate level courses.

  11. Negative numbers and antimatter particles

    International Nuclear Information System (INIS)

    Tsan, Ung Chan

    2012-01-01

    Dirac's equation states that an electron implies the existence of an antielectron with the same mass (more generally same arithmetic properties) and opposite charge (more generally opposite algebraic properties). Subsequent observation of antielectron validated this concept. This statement can be extended to all matter particles; observation of antiproton, antineutron, antideuton … is in complete agreement with this view. Recently antihypertriton was observed and 38 atoms of antihydrogen were trapped. This opens the path for use in precise testing of nature's fundamental symmetries. The symmetric properties of a matter particle and its mirror antimatter particle seem to be well established. Interactions operate on matter particles and antimatter particles as well. Conservation of matter parallels addition operating on positive and negative numbers. Without antimatter particles, interactions of the Standard Model (electromagnetism, strong interaction and weak interaction) cannot have the structure of group. Antimatter particles are characterized by negative baryonic number A or/and negative leptonic number L. Materialization and annihilation obey conservation of A and L (associated to all known interactions), explaining why from pure energy (A = 0, L = 0) one can only obtain a pair of matter particle antimatter particle — electron antielectron, proton and antiproton — via materialization where the mass of a pair of particle antiparticle gives back to pure energy with annihilation. These two mechanisms cannot change the difference in the number of matter particles and antimatter particles. Thus from pure energy only a perfectly symmetric (in number) universe could be generated as proposed by Dirac but observation showed that our universe is not symmetric, it is a matter universe which is nevertheless neutral. Fall of reflection symmetries shattered the prejudice that there is no way to define in an absolute way right and left or matter and antimatter

  12. World Epidemiology Review, Number 105.

    Science.gov (United States)

    1978-09-13

    respectively last year. Not Siberian The official stated that the Soviet virus is not related to the famous pathogenic agent which appeared in the Siberian...numbers of aphids are due to appear on the alfalfa in the near future. The infestation has approached and even exceeded the extent at which serious

  13. Counting problems for number rings

    NARCIS (Netherlands)

    Brakenhoff, Johannes Franciscus

    2009-01-01

    In this thesis we look at three counting problems connected to orders in number fields. First we study the probability that for a random polynomial f in Z[X] the ring Z[X]/f is the maximal order in Q[X]/f. Connected to this is the probability that a random polynomial has a squarefree

  14. Linking numbers and variational method

    International Nuclear Information System (INIS)

    Oda, I.; Yahikozawa, S.

    1989-09-01

    The ordinary and generalized linking numbers for two surfaces of dimension p and n-p-1 in an n dimensional manifold are derived. We use a variational method based on the properties of topological quantum field theory in order to derive them. (author). 13 refs, 2 figs

  15. From Calculus to Number Theory

    Indian Academy of Sciences (India)

    A. Raghuram

    2016-11-04

    Nov 4, 2016 ... diverges to infinity. This means given any number M, however large, we can add sufficiently many terms in the above series to make the sum larger than M. This was first proved by Nicole Oresme (1323-1382), a brilliant. French philosopher of his times.

  16. RELATIONSHIP BETWEEN SLUDGE DEWATERABILITY NUMBER ...

    African Journals Online (AJOL)

    A representative of a sludge sample collected from the same source was filtered under the same environmental condition and the result analysed with two different concepts. One method of analysis uses Sludge Dewaterability Number, while the second employed the Carman's Specific resistance concept in sludge ...

  17. Materiales. Numbers 17-20.

    Science.gov (United States)

    Materiales, 1995

    1995-01-01

    Four booklets present articles on Spanish language and culture aimed at teachers of Spanish in the United States for student use in their classes. Number 17, "Los Jovenes Espanoles" (Spanish Youth), includes articles on Spanish youth sports, music, gangs, thoughts, and t-shirt slogans: (1) "Young Spanish Athletes"; (2)…

  18. Materiales. Numbers 21-23.

    Science.gov (United States)

    Materiales, 1997

    1997-01-01

    These three journals of contemporary cultural, historical, and social interest contain activities designed to enhance the awareness of students of Spanish as a foreign language regarding the entire panorama of daily life in Spain. Number 21 focuses on the role of modern Spanish women; their career status; female authors; and the changing place of…

  19. On badly approximable complex numbers

    DEFF Research Database (Denmark)

    Esdahl-Schou, Rune; Kristensen, S.

    We show that the set of complex numbers which are badly approximable by ratios of elements of , where has maximal Hausdorff dimension. In addition, the intersection of these sets is shown to have maximal dimension. The results remain true when the sets in question are intersected with a suitably...

  20. Models for Rational Number Bases

    Science.gov (United States)

    Pedersen, Jean J.; Armbruster, Frank O.

    1975-01-01

    This article extends number bases to negative integers, then to positive rationals and finally to negative rationals. Methods and rules for operations in positive and negative rational bases greater than one or less than negative one are summarized in tables. Sample problems are explained and illustrated. (KM)

  1. Learning Potentials in Number Blocks

    DEFF Research Database (Denmark)

    Majgaard, Gunver; Misfeldt, Morten; Nielsen, Jacob

    2012-01-01

    This paper describes an initial exploration of how an interactive cubic user-configurable modular robotic system can be used to support learning about numbers and how they are pronounced. The development is done in collaboration with a class of 7-8 year old children and their mathematics teacher....

  2. An introduction to Catalan numbers

    CERN Document Server

    Roman, Steven

    2015-01-01

    This textbook provides an introduction to the Catalan numbers and their remarkable properties, along with their various applications in combinatorics.  Intended to be accessible to students new to the subject, the book begins with more elementary topics before progressing to more mathematically sophisticated topics.  Each chapter focuses on a specific combinatorial object counted by these numbers, including paths, trees, tilings of a staircase, null sums in Zn+1, interval structures, partitions, permutations, semiorders, and more.  Exercises are included at the end of book, along with hints and solutions, to help students obtain a better grasp of the material.  The text is ideal for undergraduate students studying combinatorics, but will also appeal to anyone with a mathematical background who has an interest in learning about the Catalan numbers. “Roman does an admirable job of providing an introduction to Catalan numbers of a different nature from the previous ones.  He has made an excellent choice o...

  3. Strouhal number for free swimming

    Science.gov (United States)

    Saadat, Mehdi; van Buren, Tyler; Floryan, Daniel; Smits, Alexander; Haj-Hariri, Hossein

    2015-11-01

    In this work, we present experimental results to explore the implications of free swimming for Strouhal number (as an outcome) in the context of a simple model for a fish that consists of a 2D virtual body (source of drag) and a 2D pitching foil (source of thrust) representing cruising with thunniform locomotion. The results validate the findings of Saadat and Haj-Hariri (2012): for pitching foils thrust coefficient is a function of Strouhal number for all gaits having amplitude less than a certain critical value. Equivalently, given the balance of thrust and drag forces at cruise, Strouhal number is only a function of the shape, i.e. drag coefficient and area, and essentially a constant for high enough swimming speeds for which the mild dependence of drag coefficient on the speed vanishes. Furthermore, a dimensional analysis generalizes the findings. A scaling analysis shows that the variation of Strouhal number with cruising speed is functionally related to the variation of body drag coefficient with speed. Supported by ONR MURI Grant N00014-14-1-0533.

  4. Efficiency profile method to study the hit efficiency of drift chambers

    International Nuclear Information System (INIS)

    Abyzov, A.; Bel'kov, A.; Lanev, A.; Spiridonov, A.; Walter, M.; Hulsbergen, W.

    2002-01-01

    A method based on the usage of efficiency profile is proposed to estimate the hit efficiency of drift chambers with a large number of channels. The performance of the method under real conditions of the detector operation has been tested analysing the experimental data from the HERA-B drift chambers

  5. From entanglement witness to generalized Catalan numbers

    Science.gov (United States)

    Cohen, E.; Hansen, T.; Itzhaki, N.

    2016-07-01

    Being extremely important resources in quantum information and computation, it is vital to efficiently detect and properly characterize entangled states. We analyze in this work the problem of entanglement detection for arbitrary spin systems. It is demonstrated how a single measurement of the squared total spin can probabilistically discern separable from entangled many-particle states. For achieving this goal, we construct a tripartite analogy between the degeneracy of entanglement witness eigenstates, tensor products of SO(3) representations and classical lattice walks with special constraints. Within this framework, degeneracies are naturally given by generalized Catalan numbers and determine the fraction of states that are decidedly entangled and also known to be somewhat protected against decoherence. In addition, we introduce the concept of a “sterile entanglement witness”, which for large enough systems detects entanglement without affecting much the system’s state. We discuss when our proposed entanglement witness can be regarded as a sterile one.

  6. Efficient boiler operations sourcebook

    Energy Technology Data Exchange (ETDEWEB)

    Payne, F.W. (comp.)

    1985-01-01

    This book emphasizes the practical aspects of industrial and commercial boiler operations. It starts with a comprehensive review of general combustion and boiler fundamentals and then deals with specific efficiency improvement methods, and the cost savings which result. The book has the following chapter headings: boiler combustion fundamentals; boiler efficiency goals; major factors controlling boiler efficiency; boiler efficiency calculations; heat loss; graphical solutions; preparation for boiler testing; boiler test procedures; efficiency-related boiler maintenance procedures; boiler tune-up; boiler operational modifications; effect of water side and gas side scale deposits; load management; auxillary equipment to increase boiler efficiency; air preheaters and economizers; other types of auxillary equipment; combustion control systems and instrumentation; boiler O/sub 2/ trim controls; should you purchase a new boiler.; financial evaluation procedures; case studies. The last chapter includes a case study of a boiler burning pulverized coal and a case study of stoker-fired coal.

  7. Higher-order Nielsen numbers

    Directory of Open Access Journals (Sweden)

    Peter Saveliev

    2005-04-01

    Full Text Available Suppose X, Y are manifolds, f,g:X→Y are maps. The well-known coincidence problem studies the coincidence set C={x:f(x=g(x}. The number m=dim X−dim Y is called the codimension of the problem. More general is the preimage problem. For a map f:X→Z and a submanifold Y of Z, it studies the preimage set C={x:f(x∈Y}, and the codimension is m=dim X+dim Y−dim Z. In case of codimension 0, the classical Nielsen number N(f,Y is a lower estimate of the number of points in C changing under homotopies of f, and for an arbitrary codimension, of the number of components of C. We extend this theory to take into account other topological characteristics of C. The goal is to find a “lower estimate” of the bordism group Ωp(C of C. The answer is the Nielsen group Sp(f,Y defined as follows. In the classical definition, the Nielsen equivalence of points of C based on paths is replaced with an equivalence of singular submanifolds of C based on bordisms. We let Sp'(f,Y=Ωp(C/∼N, then the Nielsen group of order p is the part of Sp'(f,Y preserved under homotopies of f. The Nielsen number Np(F,Y of order p is the rank of this group (then N(f,Y=N0(f,Y. These numbers are new obstructions to removability of coincidences and preimages. Some examples and computations are provided.

  8. Vortex Shedding from Tapered Cylinders at high Reynolds Numbers

    DEFF Research Database (Denmark)

    Johansson, Jens; Andersen, Michael Styrk; Christensen, Silas Sverre

    2015-01-01

    percent for strakes of circular cross section. The present paper argues that this height can be reduced for structures where the critical wind velocity for vortex shedding is in the Supercritical Reynolds number regime. The present investigations are aimed for suppressing VIV on offshore wind turbine......^5 (Supercritical). Results indicate that circular strakes with a diameter corresponding to 3 percent of the structures mean diameter can be used to efficiently reduce VIV in the Supercritical Reynolds number regime....

  9. Educated for Efficiency

    DEFF Research Database (Denmark)

    Amore, Mario Daniele; Bennedsen, Morten; Larsen, Birthe

    We study the effect of CEO education on a firm’s energy efficiency. Using a unique dataset of Danish firms, we document that firms led by more educated CEOs exhibit greater energy efficiency. We establish causality by employing exogenous CEO hospitalization episodes: the hospitalization of highly......-educated CEOs induces a drop in a firm’s energy efficiency, whereas the hospitalization of low-education CEOs does not have any significant effect. Disentangling the effect of educational length from that of the field of study, we find that the greater energy efficiency is mostly driven by the cumulated years...

  10. 75 FR 32177 - Energy Efficiency Program for Consumer Products: Commonwealth of Massachusetts Petition for...

    Science.gov (United States)

    2010-06-07

    ... DEPARTMENT OF ENERGY Office of Energy Efficiency and Renewable Energy [Docket Number EERE-BT-PET-0024] Energy Efficiency Program for Consumer Products: Commonwealth of Massachusetts Petition for Exemption From Federal Preemption of Massachusetts' Energy Efficiency Standard for Residential Non...

  11. Gaussian distribution of LMOV numbers

    Directory of Open Access Journals (Sweden)

    A. Mironov

    2017-11-01

    Full Text Available Recent advances in knot polynomial calculus allowed us to obtain a huge variety of LMOV integers counting degeneracy of the BPS spectrum of topological theories on the resolved conifold and appearing in the genus expansion of the plethystic logarithm of the Ooguri–Vafa partition functions. Already the very first look at this data reveals that the LMOV numbers are randomly distributed in genus (! and are very well parameterized by just three parameters depending on the representation, an integer and the knot. We present an accurate formulation and evidence in support of this new puzzling observation about the old puzzling quantities. It probably implies that the BPS states, counted by the LMOV numbers can actually be composites made from some still more elementary objects.

  12. Number-theory dark matter

    Energy Technology Data Exchange (ETDEWEB)

    Nakayama, Kazunori [Theory Center, KEK, 1-1 Oho, Tsukuba, Ibaraki 305-0801 (Japan); Takahashi, Fuminobu, E-mail: fumi@tuhep.phys.tohoku.ac.jp [Department of Physics, Tohoku University, Sendai 980-8578 (Japan); Institute for the Physics and Mathematics of the Universe, University of Tokyo, Kashiwa 277-8568 (Japan); Yanagida, Tsutomu T. [Institute for the Physics and Mathematics of the Universe, University of Tokyo, Kashiwa 277-8568 (Japan); Department of Physics, University of Tokyo, Tokyo 113-0033 (Japan)

    2011-05-23

    We propose that the stability of dark matter is ensured by a discrete subgroup of the U(1){sub B-L} gauge symmetry, Z{sub 2}(B-L). We introduce a set of chiral fermions charged under the U(1){sub B-L} in addition to the right-handed neutrinos, and require the anomaly-cancellation conditions associated with the U(1){sub B-L} gauge symmetry. We find that the possible number of fermions and their charges are tightly constrained, and that non-trivial solutions appear when at least five additional chiral fermions are introduced. The Fermat theorem in the number theory plays an important role in this argument. Focusing on one of the solutions, we show that there is indeed a good candidate for dark matter, whose stability is guaranteed by Z{sub 2}(B-L).

  13. Number-theory dark matter

    International Nuclear Information System (INIS)

    Nakayama, Kazunori; Takahashi, Fuminobu; Yanagida, Tsutomu T.

    2011-01-01

    We propose that the stability of dark matter is ensured by a discrete subgroup of the U(1) B-L gauge symmetry, Z 2 (B-L). We introduce a set of chiral fermions charged under the U(1) B-L in addition to the right-handed neutrinos, and require the anomaly-cancellation conditions associated with the U(1) B-L gauge symmetry. We find that the possible number of fermions and their charges are tightly constrained, and that non-trivial solutions appear when at least five additional chiral fermions are introduced. The Fermat theorem in the number theory plays an important role in this argument. Focusing on one of the solutions, we show that there is indeed a good candidate for dark matter, whose stability is guaranteed by Z 2 (B-L).

  14. More Sets, Graphs and Numbers

    CERN Document Server

    Gyori, Ervin; Lovasz, Laszlo

    2006-01-01

    This volume honours the eminent mathematicians Vera Sos and Andras Hajnal. The book includes survey articles reviewing classical theorems, as well as new, state-of-the-art results. Also presented are cutting edge expository research papers with new theorems and proofs in the area of the classical Hungarian subjects, like extremal combinatorics, colorings, combinatorial number theory, etc. The open problems and the latest results in the papers are sure to inspire further research.

  15. Large number discrimination by mosquitofish.

    Directory of Open Access Journals (Sweden)

    Christian Agrillo

    Full Text Available BACKGROUND: Recent studies have demonstrated that fish display rudimentary numerical abilities similar to those observed in mammals and birds. The mechanisms underlying the discrimination of small quantities (<4 were recently investigated while, to date, no study has examined the discrimination of large numerosities in fish. METHODOLOGY/PRINCIPAL FINDINGS: Subjects were trained to discriminate between two sets of small geometric figures using social reinforcement. In the first experiment mosquitofish were required to discriminate 4 from 8 objects with or without experimental control of the continuous variables that co-vary with number (area, space, density, total luminance. Results showed that fish can use the sole numerical information to compare quantities but that they preferentially use cumulative surface area as a proxy of the number when this information is available. A second experiment investigated the influence of the total number of elements to discriminate large quantities. Fish proved to be able to discriminate up to 100 vs. 200 objects, without showing any significant decrease in accuracy compared with the 4 vs. 8 discrimination. The third experiment investigated the influence of the ratio between the numerosities. Performance was found to decrease when decreasing the numerical distance. Fish were able to discriminate numbers when ratios were 1:2 or 2:3 but not when the ratio was 3:4. The performance of a sample of undergraduate students, tested non-verbally using the same sets of stimuli, largely overlapped that of fish. CONCLUSIONS/SIGNIFICANCE: Fish are able to use pure numerical information when discriminating between quantities larger than 4 units. As observed in human and non-human primates, the numerical system of fish appears to have virtually no upper limit while the numerical ratio has a clear effect on performance. These similarities further reinforce the view of a common origin of non-verbal numerical systems in all

  16. DISCRETE MATHEMATICS/NUMBER THEORY

    OpenAIRE

    Mrs. Manju Devi*

    2017-01-01

    Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous. In contrast to real numbers that have the property of varying "smoothly", the objects studied in discrete mathematics such as integers, graphs, and statements do not vary smoothly in this way, but have distinct, separated values. Discrete mathematics therefore excludes topics in "continuous mathematics" such as calculus and analysis. Discrete objects can often be enumerated by ...

  17. Number systems and combinatorial problems

    OpenAIRE

    Yordzhev, Krasimir

    2014-01-01

    The present work has been designed for students in secondary school and their teachers in mathematics. We will show how with the help of our knowledge of number systems we can solve problems from other fields of mathematics for example in combinatorial analysis and most of all when proving some combinatorial identities. To demonstrate discussed in this article method we have chosen several suitable mathematical tasks.

  18. World Epidemiology Review, Number 109.

    Science.gov (United States)

    1978-10-11

    infantilism, "lung color," monale, followed by cardiac deficiency, cyanosis, intestinal stenosis ; glomerulonephritis and neurological symptoms. Many...Bursa were infected by rabid dogs and cats. The following breakdown was given for the number of persons infected during the succeeding 7 months of...area it is much more difficult to save his life. One of the six dogs taken into custody under the suspicion of being rabid during the past 8 months

  19. Number theory meets Higgs physics

    CERN Multimedia

    CERN. Geneva

    2014-01-01

    Inspired by results from modern number theory and algebraic geometry, a lot of progress has recently been made regarding the computation of multi-loop integrals and scattering amplitudes. I will discuss various new approaches to the computation of loop integrals, and illustrate them on the first computation of a quantity at N3LO in perturbative QCD, the soft-virtual part of the inclusive Higgs-boson cross section in gluon fusion at N3LO.

  20. Residual number processing in dyscalculia ?

    OpenAIRE

    Cappelletti, Marinella; Price, Cathy J.

    2013-01-01

    Developmental dyscalculia – a congenital learning disability in understanding numerical concepts – is typically associated with parietal lobe abnormality. However, people with dyscalculia often retain some residual numerical abilities, reported in studies that otherwise focused on abnormalities in the dyscalculic brain. Here we took a different perspective by focusing on brain regions that support residual number processing in dyscalculia. All participants accurately performed semantic and ca...

  1. Secular Love number of Phobos

    International Nuclear Information System (INIS)

    Bursa, M.

    1988-01-01

    The secular Love number of Phobos was estimated k s =10.4. It only deviates by one order of magnitude from that corresponding to the ideal equilibrium state. It is not in contradiction with the theory of the origin of Phobos as a result of the accretion around Mars. In its early history, the rotation period of Phobos had been estimated to be approx. 2.4 hours. (author). 1 tab., 4 refs

  2. An efficient quantum algorithm for spectral estimation

    Science.gov (United States)

    Steffens, Adrian; Rebentrost, Patrick; Marvian, Iman; Eisert, Jens; Lloyd, Seth

    2017-03-01

    We develop an efficient quantum implementation of an important signal processing algorithm for line spectral estimation: the matrix pencil method, which determines the frequencies and damping factors of signals consisting of finite sums of exponentially damped sinusoids. Our algorithm provides a quantum speedup in a natural regime where the sampling rate is much higher than the number of sinusoid components. Along the way, we develop techniques that are expected to be useful for other quantum algorithms as well—consecutive phase estimations to efficiently make products of asymmetric low rank matrices classically accessible and an alternative method to efficiently exponentiate non-Hermitian matrices. Our algorithm features an efficient quantum-classical division of labor: the time-critical steps are implemented in quantum superposition, while an interjacent step, requiring much fewer parameters, can operate classically. We show that frequencies and damping factors can be obtained in time logarithmic in the number of sampling points, exponentially faster than known classical algorithms.

  3. Efficient Resource Management in Cloud Computing

    OpenAIRE

    Rushikesh Shingade; Amit Patil; Shivam Suryawanshi; M. Venkatesan

    2015-01-01

    Cloud computing, one of the widely used technology to provide cloud services for users who are charged for receiving services. In the aspect of a maximum number of resources, evaluating the performance of Cloud resource management policies are difficult to optimize efficiently. There are different simulation toolkits available for simulation and modelling the Cloud computing environment like GridSim CloudAnalyst, CloudSim, GreenCloud, CloudAuction etc. In proposed Efficient Resource Manage...

  4. ENERGY EFFICIENT TRACKING SYSTEM USING WIRELESS SENSORS

    OpenAIRE

    Thankaselvi Kumaresan; Sheryl Mathias; Digja Khanvilkar; Prof. Smita Dange

    2014-01-01

    One of the most important applications of wireless sensor networks (WSNs) is surveillance system, which is used to track moving targets. WSN is composed of a large number of low cost sensors which operate on the power derived from batteries. Energy efficiency is an important issue in WSN, which determines the network lifetime. Due to the need for continuous monitoring with 100% efficiency, keeping all the sensor nodes active permanently leads to fast draining of batteries. Hen...

  5. Efficient Cardinality/Mean-Variance Portfolios

    OpenAIRE

    Brito, R. Pedro; Vicente, Luís Nunes

    2014-01-01

    International audience; We propose a novel approach to handle cardinality in portfolio selection, by means of a biobjective cardinality/mean-variance problem, allowing the investor to analyze the efficient tradeoff between return-risk and number of active positions. Recent progress in multiobjective optimization without derivatives allow us to robustly compute (in-sample) the whole cardinality/mean-variance efficient frontier, for a variety of data sets and mean-variance models. Our results s...

  6. Numbers Speak Where Words Fail

    DEFF Research Database (Denmark)

    Liu, Albert Fei

    2017-01-01

    ’s decision making model, this study posits that the two forms of OCRs (i.e., numerical ratings and opinionated reviews) facilitate consumers’ decisional processes in terms of the effectiveness of constructing consideration sets and the efficiency of arriving at a final decision. Consumers’ performance......Consumers are increasingly relying on online consumer reviews (OCRs) to facilitate their decision making process as a credible source of information. This study seeks to explicate why consumers deem OCRs as helpful and how they make use of OCRs in their decision making process. By drawing on Simon...... in decisional process in turn determines the justifiability of and the confidence in their decisional outcomes. To empirically test all the hypotheses proposed in this study, a field survey was conducted on users of a custom-developed online restaurant review website equipped with OCR curation features...

  7. Automatic spent fuel ID number reader (I)

    International Nuclear Information System (INIS)

    Tanabe, S.; Kawamoto, H.; Fujimaki, K.; Kobe, A.

    1991-01-01

    An effective and efficient technique has been developed for facilitating identification works of LWR spent fuel stored in large scale spent fuel storage pools of such as processing plants. Experience shows that there are often difficulties in the implementation of operator's nuclear material accountancy and control works as well as safeguards inspections conducted on spent fuel assemblies stored in deep water pool. This paper reports that the technique is realized as an automatic spent fuel ID number reader system installed on fuel handling machine. The ID number reader system consists of an optical sub-system and an image processing sub-system. Thousands of spent fuel assemblies stored in under water open racks in each storage pool could be identified within relatively short time (e.g. within several hours) by using this combination. Various performance tests were carried out on image processing sub-system in 1990 using TV images obtained from different types of spent fuel assemblies stored in various storage pools of PWR and BWR power stations

  8. Institutions, Equilibria and Efficiency

    DEFF Research Database (Denmark)

    Competition and efficiency is at the core of economic theory. This volume collects papers of leading scholars, which extend the conventional general equilibrium model in important ways. Efficiency and price regulation are studied when markets are incomplete and existence of equilibria in such set...... in OLG, learning in OLG and in games, optimal pricing of derivative securities, the impact of heterogeneity...

  9. Energy Efficiency Collaboratives

    Energy Technology Data Exchange (ETDEWEB)

    Li, Michael [US Department of Energy, Washington, DC (United States); Bryson, Joe [US Environmental Protection Agency, Washington, DC (United States)

    2015-09-01

    Collaboratives for energy efficiency have a long and successful history and are currently used, in some form, in more than half of the states. Historically, many state utility commissions have used some form of collaborative group process to resolve complex issues that emerge during a rate proceeding. Rather than debate the issues through the formality of a commission proceeding, disagreeing parties are sent to discuss issues in a less-formal setting and bring back resolutions to the commission. Energy efficiency collaboratives take this concept and apply it specifically to energy efficiency programs—often in anticipation of future issues as opposed to reacting to a present disagreement. Energy efficiency collaboratives can operate long term and can address the full suite of issues associated with designing, implementing, and improving energy efficiency programs. Collaboratives can be useful to gather stakeholder input on changing program budgets and program changes in response to performance or market shifts, as well as to provide continuity while regulators come and go, identify additional energy efficiency opportunities and innovations, assess the role of energy efficiency in new regulatory contexts, and draw on lessons learned and best practices from a diverse group. Details about specific collaboratives in the United States are in the appendix to this guide. Collectively, they demonstrate the value of collaborative stakeholder processes in producing successful energy efficiency programs.

  10. efficience technico-economique

    African Journals Online (AJOL)

    USER

    ABSTRACT. TECHNICO-ECONOMIC EFFICIENCY : CASE OF THE PRODUCERS OF ONION AND POTATO IN KNOW IN MOROCCO. In the new context ... Key words : Technico-economic efficiency, stochastic frontier, potato production, onion production, Morocco ..... sont le labour, le cover-cropage et le traçage. 82 % des ...

  11. Nitrogen use efficiency (NUE)

    NARCIS (Netherlands)

    Oenema, O.

    2015-01-01

    There is a need for communications about resource use efficiency and for measures to increase the use efficiency of nutrients in relation to food production. This holds especially for nitrogen. Nitrogen (N) is essential for life and a main nutrient element. It is needed in relatively large

  12. Logistics, Management and Efficiency

    OpenAIRE

    Mircea UDRESCU; Sandu CUTURELA

    2014-01-01

    The problem related to the efficiency of the management for organization is general being the concern off all managers. In the present essay we consider that the efficacy of the organization begins from the structural systemization of the organizational management into general management, management of logistics and management of production which demands a new managerial process, more competitive based on economic efficiency.

  13. Computational sieving applied to some classical number-theoretic problems

    NARCIS (Netherlands)

    H.J.J. te Riele (Herman)

    1998-01-01

    textabstractMany problems in computational number theory require the application of some sieve. Efficient implementation of these sieves on modern computers has extended our knowledge of these problems considerably. This is illustrated by three classical problems: the Goldbach conjecture, factoring

  14. When a number is not only a number

    DEFF Research Database (Denmark)

    Christensen, Ken Ramshøj; Roepstorff, Andreas; Saddy, Douglas

    at. 1999, 2004). Furthermore, lesions studies have shown that damage to the posterior inferior parietal cortex leads to severe difficulties with performing simple calculation, such as stepwise computation (Joseph 2000: 463). The same frontal-parietal network is also involved in working memory (WM......MRI study which involves numerical processing as well as WM and error detection. Three types of stimuli: (a) repeated chunks (x, y, z, x, y, z…), (b) smaller structured chunks requiring minimal calculation (x, x+1, y, y+1, z, z+1…), and (c) strings with an increased calculation requirement (x = x+3......). The control condition consists of simple x = x+1 strings (e.g. 1, 2, 3, 4, 5, 6…). The subjects have to press a button when they detect error to the general patterns, i.e., when a number does not conform to the numerical string. Using a block design to investigate the numerical processing, all three...

  15. Energy efficiency and behaviour

    DEFF Research Database (Denmark)

    Carstensen, Trine Agervig; Kunnasvirta, Annika; Kiviluoto, Katariina

    separate key aspects hinders strategic energy efficiency planning. For this reason, the PLEEC project – “Planning for Energy Efficient Cities” – funded by the EU Seventh Framework Programme uses an integrative approach to achieve the sus‐ tainable, energy– efficient, smart city. By coordinating strategies...... to conduct behavioural interventions, to be presented in Deliverable 5.5., the final report. This report will also provide valuable information for the WP6 general model for an Energy-Smart City. Altogether 38 behavioural interventions are analysed in this report. Each collected and analysed case study...... of the European Union’s 20‐20‐20 plan is to improve energy efficiency by 20% in 2020. However, holistic knowledge about energy efficiency potentials in cities is far from complete. Currently, a WP4 location in PLEEC project page 3 variety of individual strategies and approaches by different stakeholders tackling...

  16. Propulsion at low Reynolds number

    International Nuclear Information System (INIS)

    Najafi, Ali; Golestanian, Ramin

    2005-01-01

    We study the propulsion of two model swimmers at low Reynolds number. Inspired by Purcell's model, we propose a very simple one-dimensional swimmer consisting of three spheres that are connected by two arms whose lengths can change between two values. The proposed swimmer can swim with a special type of motion, which breaks the time-reversal symmetry. We also show that an ellipsoidal membrane with tangential travelling wave on it can also propel itself in the direction preferred by the travelling wave. This system resembles the realistic biological animals like Paramecium

  17. Propulsion at low Reynolds number

    Energy Technology Data Exchange (ETDEWEB)

    Najafi, Ali [Institute for Advanced Studies in Basic Sciences, Zanjan 45195-159 (Iran, Islamic Republic of); Faculty of Science, Zanjan University, Zanjan 313 (Iran, Islamic Republic of); Golestanian, Ramin [Institute for Advanced Studies in Basic Sciences, Zanjan 45195-159 (Iran, Islamic Republic of)

    2005-04-13

    We study the propulsion of two model swimmers at low Reynolds number. Inspired by Purcell's model, we propose a very simple one-dimensional swimmer consisting of three spheres that are connected by two arms whose lengths can change between two values. The proposed swimmer can swim with a special type of motion, which breaks the time-reversal symmetry. We also show that an ellipsoidal membrane with tangential travelling wave on it can also propel itself in the direction preferred by the travelling wave. This system resembles the realistic biological animals like Paramecium.

  18. Fedosov differentials and Catalan numbers

    Energy Technology Data Exchange (ETDEWEB)

    Loeffler, Johannes, E-mail: j.j.loeffler@web.d [Muehlgasse 19, 78549 Spaichingen (Germany)

    2010-06-11

    The aim of the paper is to establish a non-recursive formula for the general solution of Fedosov's 'quadratic' fixed-point equation (Fedosov 1994 J. Diff. Geom. 40 213-38). Fedosov's geometrical fixed-point equation for a differential is rewritten in a form similar to the functional equation for the generating function of Catalan numbers. This allows us to guess the solution. An adapted example for Kaehler manifolds of constant sectional curvature is considered in detail. Also for every connection on a manifold a familiar classical differential will be introduced.

  19. Fedosov differentials and Catalan numbers

    Science.gov (United States)

    Löffler, Johannes

    2010-06-01

    The aim of the paper is to establish a non-recursive formula for the general solution of Fedosov's 'quadratic' fixed-point equation (Fedosov 1994 J. Diff. Geom. 40 213-38). Fedosov's geometrical fixed-point equation for a differential is rewritten in a form similar to the functional equation for the generating function of Catalan numbers. This allows us to guess the solution. An adapted example for Kaehler manifolds of constant sectional curvature is considered in detail. Also for every connection on a manifold a familiar classical differential will be introduced. Dedicated to the memory of Nikolai Neumaier.

  20. Phalanx. Volume 47, Number 4

    Science.gov (United States)

    2014-12-01

    at $23,200 an hour. So that’s another $1.2M a day. Pete: Don’t they shoot at you? Joe: Well, we usually wire together a bunch of microwave ovens we...Officer, to break his vow never to sail on a “ bird farm.” MORS welcomes Kevin Williams as the new AF sponsor. He became the Director of...person shall be subject to a penalty for failing to comply with a collection of information if it does not display a currently valid OMB control number