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.

How random are random numbers generated using photons?

International Nuclear Information System (INIS)

Solis, Aldo; Angulo Martínez, Alí M; Ramírez Alarcón, Roberto; Cruz Ramírez, Hector; U’Ren, Alfred B; Hirsch, Jorge G

2015-01-01

Randomness is fundamental in quantum theory, with many philosophical and practical implications. In this paper we discuss the concept of algorithmic randomness, which provides a quantitative method to assess the Borel normality of a given sequence of numbers, a necessary condition for it to be considered random. We use Borel normality as a tool to investigate the randomness of ten sequences of bits generated from the differences between detection times of photon pairs generated by spontaneous parametric downconversion. These sequences are shown to fulfil the randomness criteria without difficulties. As deviations from Borel normality for photon-generated random number sequences have been reported in previous work, a strategy to understand these diverging findings is outlined. (paper)

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

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.

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.

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

Analysis of android random number generator

OpenAIRE

Sarıtaş, Serkan

2013-01-01

Ankara : The Department of Computer Engineering and the Graduate School of Engineering and Science of Bilkent University, 2013. Thesis (Master's) -- Bilkent University, 2013. Includes bibliographical references leaves 61-65. Randomness is a crucial resource for cryptography, and random number generators are critical building blocks of almost all cryptographic systems. Therefore, random number generation is one of the key parts of secure communication. Random number generatio...

The RANDOM computer program: A linear congruential random number generator

Science.gov (United States)

Miles, R. F., Jr.

1986-01-01

The RANDOM Computer Program is a FORTRAN program for generating random number sequences and testing linear congruential random number generators (LCGs). The linear congruential form of random number generator is discussed, and the selection of parameters of an LCG for a microcomputer described. This document describes the following: (1) The RANDOM Computer Program; (2) RANDOM.MOD, the computer code needed to implement an LCG in a FORTRAN program; and (3) The RANCYCLE and the ARITH Computer Programs that provide computational assistance in the selection of parameters for an LCG. The RANDOM, RANCYCLE, and ARITH Computer Programs are written in Microsoft FORTRAN for the IBM PC microcomputer and its compatibles. With only minor modifications, the RANDOM Computer Program and its LCG can be run on most micromputers or mainframe computers.

A Shot Number Based Approach to Performance Analysis in Table Tennis

Directory of Open Access Journals (Sweden)

Tamaki Sho

2017-01-01

Full Text Available The current study proposes a novel approach that improves the conventional performance analysis in table tennis by introducing the concept of frequency, or the number of shots, of each shot number. The improvements over the conventional method are as follows: better accuracy of the evaluation of skills and tactics of players, additional insights into scoring and returning skills and ease of understanding the results with a single criterion. The performance analysis of matches played at the 2012 Summer Olympics in London was conducted using the proposed method. The results showed some effects of the shot number and gender differences in table tennis. Furthermore, comparisons were made between Chinese players and players from other countries, what threw light on the skills and tactics of the Chinese players. The present findings demonstrate that the proposed method provides useful information and has some advantages over the conventional method.

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.

Source-Independent Quantum Random Number Generation

Science.gov (United States)

Cao, Zhu; Zhou, Hongyi; Yuan, Xiao; Ma, Xiongfeng

2016-01-01

Quantum random number generators can provide genuine randomness by appealing to the fundamental principles of quantum mechanics. In general, a physical generator contains two parts—a randomness source and its readout. The source is essential to the quality of the resulting random numbers; hence, it needs to be carefully calibrated and modeled to achieve information-theoretical provable randomness. However, in practice, the source is a complicated physical system, such as a light source or an atomic ensemble, and any deviations in the real-life implementation from the theoretical model may affect the randomness of the output. To close this gap, we propose a source-independent scheme for quantum random number generation in which output randomness can be certified, even when the source is uncharacterized and untrusted. In our randomness analysis, we make no assumptions about the dimension of the source. For instance, multiphoton emissions are allowed in optical implementations. Our analysis takes into account the finite-key effect with the composable security definition. In the limit of large data size, the length of the input random seed is exponentially small compared to that of the output random bit. In addition, by modifying a quantum key distribution system, we experimentally demonstrate our scheme and achieve a randomness generation rate of over 5 ×103 bit /s .

Microcomputer-Assisted Discoveries: Random Numbers.

Science.gov (United States)

Kimberling, Clark

1983-01-01

A programing contest was designed to promote interest in mathematical randomness. Student-developed programs making clever uses of random numbers are presented. Modifications users might make are suggested. (MNS)

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.

Source-Independent Quantum Random Number Generation

Directory of Open Access Journals (Sweden)

Zhu Cao

2016-02-01

Full Text Available Quantum random number generators can provide genuine randomness by appealing to the fundamental principles of quantum mechanics. In general, a physical generator contains two parts—a randomness source and its readout. The source is essential to the quality of the resulting random numbers; hence, it needs to be carefully calibrated and modeled to achieve information-theoretical provable randomness. However, in practice, the source is a complicated physical system, such as a light source or an atomic ensemble, and any deviations in the real-life implementation from the theoretical model may affect the randomness of the output. To close this gap, we propose a source-independent scheme for quantum random number generation in which output randomness can be certified, even when the source is uncharacterized and untrusted. In our randomness analysis, we make no assumptions about the dimension of the source. For instance, multiphoton emissions are allowed in optical implementations. Our analysis takes into account the finite-key effect with the composable security definition. In the limit of large data size, the length of the input random seed is exponentially small compared to that of the output random bit. In addition, by modifying a quantum key distribution system, we experimentally demonstrate our scheme and achieve a randomness generation rate of over 5×10^{3}  bit/s.

A randomized comparison between league tables and funnel plots to inform health care decision-making.

Science.gov (United States)

Anell, Anders; Hagberg, Oskar; Liedberg, Fredrik; Ryden, Stefan

2016-12-01

Comparison of provider performance is commonly used to inform health care decision-making. Little attention has been paid to how data presentations influence decisions. This study analyzes differences in suggested actions by decision-makers informed by league tables or funnel plots. Decision-makers were invited to a survey and randomized to compare hospital performance using either league tables or funnel plots for four different measures within the area of cancer care. For each measure, decision-makers were asked to suggest actions towards 12-16 hospitals (no action, ask for more information, intervene) and provide feedback related to whether the information provided had been useful. Swedish health care. Two hundred and twenty-one decision-makers at administrative and clinical levels. Data presentations in the form of league tables or funnel plots. Number of actions suggested by participants. Proportion of appropriate actions. For all four measures, decision-makers tended to suggest more actions based on the information provided in league tables compared to funnel plots (44% vs. 21%, P decision-makers more often missed to react even when appropriate. The form of data presentation had an influence on decision-making. With league tables, decision-makers tended to suggest more actions compared to funnel plots. A difference in sensitivity and specificity conditioned by the form of presentation could also be identified, with different implications depending on the purpose of comparisons. Explanations and visualization aids are needed to support appropriate actions. © The Author 2016. Published by Oxford University Press in association with the International Society for Quality in Health Care. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com

All-optical fast random number generator.

Science.gov (United States)

Li, Pu; Wang, Yun-Cai; Zhang, Jian-Zhong

2010-09-13

We propose a scheme of all-optical random number generator (RNG), which consists of an ultra-wide bandwidth (UWB) chaotic laser, an all-optical sampler and an all-optical comparator. Free from the electric-device bandwidth, it can generate 10Gbit/s random numbers in our simulation. The high-speed bit sequences can pass standard statistical tests for randomness after all-optical exclusive-or (XOR) operation.

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.

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.

Unbiased All-Optical Random-Number Generator

Science.gov (United States)

Steinle, Tobias; Greiner, Johannes N.; Wrachtrup, Jörg; Giessen, Harald; Gerhardt, Ilja

2017-10-01

The generation of random bits is of enormous importance in modern information science. Cryptographic security is based on random numbers which require a physical process for their generation. This is commonly performed by hardware random-number generators. These often exhibit a number of problems, namely experimental bias, memory in the system, and other technical subtleties, which reduce the reliability in the entropy estimation. Further, the generated outcome has to be postprocessed to "iron out" such spurious effects. Here, we present a purely optical randomness generator, based on the bistable output of an optical parametric oscillator. Detector noise plays no role and postprocessing is reduced to a minimum. Upon entering the bistable regime, initially the resulting output phase depends on vacuum fluctuations. Later, the phase is rigidly locked and can be well determined versus a pulse train, which is derived from the pump laser. This delivers an ambiguity-free output, which is reliably detected and associated with a binary outcome. The resulting random bit stream resembles a perfect coin toss and passes all relevant randomness measures. The random nature of the generated binary outcome is furthermore confirmed by an analysis of resulting conditional entropies.

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

A hybrid-type quantum random number generator

Science.gov (United States)

Hai-Qiang, Ma; Wu, Zhu; Ke-Jin, Wei; Rui-Xue, Li; Hong-Wei, Liu

2016-05-01

This paper proposes a well-performing hybrid-type truly quantum random number generator based on the time interval between two independent single-photon detection signals, which is practical and intuitive, and generates the initial random number sources from a combination of multiple existing random number sources. A time-to-amplitude converter and multichannel analyzer are used for qualitative analysis to demonstrate that each and every step is random. Furthermore, a carefully designed data acquisition system is used to obtain a high-quality random sequence. Our scheme is simple and proves that the random number bit rate can be dramatically increased to satisfy practical requirements. Project supported by the National Natural Science Foundation of China (Grant Nos. 61178010 and 11374042), the Fund of State Key Laboratory of Information Photonics and Optical Communications (Beijing University of Posts and Telecommunications), China, and the Fundamental Research Funds for the Central Universities of China (Grant No. bupt2014TS01).

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

Directory of Open Access Journals (Sweden)

L. Yu. Barash

2012-01-01

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

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

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

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

The presented package for the Mathematica computing system allows the harnessing of quantum random number generators (QRNG) for investigating the statistical properties of quantum states. The described package implements a number of functions for generating random states. The new version of the package adds the ability to use the on-line quantum random number generator service and implements new functions for retrieving lists of random numbers. Thanks to the introduced improvements, the new version provides faster access to high-quality sources of random numbers and can be used in simulations requiring large amount of random data. New version program summaryProgram title: TRQS Catalogue identifier: AEKA_v2_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEKA_v2_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 18 134 No. of bytes in distributed program, including test data, etc.: 2 520 49 Distribution format: tar.gz Programming language: Mathematica, C. Computer: Any supporting Mathematica in version 7 or higher. Operating system: Any platform supporting Mathematica; tested with GNU/Linux (32 and 64 bit). RAM: Case-dependent Supplementary material: Fig. 1 mentioned below can be downloaded. Classification: 4.15. External routines: Quantis software library (http://www.idquantique.com/support/quantis-trng.html) Catalogue identifier of previous version: AEKA_v1_0 Journal reference of previous version: Comput. Phys. Comm. 183(2012)118 Does the new version supersede the previous version?: Yes Nature of problem: Generation of random density matrices and utilization of high-quality random numbers for the purpose of computer simulation. Solution method: Use of a physical quantum random number generator and an on-line service providing access to the source of true random

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.

A Method of Erasing Data Using Random Number Generators

OpenAIRE

井上,正人

2012-01-01

Erasing data is an indispensable step for disposal of computers or external storage media. Except physical destruction, erasing data means writing random information on entire disk drives or media. We propose a method which erases data safely using random number generators. These random number generators create true random numbers based on quantum processes.

Semi-device-independent random-number expansion without entanglement

International Nuclear Information System (INIS)

Li Hongwei; Yin Zhenqiang; Wu Yuchun; Zou Xubo; Wang Shuang; Chen Wei; Guo Guangcan; Han Zhengfu

2011-01-01

By testing the classical correlation violation between two systems, true random numbers can be generated and certified without applying classical statistical method. In this work, we propose a true random-number expansion protocol without entanglement, where the randomness can be guaranteed only by the two-dimensional quantum witness violation. Furthermore, we only assume that the dimensionality of the system used in the protocol has a tight bound, and the whole protocol can be regarded as a semi-device-independent black-box scenario. Compared with the device-independent random-number expansion protocol based on entanglement, our protocol is much easier to implement and test.

Analysis of random number generators in abnormal usage conditions

International Nuclear Information System (INIS)

Soucarros, M.

2012-01-01

Random numbers have been used through the ages for games of chance, more recently for secret codes and today they are necessary to the execution of computer programs. Random number generators have now evolved from simple dices to electronic circuits and algorithms. Accordingly, the ability to distinguish between random and non-random numbers has become more difficult. Furthermore, whereas in the past dices were loaded in order to increase winning chances, it is now possible to influence the outcome of random number generators. In consequence, this subject is still very much an issue and has recently made the headlines. Indeed, there was talks about the PS3 game console which generates constant random numbers and redundant distribution of secret keys on the internet. This thesis presents a study of several generators as well as different means to perturb them. It shows the inherent defects of their conceptions and possible consequences of their failure when they are embedded inside security components. Moreover, this work highlights problems yet to be solved concerning the testing of random numbers and the post-processing eliminating bias in these numbers distribution. (author) [fr

Testing, Selection, and Implementation of Random Number Generators

National Research Council Canada - National Science Library

Collins, Joseph C

2008-01-01

An exhaustive evaluation of state-of-the-art random number generators with several well-known suites of tests provides the basis for selection of suitable random number generators for use in stochastic simulations...

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.

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.

Towards a high-speed quantum random number generator

Science.gov (United States)

Stucki, Damien; Burri, Samuel; Charbon, Edoardo; Chunnilall, Christopher; Meneghetti, Alessio; Regazzoni, Francesco

2013-10-01

Randomness is of fundamental importance in various fields, such as cryptography, numerical simulations, or the gaming industry. Quantum physics, which is fundamentally probabilistic, is the best option for a physical random number generator. In this article, we will present the work carried out in various projects in the context of the development of a commercial and certified high speed random number generator.

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)

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)

Effects of changing the random number stride in Monte Carlo calculations

International Nuclear Information System (INIS)

Hendricks, J.S.

1991-01-01

This paper reports on a common practice in Monte Carlo radiation transport codes which is to start each random walk a specified number of steps up the random number sequence from the previous one. This is called the stride in the random number sequence between source particles. It is used for correlated sampling or to provide tree-structured random numbers. A new random number generator algorithm for the major Monte Carlo code MCNP has been written to allow adjustment of the random number stride. This random number generator is machine portable. The effects of varying the stride for several sample problems are examined

Quantum random number generation for loophole-free Bell tests

Science.gov (United States)

Mitchell, Morgan; Abellan, Carlos; Amaya, Waldimar

2015-05-01

We describe the generation of quantum random numbers at multi-Gbps rates, combined with real-time randomness extraction, to give very high purity random numbers based on quantum events at most tens of ns in the past. The system satisfies the stringent requirements of quantum non-locality tests that aim to close the timing loophole. We describe the generation mechanism using spontaneous-emission-driven phase diffusion in a semiconductor laser, digitization, and extraction by parity calculation using multi-GHz logic chips. We pay special attention to experimental proof of the quality of the random numbers and analysis of the randomness extraction. In contrast to widely-used models of randomness generators in the computer science literature, we argue that randomness generation by spontaneous emission can be extracted from a single source.

Microcomputer-Assisted Discoveries: Generate Your Own Random Numbers.

Science.gov (United States)

Kimberling, Clark

1984-01-01

Having students try to generate their own random numbers can lead to much discovery learning as one tries to create 'patternlessness' from formulas. Developing an equidistribution test and runs test, plus other ideas for generating random numbers, is discussed, with computer programs given. (MNS)

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

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

RANDOMNUMBERS, Random Number Sequence Generated from Gas Ionisation Chamber Data

International Nuclear Information System (INIS)

Frigerio, N.A.; Sanathanan, L.P.; Morley, M.; Tyler, S.A.; Clark, N.A.; Wang, J.

1989-01-01

1 - Description of problem or function: RANDOM NUMBERS is a data collection of almost 2.7 million 31-bit random numbers generated by using a high resolution gas ionization detector chamber in conjunction with a 4096-channel multichannel analyzer to record the radioactive decay of alpha particles from a U-235 source. The signals from the decaying alpha particles were fed to the 4096-channel analyzer, and for each channel the frequency of signals registered in a 20,000-microsecond interval was recorded. The parity bits of these frequency counts, 0 for an even count and 1 for and odd count, were then assembled in sequence to form 31-bit random numbers and transcribed onto magnetic tape. This cycle was repeated to obtain the random numbers. 2 - Method of solution: The frequency distribution of counts from the device conforms to the Brockwell-Moyal distribution which takes into account the dead time of the counter. The count data were analyzed and tests for randomness on a sample indicate that the device is a highly reliable source of truly random numbers. 3 - Restrictions on the complexity of the problem: The RANDOM NUMBERS tape contains 2,669,568 31-bit numbers

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.

Random walk of the baryon number

International Nuclear Information System (INIS)

Kazaryan, A.M.; Khlebnikov, S.Y.; Shaposhnikov, M.E.

1989-01-01

A new approach is suggested for the anomalous nonconservation of baryon number in the electroweak theory at high temperatures. Arguments are presented in support of the idea that the baryon-number changing reactions may be viewed as random Markov processes. Making use of the general theory of Markov processes, the Fokker--Planck equation for the baryon-number distribution density is obtained and kinetic coefficients are calculated

Motzkin numbers out of Random Domino Automaton

Energy Technology Data Exchange (ETDEWEB)

Białecki, Mariusz, E-mail: bialecki@igf.edu.pl [Institute of Geophysics, Polish Academy of Sciences, ul. Ks. Janusza 64, 01-452 Warszawa (Poland)

2012-10-01

Motzkin numbers are derived from a special case of Random Domino Automaton – recently proposed a slowly driven system being a stochastic toy model of earthquakes. It is also a generalisation of 1D Drossel–Schwabl forest-fire model. A solution of the set of equations describing stationary state of Random Domino Automaton in inverse-power case is presented. A link with Motzkin numbers allows to present explicit form of asymptotic behaviour of the automaton. -- Highlights: ► Motzkin numbers are derived from stochastic cellular automaton with avalanches. ► Explicit solution of toy model of earthquakes is presented. ► Case with inverse-power distribution of avalanches is found.

DNA-based random number generation in security circuitry.

Science.gov (United States)

Gearheart, Christy M; Arazi, Benjamin; Rouchka, Eric C

2010-06-01

DNA-based circuit design is an area of research in which traditional silicon-based technologies are replaced by naturally occurring phenomena taken from biochemistry and molecular biology. This research focuses on further developing DNA-based methodologies to mimic digital data manipulation. While exhibiting fundamental principles, this work was done in conjunction with the vision that DNA-based circuitry, when the technology matures, will form the basis for a tamper-proof security module, revolutionizing the meaning and concept of tamper-proofing and possibly preventing it altogether based on accurate scientific observations. A paramount part of such a solution would be self-generation of random numbers. A novel prototype schema employs solid phase synthesis of oligonucleotides for random construction of DNA sequences; temporary storage and retrieval is achieved through plasmid vectors. A discussion of how to evaluate sequence randomness is included, as well as how these techniques are applied to a simulation of the random number generation circuitry. Simulation results show generated sequences successfully pass three selected NIST random number generation tests specified for security applications.

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

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.

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.

GASPRNG: GPU accelerated scalable parallel random number generator library

Science.gov (United States)

Gao, Shuang; Peterson, Gregory D.

2013-04-01

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

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

A method for generating skewed random numbers using two overlapping uniform distributions

International Nuclear Information System (INIS)

Ermak, D.L.; Nasstrom, J.S.

1995-02-01

The objective of this work was to implement and evaluate a method for generating skewed random numbers using a combination of uniform random numbers. The method provides a simple and accurate way of generating skewed random numbers from the specified first three moments without an a priori specification of the probability density function. We describe the procedure for generating skewed random numbers from unifon-n random numbers, and show that it accurately produces random numbers with the desired first three moments over a range of skewness values. We also show that in the limit of zero skewness, the distribution of random numbers is an accurate approximation to the Gaussian probability density function. Future work win use this method to provide skewed random numbers for a Langevin equation model for diffusion in skewed turbulence

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.

Random-Number Generator Validity in Simulation Studies: An Investigation of Normality.

Science.gov (United States)

Bang, Jung W.; Schumacker, Randall E.; Schlieve, Paul L.

1998-01-01

The normality of number distributions generated by various random-number generators were studied, focusing on when the random-number generator reached a normal distribution and at what sample size. Findings suggest the steps that should be followed when using a random-number generator in a Monte Carlo simulation. (SLD)

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

Ten-decimal tables of the logarithms of complex numbers and for the transformation from Cartesian to polar coordinates

CERN Document Server

Lyusternik, L A

1965-01-01

Ten-Decimal Tables of the Logarithms of Complex Numbers and for the Transformation from Cartesian to Polar Coordinates contains Tables of mathematical functions up to ten-decimal value. These tables are compiled in the Department for Approximate Computations of the Institute of Exact Mechanics and Computational Methods of the U.S.S.R. Academy of Sciences. The computations are carried out by this department in conjunction with the Computational-Experimental Laboratory of the Institute.This book will be of value to mathematicians and researchers.

A random-matrix theory of the number sense.

Science.gov (United States)

Hannagan, T; Nieder, A; Viswanathan, P; Dehaene, S

2017-02-19

Number sense, a spontaneous ability to process approximate numbers, has been documented in human adults, infants and newborns, and many other animals. Species as distant as monkeys and crows exhibit very similar neurons tuned to specific numerosities. How number sense can emerge in the absence of learning or fine tuning is currently unknown. We introduce a random-matrix theory of self-organized neural states where numbers are coded by vectors of activation across multiple units, and where the vector codes for successive integers are obtained through multiplication by a fixed but random matrix. This cortical implementation of the 'von Mises' algorithm explains many otherwise disconnected observations ranging from neural tuning curves in monkeys to looking times in neonates and cortical numerotopy in adults. The theory clarifies the origin of Weber-Fechner's Law and yields a novel and empirically validated prediction of multi-peak number neurons. Random matrices constitute a novel mechanism for the emergence of brain states coding for quantity.This article is part of a discussion meeting issue 'The origins of numerical abilities'. © 2017 The Author(s).

Number-conserving random phase approximation with analytically integrated matrix elements

International Nuclear Information System (INIS)

Kyotoku, M.; Schmid, K.W.; Gruemmer, F.; Faessler, A.

1990-01-01

In the present paper a number conserving random phase approximation is derived as a special case of the recently developed random phase approximation in general symmetry projected quasiparticle mean fields. All the occurring integrals induced by the number projection are performed analytically after writing the various overlap and energy matrices in the random phase approximation equation as polynomials in the gauge angle. In the limit of a large number of particles the well-known pairing vibration matrix elements are recovered. We also present a new analytically number projected variational equation for the number conserving pairing problem

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.

On contact numbers in random rod packings

NARCIS (Netherlands)

Wouterse, A.; Luding, Stefan; Philipse, A.P.

2009-01-01

Random packings of non-spherical granular particles are simulated by combining mechanical contraction and molecular dynamics, to determine contact numbers as a function of density. Particle shapes are varied from spheres to thin rods. The observed contact numbers (and packing densities) agree well

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)

A generator for unique quantum random numbers based on vacuum states

DEFF Research Database (Denmark)

Gabriel, C.; Wittmann, C.; Sych, D.

2010-01-01

the purity of a continuous-variable quantum vacuum state to generate unique random numbers. We use the intrinsic randomness in measuring the quadratures of a mode in the lowest energy vacuum state, which cannot be correlated to any other state. The simplicity of our source, combined with its verifiably......Random numbers are a valuable component in diverse applications that range from simulations(1) over gambling to cryptography(2,3). The quest for true randomness in these applications has engendered a large variety of different proposals for producing random numbers based on the foundational...... unpredictability of quantum mechanics(4-11). However, most approaches do not consider that a potential adversary could have knowledge about the generated numbers, so the numbers are not verifiably random and unique(12-15). Here we present a simple experimental setup based on homodyne measurements that uses...

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.

The intermittency of vector fields and random-number generators

Science.gov (United States)

Kalinin, A. O.; Sokoloff, D. D.; Tutubalin, V. N.

2017-09-01

We examine how well natural random-number generators can reproduce the intermittency phenomena that arise in the transfer of vector fields in random media. A generator based on the analysis of financial indices is suggested as the most promising random-number generator. Is it shown that even this generator, however, fails to reproduce the phenomenon long enough to confidently detect intermittency, while the C++ generator successfully solves this problem. We discuss the prospects of using shell models of turbulence as the desired generator.

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.

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.

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

Quantum random flip-flop and its applications in random frequency synthesis and true random number generation

Energy Technology Data Exchange (ETDEWEB)

Stipčević, Mario, E-mail: mario.stipcevic@irb.hr [Photonics and Quantum Optics Research Unit, Center of Excellence for Advanced Materials and Sensing Devices, Ruđer Bošković Institute, Bijenička 54, 10000 Zagreb (Croatia)

2016-03-15

In this work, a new type of elementary logic circuit, named random flip-flop (RFF), is proposed, experimentally realized, and studied. Unlike conventional Boolean logic circuits whose action is deterministic and highly reproducible, the action of a RFF is intentionally made maximally unpredictable and, in the proposed realization, derived from a fundamentally random process of emission and detection of light quanta. We demonstrate novel applications of RFF in randomness preserving frequency division, random frequency synthesis, and random number generation. Possible usages of these applications in the information and communication technology, cryptographic hardware, and testing equipment are discussed.

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

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.

Brain potentials index executive functions during random number generation.

Science.gov (United States)

Joppich, Gregor; Däuper, Jan; Dengler, Reinhard; Johannes, Sönke; Rodriguez-Fornells, Antoni; Münte, Thomas F

2004-06-01

The generation of random sequences is considered to tax different executive functions. To explore the involvement of these functions further, brain potentials were recorded in 16 healthy young adults while either engaging in random number generation (RNG) by pressing the number keys on a computer keyboard in a random sequence or in ordered number generation (ONG) necessitating key presses in the canonical order. Key presses were paced by an external auditory stimulus to yield either fast (1 press/800 ms) or slow (1 press/1300 ms) sequences in separate runs. Attentional demands of random and ordered tasks were assessed by the introduction of a secondary task (key-press to a target tone). The P3 amplitude to the target tone of this secondary task was reduced during RNG, reflecting the greater consumption of attentional resources during RNG. Moreover, RNG led to a left frontal negativity peaking 140 ms after the onset of the pacing stimulus, whenever the subjects produced a true random response. This negativity could be attributed to the left dorsolateral prefrontal cortex and was absent when numbers were repeated. This negativity was interpreted as an index for the inhibition of habitual responses. Finally, in response locked ERPs a negative component was apparent peaking about 50 ms after the key-press that was more prominent during RNG. Source localization suggested a medial frontal source. This effect was tentatively interpreted as a reflection of the greater monitoring demands during random sequence generation.

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.

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.

Recoverable Random Numbers in an Internet of Things Operating System

Directory of Open Access Journals (Sweden)

Taeill Yoo

2017-03-01

Full Text Available Over the past decade, several security issues with Linux Random Number Generator (LRNG on PCs and Androids have emerged. The main problem involves the process of entropy harvesting, particularly at boot time. An entropy source in the input pool of LRNG is not transferred into the non-blocking output pool if the entropy counter of the input pool is less than 192 bits out of 4098 bits. Because the entropy estimation of LRNG is highly conservative, the process may require more than one minute for starting the transfer. Furthermore, the design principle of the estimation algorithm is not only heuristic but also unclear. Recently, Google released an Internet of Things (IoT operating system called Brillo based on the Linux kernel. We analyze the behavior of the random number generator in Brillo, which inherits that of LRNG. In the results, we identify two features that enable recovery of random numbers. With these features, we demonstrate that random numbers of 700 bytes at boot time can be recovered with the success probability of 90% by using time complexity for 5.20 × 2 40 trials. Therefore, the entropy of random numbers of 700 bytes is merely about 43 bits. Since the initial random numbers are supposed to be used for sensitive security parameters, such as stack canary and key derivation, our observation can be applied to practical attacks against cryptosystem.

Standard random number generation for MBASIC

Science.gov (United States)

Tausworthe, R. C.

1976-01-01

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

Security of Semi-Device-Independent Random Number Expansion Protocols.

Science.gov (United States)

Li, Dan-Dan; Wen, Qiao-Yan; Wang, Yu-Kun; Zhou, Yu-Qian; Gao, Fei

2015-10-27

Semi-device-independent random number expansion (SDI-RNE) protocols require some truly random numbers to generate fresh ones, with making no assumptions on the internal working of quantum devices except for the dimension of the Hilbert space. The generated randomness is certified by non-classical correlation in the prepare-and-measure test. Until now, the analytical relations between the amount of the generated randomness and the degree of non-classical correlation, which are crucial for evaluating the security of SDI-RNE protocols, are not clear under both the ideal condition and the practical one. In the paper, first, we give the analytical relation between the above two factors under the ideal condition. As well, we derive the analytical relation under the practical conditions, where devices' behavior is not independent and identical in each round and there exists deviation in estimating the non-classical behavior of devices. Furthermore, we choose a different randomness extractor (i.e., two-universal random function) and give the security proof.

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

Science.gov (United States)

Persaud, Navindra

2005-01-01

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

The average crossing number of equilateral random polygons

International Nuclear Information System (INIS)

Diao, Y; Dobay, A; Kusner, R B; Millett, K; Stasiak, A

2003-01-01

In this paper, we study the average crossing number of equilateral random walks and polygons. We show that the mean average crossing number ACN of all equilateral random walks of length n is of the form (3/16)n ln n + O(n). A similar result holds for equilateral random polygons. These results are confirmed by our numerical studies. Furthermore, our numerical studies indicate that when random polygons of length n are divided into individual knot types, the for each knot type K can be described by a function of the form = a(n-n 0 )ln(n-n 0 ) + b(n-n 0 ) + c where a, b and c are constants depending on K and n 0 is the minimal number of segments required to form K. The profiles diverge from each other, with more complex knots showing higher than less complex knots. Moreover, the profiles intersect with the profile of all closed walks. These points of intersection define the equilibrium length of K, i.e., the chain length n e (K) at which a statistical ensemble of configurations with given knot type K-upon cutting, equilibration and reclosure to a new knot type K'-does not show a tendency to increase or decrease . This concept of equilibrium length seems to be universal, and applies also to other length-dependent observables for random knots, such as the mean radius of gyration g >

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

Science.gov (United States)

Ghersi, Dario; Parakh, Abhishek; Mezei, Mihaly

2017-12-05

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

Learning Random Numbers: A Matlab Anomaly

Czech Academy of Sciences Publication Activity Database

Savický, Petr; Robnik-Šikonja, M.

2008-01-01

Roč. 22, č. 3 (2008), s. 254-265 ISSN 0883-9514 R&D Projects: GA AV ČR 1ET100300517 Institutional research plan: CEZ:AV0Z10300504 Keywords : random number s * machine learning * classification * attribute evaluation * regression Subject RIV: BA - General Mathematics Impact factor: 0.795, year: 2008

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

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.

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.

Using Computer-Generated Random Numbers to Calculate the Lifetime of a Comet.

Science.gov (United States)

Danesh, Iraj

1991-01-01

An educational technique to calculate the lifetime of a comet using software-generated random numbers is introduced to undergraduate physiques and astronomy students. Discussed are the generation and eligibility of the required random numbers, background literature related to the problem, and the solution to the problem using random numbers.…

Solution-Processed Carbon Nanotube True Random Number Generator.

Science.gov (United States)

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

2017-08-09

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

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

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.

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.

Using Random Numbers in Science Research Activities.

Science.gov (United States)

Schlenker, Richard M.; And Others

1996-01-01

Discusses the importance of science process skills and describes ways to select sets of random numbers for selection of subjects for a research study in an unbiased manner. Presents an activity appropriate for grades 5-12. (JRH)

Realistic noise-tolerant randomness amplification using finite number of devices

Science.gov (United States)

Brandão, Fernando G. S. L.; Ramanathan, Ravishankar; Grudka, Andrzej; Horodecki, Karol; Horodecki, Michał; Horodecki, Paweł; Szarek, Tomasz; Wojewódka, Hanna

2016-04-01

Randomness is a fundamental concept, with implications from security of modern data systems, to fundamental laws of nature and even the philosophy of science. Randomness is called certified if it describes events that cannot be pre-determined by an external adversary. It is known that weak certified randomness can be amplified to nearly ideal randomness using quantum-mechanical systems. However, so far, it was unclear whether randomness amplification is a realistic task, as the existing proposals either do not tolerate noise or require an unbounded number of different devices. Here we provide an error-tolerant protocol using a finite number of devices for amplifying arbitrary weak randomness into nearly perfect random bits, which are secure against a no-signalling adversary. The correctness of the protocol is assessed by violating a Bell inequality, with the degree of violation determining the noise tolerance threshold. An experimental realization of the protocol is within reach of current technology.

Random Number Generation for High Performance Computing

Science.gov (United States)

2015-01-01

number streams, a quality metric for the parallel random number streams. * * * * * Atty. Dkt . No.: 5660-14400 Customer No. 35690 Eric B. Meyertons...responsibility to ensure timely payment of maintenance fees when due. Pagel of3 PTOL-85 (Rev. 02/11) Atty. Dkt . No.: 5660-14400 Page 1 Meyertons...with each subtask executed by a separate thread or process (henceforth, process). Each process has Atty. Dkt . No.: 5660-14400 Page 2 Meyertons

Random Generators and Normal Numbers

OpenAIRE

Bailey, David H.; Crandall, Richard E.

2002-01-01

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

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.

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.

Half-life distribution table of radioactive nuclei; Table de distribution des periodes des noyaux radioactifs

Energy Technology Data Exchange (ETDEWEB)

Gugenberger, P [Commissariat a l' Energie Atomique, Saclay(France). Centre d' Etudes Nucleaires

1954-07-01

This table allows to identify an element if its period is known. Data for this table were taken from the half-life values adopted by Hollander, PERLMAN and SEABORG (Rev. mod. Phys., 1953, 22 number 2). Moreover for each nucleus, the mass number, the charge number and the type of decay are given in the table. (author) [French] Cette table permet l'identification d'un element dont la periode est connue. Elle a ete etablie en utilisant les valeurs des periodes donnees par HOLLANDER, PERLMAN et SEABORG dans Rev. mod. Phys., 1953, 25 numero 2. On y trouve en outre, pour chaque nuclide, les caracteristiques suivantes: Z, A, modes de desintegration. (auteur)

Half-life distribution table of radioactive nuclei; Table de distribution des periodes des noyaux radioactifs

Energy Technology Data Exchange (ETDEWEB)

Gugenberger, P. [Commissariat a l' Energie Atomique, Saclay(France). Centre d' Etudes Nucleaires

1954-07-01

This table allows to identify an element if its period is known. Data for this table were taken from the half-life values adopted by Hollander, PERLMAN and SEABORG (Rev. mod. Phys., 1953, 22 number 2). Moreover for each nucleus, the mass number, the charge number and the type of decay are given in the table. (author) [French] Cette table permet l'identification d'un element dont la periode est connue. Elle a ete etablie en utilisant les valeurs des periodes donnees par HOLLANDER, PERLMAN et SEABORG dans Rev. mod. Phys., 1953, 25 numero 2. On y trouve en outre, pour chaque nuclide, les caracteristiques suivantes: Z, A, modes de desintegration. (auteur)

A Comparison of Three Random Number Generators for Aircraft Dynamic Modeling Applications

Science.gov (United States)

Grauer, Jared A.

2017-01-01

Three random number generators, which produce Gaussian white noise sequences, were compared to assess their suitability in aircraft dynamic modeling applications. The first generator considered was the MATLAB (registered) implementation of the Mersenne-Twister algorithm. The second generator was a website called Random.org, which processes atmospheric noise measured using radios to create the random numbers. The third generator was based on synthesis of the Fourier series, where the random number sequences are constructed from prescribed amplitude and phase spectra. A total of 200 sequences, each having 601 random numbers, for each generator were collected and analyzed in terms of the mean, variance, normality, autocorrelation, and power spectral density. These sequences were then applied to two problems in aircraft dynamic modeling, namely estimating stability and control derivatives from simulated onboard sensor data, and simulating flight in atmospheric turbulence. In general, each random number generator had good performance and is well-suited for aircraft dynamic modeling applications. Specific strengths and weaknesses of each generator are discussed. For Monte Carlo simulation, the Fourier synthesis method is recommended because it most accurately and consistently approximated Gaussian white noise and can be implemented with reasonable computational effort.

Experimentally Generated Random Numbers Certified by the Impossibility of Superluminal Signaling

Science.gov (United States)

Bierhorst, Peter; Shalm, Lynden K.; Mink, Alan; Jordan, Stephen; Liu, Yi-Kai; Rommal, Andrea; Glancy, Scott; Christensen, Bradley; Nam, Sae Woo; Knill, Emanuel

Random numbers are an important resource for applications such as numerical simulation and secure communication. However, it is difficult to certify whether a physical random number generator is truly unpredictable. Here, we exploit the phenomenon of quantum nonlocality in a loophole-free photonic Bell test experiment to obtain data containing randomness that cannot be predicted by any theory that does not also allow the sending of signals faster than the speed of light. To certify and quantify the randomness, we develop a new protocol that performs well in an experimental regime characterized by low violation of Bell inequalities. Applying an extractor function to our data, we obtain 256 new random bits, uniform to within 10- 3 .

The generation of 68 Gbps quantum random number by measuring laser phase fluctuations

International Nuclear Information System (INIS)

Nie, You-Qi; Liu, Yang; Zhang, Jun; Pan, Jian-Wei; Huang, Leilei; Payne, Frank

2015-01-01

The speed of a quantum random number generator is essential for practical applications, such as high-speed quantum key distribution systems. Here, we push the speed of a quantum random number generator to 68 Gbps by operating a laser around its threshold level. To achieve the rate, not only high-speed photodetector and high sampling rate are needed but also a very stable interferometer is required. A practical interferometer with active feedback instead of common temperature control is developed to meet the requirement of stability. Phase fluctuations of the laser are measured by the interferometer with a photodetector and then digitalized to raw random numbers with a rate of 80 Gbps. The min-entropy of the raw data is evaluated by modeling the system and is used to quantify the quantum randomness of the raw data. The bias of the raw data caused by other signals, such as classical and detection noises, can be removed by Toeplitz-matrix hashing randomness extraction. The final random numbers can pass through the standard randomness tests. Our demonstration shows that high-speed quantum random number generators are ready for practical usage

Periodic Table of Students.

Science.gov (United States)

Johnson, Mike

1998-01-01

Presents an exercise in which an eighth-grade science teacher decorated the classroom with a periodic table of students. Student photographs were arranged according to similarities into vertical columns. Students were each assigned an atomic number according to their placement in the table. The table is then used to teach students about…

The average inter-crossing number of equilateral random walks and polygons

International Nuclear Information System (INIS)

Diao, Y; Dobay, A; Stasiak, A

2005-01-01

In this paper, we study the average inter-crossing number between two random walks and two random polygons in the three-dimensional space. The random walks and polygons in this paper are the so-called equilateral random walks and polygons in which each segment of the walk or polygon is of unit length. We show that the mean average inter-crossing number ICN between two equilateral random walks of the same length n is approximately linear in terms of n and we were able to determine the prefactor of the linear term, which is a = 3ln2/8 ∼ 0.2599. In the case of two random polygons of length n, the mean average inter-crossing number ICN is also linear, but the prefactor of the linear term is different from that of the random walks. These approximations apply when the starting points of the random walks and polygons are of a distance ρ apart and ρ is small compared to n. We propose a fitting model that would capture the theoretical asymptotic behaviour of the mean average ICN for large values of ρ. Our simulation result shows that the model in fact works very well for the entire range of ρ. We also study the mean ICN between two equilateral random walks and polygons of different lengths. An interesting result is that even if one random walk (polygon) has a fixed length, the mean average ICN between the two random walks (polygons) would still approach infinity if the length of the other random walk (polygon) approached infinity. The data provided by our simulations match our theoretical predictions very well

Half-life distribution table of radioactive nuclei

International Nuclear Information System (INIS)

Gugenberger, P.

1954-01-01

This table allows to identify an element if its period is known. Data for this table were taken from the half-life values adopted by Hollander, PERLMAN and SEABORG (Rev. mod. Phys., 1953, 22 number 2). Moreover for each nucleus, the mass number, the charge number and the type of decay are given in the table. (author) [fr

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

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.

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.

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

International Nuclear Information System (INIS)

Li Yang; Liao Sheng-Kai; Liang Fu-Tian; Shen Qi; Liang Hao; Peng Cheng-Zhi

2016-01-01

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

Direct generation of all-optical random numbers from optical pulse amplitude chaos.

Science.gov (United States)

Li, Pu; Wang, Yun-Cai; Wang, An-Bang; Yang, Ling-Zhen; Zhang, Ming-Jiang; Zhang, Jian-Zhong

2012-02-13

We propose and theoretically demonstrate an all-optical method for directly generating all-optical random numbers from pulse amplitude chaos produced by a mode-locked fiber ring laser. Under an appropriate pump intensity, the mode-locked laser can experience a quasi-periodic route to chaos. Such a chaos consists of a stream of pulses with a fixed repetition frequency but random intensities. In this method, we do not require sampling procedure and external triggered clocks but directly quantize the chaotic pulses stream into random number sequence via an all-optical flip-flop. Moreover, our simulation results show that the pulse amplitude chaos has no periodicity and possesses a highly symmetric distribution of amplitude. Thus, in theory, the obtained random number sequence without post-processing has a high-quality randomness verified by industry-standard statistical tests.

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

NNDSS - Table IV. Tuberculosis

Data.gov (United States)

U.S. Department of Health & Human Services — NNDSS - Table IV. Tuberculosis - 2016.This Table includes total number of cases reported in the United States, by region and by states, in accordance with the...

NNDSS - Table IV. Tuberculosis

Data.gov (United States)

U.S. Department of Health & Human Services — NNDSS - Table IV. Tuberculosis - 2014.This Table includes total number of cases reported in the United States, by region and by states, in accordance with the...

NNDSS - Table III. Tuberculosis

Data.gov (United States)

U.S. Department of Health & Human Services — NNDSS - Table III. Tuberculosis - 2017.This Table includes total number of cases reported in the United States, by region and by states, in accordance with the...

NNDSS - Table IV. Tuberculosis

Data.gov (United States)

U.S. Department of Health & Human Services — NNDSS - Table IV. Tuberculosis - 2015.This Table includes total number of cases reported in the United States, by region and by states, in accordance with the...

NNDSS - Table III. Tuberculosis

Data.gov (United States)

U.S. Department of Health & Human Services — NNDSS - Table III. Tuberculosis - 2018.This Table includes total number of cases reported in the United States, by region and by states, in accordance with the...

Pólya number and first return of bursty random walk: Rigorous solutions

Science.gov (United States)

Wan, J.; Xu, X. P.

2012-03-01

The recurrence properties of random walks can be characterized by Pólya number, i.e., the probability that the walker has returned to the origin at least once. In this paper, we investigate Pólya number and first return for bursty random walk on a line, in which the walk has different step size and moving probabilities. Using the concept of the Catalan number, we obtain exact results for first return probability, the average first return time and Pólya number for the first time. We show that Pólya number displays two different functional behavior when the walk deviates from the recurrent point. By utilizing the Lagrange inversion formula, we interpret our findings by transferring Pólya number to the closed-form solutions of an inverse function. We also calculate Pólya number using another approach, which corroborates our results and conclusions. Finally, we consider the recurrence properties and Pólya number of two variations of the bursty random walk model.

Assessment of Medical Students’ Posture When Using the Existing Best-Selling Laptop Tables Using Rapid Upper Limb Assessment Method

Directory of Open Access Journals (Sweden)

mojtaba jafarvand

2017-06-01

Full Text Available Introduction and purpose: Improper posture while working is one of the most important risk factors for musculoskeletal disorders. Regarding this, the aim of this study was to assess the posture of students studying at Qazvin University of Medical Sciences when using the existing best-selling laptop tables using rapid upper limb assessment (RULA method. Methods: This analytic, cross-sectional study was conducted on 50 male and female dormitory students in 2017. The study population was selected through stratified random sampling technique. The participants’ postures in two different work stations (tables number one and two were evaluated by means of RULA method. Data analysis was performed in SPSS version 16 using the independent sample t-test and ANOVA test. Results: According to the results, 36% and 46% of the students obtained scores of 3 and 4, respectively in case of table number one. Furthermore, regarding table number two, scores 3 and 4 were recorded for 48% and 44% of the participants, respectively. Therefore, tables number one and two were found to have 82% and 92% of level two corrective measure, respectively. In addition, a significant relationship was obtained between the demographic variables and RULA score (P<0.05. Conclusion: As the findings of the present study indicated, table number one was a better case than table number two for fitting with different body structures since it allowed for the adjustment of the height and inclination of the work surface. However, corrective measures were necessary for both tables to provide the users with comfort, convenience, health, and productivity when using these laptop tables.

High-speed true random number generation based on paired memristors for security electronics

Science.gov (United States)

Zhang, Teng; Yin, Minghui; Xu, Changmin; Lu, Xiayan; Sun, Xinhao; Yang, Yuchao; Huang, Ru

2017-11-01

True random number generator (TRNG) is a critical component in hardware security that is increasingly important in the era of mobile computing and internet of things. Here we demonstrate a TRNG using intrinsic variation of memristors as a natural source of entropy that is otherwise undesirable in most applications. The random bits were produced by cyclically switching a pair of tantalum oxide based memristors and comparing their resistance values in the off state, taking advantage of the more pronounced resistance variation compared with that in the on state. Using an alternating read scheme in the designed TRNG circuit, the unbiasedness of the random numbers was significantly improved, and the bitstream passed standard randomness tests. The Pt/TaO x /Ta memristors fabricated in this work have fast programming/erasing speeds of ˜30 ns, suggesting a high random number throughput. The approach proposed here thus holds great promise for physically-implemented random number generation.

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)

Random number generation based on digital differential chaos

KAUST Repository

Zidan, Mohammed A.; Radwan, Ahmed G.; Salama, Khaled N.

2012-01-01

In this paper, we present a fully digital differential chaos based random number generator. The output of the digital circuit is proved to be chaotic by calculating the output time series maximum Lyapunov exponent. We introduce a new post processing

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.

Superparamagnetic perpendicular magnetic tunnel junctions for true random number generators

Science.gov (United States)

Parks, Bradley; Bapna, Mukund; Igbokwe, Julianne; Almasi, Hamid; Wang, Weigang; Majetich, Sara A.

2018-05-01

Superparamagnetic perpendicular magnetic tunnel junctions are fabricated and analyzed for use in random number generators. Time-resolved resistance measurements are used as streams of bits in statistical tests for randomness. Voltage control of the thermal stability enables tuning the average speed of random bit generation up to 70 kHz in a 60 nm diameter device. In its most efficient operating mode, the device generates random bits at an energy cost of 600 fJ/bit. A narrow range of magnetic field tunes the probability of a given state from 0 to 1, offering a means of probabilistic computing.

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

The linking number and the writhe of uniform random walks and polygons in confined spaces

International Nuclear Information System (INIS)

Panagiotou, E; Lambropoulou, S; Millett, K C

2010-01-01

Random walks and polygons are used to model polymers. In this paper we consider the extension of the writhe, self-linking number and linking number to open chains. We then study the average writhe, self-linking and linking number of random walks and polygons over the space of configurations as a function of their length. We show that the mean squared linking number, the mean squared writhe and the mean squared self-linking number of oriented uniform random walks or polygons of length n, in a convex confined space, are of the form O(n 2 ). Moreover, for a fixed simple closed curve in a convex confined space, we prove that the mean absolute value of the linking number between this curve and a uniform random walk or polygon of n edges is of the form O(√n). Our numerical studies confirm those results. They also indicate that the mean absolute linking number between any two oriented uniform random walks or polygons, of n edges each, is of the form O(n). Equilateral random walks and polygons are used to model polymers in θ-conditions. We use numerical simulations to investigate how the self-linking and linking number of equilateral random walks scale with their length.

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.

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.

25 CFR 547.14 - What are the minimum technical standards for electronic random number generation?

Science.gov (United States)

2010-04-01

... random number generation? 547.14 Section 547.14 Indians NATIONAL INDIAN GAMING COMMISSION, DEPARTMENT OF... CLASS II GAMES § 547.14 What are the minimum technical standards for electronic random number generation...) Unpredictability; and (3) Non-repeatability. (b) Statistical Randomness.(1) Numbers produced by an RNG shall be...

Problems with the random number generator RANF implemented on the CDC cyber 205

Science.gov (United States)

Kalle, Claus; Wansleben, Stephan

1984-10-01

We show that using RANF may lead to wrong results when lattice models are simulated by Monte Carlo methods. We present a shift-register sequence random number generator which generates two random numbers per cycle on a two pipe CDC Cyber 205.

Building Kindergartners' Number Sense: A Randomized Controlled Study.

Science.gov (United States)

Jordan, Nancy C; Glutting, Joseph; Dyson, Nancy; Hassinger-Das, Brenna; Irwin, Casey

2012-08-01

Math achievement in elementary school is mediated by performance and growth in number sense during kindergarten. The aim of the present study was to test the effectiveness of a targeted small group number sense intervention for high-risk kindergartners from low-income communities. Children were randomly assigned to one of three groups ( n = 44 in each group): a number sense intervention group, a language intervention group, or a business as usual control group. Accounting for initial skill level in mathematical knowledge, children who received the number sense intervention performed better than controls at immediate post test, with meaningful effects on measures of number competencies and general math achievement. Many of the effects held eight weeks after the intervention was completed, suggesting that children internalized what they had learned. There were no differences between the language and control groups on any math-related measures.

Quantum random number generator based on quantum tunneling effect

OpenAIRE

Zhou, Haihan; Li, Junlin; Pan, Dong; Zhang, Weixing; Long, Guilu

2017-01-01

In this paper, we proposed an experimental implementation of quantum random number generator(QRNG) with inherent randomness of quantum tunneling effect of electrons. We exploited InGaAs/InP diodes, whose valance band and conduction band shared a quasi-constant energy barrier. We applied a bias voltage on the InGaAs/InP avalanche diode, which made the diode works under Geiger mode, and triggered the tunneling events with a periodic pulse. Finally, after data collection and post-processing, our...

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)

Characteristics of Tables for Disseminating Biobehavioral Results.

Science.gov (United States)

Schneider, Barbara St Pierre; Nagelhout, Ed; Feng, Du

2018-01-01

To report the complexity and richness of study variables within biological nursing research, authors often use tables; however, the ease with which consumers understand, synthesize, evaluate, and build upon findings depends partly upon table design. To assess and compare table characteristics within research and review articles published in Biological Research for Nursing and Nursing Research. A total of 10 elements in tables from 48 biobehavioral or biological research or review articles were analyzed. To test six hypotheses, a two-level hierarchical linear model was used for each of the continuous table elements, and a two-level hierarchical generalized linear model was used for each of the categorical table elements. Additionally, the inclusion of probability values in statistical tables was examined. The mean number of tables per article was 3. Tables in research articles were more likely to contain quantitative content, while tables in review articles were more likely to contain both quantitative and qualitative content. Tables in research articles had a greater number of rows, columns, and column-heading levels than tables in review articles. More than one half of statistical tables in research articles had a separate probability column or had probability values within the table, whereas approximately one fourth had probability notes. Authors and journal editorial staff may be generating tables that better depict biobehavioral content than those identified in specific style guidelines. However, authors and journal editorial staff may want to consider table design in terms of audience, including alternative visual displays.

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.

An investigation of the uniform random number generator

Science.gov (United States)

Temple, E. C.

1982-01-01

Most random number generators that are in use today are of the congruential form X(i+1) + AX(i) + C mod M where A, C, and M are nonnegative integers. If C=O, the generator is called the multiplicative type and those for which C/O are called mixed congruential generators. It is easy to see that congruential generators will repeat a sequence of numbers after a maximum of M values have been generated. The number of numbers that a procedure generates before restarting the sequence is called the length or the period of the generator. Generally, it is desirable to make the period as long as possible. A detailed discussion of congruential generators is given. Also, several promising procedures that differ from the multiplicative and mixed procedure are discussed.

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

Ultrafast quantum random number generation based on quantum phase fluctuations.

Science.gov (United States)

Xu, Feihu; Qi, Bing; Ma, Xiongfeng; Xu, He; Zheng, Haoxuan; Lo, Hoi-Kwong

2012-05-21

A quantum random number generator (QRNG) can generate true randomness by exploiting the fundamental indeterminism of quantum mechanics. Most approaches to QRNG employ single-photon detection technologies and are limited in speed. Here, we experimentally demonstrate an ultrafast QRNG at a rate over 6 Gbits/s based on the quantum phase fluctuations of a laser operating near threshold. Moreover, we consider a potential adversary who has partial knowledge on the raw data and discuss how one can rigorously remove such partial knowledge with postprocessing. We quantify the quantum randomness through min-entropy by modeling our system and employ two randomness extractors--Trevisan's extractor and Toeplitz-hashing--to distill the randomness, which is information-theoretically provable. The simplicity and high-speed of our experimental setup show the feasibility of a robust, low-cost, high-speed QRNG.

Building Kindergartners’ Number Sense: A Randomized Controlled Study

Science.gov (United States)

Jordan, Nancy C.; Glutting, Joseph; Dyson, Nancy; Hassinger-Das, Brenna; Irwin, Casey

2015-01-01

Math achievement in elementary school is mediated by performance and growth in number sense during kindergarten. The aim of the present study was to test the effectiveness of a targeted small group number sense intervention for high-risk kindergartners from low-income communities. Children were randomly assigned to one of three groups (n = 44 in each group): a number sense intervention group, a language intervention group, or a business as usual control group. Accounting for initial skill level in mathematical knowledge, children who received the number sense intervention performed better than controls at immediate post test, with meaningful effects on measures of number competencies and general math achievement. Many of the effects held eight weeks after the intervention was completed, suggesting that children internalized what they had learned. There were no differences between the language and control groups on any math-related measures. PMID:25866417

On the number of spanning trees in random regular graphs

DEFF Research Database (Denmark)

Greenhill, Catherine; Kwan, Matthew; Wind, David Kofoed

2014-01-01

Let d >= 3 be a fixed integer. We give an asympotic formula for the expected number of spanning trees in a uniformly random d-regular graph with n vertices. (The asymptotics are as n -> infinity, restricted to even n if d is odd.) We also obtain the asymptotic distribution of the number of spanning...

On Random Numbers and Design

Science.gov (United States)

Ben-Ari, Morechai

2004-01-01

The term "random" is frequently used in discussion of the theory of evolution, even though the mathematical concept of randomness is problematic and of little relevance in the theory. Therefore, since the core concept of the theory of evolution is the non-random process of natural selection, the term random should not be used in teaching the…

On the number of subgraphs of the Barabasi-Albert random graph

Energy Technology Data Exchange (ETDEWEB)

Ryabchenko, Aleksandr A; Samosvat, Egor A [Moscow Institute of Physics and Technology (State University), Dolgoprudnyi, Moscow Region, Russian Frderation (Russian Federation)

2012-06-30

We study a model of a random graph of the type of the Barabasi-Albert preferential attachment model. We develop a technique that makes it possible to estimate the mathematical expectation for a fairly wide class of random variables in the model under consideration. We use this technique to prove a theorem on the asymptotics of the mathematical expectation of the number of subgraphs isomorphic to a certain fixed graph in the random graphs of this model.

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.

Covariance of the number of real zeros of a random trigonometric polynomial

Directory of Open Access Journals (Sweden)

K. Farahmand

2006-01-01

Full Text Available For random coefficients aj and bj we consider a random trigonometric polynomial defined as Tn(θ=∑j=0n{ajcos⁡jθ+bjsin⁡jθ}. The expected number of real zeros of Tn(θ in the interval (0,2π can be easily obtained. In this note we show that this number is in fact n/3. However the variance of the above number is not known. This note presents a method which leads to the asymptotic value for the covariance of the number of real zeros of the above polynomial in intervals (0,π and (π,2π. It can be seen that our method in fact remains valid to obtain the result for any two disjoint intervals. The applicability of our method to the classical random trigonometric polynomial, defined as Pn(θ=∑j=0naj(ωcos⁡jθ, is also discussed. Tn(θ has the advantage on Pn(θ of being stationary, with respect to θ, for which, therefore, a more advanced method developed could be used to yield the results.

On the limiting characteristics of quantum random number generators at various clusterings of photocounts

Science.gov (United States)

Molotkov, S. N.

2017-03-01

Various methods for the clustering of photocounts constituting a sequence of random numbers are considered. It is shown that the clustering of photocounts resulting in the Fermi-Dirac distribution makes it possible to achieve the theoretical limit of the random number generation rate.

Raw and Central Moments of Binomial Random Variables via Stirling Numbers

Science.gov (United States)

Griffiths, Martin

2013-01-01

We consider here the problem of calculating the moments of binomial random variables. It is shown how formulae for both the raw and the central moments of such random variables may be obtained in a recursive manner utilizing Stirling numbers of the first kind. Suggestions are also provided as to how students might be encouraged to explore this…

40 CFR 761.308 - Sample selection by random number generation on any two-dimensional square grid.

Science.gov (United States)

2010-07-01

... 40 Protection of Environment 30 2010-07-01 2010-07-01 false Sample selection by random number... § 761.79(b)(3) § 761.308 Sample selection by random number generation on any two-dimensional square... area created in accordance with paragraph (a) of this section, select two random numbers: one each for...

True random number generation from mobile telephone photo based on chaotic cryptography

International Nuclear Information System (INIS)

Zhao Liang; Liao Xiaofeng; Xiao Di; Xiang Tao; Zhou Qing; Duan Shukai

2009-01-01

A cheap, convenient and universal TRNG based on mobile telephone photo for producing random bit sequence is proposed. To settle the problem of sequential pixels and comparability, three chaos-based approaches are applied to post-process the generated binary image. The random numbers produced by three users are tested using US NIST RNG statistical test software. The experimental results indicate that the Arnold cat map is the fastest way to generate a random bit sequence and can be accepted on general PC. The 'MASK' algorithm also performs well. Finally, comparing with the TRNG of Hu et al. [Hu Y, Liao X, Wong KW, Zhou Q. A true random number generator based on mouse movement and chaotic cryptography. Chaos, Solitons and Fractals 2007. doi: 10.1016/j.chaos.2007.10.022] which is presented by Hu et al., many merits of the proposed TRNG in this paper has been found.

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)

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.

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.

A revision of the subtract-with-borrow random number generators

Science.gov (United States)

Sibidanov, Alexei

2017-12-01

The most popular and widely used subtract-with-borrow generator, also known as RANLUX, is reimplemented as a linear congruential generator using large integer arithmetic with the modulus size of 576 bits. Modern computers, as well as the specific structure of the modulus inferred from RANLUX, allow for the development of a fast modular multiplication - the core of the procedure. This was previously believed to be slow and have too high cost in terms of computing resources. Our tests show a significant gain in generation speed which is comparable with other fast, high quality random number generators. An additional feature is the fast skipping of generator states leading to a seeding scheme which guarantees the uniqueness of random number sequences. Licensing provisions: GPLv3 Programming language: C++, C, Assembler

Some Reflections on the Periodic Table and Its Use.

Science.gov (United States)

Fernelius, W. Conard

1986-01-01

Discusses early periodic tables; effect on the periodic table of atomic numbers; the periodic table in relation to electron distribution in the atoms of elements; terms and concepts related to the table; and the modern basis of the periodic table. Additional comments about these and other topics are included. (JN)

Note on Marsaglia\\'s Xorshift Random Number Generators

Directory of Open Access Journals (Sweden)

Richard P. Brent

2004-08-01

Full Text Available Marsaglia (2003 has described a class of Xorshift random number generators (RNGs with periods 2n - 1 for n = 32, 64, etc. We show that the sequences generated by these RNGs are identical to the sequences generated by certain linear feedback shift register (LFSR generators using "exclusive or" (xor operations on n-bit words, with a recurrence defined by a primitive polynomial of degree n.

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.

Permit.LOA table

Data.gov (United States)

National Oceanic and Atmospheric Administration, Department of Commerce — This table includes the effective dates by vessel and permit number for each issued letter of authorization (LOA) by the Permit Office (APSD)

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

Science.gov (United States)

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

2016-12-27

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

Periodic table of elements

International Nuclear Information System (INIS)

Fluck, E.; Heumann, K.G.

1985-01-01

Following a recommendation by the International Union for Pure and Applied Chemistry (IUPAC), the groups of the periodic table shall be numbered from 1 to 18, instead of I to VIII as before. The recommendations has been approved of by the Committee on Nomenclature of the American Chemical Society. The new system abandons the distinction between main groups (a) and auxiliary groups (b), which in the past frequently has been the reason for misunderstandings between European and American chemists, due to different handling. The publishing house VCH Verlagsgesellschaft recently produced a new periodic table that shows the old and the new numbering system together at a glance, so that chemists will have time to get familiar with the new system. In addition the new periodic table represents an extensive data compilation arranged by elements. The front page lists the chemical properties of elements, the back page their physical properties. (orig./EF) [de

A random number generator for continuous random variables

Science.gov (United States)

Guerra, V. M.; Tapia, R. A.; Thompson, J. R.

1972-01-01

A FORTRAN 4 routine is given which may be used to generate random observations of a continuous real valued random variable. Normal distribution of F(x), X, E(akimas), and E(linear) is presented in tabular form.

Digital-Analog Hybrid Scheme and Its Application to Chaotic Random Number Generators

Science.gov (United States)

Yuan, Zeshi; Li, Hongtao; Miao, Yunchi; Hu, Wen; Zhu, Xiaohua

2017-12-01

Practical random number generation (RNG) circuits are typically achieved with analog devices or digital approaches. Digital-based techniques, which use field programmable gate array (FPGA) and graphics processing units (GPU) etc. usually have better performances than analog methods as they are programmable, efficient and robust. However, digital realizations suffer from the effect of finite precision. Accordingly, the generated random numbers (RNs) are actually periodic instead of being real random. To tackle this limitation, in this paper we propose a novel digital-analog hybrid scheme that employs the digital unit as the main body, and minimum analog devices to generate physical RNs. Moreover, the possibility of realizing the proposed scheme with only one memory element is discussed. Without loss of generality, we use the capacitor and the memristor along with FPGA to construct the proposed hybrid system, and a chaotic true random number generator (TRNG) circuit is realized, producing physical RNs at a throughput of Gbit/s scale. These RNs successfully pass all the tests in the NIST SP800-22 package, confirming the significance of the scheme in practical applications. In addition, the use of this new scheme is not restricted to RNGs, and it also provides a strategy to solve the effect of finite precision in other digital systems.

Guide to mathematical tables supplement no 1

CERN Document Server

Burunova, N M; Fedorova, R M

1960-01-01

A Guide to Mathematical Tables is a supplement to the Guide to Mathematical Tables published by the U.S.S.R. Academy of Sciences in 1956. The tables contain information on subjects such as powers, rational and algebraic functions, and trigonometric functions, as well as logarithms and polynomials and Legendre functions. An index listing all functions included in both the Guide and the Supplement is included.Comprised of 15 chapters, this supplement first describes mathematical tables in the following order: the accuracy of the table (that is, the number of decimal places or significant

Experimental study of a quantum random-number generator based on two independent lasers

Science.gov (United States)

Sun, Shi-Hai; Xu, Feihu

2017-12-01

A quantum random-number generator (QRNG) can produce true randomness by utilizing the inherent probabilistic nature of quantum mechanics. Recently, the spontaneous-emission quantum phase noise of the laser has been widely deployed for quantum random-number generation, due to its high rate, its low cost, and the feasibility of chip-scale integration. Here, we perform a comprehensive experimental study of a phase-noise-based QRNG with two independent lasers, each of which operates in either continuous-wave (CW) or pulsed mode. We implement the QRNG by operating the two lasers in three configurations, namely, CW + CW, CW + pulsed, and pulsed + pulsed, and demonstrate their trade-offs, strengths, and weaknesses.

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.

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

STATUS OF RADIOACTIVE ELEMENTS IN THE ATOMIC WEIGHTS TABLE

International Nuclear Information System (INIS)

HOLDEN, N.E.

2003-01-01

During discussions within the Inorganic Chemistry Division Committee, that dealt with the Periodic Table of the Chemical Elements and the official IUPAC position on its presentation, the following question was raised. When the various chemical elements are presented, each with their appropriate atomic weight value, how should the radioactive elements be presented? The Atomic Weights Commission has treated this question in a number of different ways during the past century, almost in a random manner. This report reviews the position that the Commission has taken as a function of time, as a prelude to a discussion in Ottawa about how the Commission should resolve this question for the future

A table top exercise and workshop

International Nuclear Information System (INIS)

Lakey, J.R.A.

1992-01-01

Table top exercises are widely applied in training for emergency preparedness and have long been a feature of Courses on Planning for Nuclear Emergencies. Experience of a large number of table top exercises is used to provide a classification of the types of exercise indicating the application and the disadvantages. The use of workshops is considered to be complementary rather than an alternative to teaching methods available from table top exercises. (author)

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

Random Number Simulations Reveal How Random Noise Affects the Measurements and Graphical Portrayals of Self-Assessed Competency

Directory of Open Access Journals (Sweden)

Edward Nuhfer

2016-01-01

Full Text Available Self-assessment measures of competency are blends of an authentic self-assessment signal that researchers seek to measure and random disorder or "noise" that accompanies that signal. In this study, we use random number simulations to explore how random noise affects critical aspects of self-assessment investigations: reliability, correlation, critical sample size, and the graphical representations of self-assessment data. We show that graphical conventions common in the self-assessment literature introduce artifacts that invite misinterpretation. Troublesome conventions include: (y minus x vs. (x scatterplots; (y minus x vs. (x column graphs aggregated as quantiles; line charts that display data aggregated as quantiles; and some histograms. Graphical conventions that generate minimal artifacts include scatterplots with a best-fit line that depict (y vs. (x measures (self-assessed competence vs. measured competence plotted by individual participant scores, and (y vs. (x scatterplots of collective average measures of all participants plotted item-by-item. This last graphic convention attenuates noise and improves the definition of the signal. To provide relevant comparisons across varied graphical conventions, we use a single dataset derived from paired measures of 1154 participants' self-assessed competence and demonstrated competence in science literacy. Our results show that different numerical approaches employed in investigating and describing self-assessment accuracy are not equally valid. By modeling this dataset with random numbers, we show how recognizing the varied expressions of randomness in self-assessment data can improve the validity of numeracy-based descriptions of self-assessment.

Recurrence and Polya Number of General One-Dimensional Random Walks

International Nuclear Information System (INIS)

Zhang Xiaokun; Wan Jing; Lu Jingju; Xu Xinping

2011-01-01

The recurrence properties of random walks can be characterized by Polya number, i.e., the probability that the walker has returned to the origin at least once. In this paper, we consider recurrence properties for a general 1D random walk on a line, in which at each time step the walker can move to the left or right with probabilities l and r, or remain at the same position with probability o (l + r + o = 1). We calculate Polya number P of this model and find a simple expression for P as, P = 1 - Δ, where Δ is the absolute difference of l and r (Δ = |l - r|). We prove this rigorous expression by the method of creative telescoping, and our result suggests that the walk is recurrent if and only if the left-moving probability l equals to the right-moving probability r. (general)

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.

Harvesting Entropy for Random Number Generation for Internet of Things Constrained Devices Using On-Board Sensors

Directory of Open Access Journals (Sweden)

Marcin Piotr Pawlowski

2015-10-01

Full Text Available Entropy in computer security is associated with the unpredictability of a source of randomness. The random source with high entropy tends to achieve a uniform distribution of random values. Random number generators are one of the most important building blocks of cryptosystems. In constrained devices of the Internet of Things ecosystem, high entropy random number generators are hard to achieve due to hardware limitations. For the purpose of the random number generation in constrained devices, this work proposes a solution based on the least-significant bits concatenation entropy harvesting method. As a potential source of entropy, on-board integrated sensors (i.e., temperature, humidity and two different light sensors have been analyzed. Additionally, the costs (i.e., time and memory consumption of the presented approach have been measured. The results obtained from the proposed method with statistical fine tuning achieved a Shannon entropy of around 7.9 bits per byte of data for temperature and humidity sensors. The results showed that sensor-based random number generators are a valuable source of entropy with very small RAM and Flash memory requirements for constrained devices of the Internet of Things.

Harvesting Entropy for Random Number Generation for Internet of Things Constrained Devices Using On-Board Sensors

Science.gov (United States)

Pawlowski, Marcin Piotr; Jara, Antonio; Ogorzalek, Maciej

2015-01-01

Entropy in computer security is associated with the unpredictability of a source of randomness. The random source with high entropy tends to achieve a uniform distribution of random values. Random number generators are one of the most important building blocks of cryptosystems. In constrained devices of the Internet of Things ecosystem, high entropy random number generators are hard to achieve due to hardware limitations. For the purpose of the random number generation in constrained devices, this work proposes a solution based on the least-significant bits concatenation entropy harvesting method. As a potential source of entropy, on-board integrated sensors (i.e., temperature, humidity and two different light sensors) have been analyzed. Additionally, the costs (i.e., time and memory consumption) of the presented approach have been measured. The results obtained from the proposed method with statistical fine tuning achieved a Shannon entropy of around 7.9 bits per byte of data for temperature and humidity sensors. The results showed that sensor-based random number generators are a valuable source of entropy with very small RAM and Flash memory requirements for constrained devices of the Internet of Things. PMID:26506357

Harvesting entropy for random number generation for internet of things constrained devices using on-board sensors.

Science.gov (United States)

Pawlowski, Marcin Piotr; Jara, Antonio; Ogorzalek, Maciej

2015-10-22

Entropy in computer security is associated with the unpredictability of a source of randomness. The random source with high entropy tends to achieve a uniform distribution of random values. Random number generators are one of the most important building blocks of cryptosystems. In constrained devices of the Internet of Things ecosystem, high entropy random number generators are hard to achieve due to hardware limitations. For the purpose of the random number generation in constrained devices, this work proposes a solution based on the least-significant bits concatenation entropy harvesting method. As a potential source of entropy, on-board integrated sensors (i.e., temperature, humidity and two different light sensors) have been analyzed. Additionally, the costs (i.e., time and memory consumption) of the presented approach have been measured. The results obtained from the proposed method with statistical fine tuning achieved a Shannon entropy of around 7.9 bits per byte of data for temperature and humidity sensors. The results showed that sensor-based random number generators are a valuable source of entropy with very small RAM and Flash memory requirements for constrained devices of the Internet of Things.

Volume tables for red alder.

Science.gov (United States)

Floyd A. Johnson; R. M. Kallander; Paul G. Lauterbach

1949-01-01

The increasing importance of red alder as a commercial species in the Pacific Northwest has prompted the three agencies listed above to pool their tree measurement data for the construction of standard regional red alder volume tables. The tables included here were based on trees from a variety of sites and form classes. Approximately one quarter of the total number of...

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

Mathematical conversations multicolor problems, problems in the theory of numbers, and random walks

CERN Document Server

Dynkin, E B

2006-01-01

Comprises Multicolor Problems, dealing with map-coloring problems; Problems in the Theory of Numbers, an elementary introduction to algebraic number theory; Random Walks, addressing basic problems in probability theory. 1963 edition.

Quantum random number generator based on quantum nature of vacuum fluctuations

Science.gov (United States)

Ivanova, A. E.; Chivilikhin, S. A.; Gleim, A. V.

2017-11-01

Quantum random number generator (QRNG) allows obtaining true random bit sequences. In QRNG based on quantum nature of vacuum, optical beam splitter with two inputs and two outputs is normally used. We compare mathematical descriptions of spatial beam splitter and fiber Y-splitter in the quantum model for QRNG, based on homodyne detection. These descriptions were identical, that allows to use fiber Y-splitters in practical QRNG schemes, simplifying the setup. Also we receive relations between the input radiation and the resulting differential current in homodyne detector. We experimentally demonstrate possibility of true random bits generation by using QRNG based on homodyne detection with Y-splitter.

Robust random number generation using steady-state emission of gain-switched laser diodes

International Nuclear Information System (INIS)

Yuan, Z. L.; Lucamarini, M.; Dynes, J. F.; Fröhlich, B.; Plews, A.; Shields, A. J.

2014-01-01

We demonstrate robust, high-speed random number generation using interference of the steady-state emission of guaranteed random phases, obtained through gain-switching a semiconductor laser diode. Steady-state emission tolerates large temporal pulse misalignments and therefore significantly improves the interference quality. Using an 8-bit digitizer followed by a finite-impulse-response unbiasing algorithm, we achieve random number generation rates of 8 and 20 Gb/s, for laser repetition rates of 1 and 2.5 GHz, respectively, with a ±20% tolerance in the interferometer differential delay. We also report a generation rate of 80 Gb/s using partially phase-correlated short pulses. In relation to the field of quantum key distribution, our results confirm the gain-switched laser diode as a suitable light source, capable of providing phase-randomized coherent pulses at a clock rate of up to 2.5 GHz.

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.

The application of the central limit theorem and the law of large numbers to facial soft tissue depths: T-Table robustness and trends since 2008.

Science.gov (United States)

Stephan, Carl N

2014-03-01

By pooling independent study means (x¯), the T-Tables use the central limit theorem and law of large numbers to average out study-specific sampling bias and instrument errors and, in turn, triangulate upon human population means (μ). Since their first publication in 2008, new data from >2660 adults have been collected (c.30% of the original sample) making a review of the T-Table's robustness timely. Updated grand means show that the new data have negligible impact on the previously published statistics: maximum change = 1.7 mm at gonion; and ≤1 mm at 93% of all landmarks measured. This confirms the utility of the 2008 T-Table as a proxy to soft tissue depth population means and, together with updated sample sizes (8851 individuals at pogonion), earmarks the 2013 T-Table as the premier mean facial soft tissue depth standard for craniofacial identification casework. The utility of the T-Table, in comparison with shorths and 75-shormaxes, is also discussed. © 2013 American Academy of Forensic Sciences.

A Memory-Based Programmable Logic Device Using Look-Up Table Cascade with Synchronous Static Random Access Memories

Science.gov (United States)

Nakamura, Kazuyuki; Sasao, Tsutomu; Matsuura, Munehiro; Tanaka, Katsumasa; Yoshizumi, Kenichi; Nakahara, Hiroki; Iguchi, Yukihiro

2006-04-01

A large-scale memory-technology-based programmable logic device (PLD) using a look-up table (LUT) cascade is developed in the 0.35-μm standard complementary metal oxide semiconductor (CMOS) logic process. Eight 64 K-bit synchronous SRAMs are connected to form an LUT cascade with a few additional circuits. The features of the LUT cascade include: 1) a flexible cascade connection structure, 2) multi phase pseudo asynchronous operations with synchronous static random access memory (SRAM) cores, and 3) LUT-bypass redundancy. This chip operates at 33 MHz in 8-LUT cascades at 122 mW. Benchmark results show that it achieves a comparable performance to field programmable gate array (FPGAs).

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.

A robust random number generator based on differential comparison of chaotic laser signals.

Science.gov (United States)

Zhang, Jianzhong; Wang, Yuncai; Liu, Ming; Xue, Lugang; Li, Pu; Wang, Anbang; Zhang, Mingjiang

2012-03-26

We experimentally realize a robust real-time random number generator by differentially comparing the signal from a chaotic semiconductor laser and its delayed signal through a 1-bit analog-to-digital converter. The probability density distribution of the output chaotic signal based on the differential comparison method possesses an extremely small coefficient of Pearson's median skewness (1.5 × 10⁻⁶), which can yield a balanced random sequence much easily than the previously reported method that compares the signal from the chaotic laser with a certain threshold value. Moveover, we experimently demonstrate that our method can stably generate good random numbers at rates of 1.44 Gbit/s with excellent immunity from external perturbations while the previously reported method fails.

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)

Generating log-normally distributed random numbers by using the Ziggurat algorithm

International Nuclear Information System (INIS)

Choi, Jong Soo

2016-01-01

Uncertainty analyses are usually based on the Monte Carlo method. Using an efficient random number generator(RNG) is a key element in success of Monte Carlo simulations. Log-normal distributed variates are very typical in NPP PSAs. This paper proposes an approach to generate log normally distributed variates based on the Ziggurat algorithm and evaluates the efficiency of the proposed Ziggurat RNG. The proposed RNG can be helpful to improve the uncertainty analysis of NPP PSAs. This paper focuses on evaluating the efficiency of the Ziggurat algorithm from a NPP PSA point of view. From this study, we can draw the following conclusions. - The Ziggurat algorithm is one of perfect random number generators to product normal distributed variates. - The Ziggurat algorithm is computationally much faster than the most commonly used method, Marsaglia polar method

PUFKEY: A High-Security and High-Throughput Hardware True Random Number Generator for Sensor Networks

Directory of Open Access Journals (Sweden)

Dongfang Li

2015-10-01

Full Text Available Random number generators (RNG play an important role in many sensor network systems and applications, such as those requiring secure and robust communications. In this paper, we develop a high-security and high-throughput hardware true random number generator, called PUFKEY, which consists of two kinds of physical unclonable function (PUF elements. Combined with a conditioning algorithm, true random seeds are extracted from the noise on the start-up pattern of SRAM memories. These true random seeds contain full entropy. Then, the true random seeds are used as the input for a non-deterministic hardware RNG to generate a stream of true random bits with a throughput as high as 803 Mbps. The experimental results show that the bitstream generated by the proposed PUFKEY can pass all standard national institute of standards and technology (NIST randomness tests and is resilient to a wide range of security attacks.

PUFKEY: a high-security and high-throughput hardware true random number generator for sensor networks.

Science.gov (United States)

Li, Dongfang; Lu, Zhaojun; Zou, Xuecheng; Liu, Zhenglin

2015-10-16

Random number generators (RNG) play an important role in many sensor network systems and applications, such as those requiring secure and robust communications. In this paper, we develop a high-security and high-throughput hardware true random number generator, called PUFKEY, which consists of two kinds of physical unclonable function (PUF) elements. Combined with a conditioning algorithm, true random seeds are extracted from the noise on the start-up pattern of SRAM memories. These true random seeds contain full entropy. Then, the true random seeds are used as the input for a non-deterministic hardware RNG to generate a stream of true random bits with a throughput as high as 803 Mbps. The experimental results show that the bitstream generated by the proposed PUFKEY can pass all standard national institute of standards and technology (NIST) randomness tests and is resilient to a wide range of security attacks.

High-Speed Device-Independent Quantum Random Number Generation without a Detection Loophole

Science.gov (United States)

Liu, Yang; Yuan, Xiao; Li, Ming-Han; Zhang, Weijun; Zhao, Qi; Zhong, Jiaqiang; Cao, Yuan; Li, Yu-Huai; Chen, Luo-Kan; Li, Hao; Peng, Tianyi; Chen, Yu-Ao; Peng, Cheng-Zhi; Shi, Sheng-Cai; Wang, Zhen; You, Lixing; Ma, Xiongfeng; Fan, Jingyun; Zhang, Qiang; Pan, Jian-Wei

2018-01-01

Quantum mechanics provides the means of generating genuine randomness that is impossible with deterministic classical processes. Remarkably, the unpredictability of randomness can be certified in a manner that is independent of implementation devices. Here, we present an experimental study of device-independent quantum random number generation based on a detection-loophole-free Bell test with entangled photons. In the randomness analysis, without the independent identical distribution assumption, we consider the worst case scenario that the adversary launches the most powerful attacks against the quantum adversary. After considering statistical fluctuations and applying an 80 Gb ×45.6 Mb Toeplitz matrix hashing, we achieve a final random bit rate of 114 bits /s , with a failure probability less than 10-5. This marks a critical step towards realistic applications in cryptography and fundamental physics tests.

Monte Carlo learning/biasing experiment with intelligent random numbers

International Nuclear Information System (INIS)

Booth, T.E.

1985-01-01

A Monte Carlo learning and biasing technique is described that does its learning and biasing in the random number space rather than the physical phase-space. The technique is probably applicable to all linear Monte Carlo problems, but no proof is provided here. Instead, the technique is illustrated with a simple Monte Carlo transport problem. Problems encountered, problems solved, and speculations about future progress are discussed. 12 refs

Unidirectional interference in use of nondominant hand during concurrent Grooved Pegboard and random number generation tasks.

Science.gov (United States)

Strenge, Hans; Niederberger, Uwe

2008-06-01

The interference effect between Grooved Pegboard task with either hand and the executive task of cued verbal random number generation was investigated. 24 normal right-handed subjects performed each task under separate (single-task) and concurrent (dual-task) conditions. Articulatory suppression was required as an additional secondary task during pegboard performance. Analysis indicated an unambiguous distinction between the two hands. Comparisons of single-task and dual-task conditions showed an asymmetrical pattern of unidirectional interference with no practice effects during pegboard performance. Concurrent performance with nondominant hand but not the dominant hand of random number generation performance became continuously slower. There was no effect of divided attention on pegboard performance. Findings support the idea that the nondominant hand on the pegboard and random number tasks draw from the same processing resources but that for the executive aspect random number generation is more sensitive to changes in allocation of attentional resources.

Compact Quantum Random Number Generator with Silicon Nanocrystals Light Emitting Device Coupled to a Silicon Photomultiplier

Science.gov (United States)

Bisadi, Zahra; Acerbi, Fabio; Fontana, Giorgio; Zorzi, Nicola; Piemonte, Claudio; Pucker, Georg; Pavesi, Lorenzo

2018-02-01

A small-sized photonic quantum random number generator, easy to be implemented in small electronic devices for secure data encryption and other applications, is highly demanding nowadays. Here, we propose a compact configuration with Silicon nanocrystals large area light emitting device (LED) coupled to a Silicon photomultiplier to generate random numbers. The random number generation methodology is based on the photon arrival time and is robust against the non-idealities of the detector and the source of quantum entropy. The raw data show high quality of randomness and pass all the statistical tests in national institute of standards and technology tests (NIST) suite without a post-processing algorithm. The highest bit rate is 0.5 Mbps with the efficiency of 4 bits per detected photon.

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.

On the number of subgraphs of the Barabási-Albert random graph

International Nuclear Information System (INIS)

Ryabchenko, Aleksandr A; Samosvat, Egor A

2012-01-01

We study a model of a random graph of the type of the Barabási-Albert preferential attachment model. We develop a technique that makes it possible to estimate the mathematical expectation for a fairly wide class of random variables in the model under consideration. We use this technique to prove a theorem on the asymptotics of the mathematical expectation of the number of subgraphs isomorphic to a certain fixed graph in the random graphs of this model.

Note: Fully integrated 3.2 Gbps quantum random number generator with real-time extraction

International Nuclear Information System (INIS)

Zhang, Xiao-Guang; Nie, You-Qi; Liang, Hao; Zhang, Jun; Pan, Jian-Wei; Zhou, Hongyi; Ma, Xiongfeng

2016-01-01

We present a real-time and fully integrated quantum random number generator (QRNG) by measuring laser phase fluctuations. The QRNG scheme based on laser phase fluctuations is featured for its capability of generating ultra-high-speed random numbers. However, the speed bottleneck of a practical QRNG lies on the limited speed of randomness extraction. To close the gap between the fast randomness generation and the slow post-processing, we propose a pipeline extraction algorithm based on Toeplitz matrix hashing and implement it in a high-speed field-programmable gate array. Further, all the QRNG components are integrated into a module, including a compact and actively stabilized interferometer, high-speed data acquisition, and real-time data post-processing and transmission. The final generation rate of the QRNG module with real-time extraction can reach 3.2 Gbps.

Note: Fully integrated 3.2 Gbps quantum random number generator with real-time extraction

Energy Technology Data Exchange (ETDEWEB)

Zhang, Xiao-Guang; Nie, You-Qi; Liang, Hao; Zhang, Jun, E-mail: zhangjun@ustc.edu.cn; Pan, Jian-Wei [Hefei National Laboratory for Physical Sciences at the Microscale and Department of Modern Physics, University of Science and Technology of China, Hefei, Anhui 230026 (China); CAS Center for Excellence and Synergetic Innovation Center in Quantum Information and Quantum Physics, University of Science and Technology of China, Hefei, Anhui 230026 (China); Zhou, Hongyi; Ma, Xiongfeng [Center for Quantum Information, Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing 100084 (China)

2016-07-15

We present a real-time and fully integrated quantum random number generator (QRNG) by measuring laser phase fluctuations. The QRNG scheme based on laser phase fluctuations is featured for its capability of generating ultra-high-speed random numbers. However, the speed bottleneck of a practical QRNG lies on the limited speed of randomness extraction. To close the gap between the fast randomness generation and the slow post-processing, we propose a pipeline extraction algorithm based on Toeplitz matrix hashing and implement it in a high-speed field-programmable gate array. Further, all the QRNG components are integrated into a module, including a compact and actively stabilized interferometer, high-speed data acquisition, and real-time data post-processing and transmission. The final generation rate of the QRNG module with real-time extraction can reach 3.2 Gbps.

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.

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.

Generating Random Samples of a Given Size Using Social Security Numbers.

Science.gov (United States)

Erickson, Richard C.; Brauchle, Paul E.

1984-01-01

The purposes of this article are (1) to present a method by which social security numbers may be used to draw cluster samples of a predetermined size and (2) to describe procedures used to validate this method of drawing random samples. (JOW)

Compact Quantum Random Number Generator with Silicon Nanocrystals Light Emitting Device Coupled to a Silicon Photomultiplier

Directory of Open Access Journals (Sweden)

Zahra Bisadi

2018-02-01

Full Text Available A small-sized photonic quantum random number generator, easy to be implemented in small electronic devices for secure data encryption and other applications, is highly demanding nowadays. Here, we propose a compact configuration with Silicon nanocrystals large area light emitting device (LED coupled to a Silicon photomultiplier to generate random numbers. The random number generation methodology is based on the photon arrival time and is robust against the non-idealities of the detector and the source of quantum entropy. The raw data show high quality of randomness and pass all the statistical tests in national institute of standards and technology tests (NIST suite without a post-processing algorithm. The highest bit rate is 0.5 Mbps with the efficiency of 4 bits per detected photon.

On the Upper Limit (Heaviest Element in the Periodic Table of Elements, and the Periodic Table of Anti-Substance

Directory of Open Access Journals (Sweden)

Khazan A.

2009-04-01

Full Text Available On the basis of the method involving equilateral hyperbolas developed by us with ref- erence to the Periodic Table, its Top Limit has been established. It is the last element with atomic mass 411.66 and serial number 155. The great value, according to our calculation, has adjacent hyperbolas whose center is the point (0; 1. With the method, it has been possible to find just one element in the Periodic Table — Rhodium, which does not demand additional calculations involving the definition of the valid axes. Cal- culations towards updating the charge of a nucleus and the quantity of neutrons in end N-Z part of the diagram by means of the serial number 155 are herein executed. The variant of the Periodic Table of Elements with the eighth period is recommended. On the basis of symmetry, with the application of the Hyperbolic Law in the Periodic Table of Elements, the existence of Anti-Substances is herein indirectly proved.

VirtualTable: a projection augmented reality game

DEFF Research Database (Denmark)

Dal Corso, Alessandro; Olsen, Mikkel Damgaard; Steenstrup, Kasper Hornbak

2015-01-01

VirtualTable is a projection augmented reality installation where users are engaged in an interactive tower defense game. The installation runs continuously and is designed to attract people to a table, which the game is projected onto. Any number of players can join the game for an optional period...

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

Use of probability tables for propagating uncertainties in neutronics

International Nuclear Information System (INIS)

Coste-Delclaux, M.; Diop, C.M.; Lahaye, S.

2017-01-01

Highlights: • Moment-based probability table formalism is described. • Representation by probability tables of any uncertainty distribution is established. • Multiband equations for two kinds of uncertainty propagation problems are solved. • Numerical examples are provided and validated against Monte Carlo simulations. - Abstract: Probability tables are a generic tool that allows representing any random variable whose probability density function is known. In the field of nuclear reactor physics, this tool is currently used to represent the variation of cross-sections versus energy (neutron transport codes TRIPOLI4®, MCNP, APOLLO2, APOLLO3®, ECCO/ERANOS…). In the present article we show how we can propagate uncertainties, thanks to a probability table representation, through two simple physical problems: an eigenvalue problem (neutron multiplication factor) and a depletion problem.

Random number generation based on digital differential chaos

KAUST Repository

Zidan, Mohammed A.

2012-07-29

In this paper, we present a fully digital differential chaos based random number generator. The output of the digital circuit is proved to be chaotic by calculating the output time series maximum Lyapunov exponent. We introduce a new post processing technique to improve the distribution and statistical properties of the generated data. The post-processed output passes the NIST Sp. 800-22 statistical tests. The system is written in Verilog VHDL and realized on Xilinx Virtex® FPGA. The generator can fit into a very small area and have a maximum throughput of 2.1 Gb/s.

Similarity and number of alternatives in the random-dot motion paradigm

NARCIS (Netherlands)

van Maanen, L.; Grasman, R.P.P.P.; Forstmann, B.U.; Keuken, M.C.; Brown, S.D.; Wagenmakers, E.-J.

2012-01-01

The popular random-dot motion (RDM) task has recently been applied to multiple-choice perceptual decisionmaking. However, changes in the number of alternatives on an RDM display lead to changes in the similarity between the alternatives, complicating the study of multiple-choice effects. To

Learning Binomial Probability Concepts with Simulation, Random Numbers and a Spreadsheet

Science.gov (United States)

Rochowicz, John A., Jr.

2005-01-01

This paper introduces the reader to the concepts of binomial probability and simulation. A spreadsheet is used to illustrate these concepts. Random number generators are great technological tools for demonstrating the concepts of probability. Ideas of approximation, estimation, and mathematical usefulness provide numerous ways of learning…

40 CFR Table 3 of Subpart Aaaaaaa... - Test Methods

Science.gov (United States)

2010-07-01

... 40 Protection of Environment 14 2010-07-01 2010-07-01 false Test Methods 3 Table 3 of Subpart..., Subpt. AAAAAAA, Table 3 Table 3 of Subpart AAAAAAA of Part 63—Test Methods For * * * You must use * * * 1. Selecting the sampling locations a and the number of traverse points EPA test method 1 or 1A in...

A data based random number generator for a multivariate distribution (using stochastic interpolation)

Science.gov (United States)

Thompson, J. R.; Taylor, M. S.

1982-01-01

Let X be a K-dimensional random variable serving as input for a system with output Y (not necessarily of dimension k). given X, an outcome Y or a distribution of outcomes G(Y/X) may be obtained either explicitly or implicity. The situation is considered in which there is a real world data set X sub j sub = 1 (n) and a means of simulating an outcome Y. A method for empirical random number generation based on the sample of observations of the random variable X without estimating the underlying density is discussed.

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.

Using Economic Input/Output Tables to Predict a Country's Nuclear Status

International Nuclear Information System (INIS)

Weimar, Mark R.; Daly, Don S.; Wood, Thomas W.

2010-01-01

Both nuclear power and nuclear weapons programs should have (related) economic signatures which are detectible at some scale. We evaluated this premise in a series of studies using national economic input/output (IO) data. Statistical discrimination models using economic IO tables predict with a high probability whether a country with an unknown predilection for nuclear weapons proliferation is in fact engaged in nuclear power development or nuclear weapons proliferation. We analyzed 93 IO tables, spanning the years 1993 to 2005 for 37 countries that are either members or associates of the Organization for Economic Cooperation and Development (OECD). The 2009 OECD input/output tables featured 48 industrial sectors based on International Standard Industrial Classification (ISIC) Revision 3, and described the respective economies in current country-of-origin valued currency. We converted and transformed these reported values to US 2005 dollars using appropriate exchange rates and implicit price deflators, and addressed discrepancies in reported industrial sectors across tables. We then classified countries with Random Forest using either the adjusted or industry-normalized values. Random Forest, a classification tree technique, separates and categorizes countries using a very small, select subset of the 2304 individual cells in the IO table. A nation's efforts in nuclear power, be it for electricity or nuclear weapons, are an enterprise with a large economic footprint -- an effort so large that it should discernibly perturb coarse country-level economics data such as that found in yearly input-output economic tables. The neoclassical economic input-output model describes a country's or region's economy in terms of the requirements of industries to produce the current level of economic output. An IO table row shows the distribution of an industry's output to the industrial sectors while a table column shows the input required of each industrial sector by a given

Real-time multiparameter pulse processing with decision tables

International Nuclear Information System (INIS)

Hull, K.; Griffin, H.

1986-01-01

Decision tables offer several advantages over other real-time multiparameter, data processing techniques. These include very high collection rates, minimum number of computer instructions, rates independent of the number of conditions applied per parameter, ease of adding or removing conditions during a session, and simplicity of implementation. Decisions table processing is important in multiparameter nuclear spectroscopy, coincidence experiments, multiparameter pulse processing (HgI 2 resolution enhancement, pulse discrimination, timing spectroscopy), and other applications can be easily implemented. (orig.)

44 CFR 208.12 - Maximum Pay Rate Table.

Science.gov (United States)

2010-10-01

...) Physicians. DHS uses the latest Special Salary Rate Table Number 0290 for Medical Officers (Clinical... Personnel, in which case the Maximum Pay Rate Table would not apply. (3) Compensation for Sponsoring Agency... organizations, e.g., HMOs or medical or engineering professional associations, under the revised definition of...

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.

On the design of henon and logistic map-based random number generator

Science.gov (United States)

Magfirawaty; Suryadi, M. T.; Ramli, Kalamullah

2017-10-01

The key sequence is one of the main elements in the cryptosystem. True Random Number Generators (TRNG) method is one of the approaches to generating the key sequence. The randomness source of the TRNG divided into three main groups, i.e. electrical noise based, jitter based and chaos based. The chaos based utilizes a non-linear dynamic system (continuous time or discrete time) as an entropy source. In this study, a new design of TRNG based on discrete time chaotic system is proposed, which is then simulated in LabVIEW. The principle of the design consists of combining 2D and 1D chaotic systems. A mathematical model is implemented for numerical simulations. We used comparator process as a harvester method to obtain the series of random bits. Without any post processing, the proposed design generated random bit sequence with high entropy value and passed all NIST 800.22 statistical tests.

Reconstruction of photon number conditioned states using phase randomized homodyne measurements

International Nuclear Information System (INIS)

Chrzanowski, H M; Assad, S M; Bernu, J; Hage, B; Lam, P K; Symul, T; Lund, A P; Ralph, T C

2013-01-01

We experimentally demonstrate the reconstruction of a photon number conditioned state without using a photon number discriminating detector. By using only phase randomized homodyne measurements, we reconstruct up to the three photon subtracted squeezed vacuum state. The reconstructed Wigner functions of these states show regions of pronounced negativity, signifying the non-classical nature of the reconstructed states. The techniques presented allow for complete characterization of the role of a conditional measurement on an ensemble of states, and might prove useful in systems where photon counting still proves technically challenging. (paper)

Leveraging Random Number Generation for Mastery of Learning in Teaching Quantitative Research Courses via an E-Learning Method

Science.gov (United States)

Boonsathorn, Wasita; Charoen, Danuvasin; Dryver, Arthur L.

2014-01-01

E-Learning brings access to a powerful but often overlooked teaching tool: random number generation. Using random number generation, a practically infinite number of quantitative problem-solution sets can be created. In addition, within the e-learning context, in the spirit of the mastery of learning, it is possible to assign online quantitative…

Strong Laws of Large Numbers for Arrays of Rowwise NA and LNQD Random Variables

Directory of Open Access Journals (Sweden)

Jiangfeng Wang

2011-01-01

Full Text Available Some strong laws of large numbers and strong convergence properties for arrays of rowwise negatively associated and linearly negative quadrant dependent random variables are obtained. The results obtained not only generalize the result of Hu and Taylor to negatively associated and linearly negative quadrant dependent random variables, but also improve it.

Quantum Statistical Testing of a Quantum Random Number Generator

Energy Technology Data Exchange (ETDEWEB)

Humble, Travis S [ORNL

2014-01-01

The unobservable elements in a quantum technology, e.g., the quantum state, complicate system verification against promised behavior. Using model-based system engineering, we present methods for verifying the opera- tion of a prototypical quantum random number generator. We begin with the algorithmic design of the QRNG followed by the synthesis of its physical design requirements. We next discuss how quantum statistical testing can be used to verify device behavior as well as detect device bias. We conclude by highlighting how system design and verification methods must influence effort to certify future quantum technologies.

Low-wave-number statistics of randomly advected passive scalars

International Nuclear Information System (INIS)

Kerstein, A.R.; McMurtry, P.A.

1994-01-01

A heuristic analysis of the decay of a passive scalar field subject to statistically steady random advection, predicts two low-wave-number spectral scaling regimes analogous to the similarity states previously identified by Chasnov [Phys. Fluids 6, 1036 (1994)]. Consequences of their predicted coexistence in a single flow are examined. The analysis is limited to the idealized case of narrow band advection. To complement the analysis, and to extend the predictions to physically more realistic advection processes, advection diffusion is simulated using a one-dimensional stochastic model. An experimental test of the predictions is proposed

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.

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.

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

MIL-HDBK-338-Environmental Conversion Table Correction

Science.gov (United States)

Hark, Frank; Novack, Steve

2017-01-01

In reliability analysis for space launch vehicles, limited data is frequently a challenge due to the pure number of launches. A common solution is to use surrogate historical data of similar components from other industries (military data). The operating environment of the common data may be different from that of the necessary target analysis. The military electronic design handbook (MIL-HDBK-338) has a table for converting Mean Time Between Failure (MTBF) data from one environment to another. However, the table has some discrepancies and rounding of complementary conversions; namely going from environment A to B does not given the same result as going from B to A. This presentation will show the discrepancies in the original conversation table, the greater than expected magnitude, the problem with the updated published table and a suggested corrected table to reference when doing MTBF data environment conversion.

Periodic table as a powerful tool for radiation education

International Nuclear Information System (INIS)

Aratani, Michi; Osanai, Yuko; Uchiumi, Fumiko; Tsushima, Kazuko; Kamayachi, Tei; Kudo, Michiko

2005-01-01

The periodic tables ordinarily start with an element of atomic number 1, hydrogen. Hydrogen atoms, however, are derived from neutrons by way of β decay. Consequently, neutron should be located at a zero position of atomic number, which corresponds to the left side and above helium. A periodic table, especially with the zero position for neutron, is essential from present view of matter and serves as a powerful tool for radiation education. (author)

Chaotic oscillation and random-number generation based on nanoscale optical-energy transfer.

Science.gov (United States)

Naruse, Makoto; Kim, Song-Ju; Aono, Masashi; Hori, Hirokazu; Ohtsu, Motoichi

2014-08-12

By using nanoscale energy-transfer dynamics and density matrix formalism, we demonstrate theoretically and numerically that chaotic oscillation and random-number generation occur in a nanoscale system. The physical system consists of a pair of quantum dots (QDs), with one QD smaller than the other, between which energy transfers via optical near-field interactions. When the system is pumped by continuous-wave radiation and incorporates a timing delay between two energy transfers within the system, it emits optical pulses. We refer to such QD pairs as nano-optical pulsers (NOPs). Irradiating an NOP with external periodic optical pulses causes the oscillating frequency of the NOP to synchronize with the external stimulus. We find that chaotic oscillation occurs in the NOP population when they are connected by an external time delay. Moreover, by evaluating the time-domain signals by statistical-test suites, we confirm that the signals are sufficiently random to qualify the system as a random-number generator (RNG). This study reveals that even relatively simple nanodevices that interact locally with each other through optical energy transfer at scales far below the wavelength of irradiating light can exhibit complex oscillatory dynamics. These findings are significant for applications such as ultrasmall RNGs.

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

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.

Application of random number generators in genetic algorithms to improve rainfall-runoff modelling

Science.gov (United States)

Chlumecký, Martin; Buchtele, Josef; Richta, Karel

2017-10-01

The efficient calibration of rainfall-runoff models is a difficult issue, even for experienced hydrologists. Therefore, fast and high-quality model calibration is a valuable improvement. This paper describes a novel methodology and software for the optimisation of a rainfall-runoff modelling using a genetic algorithm (GA) with a newly prepared concept of a random number generator (HRNG), which is the core of the optimisation. The GA estimates model parameters using evolutionary principles, which requires a quality number generator. The new HRNG generates random numbers based on hydrological information and it provides better numbers compared to pure software generators. The GA enhances the model calibration very well and the goal is to optimise the calibration of the model with a minimum of user interaction. This article focuses on improving the internal structure of the GA, which is shielded from the user. The results that we obtained indicate that the HRNG provides a stable trend in the output quality of the model, despite various configurations of the GA. In contrast to previous research, the HRNG speeds up the calibration of the model and offers an improvement of rainfall-runoff modelling.

40 CFR Table C-1 to Subpart C of... - Test Concentration Ranges, Number of Measurements Required, and Maximum Discrepancy Specification

Science.gov (United States)

2010-07-01

... Measurements Required, and Maximum Discrepancy Specification C Table C-1 to Subpart C of Part 53 Protection of... Reference Methods Pt. 53, Subpt. C, Table C-1 Table C-1 to Subpart C of Part 53—Test Concentration Ranges..., June 22, 2010, table C-1 to subpart C was revised, effective Aug. 23, 2010. For the convenience of the...

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.

Modelling the number of olive groves in Spanish municipalities

Energy Technology Data Exchange (ETDEWEB)

Huete, M.D.; Marmolejo, J.A.

2016-11-01

The univariate generalized Waring distribution (UGWD) is presented as a new model to describe the goodness of fit, applicable in the context of agriculture. In this paper, it was used to model the number of olive groves recorded in Spain in the 8,091 municipalities recorded in the 2009 Agricultural Census, according to which the production of oil olives accounted for 94% of total output, while that of table olives represented 6% (with an average of 44.84 and 4.06 holdings per Spanish municipality, respectively). UGWD is suitable for fitting this type of discrete data, with strong left-sided asymmetry. This novel use of UGWD can provide the foundation for future research in agriculture, with the advantage over other discrete distributions that enables the analyst to split the variance. After defining the distribution, we analysed various methods for fitting the parameters associated with it, namely estimation by maximum likelihood, estimation by the method of moments and a variant of the latter, estimation by the method of frequencies and moments. For oil olives, the chi-square goodness of fit test gives p-values of 0.9992, 0.9967 and 0.9977, respectively. However, a poor fit was obtained for the table olive distribution. Finally, the variance was split, following Irwin, into three components related to random factors, external factors and internal differences. For the distribution of the number of olive grove holdings, this splitting showed that random and external factors only account about 0.22% and 0.05%. Therefore, internal differences within municipalities play an important role in determining total variability. (Author)

Multi-stage optimization of decision and inhibitory trees for decision tables with many-valued decisions

KAUST Repository

Azad, Mohammad

2017-06-16

We study problems of optimization of decision and inhibitory trees for decision tables with many-valued decisions. As cost functions, we consider depth, average depth, number of nodes, and number of terminal/nonterminal nodes in trees. Decision tables with many-valued decisions (multi-label decision tables) are often more accurate models for real-life data sets than usual decision tables with single-valued decisions. Inhibitory trees can sometimes capture more information from decision tables than decision trees. In this paper, we create dynamic programming algorithms for multi-stage optimization of trees relative to a sequence of cost functions. We apply these algorithms to prove the existence of totally optimal (simultaneously optimal relative to a number of cost functions) decision and inhibitory trees for some modified decision tables from the UCI Machine Learning Repository.

Multi-stage optimization of decision and inhibitory trees for decision tables with many-valued decisions

KAUST Repository

Azad, Mohammad; Moshkov, Mikhail

2017-01-01

We study problems of optimization of decision and inhibitory trees for decision tables with many-valued decisions. As cost functions, we consider depth, average depth, number of nodes, and number of terminal/nonterminal nodes in trees. Decision tables with many-valued decisions (multi-label decision tables) are often more accurate models for real-life data sets than usual decision tables with single-valued decisions. Inhibitory trees can sometimes capture more information from decision tables than decision trees. In this paper, we create dynamic programming algorithms for multi-stage optimization of trees relative to a sequence of cost functions. We apply these algorithms to prove the existence of totally optimal (simultaneously optimal relative to a number of cost functions) decision and inhibitory trees for some modified decision tables from the UCI Machine Learning Repository.

Estimation and testing in large binary contingency tables

NARCIS (Netherlands)

Kallenberg, W.C.M.

1989-01-01

Very sparse contingency tables with a multiplicative structure are studied. The number of unspecified parameters and the number of cells are growing with the number of observations. Consistency and asymptotic normality of natural estimators are established. Also uniform convergence of the estimators

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.

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.

Empirical method for simulation of water tables by digital computers

International Nuclear Information System (INIS)

Carnahan, C.L.; Fenske, P.R.

1975-09-01

An empirical method is described for computing a matrix of water-table elevations from a matrix of topographic elevations and a set of observed water-elevation control points which may be distributed randomly over the area of interest. The method is applicable to regions, such as the Great Basin, where the water table can be assumed to conform to a subdued image of overlying topography. A first approximation to the water table is computed by smoothing a matrix of topographic elevations and adjusting each node of the smoothed matrix according to a linear regression between observed water elevations and smoothed topographic elevations. Each observed control point is assumed to exert a radially decreasing influence on the first approximation surface. The first approximation is then adjusted further to conform to observed water-table elevations near control points. Outside the domain of control, the first approximation is assumed to represent the most probable configuration of the water table. The method has been applied to the Nevada Test Site and the Hot Creek Valley areas in Nevada

Expected number of real roots for random linear combinations of orthogonal polynomials associated with radial weights

OpenAIRE

Bayraktar, Turgay

2017-01-01

In this note, we obtain asymptotic expected number of real zeros for random polynomials of the form $$f_n(z)=\\sum_{j=0}^na^n_jc^n_jz^j$$ where $a^n_j$ are independent and identically distributed real random variables with bounded $(2+\\delta)$th absolute moment and the deterministic numbers $c^n_j$ are normalizing constants for the monomials $z^j$ within a weighted $L^2$-space induced by a radial weight function satisfying suitable smoothness and growth conditions.

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.

Table Tennis Club

CERN Multimedia

Table Tennis Club

2013-01-01

Apparently table tennis plays an important role in physics, not so much because physicists are interested in the theory of table tennis ball scattering, but probably because it provides useful breaks from their deep intellectual occupation. It seems that many of the greatest physicists took table tennis very seriously. For instance, Heisenberg could not even bear to lose a game of table tennis, Otto Frisch played a lot of table tennis, and had a table set up in his library, and Niels Bohr apparently beat everybody at table tennis. Therefore, as the CERN Table Tennis Club advertises on a poster for the next CERN Table Tennis Tournament: “if you want to be a great physicist, perhaps you should play table tennis”. Outdoor table at restaurant n° 1 For this reason, and also as part of the campaign launched by the CERN medical service “Move! & Eat better”, to encourage everyone at CERN to take regular exercise, the CERN Table Tennis Club, with the supp...

A periodic table of coiled-coil protein structures.

Science.gov (United States)

Moutevelis, Efrosini; Woolfson, Derek N

2009-01-23

Coiled coils are protein structure domains with two or more alpha-helices packed together via interlacing of side chains known as knob-into-hole packing. We analysed and classified a large set of coiled-coil structures using a combination of automated and manual methods. This led to a systematic classification that we termed a "periodic table of coiled coils," which we have made available at http://coiledcoils.chm.bris.ac.uk/ccplus/search/periodic_table. In this table, coiled-coil assemblies are arranged in columns with increasing numbers of alpha-helices and in rows of increased complexity. The table provides a framework for understanding possibilities in and limits on coiled-coil structures and a basis for future prediction, engineering and design studies.

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.

Derandomizing from random strings

NARCIS (Netherlands)

Buhrman, H.; Fortnow, L.; Koucký, M.; Loff, B.

2010-01-01

In this paper we show that BPP is truth-table reducible to the set of Kolmogorov random strings R(K). It was previously known that PSPACE, and hence BPP is Turing-reducible to R(K). The earlier proof relied on the adaptivity of the Turing-reduction to find a Kolmogorov-random string of polynomial

STATISTICAL LANDMARKS AND PRACTICAL ISSUES REGARDING THE USE OF SIMPLE RANDOM SAMPLING IN MARKET RESEARCHES

Directory of Open Access Journals (Sweden)

CODRUŢA DURA

2010-01-01

Full Text Available The sample represents a particular segment of the statistical populationchosen to represent it as a whole. The representativeness of the sample determines the accuracyfor estimations made on the basis of calculating the research indicators and the inferentialstatistics. The method of random sampling is part of probabilistic methods which can be usedwithin marketing research and it is characterized by the fact that it imposes the requirementthat each unit belonging to the statistical population should have an equal chance of beingselected for the sampling process. When the simple random sampling is meant to be rigorouslyput into practice, it is recommended to use the technique of random number tables in order toconfigure the sample which will provide information that the marketer needs. The paper alsodetails the practical procedure implemented in order to create a sample for a marketingresearch by generating random numbers using the facilities offered by Microsoft Excel.

The effects of transcranial magnetic stimulation over the dorsolateral prefrontal cortex on suppression of habitual counting during random number generation.

Science.gov (United States)

Jahanshahi, M; Profice, P; Brown, R G; Ridding, M C; Dirnberger, G; Rothwell, J C

1998-08-01

Random number generation is an attention-demanding task that engages working memory and executive processes. Random number generation requires holding information 'on line', suppression of habitual counting, internally driven response generation and monitoring of responses. Evidence from PET studies suggests that the dorsolateral prefrontal cortex (DLPFC) is involved in the generation of random responses. We examined the effects of short trains of transcranial magnetic stimulation (TMS) over the left or right DLPFC or medial frontal cortex on random number generation in healthy normal participants. As in previous evidence, in control trials without stimulation participants performed poorly on the random number generation task, showing repetition avoidance and a tendency to count. Brief disruption of processing with TMS over the left DLPFC changed the balance of the individuals' counting bias, increasing the most habitual counting in ones and reducing the lower probability response of counting in twos. This differential effect of TMS over the left DLPFC on the balance of the subject's counting bias was not obtained with TMS over the right DLPFC or the medial frontal cortex. The results suggest that, with disruption of the left DLPFC with TMS, habitual counting in ones that has previously been suppressed is released from inhibition. From these findings a network modulation model of random number generation is proposed, whereby suppression of habitual responses is achieved through the modulatory influence of the left DLPFC over a number-associative network in the superior temporal cortex. To allow emergence of appropriate random responses, the left DLPFC inhibits the superior temporal cortex to prevent spreading activation and habitual counting in ones.

Number needed to treat to benefit and to harm for intravenous tissue plasminogen activator therapy in the 3- to 4.5-hour window: joint outcome table analysis of the ECASS 3 trial.

Science.gov (United States)

Saver, Jeffrey L; Gornbein, Jeffrey; Grotta, James; Liebeskind, David; Lutsep, Helmi; Schwamm, Lee; Scott, Phillip; Starkman, Sidney

2009-07-01

Measures of a therapy's effect size are important guides to clinicians, patients, and policy-makers on treatment decisions in clinical practice. The ECASS 3 trial demonstrated a statistically significant benefit of intravenous tissue plasminogen activator for acute cerebral ischemia in the 3- to 4.5-hour window, but an effect size estimate incorporating benefit and harm across all levels of poststroke disability has not previously been derived. Joint outcome table specification was used to derive number needed to treat to benefit (NNTB) and number needed to treat to harm (NNTH) values summarizing treatment impact over the entire outcome range on the modified Rankin scale of global disability, including both expert-dependent and expert-independent (algorithmic and repeated random sampling) array generation. For the full 7-category modified Rankin scale, algorithmic analysis demonstrated that the NNTB for 1 additional patient to have a better outcome by >or=1 grades than with placebo must lie between 4.0 and 13.0. In bootstrap simulations, the mean NNTB was 7.1. Expert joint outcome table analyses indicated that the NNTB for improved final outcome was 6.1 (95% CI, 5.6-6.7) and the NNTH 37.5 (95% CI, 34.6-40.5). Benefit per 100 patients treated was 16.3 and harm per 100 was 2.7. The likelihood of help to harm ratio was 6.0. Treatment with tissue plasminogen activator in the 3- to 4.5-hour window confers benefit on approximately half as many patients as treatment <3 hours, with no increase in the conferral of harm. Approximately 1 in 6 patients has a better and 1 in 35 has a worse outcome as a result of therapy.

TableMaker: An Excel Macro for Publication-Quality Tables

Directory of Open Access Journals (Sweden)

Marek Hlavac

2016-04-01

Full Text Available This article introduces TableMaker, a Microsoft Excel macro that produces publicationquality tables and includes them as new sheets in workbooks. The macro provides an intuitive graphical user interface that allows for the full customization of all table features. It also allows users to save and load table templates, and thus allows layouts to be both reproducible and transferable. It is distributed in a single computer file. As such, the macro is easy to share, as well as accessible to even beginning and casual users of Excel. Since it allows for the quick creation of reproducible and fully customizable tables, TableMaker can be very useful to academics, policy-makers and businesses by making the presentation and formatting of results faster and more efficient.

Modelling the number of olive groves in Spanish municipalities

Directory of Open Access Journals (Sweden)

María-Dolores Huete

2016-03-01

Full Text Available The univariate generalized Waring distribution (UGWD is presented as a new model to describe the goodness of fit, applicable in the context of agriculture. In this paper, it was used to model the number of olive groves recorded in Spain in the 8,091 municipalities recorded in the 2009 Agricultural Census, according to which the production of oil olives accounted for 94% of total output, while that of table olives represented 6% (with an average of 44.84 and 4.06 holdings per Spanish municipality, respectively. UGWD is suitable for fitting this type of discrete data, with strong left-sided asymmetry. This novel use of UGWD can provide the foundation for future research in agriculture, with the advantage over other discrete distributions that enables the analyst to split the variance. After defining the distribution, we analysed various methods for fitting the parameters associated with it, namely estimation by maximum likelihood, estimation by the method of moments and a variant of the latter, estimation by the method of frequencies and moments. For oil olives, the chi-square goodness of fit test gives p-values of 0.9992, 0.9967 and 0.9977, respectively. However, a poor fit was obtained for the table olive distribution. Finally, the variance was split, following Irwin, into three components related to random factors, external factors and internal differences. For the distribution of the number of olive grove holdings, this splitting showed that random and external factors only account about 0.22% and 0.05%. Therefore, internal differences within municipalities play an important role in determining total variability.

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.

Mortality table construction

Science.gov (United States)

Sutawanir

2015-12-01

Mortality tables play important role in actuarial studies such as life annuities, premium determination, premium reserve, valuation pension plan, pension funding. Some known mortality tables are CSO mortality table, Indonesian Mortality Table, Bowers mortality table, Japan Mortality table. For actuary applications some tables are constructed with different environment such as single decrement, double decrement, and multiple decrement. There exist two approaches in mortality table construction : mathematics approach and statistical approach. Distribution model and estimation theory are the statistical concepts that are used in mortality table construction. This article aims to discuss the statistical approach in mortality table construction. The distributional assumptions are uniform death distribution (UDD) and constant force (exponential). Moment estimation and maximum likelihood are used to estimate the mortality parameter. Moment estimation methods are easier to manipulate compared to maximum likelihood estimation (mle). However, the complete mortality data are not used in moment estimation method. Maximum likelihood exploited all available information in mortality estimation. Some mle equations are complicated and solved using numerical methods. The article focus on single decrement estimation using moment and maximum likelihood estimation. Some extension to double decrement will introduced. Simple dataset will be used to illustrated the mortality estimation, and mortality table.

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

TABLE TENNIS CLUB

CERN Document Server

TABLE TENNIS CLUB

2010-01-01

2010 CERN Table Tennis Tournament The CERN Table Tennis Club organizes its traditional CERN Table Tennis Tournament, at the Meyrin club, 2 rue de livron, in Meyrin, Saturday August 21st, in the afternoon. The tournament is open to all CERN staff, users, visitors and families, including of course summer students. See below for details. In order to register, simply send an E-mail to Jean-Pierre Revol (jean-pierre.revol@cern.ch). You can also download the registration form from the Club Web page (http://www.cern.ch/tabletennis), and send it via internal mail. Photo taken on August 22, 2009 showing some of the participants in the 2nd CERN Table Tennis tournament. INFORMATION ON CERN TABLE TENNIS CLUB CERN used to have a tradition of table tennis activities at CERN. For some reason, at the beginning of the 1980’s, the CERN Table Tennis club merged with the Meyrin Table Tennis club, a member of the Association Genevoise de Tennis de Table (AGTT). Therefore, if you want to practice table tennis, you...

Statistical evaluation of PACSTAT random number generation capabilities

Energy Technology Data Exchange (ETDEWEB)

Piepel, G.F.; Toland, M.R.; Harty, H.; Budden, M.J.; Bartley, C.L.

1988-05-01

This report summarizes the work performed in verifying the general purpose Monte Carlo driver-program PACSTAT. The main objective of the work was to verify the performance of PACSTAT's random number generation capabilities. Secondary objectives were to document (using controlled configuration management procedures) changes made in PACSTAT at Pacific Northwest Laboratory, and to assure that PACSTAT input and output files satisfy quality assurance traceability constraints. Upon receipt of the PRIME version of the PACSTAT code from the Basalt Waste Isolation Project, Pacific Northwest Laboratory staff converted the code to run on Digital Equipment Corporation (DEC) VAXs. The modifications to PACSTAT were implemented using the WITNESS configuration management system, with the modifications themselves intended to make the code as portable as possible. Certain modifications were made to make the PACSTAT input and output files conform to quality assurance traceability constraints. 10 refs., 17 figs., 6 tabs.

Increased certification of semi-device independent random numbers using many inputs and more post-processing

International Nuclear Information System (INIS)

Mironowicz, Piotr; Tavakoli, Armin; Hameedi, Alley; Marques, Breno; Bourennane, Mohamed; Pawłowski, Marcin

2016-01-01

Quantum communication with systems of dimension larger than two provides advantages in information processing tasks. Examples include higher rates of key distribution and random number generation. The main disadvantage of using such multi-dimensional quantum systems is the increased complexity of the experimental setup. Here, we analyze a not-so-obvious problem: the relation between randomness certification and computational requirements of the post-processing of experimental data. In particular, we consider semi-device independent randomness certification from an experiment using a four dimensional quantum system to violate the classical bound of a random access code. Using state-of-the-art techniques, a smaller quantum violation requires more computational power to demonstrate randomness, which at some point becomes impossible with today’s computers although the randomness is (probably) still there. We show that by dedicating more input settings of the experiment to randomness certification, then by more computational postprocessing of the experimental data which corresponds to a quantum violation, one may increase the amount of certified randomness. Furthermore, we introduce a method that significantly lowers the computational complexity of randomness certification. Our results show how more randomness can be generated without altering the hardware and indicate a path for future semi-device independent protocols to follow. (paper)

40 CFR Table 3 of Subpart Bbbbbbb... - Test Methods

Science.gov (United States)

2010-07-01

... 40 Protection of Environment 14 2010-07-01 2010-07-01 false Test Methods 3 Table 3 of Subpart... 3 Table 3 of Subpart BBBBBBB of Part 63—Test Methods For * * * You must use * * * 1. Selecting the sampling locations a and the number of traverse points EPA test method 1 or 1A in appendix A to part 60. 2...

Beaver Mediated Water Table Dynamics in Mountain Peatlands

Science.gov (United States)

Karran, D. J.; Westbrook, C.; Bedard-Haughn, A.

2016-12-01

Water table dynamics play an important role in the ecological and biogeochemical processes that regulate carbon and water storage in peatlands. Beaver are common in these habitats and the dams they build have been shown to raise water tables in other environments. However, the impact of beaver dams in peatlands, where water tables rest close to the surface, has yet to be determined. We monitored a network of 50 shallow wells in a Canadian Rocky Mountain peatland for 6 years. During this period, a beaver colony was maintaining a number of beaver ponds for four years until a flood event removed the colony from the area and breached some of the dams. Two more years of data were collected after the flood event to assess whether the dams enhanced groundwater storage. Beaver dams raised water tables just as they do in other environments. Furthermore, water tables within 100 meters of beaver dams were more stable than those further away and water table stability overall was greater before the flood event. Our results suggest the presence/absence of beaver in peatlands has implications for groundwater water storage and overall system function.

Mathematics of Periodic Tables for Benzenoid Hydrocarbons.

Science.gov (United States)

Dias, Jerry Ray

2007-01-01

The upper and lower bounds for invariants of polyhex systems based on the Harary and Harborth inequalities are studied. It is shown that these invariants are uniquely correlated by the Periodic Table for Benzenoid Hydrocarbons. A modified periodic table for total resonant sextet (TRS) benzenoids based on the invariants of Ds and r(empty) is presented; Ds is the number of disconnections among the empty rings for fused TRS benzenoid hydrocarbons. This work represents a contribution toward deciphering the topological information content of benzenoid formulas.

A portable high-quality random number generator for lattice field theory simulations

International Nuclear Information System (INIS)

Luescher, M.

1993-09-01

The theory underlying a proposed random number generator for numerical simulations in elementary particle physics and statistical mechanics is discussed. The generator is based on an algorithm introduced by Marsaglia and Zaman, with an important added feature leading to demonstrably good statistical properties. It can be implemented exactly on any computer complying with the IEEE-754 standard for single precision floating point arithmetic. (orig.)

Elekta Precise Table characteristics of IGRT remote table positioning

International Nuclear Information System (INIS)

Riis, Hans L.; Zimmermann, Sune J.

2009-01-01

Cone beam CT is a powerful tool to ensure an optimum patient positioning in radiotherapy. When cone beam CT scan of a patient is acquired, scan data of the patient are compared and evaluated against a reference image set and patient position offset is calculated. Via the linac control system, the patient is moved to correct for position offset and treatment starts. This procedure requires a reliable system for movement of patient. In this work we present a new method to characterize the reproducibility, linearity and accuracy in table positioning. The method applies to all treatment tables used in radiotherapy. Material and methods. The table characteristics are investigated on our two recent Elekta Synergy Platforms equipped with Precise Table installed in a shallow pit concrete cavity. Remote positioning of the table uses the auto set-up (ASU) feature in the linac control system software Desktop Pro R6.1. The ASU is used clinically to correct for patient positioning offset calculated via cone beam CT (XVI)-software. High precision steel rulers and a USB-microscope has been used to detect the relative table position in vertical, lateral and longitudinal direction. The effect of patient is simulated by applying external load on the iBEAM table top. For each table position an image is exposed of the ruler and display values of actual table position in the linac control system is read out. The table is moved in full range in lateral direction (50 cm) and longitudinal direction (100 cm) while in vertical direction a limited range is used (40 cm). Results and discussion. Our results show a linear relation between linac control system read out and measured position. Effects of imperfect calibration are seen. A reproducibility within a standard deviation of 0.22 mm in lateral and longitudinal directions while within 0.43 mm in vertical direction has been observed. The usage of XVI requires knowledge of the characteristics of remote table positioning. It is our opinion

AcuTable

DEFF Research Database (Denmark)

Dibbern, Simon; Rasmussen, Kasper Vestergaard; Ortiz-Arroyo, Daniel

2017-01-01

In this paper we describe AcuTable, a new tangible user interface. AcuTable is a shapeable surface that employs capacitive touch sensors. The goal of AcuTable was to enable the exploration of the capabilities of such haptic interface and its applications. We describe its design and implementation...

A Danish randomized trial comparing breast-preserving therapy with mastectomy in mammary carcinoma

International Nuclear Information System (INIS)

Blichert-Toft, M.; Brincker, H.; Andersen, J.A.; Andersen, K.W.; Axelsson, C.K.; Mouridsen, H.T.; Dombernowsky, P.; Overgaard, M.; Gadeberg, C.; Knudsen, G.; Borgeskov, S.; Bertelsen, S.; Knudsen, J.B.; Hansen, J.B.; Poulsen, P.E.; Willumsen, H.; Schousen, P.; Froberg, D.; Oernsholt, J.; Andersen, M.; Olesen, S.; Skovgaard, S.; Oester, M.; Schumacher, H.; Lynderup, E.K.; Holm, C.N.

1988-01-01

The present study comprises 847 women operated upon for invasive breast carcinoma at 19 surgical departments and enrolled in protocol DBCG-82TM from January 1983 to November 1987. Among them 662 (78%) were allocated for breast-preserving therapy or mastectomy by randomization, while 185 patients (22%) did not accept randomization. Within the randomized group 6% could not be entered into adjuvant protocols, i.e. subsequent programmes of postoperative therapy and follow-up. This left 619 evaluable patients. In the non-randomized series 26% did not fulfil the demands for entrance into the adjuvant protocols, leaving 136 evaluable patients, 60 of whom had chosen a breast-preserving operation and 76 mastectomy. In the randomized series the patients in the two treatment arms were comparable in age, menopausal status, site of tumour, pathoanatomical diameter of the tumour, number of removed axillary lymph nodes, number of metastatic axillary lymph nodes, and distribution on adjuvant regimens. Ninety per cent of the patients in the randomized group accepted the method offered, whereas 10% declined and wanted the alternate form of operation. The median follow-up period was approximately 1.75 years. The cumulative recurrence rate in the randomized group was 13% and in the non-randomized group 7%. These results are preliminary. Life-table analyses have not so far demonstrated differences in recurrence-free survival either in the randomized or the non-randomized series. (orig.)

Tables of nuclear constants for gamma activation analysis

International Nuclear Information System (INIS)

Randa, Z.; Kreisinger, F.

1980-01-01

The tables of photonuclear reactions presented, designed for gamma activation analysis, list accurate data on energy of photons emitted by radionuclides, gamma line intensity, half-lives, photonuclear reactions, or the genetic relationship leading to the formation of the given radionuclide together with the respective reaction thresholds. They also list natural isotopic occurrence of the individual target nuclides. The tables are arranged by increasing atomic numbers of newly formed radionuclides and by increasing gamma energies. (B.S.)

Cosmic radiation algorithm utilizing flight time tables

International Nuclear Information System (INIS)

Katja Kojo, M.Sc.; Mika Helminen, M.Sc.; Anssi Auvinen, M.D.Ph.D.; Katja Kojo, M.Sc.; Anssi Auvinen, M.D.Ph.D.; Gerhard Leuthold, D.Sc.

2006-01-01

Cosmic radiation is considerably higher on cruising altitudes used in aviation than at ground level. Exposure to cosmic radiation may increase cancer risk among pilots and cabin crew. The International Commission on Radiation Protection (ICRP) has recommended that air crew should be classified as radiation workers. Quantification of cosmic radiation doses is necessary for assessment of potential health effects of such occupational exposure. For Finnair cabin crew (cabin attendants and stewards), flight history is not available for years prior to 1991 and therefore, other sources of information on number and type of flights have to be used. The lack of systematically recorded information is a problem for dose estimation for many other flight companies personnel as well. Several cosmic radiation dose estimations for cabin crew have been performed using different methods (e.g. 2-5), but they have suffered from various shortcomings. Retrospective exposure estimation is not possible with personal portable dosimeters. Methods that employ survey data for occupational dose assessment are prone to non-differential measurement error i.e. the cabin attendants do not remember correctly the number of past flights. Assessment procedures that utilize surrogate measurement methods i.e. the duration of employment, lack precision. The aim of the present study was to develop an assessment method for individual occupational exposure to cosmic radiation based on flight time tables. Our method provides an assessment method that does not require survey data or systematic recording of flight history, and it is rather quick, inexpensive, and possible to carry out in all other flight companies whose past time tables for the past periods exist. Dose assessment methods that employ survey data are prone to random error i.e. the cabin attendants do not remember correctly the number or types of routes that they have flown during the past. Our method avoids this since survey data are not needed

Contamination of Dining Tables with Pesticides in Kibirigwi Irrigation Scheme

International Nuclear Information System (INIS)

Kimani, V.W; McDermont, J.J

1999-01-01

Kibirigwi irrigation scheme is a small holder area in Central Kenya, where the main activity is production of horticultural crops. Pesticides are widely misused. This study investigated the extent of house hold pesticide exposure in 40 randomly selected farms in JUly-August, 1995. Exposure measures collected included pesticide levels on dining table swabs. Fifty coytton clothes measuring 30 cm *30cm were prepared in the laboratory by soaking overnight in methanol. In each of the selected homesteads, the table used for meals was swabbed with the piece of cloth. In the laboratory, the residues chemicals extracted from these swabs using conventional residual analysis procedures and the extracts were analysed by gas liquid chromatography. Information on which pesticide (s) were recently handled in the home and when, were also recorded. Cypermethrin (9/40), malathion (9/40), Diazinon (5/40), dimethoate (4/40), chloropyrifos (4/40) and fenitrothion (1/40) were detected in these samples. The range of individual organophosphate pesticides detected was 0.01-8.7ug/cm 2 of table area and for cypermethrin the range was 0.0024 ng-5.8 ng/cm 2 . It was concluded that farmers and their family members are likely to be contaminated with pesticides from tables either dermally or through contamination of food placed on such tables

Table of content translations of Soviet reports received by the INDC Secretariat

International Nuclear Information System (INIS)

1981-12-01

The INDC Secretariat receives a number of Soviet reports in Russian as part of the INDC document distribution system. Because of their large number and size most of them cannot be translated by the IAEA. The ''Nuclear Physics Research in the USSR - Collected Abstracts'' report series and occasional reports of interest to the nuclear data community are translated by the IAEA on a regular basis, and are normally given a ''U'' distribution. The ''Table of Content Translations'' contain the translation of the table of contents (and abstracts when available) of those Soviet reports which the IAEA does not translate in full. The originals of these reports are normally available in limited quantities only and are given an INDC ''G'' distribution. This issue contains the table of content translation of the following reports: Nuclear Constants, Number 1(40) original distributed as INDC(CCP)-167/G; Nuclear Constants, Number 2(41) original distributed as INDC(CCP)-168/G

Tables extracted from Messel and Crawford for electrons incident on 1 radiation length Pb plates

International Nuclear Information System (INIS)

Loos, J.

1977-01-01

Tables were extracted from the extensive tables of Messel and Crawford. The numbers given should be good for 1 r.1. Ta plates and may be helpful when looking at showers in these plates. The tables should be largely self-explanatory. An example is given of how to use these tables given a 1000-MeV incident electron

TOC: Table of Contents Practices of Primary Journals--Recommendations for Monolingual, Multilingual and International Journals.

Science.gov (United States)

Juhasz, Stephen; And Others

Table of contents (TOC) practices of some 120 primary journals were analyzed. The journals were randomly selected. The method of randomization is described. The samples were selected from a university library with a holding of approximately 12,000 titles published worldwide. A questionnaire was designed. Purpose was to find uniformity and…

Random Numbers Demonstrate the Frequency of Type I Errors: Three Spreadsheets for Class Instruction

Science.gov (United States)

Duffy, Sean

2010-01-01

This paper describes three spreadsheet exercises demonstrating the nature and frequency of type I errors using random number generation. The exercises are designed specifically to address issues related to testing multiple relations using correlation (Demonstration I), t tests varying in sample size (Demonstration II) and multiple comparisons…

The Periodic Round Table (by Gary Katz)

Science.gov (United States)

Rodgers, Reviewed By Glen E.

2000-02-01

Unwrapping and lifting the Periodic Round Table out of its colorful box is an exciting experience for a professional chemist or a chemistry student. Touted as a "new way of looking at the elements", it is certainly thatat least at first blush. The "table" consists of four sets of two finely finished hardwood discs each with the following elemental symbols and their corresponding atomic numbers pleasingly and symmetrically wood-burned into their faces. The four sets of two discs are 1 1/2, 3, 4 1/2, and 6 in. in diameter, each disc is 3/4 in. thick, and therefore the entire "round table" stands 6 in. high and is 6 in. in diameter at its base. The eight beautifully polished discs (represented below) are held together by center dowels that allow each to be rotated separately.

Multiple Depth DB Tables Indexing on the Sphere

Directory of Open Access Journals (Sweden)

Luciano Nicastro

2010-01-01

Full Text Available Any project dealing with large astronomical datasets should consider the use of a relational database server (RDBS. Queries requiring quick selections on sky regions, objects cross-matching and other high-level data investigations involving sky coordinates could be unfeasible if tables are missing an effective indexing scheme. In this paper we present the Dynamic Index Facility (DIF software package. By using the HTM and HEALPix sky pixelization schema, it allows a very efficient indexing and management of spherical data stored into MySQL tables. Any table hosting spherical coordinates can be automatically managed by DIF using any number of sky resolutions at the same time. DIF comprises a set of facilities among which SQL callable functions to perform queries on circular and rectangular regions. Moreover, by removing the limitations and difficulties of 2-d data indexing, DIF allows the full exploitation of the RDBS capabilities. Performance tests on Giga-entries tables are reported together with some practical usage of the package.

CERN Table Tennis Club

CERN Multimedia

CERN Table Tennis Club

2014-01-01

CERN Table Tennis Club Announcing CERN 60th Anniversary Table Tennis Tournament to take place at CERN, from July 1 to July 15, 2014   The CERN Table Tennis Club, reborn in 2008, is encouraging people at CERN to take more regular exercise. This is why the Club, thanks to the strong support of the CERN Staff Association, installed last season a first outdoor table on the terrace of restaurant # 1, and will install another one this season on the terrace of Restaurant # 2. Table tennis provides both physical exercise and friendly social interactions. The CERN Table Tennis club is happy to use the unique opportunity of the 60th CERN anniversary to promote table tennis at CERN, as it is a game that everybody can easily play, regardless of level. Table tennis is particularly well suited for CERN, as many great physicists play table tennis, as you might already know: “Heisenberg could not even bear to lose a game of table tennis”; “Otto Frisch played a lot of table tennis;...

Design of a magnetic-tunnel-junction-oriented nonvolatile lookup table circuit with write-operation-minimized data shifting

Science.gov (United States)

Suzuki, Daisuke; Hanyu, Takahiro

2018-04-01

A magnetic-tunnel-junction (MTJ)-oriented nonvolatile lookup table (LUT) circuit, in which a low-power data-shift function is performed by minimizing the number of write operations in MTJ devices is proposed. The permutation of the configuration memory cell for read/write access is performed as opposed to conventional direct data shifting to minimize the number of write operations, which results in significant write energy savings in the data-shift function. Moreover, the hardware cost of the proposed LUT circuit is small since the selector is shared between read access and write access. In fact, the power consumption in the data-shift function and the transistor count are reduced by 82 and 52%, respectively, compared with those in a conventional static random-access memory-based implementation using a 90 nm CMOS technology.

40 CFR Table 5 to Subpart Ddddd of... - Performance Testing Requirements

Science.gov (United States)

2010-07-01

..., and Institutional Boilers and Process Heaters Pt. 63, Subpt. DDDDD, Table 5 Table 5 to Subpart DDDDD.... Hydrogen chloride a. Select sampling ports location and the number of traverse points Method 1 in appendix... part 60 of this chapter. e. Measure the hydrogen chloride emission concentration Method 26 or 26A in...

Generative Learning Objects Instantiated with Random Numbers Based Expressions

Directory of Open Access Journals (Sweden)

Ciprian Bogdan Chirila

2015-12-01

Full Text Available The development of interactive e-learning content requires special skills like programming techniques, web integration, graphic design etc. Generally, online educators do not possess such skills and their e-learning products tend to be static like presentation slides and textbooks. In this paper we propose a new interactive model of generative learning objects as a compromise betweenstatic, dull materials and dynamic, complex software e-learning materials developed by specialized teams. We find that random numbers based automatic initialization learning objects increases content diversity, interactivity thus enabling learners’ engagement. The resulted learning object model is at a limited level of complexity related to special e-learning software, intuitive and capable of increasing learners’ interactivity, engagement and motivation through dynamic content. The approach was applied successfully on several computer programing disciplines.

Global industrial impact coefficient based on random walk process and inter-country input-output table

Science.gov (United States)

Xing, Lizhi; Dong, Xianlei; Guan, Jun

2017-04-01

Input-output table is very comprehensive and detailed in describing the national economic system with lots of economic relationships, which contains supply and demand information among industrial sectors. The complex network, a theory and method for measuring the structure of complex system, can describe the structural characteristics of the internal structure of the research object by measuring the structural indicators of the social and economic system, revealing the complex relationship between the inner hierarchy and the external economic function. This paper builds up GIVCN-WIOT models based on World Input-Output Database in order to depict the topological structure of Global Value Chain (GVC), and assumes the competitive advantage of nations is equal to the overall performance of its domestic sectors' impact on the GVC. Under the perspective of econophysics, Global Industrial Impact Coefficient (GIIC) is proposed to measure the national competitiveness in gaining information superiority and intermediate interests. Analysis of GIVCN-WIOT models yields several insights including the following: (1) sectors with higher Random Walk Centrality contribute more to transmitting value streams within the global economic system; (2) Half-Value Ratio can be used to measure robustness of open-economy macroeconomics in the process of globalization; (3) the positive correlation between GIIC and GDP indicates that one country's global industrial impact could reveal its international competitive advantage.

Examining Psychokinesis: The Interaction of Human Intention with Random Number Generators--A Meta-Analysis

Science.gov (United States)

Bosch, Holger; Steinkamp, Fiona; Boller, Emil

2006-01-01

Seance-room and other large-scale psychokinetic phenomena have fascinated humankind for decades. Experimental research has reduced these phenomena to attempts to influence (a) the fall of dice and, later, (b) the output of random number generators (RNGs). The meta-analysis combined 380 studies that assessed whether RNG output correlated with human…

Intersection of a Sure Ellipsoid and a Random Ellipsoid

Directory of Open Access Journals (Sweden)

Arjun K. Gupta

2012-07-01

Full Text Available Normal 0 false false false EN-US X-NONE X-NONE /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-parent:""; mso-padding-alt:0in 5.4pt 0in 5.4pt; mso-para-margin:0in; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:10.0pt; font-family:"Times New Roman","serif";} An Expression for the expected value of the intersection of a sure sphere and a random sphere has been derived by Laurent (1974. In the present paper we derive the expression for the expected intersection volume of a sure ellipsoid and a random ellipsoid

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.

Random number generation in bilingual Balinese and German students: preliminary findings from an exploratory cross-cultural study.

Science.gov (United States)

Strenge, Hans; Lesmana, Cokorda Bagus Jaya; Suryani, Luh Ketut

2009-08-01

Verbal random number generation is a procedurally simple task to assess executive function and appears ideally suited for the use under diverse settings in cross-cultural research. The objective of this study was to examine ethnic group differences between young adults in Bali (Indonesia) and Kiel (Germany): 50 bilingual healthy students, 30 Balinese and 20 Germans, attempted to generate a random sequence of the digits 1 to 9. In Balinese participants, randomization was done in Balinese (native language L1) and Indonesian (first foreign language L2), in German subjects in the German (L1) and English (L2) languages. 10 of 30 Balinese (33%), but no Germans, were unable to inhibit habitual counting in more than half of the responses. The Balinese produced significantly more nonrandom responses than the Germans with higher rates of counting and significantly less occurrence of the digits 2 and 3 in L1 compared with L2. Repetition and cycling behavior did not differ between the four languages. The findings highlight the importance of taking into account culture-bound psychosocial factors for Balinese individuals when administering and interpreting a random number generation test.

Random Number Generation in HIV Disease: Associations with Neuropsychological Functions and Activities of Daily Living.

Science.gov (United States)

Sheppard, David P; Woods, Steven Paul; Doyle, Katie L; Verduzco, Marizela

2017-02-01

HIV is associated with frontostriatal dysregulation and executive dysfunction. This study evaluated whether HIV-infected individuals evidence deficits in random number generation (RNG), which is a strategic task requiring paced, rule-guided production of digits. In total, 74 HIV+ adults and 54 seronegative comparison participants completed a comprehensive research neuropsychological battery. Participants produced a random digit sequence by avoiding any order and using numbers 1 through 10 for 100 s at a pace of 1 digit/s. Outcomes included intrusions, repetitions, seriation (1-2-3-4), and cycling (median length of gaps between repeating digits). HIV disease was associated with higher levels of seriation and cycling (ps  .10). Among HIV+ individuals, higher seriation was associated with neuropsychological performance including poorer auditory attention, verbal learning, and delayed memory, whereas higher cycling scores were associated with poorer delayed memory and verbal fluency (ps random sequences, which showed medium associations with higher order verbal abilities and may contribute to greater declines in everyday functioning outcomes. Future studies might examine RNG's role in health behaviors such as medical decision-making or medication adherence. © The Author 2016. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

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.

Scalable Packet Classification with Hash Tables

Science.gov (United States)

Wang, Pi-Chung

In the last decade, the technique of packet classification has been widely deployed in various network devices, including routers, firewalls and network intrusion detection systems. In this work, we improve the performance of packet classification by using multiple hash tables. The existing hash-based algorithms have superior scalability with respect to the required space; however, their search performance may not be comparable to other algorithms. To improve the search performance, we propose a tuple reordering algorithm to minimize the number of accessed hash tables with the aid of bitmaps. We also use pre-computation to ensure the accuracy of our search procedure. Performance evaluation based on both real and synthetic filter databases shows that our scheme is effective and scalable and the pre-computation cost is moderate.

Tabled Execution in Scheme

Energy Technology Data Exchange (ETDEWEB)

Willcock, J J; Lumsdaine, A; Quinlan, D J

2008-08-19

Tabled execution is a generalization of memorization developed by the logic programming community. It not only saves results from tabled predicates, but also stores the set of currently active calls to them; tabled execution can thus provide meaningful semantics for programs that seemingly contain infinite recursions with the same arguments. In logic programming, tabled execution is used for many purposes, both for improving the efficiency of programs, and making tasks simpler and more direct to express than with normal logic programs. However, tabled execution is only infrequently applied in mainstream functional languages such as Scheme. We demonstrate an elegant implementation of tabled execution in Scheme, using a mix of continuation-passing style and mutable data. We also show the use of tabled execution in Scheme for a problem in formal language and automata theory, demonstrating that tabled execution can be a valuable tool for Scheme users.

Effects of Number of Repetitions and Number of Hours of Shaping Practice during Constraint-Induced Movement Therapy: A Randomized Controlled Trial

Directory of Open Access Journals (Sweden)

Auwal Abdullahi

2018-01-01

Full Text Available Background. Constraint-induced movement therapy (CIMT is effective in improving motor outcomes after stroke. However, its existing protocols are resource-intensive and difficult to implement. The aim of this study is to design an easier CIMT protocol using number of repetitions of shaping practice. Method. The study design was randomized controlled trial. Participants within 4 weeks after stroke were recruited at Murtala Muhammad Specialist Hospital. They were randomly assigned to groups A, B, C, and D. Group A received 3 hours of traditional therapy. Groups B, C, and D received modified CIMT consisting of 3 hours of shaping practice per session, 300 repetitions of shaping practice in 3 sessions, and 600 repetitions of shaping practice in 3 sessions per day, respectively, and constraint for 90% of the waking hours. All treatment protocols were administered 5 times per week for 4 weeks. The primary outcome was measured using upper limb Fugl-Meyer assessment, while the secondary outcome was measured using motor activity log, Wolf Motor Function Test, and upper limb self-efficacy test at baseline, 2 weeks, and 4 weeks after intervention. Result. There were 48 participants 4 weeks after intervention. The result showed that there was no significant difference between groups at baseline (p>0.05. Within-group improvements attained minimal clinically important difference (MCID in modified CIMT and 300 repetitions and 600 repetitions groups. Conclusion. Number of repetitions of shaping practice significantly improved motor function, real-world arm use, and upper limb self-efficacy after stroke. Therefore, it seems to be a simple alternative for the use of number of hours. Trial Registration. This trial is registered with Pan African Clinical Trial Registry (registration number: PACTR201610001828172 (date of registration: 21/10/2016.

Online tables of contents for books: effect on usage*

Science.gov (United States)

Morris, Ruth C.

2001-01-01

Objectives: To explore whether the presence of online tables of contents (TOC) in an online catalog affects circulation (checkouts and inhouse usage). Two major questions were posed: (1) did the presence of online tables of contents for books increase use, and, (2) if it did, what factors might cause the increase? Method: A randomized and stratified design was used in tracking usage of 3,957 book titles that were previously divided into two groups: one with TOC and one without TOC. Stratification was done for year of imprint, location, subject, previous use, circulating or non-circulating status, and presence of TOC. The use was tracked by the online catalog statistics in the InnoPac online catalog for fourteen months. Results: The study found that tables of contents do increase usage. It also showed a correlation in the size of the effect based on the currency of the titles. In general, even after adjusting for all of the variables (publication date, location, circulation status, subject, and previous use), the odds of a title being used increased by 45% if the titles had online tables of contents, a statistically significant impact at the 0.05 level. Conclusions: This case-control study presents new information about the impact on circulation and inhouse use when tables of contents for books are added to the online catalog record. The study helps to establish the positive role of tables of contents in online catalogs. The research establishes TOC as a major parameter that can be successfully studied using quantitative methods. The study also provides information professionals with some guidance on when enhancement of TOC is likely to be most effective in increasing the use of existing collections. PMID:11209798

Tables of nuclear constants for gamma activation analysis

International Nuclear Information System (INIS)

Randa, Z.; Kreisinger, F.

1983-01-01

Tables of nuclear data were compiled for the purpose of routine gamma (photon) activation analysis. The tables are arranged in two parts. The first one lists the radionuclides in the order of their atomic number. In the second one, the emitted gamma-ray photons are tabulated in the order of increasing energy. Tables contain the gamma emitters produced by the following photonuclear reactions: (#betta#,#betta#), (#betta#,n), (#betta#,p), (#betta#,p+n), (#betta#,2n), (#betta#,3n), (#betta#,4n), (#betta#,2p), (#betta#,α), (#betta#,α+n), (#betta#,α+p). This set corresponds to the maximum energy of the bremsstrahlung of roughly 45 MeV. The program for the output of the tabulated data allows the data as required for specific irradiation and measuring reduction of conditions (reaction thresholds, energy and intensity of gamma-rays, half-lives and target elements). (author)

Symbol Tables and Branch Tables: Linking Applications Together

Science.gov (United States)

Handler, Louis M.

2011-01-01

This document explores the computer techniques used to execute software whose parts are compiled and linked separately. The computer techniques include using a branch table or indirect address table to connect the parts. Methods of storing the information in data structures are discussed as well as differences between C and C++.

Table of sample sizes needed to detect at least one defective with 100(1-α)% probability (α = 0.01, 0.05)

International Nuclear Information System (INIS)

Stewart, K.B.

1972-01-01

Tables are presented which give the random sample size needed in order to be 95 percent(99 percent) certain of detecting at least one defective item when there are k defective items in a population of n items. The application of the tables to certain safeguards problems is discussed. The range of the tables is as follows: r = 0(1)25, n = r(1)r + 999. (U.S.)

Thermodynamic properties of mineral compounds (tables); Proprietes thermodynamiques des composes mineraux (tables)

Energy Technology Data Exchange (ETDEWEB)

Perrot, P. [Lille-1 Univ., Lab. de Metallurgie Physique, UMR CNRS 8517, 59 - Villeneuve-d' Ascq (France)

2005-10-01

This article presents, in the form of tables, the thermodynamic data necessary for the calculation of equilibrium constants of reactions between mineral compounds (Rb, Re, Ru, S, Sb, Sc, Se, Si, Sm, Sn, Sr, Ta, Tb, Tc, Te, Th, Ti, Tl, Tm, U, V, W, Xe, Y, Yb, Zn, and Zr compounds). Table 1 presents the data recommended by Codata; table 2 gives the minimum informations allowing the calculation of an equilibrium constant in first approximation; table 3 allows to take into consideration the thermal capacities. Finally, table 4 gathers the data relative to species in aqueous solution. (J.S.)

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

Law of large numbers and central limit theorem for randomly forced PDE's

CERN Document Server

Shirikyan, A

2004-01-01

We consider a class of dissipative PDE's perturbed by an external random force. Under the condition that the distribution of perturbation is sufficiently non-degenerate, a strong law of large numbers (SLLN) and a central limit theorem (CLT) for solutions are established and the corresponding rates of convergence are estimated. It is also shown that the estimates obtained are close to being optimal. The proofs are based on the property of exponential mixing for the problem in question and some abstract SLLN and CLT for mixing-type Markov processes.

Patterns of medicinal plant use: an examination of the Ecuadorian Shuar medicinal flora using contingency table and binomial analyses.

Science.gov (United States)

Bennett, Bradley C; Husby, Chad E

2008-03-28

Botanical pharmacopoeias are non-random subsets of floras, with some taxonomic groups over- or under-represented. Moerman [Moerman, D.E., 1979. Symbols and selectivity: a statistical analysis of Native American medical ethnobotany, Journal of Ethnopharmacology 1, 111-119] introduced linear regression/residual analysis to examine these patterns. However, regression, the commonly-employed analysis, suffers from several statistical flaws. We use contingency table and binomial analyses to examine patterns of Shuar medicinal plant use (from Amazonian Ecuador). We first analyzed the Shuar data using Moerman's approach, modified to better meet requirements of linear regression analysis. Second, we assessed the exact randomization contingency table test for goodness of fit. Third, we developed a binomial model to test for non-random selection of plants in individual families. Modified regression models (which accommodated assumptions of linear regression) reduced R(2) to from 0.59 to 0.38, but did not eliminate all problems associated with regression analyses. Contingency table analyses revealed that the entire flora departs from the null model of equal proportions of medicinal plants in all families. In the binomial analysis, only 10 angiosperm families (of 115) differed significantly from the null model. These 10 families are largely responsible for patterns seen at higher taxonomic levels. Contingency table and binomial analyses offer an easy and statistically valid alternative to the regression approach.

Reduction of the number of parameters needed for a polynomial random regression test-day model

NARCIS (Netherlands)

Pool, M.H.; Meuwissen, T.H.E.

2000-01-01

Legendre polynomials were used to describe the (co)variance matrix within a random regression test day model. The goodness of fit depended on the polynomial order of fit, i.e., number of parameters to be estimated per animal but is limited by computing capacity. Two aspects: incomplete lactation

Elements in the history of the Periodic Table.

Science.gov (United States)

Rouvray, Dennis H

2004-06-01

Discovery of the Periodic Table was rendered possible only after four decisive prerequisites had been achieved. These were (i) the abandonment of the metaphysical and occult notions of elements that typified the alchemical era; (ii) the adoption of a modern and workable definition of an element; (iii) the development of analytical chemical techniques for the isolation of the elements and determination of their properties; and (iv) the devising of a means of associating each element with a characteristic natural number. The Periodic Table made its appearance on cue almost as soon as these preconditions had been fulfilled.

Fertility in Gyr Cows (Bos indicus with Fixed Time Artificial Insemination and Visual Estrus Detection Using a Classification Table

Directory of Open Access Journals (Sweden)

Lilido Nelson Ramírez-Iglesia

2014-01-01

Full Text Available The aim of this research was to compare two artificial insemination protocols (AIP: hormonal synchronization with fixed time artificial insemination (SC-FTAI and the use of a table based on visual observation of estrus signs (VO in order to identify cows in natural or spontaneous estrus being assigned to AI (NSE-IA. Two groups were formed: in the first group 109 cows were assigned to SC-FTAI, in which a commercial protocol is used; the second one included 108 randomly chosen cows, which were assigned to NSE-AI and in this group a modified table was used. Response variable was first service fertility rate (FSF, which was coded 1 for pregnant and 0 for empty. Predictor variables were AIP, postpartum anestrus, daily milk yield, body condition score at AI and calving number. Statistical analyses included association chi-square tests and logistic regression. Results showed an overall 41.94% FSF and a significant association was detected (P0.05. The odds ratio for the effect of AIP was only 1.050, suggesting no differences in FSF between groups. The NSE-AI protocol can enhance both the technique of VO and reproductive efficiency. Further validation of the table is required.

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.

The distribution of the number of node neighbors in random hypergraphs

International Nuclear Information System (INIS)

López, Eduardo

2013-01-01

Hypergraphs, the generalization of graphs in which edges become conglomerates of r nodes called hyperedges of rank r ⩾ 2, are excellent models to study systems with interactions that are beyond the pairwise level. For hypergraphs, the node degree ℓ (number of hyperedges connected to a node) and the number of neighbors k of a node differ from each other in contrast to the case of graphs, where counting the number of edges is equivalent to counting the number of neighbors. In this paper, I calculate the distribution of the number of node neighbors in random hypergraphs in which hyperedges of uniform rank r have a homogeneous (equal for all hyperedges) probability p to appear. This distribution is equivalent to the degree distribution of ensembles of graphs created as projections of hypergraph or bipartite network ensembles, where the projection connects any two nodes in the projected graph when they are also connected in the hypergraph or bipartite network. The calculation is non-trivial due to the possibility that neighbor nodes belong simultaneously to multiple hyperedges (node overlaps). From the exact results, the traditional asymptotic approximation to the distribution in the sparse regime (small p) where overlaps are ignored is rederived and improved; the approximation exhibits Poisson-like behavior accompanied by strong fluctuations modulated by power-law decays in the system size N with decay exponents equal to the minimum number of overlapping nodes possible for a given number of neighbors. It is shown that the dense limit cannot be explained if overlaps are ignored, and the correct asymptotic distribution is provided. The neighbor distribution requires the calculation of a new combinatorial coefficient Q r−1 (k, ℓ), which counts the number of distinct labeled hypergraphs of k nodes, ℓ hyperedges of rank r − 1, and where every node is connected to at least one hyperedge. Some identities of Q r−1 (k, ℓ) are derived and applied to the

Calculation of large Reynolds number two-dimensional flow using discrete vortices with random walk

International Nuclear Information System (INIS)

Milinazzo, F.; Saffman, P.G.

1977-01-01

The numerical calculation of two-dimensional rotational flow at large Reynolds number is considered. The method of replacing a continuous distribution of vorticity by a finite number, N, of discrete vortices is examined, where the vortices move under their mutually induced velocities plus a random component to simulate effects of viscosity. The accuracy of the method is studied by comparison with the exact solution for the decay of a circular vortex. It is found, and analytical arguments are produced in support, that the quantitative error is significant unless N is large compared with a characteristic Reynolds number. The mutually induced velocities are calculated by both direct summation and by the ''cloud in cell'' technique. The latter method is found to produce comparable error and to be much faster

A scalable lock-free hash table with open addressing

DEFF Research Database (Denmark)

Nielsen, Jesper Puge; Karlsson, Sven

2016-01-01

and concurrent operations without any locks. In this paper, we present a new fully lock-free open addressed hash table with a simpler design than prior published work. We split hash table insertions into two atomic phases: first inserting a value ignoring other concurrent operations, then in the second phase......Concurrent data structures synchronized with locks do not scale well with the number of threads. As more scalable alternatives, concurrent data structures and algorithms based on widely available, however advanced, atomic operations have been proposed. These data structures allow for correct...

Model selection for contingency tables with algebraic statistics

NARCIS (Netherlands)

Krampe, A.; Kuhnt, S.; Gibilisco, P.; Riccimagno, E.; Rogantin, M.P.; Wynn, H.P.

2009-01-01

Goodness-of-fit tests based on chi-square approximations are commonly used in the analysis of contingency tables. Results from algebraic statistics combined with MCMC methods provide alternatives to the chi-square approximation. However, within a model selection procedure usually a large number of

A homodyne detector integrated onto a photonic chip for measuring quantum states and generating random numbers

Science.gov (United States)

Raffaelli, Francesco; Ferranti, Giacomo; Mahler, Dylan H.; Sibson, Philip; Kennard, Jake E.; Santamato, Alberto; Sinclair, Gary; Bonneau, Damien; Thompson, Mark G.; Matthews, Jonathan C. F.

2018-04-01

Optical homodyne detection has found use as a characterisation tool in a range of quantum technologies. So far implementations have been limited to bulk optics. Here we present the optical integration of a homodyne detector onto a silicon photonics chip. The resulting device operates at high speed, up 150 MHz, it is compact and it operates with low noise, quantified with 11 dB clearance between shot noise and electronic noise. We perform on-chip quantum tomography of coherent states with the detector and show that it meets the requirements for characterising more general quantum states of light. We also show that the detector is able to produce quantum random numbers at a rate of 1.2 Gbps, by measuring the vacuum state of the electromagnetic field and applying off-line post processing. The produced random numbers pass all the statistical tests provided by the NIST test suite.

Decision table languages and systems

CERN Document Server

Metzner, John R

1977-01-01

ACM Monograph Series: Decision Table Languages and Systems focuses on linguistic examination of decision tables and survey of the features of existing decision table languages and systems. The book first offers information on semiotics, programming language features, and generalization. Discussions focus on semantic broadening, outer language enrichments, generalization of syntax, limitations, implementation improvements, syntactic and semantic features, decision table syntax, semantics of decision table languages, and decision table programming languages. The text then elaborates on design im

On the strong law of large numbers for $\\varphi$-subgaussian random variables

OpenAIRE

Zajkowski, Krzysztof

2016-01-01

For $p\\ge 1$ let $\\varphi_p(x)=x^2/2$ if $|x|\\le 1$ and $\\varphi_p(x)=1/p|x|^p-1/p+1/2$ if $|x|>1$. For a random variable $\\xi$ let $\\tau_{\\varphi_p}(\\xi)$ denote $\\inf\\{a\\ge 0:\\;\\forall_{\\lambda\\in\\mathbb{R}}\\; \\ln\\mathbb{E}\\exp(\\lambda\\xi)\\le\\varphi_p(a\\lambda)\\}$; $\\tau_{\\varphi_p}$ is a norm in a space $Sub_{\\varphi_p}=\\{\\xi:\\;\\tau_{\\varphi_p}(\\xi)1$) there exist positive constants $c$ and $\\alpha$ such that for every natural number $n$ the following inequality $\\tau_{\\varphi_p}(\\sum_{i=1...

Analysis of random point images with the use of symbolic computation codes and generalized Catalan numbers

Science.gov (United States)

Reznik, A. L.; Tuzikov, A. V.; Solov'ev, A. A.; Torgov, A. V.

2016-11-01

Original codes and combinatorial-geometrical computational schemes are presented, which are developed and applied for finding exact analytical formulas that describe the probability of errorless readout of random point images recorded by a scanning aperture with a limited number of threshold levels. Combinatorial problems encountered in the course of the study and associated with the new generalization of Catalan numbers are formulated and solved. An attempt is made to find the explicit analytical form of these numbers, which is, on the one hand, a necessary stage of solving the basic research problem and, on the other hand, an independent self-consistent problem.

Calculation of positron characteristics for elements of the periodic table

International Nuclear Information System (INIS)

Campillo Robles, J M; Ogando, E; Plazaola, F

2011-01-01

Positron characteristics have been calculated in bulk and monovacancies for most of the elements of the periodic table. Self-consistent and non-self-consistent schemes have been used for the calculation of the electronic structure in the solid, and different parametrizations for the positron enhancement factor and correlation energy. As it is known, positron lifetimes in bulk show a periodic behaviour with atomic number. These calculations also confirm that monovacancy lifetimes follow the same behaviour. The results obtained have been compared with selected experimental lifetime data, which confirms the calculated theoretical trends. Positron binding energies to a monovacancy have been calculated also for most of the elements of the periodic table. The binding energy shows a periodic behaviour with atomic number too.

MCNPX Model/Table Comparison

International Nuclear Information System (INIS)

Hendricks, J.S.

2003-01-01

MCNPX is a Monte Carlo N-Particle radiation transport code extending the capabilities of MCNP4C. As with MCNP, MCNPX uses nuclear data tables to transport neutrons, photons, and electrons. Unlike MCNP, MCNPX also uses (1) nuclear data tables to transport protons; (2) physics models to transport 30 additional particle types (deuterons, tritons, alphas, pions, muons, etc.); and (3) physics models to transport neutrons and protons when no tabular data are available or when the data are above the energy range (20 to 150 MeV) where the data tables end. MCNPX can mix and match data tables and physics models throughout a problem. For example, MCNPX can model neutron transport in a bismuth germinate (BGO) particle detector by using data tables for bismuth and oxygen and using physics models for germanium. Also, MCNPX can model neutron transport in UO 2 , making the best use of physics models and data tables: below 20 MeV, data tables are used; above 150 MeV, physics models are used; between 20 and 150 MeV, data tables are used for oxygen and models are used for uranium. The mix-and-match capability became available with MCNPX2.5.b (November 2002). For the first time, we present here comparisons that calculate radiation transport in materials with various combinations of data charts and model physics. The physics models are poor at low energies (<150 MeV); thus, data tables should be used when available. Our comparisons demonstrate the importance of the mix-and-match capability and indicate how well physics models work in the absence of data tables

MCNPX Model/Table Comparison

CERN Document Server

Hendricks, J S

2003-01-01

MCNPX is a Monte Carlo N-Particle radiation transport code extending the capabilities of MCNP4C. As with MCNP, MCNPX uses nuclear data tables to transport neutrons, photons, and electrons. Unlike MCNP, MCNPX also uses (1) nuclear data tables to transport protons; (2) physics models to transport 30 additional particle types (deuterons, tritons, alphas, pions, muons, etc.); and (3) physics models to transport neutrons and protons when no tabular data are available or when the data are above the energy range (20 to 150 MeV) where the data tables end. MCNPX can mix and match data tables and physics models throughout a problem. For example, MCNPX can model neutron transport in a bismuth germinate (BGO) particle detector by using data tables for bismuth and oxygen and using physics models for germanium. Also, MCNPX can model neutron transport in UO sub 2 , making the best use of physics models and data tables: below 20 MeV, data tables are used; above 150 MeV, physics models are used; between 20 and 150 MeV, data t...

Effect of water table dynamics on land surface hydrologic memory

Science.gov (United States)

Lo, Min-Hui; Famiglietti, James S.

2010-11-01

The representation of groundwater dynamics in land surface models has received considerable attention in recent years. Most studies have found that soil moisture increases after adding a groundwater component because of the additional supply of water to the root zone. However, the effect of groundwater on land surface hydrologic memory (persistence) has not been explored thoroughly. In this study we investigate the effect of water table dynamics on National Center for Atmospheric Research Community Land Model hydrologic simulations in terms of land surface hydrologic memory. Unlike soil water or evapotranspiration, results show that land surface hydrologic memory does not always increase after adding a groundwater component. In regions where the water table level is intermediate, land surface hydrologic memory can even decrease, which occurs when soil moisture and capillary rise from groundwater are not in phase with each other. Further, we explore the hypothesis that in addition to atmospheric forcing, groundwater variations may also play an important role in affecting land surface hydrologic memory. Analyses show that feedbacks of groundwater on land surface hydrologic memory can be positive, negative, or neutral, depending on water table dynamics. In regions where the water table is shallow, the damping process of soil moisture variations by groundwater is not significant, and soil moisture variations are mostly controlled by random noise from atmospheric forcing. In contrast, in regions where the water table is very deep, capillary fluxes from groundwater are small, having limited potential to affect soil moisture variations. Therefore, a positive feedback of groundwater to land surface hydrologic memory is observed in a transition zone between deep and shallow water tables, where capillary fluxes act as a buffer by reducing high-frequency soil moisture variations resulting in longer land surface hydrologic memory.

Musings on multiplication tables and associated mathematics and teaching practices

Directory of Open Access Journals (Sweden)

Faaiz Gierdien

2009-09-01

Full Text Available This paper is based on my reflections on a deceptively simple tabular representation of a combined 12×12 multiplication table showing multiplier and multiplicand,starting at a time when I taught mathematics full time at a primary (elementary school through to my presentteaching of mathematics education modules to prospective teachers. A historically–motivated framework on the importance of tables as expressions of complex information in two–dimensional form is used to gain insight into and understand multiplication tables. Through this framework it is shown that the modal practice of “knowing one’s tables” in the primary grade levels is really about knowing sequenced and separated lists of whole number multiplications. In contrast, tabular multiplication sequences in a combined multiplication table can, through appropriate teaching practices, enable the discovery of multiple relationships beyond multiplication or arithmetic, resulting in significant mathematics that spans the grade levels. Implications for mathematics teacher education practice with its current focus mathematical knowledge for teaching, are considered.

[Construction of abridged life table for health evaluation of local resident using Excel program].

Science.gov (United States)

Chen, Qingsha; Wang, Feng; Li, Xiaozhen; Yang, Jian; Yu, Shouyi; Hu, Jun

2012-05-01

To provide an easy computational tool for evaluating the health condition of local residents. An abridged life table was programmed by applying mathematical functions and formula in Excel program and tested with the real study data to evaluate the results computed. The Excel was capable of computing group death probability of age in the life table ((n)q(x)), number of survivors (l(x)), number of death ((n)d(x)), survival per person-year ((n)L(x)), survival total per person-year (T(x)) and life expectancy (e(x)). The calculated results were consistent with those by SAS. The abridged life table constructed using Microsoft Excel can conveniently and accurately calculate the relevant indices for evaluating the health condition of the residents.

Prevention of deep venous thrombosis in patients with acute spinal cord injuries: use of rotating treatment tables

International Nuclear Information System (INIS)

Becker, D.M.; Gonzalez, M.; Gentili, A.; Eismont, F.; Green, B.A.

1987-01-01

A randomized clinical trial of 15 patients with acute spinal cord injuries was performed to test the hypothesis that rotating treatment tables prevent deep venous thrombosis in this population. Four of 5 control (nonrotated) patients developed distal and proximal thrombi, assessed by 125 I fibrinogen leg scans and impedance plethysmography. In comparison, only 1 of 10 treated (rotated) patients developed both distal and proximal thrombosis. These results suggest but do not prove that rotating treatment tables prevent the development of proximal deep venous thrombosis in spinal cord-injured patients. Larger clinical trials are needed to confirm this heretofore undocumented benefit of rotating treatment tables

The Periodic Table. Physical Science in Action[TM]. Schlessinger Science Library. [Videotape].

Science.gov (United States)

2000

Kids know that when they are lost, they look at a map to find their way. It's no different in the world of science, as they'll learn in The Periodic Table--a fun and engaging look at the road map of the elements. Young students will learn about key information included on the table, including atomic number, atomic mass and chemical symbol. They'll…

Steam table routines for the simulation of nuclear power plants

International Nuclear Information System (INIS)

Hall, C.A.; Mutafelija, B.A.; Rapp, J.P.

1976-01-01

The dynamic simulation of nuclear power generating stations requires evaluation of a large number of steam and water properties at every integration time step. Some of the interpolation/approximation methods presently used are described with particular emphasis on the use of the bilinear transfinite interpolation method. The fundamental requirements for the steam table routines are outlined and different approaches are compared. The superiority of the bilinear transfinite interpolation method is discussed. The use of the steam table functions in real-time simulation is of particular interest

The recent development in understanding the periodic table of elements

International Nuclear Information System (INIS)

Niizeki, K.

1986-01-01

The recent development in understanding the periodic table of elements is reviewed. The author's concern is focussed on the effects which make different elements of a group of the periodic table to have different chemical properties, which result in that different members of a homologous series of compounds have different physical properties. The most important effect is due to the effective repulsion of the valence orbital of an atom from the core region by orthogonality with the core orbitals with the same azimuthal quantum number

Lifetime health effects and medical costs of integrated stroke services - a non-randomized controlled cluster-trial based life table approach

Directory of Open Access Journals (Sweden)

Dirks Maaike

2010-11-01

Full Text Available Abstract Background Economic evaluation of stroke services indicates that such services may lead to improved quality of life at affordable cost. The present study assesses lifetime health impact and cost consequences of stroke in an integrated service setting. Methods The EDISSE study is a prospective non-randomized controlled cluster trial that compared stroke services (n = 151 patients to usual care (n = 187 patients. Health status and cost trial-data were entered in multi-dimensional stroke life-tables. The tables distinguish four levels of disability which are defined by the modified Rankin scale. Quality-of-life scores (EuroQoL-5D, transition and survival probabilities are based on concurrent Dutch follow-up studies. Outcomes are quality-adjusted life years lived and lifetime medical cost by disability category. An economic analysis compares outcomes from a successful stroke service to usual care, by bootstrapping individual costs and effects data from patients in each arm. Results Lifetime costs and QALYs after stroke depend on age-of-onset of first-ever stroke. Lifetime QALYs after stroke are 2.42 (90% CI - 0.49 - 2.75 for male patients in usual care and 2.75 (-0.61; 6.26 for females. Lifetime costs for men in the usual care setting are €39,335 (15,951; 79,837 and €42,944 (14,081; 95,944 for women. A comparison with the stroke service results in an ICER of €11,685 saved per QALY gained (€14,211 and €7,745 for men and women respectively. This stroke service is with 90% certainty cost-effective. Conclusions Our analysis shows the potential of large health benefits and cost savings of stroke services, taking a lifetime perspective, also in other European settings.

Predicting Coastal Flood Severity using Random Forest Algorithm

Science.gov (United States)

Sadler, J. M.; Goodall, J. L.; Morsy, M. M.; Spencer, K.

2017-12-01

Coastal floods have become more common recently and are predicted to further increase in frequency and severity due to sea level rise. Predicting floods in coastal cities can be difficult due to the number of environmental and geographic factors which can influence flooding events. Built stormwater infrastructure and irregular urban landscapes add further complexity. This paper demonstrates the use of machine learning algorithms in predicting street flood occurrence in an urban coastal setting. The model is trained and evaluated using data from Norfolk, Virginia USA from September 2010 - October 2016. Rainfall, tide levels, water table levels, and wind conditions are used as input variables. Street flooding reports made by city workers after named and unnamed storm events, ranging from 1-159 reports per event, are the model output. Results show that Random Forest provides predictive power in estimating the number of flood occurrences given a set of environmental conditions with an out-of-bag root mean squared error of 4.3 flood reports and a mean absolute error of 0.82 flood reports. The Random Forest algorithm performed much better than Poisson regression. From the Random Forest model, total daily rainfall was by far the most important factor in flood occurrence prediction, followed by daily low tide and daily higher high tide. The model demonstrated here could be used to predict flood severity based on forecast rainfall and tide conditions and could be further enhanced using more complete street flooding data for model training.

Restorations in abrasion/erosion cervical lesions: 8-year results of a triple blind randomized controlled trial.

Science.gov (United States)

Dall'Orologio, Giovanni Dondi; Lorenzi, Roberta

2014-10-01

An equivalence randomized controlled trial within the subject was organized to evaluate the clinical long-term success of a new 2-step etch & rinse adhesive and a new nano-filled ormocer. 50 subjects, 21 males and 29 females aged between 21 and 65, were randomized to receive 150 restorations, 100 with the new restorative material, 50 with the composite as control, placed in non-carious cervical lesions with the same bonding system. The main outcome measure was the cause of failure at 8 years. Randomization was number table-generated, with allocation concealment by opaque sequentially numbered sealed and stapled envelopes. Subjects, examiner, and analyst were blinded to group assignment. Two interim analyses were performed. Data were analyzed by ANOVA and Cox test (P failures in the experimental group and four failures in the control group. The cumulative loss rate was 7% for both restorative materials, with the annual failure lower than 1%, without any statistically significant difference. There were two key elements of failure: the presence of sclerotic dentin and the relationship between lesion and gingival margin.

Elementary Statistics Tables

CERN Document Server

Neave, Henry R

2012-01-01

This book, designed for students taking a basic introductory course in statistical analysis, is far more than just a book of tables. Each table is accompanied by a careful but concise explanation and useful worked examples. Requiring little mathematical background, Elementary Statistics Tables is thus not just a reference book but a positive and user-friendly teaching and learning aid. The new edition contains a new and comprehensive "teach-yourself" section on a simple but powerful approach, now well-known in parts of industry but less so in academia, to analysing and interpreting process dat

Empirical yield tables for Minnesota.

Science.gov (United States)

Jerold T. Hahn; Gerhard K. Raile

1982-01-01

Describes the tables derived from the 1977 Forest Survey of Minnesota and presents examples of how the tables can be used. These tables are broken down according to Minnesota's four Forest Survey Units, 14 forest types, and 5 site index classes. Presents 210 of the 350 possible tables that contained sufficient data to justify publication.

MIT wavelength tables. Volume 2. Wavelengths by element

International Nuclear Information System (INIS)

Phelps, F.M. III.

1982-01-01

This volume is the first stage of a project to expand and update the MIT wavelength tables first compiled in the 1930's. For 109,325 atomic emission lines, arranged by element, it presents wavelength in air, wavelength in vacuum, wave number and intensity. All data are stored on computer-readable magnetic tape

Technetium: The First Radioelement on the Periodic Table

Science.gov (United States)

Johnstone, Erik V.; Yates, Mary Anne; Poineau, Frederic; Sattelberger, Alfred P.; Czerwinski, Kenneth R.

2017-01-01

The radioactive nature of technetium is discussed using a combination of introductory nuclear physics concepts and empirical trends observed in the chart of the nuclides and the periodic table of the elements. Trends such as the enhanced stability of nucleon pairs, magic numbers, and Mattauch's rule are described. The concepts of nuclear binding…

Mathematical tables tables of in g [z] for complex argument

CERN Document Server

Abramov, A A

1960-01-01

Mathematical Tables of In ? (z) for Complex Argument is a compilation of tables of In ? (z), z = x + iy, calculated for steps in x and y of 0.01 and with an accuracy of one unit in the last (the sixth) decimal place. Interpolation is used to calculate In ? (z) for intermediate values and is carried out separately for the real and imaginary parts of In ? (z). Six places are retained in interpolation.This book first explains how the values of In ? (z) are calculated using the asymptotic formula in a wide lattice with step h = 0.16, and how the tables and the nomograph are used. The values in the

Random number generation as an index of controlled processing.

Science.gov (United States)

Jahanshahi, Marjan; Saleem, T; Ho, Aileen K; Dirnberger, Georg; Fuller, R

2006-07-01

Random number generation (RNG) is a functionally complex process that is highly controlled and therefore dependent on Baddeley's central executive. This study addresses this issue by investigating whether key predictions from this framework are compatible with empirical data. In Experiment 1, the effect of increasing task demands by increasing the rate of the paced generation was comprehensively examined. As expected, faster rates affected performance negatively because central resources were increasingly depleted. Next, the effects of participants' exposure were manipulated in Experiment 2 by providing increasing amounts of practice on the task. There was no improvement over 10 practice trials, suggesting that the high level of strategic control required by the task was constant and not amenable to any automatization gain with repeated exposure. Together, the results demonstrate that RNG performance is a highly controlled and demanding process sensitive to additional demands on central resources (Experiment 1) and is unaffected by repeated performance or practice (Experiment 2). These features render the easily administered RNG task an ideal and robust index of executive function that is highly suitable for repeated clinical use. ((c) 2006 APA, all rights reserved).

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.

Strategies for Proximal Femoral Nailing of Unstable Intertrochanteric Fractures: Lateral Decubitus Position or Traction Table.

Science.gov (United States)

Sonmez, Mesut Mehmet; Camur, Savas; Erturer, Erden; Ugurlar, Meric; Kara, Adnan; Ozturk, Irfan

2017-03-01

The aim of this prospective randomized study was to compare the traction table and lateral decubitus position techniques in the management of unstable intertrochanteric fractures. Eighty-two patients with unstable intertrochanteric fractures between 2011 and 2013 were included in this study. All patients were treated surgically with the Proximal Femoral Nail Antirotation implant (DePuy Synthes). Patients were randomized to undergo the procedure in the lateral decubitus position (42 patients) or with the use of a traction table (40 patients). Patients whose procedure was not performed entirely with a semi-invasive method or who required the use of additional fixation materials, such as cables, were excluded from the study. The groups were compared on the basis of the setup time, surgical time, fluoroscopic exposure time, tip-to-apex distance, collodiaphyseal angle, and modified Baumgaertner criteria for radiologic reduction. The setup time, surgical time, and fluoroscopic exposure time were lower and the differences were statistically significant in the lateral decubitus group compared with the traction table group. The collodiaphyseal angles were significantly different between the groups in favor of the lateral decubitus method. The tip-to-apex distance and the classification of reduction according to the modified Baumgaertner criteria did not demonstrate a statistically significant difference between the groups. The lateral decubitus position is used for most open procedures of the hip. We found that this position facilitates exposure for the surgical treatment of unstable intertrochanteric fractures and has advantages over the traction table in terms of set up time, surgical time and fluoroscopic exposure time.

Confidence limits for small numbers of events in astrophysical data

Science.gov (United States)

Gehrels, N.

1986-01-01

The calculation of limits for small numbers of astronomical counts is based on standard equations derived from Poisson and binomial statistics; although the equations are straightforward, their direct use is cumbersome and involves both table-interpolations and several mathematical operations. Convenient tables and approximate formulae are here presented for confidence limits which are based on such Poisson and binomial statistics. The limits in the tables are given for all confidence levels commonly used in astrophysics.

Using random matrix theory to determine the number of endmembers in a hyperspectral image

CSIR Research Space (South Africa)

Cawse, K

2010-06-01

Full Text Available apply our method to synthetic images, including a standard test image developed by Chein-I Chang, with good results for Gaussian independent noise. Index Terms— Hyperspectral Unmixing, Random Ma- trix Theory, Linear Mixture Model, Virtual Dimension... function, and K is the number of endmembers. We assume Gaussian noise following the methods of [1] [5]. The first step in unmixing the image is to determine how many endmembers or constituents are contained in the scene. This is known as the Virtual...

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)

Upper Limit in the Periodic Table of Elements

Directory of Open Access Journals (Sweden)

Khazan A.

2007-01-01

Full Text Available The method of rectangular hyperbolas is developed for the first time, by which a means for estimating the upper bound of the Periodic Table is established in calculating that its last element has an atom mass of 411.663243 and an atomic number (the nuclear charge of 155. The formulating law is given.

Empirical yield tables for Wisconsin.

Science.gov (United States)

Jerold T. Hahn; Joan M. Stelman

1989-01-01

Describes the tables derived from the 1983 Forest Survey of Wisconsin and presents ways the tables can be used. These tables are broken down according to Wisconsin`s five Forest Survey Units and 14 forest types.

The Usefulness of Multilevel Hash Tables with Multiple Hash Functions in Large Databases

Directory of Open Access Journals (Sweden)

A.T. Akinwale

2009-05-01

Full Text Available In this work, attempt is made to select three good hash functions which uniformly distribute hash values that permute their internal states and allow the input bits to generate different output bits. These functions are used in different levels of hash tables that are coded in Java Programming Language and a quite number of data records serve as primary data for testing the performances. The result shows that the two-level hash tables with three different hash functions give a superior performance over one-level hash table with two hash functions or zero-level hash table with one function in term of reducing the conflict keys and quick lookup for a particular element. The result assists to reduce the complexity of join operation in query language from O( n2 to O( 1 by placing larger query result, if any, in multilevel hash tables with multiple hash functions and generate shorter query result.

Table of content translations of Soviet reports received by the INDC Secretariat

International Nuclear Information System (INIS)

1982-07-01

The INDC Secretariat receives a number of Soviet reports in Russian as part of the INDC document distribution system. Because of their large number and size most of them cannot be translated by the IAEA. The ''Nuclear Physics Research in the USSR - Collected Abstracts'' report series and occasional reports of interest to the nuclear data community are translated by the IAEA on a regular basis, and are normally given a ''U'' distribution. The ''Table of Content Translations'' contain the translation of the table of contents (and abstracts when available) of those Soviet reports which the IAEA does not translate in full. The originals of these reports are normally available in limited quantities only and are given an INDC ''G'' distribution. This issue contains the table of content translation of the following reports: Nuclear Constants, volume 3(42), original distributed as INDC(CCP)-173/G; Nuclear Constants, volume 4(43), original distributed as INDC(CCP)-175/G; Nuclear Constants, volume 5(44); original distributed as INDC(CCP)-176/G

Empirical yield tables for Michigan.

Science.gov (United States)

Jerold T. Hahn; Joan M. Stelman

1984-01-01

Describes the tables derived from the 1980 Forest Survey of Michigan and presents ways the tables can be used. These tables are broken down according to Michigan's four Forest Survey Units, 14 forest types, and 5 site-index classes.

40 CFR Appendix: Table 1 to... - List of Hazardous Air Pollutants (HAP) for Subpart HHH

Science.gov (United States)

2010-07-01

... 40 Protection of Environment 11 2010-07-01 2010-07-01 true List of Hazardous Air Pollutants (HAP) for Subpart HHH Table Appendix: Table 1 to Subpart HHH of Part 63 Protection of Environment... HHH of Part 63—List of Hazardous Air Pollutants (HAP) for Subpart HHH CAS Number a Chemical name 75070...

Random number generators for large-scale parallel Monte Carlo simulations on FPGA

Science.gov (United States)

Lin, Y.; Wang, F.; Liu, B.

2018-05-01

Through parallelization, field programmable gate array (FPGA) can achieve unprecedented speeds in large-scale parallel Monte Carlo (LPMC) simulations. FPGA presents both new constraints and new opportunities for the implementations of random number generators (RNGs), which are key elements of any Monte Carlo (MC) simulation system. Using empirical and application based tests, this study evaluates all of the four RNGs used in previous FPGA based MC studies and newly proposed FPGA implementations for two well-known high-quality RNGs that are suitable for LPMC studies on FPGA. One of the newly proposed FPGA implementations: a parallel version of additive lagged Fibonacci generator (Parallel ALFG) is found to be the best among the evaluated RNGs in fulfilling the needs of LPMC simulations on FPGA.

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.

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

A method for generating subgroup parameters from resonance tables

International Nuclear Information System (INIS)

Devan, K.; Mohanakrishnan, P.

1993-01-01

A method for generating subgroup or band parameters from resonance tables is described. A computer code SPART was written using this method. This code generates the subgroup parameters for any number of bands within the specified broad groups at different temperatures by reading the required input data from the binary cross section library in the Cadarache format. The results obtained with SPART code for two bands were compared with that obtained from GROUPIE code and a good agreement was obtained. Results of the generation of subgroup parameters in four bands for sample case of 239 Pu from resonance tables of Cadarache Ver.2 library is also presented. (author). 8 refs., 2 tabs

Subcopula-based measure of asymmetric association for contingency tables.

Science.gov (United States)

Wei, Zheng; Kim, Daeyoung

2017-10-30

For the analysis of a two-way contingency table, a new asymmetric association measure is developed. The proposed method uses the subcopula-based regression between the discrete variables to measure the asymmetric predictive powers of the variables of interest. Unlike the existing measures of asymmetric association, the subcopula-based measure is insensitive to the number of categories in a variable, and thus, the magnitude of the proposed measure can be interpreted as the degree of asymmetric association in the contingency table. The theoretical properties of the proposed subcopula-based asymmetric association measure are investigated. We illustrate the performance and advantages of the proposed measure using simulation studies and real data examples. Copyright © 2017 John Wiley & Sons, Ltd.

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

Constrained statistical inference: sample-size tables for ANOVA and regression

Directory of Open Access Journals (Sweden)

Leonard eVanbrabant

2015-01-01

Full Text Available Researchers in the social and behavioral sciences often have clear expectations about the order/direction of the parameters in their statistical model. For example, a researcher might expect that regression coefficient beta1 is larger than beta2 and beta3. The corresponding hypothesis is H: beta1 > {beta2, beta3} and this is known as an (order constrained hypothesis. A major advantage of testing such a hypothesis is that power can be gained and inherently a smaller sample size is needed. This article discusses this gain in sample size reduction, when an increasing number of constraints is included into the hypothesis. The main goal is to present sample-size tables for constrained hypotheses. A sample-size table contains the necessary sample-size at a prespecified power (say, 0.80 for an increasing number of constraints. To obtain sample-size tables, two Monte Carlo simulations were performed, one for ANOVA and one for multiple regression. Three results are salient. First, in an ANOVA the needed sample-size decreases with 30% to 50% when complete ordering of the parameters is taken into account. Second, small deviations from the imposed order have only a minor impact on the power. Third, at the maximum number of constraints, the linear regression results are comparable with the ANOVA results. However, in the case of fewer constraints, ordering the parameters (e.g., beta1 > beta2 results in a higher power than assigning a positive or a negative sign to the parameters (e.g., beta1 > 0.

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.

Pension Insurance Data Tables

Data.gov (United States)

Pension Benefit Guaranty Corporation — Find out about retirement trends in PBGC's data tables. The tables include statistics on the people and pensions that PBGC protects, including how many Americans are...

Robotic tilt table reduces the occurrence of orthostatic hypotension over time in vegetative states.

Science.gov (United States)

Taveggia, Giovanni; Ragusa, Ivana; Trani, Vincenzo; Cuva, Daniele; Angeretti, Cristina; Fontanella, Marco; Panciani, Pier Paolo; Borboni, Alberto

2015-06-01

The aim of this study is to evaluate the effects of verticalization with or without combined movement of the lower limbs in patients in a vegetative state or a minimally conscious state. In particular, we aimed to study whether, in the group with combined movement, there was better tolerance to verticalization. This was a randomized trial conducted in a neurorehabilitation hospital. Twelve patients with vegetative state and minimally conscious state 3-18 months after acute acquired brain injuries were included. Patients were randomized into A and B treatment groups. Study group A underwent verticalization with a tilt table at 65° and movimentation of the lower limbs with a robotic system for 30 min three times a week for 24 sessions. Control group B underwent the same rehabilitation treatment, with a robotic verticalization system, but an inactive lower-limb movement system. Systolic and diastolic blood pressure and heart rate were determined. Robotic movement of the lower limbs can reduce the occurrence of orthostatic hypotension in hemodynamically unstable patients. Despite the small number of patients involved (only eight patients completed the trial), our results indicate that blood pressures and heart rate can be stabilized better (with) by treatment with passive leg movements in hemodynamically unstable patients.

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)

Efficient Storage and Querying of Horizontal Tables Using a PIVOT Operation in Commercial Relational DBMSs

Science.gov (United States)

Shin, Sung-Hyun; Moon, Yang-Sae; Kim, Jinho; Kim, Sang-Wook

In recent years, a horizontal table with a large number of attributes is widely used in OLAP or e-business applications to analyze multidimensional data efficiently. For efficient storing and querying of horizontal tables, recent works have tried to transform a horizontal table to a traditional vertical table. Existing works, however, have the drawback of not considering an optimized PIVOT operation provided (or to be provided) in recent commercial RDBMSs. In this paper we propose a formal approach that exploits the optimized PIVOT operation of commercial RDBMSs for storing and querying of horizontal tables. To achieve this goal, we first provide an overall framework that stores and queries a horizontal table using an equivalent vertical table. Under the proposed framework, we then formally define 1) a method that stores a horizontal table in an equivalent vertical table and 2) a PIVOT operation that converts a stored vertical table to an equivalent horizontal view. Next, we propose a novel method that transforms a user-specified query on horizontal tables to an equivalent PIVOT-included query on vertical tables. In particular, by providing transformation rules for all five elementary operations in relational algebra as theorems, we prove our method is theoretically applicable to commercial RDBMSs. Experimental results show that, compared with the earlier work, our method reduces storage space significantly and also improves average performance by several orders of magnitude. These results indicate that our method provides an excellent framework to maximize performance in handling horizontal tables by exploiting the optimized PIVOT operation in commercial RDBMSs.

NNDSS - Table II. Vibriosis

Data.gov (United States)

U.S. Department of Health & Human Services — NNDSS - Table II. Vibriosis - 2017. In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the preceding year), and selected...

NNDSS - Table II. Vibriosis

Data.gov (United States)

U.S. Department of Health & Human Services — NNDSS - Table II. Vibriosis - 2018. In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the preceding year), and selected...

Advances in food composition tables in Japan-Standard Tables Of Food Composition in Japan - 2015 - (Seventh Revised Edition).

Science.gov (United States)

Watanabe, Tomoko; Kawai, Ryoko

2018-01-01

The latest version of the Standard Tables of Food Composition in Japan-2015- comprises the main food composition table (Standard Tables of Food Composition in Japan-2015-[Seventh revised Edition)) and three supplementary books. The supplementary books are Standard Tables of Food Composition in Japan - 2015 - (Seventh Revised Edition) - Amino Acids -, Standard Tables of Food Composition in Japan - 2015 - (Seventh Revised Edition) - Fatty Acids - and Standard Tables of Food Composition in Japan - 2015 - (Seventh Revised Edition) - Available Carbohydrates, Polyols and Organic Acids-. We believe understanding these food composition tables can give greater insight into Japan's gastronomic culture and changes in eating habits. We expect them to play important roles as part of the East Asia food composition tables. Copyright © 2017. Published by Elsevier Ltd.

30 CFR 250.1401 - Index table.

Science.gov (United States)

2010-07-01

... 30 Mineral Resources 2 2010-07-01 2010-07-01 false Index table. 250.1401 Section 250.1401 Mineral... OPERATIONS IN THE OUTER CONTINENTAL SHELF Outer Continental Shelf (OCS) Civil Penalties § 250.1401 Index table. The following table is an index of the sections in this subpart: § 250.1401Table Definitions...

Do children with obesity have worse table manners? Associations between child table manners, weight status and weight gain.

Science.gov (United States)

Briones, Naomi F; Cesaro, Robert J; Appugliese, Danielle P; Miller, Alison L; Rosenblum, Katherine L; Pesch, Megan H

2018-06-01

Children with obesity experience stigma stemming from stereotypes, one such stereotype is that people with obesity are "sloppy" or have poor manners. Teaching children "proper table manners" has been proposed as an obesity prevention strategy. Little is known about the association between children's weight status and table manners. To examine correlates of child table manners and to examine the association of child table manners with child obese weight status and prospective change in child body mass index z-score (BMIz). Mother-child dyads (N = 228) participated in a videotaped laboratory eating task with cupcakes. Coding schemes to capture child table manners (making crumbs, chewing with mouth open, getting food on face, shoving food in mouth, slouching, and getting out of seat), and maternal attentiveness to child table manners, were reliably applied. Anthropometrics were measured at baseline and at follow-up two years later. Regression analyses examined the association of participant characteristics with child table manners, as well as the associations of child table manners with child obese weight status, and prospective change in BMIz/year. Predictors of poorer child table manners were younger child age, greater cupcake consumption, and greater maternal attentiveness to child table manners. Poorer child table manners were not associated with child obese (vs. not) weight status, but were associated with a prospective decrease in BMIz/year in children with overweight/obesity. Obesity interventions to improve table manners may be perpetuating unfavorable stereotypes and stigma. Future work investigating these associations is warranted to inform childhood obesity guidelines around table manners. Copyright © 2018 Elsevier Ltd. All rights reserved.

Do bacterial cell numbers follow a theoretical Poisson distribution? Comparison of experimentally obtained numbers of single cells with random number generation via computer simulation.

Science.gov (United States)

Koyama, Kento; Hokunan, Hidekazu; Hasegawa, Mayumi; Kawamura, Shuso; Koseki, Shigenobu

2016-12-01

We investigated a bacterial sample preparation procedure for single-cell studies. In the present study, we examined whether single bacterial cells obtained via 10-fold dilution followed a theoretical Poisson distribution. Four serotypes of Salmonella enterica, three serotypes of enterohaemorrhagic Escherichia coli and one serotype of Listeria monocytogenes were used as sample bacteria. An inoculum of each serotype was prepared via a 10-fold dilution series to obtain bacterial cell counts with mean values of one or two. To determine whether the experimentally obtained bacterial cell counts follow a theoretical Poisson distribution, a likelihood ratio test between the experimentally obtained cell counts and Poisson distribution which parameter estimated by maximum likelihood estimation (MLE) was conducted. The bacterial cell counts of each serotype sufficiently followed a Poisson distribution. Furthermore, to examine the validity of the parameters of Poisson distribution from experimentally obtained bacterial cell counts, we compared these with the parameters of a Poisson distribution that were estimated using random number generation via computer simulation. The Poisson distribution parameters experimentally obtained from bacterial cell counts were within the range of the parameters estimated using a computer simulation. These results demonstrate that the bacterial cell counts of each serotype obtained via 10-fold dilution followed a Poisson distribution. The fact that the frequency of bacterial cell counts follows a Poisson distribution at low number would be applied to some single-cell studies with a few bacterial cells. In particular, the procedure presented in this study enables us to develop an inactivation model at the single-cell level that can estimate the variability of survival bacterial numbers during the bacterial death process. Copyright © 2016 Elsevier Ltd. All rights reserved.

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.

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.

Table Tennis Club

CERN Multimedia

Table Tennis Club

2012-01-01

The CERN Table Tennis club and the Meyrin CTT are organizing two Table Tennis workshops from 2 to 6 July and from 20 to 24 August 2012 inclusive in Meyrin. A professional would be with your children from 14.00 pm to 18.00 pm: an instructor J + S category A. Training courses with specific themes, individual courses would be given depending on the level of the child’s game, “discoveries –table tennis games” courses and games with the robot. Other activities (stretching, relaxation). Afternoons (from 18 to 20 children): 40 CHF per workshop and per child. Evenings (from 18 to 20 adults): 60 CHF per workshop and per adult. For further information, please contact Mr. Monteil : Mobile: (+33) 06 61 31 70 47 E-mail: wilfried.monteil@free.fr.

Tables and figures from Gavett 2016 paper in Particle and Fibre Toxicology

Data.gov (United States)

U.S. Environmental Protection Agency — The files in the dataset are labeled according to table or figure number as listed in the paper (Gavett et al., Particle and Fibre Toxicology, 13:17, 2016). The...

Decision and Inhibitory Trees for Decision Tables with Many-Valued Decisions

KAUST Repository

Azad, Mohammad

2018-06-06

Decision trees are one of the most commonly used tools in decision analysis, knowledge representation, machine learning, etc., for its simplicity and interpretability. We consider an extension of dynamic programming approach to process the whole set of decision trees for the given decision table which was previously only attainable by brute-force algorithms. We study decision tables with many-valued decisions (each row may contain multiple decisions) because they are more reasonable models of data in many cases. To address this problem in a broad sense, we consider not only decision trees but also inhibitory trees where terminal nodes are labeled with “̸= decision”. Inhibitory trees can sometimes describe more knowledge from datasets than decision trees. As for cost functions, we consider depth or average depth to minimize time complexity of trees, and the number of nodes or the number of the terminal, or nonterminal nodes to minimize the space complexity of trees. We investigate the multi-stage optimization of trees relative to some cost functions, and also the possibility to describe the whole set of strictly optimal trees. Furthermore, we study the bi-criteria optimization cost vs. cost and cost vs. uncertainty for decision trees, and cost vs. cost and cost vs. completeness for inhibitory trees. The most interesting application of the developed technique is the creation of multi-pruning and restricted multi-pruning approaches which are useful for knowledge representation and prediction. The experimental results show that decision trees constructed by these approaches can often outperform the decision trees constructed by the CART algorithm. Another application includes the comparison of 12 greedy heuristics for single- and bi-criteria optimization (cost vs. cost) of trees. We also study the three approaches (decision tables with many-valued decisions, decision tables with most common decisions, and decision tables with generalized decisions) to handle

The 2005 CHF look-up table

International Nuclear Information System (INIS)

Groeneveld, D.C.; Vasic, A.Z.; Leung, L.K.H.; Durmayaz, A.; Shan, J.Q.; Yang, J.; Cheng, S.C.

2005-01-01

Full text of publication follows: CHF Look-up tables have been used widely for the prediction of the Critical Heat Flux (CHF) The CHF look-up table is basically a normalized data bank. The first CHF look-up table was constructed by Doroshchuk et al. (1975), using a limited database of 5 000 data points. This table, and all subsequent tables, contain normalized CHF values for a vertical 8 mm water-cooled tube for various pressures, mass fluxes and qualities. The CHF table development work has since been in progress at various institutions (e.g. CENG-Grenoble, University of Ottawa (UO), Ottawa, IPPE, Obninsk, and AECL, Chalk River) using an ever increasing data base. The 1995 CHF look-up table employs a data base containing about 30 000 CHF points and provides CHF values for an 8 mm ID, water-cooled tube, for 19 pressures, 20 mass fluxes, and 23 qualities. covering the full range of conditions of practical interest. The 2005 CHF LUT is an update to the 1995 LUT and addresses several concerns raised in the literature. The major improvements made are: - enhancement of the quality of the data base of the CHF look-up table (identify outliers, improve screening procedures); - increase in the data base by adding recently obtained data; - employment of greater subdivision of the look-up table by using smaller intervals in the independent parameters (pressure, mass flux and quality) at conditions where the variation in CHF is significant; - improvement of the smoothness of the CHF look-up table. This was done by the use of logarithmic functions for CHF, using optimum Spline functions etc. A discussion of the impact of these changes on the prediction accuracy and table smoothness is presented. It will be shown that the 2005 CHF look-up table is characterized by a significant improvement in accuracy and smoothness. [1] D. Groeneveld is the corresponding author. He is an Adjunct Professor at the University of Ottawa. (authors)

Making of attenuation-correcting computation table for RIs and emitted gamma ray table using MS-Excel

International Nuclear Information System (INIS)

Miura, Shigeyuki; Takahashi, Mitsuyuki; Sato, Isamu

1995-01-01

In the technical workshop of National Institute for Fusion Science in the last year, report was made on the making of attenuation-correcting computation table for R/S by using the software Lotus 1-2-3 on MS-DOS. It was decided to use this table by applying Windows, and further, to partially add some functions to this table. Excel 5.0 was to be used as the software, since Excel seems to be the main of Windows. It was decided to make anew the γ-ray data table which is linked to the radioactivity data in the RI attenuation-correcting computation table. First work is to convert the RI attenuation-correcting computation table made as the file of Lotus 1-2-3 to the file of Excel 5.0 of Windows, and this is very simple. As the result of the file conversion, it was found that the data file became compact. Next work is the addition of functions to this table. The function being added this time is that for judging whether R/S are those which are stipulated in the laws or not from the values of radioactivity calculated by the attenuation correction. The concrete method of this addition of function is explained. The data table on the γ-ray for respective nuclides was made. The present state of the data base on radiation was investigated. (K.I.)

Hardware random number generator base on monostable multivibrators dedicated for distributed measurement and control systems

Science.gov (United States)

Czernik, Pawel

2013-10-01

The hardware random number generator based on the 74121 monostable multivibrators for applications in cryptographically secure distributed measurement and control systems with asymmetric resources was presented. This device was implemented on the basis of the physical electronic vibration generator in which the circuit is composed of two "loop" 74121 monostable multivibrators, D flip-flop and external clock signal source. The clock signal, witch control D flip-flop was generated by a computer on one of the parallel port pins. There was presented programmed the author's acquisition process of random data from the measuring system to a computer. The presented system was designed, builded and thoroughly tested in the term of cryptographic security in our laboratory, what there is the most important part of this publication. Real cryptographic security was tested based on the author's software and the software environment called RDieHarder. The obtained results was here presented and analyzed in detail with particular reference to the specificity of distributed measurement and control systems with asymmetric resources.

Iso-effect table for radiation tolerance of the human spinal cord

International Nuclear Information System (INIS)

Cohen, L.; Creditor, M.

1981-01-01

Available literature on radiation injury to the human spinal cord was collected into a comprehensive data set relating the incidence of myelopathy to dosage, number of fractions and total treatment time. The data was analyzed using a search program (RAD3) to derive best-fitting cell kinetic parameters on the assumption that radiation myelopathy arises from cellular depletion in the irradiated tissues. From these parameters iso-effect tables were constructed for a wide range of treatment schedules, including daily treatment as well as fractionation at longer intervals. The tables provide a set of limiting doses, above which the risk of radiation injury to the spinal cord becomes substantial. General application of NSD tolerance limits could lead to systematic overdosage of the spinal cord, especially with large individual fractions or short treatment times. We conclude that the computed iso-effect tables provide a more reliable clinical guide than conventional time-dose equations

Stochastic analysis of unsaturated steady flows above the water table

Science.gov (United States)

Severino, Gerardo; Scarfato, Maddalena; Comegna, Alessandro

2017-08-01

Steady flow takes place into a three-dimensional partially saturated porous medium where, due to their spatial variability, the saturated conductivity Ks, and the relative conductivity Kr are modeled as random space functions (RSF)s. As a consequence, the flow variables (FVs), i.e., pressure-head and specific flux, are also RSFs. The focus of the present paper consists into quantifying the uncertainty of the FVs above the water table. The simple expressions (most of which in closed form) of the second-order moments pertaining to the FVs allow one to follow the transitional behavior from the zone close to the water table (where the FVs are nonstationary), till to their far-field limit (where the FVs become stationary RSFs). In particular, it is shown how the stationary limits (and the distance from the water table at which stationarity is attained) depend upon the statistical structure of the RSFs Ks, Kr, and the infiltrating rate. The mean pressure head >> has been also computed, and it is expressed as =Ψ0>(1+ψ>), being ψ a characteristic heterogeneity function which modifies the zero-order approximation Ψ0 of the pressure head (valid for a vadose zone of uniform soil properties) to account for the spatial variability of Ks and Kr. Two asymptotic limits, i.e., close (near field) and away (far field) from the water table, are derived into a very general manner, whereas the transitional behavior of ψ between the near/far field can be determined after specifying the shape of the various input soil properties. Besides the theoretical interest, results of the present paper are useful for practical purposes, as well. Indeed, the model is tested against to real data, and in particular it is shown how it is possible for the specific case study to grasp the behavior of the FVs within an environment (i.e., the vadose zone close to the water table) which is generally very difficult to access by direct inspection.

An empirical table of equivalent squares of rectangular fields for the Theratron 780

International Nuclear Information System (INIS)

Marbach, J.R.; Hudgins, P.T.

1977-01-01

Tables of equivalent squares are used to calculate percentage depth-dose values for non-square fields in cobalt teletherapy. The table in The British Journal of Radiology (Supplements 10, 11) has been in use for a number of years, and the design of cobalt irradiators has developed during this period. Sources are now of much higher activity, collimators and trimmers have been redesigned and larger field sizes (up to 35 x 35 cm at 80 cm SSD) are obtainable. Measurements were therefore made in a water phantom to provide data to re-test the validity of the table, and to add the larger field sizes. Results given in the new table of equivalent squares of rectangular fields for cobalt 60 radiotherapy are compared with values from Supplement 11. There were no clinically significant differences in the central axis depth-dose values at 5 cm depth for two equivalent squares, although the measured values appeared to be consistently larger. (U.K.)

Bacterial communities on food court tables and cleaning equipment in a shopping mall.

Science.gov (United States)

Dingsdag, S; Coleman, N V

2013-08-01

The food court at a shopping mall is a potential transfer point for pathogenic microbes, but to date, this environment has not been the subject of detailed molecular microbiological study. We used a combination of culture-based and culture-independent approaches to investigate the types and numbers of bacteria present on food court tables, and on a food court cleaning cloth. Bacteria were found at 10²-10⁵ c.f.u./m² on food court tables and 10¹⁰ c.f.u./m² on the cleaning cloth. Tag-pyrosequencing of amplified 16S rRNA genes revealed that the dominant bacterial types on the cleaning cloth were genera known to include pathogenic species (Stenotrophomonas, Aeromonas), and that these genera were also evident at lower levels on table surfaces, suggesting possible cross-contamination. The evidence suggests a public health threat is posed by bacteria in the food court, and that this may be due to cross-contamination between cleaning equipment and table surfaces.

Optimization of approximate decision rules relative to number of misclassifications

KAUST Repository

Amin, Talha M.; Chikalov, Igor; Moshkov, Mikhail; Zielosko, Beata

2012-01-01

In the paper, we study an extension of dynamic programming approach which allows optimization of approximate decision rules relative to the number of misclassifications. We introduce an uncertainty measure J(T) which is a difference between the number of rows in a decision table T and the number of rows with the most common decision for T. For a nonnegative real number γ, we consider γ-decision rules that localize rows in subtables of T with uncertainty at most γ. The presented algorithm constructs a directed acyclic graph Δγ(T). Based on this graph we can describe the whole set of so-called irredundant γ-decision rules. We can optimize rules from this set according to the number of misclassifications. Results of experiments with decision tables from the UCI Machine Learning Repository are presented. © 2012 The authors and IOS Press. All rights reserved.

Optimization of approximate decision rules relative to number of misclassifications

KAUST Repository

Amin, Talha

2012-12-01

In the paper, we study an extension of dynamic programming approach which allows optimization of approximate decision rules relative to the number of misclassifications. We introduce an uncertainty measure J(T) which is a difference between the number of rows in a decision table T and the number of rows with the most common decision for T. For a nonnegative real number γ, we consider γ-decision rules that localize rows in subtables of T with uncertainty at most γ. The presented algorithm constructs a directed acyclic graph Δγ(T). Based on this graph we can describe the whole set of so-called irredundant γ-decision rules. We can optimize rules from this set according to the number of misclassifications. Results of experiments with decision tables from the UCI Machine Learning Repository are presented. © 2012 The authors and IOS Press. All rights reserved.

Global Reference Tables Services Architecture

Data.gov (United States)

Social Security Administration — This database stores the reference and transactional data used to provide a data-driven service access method to certain Global Reference Table (GRT) service tables.

Isomers chart; Table des isomeres

Energy Technology Data Exchange (ETDEWEB)

Dupont-Gautier, P; Chantelot, S; Moisson, N [Commissariat a l' Energie Atomique, Saclay (France). Centre d' Etudes Nucleaires

1967-07-01

The nuclear isomers are nuclides offering the same mass number and the same atomic number, but different energy levels. In the following chart the zero energy ground states are omitted and the metastable isomers, i.e. of non-zero energy, known and of measurable lifetime, are listed. The lower limit of this lifetime was set here to 0.1 x 10{sup -6} s. The various isomers were classified in increasing lifetimes. (authors) [French] Les isomeres nucleaires sont des nucleides presentant le meme nombre de masse et le meme numero atomique, mais des niveaux energetiques differents. Dans la table suivante, on a neglige les etats fondamentaux d'energie nulle et on a recense les isomeres metastables, c'est-a-dire d'energie non nulle, connus et de periode mesurable. La limite inferieure de cette periode a ete fixee ici a 0,1 x 10{sup -6} s. Les differents isomeres ont ete classes par periodes croissantes. (auteurs)

Isomers chart; Table des isomeres

Energy Technology Data Exchange (ETDEWEB)

Dupont-Gautier, P.; Chantelot, S.; Moisson, N. [Commissariat a l' Energie Atomique, Saclay (France). Centre d' Etudes Nucleaires

1967-07-01

The nuclear isomers are nuclides offering the same mass number and the same atomic number, but different energy levels. In the following chart the zero energy ground states are omitted and the metastable isomers, i.e. of non-zero energy, known and of measurable lifetime, are listed. The lower limit of this lifetime was set here to 0.1 x 10{sup -6} s. The various isomers were classified in increasing lifetimes. (authors) [French] Les isomeres nucleaires sont des nucleides presentant le meme nombre de masse et le meme numero atomique, mais des niveaux energetiques differents. Dans la table suivante, on a neglige les etats fondamentaux d'energie nulle et on a recense les isomeres metastables, c'est-a-dire d'energie non nulle, connus et de periode mesurable. La limite inferieure de cette periode a ete fixee ici a 0,1 x 10{sup -6} s. Les differents isomeres ont ete classes par periodes croissantes. (auteurs)

From the Mendeleev periodic table to particle physics and back to the periodic table

International Nuclear Information System (INIS)

Kibler, Maurice R.

2006-11-01

We briefly describe in this paper the passage from Mendeleev's chemistry (1869) to atomic physics (in the 1900's), nuclear physics (in the 1932's) and particle physics (from 1953 to 2006). We show how the consideration of symmetries, largely used in physics since the end of the 1920's, gave rise to a new format of the periodic table in the 1970's. More specifically, this paper is concerned with the application of the group SO(4,2)xSU(2) to the periodic table of chemical elements. It is shown how the Madelung rule of the atomic shell model can be used for setting up a periodic table that can be further rationalized via the group SO(4,2)xSU(2) and some of its subgroups. Qualitative results are obtained from this nonstandard table. (author)

NNDSS - Table II. Ehrlichiosis/Anaplasmosis

Data.gov (United States)

U.S. Department of Health & Human Services — NNDSS - Table II. Ehrlichiosis/Anaplasmosis - 2015.In this Table, provisional cases of selected notifiable diseases (≥1,000 cases reported during the preceding...

NNDSS - Table II. Ehrlichiosis/Anaplasmosis

Data.gov (United States)

U.S. Department of Health & Human Services — NNDSS - Table II. Ehrlichiosis/Anaplasmosis - 2016. In this Table, provisional* cases of selected† notifiable diseases (≥1,000 cases reported during the preceding...

The Living Periodic Table

Science.gov (United States)

Nahlik, Mary Schrodt

2005-01-01

To help make the abstract world of chemistry more concrete eighth-grade students, the author has them create a living periodic table that can be displayed in the classroom or hallway. This display includes information about the elements arranged in the traditional periodic table format, but also includes visual real-world representations of the…

Climate change : transportation table

International Nuclear Information System (INIS)

Ogilvie, K.

1999-01-01

The Kyoto Protocol sets greenhouse gas (GHG) reduction targets for the post-2000 period. If ratified, Canada will be committed to reduce emissions of GHGs by 6 per cent below 1990 levels during the period 2008-2012. A recommended national strategy is to establish 'issue tables' that will advise the Ministers of Energy and Environment on preferred options to reach the Kyoto target and to identify early actions that can be taken. The 'Transportation Table' which is the focus of this paper, is one of the 15 sectoral tables. The Transportation Table will identify by July 1999, specific measures to mitigate GHG emissions from Canada's transportation sector. Currently, GHG emissions from the transportation sector are predicted to be 27 per cent above 1990 levels by 2010. Fuel taxes, emissions trading, and research into improved vehicle technologies and automotive fuels are some of the recommended options which can help reduce emissions trading from the transportation sector. Studies are underway to deal with emissions from transport in two sub-groups, freight and passenger. 1 fig

Betti numbers of graded modules and cohomology of vector bundles

Science.gov (United States)

Eisenbud, David; Schreyer, Frank-Olaf

2009-07-01

In the remarkable paper Graded Betti numbers of Cohen-Macaulay modules and the multiplicity conjecture, Mats Boij and Jonas Soederberg conjectured that the Betti table of a Cohen-Macaulay module over a polynomial ring is a positive linear combination of Betti tables of modules with pure resolutions. We prove a strengthened form of their conjectures. Applications include a proof of the Multiplicity Conjecture of Huneke and Srinivasan and a proof of the convexity of a fan naturally associated to the Young lattice. With the same tools we show that the cohomology table of any vector bundle on projective space is a positive rational linear combination of the cohomology tables of what we call supernatural vector bundles. Using this result we give new bounds on the slope of a vector bundle in terms of its cohomology.

Table Tennis Club

CERN Document Server

Table Tennis Club

2012-01-01

2012 CERN Table Tennis Tournament As the campaign launched by the CERN medical service “Move! & Eat better” is designed in particular to encourage people at CERN to take more regular exercise, the CERN Table Tennis Club, with its traditional CERN Table Tennis Tournament is providing an excellent opportunity to practice moving. The tournament will take place at the Meyrin CTT, 2 rue de Livron, Saturday August 25, 2012, in the afternoon (starting at 13:30). It is open to all CERN staff, users, visitors and families, including of course summer students, who are strongly encouraged to participate. In order to register, simply send an E-mail to Jean-Pierre Revol (jean-pierre.revol@cern.ch). You may also find useful information on the Club Web page http://www.cern.ch/tabletennis CERN 2011 champion Savitha Flaecher, between the finalist Bertrand Mouches on her left, the winner of the consolation draw on her right (Sudarshan Paramesvaran), and far left, Denis Moriaud (semi-finalist a...

X-ray table

International Nuclear Information System (INIS)

Craig, J.R.; Otto, G.W.

1980-01-01

An X-ray radiographic or fluoroscopic table is described which includes a film holder with a frame attached to a cable running over end pulleys for positioning the holder longitudinally as desired under the table top. The holder has a front opening to receive a cassette-supporting tray which can be slid out on tracks to change the cassette. A reed switch on the frame is opened by a permanent magnet on the tray only when the tray is half-way out. When the switch is closed, an electromagnet locks the pulley and the holder in place. The holder is thus automatically locked in place not only during exposure (tray in) but when the tray is out for changing the cassette. To re-position the holder, the operator pulls the tray half-out and, using the tray itself, pushes the holder along the table, the holder being counterbalanced by a weight. (author)

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

21 CFR 890.3750 - Mechanical table.

Science.gov (United States)

2010-04-01

... 21 Food and Drugs 8 2010-04-01 2010-04-01 false Mechanical table. 890.3750 Section 890.3750 Food... DEVICES PHYSICAL MEDICINE DEVICES Physical Medicine Prosthetic Devices § 890.3750 Mechanical table. (a) Identification. A mechanical table is a device intended for medical purposes that has a flat surface that can be...

The relationship between randomness and power-law distributed move lengths in random walk algorithms

Science.gov (United States)

Sakiyama, Tomoko; Gunji, Yukio-Pegio

2014-05-01

Recently, we proposed a new random walk algorithm, termed the REV algorithm, in which the agent alters the directional rule that governs it using the most recent four random numbers. Here, we examined how a non-bounded number, i.e., "randomness" regarding move direction, was important for optimal searching and power-law distributed step lengths in rule change. We proposed two algorithms: the REV and REV-bounded algorithms. In the REV algorithm, one of the four random numbers used to change the rule is non-bounded. In contrast, all four random numbers in the REV-bounded algorithm are bounded. We showed that the REV algorithm exhibited more consistent power-law distributed step lengths and flexible searching behavior.

Non-compact random generalized games and random quasi-variational inequalities

OpenAIRE

Yuan, Xian-Zhi

1994-01-01

In this paper, existence theorems of random maximal elements, random equilibria for the random one-person game and random generalized game with a countable number of players are given as applications of random fixed point theorems. By employing existence theorems of random generalized games, we deduce the existence of solutions for non-compact random quasi-variational inequalities. These in turn are used to establish several existence theorems of noncompact generalized random ...

Automation of BESSY scanning tables

International Nuclear Information System (INIS)

Hanton, J.; Kesteman, J.

1981-01-01

A micro processor M6800 is used for the automation of scanning and premeasuring BESSY tables. The tasks achieved by the micro processor are: 1. control of spooling of the four asynchronous film winding devices and switching on and off the 4 projections lamps, 2. pre-processing of the data coming from a bi-polar coordinates measuring device, 3. bi-directional interchange of informations between the operator, the BESSY table and the DEC PDP 11/34 mini computer controling the scanning operations, 4. control of the magnification on the table by swapping the projection lenses of appropriate focal lengths and the associated light boxes (under development). In connection with point 4, study is being made for the use of BESSY tables for accurate measurements (+/-5 microns), by encoding the displacements of the projections lenses. (orig.)

From the Mendeleev periodic table to particle physics and back to the periodic table

Energy Technology Data Exchange (ETDEWEB)

Kibler, Maurice R. [Universite de Lyon, Institut de Physique Nucleaire, Universite Lyon 1 and CNRS/IN2P3, 43 Bd du 11 Novembre 1918, F-69622 Villeurbanne Cedex (France)

2006-11-15

We briefly describe in this paper the passage from Mendeleev's chemistry (1869) to atomic physics (in the 1900's), nuclear physics (in the 1932's) and particle physics (from 1953 to 2006). We show how the consideration of symmetries, largely used in physics since the end of the 1920's, gave rise to a new format of the periodic table in the 1970's. More specifically, this paper is concerned with the application of the group SO(4,2)xSU(2) to the periodic table of chemical elements. It is shown how the Madelung rule of the atomic shell model can be used for setting up a periodic table that can be further rationalized via the group SO(4,2)xSU(2) and some of its subgroups. Qualitative results are obtained from this nonstandard table. (author)

Cohort Working Life Tables for Older Canadians

Directory of Open Access Journals (Sweden)

Spencer, Byron G.

2010-01-01

Full Text Available AbstractWe construct cohort working life tables for Canadian men and women aged 50and older and, for comparison, corresponding period tables. The tables arederived using annual single-age time series of participation rates for 1976-2006from the master files of the Statistics Canada Labour Force Survey. The cohortcalculations are based on stochastic projections of mortality coupled withalternative assumptions about future participation rates. Separate tables areprovided for the years 1976, 1991, and 2006, thus spanning a period ofsubstantial gains in life expectancy and strong upward trends in femaleparticipation. Life expectancies based on the cohort tables are greater thanthose based on the period tables, for both men and women, and that is reflectedin increased retirement expectancies. For example, a male aged 50 in 1976could have expected to live three years longer and to have almost four moreyears in retirement, based on the male cohort table under medium assumptions,as compared with the corresponding period table.RésuméNous avons établis des tables de vie active par génération pour les Canadiens etCanadiennes âgés de 50 ans ou plus ainsi que des tables du momentcorrespondantes pour servir de comparaison. Les tables sont dérivées à l'aidede séries chronologiques annuelles d'un seul âge pour le taux d'activité pour lesannées 1976 à 2006 provenant des fichiers maîtres de l'Enquête sur lapopulation active de Statistique Canada. Les calculs par génération sont baséessur des projections stochastiques de mortalité et sur des suppositions quant àde futurs taux d'activité possibles. Des tables séparées ont été établies pour lesannées 1976, 1991 et 2006 ; ce qui représente une période qui a vu des gainssubstantiels en ce qui concerne l'espérance de vie et une forte hausse d'activitéchez les femmes. Les espérance de vie basées sur les tables par génération sontplus élevées que celles basées sur les tables du

One Model Fits All: Explaining Many Aspects of Number Comparison within a Single Coherent Model-A Random Walk Account

Science.gov (United States)

Reike, Dennis; Schwarz, Wolf

2016-01-01

The time required to determine the larger of 2 digits decreases with their numerical distance, and, for a given distance, increases with their magnitude (Moyer & Landauer, 1967). One detailed quantitative framework to account for these effects is provided by random walk models. These chronometric models describe how number-related noisy…

Authenticated hash tables

DEFF Research Database (Denmark)

Triandopoulos, Nikolaos; Papamanthou, Charalampos; Tamassia, Roberto

2008-01-01

Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so that the client can save space or achieve load balancing. Authenticating the hash table functionality, i.e., verifying...... to a scheme that achieves different trade-offs---namely, constant update time and O(nε/logκε n) query time for fixed ε > 0 and κ > 0. An experimental evaluation of our solution shows very good scalability....

The global resource balance table, an integrated table of energy, materials and the environment

International Nuclear Information System (INIS)

Tsuchiya, Haruki

2013-01-01

This paper introduces the Global Resource Balance Table (GRBT), which is an extension of the energy balance tables that expresses the relationships between energy, materials and the environment. The material division of the GRBT includes steel, cement, paper, wood and grain. In contrast, the environmental division of the GRBT includes oxygen, CO 2 and methane. The transaction division rows in the GRBT include production, conversion, end use and stock. Each cell of the GRBT contains the quantities of the respective resources that were generated or consumed. The relationships between the cells were constructed from the laws of conservation of the materials and energy. We constructed a GRBT for 2007 and discussed the increasing air temperature due to waste heat and the CO 2 equivalent from human breathing. The GRBT is a comprehensive integrated table that represents the resources that are consumed by human activities and is useful for energy and environmental studies. - Highlights: • We extended energy balance table and introduced Global Resource Balance Table. • It shows relationships between energy, materials and the environment. • The material division includes steel, cement, paper, wood and grain. • The environmental division includes oxygen, CO 2 and methane. • We discussed on waste heat and CO 2 emission by human breathing

Vicious random walkers in the limit of a large number of walkers

International Nuclear Information System (INIS)

Forrester, P.J.

1989-01-01

The vicious random walker problem on a line is studied in the limit of a large number of walkers. The multidimensional integral representing the probability that the p walkers will survive a time t (denoted P t (p) ) is shown to be analogous to the partition function of a particular one-component Coulomb gas. By assuming the existence of the thermodynamic limit for the Coulomb gas, one can deduce asymptotic formulas for P t (p) in the large-p, large-t limit. A straightforward analysis gives rigorous asymptotic formulas for the probability that after a time t the walkers are in their initial configuration (this event is termed a reunion). Consequently, asymptotic formulas for the conditional probability of a reunion, given that all walkers survive, are derived. Also, an asymptotic formula for the conditional probability density that any walker will arrive at a particular point in time t, given that all p walkers survive, is calculated in the limit t >> p

Detection and molecular characterization of Methicillin Resistant Staphylococcus aureus from table eggs

Science.gov (United States)

Background: Table eggs are nutritionally important food consumed globally. Despite being protected inside the hard shell and a semi-permeable membrane, the egg contents may be contaminated with microbes and thus become a possible carrier of infectious agents to humans. A number of medically signific...

A time-series approach to random number generation: Using recurrence quantification analysis to capture executive behavior

Directory of Open Access Journals (Sweden)

Wouter eOomens

2015-06-01

Full Text Available The concept of executive functions plays a prominent role in contemporary experimental and clinical studies on cognition. One paradigm used in this framework is the random number generation (RNG task, the execution of which demands aspects of executive functioning, specifically inhibition and working memory. Data from the RNG task are best seen as a series of successive events. However, traditional RNG measures that are used to quantify executive functioning are mostly summary statistics referring to deviations from mathematical randomness. In the current study, we explore the utility of recurrence quantification analysis (RQA, a nonlinear method that keeps the entire sequence intact, as a better way to describe executive functioning compared to traditional measures. To this aim, 242 first- and second-year students completed a non-paced RNG task. Principal component analysis of their data showed that traditional and RQA measures convey more or less the same information. However, RQA measures do so more parsimoniously and have a better interpretation.

Experiences with the Mobile Interactive Learning Table: a custom table for education

OpenAIRE

Wilson, Gregory

2011-01-01

Multi-touch technology on tabletop displays lets children interact with digital objects in collaborative and competitive ways. Multi-touch tables are not a part of classroom instruction because of high cost and lack of meaningful applications. This thesis explores possible solutions to building hardware and software that support the engagement of children. Outlined is a demonstration of our Mobile Interactive Learning Table (MILT), a custom hardware system that can be built for a cost well...

A decade of illegal fishing in Table Mountain National Park (2000 ...

African Journals Online (AJOL)

Illegal fishing activities are reported to be on the increase in South Africa, including in its marine protected areas (MPAs). Research is presented on the nature and the scale of illegal fishing in Table Mountain National Park (TMNP) by analysing the numbers of abalone Haliotis midae and West Coast rock lobster Jasus ...

Theory and implementation of a very high throughput true random number generator in field programmable gate array

Energy Technology Data Exchange (ETDEWEB)

Wang, Yonggang, E-mail: wangyg@ustc.edu.cn; Hui, Cong; Liu, Chong; Xu, Chao [Department of Modern Physics, University of Science and Technology of China, Hefei 230026 (China)

2016-04-15

The contribution of this paper is proposing a new entropy extraction mechanism based on sampling phase jitter in ring oscillators to make a high throughput true random number generator in a field programmable gate array (FPGA) practical. Starting from experimental observation and analysis of the entropy source in FPGA, a multi-phase sampling method is exploited to harvest the clock jitter with a maximum entropy and fast sampling speed. This parametrized design is implemented in a Xilinx Artix-7 FPGA, where the carry chains in the FPGA are explored to realize the precise phase shifting. The generator circuit is simple and resource-saving, so that multiple generation channels can run in parallel to scale the output throughput for specific applications. The prototype integrates 64 circuit units in the FPGA to provide a total output throughput of 7.68 Gbps, which meets the requirement of current high-speed quantum key distribution systems. The randomness evaluation, as well as its robustness to ambient temperature, confirms that the new method in a purely digital fashion can provide high-speed high-quality random bit sequences for a variety of embedded applications.

Aggregation Algorithms in Heterogeneous Tables

Directory of Open Access Journals (Sweden)

Titus Felix FURTUNA

2006-01-01

Full Text Available The heterogeneous tables are most used in the problem of aggregation. A solution for this problem is to standardize these tables of figures. In this paper, we proposed some methods of aggregation based on the hierarchical algorithms.

Dosimetric Effects Of Different Treatment Tables During Radiotherapy

International Nuclear Information System (INIS)

Murkovic, M.; Grego, T.; Bibic, J.

2015-01-01

The aim of our study was to measure the effect of mega-voltage photon beam attenuation when treating patients through carbon fibre treatment table with and without the carbon laminate base plate on it. We also examined the ability of XiO treatment planning system in modelling this effect. Direct attenuation measurements were made for two treatment tables, Siemens TxT 550 treatment table with TT-A table top and Elekta Precise table with iBEAM evo table top. On both treatment tables we used Orfit Base Plate (32301). Measurements were taken for two photon energies (6 MV and 18 MV), at two different field sizes (5 x 5 cm 2 and 10 x 10 cm 2 ) and different gantry angles in 50 intervals using stationary water phantom and Farmer type ionization chamber. These values were compared to values calculated in XiO. In order to account for the effect of table and base plate during treatment planning in XiO, customized table and base plate templates were develop in Focal planning system. To construct these customized templates, table and base plate contours as well as respective relative electron density's to water were obtained on CT scanner. The largest attenuation effect was seen for oblique treatment angles using low energy and small field sizes, 6.6 percent for the Elekta table top and 8.4 percent for Siemens table top. In this paper we show that customized table and base plate templates introduced in the patient treatment plan can accurately model the attenuation due to their presence to within 0.3 percent. Since dose modifications due to such carbon fiber accessories can be significant, it can be concluded that introduction of customized table and base plate templates into TPS brings an important improvement to patient treatment planning, and should be included in dose calculations whenever possible. (author).

Environmental Regulatory Update Table, December 1989

International Nuclear Information System (INIS)

Houlbert, L.M.; Langston, M.E.; Nikbakht, A.; Salk, M.S.

1990-01-01

The Environmental Regulatory Update Table provides information on regulatory initiatives of interest to DOE operations and contractor staff with environmental management responsibilities. The table is updated each month with information from the Federal Register and other sources, including direct contact with regulatory agencies. Each table entry provides a chronological record of the rulemaking process for that initiative with an abstract and a projection of further action

Environmental regulatory update table, March 1989

International Nuclear Information System (INIS)

Houlberg, L.; Langston, M.E.; Nikbakht, A.; Salk, M.S.

1989-04-01

The Environmental Regulatory Update Table provides information on regulatory initiatives of interest to DOE operations and contractor staff with environmental management responsibilities. The table is updated each month with information from the Federal Register and other sources, including direct contact with regulatory agencies. Each table entry provides a chronological record of the rulemaking process for that initiative with an abstract and a projection of further action

Environmental Regulatory Update Table, April 1989

International Nuclear Information System (INIS)

Houlberg, L.; Langston, M.E.; Nikbakht, A.; Salk, M.S.

1989-05-01

The Environmental Regulatory Update Table provides information on regulatory initiatives of interest to DOE operations and contractor staff with environmental management responsibilities. The table is updated each month with information from the Federal Register and other sources, including direct contact with regulatory agencies. Each table entry provides a chronological record of the rulemaking process for that initiative with an abstract and a projection of further action

Environmental Regulatory Update Table, December 1991

Energy Technology Data Exchange (ETDEWEB)

Houlberg, L.M.; Hawkins, G.T.; Salk, M.S.

1992-01-01

The Environmental Regulatory Update Table provides information on regulatory initiatives of interest to DOE operations and contractor staff with environmental management responsibilities. The table is updated each month with information from the Federal Register and other sources, including direct contact with regulatory agencies. Each table entry provides a chronological record of the rulemaking process for that initiative with an abstract and a projection of further action.

Environmental Regulatory Update Table, August 1990

International Nuclear Information System (INIS)

Houlberg, L.M.; Nikbakht, A.; Salk, M.S.

1990-09-01

The Environmental Regulatory Update Table provides information on regulatory initiatives of interest to DOE operations and contractor staff with environmental management responsibilities. The table is updated each month with information from the Federal Register and other sources, including direct contact with regulatory agencies. Each table entry provides a chronological record of the rulemaking process for that initiative with an abstract and a projection of further action

Environmental Regulatory Update Table, October 1991

Energy Technology Data Exchange (ETDEWEB)

Houlberg, L.M.; Hawkins, G.T.; Salk, M.S.

1991-11-01

The Environmental Regulatory Update Table provides information on regulatory initiatives of interest to DOE operations and contractor staff with environmental management responsibilities. The table is updated each month with information from the Federal Register and other sources, including direct contact with regulatory agencies. Each table entry provides a chronological record of the rulemaking process for that initiative with an abstract and a projection of further action.

Environmental Regulatory Update Table, November 1991

Energy Technology Data Exchange (ETDEWEB)

Houlberg, L.M.; Hawkins, G.T.; Salk, M.S.

1991-12-01

The Environmental Regulatory Update Table provides information on regulatory initiatives of interest to DOE operations and contractor staff with environmental management responsibilities. The table is updated each month with information from the Federal Register and other sources, including direct contact with regulatory agencies. Each table entry provides a chronological record of the rulemaking process for that initiative with an abstract and a projection of further action.

Environmental Regulatory Update Table, September 1991

Energy Technology Data Exchange (ETDEWEB)

Houlberg, L.M.; Hawkins, G.T.; Salk, M.S.

1991-10-01

The Environmental Regulatory Update Table provides information on regulatory initiatives of interest to DOE operations and contractor staff with environmental management responsibilities. The table is updated each month with information from the Federal Register and other sources, including direct contact with regulatory agencies. Each table entry provides a chronological record of the rulemaking process for that initiative with an abstract and a projection of further action.

A greedy algorithm for construction of decision trees for tables with many-valued decisions - A comparative study

KAUST Repository

Azad, Mohammad

2013-11-25

In the paper, we study a greedy algorithm for construction of decision trees. This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions. For a given row, we should find a decision from the set attached to this row. Experimental results for data sets from UCI Machine Learning Repository and randomly generated tables are presented. We make a comparative study of the depth and average depth of the constructed decision trees for proposed approach and approach based on generalized decision. The obtained results show that the proposed approach can be useful from the point of view of knowledge representation and algorithm construction.

A greedy algorithm for construction of decision trees for tables with many-valued decisions - A comparative study

KAUST Repository

Azad, Mohammad; Chikalov, Igor; Moshkov, Mikhail; Zielosko, Beata

2013-01-01

In the paper, we study a greedy algorithm for construction of decision trees. This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions. For a given row, we should find a decision from the set attached to this row. Experimental results for data sets from UCI Machine Learning Repository and randomly generated tables are presented. We make a comparative study of the depth and average depth of the constructed decision trees for proposed approach and approach based on generalized decision. The obtained results show that the proposed approach can be useful from the point of view of knowledge representation and algorithm construction.

OPTIMIZING THE PLACEMENT OF A WORK-PIECE AT A MULTI-POSITION ROTARY TABLE OF TRANSFER MACHINE WITH VERTICAL MULTI-SPINDLE HEAD

Directory of Open Access Journals (Sweden)

N. N. Guschinski

2015-01-01

Full Text Available The problem of minimizing the weight of transfer machine with a multi-position rotary table by placing of a work-piece at the table for processing of homogeneous batch of work-pieces is considered. To solve this problem the mathematical model and heuristic particle swarm optimization algorithm are proposed. The results of numerical experiments for two real problems of this type are given. The experiments revealed that the particle swarm optimization algorithm is more effective for the solution of the problem compared to the methods of random search and LP-search.

Environmental Regulatory Update Table, January/February 1992

Energy Technology Data Exchange (ETDEWEB)

Houlberg, L.M.; Hawkins, G.T.; Salk, M.S.

1992-03-01

The Environmental Regulatory Update Table provides information on regulatory initiatives of interest to DOE operations and contractor staff with environmental management responsibilities. The table is updated bi-monthly with information from the Federal Register and other sources, including direct contact with regulatory agencies. Each table entry provides a chronological record of the rulemaking process for that initiative with an abstract and a projection of further action. This table is for January/February 1992.

Environmental Regulatory Update Table, August 1991

Energy Technology Data Exchange (ETDEWEB)

Houlberg, L.M., Hawkins, G.T.; Salk, M.S.

1991-09-01

This Environmental Regulatory Update Table (August 1991) provides information on regulatory initiatives of interest to DOE operations and contractor staff with environmental management responsibilities. The table is updated each month with information from the Federal Register and other sources, including direct contact with regulatory agencies. Each table entry provides a chronological record of the rulemaking process for that initiative with an abstract and a projection of further action.

Environmental regulatory update table, July 1991

Energy Technology Data Exchange (ETDEWEB)

Houlberg, L.M.; Hawkins, G.T.; Salk, M.S.

1991-08-01

This Environmental Regulatory Update Table (July 1991) provides information on regulatory initiatives of interest to DOE operations and contractor staff with environmental management responsibilities. The table is updated each month with information from the Federal Register and other sources, including direct contact with regulatory agencies. Each table entry provides a chronological record of the rulemaking process for that initiative with an abstract and a projection of further action.

On generating neutron transport tables with the NJOY system

International Nuclear Information System (INIS)

Caldeira, Alexandre D.; Claro, Luiz H.

2013-01-01

Incorrect values for the product of the average number of neutrons released per fission and the fission microscopic cross-section were detected in several energy groups of a neutron transport table generated with the most updated version of the NJOY system. It was verified that the problem persists when older versions of this system are utilized. Although this problem exists for, at least, ten years, it is still an open question. (author)

The Shock and Vibration Digest. Volume 18, Number 12

Science.gov (United States)

1986-12-01

Sfstem Subjected to Random Excitation K. Sato , S. Yamamoto, O. Kamada, N. Takatsu Utsuncmiya Univ., Utsunomiya, Japan Bull. JSME, 22 (251), pp... Sato Tokyo Institute of Technology, Yokohama, Japan Bull. JSME, IS! (251), pp 1605-1611 (May 1986) 15 figs, 2 tables, 18 refs KEY WORDS...Matiunaga, T Mattuahita, Mikio Matiuuchi, Kazuo Matteucci, M Matyiiak, S.J Matzen, V.C May, R.A Mayct , M.J Maye» , R.L 1340, Maye», W.H

Stimulus number, duration and intensity encoding in randomly connected attractor networks with synaptic depression

Directory of Open Access Journals (Sweden)

Paul eMiller

2013-05-01

Full Text Available Randomly connected recurrent networks of excitatory groups of neurons can possess a multitude of attractor states. When the internal excitatory synapses of these networks are depressing, the attractor states can be destabilized with increasing input. This leads to an itinerancy, where with either repeated transient stimuli, or increasing duration of a single stimulus, the network activity advances through sequences of attractor states. We find that the resulting network state, which persists beyond stimulus offset, can encode the number of stimuli presented via a distributed representation of neural activity with non-monotonic tuning curves for most neurons. Increased duration of a single stimulus is encoded via different distributed representations, so unlike an integrator, the network distinguishes separate successive presentations of a short stimulus from a single presentation of a longer stimulus with equal total duration. Moreover, different amplitudes of stimulus cause new, distinct activity patterns, such that changes in stimulus number, duration and amplitude can be distinguished from each other. These properties of the network depend on dynamic depressing synapses, as they disappear if synapses are static. Thus short-term synaptic depression allows a network to store separately the different dynamic properties of a spatially constant stimulus.

Global Reference Tables for Production Systems

Data.gov (United States)

Social Security Administration — This database is a collection of reference tables that store common information used throughout SSA. These tables standardized code structures and code usage of SSA...

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.

The Periodic Table in Croatia

Directory of Open Access Journals (Sweden)

Raos, N.

2011-12-01

Full Text Available The Croatian (Yugoslav Academy of Sciences and Arts was the first academy to elect D. I. Mendeleev as its honorary member (1882, whereas the periodic table of the elements has been taught regularly at the Zagreb University since 1888. The early interest of Croatian chemists in the periodic table should be attributed primarily to their pan-Slavic attitude, particularly as proof that Slavic people were able to produce "their own Newtons" (M. V. Lomonosov and D. I. Mendeleev. Such enthusiastic views, however, did not help in analyzing the contribution of Mendeleev and other scientists to the discovery and development of the periodic table of the elements.

Scenario-based table top simulations

DEFF Research Database (Denmark)

Broberg, Ole; Edwards, Kasper; Nielsen, J.

2012-01-01

This study developed and tested a scenario-based table top simulation method in a user-driven innovation setting. A team of researchers worked together with a user group of five medical staff members from the existing clinic. Table top simulations of a new clinic were carried out in a simple model...

Scanning table BIP 101 for bubble chamber pictures

International Nuclear Information System (INIS)

Calmels, C.