RNG: A Practitioner's Overview Random Number Generation
Mascagni, Michael
RNG: A Practitioner's Overview Random Number Generation A Practitioner's Overview Prof. Michael and Monte Carlo Methods Pseudorandom number generation Types of pseudorandom numbers Properties of these pseudorandom numbers Parallelization of pseudorandom number generators New directions for SPRNG Quasirandom
Random number stride in Monte Carlo calculations
Hendricks, J.S.
1990-01-01T23:59:59.000Z
Monte Carlo radiation transport codes use a sequence of pseudorandom numbers to sample from probability distributions. A common practice is to start each source particle a predetermined number of random numbers up the pseudorandom number sequence. This number of random numbers skipped between each source particles the random number stride, S. Consequently, the jth source particle always starts with the j{center dot}Sth random number providing correlated sampling'' between similar calculations. A new machine-portable random number generator has been written for the Monte Carlo radiation transport code MCNP providing user's control of the random number stride. First the new MCNP random number generator algorithm will be described and then the effects of varying the stride will be presented. 2 refs., 1 fig.
High speed optical quantum random number generation
Weinfurter, Harald
High speed optical quantum random number generation Martin F¨urst1,2,, Henning Weier1,2, Sebastian, ready-for-use quantum random number generator (QRNG) whose stochastic model is based on the ran- domness directly delivered to a PC, generated at a rate of up to 50 Mbit/s, clearly pass all tests relevant
True random numbers from amplified quantum vacuum
M. Jofre; M. Curty; F. Steinlechner; G. Anzolin; J. P. Torres; M. W. Mitchell; V. Pruneri
2011-10-17T23:59:59.000Z
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.
Types of random numbers and Monte Carlo Methods Pseudorandom number generation
Mascagni, Michael
Types of random numbers and Monte Carlo Methods Pseudorandom number generation Quasirandom number generation Conclusions WE246: Random Number Generation A Practitioner's Overview Prof. Michael Mascagni #12;Types of random numbers and Monte Carlo Methods Pseudorandom number generation Quasirandom number
Resolution-Stationary Random Number Generators
L'Ecuyer, Pierre
of successive output values over their entire period length. For F2-linear generators, the commonly adopted efficient ways of implementing high-quality and long-period Tausworthe generators. Key words: random number un [0, 1) is the output of the generator at step n and the number of bits in this output, L
A self-testing quantum random number generator
Tommaso Lunghi; Jonatan Bohr Brask; Charles Ci Wen Lim; Quentin Lavigne; Joseph Bowles; Anthony Martin; Hugo Zbinden; Nicolas Brunner
2014-10-10T23:59:59.000Z
A central issue in randomness generation is to estimate the entropy of the output data generated by a given device. Here we present a protocol for self-testing quantum random number generation, in which the entropy of the raw data can be monitored in real-time. In turn, this allows the user to adapt the randomness extraction procedure, in order to continuously generate high quality random bits. Using a fully optical implementation, we demonstrate that our protocol is practical and efficient, and illustrate its self-testing capacity.
Maximization of Extractable Randomness in a Quantum Random-Number Generator
J. Y. Haw; S. M. Assad; A. M. Lance; N. H. Y. Ng; V. Sharma; P. K. Lam; T. Symul
2015-05-19T23:59:59.000Z
The generation of random numbers via quantum processes is an efficient and reliable method to obtain true indeterministic random numbers that are of vital importance to cryptographic communication and large-scale computer modeling. However, in realistic scenarios, the raw output of a quantum random-number generator is inevitably tainted by classical technical noise. The integrity of the device can be compromised if this noise is tampered with, or even controlled by some malicious party. To safeguard against this, we propose and experimentally demonstrate an approach that produces side-information independent randomness that is quantified by min-entropy conditioned on this classical noise. We present a method for maximizing the conditional min-entropy of the number sequence generated from a given quantum-to-classical-noise ratio. The detected photocurrent in our experiment is shown to have a real-time random-number generation rate of 14 (Mbit/s)/MHz. The spectral response of the detection system shows the potential to deliver more than 70 Gbit/s of random numbers in our experimental setup.
True Random Number Generators Secure in a Changing Environment
Shaltiel, Ronen
, which is applied to the highentropy source in order to obtain an output string that is shorterTrue Random Number Generators Secure in a Changing Environment Boaz Barak, Ronen Shaltiel, and Eran, ISRAEL Email: {boaz,ronens,tromer}@wisdom.weizmann.ac.il Abstract. A true random number generator (TRNG
Turing's normal numbers: towards randomness Veronica Becher
presumably in 1938 Alan Turing gave an algorithm that produces real numbers normal to every integer base- putable normal numbers, and this result should be attributed to Alan Turing. His manuscript entitled "A
Noncolliding system of continuous-time random walks
Syota Esaki
2014-09-29T23:59:59.000Z
The continuous-time random walk is defined as a Poissonization of discrete-time random walk. We study the noncolliding system of continuous-time simple and symmetric random walks on ${\\mathbb{Z}}$. We show that the system is determinantal for any finite initial configuration without multiple point. The spatio-temporal correlation kernel is expressed by using the modified Bessel functions. We extend the system to the noncolliding process with an infinite number of particles, when the initial configuration has equidistant spacing of particles, and show a relaxation phenomenon to the equilibrium determinantal point process with the sine kernel.
Improving random number generators by chaotic Application in data hiding
Paris-Sud XI, Université de
the NIST (National Institute of Standards and Technology of the U.S. Government) battery of tests [10 battery of tests [8]. And its security is improved compared to XORshift alone, and to our former PRNG-random numbers in the field of data hiding is detailed. An analysis focuses on the watermarked images which have
Multi-bit quantum random number generation by measuring positions of arrival photons
Yan, Qiurong, E-mail: yanqiurong@ncu.edu.cn [Department of Electronics Information Engineering, Nanchang University, Nanchang 330031 (China); State Key Laboratory of Transient Optics and Photonics, Xi'an Institute of Optics and Precision Mechanics, Chinese Academy of Sciences, Xi'an 710119 (China); Zhao, Baosheng [State Key Laboratory of Transient Optics and Photonics, Xi'an Institute of Optics and Precision Mechanics, Chinese Academy of Sciences, Xi'an 710119 (China); Liao, Qinghong; Zhou, Nanrun [Department of Electronics Information Engineering, Nanchang University, Nanchang 330031 (China)
2014-10-15T23:59:59.000Z
We report upon the realization of a novel multi-bit optical quantum random number generator by continuously measuring the arrival positions of photon emitted from a LED using MCP-based WSA photon counting imaging detector. A spatial encoding method is proposed to extract multi-bits random number from the position coordinates of each detected photon. The randomness of bits sequence relies on the intrinsic randomness of the quantum physical processes of photonic emission and subsequent photoelectric conversion. A prototype has been built and the random bit generation rate could reach 8 Mbit/s, with random bit generation efficiency of 16 bits per detected photon. FPGA implementation of Huffman coding is proposed to reduce the bias of raw extracted random bits. The random numbers passed all tests for physical random number generator.
On-Line Monitoring of Random Number Generators for Embedded Security
Paris-Sud XI, UniversitĂ© de
On-Line Monitoring of Random Number Generators for Embedded Security Renaud Santoro, Olivier@gel.ulaval.ca Abstract-- Many embedded security chips require a high- quality Random Number Generator (RNG for randomness. The battery is selected for its efficient imple- mentation, making the area and power consumption
Chaotic oscillation and random-number generation based on nanoscale optical-energy transfer
Makoto Naruse; Song-Ju Kim; Masashi Aono; Hirokazu Hori; Motoichi Ohtsu
2014-12-19T23:59:59.000Z
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.
Chaotic oscillation and random-number generation based on nanoscale optical-energy transfer
Naruse, Makoto; Aono, Masashi; Hori, Hirokazu; Ohtsu, Motoichi
2014-01-01T23:59:59.000Z
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 (R...
Finite-time Lyapunov exponent for a random Ehrenfest gas
Sanjay Moudgalya; Sarthak Chandra; Sudhir R. Jain
2014-09-04T23:59:59.000Z
We consider the motion of a system of free particles moving in a plane with hard scatterers of regular polygonal shape arranged in a random manner. Calling this the Ehrenfest gas which is known to be pseudo-integrable, we propose a finite-time Lyapunov exponent characterizing the dynamics. In the limit of large number of vertices, where polygon tends to a circle, we recover the Lyapunov exponent for the Lorentz gas. To obtain this result, we generalized the reflection law of a pencil of rays incident on a polygonal scatterer in a way that the formula for the circular scatterer is recovered in the limit of infinite vertices. Thus, seemingly paradoxically, chaos seems to emerge from pseudo-chaos.
Imaging and time reversal in random media Liliana Borcea
Papanicolaou, George C.
-separated scatterers in a randomly inhomogeneous environment using an active sensor array. The main features decomposition of the array response matrix in the frequency domain, and (iii) the construction of an objective of the medium. This is a new approach to array imaging that is motivated by time reversal in random media
The random Schrödinger equation: homogenization in time-dependent potentials
Yu Gu; Lenya Ryzhik
2015-06-08T23:59:59.000Z
We analyze the solutions of the Schr\\"odinger equation with the low frequency initial data and a time-dependent weakly random potential. We prove a homogenization result for the low frequency component of the wave field. We also show that the dynamics generates a non-trivial energy in the high frequencies, which do not homogenize -- the high frequency component of the wave field remains random and the evolution of its energy is described by a kinetic equation. The transition from the homogenization of the low frequencies to the random limit of the high frequencies is illustrated by understanding the size of the small random fluctuations of the low frequency component.
Time-Lock Puzzles from Randomized Encodings Nir Bitansky
International Association for Cryptologic Research (IACR)
Time-Lock Puzzles from Randomized Encodings Nir Bitansky Shafi Goldwasser Abhishek Jain Omer Paneth§ Vinod Vaikuntanathan¶ Brent Waters May 27, 2015 Abstract Time-lock puzzles, introduced by May, Rivest a puzzle with a solution s that remains hidden until a moderately large amount of time t has elapsed
A Study of Entropy Sources in Cloud Random Number Generation on Cloud Hosts
Chen, Yu
A Study of Entropy Sources in Cloud Computers: Random Number Generation on Cloud Hosts Brendan Kerrigan and Yu Chen Dept. of Electrical and Computer Engineering, SUNY - Binghamton Abstract. Cloud of Cloud computers reliance on virtualization, access to the hardware based random number generator
Imaging and time reversal in random media Liliana Borcea
Tsogka, Chrysoula
of small, well-separated scatterers in a randomly inhomogeneous environment using an active sensor array) the construction of an objective function in the time domain that is statistically stable and peaks individual realizations of the medium. This is a new approach to array imaging that is motivated by time
Trading Infinite Memory for Uniform Randomness in Timed Games
Henzinger, Thomas A.
restriction on the game structure, and gives both players equally powerful options for advancing time specified as parity conditions. These games offer an appropriate model for the synthesis of real randomized real- time controllers are much simpler in structure than the corresponding pure controllers
Trading Infinite Memory for Uniform Randomness in Timed Games #
Henzinger, Thomas A.
restriction on the game structure, and gives both players equally powerful options for advancing time objectives specified as parity conditions. These games o#er an appropriate model for the synthesis of real randomized real time controllers are much simpler in structure than the corresponding pure controllers
Generation of fresh and pure random numbers for loophole-free Bell tests
Carlos Abellan; Waldimar Amaya; Daniel Mitrani; Valerio Pruneri; Morgan W. Mitchell
2015-06-08T23:59:59.000Z
Quantum nonlocality is one of the most striking predictions to emerge from quantum theory, and has not been demonstrated unambiguously. Beyond its fundamental interest, a loophole-free Bell test would enable powerful "device independent" information protocols, guaranteed by the impossibility of faster-than-light communication. Current efforts to simultaneously close the detection, locality, and freedom of choice (FoC) loopholes require random number generation (RNG) with an unprecedented combination of speed, unpredictability, and confidence. Here we combine ultra-fast RNG by accelerated laser phase diffusion with real-time randomness extraction and metrological randomness assurances to produce a RNG suitable for loophole-free Bell tests. Under paranoid assumptions we infer error rates below 1e-8 at 5{\\sigma} statistical confidence for output based on spontaneous emission events less than 50 ns old. Tb- scale statistical analysis supports the metrological assessment of extreme unpredictability. The method will enable definitive nonlocality experiments and secure communications without need of trusted devices.
Cryptanalysis of the Random Number Generator of the Windows Operating System
International Association for Cryptologic Research (IACR)
Cryptanalysis of the Random Number Generator of the Windows Operating System Leo Dorrendorf School by the Windows operating system is the most commonly used PRNG. The pseudo-randomness of the output the second most popular operating system after Windows XP. (This investigation was done without any help from
Random Boolean networks with number of parents generated by certain probability distributions
Matache, Dora
Random Boolean networks with number of parents generated by certain probability distributions Ray A following a Power Law distribution. Others have examined how highly connected networks use a Popularity network where the number of parents are obtained using a Power Law distribution and are connected based
Random Number Hardware Generator Using Geiger-Mode Avalanche Photo Detector
Beznosko, D; Duspayev, A; Tailakov, A; Yessenov, M
2015-01-01T23:59:59.000Z
This paper presents the physical concept and test results of sample data of the high-speed hardware true random number generator design based on typically used for High Energy Physics hardware. Main features of this concept are the high speed of the true random numbers generation (tens of Mbt/s), miniature size and estimated lower production cost. This allows the use of such a device not only in large companies and government offices but for the end-user data cryptography, in classrooms, in scientific Monte-Carlo simulations, computer games and any other place where large number of true random numbers is required. The physics of the operations principle of using a Geiger-mode avalanche photo detector is discussed and the high quality of the data collected is demonstrated.
Robust random number generation using steady-state emission of gain-switched laser diodes
Z. L. Yuan; M. Lucamarini; J. F. Dynes; B. Frohlich; A. Plews; A. J. Shields
2014-07-03T23:59:59.000Z
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.
Continuous time random walk models for fractional space-time diffusion equations
Sabir Umarov
2014-09-14T23:59:59.000Z
In this paper continuous time random walk models approximating fractional space-time diffusion processes are studied. Stochastic processes associated with the considered equations represent time-changed processes, where the time-change process is a L\\'evy's stable subordinator with the stability index $\\beta \\in (0,1).$ In the parer the convergence of constructed CTRWs to time-changed processes associated with the corresponding fractional diffusion equations are proved using a new analytic method.
An On-Demand Optical Quantum Random Number Generator with In-Future Action and Ultra-Fast Response
Mario Stip?evi?; Rupert Ursin
2015-06-09T23:59:59.000Z
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.
Continuous Time Random Walk and Migration Proliferation Dichotomy
A. Iomin
2015-04-03T23:59:59.000Z
A theory of fractional kinetics of glial cancer cells is presented. A role of the migration-proliferation dichotomy in the fractional cancer cell dynamics in the outer-invasive zone is discussed an explained in the framework of a continuous time random walk. The main suggested model is based on a construction of a 3D comb model, where the migration-proliferation dichotomy becomes naturally apparent and the outer-invasive zone of glioma cancer is considered as a fractal composite with a fractal dimension $\\frD<3$.
A Pseudo-Random Number Generator for Spreadsheets Research Note, Jan 2013
California at Berkeley, University of
cell for its argument or seed; · Output spans 0generators NORMINV, TINV and high level languages. Generators designed for cryptography must pass exceedingly demanding tests; see LA Pseudo-Random Number Generator for Spreadsheets Research Note, Jan 2013 Michael Lampton, Space
On the design of a family of CI pseudo-random number generators
Bahi, Jacques M; Guyeux, Christophe; Wang, Qianxue
2011-01-01T23:59:59.000Z
Chaos and its applications in the field of secure communications have attracted a lot of attention. Chaos-based pseudo-random number generators are critical to guarantee security over open networks as the Internet. We have previously demonstrated that it is possible to define such generators with good statistical properties by using a tool called "chaotic iterations", which depends on an iteration function. An approach to find update functions such that the associated generator presents a random-like and chaotic behavior is proposed in this research work. To do so, we use the vectorial Boolean negation as a prototype and explain how to modify this iteration function without deflating the good properties of the associated generator. Simulation results and basic security analysis are then presented to evaluate the randomness of this new family of generators.
A Pseudo Random Numbers Generator Based on Chaotic Iterations. Application to Watermarking
Christophe Guyeux; Qianxue Wang; Jacques M. Bahi
2010-12-21T23:59:59.000Z
In this paper, a new chaotic pseudo-random number generator (PRNG) is proposed. It combines the well-known ISAAC and XORshift generators with chaotic iterations. This PRNG possesses important properties of topological chaos and can successfully pass NIST and TestU01 batteries of tests. This makes our generator suitable for information security applications like cryptography. As an illustrative example, an application in the field of watermarking is presented.
Constructing numbers through moments in time: Kant's philosophy of mathematics
Wilson, Paul Anthony
2004-11-15T23:59:59.000Z
CONSTRUCTING NUMBERS THROUGH MOMENTS IN TIME: KANT?S PHILOSOPHY OF MATHEMATICS A Thesis by PAUL ANTHONY WILSON Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment... of the requirements for the degree of MASTER OF ARTS August 2003 Major Subject: Philosophy CONSTRUCTING NUMBERS THROUGH MOMENTS IN TIME: KANT?S PHILOSOPHY OF MATHEMATICS A Thesis by PAUL ANTHONY WILSON...
Wojciech H. Zurek
2014-10-01T23:59:59.000Z
I show that random distributions of vortex-antivortex pairs (rather than of individual vortices) lead to scaling of typical winding numbers W trapped inside a loop of circumference C with the square root of C when the expected winding numbers are large. Such scaling is consistent with the Kibble-Zurek mechanism (KZM). By contrast, distribution of individual vortices with randomly assigned topological charges would result in the dispersion of W scaling with the square root of the area inside C. Scaling of the dispersion of W and of the probability of detection of non-zero W with C can be also studied for loops so small that non-zero windings are rare. In this case I show a doubling of the scaling of dispersion with C when compared to the scaling of dispersion in the large W regime. Moreover, probability of trapping of a non-zero W becomes, in this case, proportional to the area subtended by C (hence, to the square of circumference). This quadruples, as compared with large winding numbers regime, the exponent in the power law dependence of the frequency of trapping of W=+1 or W=-1 on C. Such change of the power law exponent by a FACTOR OF FOUR implies quadrupling of the scaling of the frequency of winding number trapping with the quench rate, and is of key importance for experimental tests of KZM.
An N Server Cutoff Priority Queue Where Customers Request a Random Number of Servers
Schaack, Christian
Consider a multi-priority, nonpreemptive, N-server Poisson arrival queueing system. The number of servers requested by an arrival has a known probability distribution. Service times are negative exponential. In order to ...
Mario Stip?evi?; John Bowers
2014-10-09T23:59:59.000Z
We present a random number generator based on quantum effects in photonic emission and detection. It is unique in simultaneous use of both spatial and temporal quantum information contained in the system which makes it resilient to hardware failure and signal injection attacks. We show that its deviation from randomness cam be estimated based on simple measurements. Generated numbers pass NIST Statistical test suite without post-processing.
The cover time of sparse random graphs. Colin Cooper
Cooper, Colin
that CG n log n log log n. The challenge is to find a technique which can make an accurate average case) 2|E(H)| is the steady state of a random walk on H. NG(v) is the set of neighbours of v in G. If H
Exceptional Times and Invariance for Dynamical Random Walks
Khoshnevisan, Davar
, for all com- pact, non-random E [0,1], sup tE limsup n (Sn(t))2 -2nlnlnn nlnlnlnn = 3+2dimP E, where dimP denotes "packing dimension." When E = {0} (any singleton will do) dimP E = 0, and we obtain a classical result of Kolmogorov. On the other hand, dimP [0,1] = 1, and this yields an earlie
Joint asymptotic behavior of local and occupation times of random walk in higher dimension
Csáki, Endre
Joint asymptotic behavior of local and occupation times of random walk in higher dimension Endre behavior of two objects: #28;rst the local times of a pair of neighboring points, then the local time of a point and the occupation time of the surface of the unit ball around it. AMS 2000 Subject Classi#28
Lifetime, turnover time, and fast magnetic field regeneration in random flows
Tanner, S. E. M. [School of Mathematical Sciences, Dublin City University, Dublin 9 (Ireland)
2007-10-15T23:59:59.000Z
The fast dynamo is thought to be relevant in the regeneration of magnetic fields in astrophysics where the value of the magnetic Reynolds number (Rm) is immense. The fast dynamo picture is one in which chaotic flows provide a mechanism for the stretching of magnetic field lines. Furthermore, a cascade of energy down to small scales results in intermittent regions of a small-scale, intense magnetic field. Given this scenario it is natural to invoke the use of kinematic random flows in order to understand field regeneration mechanisms better. Here a family of random flows is used to study the effects that L, the lifetime of the cell, and {tau}, the turnover time of the cell, may have on magnetic field regeneration. Defining the parameter {gamma}=L/{tau}, it has been varied according to {gamma}>1, {gamma}<1, {gamma}{approx}O(1). In the kinematic regime, dynamo growth rates and Lyapunov exponents are examined at varying values of Rm. The possibility of fast dynamo action is considered. In the nonlinear regime, magnetic and kinetic energies are examined. Results indicate that there does appear to be a relationship between {gamma} and dynamo efficiency. In particular, the most efficient dynamos seem to operate at lower values of {gamma}.
Packet acquisition for time-frequency hopped asynchronous random multiple access
Nguyen, Hoang
Packet acquisition for a time-frequency hopped asynchronous random multiple access (RMA) system is investigated. A novel analytical approach to performance evaluation is provided, which enables the waveform designer to ...
Mahesh C Shastry; Nithin Nagaraj; Prabhakar G Vaidya
2006-07-17T23:59:59.000Z
A 1-dimensional generalization of the well known Logistic Map is proposed. The proposed family of maps is referred to as the B-Exponential Map. The dynamics of this map are analyzed and found to have interesting properties. In particular, the B-Exponential Map exhibits robust chaos for all real values of the parameter B >= e^(-4). We then propose a pseudo-random number generator based on the B-Exponential Map by chaotically hopping between different trajectories for different values of B. We call this BEACH (B-Exponential All-Chaotic Map Hopping) pseudo-random number generator. BEACH successfully passes stringent statistical randomness tests such as ENT, NIST and Diehard. An implementation of BEACH is also outlined.
Number of first-passage times as a measurement of information for weakly chaotic systems
Pierre Nazé; Roberto Venegeroles
2014-10-21T23:59:59.000Z
We consider a general class of maps of the interval having Lyapunov subexponential instability $|\\delta x_{t}|\\sim|\\delta x_{0}|\\exp[\\Lambda_{t}(x_{0})\\zeta(t)]$, where $\\zeta(t)$ grows sublinearly as $t\\rightarrow\\infty$. We outline here a scheme [J. Stat. Phys. {\\bf 154}, 988 (2014)] whereby the choice of a characteristic function automatically defines the map equation and corresponding growth rate $\\zeta(t)$. This matching approach is based on the infinite measure property of such systems. We show that the average information that is necessary to record without ambiguity a trajectory of the system tends to $\\langle\\Lambda\\rangle\\zeta(t)$, suitably extending the Kolmogorov-Sinai entropy and Pesin's identity. For such systems, information behaves like a random variable for random initial conditions, its statistics obeying a universal Mittag-Leffler law. We show that, for individual trajectories, information can be accurately inferred by the number of first-passage times through a given turbulent phase space cell. This enables us to calculate far more efficiently Lyapunov exponents for such systems. Lastly, we also show that the usual renewal description of jumps to the turbulent cell, usually employed in the literature, does not provide the real number of entrances there. Our results are supported by exhaustive numerical simulations.
Papanicolaou, George C.
, wellseparated scatterers in a randomly inhomogeneous environment using an active sensor array) the construction of an objective function in the time domain that is statistically stable and peaks individual realizations of the medium. This is a new approach to array imaging that is motivated by time
Scalable parallel physical random number generator based on a superluminescent LED
Li, Xiaowen; Murphy, Thomas E; Roy, Rajarshi
2011-01-01T23:59:59.000Z
We describe an optoelectronic system for simultaneously generating parallel, independent streams of random bits using spectrally separated noise signals obtained from a single optical source. Using a pair of non-overlapping spectral filters and a fiber-coupled superluminescent light-emitting diode (SLED), we produced two independent 10 Gb/s random bit streams, for a cumulative generation rate of 20 Gb/s. The system relies principally on chip-based optoelectronic components that could be integrated in a compact, economical package.
Integrating Random Matrix Theory Predictions with Short-Time Dynamical Effects in Chaotic Systems
A. Matthew Smith; Lev Kaplan
2010-06-29T23:59:59.000Z
We discuss a modification to Random Matrix Theory eigenstate statistics, that systematically takes into account the non-universal short-time behavior of chaotic systems. The method avoids diagonalization of the Hamiltonian, instead requiring only a knowledge of short-time dynamics for a chaotic system or ensemble of similar systems. Standard Random Matrix Theory and semiclassical predictions are recovered in the limits of zero Ehrenfest time and infinite Heisenberg time, respectively. As examples, we discuss wave function autocorrelations and cross-correlations, and show that significant improvement in accuracy is obtained for simple chaotic systems where comparison can be made with brute-force diagonalization. The accuracy of the method persists even when the short-time dynamics of the system or ensemble is known only in a classical approximation. Further improvement in the rate of convergence is obtained when the method is combined with the correlation function bootstrapping approach introduced previously.
Randomly accelerated particle in a box: Mean absorption time for partially absorbing and inelastic accelerated particle which moves on the half line x 0 with an absorbing boundary at x=0. The motion, Philadelphia, Pennsylvania 19122, USA Received 11 February 2005; published 13 April 2005 Consider a particle
Francine Luppé; Jean-Marc Conoir; Andrew N. Norris
2011-10-06T23:59:59.000Z
The dispersion relation is derived for the coherent waves in fluid or elastic media supporting viscous and thermal effects and containing randomly distributed spherical scatterers. The formula obtained is the generalization of Lloyd and Berry's [Proc. Phys. Soc. Lond. 91, 678-688, 1067], the latter being limited to fluid host media, and it is the three-dimensional counterpart of that derived by Conoir and Norris [Wave Motion 47, 183-197, 2010] for cylindrical scatterers in an elastic host medium.
The limit of small Rossby numbers for randomly forced quasi-geostrophic equation on $?$-plane
Sergei Kuksin; Alberto Maiocchi
2014-09-26T23:59:59.000Z
We consider the 2d quasigeostrophic equation on the $\\beta$-plane for the stream function $\\psi$, with dissipation and a random force: $$ (*)\\qquad (-\\Delta +K)\\psi_t - \\rho J(\\psi, \\Delta\\psi) -\\beta\\psi_x= \\langle \\text{random force}\\rangle -\\kappa\\Delta^2\\psi +\\Delta\\psi, $$ where $\\psi=\\psi(t,x,y), \\ x\\in\\mathbb{R}/2\\pi L\\mathbb{Z}, \\ y\\in \\mathbb{R}/2\\pi \\mathbb{Z}$. For typical values of the horizontal period $L$ we prove that the law of the action-vector of a solution for $(*)$ (formed by the halves of the squared norms of its complex Fourier coefficients) converges, as $\\beta\\to\\infty$, to the law of an action-vector for solution of an auxiliary effective equation, and the stationary distribution of the action-vector for solutions of $(*)$ converges to that of the effective equation. Moreover, this convergence is uniform in $\\kappa\\in(0,1]$. The effective equation is an infinite system of stochastic equations which splits into invariant subsystems of complex dimension $\\le3$; each of these subsystems is an integrable hamiltonian system, coupled with a Langevin thermostat. Under the iterated limits $\\lim_{L=\\rho\\to\\infty} \\lim_{\\beta\\to\\infty}$ and $\\lim_{\\kappa\\to 0} \\lim_{\\beta\\to\\infty}$ we get similar systems. In particular, none of the three limiting systems exhibits the energy cascade to high frequencies.
Lindenberg, Katja
2011-01-01T23:59:59.000Z
-time behavior of decoupled continuous-time random walks characterized by superheavy- tailed distributions of jump processes that are widely used to model a variety of physical, geological, biological, economic
Dynamic Response of an Optomechanical System to a Stationary Random Excitation in the Time Domain
DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)
Palmer, Jeremy A.; Paez, Thomas L.
2011-01-01T23:59:59.000Z
Modern electro-optical instruments are typically designed with assemblies of optomechanical members that support optics such that alignment is maintained in service environments that include random vibration loads. This paper presents a nonlinear numerical analysis that calculates statistics for the peak lateral response of optics in an optomechanical sub-assembly subject to random excitation of the housing. The work is unique in that the prior art does not address peak response probability distribution for stationary random vibration in the time domain for a common lens-retainer-housing system with Coulomb damping. Analytical results are validated by using displacement response data from random vibration testingmore »of representative prototype sub-assemblies. A comparison of predictions to experimental results yields reasonable agreement. The Type I Asymptotic form provides the cumulative distribution function for peak response probabilities. Probabilities are calculated for actual lens centration tolerances. The probability that peak response will not exceed the centration tolerance is greater than 80% for prototype configurations where the tolerance is high (on the order of 30 micrometers). Conversely, the probability is low for those where the tolerance is less than 20 micrometers. The analysis suggests a design paradigm based on the influence of lateral stiffness on the magnitude of the response.« less
Deformation of a flexible polymer in a random flow with long correlation time
Stefano Musacchio; Dario Vincenzi
2010-12-09T23:59:59.000Z
The effects induced by long temporal correlations of the velocity gradients on the dynamics of a flexible polymer are investigated by means of theoretical and numerical analysis of the Hookean and FENE dumbbell models in a random renewing flow. For Hookean dumbbells, we show that long temporal correlations strongly suppress the Weissenberg-number dependence of the power-law tail characterising the probability density function (PDF) of the elongation. For the FENE model, the PDF becomes bimodal, and the coil-stretch transition occurs through the simultaneous drop and rise of the two peaks associated with the coiled and stretched configurations, respectively.
Semi-Markov approach to continuous time random walk limit processes
Meerschaert, Mark M
2014-01-01T23:59:59.000Z
Continuous time random walks (CTRWs) are versatile models for anomalous diffusion processes that have found widespread application in the quantitative sciences. Their scaling limits are typically non-Markovian, and the computation of their finite-dimensional distributions is an important open problem. This paper develops a general semi-Markov theory for CTRW limit processes in $\\mathbb{R}^d$ with infinitely many particle jumps (renewals) in finite time intervals. The particle jumps and waiting times can be coupled and vary with space and time. By augmenting the state space to include the scaling limits of renewal times, a CTRW limit process can be embedded in a Markov process. Explicit analytic expressions for the transition kernels of these Markov processes are then derived, which allow the computation of all finite dimensional distributions for CTRW limits. Two examples illustrate the proposed method.
DESIGNING A REAL TIME SYSTEM FOR CAR NUMBER DETECTION USING DISCRETE HOPFIELD NETWORK
Mishra, Prabhat
DESIGNING A REAL TIME SYSTEM FOR CAR NUMBER DETECTION USING DISCRETE HOPFIELD NETWORK A.BANERJEE1@yahoo.co.in Abstract The paper addresses a novel scheme for detection of car numbers from its rear end number plates. The work has extensive applications in automatic identification of cars, responsible for Cox pollution
Reichenbach, Tobias
2015-01-01T23:59:59.000Z
Frequency discrimination is a fundamental task of the auditory system. The mammalian inner ear, or cochlea, provides a place code in which different frequencies are detected at different spatial locations. However, a temporal code based on spike timing is also available: action potentials evoked in an auditory-nerve fiber by a low-frequency tone occur at a preferred phase of the stimulus-they exhibit phase locking-and thus provide temporal information about the tone's frequency. In an accompanying psychoacoustic study, and in agreement with previous experiments, we show that humans employ this temporal information for discrimination of low frequencies. How might such temporal information be read out in the brain? Here we demonstrate that recurrent random neural networks in which connections between neurons introduce characteristic time delays, and in which neurons require temporally coinciding inputs for spike initiation, can perform sharp frequency discrimination when stimulated with phase-locked inputs. Alt...
Self-intersection local times of random walks: Exponential moments in subcritical dimensions
Becker, Mathias
2010-01-01T23:59:59.000Z
Fix $p>1$, not necessarily integer, with $p(d-2)0$ that are bounded from above, possibly tending to zero. The speed is identified in terms of mixed powers of $t$ and $\\theta_t$, and the precise rate is characterized in terms of a variational formula, which is in close connection to the {\\it Gagliardo-Nirenberg inequality}. As a corollary, we obtain a large-deviation principle for $\\|\\ell_t\\|_p/(t r_t)$ for deviation functions $r_t$ satisfying $t r_t\\gg\\E[\\|\\ell_t\\|_p]$. Informally, it turns out that the random walk homogeneously squeezes in a $t$-dependent box with diameter of order $\\ll t^{1/d}$ to produce the required amount of self-intersections. Our main tool is an upper bound for the joint density of the local times of the walk.
Space-Time as an Orderparameter Manifold in Random Networks and the Emergence of Physical Points
Manfred Requardt
1999-02-11T23:59:59.000Z
In the following we are going to describe how macroscopic space-time is supposed to emerge as an orderparameter manifold or superstructure floating in a stochastic discrete network structure. As in preceeding work (mentioned below), our analysis is based on the working philosophy that both physics and the corresponding mathematics have to be genuinely discrete on the primordial (Planck scale) level. This strategy is concretely implemented in the form of cellular networks and random graphs. One of our main themes is the development of the concept of physical (proto)points as densely entangled subcomplexes of the network and their respective web, establishing something like (proto)causality. It max perhaps be said that certain parts of our programme are realisations of some old and qualitative ideas of Menger and more recent ones sketched by Smolin a couple of years ago. We briefly indicate how this two-story-concept of space-time can be used to encode the (at least in our view) existing non-local aspects of quantum theory without violating macroscopic space-time causality!
(Quantum) Space-Time as a Statistical Geometry of Lumps in Random Networks
Manfred Requardt
1999-12-15T23:59:59.000Z
In the following we undertake to describe how macroscopic space-time (or rather, a microscopic protoform of it) is supposed to emerge as a superstructure of a web of lumps in a stochastic discrete network structure. As in preceding work (mentioned below), our analysis is based on the working philosophy that both physics and the corresponding mathematics have to be genuinely discrete on the primordial (Planck scale) level. This strategy is concretely implemented in the form of \\tit{cellular networks} and \\tit{random graphs}. One of our main themes is the development of the concept of \\tit{physical (proto)points} or \\tit{lumps} as densely entangled subcomplexes of the network and their respective web, establishing something like \\tit{(proto)causality}. It may perhaps be said that certain parts of our programme are realisations of some early ideas of Menger and more recent ones sketched by Smolin a couple of years ago. We briefly indicate how this \\tit{two-story-concept} of \\tit{quantum} space-time can be used to encode the (at least in our view) existing non-local aspects of quantum theory without violating macroscopic space-time causality.
Radio Science, Volume ???, Number , Pages 110, Time Reversal of Electromagnetic Waves and
Paris 7 - Denis Diderot, Université
electromagnetic pulse at a central frequency of 2.45 GHz in a high-Q cavity. Another antenna records the stronglyRadio Science, Volume ???, Number , Pages 110, Time Reversal of Electromagnetic Waves demonstration of time-reversal focusing with electromagnetic waves in a SISO scheme. An antenna transmits a 1 µs
Continuous time random walk analysis of solute transport in fractured porous media
Cortis, Andrea; Cortis, Andrea; Birkholzer, Jens
2008-06-01T23:59:59.000Z
The objective of this work is to discuss solute transport phenomena in fractured porous media, where the macroscopic transport of contaminants in the highly permeable interconnected fractures can be strongly affected by solute exchange with the porous rock matrix. We are interested in a wide range of rock types, with matrix hydraulic conductivities varying from almost impermeable (e.g., granites) to somewhat permeable (e.g., porous sandstones). In the first case, molecular diffusion is the only transport process causing the transfer of contaminants between the fractures and the matrix blocks. In the second case, additional solute transfer occurs as a result of a combination of advective and dispersive transport mechanisms, with considerable impact on the macroscopic transport behavior. We start our study by conducting numerical tracer experiments employing a discrete (microscopic) representation of fractures and matrix. Using the discrete simulations as a surrogate for the 'correct' transport behavior, we then evaluate the accuracy of macroscopic (continuum) approaches in comparison with the discrete results. However, instead of using dual-continuum models, which are quite often used to account for this type of heterogeneity, we develop a macroscopic model based on the Continuous Time Random Walk (CTRW) framework, which characterizes the interaction between the fractured and porous rock domains by using a probability distribution function of residence times. A parametric study of how CTRW parameters evolve is presented, describing transport as a function of the hydraulic conductivity ratio between fractured and porous domains.
Kalman Filter Methods for Real-time Frequency and Mode Number Estimation of MHD Activity in Tokamak Plasmas
The question of randomness in English foot timing: a control experiment
Williams, Briony
1994-01-01T23:59:59.000Z
Isochrony has been considered only in terms of stressed syllables. However, it may also be a random property of unstressed syllables, and a control experiment was deemed necessary. A handtranscribed database of 98 sentences, ...
CM165A-01 ACM-TRANSACTION September 15, 2003 16:34 Efficient Multiply-with-Carry Random Number
Goresky, Mark
P1: GDP CM165A-01 ACM-TRANSACTION September 15, 2003 16:34 Efficient Multiply-with-Carry Random. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit be requested from Publications Dept., ACM, Inc., 1515 Broadway, New York, NY 10036 USA, fax: +1 (212) 869
Kautz, Henry
Fig. 1. Comparison of search times on original logistics problems. Fig 2. Number of variables in logistics formulas after simplification. Fig. 3. Number of clauses in logistics formulas after number of clauses log.a log.b log.c #12; Fig. 4: Solution times for walksat on logistics with different
Manfred Requardt; Sisir Roy
2001-02-13T23:59:59.000Z
We develop a kind of pregeometry consisting of a web of overlapping fuzzy lumps which interact with each other. The individual lumps are understood as certain closely entangled subgraphs (cliques) in a dynamically evolving network which, in a certain approximation, can be visualized as a time-dependent random graph. This strand of ideas is merged with another one, deriving from ideas, developed some time ago by Menger et al, that is, the concept of probabilistic- or random metric spaces, representing a natural extension of the metrical continuum into a more microscopic regime. It is our general goal to find a better adapted geometric environment for the description of microphysics. In this sense one may it also view as a dynamical randomisation of the causal-set framework developed by e.g. Sorkin et al. In doing this we incorporate, as a perhaps new aspect, various concepts from fuzzy set theory.
Paul Benioff
2015-08-07T23:59:59.000Z
The relationship between the foundations of mathematics and physics is a topic of of much interest. This paper continues this exploration by examination of the effect of space and time dependent number scaling on theoretical descriptions of some physical and geometric quantities. Fiber bundles provide a good framework to introduce a space and time or space time dependent number scaling field. The effect of the scaling field on a few nonlocal physical and geometric quantities is described. The effect on gauge theories is to introduce a new complex scalar field into the derivatives appearing in Lagrangians. U(1) invariance of Lagrangian terms does not affect the real part of the scaling field. For this field, any mass is possible. The scaling field is also shown to affect quantum wave packets and path lengths, and geodesic equations even on flat space. Scalar fields described so far in physics, are possible candidates for the scaling field. The lack of direct evidence for the field in physics restricts the scaling field in that the gradient of the field must be close to zero in a local region of cosmological space and time. There are no restrictions outside the region. It is also seen that the scaling field does not affect comparisons of computation or measurements outputs with one another. However it does affect the assignment of numerical values to the outputs of computations or measurements. These are needed because theory predictions are in terms of numerical values.
Bitar, Eilyan Yamen
2011-01-01T23:59:59.000Z
continuous time model presented in Chapter 3 and model wind power production as a discrete time random process
Chattopadhyay, Goutami; 10.1140/epjp/i2012-12043-9
2012-01-01T23:59:59.000Z
This study reports a statistical analysis of monthly sunspot number time series and observes non homogeneity and asymmetry within it. Using Mann-Kendall test a linear trend is revealed. After identifying stationarity within the time series we generate autoregressive AR(p) and autoregressive moving average (ARMA(p,q)). Based on minimization of AIC we find 3 and 1 as the best values of p and q respectively. In the next phase, autoregressive neural network (AR-NN(3)) is generated by training a generalized feedforward neural network (GFNN). Assessing the model performances by means of Willmott's index of second order and coefficient of determination, the performance of AR-NN(3) is identified to be better than AR(3) and ARMA(3,1).
Goutami Chattopadhyay; Surajit Chattopadhyay
2012-04-18T23:59:59.000Z
This study reports a statistical analysis of monthly sunspot number time series and observes non homogeneity and asymmetry within it. Using Mann-Kendall test a linear trend is revealed. After identifying stationarity within the time series we generate autoregressive AR(p) and autoregressive moving average (ARMA(p,q)). Based on minimization of AIC we find 3 and 1 as the best values of p and q respectively. In the next phase, autoregressive neural network (AR-NN(3)) is generated by training a generalized feedforward neural network (GFNN). Assessing the model performances by means of Willmott's index of second order and coefficient of determination, the performance of AR-NN(3) is identified to be better than AR(3) and ARMA(3,1).
Rodrigo Laje; Dean V. Buonomano
2012-10-07T23:59:59.000Z
It is widely accepted that the complex dynamics characteristic of recurrent neural circuits contributes in a fundamental manner to brain function. Progress has been slow in understanding and exploiting the computational power of recurrent dynamics for two main reasons: nonlinear recurrent networks often exhibit chaotic behavior and most known learning rules do not work in robust fashion in recurrent networks. Here we address both these problems by demonstrating how random recurrent networks (RRN) that initially exhibit chaotic dynamics can be tuned through a supervised learning rule to generate locally stable neural patterns of activity that are both complex and robust to noise. The outcome is a novel neural network regime that exhibits both transiently stable and chaotic trajectories. We further show that the recurrent learning rule dramatically increases the ability of RRNs to generate complex spatiotemporal motor patterns, and accounts for recent experimental data showing a decrease in neural variability in response to stimulus onset.
Spin transitions in time-dependent regular and random magnetic fields
Pokrovsky, Valery L.; Sinitsyn, NA.
2004-01-01T23:59:59.000Z
-Zener-Hioe matrix element: ^gs ,0S ~1`!&5expF2 s~s11 !2 uGPs0,0~2e22pg221 !gs ,0S ~2`!, ~58! where Ps 0,0(x) is the Jacobi polynomial. The average values of the Bloch tensors components with m?0 vanish as a re- sult of averaging over the random phases... ,b ,a*,b* in the following way17,18: ^muUSum8&5F ~S1m8!!~S2m8!!~S1m !!~S2m !! G1/2am81mbm82m 3PS2m8 m82m ,m81m~2uau221 !, ~6! where Pn a ,b(x) are the Jacobi polynomials.19 The ma- trix elements possess the following symmetry pro- perties: ^2...
Refuting the odd number limitation of time-delayed feedback control
B. Fiedler; V. Flunkert; M. Georgi; P. Hoevel; E. Schoell
2007-02-12T23:59:59.000Z
We refute an often invoked theorem which claims that a periodic orbit with an odd number of real Floquet multipliers greater than unity can never be stabilized by time-delayed feedback control in the form proposed by Pyragas. Using a generic normal form, we demonstrate that the unstable periodic orbit generated by a subcritical Hopf bifurcation, which has a single real unstable Floquet multiplier, can in fact be stabilized. We derive explicit analytical conditions for the control matrix in terms of the amplitude and the phase of the feedback control gain, and present a numerical example. Our results are of relevance for a wide range of systems in physics, chemistry, technology,and life sciences, where subcritical Hopf bifurcations occur.
Reducing systematic errors in time-frequency resolved mode number analysis
Horváth, L; Papp, G; Maraschek, M; Schuhbeck, K H; Pokol, G I
2015-01-01T23:59:59.000Z
The present paper describes the effect of magnetic pick-up coil transfer functions on mode number analysis in magnetically confined fusion plasmas. Magnetic probes mounted inside the vacuum chamber are widely used to characterize the mode structure of magnetohydrodynamic modes, as, due to their relative simplicity and compact nature, several coils can be distributed over the vessel. Phase differences between the transfer functions of different magnetic pick-up coils lead to systematic errors in time- and frequency resolved mode number analysis. This paper presents the first in-situ, end-to-end calibration of a magnetic pick-up coil system which was carried out by using an in-vessel driving coil on ASDEX Upgrade. The effect of the phase differences in the pick-up coil transfer functions is most significant in the 50-250 kHz frequency range, where the relative phase shift between the different probes can be up to 1 radian (~60{\\deg}). By applying a correction based on the transfer functions we found smaller res...
Characterization of compounds by time-of-flight measurement utilizing random fast ions
Conzemius, R.J.
1989-04-04T23:59:59.000Z
An apparatus is described for characterizing the mass of sample and daughter particles, comprising a source for providing sample ions; a fragmentation region wherein a fraction of the sample ions may fragment to produce daughter ion particles; an electrostatic field region held at a voltage level sufficient to effect ion-neutral separation and ion-ion separation of fragments from the same sample ion and to separate ions of different kinetic energy; a detector system for measuring the relative arrival times of particles; and processing means operatively connected to the detector system to receive and store the relative arrival times and operable to compare the arrival times with times detected at the detector when the electrostatic field region is held at a different voltage level and to thereafter characterize the particles. Sample and daughter particles are characterized with respect to mass and other characteristics by detecting at a particle detector the relative time of arrival for fragments of a sample ion at two different electrostatic voltage levels. The two sets of particle arrival times are used in conjunction with the known altered voltage levels to mathematically characterize the sample and daughter fragments. In an alternative embodiment the present invention may be used as a detector for a conventional mass spectrometer. In this embodiment, conventional mass spectrometry analysis is enhanced due to further mass resolving of the detected ions. 8 figs.
Characterization of compounds by time-of-flight measurement utilizing random fast ions
Conzemius, Robert J. (Ames, IA)
1989-01-01T23:59:59.000Z
An apparatus for characterizing the mass of sample and daughter particles, comprising a source for providing sample ions; a fragmentation region wherein a fraction of the sample ions may fragment to produce daughter ion particles; an electrostatic field region held at a voltage level sufficient to effect ion-neutral separation and ion-ion separation of fragments from the same sample ion and to separate ions of different kinetic energy; a detector system for measuring the relative arrival times of particles; and processing means operatively connected to the detector system to receive and store the relative arrival times and operable to compare the arrival times with times detected at the detector when the electrostatic field region is held at a different voltage level and to thereafter characterize the particles. Sample and daughter particles are characterized with respect to mass and other characteristics by detecting at a particle detector the relative time of arrival for fragments of a sample ion at two different electrostatic voltage levels. The two sets of particle arrival times are used in conjunction with the known altered voltage levels to mathematically characterize the sample and daughter fragments. In an alternative embodiment the present invention may be used as a detector for a conventional mass spectrometer. In this embodiment, conventional mass spectrometry analysis is enhanced due to further mass resolving of the detected ions.
R. R. Borges; F. S. Borges; A. M. Batista; E. L. Lameu; R. L. Viana; K. C. Iarosz; I. L. Caldas; M. A. F. Sanjuán
2015-03-07T23:59:59.000Z
In this paper, we study the effects of spike timing-dependent plasticity on synchronisation in a network of Hodgkin-Huxley neurons. Neuron plasticity is a flexible property of a neuron and its network to change temporarily or permanently their biochemical, physiological, and morphological characteristics, in order to adapt to the environment. Regarding the plasticity, we consider Hebbian rules, specifically for spike timing-dependent plasticity (STDP), and with regard to network, we consider that the connections are randomly distributed. We analyse the synchronisation and desynchronisation according to an input level and probability of connections. Moreover, we verify that the transition for synchronisation depends on the neuronal network architecture, and the external perturbation level.
Space-Time Models based on Random Fields with Local Interactions
Dionissios T. Hristopulos; Ivi C. Tsantili
2015-03-06T23:59:59.000Z
The analysis of space-time data from complex, real-life phenomena requires the use of flexible and physically motivated covariance functions. In most cases, it is not possible to explicitly solve the equations of motion for the fields or the respective covariance functions. In the statistical literature, covariance functions are often based on mathematical constructions. We propose deriving space-time covariance functions by solving "effective equations of motion", which can be used as statistical representations of systems with diffusive behavior. In particular, we propose using the linear response theory to formulate space-time covariance functions based on an equilibrium effective Hamiltonian. The effective space-time dynamics are then generated by a stochastic perturbation around the equilibrium point of the classical field Hamiltonian leading to an associated Langevin equation. We employ a Hamiltonian which extends the classical Gaussian field theory by including a curvature term and leads to a diffusive Langevin equation. Finally, we derive new forms of space-time covariance functions.
Supplementary Material for The Shape-Time Random Field for Semantic Video Labeling
Massachusetts at Amherst, University of
]. We first describe the inference and learn- ing procedures for the temporal SCRF and STRF models in Section 3. 1. Temporal SCRF 1.1. Inference For the first frame (time t = 1), the SCRF is used for inference, since it does not depend on previous frames. Af- terward, inference in the temporal SCRF
NATURE MEDICINE VOLUME 7 NUMBER 5 MAY 2001 521 It is time for the global donor community--
NATURE MEDICINE · VOLUME 7 · NUMBER 5 · MAY 2001 521 COMMENTARY It is time for the global donor regress rather than progress. Immunization rates declined in many parts of the continent during the 1990s
Vanderbei, Robert J., E-mail: rvdb@princeton.edu [Princeton University, Department of Operations Research and Financial Engineering (United States); P Latin-Small-Letter-Dotless-I nar, Mustafa C., E-mail: mustafap@bilkent.edu.tr [Bilkent University, Department of Industrial Engineering (Turkey); Bozkaya, Efe B. [Sabanc Latin-Small-Letter-Dotless-I University, Faculty of Administrative Sciences (Turkey)] [Sabanc Latin-Small-Letter-Dotless-I University, Faculty of Administrative Sciences (Turkey)
2013-02-15T23:59:59.000Z
An American option (or, warrant) is the right, but not the obligation, to purchase or sell an underlying equity at any time up to a predetermined expiration date for a predetermined amount. A perpetual American option differs from a plain American option in that it does not expire. In this study, we solve the optimal stopping problem of a perpetual American option (both call and put) in discrete time using linear programming duality. Under the assumption that the underlying stock price follows a discrete time and discrete state Markov process, namely a geometric random walk, we formulate the pricing problem as an infinite dimensional linear programming (LP) problem using the excessive-majorant property of the value function. This formulation allows us to solve complementary slackness conditions in closed-form, revealing an optimal stopping strategy which highlights the set of stock-prices where the option should be exercised. The analysis for the call option reveals that such a critical value exists only in some cases, depending on a combination of state-transition probabilities and the economic discount factor (i.e., the prevailing interest rate) whereas it ceases to be an issue for the put.
Nebraska-Lincoln, University of
Platte River flow in relation to crane foraging habits Crane numbers in relation to time (year in the Central Platte River Valley (CPRV) each spring Individual cranes spend 3-4 weeks in the CPRV building fat Factors Influencing Distribution and Abundance of Sandhill Cranes (Grus canadensis) in the Central Platte
Scaife, J.; Harrison, K.; Romanchikova, M.; Parker, A.; Sutcliffe, M.; Bond, S.; Thomas, S.; Freeman, S.; Jena, R.; Bates, A.; Burnet, N.
2014-09-16T23:59:59.000Z
of slices required to show the entire rectum on the MV scans (i.e. half the number of kV slices) are shown as circles. The interquartile ranges, of the actual numbers of slices showing rectum on the MV scans, are shown as bars (25% percentile as the lower... bar and 75% percentile as the upper bar). Full paper: Random rectal variation is higher than predicted during prostate RT BJR 3 of 12 birpublications.org/bjr Br J Radiol;87:20140343 In order to investigate any and all differences in median position...
Analyses of the number of times married: U.S. women 1995-1996
Melick, Emily A
2003-01-01T23:59:59.000Z
of times women marry, and the main variables associated, which are age, race, metropolitan status, and education. Based on this review, I then develop several hypotheses, which I will test in Chapter IV, the analysis chapter of this thesis. This thesis... was influential in rates of dissolution after a remarriage. Within a ten year period, almost half (47 percent) of the women who experienced a marital dissolution and remarried before age 25 had ended their new marriage as well. Women, who married, divorced...
Testing for Subcellular Randomness
Babatunde O. Okunoye
2008-01-29T23:59:59.000Z
Statistical tests were conducted on 1,000 numbers generated from the genome of Bacteriophage T4, obtained from GenBank with accession number AF158101.The numbers passed the non-parametric, distribution-free tests.Deoxyribonucleic acid was discovered to be a random number generator, existent in nature.
Abel, Francois; Iliadis, Ilias; Minkenberg, Cyriel J. A.
2009-02-03T23:59:59.000Z
A method for allocating pending requests for data packet transmission at a number of inputs to a number of outputs of a switching system in successive time slots, including a matching method including the steps of providing a first request information in a first time slot indicating data packets at the inputs requesting transmission to the outputs of the switching system, performing a first step in the first time slot depending on the first request information to obtain a first matching information, providing a last request information in a last time slot successive to the first time slot, performing a last step in the last time slot depending on the last request information and depending on the first matching information to obtain a final matching information, and assigning the pending data packets at the number of inputs to the number of outputs based on the final matching information.
DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)
Benioff, Paul
2009-01-01T23:59:59.000Z
This work is based on the field of reference frames based on quantum representations of real and complex numbers described in other work. Here frame domains are expanded to include space and time lattices. Strings of qukits are described as hybrid systems as they are both mathematical and physical systems. As mathematical systems they represent numbers. As physical systems in each frame the strings have a discrete Schrodinger dynamics on the lattices. The frame field has an iterative structure such that the contents of a stagejframe have images in a stagej-1(parent) frame. A discussion of parent frame images includes themore »proposal that points of stagejframe lattices have images as hybrid systems in parent frames. The resulting association of energy with images of lattice point locations, as hybrid systems states, is discussed. Representations and images of other physical systems in the different frames are also described.« less
Lévęque, Olivier
3 Continuous-time stochastic processes Definition 3.1. A continuous-time stochastic process to describe a continuous-time stochastic process, one generally needs a LARGE probability space ! Question. But having independent and stationary increments is a strong requirement for a continuous-time process
Dismantling sparse random graphs
Janson, Svante
2007-01-01T23:59:59.000Z
We consider the number of vertices that must be removed from a graph G in order that the remaining subgraph has no component with more than k vertices. Our principal observation is that, if G is a sparse random graph or a random regular graph on n vertices with n tending to infinity, then the number in question is essentially the same for all values of k such that k tends to infinity but k=o(n).
Fast generation of sparse random kernel graphs
DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)
Hagberg, Aric; Lemons, Nathan; Du, Wen -Bo
2015-09-10T23:59:59.000Z
The development of kernel-based inhomogeneous random graphs has provided models that are flexible enough to capture many observed characteristics of real networks, and that are also mathematically tractable. We specify a class of inhomogeneous random graph models, called random kernel graphs, that produces sparse graphs with tunable graph properties, and we develop an efficient generation algorithm to sample random instances from this model. As real-world networks are usually large, it is essential that the run-time of generation algorithms scales better than quadratically in the number of vertices n. We show that for many practical kernels our algorithm runs in timemore »at most ?(n(logn)˛). As an example, we show how to generate samples of power-law degree distribution graphs with tunable assortativity.« less
Diestel, Geoff
1 SYLLABUS Course title and number: ACCK 450 Management Information Systems Term: Spring 2015 systems designed to meet the informational needs of the various business subsystems. The concepts stressed and detailed foundation in the principles of information systems through the most recent research, references
SPRNG Parallel Random Number Generators at NERSC
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports(Journal Article) |govInstrumentsmfrirtA Journey Inside the Presentationsjobs Running jobs QuickFP (04-95)Super HeavyServiceSORN1 THISSPRNG
Nonlinear elastic polymers in random flow
M. Martins Afonso; D. Vincenzi
2005-08-09T23:59:59.000Z
Polymer stretching in random smooth flows is investigated within the framework of the FENE dumbbell model. The advecting flow is Gaussian and short-correlated in time. The stationary probability density function of polymer extension is derived exactly. The characteristic time needed for the system to attain the stationary regime is computed as a function of the Weissenberg number and the maximum length of polymers. The transient relaxation to the stationary regime is predicted to be exceptionally slow in the proximity of the coil-stretch transition.
Exploring the randomness of Directed Acyclic Networks
Joaquín Gońi; Bernat Corominas-Murtra; Ricard V. Solé; Carlos Rodríguez-Caso
2010-06-11T23:59:59.000Z
The feed-forward relationship naturally observed in time-dependent processes and in a diverse number of real systems -such as some food-webs and electronic and neural wiring- can be described in terms of so-called directed acyclic graphs (DAGs). An important ingredient of the analysis of such networks is a proper comparison of their observed architecture against an ensemble of randomized graphs, thereby quantifying the {\\em randomness} of the real systems with respect to suitable null models. This approximation is particularly relevant when the finite size and/or large connectivity of real systems make inadequate a comparison with the predictions obtained from the so-called {\\em configuration model}. In this paper we analyze four methods of DAG randomization as defined by the desired combination of topological invariants (directed and undirected degree sequence and component distributions) aimed to be preserved. A highly ordered DAG, called \\textit{snake}-graph and a Erd\\:os-R\\'enyi DAG were used to validate the performance of the algorithms. Finally, three real case studies, namely, the \\textit{C. elegans} cell lineage network, a PhD student-advisor network and the Milgram's citation network were analyzed using each randomization method. Results show how the interpretation of degree-degree relations in DAGs respect to their randomized ensembles depend on the topological invariants imposed. In general, real DAGs provide disordered values, lower than the expected by chance when the directedness of the links is not preserved in the randomization process. Conversely, if the direction of the links is conserved throughout the randomization process, disorder indicators are close to the obtained from the null-model ensemble, although some deviations are observed.
Better Randomness with Single Photons
Oberreiter, Lukas
2014-01-01T23:59:59.000Z
Randomness is one of the most important resources in modern information science, since encryption founds upon the trust in random numbers. Since it is impossible to prove if an existing random bit string is truly random, it is relevant that they be generated in a trust worthy process. This requires specialized hardware for random numbers, for example a die or a tossed coin. But when all input parameters are known, their outcome might still be predicted. A quantum mechanical superposition allows for provably true random bit generation. In the past decade many quantum random number generators (QRNGs) were realized. A photonic implementation is described as a photon which impinges on a beam splitter, but such a protocol is rarely realized with non-classical light or anti-bunched single photons. Instead, laser sources or light emitting diodes are used. Here we analyze the difference in generating a true random bit string with a laser and with anti-bunched light. We show that a single photon source provides more r...
Zi-Niu Wu
2013-10-02T23:59:59.000Z
For many natural process of growth, with the growth rate independent of size due to Gibrat law and with the growth process following a log-normal distribution, the ratio between the time (D) for maximum value and the time (L) for maximum growth rate (inflexion point) is then equal to the square root of the base of the natural logarithm (e^{1/2}). On the logarithm scale this ratio becomes one half ((1/2)). It remains an open question, due to lack of complete data for various cases with restricted growth, whether this e^{1/2} ratio can be stated as e^{1/2}-Law. Two established examples already published, one for an epidemic spreading and one for droplet production, support however this ratio. Another example appears to be the height of humain body. For boys the maximum height occurs near 23 years old while the maximum growth rate is at the age near 14, and there ratio is close to e^{1/2}. The main theoretical base to obtain this conclusion is problem independent, provided the growth process is restricted, such as public intervention to control the spreading of communicable epidemics, so that an entropy is associated with the process and the role of dissipation, representing the mechanism of intervention, is maximized. Under this formulation the principle of maximum rate of entropy production is used to make the production process problem independent.
Random access wireless networks with controlled mobility
Modiano, Eytan H.
This paper considers wireless networks where messages arriving randomly (in time and space) are collected by a mobile receiver. The messages are transmitted to the mobile receiver according to a random access scheme and ...
Kronberg, James W. (353 Church Rd., Beech Island, SC 29841)
1993-01-01T23:59:59.000Z
An apparatus for selecting at random one item of N items on the average comprising counter and reset elements for counting repeatedly between zero and N, a number selected by the user, a circuit for activating and deactivating the counter, a comparator to determine if the counter stopped at a count of zero, an output to indicate an item has been selected when the count is zero or not selected if the count is not zero. Randomness is provided by having the counter cycle very often while varying the relatively longer duration between activation and deactivation of the count. The passive circuit components of the activating/deactivating circuit and those of the counter are selected for the sensitivity of their response to variations in temperature and other physical characteristics of the environment so that the response time of the circuitry varies. Additionally, the items themselves, which may be people, may vary in shape or the time they press a pushbutton, so that, for example, an ultrasonic beam broken by the item or person passing through it will add to the duration of the count and thus to the randomness of the selection.
Kronberg, J.W.
1993-04-20T23:59:59.000Z
An apparatus for selecting at random one item of N items on the average comprising counter and reset elements for counting repeatedly between zero and N, a number selected by the user, a circuit for activating and deactivating the counter, a comparator to determine if the counter stopped at a count of zero, an output to indicate an item has been selected when the count is zero or not selected if the count is not zero. Randomness is provided by having the counter cycle very often while varying the relatively longer duration between activation and deactivation of the count. The passive circuit components of the activating/deactivating circuit and those of the counter are selected for the sensitivity of their response to variations in temperature and other physical characteristics of the environment so that the response time of the circuitry varies. Additionally, the items themselves, which may be people, may vary in shape or the time they press a pushbutton, so that, for example, an ultrasonic beam broken by the item or person passing through it will add to the duration of the count and thus to the randomness of the selection.
Long wave expansions for water waves over random topography
Craig, Walter
Long wave expansions for water waves over random topography Anne de Bouard1 , Walter Craig2 interacting with the random bottom. We show that the resulting influence of the random topography is expressed numbers: 76B15, 35Q53, 76M50, 60F17 Keywords :Water waves, random topography, long wave asymptotics #12
Durresi, Arjan
density of nodes, only a small number of them need be active at any time to forward traffic for active, or to be active. Each node is awake for a randomly chosen fixed interval per time frame. High node density results in existence of several paths between two given nodes whose path length and de- lay characteristics are similar
Models of random graph hierarchies
Paluch, Robert; Holyst, Janusz
2015-01-01T23:59:59.000Z
We introduce two models of inclusion hierarchies: Random Graph Hierarchy (RGH) and Limited Random Graph Hierarchy (LRGH). In both models a set of nodes at a given hierarchy level is connected randomly, as in the Erd\\H{o}s-R\\'{e}nyi random graph, with a fixed average degree equal to a system parameter $c$. Clusters of the resulting network are treated as nodes at the next hierarchy level and they are connected again at this level and so on, until the process cannot continue. In the RGH model we use all clusters, including those of size $1$, when building the next hierarchy level, while in the LRGH model clusters of size $1$ stop participating in further steps. We find that in both models the number of nodes at a given hierarchy level $h$ decreases approximately exponentially with $h$. The height of the hierarchy $H$, i.e. the number of all hierarchy levels, increases logarithmically with the system size $N$, i.e. with the number of nodes at the first level. The height $H$ decreases monotonically with the conne...
Ping, Li
can be used to significantly increase the reliability and spectrum efficiency of wireless approach so as to ensure reliability, such as in the vertical Bell Laboratories layered spacetime (V antennas. The BLAST architectures are less effective in multiple-inputsingle-output (MISO) environments
Estrada, Ernesto
2015-01-01T23:59:59.000Z
A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square \\left[0,1\\right]^{2}. The topological properties, such as connectivity, average degree, average path length and clustering, of the random rectangular graphs (RRGs) generated by this model are then studied as a function of the rectangle sides lengths a and b=1/a, and the radius r used to connect the nodes. When a=1 we recover the RGG, and when a\\rightarrow\\infty the very elongated rectangle generated resembles a one-dimensional RGG. We provided computational and analytical evidence that the topological properties of the RRG differ significantly from those of the RGG. The connectivity of the RRG depends not only on the number of nodes as in the case of the RGG, but also on the side length of the rectangle. As the rectangle is more elongated the critical radius for connectivity increases following first a power-law an...
A Feasible Graph Partition Framework for Random Walks Implemented by Parallel Computing in Big Graph
Liu, Xiaoming; Guan, Xiaohong
2015-01-01T23:59:59.000Z
Graph partition is a fundamental problem of parallel computing for big graph data. Many graph partition algorithms have been proposed to solve the problem in various applications, such as matrix computations and PageRank, etc., but none has pay attention to random walks. Random walks is a widely used method to explore graph structure in lots of fields. The challenges of graph partition for random walks include the large number of times of communication between partitions, lots of replications of the vertices, unbalanced partition, etc. In this paper, we propose a feasible graph partition framework for random walks implemented by parallel computing in big graph. The framework is based on two optimization functions to reduce the bandwidth, memory and storage cost in the condition that the load balance is guaranteed. In this framework, several greedy graph partition algorithms are proposed. We also propose five metrics from different perspectives to evaluate the performance of these algorithms. By running the al...
Chuang, Jeffrey
tested, one of the most basic being self-averaging of the free energy. Self-averaging is a propertyVOLUME 87, NUMBER 7 P H Y S I C A L R E V I E W L E T T E R S 13 AUGUST 2001 Free Energy Self Department of Physics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139 2 Department
Luk, Wayne
developer man hours and CPU time. While it is possible to construct all possible generators ahead of time The LUT-SR Family of Uniform Random Number Generators for FPGA Architectures David B. Thomas, Member, IEEE generators (RNGs) are more resource-efficient than software-optimized RNGs because they can take advantage
Random walk in random environment: a dynamicist's approch
Liu, I-Shih
, equivalently: RW in a (quenched) disordered medium, or: Random walk in random environment (RWRE) Marco LenciRandom walk in random environment: a dynamicist's approch Marco Lenci Universit`a di Bologna RWRE #12;Random walk in random environment Random walk (RW): Point (particle, walker) travels on Zd
Random matrix ensembles for $PT$-symmetric systems
Eva-Maria Graefe; Steve Mudute-Ndumbe; Matthew Taylor
2015-05-28T23:59:59.000Z
Recently much effort has been made towards the introduction of non-Hermitian random matrix models respecting PT-symmetry. Here we show that there is a one-to-one correspondence between complex $PT$-symmetric matrices and split-complex and split-quaternionic versions of Hermitian matrices. We introduce two new random matrix ensembles of (a) Gaussian split-complex Hermitian, and (b) Gaussian split-quaternionic Hermitian matrices, of arbitrary sizes. They are related to the split signature versions of the complex and the quaternionic numbers, respectively. We conjecture that these ensembles represent universality classes for PT-symmetric matrices. For the case of $2\\times2$ matrices we derive analytic expressions for the joint probability distributions of the eigenvalues, the one-level densities and the level spacings in the case of real eigenvalues.
Fisher, Andrew
Ŕ1 KŔ1 . 29 Hydrothermal circulation. Large-scale pore-fluid convec- 30 tion driven by thermal and corers that penetrated a few meters into sea- 41floor sediments could provide meaningful geothermal gra) improved in subsequent 46years, the number and geographic distribution of determi- 47nations increased
Diestel, Geoff
1 SYLLABUS Course title and number: CISK 450 Management Information Systems Term: Spring 2015 information systems designed to meet the informational needs of the various business subsystems. The concepts students a solid and detailed foundation in the principles of information systems through the most recent
Diestel, Geoff
1 SYLLABUS Course title and number: CISK 450 Management Information Systems Term: Fall 2014 and Description: This course investigates management issues related to business information systems designed to meet the informational needs of the various business subsystems. The concepts stressed are systems
Secure sharing of random bits over the Internet
Geraldo A. Barbosa
2007-05-17T23:59:59.000Z
Although one-time pad encrypted files can be sent through Internet channels, the need for renewing shared secret keys have made this method unpractical. This work presents a scheme to turn practical the fast sharing of random keys over arbitrary Internet channels. Starting with a shared secret key sequence of length K_0 the users end up with a secure new sequence K >> K_0. Using these sequences for posteriori message encryption the legitimate users have absolute security control without the need for third parties. Additionally, the security level does not depend on the unproven difficulty of factoring numbers in primes. In the proposed scheme a fast optical random source generates random bits and noise for key renewals. The transmitted signals are recorded signals that carries both the random binary signals to be exchanged and physical noise that cannot be eliminated by the attacker. These signals allow amplification over the Internet network without degrading security. The proposed system is also secure against a-posteriori known-plaintext attack on the key. Information-theoretic analysis is presented and bounds for secure operation are quantitatively determined.
Nonlocal operators, parabolic-type equations, and ultrametric random walks
Chacón-Cortes, L. F., E-mail: fchaconc@math.cinvestav.edu.mx; Zúńiga-Galindo, W. A., E-mail: wazuniga@math.cinvestav.edu.mx [Centro de Investigacion y de Estudios Avanzados del I.P.N., Departamento de Matematicas, Av. Instituto Politecnico Nacional 2508, Col. San Pedro Zacatenco, Mexico D.F., C.P. 07360 (Mexico)
2013-11-15T23:59:59.000Z
In this article, we introduce a new type of nonlocal operators and study the Cauchy problem for certain parabolic-type pseudodifferential equations naturally associated to these operators. Some of these equations are the p-adic master equations of certain models of complex systems introduced by Avetisov, V. A. and Bikulov, A. Kh., “On the ultrametricity of the fluctuation dynamicmobility of protein molecules,” Proc. Steklov Inst. Math. 265(1), 75–81 (2009) [Tr. Mat. Inst. Steklova 265, 82–89 (2009) (Izbrannye Voprosy Matematicheskoy Fiziki i p-adicheskogo Analiza) (in Russian)]; Avetisov, V. A., Bikulov, A. Kh., and Zubarev, A. P., “First passage time distribution and the number of returns for ultrametric random walks,” J. Phys. A 42(8), 085003 (2009); Avetisov, V. A., Bikulov, A. Kh., and Osipov, V. A., “p-adic models of ultrametric diffusion in the conformational dynamics of macromolecules,” Proc. Steklov Inst. Math. 245(2), 48–57 (2004) [Tr. Mat. Inst. Steklova 245, 55–64 (2004) (Izbrannye Voprosy Matematicheskoy Fiziki i p-adicheskogo Analiza) (in Russian)]; Avetisov, V. A., Bikulov, A. Kh., and Osipov, V. A., “p-adic description of characteristic relaxation in complex systems,” J. Phys. A 36(15), 4239–4246 (2003); Avetisov, V. A., Bikulov, A. H., Kozyrev, S. V., and Osipov, V. A., “p-adic models of ultrametric diffusion constrained by hierarchical energy landscapes,” J. Phys. A 35(2), 177–189 (2002); Avetisov, V. A., Bikulov, A. Kh., and Kozyrev, S. V., “Description of logarithmic relaxation by a model of a hierarchical random walk,” Dokl. Akad. Nauk 368(2), 164–167 (1999) (in Russian). The fundamental solutions of these parabolic-type equations are transition functions of random walks on the n-dimensional vector space over the field of p-adic numbers. We study some properties of these random walks, including the first passage time.
Nucleon transfer in heavy ion collisions with the time-dependent Hartree-Fock theory using of Physics and Engineering, Australian National University, Canberra, Australian Capital Territory 0200-transfers are discussed. Binary collisions of many-body systems are of funda- mental interest to test dynamical approaches
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports(Journal Article)41cloth Documentation DataDepartment of EnergyOn-Farm1 ofCategoricalDynamicTheoryMessagefor6-02-01 FederalChange NumberE
D. M. Chernyak; F. A. Danevich; A. Giuliani; E. Olivieri; M. Tenconi; V. I. Tretyak
2013-01-17T23:59:59.000Z
Two neutrino double $\\beta$ decay can create irremovable background even in high energy resolution detectors searching for neutrinoless double $\\beta$ decay due to random coincidence of $2\
18.366 Random Walks and Diffusion, Spring 2003
Bazant, Martin Z.
Discrete and continuum modeling of diffusion processes in physics, chemistry, and economics. Topics include central limit theorems, continuous-time random walks, Levy flights, correlations, extreme events, mixing, ...
18.366 Random Walks and Diffusion, Spring 2005
Bazant, Martin Z.
Discrete and continuum modeling of diffusion processes in physics, chemistry, and economics. Topics include central limit theorems, continuous-time random walks, Levy flights, correlations, extreme events, mixing, ...
Time Commitments Where Does Your Time Go
Kunkle, Tom
Time Commitments Where Does Your Time Go Everyone starts the week with the same number of hours. So, why does your time go so fast? Let's find out! Number of hours of sleep each night ____ x 7 preparation/clean-up time) ____ x 7 = ____ Travel time to and from campus ___ x __ = ____ Number of hours per
Random walks in random environment Tom Schmitz (MPI Leipzig)
Thalmaier, Anton
Random walks in random environment Tom Schmitz (MPI Leipzig) The model of random walks in random environment (RWRE) originates from physical and biological sciences and describes a random motion in a disordered medium. We consider RWRE on the d-dimensional lattice. The jump probabil- ities are themselves
Stirling numbers of graphs, and the normal ordering
Mayfield, John
Stirling numbers of graphs, and the normal ordering problem Galvin earned his PhD in mathematics correlations in discrete random structures. The Stirling number of the second kind ${n \\brace k}$ counts
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports(Journal Article)41cloth Documentation DataDepartment of EnergyOn-Farm1 ofCategoricalDynamicTheoryMessagefor6-02-01 FederalChange Number
Statistics and Technology 1 Generating Random Numbers 3
the frequencies (counts) on the chart, right click one of the bars and click "Add Data Labels." · Pie Charts under "Pie." 4. The pie chart will appear, but it may need some formatting changes to be readable. You it readable. 5. To show the frequencies (counts) on the chart, right click one of the pie pieces and click
THE NUMBER OF DESCENDANTS IN SIMPLY GENERATED RANDOM BERNHARD GITTENBERGER
Gittenberger, Bernhard
Â¨OsterreichÂUngarn, grant 34oeu24. Department of Geometry, TU Wien, Wiedner Hauptstrasse 8-10/113, A-1040
THE NUMBER OF DESCENDANTS IN SIMPLY GENERATED RANDOM TREES \\Lambda
Gittenberger, Bernhard
Foundation FWF, grant P10187ÂMAT, and by the Stiftung Aktion Â¨ Osterreich--Ungarn, grant 34oeu24. \\Lambda
Analysis of the Linux Random Number Generator Zvi Gutterman
International Association for Cryptologic Research (IACR)
the most basic security requirements, using common terminology (e.g., of [3]). (A more detailed list, and patched with hundreds of code patches. We used dynamic and static reverse engineering to learn
Anosov C-systems and random number generators
George Savvidy
2015-09-04T23:59:59.000Z
We are developing further our earlier suggestion to use hyperbolic Anosov C-systems for the Monte-Carlo simulations in high energy particle physics. The hyperbolic dynamical systems have homogeneous instability of all trajectories and as such they have mixing of all orders, countable Lebesgue spectrum and positive Kolmogorov entropy. These extraordinary ergodic properties follow from the C-condition introduced by Anosov. The C-condition defines a rich class of dynamical systems which span an open set in the space of all dynamical systems. The important property of C-systems is that they have a countable set of everywhere dense periodic trajectories and that their density exponentially increases with entropy. Of special interest are C-systems that are defined on a high dimensional torus. The C-systems on a torus are perfect candidates to be used for Monte-Carlo simulations. Recently an efficient algorithm was found, which allows very fast generation of long trajectories of the C-systems. These trajectories have high quality statistical properties and we are suggesting to use them for the QCD lattice simulations and at high energy particle physics.
Good Practice in (Pseudo) Random Number Generation for Bioinformatics Applications
Jones, David T.
() and drand48() #12;Matlab's rand Mathematica's SWB generator ran0() and ran1() in the original Numerical
From the Academy Random matrices and quantum chaos
Marklof, Jens
From the Academy Random matrices and quantum chaos Thomas Kriecherbauer*, Jens Marklof appearances of random matrices, namely in the theory of quantum chaos and in the theory of prime numbers, in fact, are not only used to describe statistical properties of physical systems (e.g., in quantum chaos
Byzantine Modification Detection in Multicast Networks with Random Network Coding
Médard, Muriel
network coding. Each exogenous source packet is augmented with a flexible number of hash symbols of the random network code, and can have the same (or greater) transmission capacity compared to the sourceByzantine Modification Detection in Multicast Networks with Random Network Coding Tracey Ho, Ben
Pacheco, Carlos, Ph.D. Massachusetts Institute of Technology
2009-01-01T23:59:59.000Z
Random testing can quickly generate many tests, is easy to implement, scales to large software applications, and reveals software errors. But it tends to generate many tests that are illegal or that exercise the same parts ...
Bitar, Eilyan Yamen
2011-01-01T23:59:59.000Z
Selling Random Energy in a Two-Settlement System 3.1Wind Energy Aggregation and Profit Sharing 4.1 IntroductionPower Model . . . . . . . . . . . . . 5.3.2 Energy Storage
Nobuyasu Ito; Macoto Kikuchi; Yutaka Okabe
1993-02-07T23:59:59.000Z
The correlation between a random sequence and its transformed sequences is studied. In the case of a permutation operation or, in other word, the shuffling operation, it is shown that the correlation can be so small that the sequences can be regarded as independent random sequences. The applications to the Monte Carlo simulations are also given. This method is especially useful in the Ising Monte Carlo simulation.
Fenimore, E.E.
1980-08-22T23:59:59.000Z
A hexagonally shaped quasi-random no-two-holes touching grid collimator. The quasi-random array grid collimator eliminates contamination from small angle off-axis rays by using a no-two-holes-touching pattern which simultaneously provides for a self-supporting array increasng throughput by elimination of a substrate. The presentation invention also provides maximum throughput using hexagonally shaped holes in a hexagonal lattice pattern for diffraction limited applications. Mosaicking is also disclosed for reducing fabrication effort.
Random multiparty entanglement distillation
Ben Fortescue; Hoi-Kwong Lo
2008-01-15T23:59:59.000Z
We describe various results related to the random distillation of multiparty entangled states - that is, conversion of such states into entangled states shared between fewer parties, where those parties are not predetermined. In previous work [Phys. Rev. Lett. 98, 260501 (2007)] we showed that certain output states (namely Einstein-Podolsky-Rosen (EPR) pairs) could be reliably acquired from a prescribed initial multipartite state (namely the W state) via random distillation that could not be reliably created between predetermined parties. Here we provide a more rigorous definition of what constitutes ``advantageous'' random distillation. We show that random distillation is always advantageous for W-class three-qubit states (but only sometimes for Greenberger-Horne-Zeilinger (GHZ)-class states). We show that the general class of multiparty states known as symmetric Dicke states can be readily converted to many other states in the class via random distillation. Finally we show that random distillation is provably not advantageous in the limit of multiple copies of pure states.
Electrokinetic transport in microchannels with random roughness
Wang, Moran [Los Alamos National Laboratory; Kang, Qinjun [Los Alamos National Laboratory
2008-01-01T23:59:59.000Z
We present a numerical framework to model the electrokinetic transport in microchannels with random roughness. The three-dimensional microstructure of the rough channel is generated by a random generation-growth method with three statistical parameters to control the number density, the total volume fraction, and the anisotropy characteristics of roughness elements. The governing equations for the electrokinetic transport are solved by a high-efficiency lattice Poisson?Boltzmann method in complex geometries. The effects from the geometric characteristics of roughness on the electrokinetic transport in microchannels are therefore modeled and analyzed. For a given total roughness volume fraction, a higher number density leads to a lower fluctuation because of the random factors. The electroosmotic flow rate increases with the roughness number density nearly logarithmically for a given volume fraction of roughness but decreases with the volume fraction for a given roughness number density. When both the volume fraction and the number density of roughness are given, the electroosmotic flow rate is enhanced by the increase of the characteristic length along the external electric field direction but is reduced by that in the direction across the channel. For a given microstructure of the rough microchannel, the electroosmotic flow rate decreases with the Debye length. It is found that the shape resistance of roughness is responsible for the flow rate reduction in the rough channel compared to the smooth channel even for very thin double layers, and hence plays an important role in microchannel electroosmotic flows.
A discrete fractional random transform
Zhengjun Liu; Haifa Zhao; Shutian Liu
2006-05-20T23:59:59.000Z
We propose a discrete fractional random transform based on a generalization of the discrete fractional Fourier transform with an intrinsic randomness. Such discrete fractional random transform inheres excellent mathematical properties of the fractional Fourier transform along with some fantastic features of its own. As a primary application, the discrete fractional random transform has been used for image encryption and decryption.
Diffusion in randomly perturbed dissipative dynamics
Christian S. Rodrigues; Aleksei V. Chechkin; Alessandro P. S. de Moura; Celso Grebogi; Rainer Klages
2014-11-13T23:59:59.000Z
Dynamical systems having many coexisting attractors present interesting properties from both fundamental theoretical and modelling points of view. When such dynamics is under bounded random perturbations, the basins of attraction are no longer invariant and there is the possibility of transport among them. Here we introduce a basic theoretical setting which enables us to study this hopping process from the perspective of anomalous transport using the concept of a random dynamical system with holes. We apply it to a simple model by investigating the role of hyperbolicity for the transport among basins. We show numerically that our system exhibits non-Gaussian position distributions, power-law escape times, and subdiffusion. Our simulation results are reproduced consistently from stochastic Continuous Time Random Walk theory.
Real-Time Deferrable Load Control: Handling the Uncertainties of Renewable Generation
Low, Steven H.
Real-Time Deferrable Load Control: Handling the Uncertainties of Renewable Generation Lingwen Gan to handle the un- certainties of renewable generation. It is expected that a large number of deferrable for the random fluctuations in renewable generation. Work on deferrable load control falls into two categories
New Paradigms for Digital Generation and Post-Processing of Random Data
International Association for Cryptologic Research (IACR)
. The generated random binary sequences inherently have a high speed and a very high and robust entropy rate and memories in such devices. The output of a random number generator (RNG) is typically a binary sequenceNew Paradigms for Digital Generation and Post-Processing of Random Data #3; Jovan Dj. Goli#19;c
Nelson, R.N. (ed.)
1985-05-01T23:59:59.000Z
This publication lists all report number codes processed by the Office of Scientific and Technical Information. The report codes are substantially based on the American National Standards Institute, Standard Technical Report Number (STRN)-Format and Creation Z39.23-1983. The Standard Technical Report Number (STRN) provides one of the primary methods of identifying a specific technical report. The STRN consists of two parts: The report code and the sequential number. The report code identifies the issuing organization, a specific program, or a type of document. The sequential number, which is assigned in sequence by each report issuing entity, is not included in this publication. Part I of this compilation is alphabetized by report codes followed by issuing installations. Part II lists the issuing organization followed by the assigned report code(s). In both Parts I and II, the names of issuing organizations appear for the most part in the form used at the time the reports were issued. However, for some of the more prolific installations which have had name changes, all entries have been merged under the current name.
Distributed Algorithms with Dynamical Random Transitions
Henri Poincaré -Nancy-Université, Université
of the storage allocation system is taken as a function of time to be a #12;nite-state Markov chain resources where allocation and deal- location requests are dynamic random variables. This stochastic model, 16, 19]. The technique is applicable to other stochastically modelled resource allocation protocoles
Recombination of polynucleotide sequences using random or defined primers
Arnold, Frances H. (Pasadena, CA); Shao, Zhixin (Pasadena, CA); Affholter, Joseph A. (Midland, MI); Zhao, Huimin (Pasadena, CA); Giver, Lorraine J. (Pasadena, CA)
2001-01-01T23:59:59.000Z
A method for in vitro mutagenesis and recombination of polynucleotide sequences based on polymerase-catalyzed extension of primer oligonucleotides is disclosed. The method involves priming template polynucleotide(s) with random-sequences or defined-sequence primers to generate a pool of short DNA fragments with a low level of point mutations. The DNA fragments are subjected to denaturization followed by annealing and further enzyme-catalyzed DNA polymerization. This procedure is repeated a sufficient number of times to produce full-length genes which comprise mutants of the original template polynucleotides. These genes can be further amplified by the polymerase chain reaction and cloned into a vector for expression of the encoded proteins.
Recombination of polynucleotide sequences using random or defined primers
Arnold, Frances H. (Pasadena, CA); Shao, Zhixin (Pasadena, CA); Affholter, Joseph A. (Midland, MI); Zhao, Huimin H (San Diego, CA); Giver, Lorraine J. (Sunnyvale, CA)
2000-01-01T23:59:59.000Z
A method for in vitro mutagenesis and recombination of polynucleotide sequences based on polymerase-catalyzed extension of primer oligonucleotides is disclosed. The method involves priming template polynucleotide(s) with random-sequences or defined-sequence primers to generate a pool of short DNA fragments with a low level of point mutations. The DNA fragments are subjected to denaturization followed by annealing and further enzyme-catalyzed DNA polymerization. This procedure is repeated a sufficient number of times to produce full-length genes which comprise mutants of the original template polynucleotides. These genes can be further amplified by the polymerase chain reaction and cloned into a vector for expression of the encoded proteins.
Free Energy Fluctuations for Directed Polymers in Random Media in 1?+?1 Dimension
Borodin, Alexei
We consider two models for directed polymers in space-time independent random media (the O'Connell-Yor semidiscrete directed polymer and the continuum directed random polymer) at positive temperature and prove their KPZ ...
Randomization vs. Nondeterminisma What are the differences between randomized algorithms
Lyuu, Yuh-Dauh
Inequalitya Lemma 61 Let x be a random variable taking nonnegative integer values. Then for any k > 0, prob[ x
RandFile package for Mathematica for accessing file-based sources of randomness
J. A. Miszczak; M. Wahl
2015-03-15T23:59:59.000Z
We present a package for Mathematica computer algebra system which allows the exploitation of local files as sources of random data. We provide the description of the package and illustrate its usage by showing some examples. We also compare the provided functionality with alternative sources of randomness, namely a built-in pseudo-random generator and the package for accessing hardware true random number generators.
Randomized Algorithms with Splitting: Why the Classic Randomized Algorithms
Del Moral , Pierre
Randomized Algorithms with Splitting: Why the Classic Randomized Algorithms do not Work and how Abstract We show that the original classic randomized algorithms for approximate counting in NP simultaneously multiple Markov chains. We present several algorithms of the combined version, which we simple
Emergence of typical entanglement in two-party random processes
O. C. O. Dahlsten; R. Oliveira; M. B. Plenio
2007-01-17T23:59:59.000Z
We investigate the entanglement within a system undergoing a random, local process. We find that there is initially a phase of very fast generation and spread of entanglement. At the end of this phase the entanglement is typically maximal. In previous work we proved that the maximal entanglement is reached to a fixed arbitrary accuracy within $O(N^3)$ steps, where $N$ is the total number of qubits. Here we provide a detailed and more pedagogical proof. We demonstrate that one can use the so-called stabilizer gates to simulate this process efficiently on a classical computer. Furthermore, we discuss three ways of identifying the transition from the phase of rapid spread of entanglement to the stationary phase: (i) the time when saturation of the maximal entanglement is achieved, (ii) the cut-off moment, when the entanglement probability distribution is practically stationary, and (iii) the moment block entanglement scales exhibits volume scaling. We furthermore investigate the mixed state and multipartite setting. Numerically we find that classical and quantum correlations appear to behave similarly and that there is a well-behaved phase-space flow of entanglement properties towards an equilibrium, We describe how the emergence of typical entanglement can be used to create a much simpler tripartite entanglement description. The results form a bridge between certain abstract results concerning typical (also known as generic) entanglement relative to an unbiased distribution on pure states and the more physical picture of distributions emerging from random local interactions.
Zhao, Jun; Gligor, Virgil
2015-01-01T23:59:59.000Z
Random intersection graphs have received much interest and been used in diverse applications. They are naturally induced in modeling secure sensor networks under random key predistribution schemes, as well as in modeling the topologies of social networks including common-interest networks, collaboration networks, and actor networks. Simply put, a random intersection graph is constructed by assigning each node a set of items in some random manner and then putting an edge between any two nodes that share a certain number of items. Broadly speaking, our work is about analyzing random intersection graphs, and models generated by composing it with other random graph models including random geometric graphs and Erd\\H{o}s-R\\'enyi graphs. These compositional models are introduced to capture the characteristics of various complex natural or man-made networks more accurately than the existing models in the literature. For random intersection graphs and their compositions with other random graphs, we study properties su...
Random Selection for Drug Screening
Center for Human Reliability Studies
2007-05-01T23:59:59.000Z
Simple random sampling is generally the starting point for a random sampling process. This sampling technique ensures that each individual within a group (population) has an equal chance of being selected. There are a variety of ways to implement random sampling in a practical situation.
Clauser-Horne Bell test with imperfect random inputs
Xiao Yuan; Qi Zhao; Xiongfeng Ma
2015-05-16T23:59:59.000Z
Bell test is one of the most important tools in quantum information science. On the one hand, it enables fundamental test for the physics laws of nature, and on the other hand, it can be also applied in varieties of device independent tasks such as quantum key distribution and random number generation. In practice, loopholes existing in experimental demonstrations of Bell tests may affect the validity of the conclusions. In this work, we focus on the randomness (freewill) loophole and investigate the randomness requirement in a well-known Bell test, the Clauser-Horne test, under various conditions. With partially random inputs, we explicitly bound the Bell value for all local hidden variable models by optimizing the classical strategy. Our result thus puts input randomness requirement on the Clauser-Horne test under varieties of practical scenarios. The employed analysis technique can be generalized to other Bell's inequalities.
Component evolution in general random intersection graphs
Bradonjic, Milan [Los Alamos National Laboratory; Hagberg, Aric [Los Alamos National Laboratory; Hengartner, Nick [Los Alamos National Laboratory; Percus, Allon G [CLAREMONT GRADUATE UNIV.
2010-01-01T23:59:59.000Z
We analyze component evolution in general random intersection graphs (RIGs) and give conditions on existence and uniqueness of the giant component. Our techniques generalize the existing methods for analysis on component evolution in RIGs. That is, we analyze survival and extinction properties of a dependent, inhomogeneous Galton-Watson branching process on general RIGs. Our analysis relies on bounding the branching processes and inherits the fundamental concepts from the study on component evolution in Erdos-Renyi graphs. The main challenge becomes from the underlying structure of RIGs, when the number of offsprings follows a binomial distribution with a different number of nodes and different rate at each step during the evolution. RIGs can be interpreted as a model for large randomly formed non-metric data sets. Besides the mathematical analysis on component evolution, which we provide in this work, we perceive RIGs as an important random structure which has already found applications in social networks, epidemic networks, blog readership, or wireless sensor networks.
Small particle limits in a regularized Laplacian random growth model
Fredrik Johansson Viklund; Alan Sola; Amanda Turner
2013-10-23T23:59:59.000Z
We study a regularized version of Hastings-Levitov planar random growth that models clusters formed by the aggregation of diffusing particles. In this model, the growing clusters are defined in terms of iterated slit maps whose capacities are given by c_n=c|\\Phi_{n-1}'(e^{\\sigma+i\\theta_n})|^{-\\alpha}, \\alpha \\geq 0, where c>0 is the capacity of the first particle, {\\Phi_n}_n are the composed conformal maps defining the clusters of the evolution, {\\theta_n}_n are independent uniform angles determining the positions at which particles are attached, and \\sigma>0 is a regularization parameter which we take to depend on c. We prove that under an appropriate rescaling of time, in the limit as c converges to 0, the clusters converge to growing disks with deterministic capacities, provided that \\sigma does not converge to 0 too fast. We then establish scaling limits for the harmonic measure flow, showing that by letting \\alpha tend to 0 at different rates it converges to either the Brownian web on the circle, a stopped version of the Brownian web on the circle, or the identity map. As the harmonic measure flow is closely related to the internal branching structure within the cluster, the above three cases intuitively correspond to the number of infinite branches in the model being either 1, a random number whose distribution we obtain, or unbounded, in the limit as c converges to 0. We also present several findings based on simulations of the model with parameter choices not covered by our rigorous analysis.
Accelerated Randomized Benchmarking
Christopher Granade; Christopher Ferrie; D. G. Cory
2014-09-24T23:59:59.000Z
Quantum information processing offers promising advances for a wide range of fields and applications, provided that we can efficiently assess the performance of the control applied in candidate systems. That is, we must be able to determine whether we have implemented a desired gate, and refine accordingly. Randomized benchmarking reduces the difficulty of this task by exploiting symmetries in quantum operations. Here, we bound the resources required for benchmarking and show that, with prior information, we can achieve several orders of magnitude better accuracy than in traditional approaches to benchmarking. Moreover, by building on state-of-the-art classical algorithms, we reach these accuracies with near-optimal resources. Our approach requires an order of magnitude less data to achieve the same accuracies and to provide online estimates of the errors in the reported fidelities. We also show that our approach is useful for physical devices by comparing to simulations. Our results thus enable the application of randomized benchmarking in new regimes, and dramatically reduce the experimental effort required to assess control fidelities in quantum systems. Finally, our work is based on open-source scientific libraries, and can readily be applied in systems of interest.
Organization of growing random networks
Krapivsky, P. L.; Redner, S.
2001-06-01T23:59:59.000Z
The organizational development of growing random networks is investigated. These growing networks are built by adding nodes successively, and linking each to an earlier node of degree k with an attachment probability A{sub k}. When A{sub k} grows more slowly than linearly with k, the number of nodes with k links, N{sub k}(t), decays faster than a power law in k, while for A{sub k} growing faster than linearly in k, a single node emerges which connects to nearly all other nodes. When A{sub k} is asymptotically linear, N{sub k}(t){similar_to}tk{sup {minus}{nu}}, with {nu} dependent on details of the attachment probability, but in the range 2{lt}{nu}{lt}{infinity}. The combined age and degree distribution of nodes shows that old nodes typically have a large degree. There is also a significant correlation in the degrees of neighboring nodes, so that nodes of similar degree are more likely to be connected. The size distributions of the in and out components of the network with respect to a given node{emdash}namely, its {open_quotes}descendants{close_quotes} and {open_quotes}ancestors{close_quotes}{emdash}are also determined. The in component exhibits a robust s{sup {minus}2} power-law tail, where s is the component size. The out component has a typical size of order lnt, and it provides basic insights into the genealogy of the network.
Stephen Ng; Meg Walters
2014-09-19T23:59:59.000Z
Let $A$ be a Hermitian operator of order $n$. We show that for $k\\leq n$ sufficiently large, the eigenvalues of a compression of $A$ to a $k$-dimensional subspace are almost the same for all subspaces. We prove this result using the methods introduced in a paper by Chatterjee and Ledoux on eigenvalues of principle submatrices. We show that by choosing an appropriate Markov chain, the methods of Chatterjee and Ledoux can be applied to give a more general result on operator compressions. As an additional application of this method, we prove concentration of measure of the length of the longest increasing subsequence of a random walk distributed under the invariant measure for the asymmetric exclusion process.
Compendium of Experimental Cetane Numbers
Yanowitz, J.; Ratcliff, M. A.; McCormick, R. L.; Taylor, J. D.; Murphy, M. J.
2014-08-01T23:59:59.000Z
This report is an updated version of the 2004 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 March 2014 as well as a number of unpublished values, most measured over the past decade at the National Renewable Energy Laboratory. This Compendium contains cetane values for 389 pure compounds, including 189 hydrocarbons and 201 oxygenates. More than 250 individual measurements are new to this version of the Compendium. For many compounds, numerous measurements are included, often collected by different researchers using different methods. 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 has been expanded and the data has been annotated extensively to provide additional information that will help the reader judge the relative reliability of individual results.
Stretched Polymers in Random Environment
Dmitry Ioffe; Yvan Velenik
2011-03-01T23:59:59.000Z
We survey recent results and open questions on the ballistic phase of stretched polymers in both annealed and quenched random environments.
1 -Routing Number 2 -Account Number
Chen, Yiling
you will need: · Your Harvard University Id Number (HUID) · Your HUID pin number · Your Checking/Savings on the right side of the screen under Payroll and Compensation. #12;*Please, in an effort to save paper and if you do not wish to receive a paper copy of the check. Click the small box above the SAVE button. CLICK
Experimental quantum randomness generation invulnerable to the detection loophole
Gustavo Cańas; Jaime Carińe; Esteban S. Gómez; Johanna F. Barra; Adán Cabello; Guilherme B. Xavier; Gustavo Lima; Marcin Paw?owski
2014-10-28T23:59:59.000Z
Random numbers are essential for multiple applications, including cryptography, financial security, digital rights management and scientific simulations. However, producing random numbers from a finite state machine, such as a classical computer, is impossible. One option is to use conventional quantum random number generators (QRNGs) based on the intrinsic uncertainty of quantum measurement outcomes. The problem in this case is that private randomness relies on assumptions on the internal functioning of the measurement devices. "Device-independent" QRNGs not relying on devices inner workings assumptions can be built but are impractical. They require a detection efficiency that, so far, has only be achieved with trapped ions and with photons detected with transition-edge superconducting sensors. Here we introduce a novel protocol for quantum private randomness generation that makes no assumption on the functioning of the devices and works even with very low detection efficiency. We implement the protocol using weak coherent states and standard single-photon detectors. Our results pave the way towards a second generation of more secure practical QRNGs.
Random Curves by Conformal Welding
K. Astala; P. Jones; A. Kupiainen; E. Saksman
2009-12-17T23:59:59.000Z
We construct a conformally invariant random family of closed curves in the plane by welding of random homeomorphisms of the unit circle given in terms of the exponential of Gaussian Free Field. We conjecture that our curves are locally related to SLE$(\\kappa)$ for $\\kappa<4$.
Random Curves by Conformal Welding
Astala, K; Kupiainen, A; Saksman, E
2009-01-01T23:59:59.000Z
We construct a conformally invariant random family of closed curves in the plane by welding of random homeomorphisms of the unit circle given in terms of the exponential of Gaussian Free Field. We conjecture that our curves are locally related to SLE$(\\kappa)$ for $\\kappa<4$.
Certified counting of roots of random univariate polynomials
Joseph Cleveland; Jeffrey Dzugan; Jonathan D. Hauenstein; Ian Haywood; Dhagash Mehta; Anthony Morse; Leonardo Robol; Taylor Schlenk
2014-12-04T23:59:59.000Z
A challenging problem in computational mathematics is to compute roots of a high-degree univariate random polynomial. We combine an efficient multiprecision implementation for solving high-degree random polynomials with two certification methods, namely Smale's $\\alpha$-theory and one based on Gerschgorin's theorem, for showing that a given numerical approximation is in the quadratic convergence region of Newton's method of some exact solution. With this combination, we can certifiably count the number of real roots of random polynomials. We quantify the difference between the two certification procedures and list the salient features of both of them. After benchmarking on random polynomials where the coefficients are drawn from the Gaussian distribution, we obtain novel experimental results for the Cauchy distribution case.
Student ID (R) Number ________________________ Semester/Year______ ________________________
Rock, Chris
Student ID (R) Number ________________________ Semester/Year______ ________________________ THIRD: ______________________________________________________ CHECK ALL THAT APPLY: _____First-time Third Party Student _____TTU Campus Student _____Non sponsor and the Third Party Sponsor Agreement prior to the due date to ensure timely posting of third
Multilayer parking with screening on a random tree
S. R. Fleurke; C. Kuelske
2009-11-05T23:59:59.000Z
In this paper we present a multilayer particle deposition model on a random tree. We derive the time dependent densities of the first and second layer analytically and show that in all trees the limiting density of the first layer exceeds the density in the second layer. We also provide a procedure to calculate higher layer densities and prove that random trees have a higher limiting density in the first layer than regular trees. Finally, we compare densities between the first and second layer and between regular and random trees.
2.017J / 1.015J Design of Systems Operating in Random Environments, Spring 2006
Hover, Franz
This class covers the principles for optimal performance and survival of extreme events in a random environment; linear time invariant systems and Fourier transform; random processes, autocorrelation function, and power ...
Nash Equilibria in Random Games Imre Brny,1,2,
Bárány, Imre
Nash Equilibria in Random Games Imre Bárány,1,2, * Santosh Vempala,3, Adrian Vetta4, 1 Rényi.interscience.wiley.com). DOI 10.1002/rsa.20199 ABSTRACT: We consider Nash equilibria in 2-player random games and analyze a Nash equilibrium; on m × n payoff matrices, it runs in time O(m2 n log log n + n2 m log log m
Number of peer-reviewed publications
·Number of peer- reviewed publications produced per year ·Data accurate as of 02 April 2012 · Number of publications produced per institution (top 10) ·Collaborations counted multiple times · Non-cumulative number of citations received by OER publications per year ·Data accurate as of 02 April 2012 · The work
Carl A. Miller; Yaoyun Shi
2015-04-10T23:59:59.000Z
Randomness is a vital resource for modern day information processing, especially for cryptography. A wide range of applications critically rely on abundant, high quality random numbers generated securely. Here we show how to expand a random seed at an exponential rate without trusting the underlying quantum devices. Our approach is secure against the most general adversaries, and has the following new features: cryptographic quality output security, tolerating a constant level of implementation imprecision, requiring only a constant size quantum memory for the honest implementation, and allowing a large natural class of constructions. In conjunct with a recent work by Chung, Shi and Wu (QIP 2014), it also leads to robust unbounded expansion using just 2 multi-part devices. When adapted for distributing cryptographic keys, our method achieves, for the first time, exponential expansion combined with cryptographic security and noise tolerance. The proof proceeds by showing that the Renyi divergence of the outputs of the protocol (for a specific bounding operator) decreases linearly as the protocol iterates. At the heart of the proof are a new uncertainty principle on quantum measurements, and a method for simulating trusted measurements with untrusted devices.
Enumeration of RNA complexes via random matrix theory
Jřrgen E. Andersen; Leonid O. Chekhov; R. C. Penner; Christian M. Reidys; Piotr Su?kowski
2013-03-06T23:59:59.000Z
We review a derivation of the numbers of RNA complexes of an arbitrary topology. These numbers are encoded in the free energy of the hermitian matrix model with potential V(x)=x^2/2-stx/(1-tx), where s and t are respective generating parameters for the number of RNA molecules and hydrogen bonds in a given complex. The free energies of this matrix model are computed using the so-called topological recursion, which is a powerful new formalism arising from random matrix theory. These numbers of RNA complexes also have profound meaning in mathematics: they provide the number of chord diagrams of fixed genus with specified numbers of backbones and chords as well as the number of cells in Riemann's moduli spaces for bordered surfaces of fixed topological type.
Random wave functions and percolation
E. Bogomolny; C. Schmit
2007-08-31T23:59:59.000Z
Recently it was conjectured that nodal domains of random wave functions are adequately described by critical percolation theory. In this paper we strengthen this conjecture in two respects. First, we show that, though wave function correlations decay slowly, a careful use of Harris' criterion confirms that these correlations are unessential and nodal domains of random wave functions belong to the same universality class as non critical percolation. Second, we argue that level domains of random wave functions are described by the non-critical percolation model.
Minimum Bit Error Probability of Large Randomly Spread MCCDMA Systems in
MĂĽller, Ralf R.
Minimum Bit Error Probability of Large Randomly Spread MCÂCDMA Systems in Multipath Rayleigh Fading, to calculate the bit error probaÂ bility in the large system limit for randomly assigned spreading sequences detecÂ tion with is accurate if the number of users and the spreading factor are large. His calculations
Minimum Bit Error Probability of Large Randomly Spread MC-CDMA Systems in
MĂĽller, Ralf R.
Minimum Bit Error Probability of Large Randomly Spread MC-CDMA Systems in Multipath Rayleigh Fading, to calculate the bit error proba- bility in the large system limit for randomly assigned spreading sequences detec- tion with is accurate if the number of users and the spreading factor are large. His calculations
Saldin, Dilano
SOLVING VIRUS STRUCTURES FROM XFEL DIFFRACTION PATTERNS OF RANDOM PARTICLE ORIENTATIONS USING August 2013 #12;ABSTRACT SOLVING VIRUS STRUCTURES FROM XFEL DIFFRACTION PATTERNS OF RANDOM PARTICLE such as viruses. To quote from Caspar and Klug [2] "there are only a limited number of efficient designs possible
Ancillary Statistics In a parametric model f (y; ) for a random variable
Reid, Nancy
Ancillary Statistics In a parametric model f (y; ) for a random variable or vector Y, a statistic A = a(Y) is ancillary for if the distribution of A does not depend on . As a very simple example, if Y is determined randomly, rather than being fixed in advance, then A = number of observations in Y is an ancillary
Random Search Algorithms Zelda B. Zabinsky
Del Moral , Pierre
Random Search Algorithms Zelda B. Zabinsky April 5, 2009 Abstract Random search algorithms with convergence results in probability. Random search algorithms include simulated an- nealing, tabu search, genetic algorithms, evolutionary programming, particle swarm optimization, ant colony optimization, cross
Keller, Ursula
, Sweden 2 Institute of Physics and Astronomy, University of Aarhus, DK-8000 Aarhus C, Denmark 3 Department (Received 14 November 2001; published 25 April 2002) We present energy-resolved crossRevLett.88.193901 PACS numbers: 42.65.Ky, 32.80.Rm The production of high-order harmonics by an intense laser
Random Selection for Drug Screening
Center for Human Reliability Studies
2007-05-01T23:59:59.000Z
Sampling is the process of choosing some members out of a group or population. Probablity sampling, or random sampling, is the process of selecting members by chance with a known probability of each individual being chosen.
Randomized algorithms for reliable broadcast
Vaikuntanathan, Vinod
2009-01-01T23:59:59.000Z
In this thesis, we design randomized algorithms for classical problems in fault tolerant distributed computing in the full-information model. The full-information model is a strong adversarial model which imposes no ...
On Randomness in Quantum Mechanics
Alberto C. de la Torre
2007-07-19T23:59:59.000Z
The quantum mechanical probability densities are compared with the probability densities treated by the theory of random variables. The relevance of their difference for the interpretation of quantum mechanics is commented.
RANDOM WALK IN RANDOM ENVIRONMENT IN A TWO-DIMENSIONAL STRATIFIED MEDIUM WITH ORIENTATIONS
Paris-Sud XI, Université de
RANDOM WALK IN RANDOM ENVIRONMENT IN A TWO-DIMENSIONAL STRATIFIED MEDIUM WITH ORIENTATIONS ALEXIS oriented lattices, random walk in random environment, random walk in random scenery, functional limit-00634636,version2-24Nov2012 #12;RWRE IN A STRATIFIED ORIENTED MEDIUM 2 We denote by E and E
Lee, Chi-Guhn
A Multi-Price Inventory Model with Random Discount Prices Mohammad Mahdi Tajbakhsh1, Chi-Guhn Lee1 deal offers with a random discount price at random points in time. Assuming that the demand is constant over time, lead times are negligible, discount offerings follow a Poisson process, and discount price
Internet Usage Mining Using Random Forests
Liu, Xuening
2013-01-01T23:59:59.000Z
Los Angeles Internet Usage Mining Using Random Forests Aof the Thesis Internet Usage Mining Using Random Forests bydata emerges, data mining is finally in the spotlight. This
Orozco, Luis A.
, 42.50.Ct The seminal work of Hanbury-Brown and Twiss [1] marks the beginning of the systematic study-Brown and Twiss to record the conditional time evolution of the amplitude fluctuations of an electromagnetic wave
One-time pad booster for Internet
Geraldo A. Barbosa
2007-04-11T23:59:59.000Z
One-time pad encrypted files can be sent through Internet channels using current Internet protocols. However, the need for renewing shared secret keys make this method unpractical. This work shows how users can use a fast physical random generator based on fluctuations of a light field and the Internet channel to directly boost key renewals. The transmitted signals are deterministic but carries imprinted noise that cannot be eliminated by the attacker. Thus, a one-time pad for Internet can be made practical. Security is achieved without third parties and not relying on the difficulty of factoring numbers in primes. An informational fragility to be avoided is discussed. Information-theoretic analysis is presented and bounds for secure operation are determined.
Record statistics in random vectors and quantum chaos
Srivastava, Shashi C L; Jain, Sudhir R
2012-01-01T23:59:59.000Z
The record statistics of complex random states are analytically calculated, and shown that the probability of a record intensity is a Bernoulli process. The correlation due to normalization leads to a probability distribution of the records that is non-universal but tends to the Gumbel distribution asymptotically. The quantum standard map is used to study these statistics for the effect of correlations apart from normalization. It is seen that in the mixed phase space regime the number of intensity records is a power law in the dimensionality of the state as opposed to the logarithmic growth for random states.
Tetrahedral colloidal clusters from random parking of bidisperse spheres
Nicholas B. Schade; Miranda C. Holmes-Cerfon; Elizabeth R. Chen; Dina Aronzon; Jesse W. Collins; Jonathan A. Fan; Federico Capasso; Vinothan N. Manoharan
2012-12-26T23:59:59.000Z
Using experiments and simulations, we investigate the clusters that form when colloidal spheres stick irreversibly to -- or "park" on -- smaller spheres. We use either oppositely charged particles or particles labeled with complementary DNA sequences, and we vary the ratio $\\alpha$ of large to small sphere radii. Once bound, the large spheres cannot rearrange, and thus the clusters do not form dense or symmetric packings. Nevertheless, this stochastic aggregation process yields a remarkably narrow distribution of clusters with nearly 90% tetrahedra at $\\alpha=2.45$. The high yield of tetrahedra, which reaches 100% in simulations at $\\alpha=2.41$, arises not simply because of packing constraints, but also because of the existence of a long-time lower bound that we call the "minimum parking" number. We derive this lower bound from solutions to the classic mathematical problem of spherical covering, and we show that there is a critical size ratio $\\alpha_c=(1+\\sqrt{2})\\approx 2.41$, close to the observed point of maximum yield, where the lower bound equals the upper bound set by packing constraints. The emergence of a critical value in a random aggregation process offers a robust method to assemble uniform clusters for a variety of applications, including metamaterials.
Time Constrained Randomized Path Planning Using Spatial Networks Christopher Lum*
of Aeronautics and Astronautics University of Washington Seattle, WA 98195, USA lum@u.washington.edu Rolf Rysdyk** Department of Aeronautics and Astronautics University of Washington Seattle, WA 98195, USA rysdyk. Department of Aeronautics and Astronautics. **Assistant Professor. Department of Aeronautics and Astronautics
Homogeneous Random Measures and Strongly Supermedian Kernels
Fitzsimmons, Patrick J.
. Keywords and phrases: Homogeneous random measure, additive functional, Kuznets* *ov measure, potential
Multispecies weighted Hurwitz numbers
Harnad, J
2015-01-01T23:59:59.000Z
The construction of hypergeometric 2D Toda $\\tau$-functions as generating functions for weighted Hurwitz numbers is extended to multispecies families. Both the enumerative geometrical significance of multispecies weighted Hurwitz numbers as weighted enumerations of branched coverings of the Riemann sphere and their combinatorial significance in terms of weighted paths in the Cayley graph of $S_n$ are derived. The particular case of multispecies quantum weighted Hurwitz numbers is studied in detail.
Curvature and Tachibana numbers
Stepanov, Sergey E [Finance Academy under the Government of the Russian Federation, Moscow (Russian Federation)
2011-07-31T23:59:59.000Z
The aim of this paper is to define the rth Tachibana number t{sub r} of an n-dimensional compact oriented Riemannian manifold as the dimension of the space of conformally Killing r-forms, for r=1,2,...,n-1. We also describe properties of these numbers, by analogy with properties of the Betti numbers b{sub r} of a compact oriented Riemannian manifold. Bibliography: 25 titles.
Renormalized energy concentration in random matrices
Alexei Borodin; Sylvia Serfaty
2012-10-23T23:59:59.000Z
We define a "renormalized energy" as an explicit functional on arbitrary point configurations of constant average density in the plane and on the real line. The definition is inspired by ideas of [SS1,SS3]. Roughly speaking, it is obtained by subtracting two leading terms from the Coulomb potential on a growing number of charges. The functional is expected to be a good measure of disorder of a configuration of points. We give certain formulas for its expectation for general stationary random point processes. For the random matrix $\\beta$-sine processes on the real line (beta=1,2,4), and Ginibre point process and zeros of Gaussian analytic functions process in the plane, we compute the expectation explicitly. Moreover, we prove that for these processes the variance of the renormalized energy vanishes, which shows concentration near the expected value. We also prove that the beta=2 sine process minimizes the renormalized energy in the class of determinantal point processes with translation invariant correlation kernels.
Showalter, Kenneth
developments and experimental applications of feedback control to nonlinear dynamical systems [211]. Recent of Dynamical Systems from Time Series Valery Petrov and Kenneth Showalter* Department of Chemistry, West of multidimensional, nonlinear single-input single-output systems is formulated in terms of an invariant hypersurface
Two regimes in the regularity of sunspot number
Shapoval, A.; Shnirman, M. [IEPT RAS, Profsoyuznaya str. 84/32, 117997 Moscow (Russian Federation); Le Mouël, J. L.; Courtillot, V. [IPGP, 1 rue Jussieu, F-75005, Paris (France)
2013-12-20T23:59:59.000Z
Sunspot numbers WN display quasi-periodical variations that undergo regime changes. These irregularities could indicate a chaotic system and be measured by Lyapunov exponents. We define a functional ? (an 'irregularity index') that is close to the (maximal) Lyapunov exponent for dynamical systems and well defined for series with a random component: this allows one to work with sunspot numbers. We compute ? for the daily WN from 1850 to 2012 within 4 yr sliding windows: ? exhibit sharp maxima at solar minima and secondary maxima at solar maxima. This pattern is reflected in the ratio R of the amplitudes of the main versus secondary peaks. Two regimes have alternated in the past 150 yr, R1 from 1850 to 1915 (large ? and R values) and R2 from 1935 to 2005 (shrinking difference between main and secondary maxima, R values between 1 and 2). We build an autoregressive model consisting of Poisson noise plus an 11 yr cycle and compute its irregularity index. The transition from R1 to R2 can be reproduced by strengthening the autocorrelation a of the model series. The features of the two regimes are stable for model and WN with respect to embedding dimension and delay. Near the time of the last solar minimum (?2008), the irregularity index exhibits a peak similar to the peaks observed before 1915. This might signal a regime change back from R2 to R1 and the onset of a significant decrease of solar activity.
Random sequential adsorption of tetramers
Micha? Cie?la
2013-06-12T23:59:59.000Z
Adsorption of tetramer built of four identical spheres was studied numerically using the Random Sequential Adsorption (RSA) algorithm. Tetramers were adsorbed on a two dimensional, flat and homogeneous surface. Two different models of the adsorbate were investigated: a rhomboid and a square one; monomer centres were put on vertices of rhomboids and squares, respectively. Numerical simulations allow to establish the maximal random coverage ratio as well as the Available Surface Function (ASF), which is crucial for determining kinetics of the adsorption process. These results were compared with data obtained experimentally for KfrA plasmid adsorption. Additionally, the density autocorrelation function was measured.
The deterministic chaos and random noise in turbulent jet
Yao, Tian-Liang [Key Laboratory of Coal Gasification and Energy Chemical Engineering of Ministry of Education, East China University of Science and Technology, P.O. Box 272, Shanghai 200237 (China); Shanghai Institute of Space Propulsion, Shanghai 201112 (China); Shanghai Engineering Research Center of Space Engine, Shanghai Institute of Space Propulsion, Shanghai 201112 (China); Liu, Hai-Feng, E-mail: hfliu@ecust.edu.cn; Xu, Jian-Liang; Li, Wei-Feng [Key Laboratory of Coal Gasification and Energy Chemical Engineering of Ministry of Education, East China University of Science and Technology, P.O. Box 272, Shanghai 200237 (China)
2014-06-01T23:59:59.000Z
A turbulent flow is usually treated as a superposition of coherent structure and incoherent turbulence. In this paper, the largest Lyapunov exponent and the random noise in the near field of round jet and plane jet are estimated with our previously proposed method of chaotic time series analysis [T. L. Yao, et al., Chaos 22, 033102 (2012)]. The results show that the largest Lyapunov exponents of the round jet and plane jet are in direct proportion to the reciprocal of the integral time scale of turbulence, which is in accordance with the results of the dimensional analysis, and the proportionality coefficients are equal. In addition, the random noise of the round jet and plane jet has the same linear relation with the Kolmogorov velocity scale of turbulence. As a result, the random noise may well be from the incoherent disturbance in turbulence, and the coherent structure in turbulence may well follow the rule of chaotic motion.
RANDOM WALK IN RANDOM ENVIRONMENT IN A TWO-DIMENSIONAL STRATIFIED MEDIUM WITH ORIENTATIONS
Pčne, Françoise
RANDOM WALK IN RANDOM ENVIRONMENT IN A TWO-DIMENSIONAL STRATIFIED MEDIUM WITH ORIENTATIONS ALEXIS walk in random environment, random walk in random scenery, functional limit theorem, transience. This research was supported by the french ANR project MEMEMO2. 1 #12;RWRE IN A STRATIFIED ORIENTED MEDIUM 2 Our
Supersymmetry in Random Matrix Theory
Thomas Guhr
2010-05-06T23:59:59.000Z
Supersymmetry is nowadays indispensable for many problems in Random Matrix Theory. It is presented here with an emphasis on conceptual and structural issues. An introduction to supermathematics is given. The Hubbard-Stratonovich transformation as well as its generalization and superbosonization are explained. The supersymmetric non-linear sigma model, Brownian motion in superspace and the color-flavor transformation are discussed.
Geometrical accumulations and computably enumerable real numbers
Durand-Lose, JĂ©rĂ´me
Geometrical accumulations and computably enumerable real numbers (extended abstract) J and space are continuous and accumulations can be devised to unlimitedly accelerate a computation with rational numbers for coordinates and speeds, the time of any accumulation is a c.e. (compu- tably
LYAPUNOV EXPONENTS FOR POSITION DEPENDENT RANDOM MAPS: FORMULAE AND APPLICATIONS.
of the interval. We then apply our results to a financial market model with short-lived assets. 1. Introduction]. A random map is a discrete time dynamical system consisting of a collection of transformations {k our theoretical results to a financial market model with short- lived assets [5]. In particular, when
Topological and Dynamical Complexity of Random Neural Networks
Gilles Wainrib; Jonathan Touboul
2013-03-15T23:59:59.000Z
Random neural networks are dynamical descriptions of randomly interconnected neural units. These show a phase transition to chaos as a disorder parameter is increased. The microscopic mechanisms underlying this phase transition are unknown, and similarly to spin-glasses, shall be fundamentally related to the behavior of the system. In this Letter we investigate the explosion of complexity arising near that phase transition. We show that the mean number of equilibria undergoes a sharp transition from one equilibrium to a very large number scaling exponentially with the dimension on the system. Near criticality, we compute the exponential rate of divergence, called topological complexity. Strikingly, we show that it behaves exactly as the maximal Lyapunov exponent, a classical measure of dynamical complexity. This relationship unravels a microscopic mechanism leading to chaos which we further demonstrate on a simpler class of disordered systems, suggesting a deep and underexplored link between topological and dynamical complexity.
Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site
September 2002 Page 1 KPA Activity Number KPA Activity SEM Section SME Work Product SQSE Web Site http:cio.doe.govsqse REQUIREMENTS MANAGEMENT RM-1 The software engineering...
Co-adapted coupling Random walk on Zn 2 Random walk on Gn
Co-adapted coupling Random walk on Zn 2 Random walk on Gn d Optimal co-adapted coupling Stephen Connor sbc502@york.ac.uk #12;Co-adapted coupling Random walk on Zn 2 Random walk on Gn d Outline 1 Co-adapted coupling 2 Simple random walk on the hypercube, Zn 2 3 Simple random walk on Gn d #12;Co-adapted coupling
Title of dissertation: SCATTERING FROM CHAOTIC CAVITIES: EXPLORING THE RANDOM COUPLING MODEL
Anlage, Steven
ABSTRACT Title of dissertation: SCATTERING FROM CHAOTIC CAVITIES: EXPLORING THE RANDOM COUPLING MODEL IN THE TIME AND FREQUENCY DOMAINS James Hart, Doctor of Philosophy, 2009 Dissertation directed by in the frequency do- main. In the first part of this dissertation, we explore the implications of the Random
Upper bounds on wavepacket spreading for random Jacobi matrices
Svetlana Jitomirskaya; Hermann Schulz-Baldes
2007-02-15T23:59:59.000Z
A method is presented for proving upper bounds on the moments of the position operator when the dynamics of quantum wavepackets is governed by a random (possibly correlated) Jacobi matrix. As an application, one obtains sharp upper bounds on the diffusion exponents for random polymer models, coinciding with the lower bounds obtained in a prior work. The second application is an elementary argument (not using multiscale analysis or the Aizenman-Molchanov method) showing that under the condition of uniformly positive Lyapunov exponents, the moments of the position operator grow at most logarithmically in time.
KNOTS AND RANDOM WALKS IN VIBRATED GRANULAR CHAINS
E. BEN-NAIM; ET AL
2000-08-01T23:59:59.000Z
The authors study experimentally statistical properties of the opening times of knots in vertically vibrated granular chains. Our measurements are in good qualitative and quantitative agreement with a theoretical model involving three random walks interacting via hard core exclusion in one spatial dimension. In particular, the knot survival probability follows a universal scaling function which is independent of the chain length, with a corresponding diffusive characteristic time scale. Both the large-exit-time and the small-exit-time tails of the distribution are suppressed exponentially, and the corresponding decay coefficients are in excellent agreement with the theoretical values.
Orderly Spectra from Random Interactions
Johnson, C.W. [Department of Physics and Astronomy, Louisiana State University, Baton Rouge, Louisiana 70803-4001 (United States)] [Department of Physics and Astronomy, Louisiana State University, Baton Rouge, Louisiana 70803-4001 (United States); Bertsch, G.F. [Department of Physics, FM-15, University of Washington, Seattle, Washington 98195 (United States)] [Department of Physics, FM-15, University of Washington, Seattle, Washington 98195 (United States); Dean, D.J.; Dean, D.J. [Department of Physics and Astronomy, University of Tennessee, Knoxville, Tennessee 37996 (United States) [Department of Physics and Astronomy, University of Tennessee, Knoxville, Tennessee 37996 (United States); Department of Physics and Astronomy, Louisiana State University, Baton Rouge, Louisiana 70803-4001 (United States)
1998-03-01T23:59:59.000Z
We investigate the low-lying spectra of many-body systems with random two-body interactions, specifying that the ensemble be invariant under particle-hole conjugation. Surprisingly we find patterns reminiscent of more orderly interactions, such as a predominance of J=0 ground states separated by a gap from the excited states, and evidence of phonon vibrations in the low-lying spectra. {copyright} {ital 1998} {ital The American Physical Society}
Hydrodynamical random walker with chemotactic memory
H. Mohammady; B. Esckandariun; A. Najafi
2014-10-01T23:59:59.000Z
A three-dimensional hydrodynamical model for a micro random walker is combined with the idea of chemotactic signaling network of E. coli. Diffusion exponents, orientational correlation functions and their dependence on the geometrical and dynamical parameters of the system are analyzed numerically. Because of the chemotactic memory, the walker shows superdiffusing displacements in all directions with the largest diffusion exponent for a direction along the food gradient. Mean square displacements and orientational correlation functions show that the chemotactic memory washes out all the signatures due to the geometrical asymmetry of the walker and statistical properties are asymmetric only with respect to the direction of food gradient. For different values of the memory time, the Chemotactic index (CI) is also calculated.
Introduction to Network Science 1 Random Models
Safro, Ilya
to the degree distribution in random model ... #12;Introduction to Network Science 4 In contrast to the degree distribution in random model ... #12;Introduction to Network Science 5 Newman, "Random graphs as models of vertices. Average component size #12;Introduction to Network Science 15 Distribution of component sizes #12;
Choosing a Random Peer [Extended Abstract
Saia, Jared
damental statistical operation; a function which chooses a random peer can be used for many types collection by statistically rig orous sampling methods; to provide support for randomized, distributed algorithms over peertopeer networks; and to support the creation and maintenance of random links
Choosing a Random Peer [Extended Abstract
Saia, Jared
- damental statistical operation; a function which chooses a random peer can be used for many types collection by statistically rig- orous sampling methods; to provide support for randomized, distributed algorithms over peer-to-peer networks; and to support the creation and maintenance of random links
Ultra-fast quantum randomness generation by accelerated phase diffusion in a pulsed laser diode
C. Abellan; W. Amaya; M. Jofre; M. Curty; A. Acin; J. Capmany; V. Pruneri; M. W. Mitchell
2014-01-22T23:59:59.000Z
We demonstrate a high bit-rate quantum random number generator by interferometric detection of phase diffusion in a gain-switched DFB laser diode. Gain switching at few-GHz frequencies produces a train of bright pulses with nearly equal amplitudes and random phases. An unbalanced Mach-Zehnder interferometer is used to interfere subsequent pulses and thereby generate strong random-amplitude pulses, which are detected and digitized to produce a high-rate random bit string. Using established models of semiconductor laser field dynamics, we predict a regime of high visibility interference and nearly complete vacuum-fluctuation-induced phase diffusion between pulses. These are confirmed by measurement of pulse power statistics at the output of the interferometer. Using a 5.825 GHz excitation rate and 14-bit digitization, we observe 43 Gbps quantum randomness generation.
Calgary, University of
integrates a rotary steerable #12;iii system (RSS) and MWD tool into one drilling probe utilizing inertial) tool, which in current technology is installed several feet behind the drill bit. ValuesUCGE Reports Number 20284 Department of Geomatics Engineering Continuous Measurement-While-Drilling
Calgary, University of
in considerable operational cost savings for many exploration and open-pit mining companies in the energy sectorUCGE Reports Number 20146 Department of Geomatics Engineering Development of a Mobile Equipment Equipment Management System solution. In the open-pit mining industries there is a need for these companies
Student Code Number: Thermodynamics
Feeny, Brian
Student Code Number: Thermodynamics Ph.D. Qualifying Exam Department of Mechanical Engineering;Thermodynamics Qualifier January 2013 Problem 1 Air is compressed in an axial-flow compressor operating at steady of exergy destruction within the compressor, in kJ per kg of air flowing. #12;Thermodynamics Qualifier
Australia NO REGISTRATION NUMBER
#12;#12;Australia Austria Belgium Cyprus France Germany Greece Ireland Italy Japan Macedonia Ireland Italy Japan Macedonia Portugal Romania Slovenia Spain Turkey UK USA #12;NO REGISTRATION NUMBER 1 Totalregisteredparticipants:71 9 Italy 15 10 Japan 3 11 Macedonia 3 12 Portugal 2 13 Romania 3 14 Slovenia 2 15 Spain 2 16
Quantum random walks without walking
Manouchehri, K.; Wang, J. B. [School of Physics, University of Western Australia, 35 Stirling Highway, Crawley WA 6009 (Australia)
2009-12-15T23:59:59.000Z
Quantum random walks have received much interest due to their nonintuitive dynamics, which may hold the key to a new generation of quantum algorithms. What remains a major challenge is a physical realization that is experimentally viable and not limited to special connectivity criteria. We present a scheme for walking on arbitrarily complex graphs, which can be realized using a variety of quantum systems such as a Bose-Einstein condensate trapped inside an optical lattice. This scheme is particularly elegant since the walker is not required to physically step between the nodes; only flipping coins is sufficient.
Random sets and confidence procedures
Barnett, William A.
1979-06-01T23:59:59.000Z
) —* (Y, -T, (Qe)eee) be a random set with Y C ^ ( 0 ) - {0} and with Qe the probability distribution of S induced on Y by P0. Assume that S is surjective. The relation of statistical confidence sets to the following definition will be investigated... of confidence procedures now can be defined. DEFINITION 6. Let S be a confidence procedure. Then S has (lower) confidence level y — inl{Q6{ęe) \\ 6 ^ Q). If S is a confidence pro cedure, and if x E ST, then S(x) will be called a confidence subset of 0...
H. Dehling; S. R. Fleurke; C. Kuelske
2007-11-26T23:59:59.000Z
Consider an infinite tree with random degrees, i.i.d. over the sites, with a prescribed probability distribution with generating function G(s). We consider the following variation of Renyi's parking problem, alternatively called blocking RSA: at every vertex of the tree a particle (or car) arrives with rate one. The particle sticks to the vertex whenever the vertex and all of its nearest neighbors are not occupied yet. We provide an explicit expression for the so-called parking constant in terms of the generating function.
BERKELEY EMERITI TIMES March 2013 Volume 22, Number 4
Alvarez-Cohen, Lisa
and Developmental Biology, Howard Hughes Investigator The 21st-Century Publication Saturday, March 16 in 1976. Since 1991, he has been a Howard Hughes Medical Insti- tute Investigator secretion. Using baker's yeast as a model, he has used genetic and biochemistry techniques to dissect
Number Sec CRN Days Time Room Instructor Office 10800 001 ...
... MWF 10:30AM-11:20AM SMTH 201 Nicholas Morris MATH G136 15300 065 .... Jake Desmond MATH 701 16500 141 42956 R 02:30PM-03:20PM UNIV 219 ...
Number Sec CRN Days Time Room Instructor Office 15300 001 ...
... David McReynolds MATH 704 59800 020 22890 TR 02:00PM-04:50PM UNIV 119 David Goldberg MATH 628 59800 021 22931 - - David McReynolds MATH ...
Number Sec CRN Days Time Room Instructor Office 10800 001 ...
... 59997 T 04:30PM-05:20PM ME 1061 Richard Penney MATH 822 17300 011 23132 MWF 12:30PM-01:20PM UNIV 117 David McReynolds MATH 704 17300
Number Sec CRN Days Time Room Instructor Office 69900 061 ...
... McReynolds MATH 704 59800 518 65933 F 11:30AM-12:20PM REC 123 David McReynolds MATH 704 15300 083 22970 MWF 08:30AM-09:20AM UNIV 217 ...
Number Sec CRN Days Time Room Instructor Office 13700 011 ...
... McReynolds MATH 704 37500 043 15836 TR 12:00PM-01:15PM UNIV 003 David McReynolds MATH 704 38500 121 22143 TR 10:30AM-11:45AM UNIV 117 ...
Number Sec CRN Days Time Room Instructor Office 26200 052 ...
... 003 David McReynolds MATH 704 37500 042 15835 TR 10:30AM-11:45AM UNIV 003 David McReynolds MATH 704 59800 047 18796 - - David McReynolds
Number Sec CRN Days Time Room Instructor Office 15300 001 ...
... Peter Weigel MATH 1046 59800 015 24751 - - David McReynolds MATH 704 59800 016 24753 TR 02:30PM-05:20PM MATH 205 David McReynolds MATH ...
Acceleration of particles in an isotropic random force field
Hector Javier Durand-Manterola
2012-04-18T23:59:59.000Z
If we have a particle immersed in a field of random forces, each interaction of the particle with the field can enlarge or diminish its kinetic energy. In this work is shown that in general, for any field of random force with uniform distribution of directions, the probability to gain kinetic energy is larger that the probability to lose it. Therefore, if the particle is submitted to a great number of interactions with the force stochastic field, the final result will be that the particle will gain energy. The probability to gain energy in each interaction is Pg=1/2 (1+T/(2Po)), where T is the impulse given by the field and Po is the momentum of the particle before the interaction. The probability to lose energy in each interaction is Pl=1/2 (1-T/(2Po)).
Compendium of Experimental Cetane Number Data
Murphy, M. J.; Taylor, J. D.; McCormick, R. L.
2004-09-01T23:59:59.000Z
In this report, we present a compilation of reported cetane numbers for pure chemical compounds. The compiled database contains cetane values for 299 pure compounds, including 156 hydrocarbons and 143 oxygenates. Cetane number is a relative ranking of fuels based on the amount of time between fuel injection and ignition. The cetane number is typically measured either in a combustion bomb or in a single-cylinder research engine. This report includes cetane values from several different measurement techniques - each of which has associated uncertainties. Additionally, many of the reported values are determined by measuring blending cetane numbers, which introduces significant error. In many cases, the measurement technique is not reported nor is there any discussion about the purity of the compounds. Nonetheless, the data in this report represent the best pure compound cetane number values available from the literature as of August 2004.
Bridges in the random-cluster model
Elçi, Eren Metin; Fytas, Nikolaos G
2015-01-01T23:59:59.000Z
The random-cluster model, a correlated bond percolation model, unifies a range of important models of statistical mechanics in one description, including independent bond percolation, the Potts model and uniform spanning trees. By introducing a classification of edges based on their relevance to the connectivity we study the stability of clusters in this model. We derive several exact relations for general graphs that allow us to derive unambiguously the finite-size scaling behavior of the density of bridges and non-bridges. For percolation, we are also able to characterize the point for which clusters become maximally fragile and show that it is connected to the concept of the bridge load. Combining our exact treatment with further results from conformal field theory, we uncover a surprising behavior of the variance of the number of (non-)bridges, showing that these diverge in two dimensions below the value $4\\cos^2{(\\pi/\\sqrt{3})}=0.2315891\\cdots$ of the cluster coupling $q$. Finally, it is shown that a par...
Federico Holik
2011-12-20T23:59:59.000Z
Since its origins, Quantum mechanics has presented problems with the concept of individuality. It is argued that quantum particles do not have individuality, and so, one can speak about "entities without identity". On the contrary, we claim that the problem of quantum non individuality goes deeper, and that one of its most important features is the fact that there are quantum systems for which particle number is not well defined. In this work, we continue this discussion in relation to the problem about the one and the many.
A fluctuation theorem in a random environment
F. Bonetto; G. Gallavotti; G. Gentile
2006-04-29T23:59:59.000Z
A simple class of chaotic systems in a random environment is considered and the fluctuation theorem is extended under the assumption of reversibility.
Logarithmic Opinion Pools for Conditional Random Fields
Smith, Andrew
2007-06-26T23:59:59.000Z
Since their recent introduction, conditional random fields (CRFs) have been successfully applied to a multitude of structured labelling tasks in many different domains. Examples include natural language processing ...
The random lattice as a regularization scheme
B. Alles
1994-12-05T23:59:59.000Z
A semi-analytic method to compute the first coefficients of the renormalization group functions on a random lattice is introduced. It is used to show that the two-dimensional $O(N)$ non-linear $\\sigma$-model regularized on a random lattice has the correct continuum limit. A degree $\\kappa$ of ``randomness'' in the lattice is introduced and an estimate of the ratio $\\Lambda_{random}/\\Lambda_{regular}$ for two rather opposite values of $\\kappa$ in the $\\sigma$-model is also given. This ratio turns out to depend on $\\kappa$.
Time-Homogeneous Diffusions with a Given Marginal at a Random Time
on the occasion of his 60th birthday. e-mail: A.M.G.Cox@bath.ac.uk; web: www.maths.bath.ac.uk/mapamgc/ e-mail: D.Hobson@warwick.ac.uk; web: www.warwick.ac.uk/go/dhobson/ Â§e-mail: obloj@maths.ox.ac.uk; web: www.maths.ox.ac.uk/obloj/ 1 #12 Krein's spectral theory of strings. Both of the above proofs exploit deep known results. In the final
The domination number of on-line social networks and random geometric graphs
Pralat, Pawel
of graphs in the Facebook 100 data set, and these bounds are well-correlated with those predicted geometric graphs. 1. Introduction On-line social networks (or OSNs) such as Facebook have emerged as a hot-demographics are closer together in the space. We give the precise definition of the GEO-P model (actually, one of its
A Provably Secure True Random Number Generator with Built-in Tolerance to Active Attacks
Martin, Bill
, W. J. Martin, D. R. Stinson {sunar,martin}@wpi.edu Electrical & Computer Engineering Mathematical of Computer Science University of Waterloo Waterloo Ontario, N2L 3G1 Canada June 10, 2005 Abstract This paper;Good TRNG design rests on the quality of three components: Â· Entropy Source: Various TRNG designs have
Mersenne Twister Random Number Generation on FPGA, CPU and GPU Xiang Tian and Khaled Benkrid
Arslan, Tughrul
in high performance computing applications such as financial computing. Implementations of our parallel computing applications as high performance computing platforms. This paper presents the design
Contactless Electromagnetic Active Attack on Ring Oscillator Based True Random Number
Paris-Sud XI, Université de
circuits that embed RO-based TRNG. Keywords: Active attacks, EM injections, IEMI, Ring oscillators,TRNGs 1
USING RANDOM MATRIX THEORY TO DETERMINE THE NUMBER OF ENDMEMBERS IN A HYPERSPECTRAL IMAGE
Damelin, Steven
chemical unmixing [1], extracting speech signals in a noisy band [2], unmixing minerals [3] and unmixing en of spectral endmembers in a hyper- spectral image is an important step in the spectral unmixing process of endmembers in an image is im- portant for the processing of many different types of data, in- cluding
Thermodynamics of protein folding: a random matrix formulation
Pragya Shukla
2010-10-16T23:59:59.000Z
The process of protein folding from an unfolded state to a biologically active, folded conformation is governed by many parameters e.g the sequence of amino acids, intermolecular interactions, the solvent, temperature and chaperon molecules. Our study, based on random matrix modeling of the interactions, shows however that the evolution of the statistical measures e.g Gibbs free energy, heat capacity, entropy is single parametric. The information can explain the selection of specific folding pathways from an infinite number of possible ways as well as other folding characteristics observed in computer simulation studies.
Alternating current response of carbon nanotubes with randomly distributed impurities
Hirai, Daisuke; Watanabe, Satoshi [Department of Materials Engineering, The University of Tokyo, 7-3-1 Hongo, Bunkyo, Tokyo 113-8656 (Japan); Yamamoto, Takahiro [Department of Electrical Engineering and Department of Liberal Arts (Physics), Tokyo University of Science, 6-3-1 Niijuku, Katsushika, Tokyo 125-8585 (Japan)
2014-10-27T23:59:59.000Z
The increasing need for nanodevices has necessitated a better understanding of the electronic transport behavior of nanomaterials. We therefore theoretically examine the AC transport properties of metallic carbon nanotubes with randomly distributed impurities. We find that the long-range impurity scattering increases the emittance, but does not affect the DC conductance. The estimated dwell time of electrons increases with the potential amplitudes. That is, multiple scattering by the impurities increases the kinetic inductance in proportion to the dwell time, which eventually increases the emittance. We believe that our findings can contribute significantly to nanodevice development.
Lyapunov exponents for products of complex Gaussian random matrices
Peter J. Forrester
2012-06-10T23:59:59.000Z
The exact value of the Lyapunov exponents for the random matrix product $P_N = A_N A_{N-1}...A_1$ with each $A_i = \\Sigma^{1/2} G_i^{\\rm c}$, where $\\Sigma$ is a fixed $d \\times d$ positive definite matrix and $G_i^{\\rm c}$ a $d \\times d$ complex Gaussian matrix with entries standard complex normals, are calculated. Also obtained is an exact expression for the sum of the Lyapunov exponents in both the complex and real cases, and the Lyapunov exponents for diffusing complex matrices.
Dynamical Slowdown of Polymers in Laminar and Random Flows
Antonio Celani; Alberto Puliafito; Dario Vincenzi
2006-09-22T23:59:59.000Z
The influence of an external flow on the relaxation dynamics of a single polymer is investigated theoretically and numerically. We show that a pronounced dynamical slowdown occurs in the vicinity of the coil-stretch transition, especially when the dependence on polymer conformation of the drag is accounted for. For the elongational flow, relaxation times are exceedingly larger than the Zimm relaxation time, resulting in the observation of conformation hysteresis. For random smooth flows hysteresis is not present. Yet, relaxation dynamics is significantly slowed down because of the large variety of accessible polymer configurations. The implications of these results for the modeling of dilute polymer solutions in turbulent flows are addressed.
Texas Rice, Volume VII, Number 7
Texas A&M University System Agricultural Research and Extension Center Beaumont, Texas September 2007 Volume VII Number 7 Texas Rice Nobel Peace Prize Recipient Dr. Norman Borlaug continued on page 4 September of 2003 was a time etched... Rice Water Weevil ...............................................................3 iAIMS ................................................................................. 6 TRIA Update...
Selfattractive random polymers Remco van der Hofstad
Klenke, Achim
SelfÂattractive random polymers Remco van der Hofstad Stieltjes Institute of Mathematics Delft polymer of finite length in Zd . Its law is that of a finite simple random walk path in Zd receiving that for > the attraction dominates the repulsion, i.e., with high probability the polymer is contained in a finite box
Contagious Sets in Random Graphs Uriel Feige
Contagious Sets in Random Graphs Uriel Feige Michael Krivelevich Daniel Reichman August 10, 2014. A contagious set is a set whose activation results with the entire graph being active. Given a graph G, let m(G, 2) be the minimal size of a contagious set. We consider the binomial random graph G := G(n, p
Cauchy's formulas for random walks in bounded domains
Mazzolo, Alain, E-mail: alain.mazzolo@cea.fr; Zoia, Andrea, E-mail: andrea.zoia@cea.fr [CEA/Saclay, DEN/DANS/DM2S/SERMA/LTSD, 91191 Gif-sur-Yvette (France); Mulatier, Clélia de, E-mail: clelia.demulatier@cea.fr [CEA/Saclay, DEN/DANS/DM2S/SERMA/LTSD, 91191 Gif-sur-Yvette and CNRS - Université Paris-Sud, LPTMS, UMR8626, 91405 Orsay Cedex (France)
2014-08-01T23:59:59.000Z
Cauchy's formula was originally established for random straight paths crossing a body B?R{sup n} and basically relates the average chord length through B to the ratio between the volume and the surface of the body itself. The original statement was later extended in the context of transport theory so as to cover the stochastic paths of Pearson random walks with exponentially distributed flight lengths traversing a bounded domain. Some heuristic arguments suggest that Cauchy's formula may also hold true for Pearson random walks with arbitrarily distributed flight lengths. For such a broad class of stochastic processes, we rigorously derive a generalized Cauchy's formula for the average length traveled by the walkers in the body, and show that this quantity depends indeed only on the ratio between the volume and the surface, provided that some constraints are imposed on the entrance step of the walker in B. Similar results are also obtained for the average number of collisions performed by the walker in B.
BOYER, B.D.; GORDON, D.M.; JO, J.
2006-07-16T23:59:59.000Z
Current safeguards approaches used by the IAEA at gas centrifuge enrichment plants (GCEPs) need enhancement in order to detect undeclared LEU production with adequate detection probability. ''Mailbox'' declarations have been used in the last two decades to verify receipts, production, and shipments at some bulk-handling facilities (e.g., fuel-fabrication plants). The operator declares the status of his plant to the IAEA on a daily basis using a secure ''Mailbox'' system such as a secure tamper-resistant computer. The operator agrees to hold receipts and shipments for a specified period of time, along with a specified number of annual inspections, to enable inspector access to a statistically large enough population of UF{sub 6} cylinders and fuel assemblies to achieve the desired detection probability. The inspectors can access the ''Mailbox'' during randomly timed inspections and then verify the operator's declarations for that day. Previously, this type of inspection regime was considered mainly for verifying the material balance at fuel-fabrication, enrichment, and conversion plants. Brookhaven National Laboratory has expanded the ''Mailbox'' concept with short-notice random inspections (SNRIs), coupled with enhanced video surveillance, to include declaration and verification of UF{sub 6} cylinder operational data to detect activities associated with undeclared LEU production at GCEPs. Since the ''Mailbox'' declarations would also include data relevant to material-balance verification, these randomized inspections would replace the scheduled monthly interim inspections for material-balance purposes; in addition, the inspectors could simultaneously perform the required number of Limited-Frequency Unannounced Access (LFUA) inspections used for HEU detection. This approach would provide improved detection capabilities for a wider range of diversion activities with not much more inspection effort than at present.
Reheating-volume measure for random-walk inflation
Winitzki, Sergei [Department of Physics, Ludwig-Maximilians University, Munich (Germany); Yukawa Institute of Theoretical Physics, Kyoto University, Kyoto (Japan)
2008-09-15T23:59:59.000Z
The recently proposed 'reheating-volume' (RV) measure promises to solve the long-standing problem of extracting probabilistic predictions from cosmological multiverse scenarios involving eternal inflation. I give a detailed description of the new measure and its applications to generic models of eternal inflation of random-walk type. For those models I derive a general formula for RV-regulated probability distributions that is suitable for numerical computations. I show that the results of the RV cutoff in random-walk type models are always gauge invariant and independent of the initial conditions at the beginning of inflation. In a toy model where equal-time cutoffs lead to the 'youngness paradox', the RV cutoff yields unbiased results that are distinct from previously proposed measures.
THE FOURTH-ORDER CORRELATION FUNCTION OF A RANDOMLY ADVECTED PASSIVE SCALAR
Lebedev, Vladimir
THE FOURTH-ORDER CORRELATION FUNCTION OF A RANDOMLY ADVECTED PASSIVE SCALAR E. Balkovskya , M the Gaussianity: we obtain analytically the simultaneous fourth-order correlation function of . Explicit expressions for fourth-order objects, like (1 - 2)4 are derived. PACS numbers: 47.10.+g, 47.27.-i, 05.40.+j
Optimal investment on finite horizon with random discrete order flow in illiquid markets
Paris-Sud XI, Université de
both on trading and observation of the assets. For example, in power markets, trading occurs through at any time but trading occurs more frequently near a terminal horizon. The investor can observe and trade the risky asset only at exogenous random times corresponding to the order flow given
STOCHASTIC DESIGN AND CONTROL IN RANDOM HETEROGENEOUS MATERIALS
Del Moral , Pierre
the probabilistic characteristics of the existing phases and introducing randomly dispersed new materials. TheSTOCHASTIC DESIGN AND CONTROL IN RANDOM HETEROGENEOUS MATERIALS RAPHAEL STERNFELS AND PHAEDON concerned with problems relating to random heterogeneous materials where uncertainties arise from
2009-03-18T23:59:59.000Z
Basics of Random Walk – 2. 0. 5. 10. 15. 20. 25. 30. 35. 40. 45. 50. ?5. ?4. ?3. ?2. ?1. 0 ..... Back to Parrondo's Paradox. Playing Game A. . winning prob = 0.495.
Beta dose distribution for randomly packed microspheres
Urashkin, Alexander
2007-04-25T23:59:59.000Z
of radiation dose distribution when utilizing this technique. This study focuses on random packing of microspheres and seeks to determine dose distributions for specific cases. The Monte Carlo Neutral Particle code (MCNP) developed by Los Alamos National...
Farritor, Shane
: PAR-13-082. CFDA Number(s): 93.859. Agency/Department: National Institutes of Health (NIH), National skills, communication skills, time-management, group learning opportunities, independent library or bench career choices with appropriate role models. The proposed research education prog
QCD, Symmetry Breaking and the Random Lattice
Saul D. Cohen
2006-02-15T23:59:59.000Z
According to the Nielsen-Ninomiya No-Go theorem, the doubling of fermions on the lattice cannot be suppressed in a chiral theory. Whereas Wilson and staggered fermions suppress doublers with explicit breaking of chiral symmetry, the random lattice does so by spontaneous chiral symmetry breaking even in the free theory. I present results for meson masses, the chiral condensate and fermionic eigenvalues from simulations of quenched QCD on random lattices in four dimensions, focusing on chiral symmetry breaking.
Spectral statistics for weakly correlated random potentials
Frédéric Klopp
2012-10-29T23:59:59.000Z
We study localization and derive stochastic estimates (in particular, Wegner and Minami estimates) for the eigenvalues of weakly correlated random discrete Schr\\"odinger operators in the localized phase. We apply these results to obtain spectral statistics for general discrete alloy type models where the single site perturbation is neither of finite rank nor of fixed sign. In particular, for the models under study, the random potential exhibits correlations at any range.
Stabilizing Topological Phases in Graphene via Random Adsorption...
Office of Scientific and Technical Information (OSTI)
Stabilizing Topological Phases in Graphene via Random Adsorption Prev Next Title: Stabilizing Topological Phases in Graphene via Random Adsorption Authors: Jiang, Hua ; Qiao,...
The Pursuit of Balance in Sequential Randomized Trials
Guiteras, Raymond P.; Levine, David I.; Polley, Thomas H.
2015-01-01T23:59:59.000Z
2003). “The pursuit of balance using stratified and dynamicThe Pursuit of Balance in Sequential Randomized Trials ?Mikel (2001). “Randomization, balance, and the validity and
Application of Random Vibration Theory Methodology for Seismic...
Office of Environmental Management (EM)
Application of Random Vibration Theory Methodology for Seismic Soil-Structure Interaction Analysis Application of Random Vibration Theory Methodology for Seismic Soil-Structure...
A Natural Definition of Random Language Keith Wansbrough*
Wansbrough, Keith
Introduction Algorithmic Information Theory (AIT) provides definitions of randomness for strings A Natural Definition of Random Language Keith Wansbrough* October 13, 1995 Abstract We propose a natural definition
Distribution of phylogenetic diversity under random extinction
Beata Faller; Fabio Pardi; Mike Steel
2007-08-02T23:59:59.000Z
Phylogenetic diversity is a measure for describing how much of an evolutionary tree is spanned by a subset of species. If one applies this to the (unknown) subset of current species that will still be present at some future time, then this `future phylogenetic diversity' provides a measure of the impact of various extinction scenarios in biodiversity conservation. In this paper we study the distribution of future phylogenetic diversity under a simple model of extinction (a generalized `field of bullets' model). We show that the distribution of future phylogenetic diversity converges to a normal distribution as the number of species grows (under mild conditions, which are necessary). We also describe an algorithm to compute the distribution efficiently, provided the edge lengths are integral, and briefly outline the significance of our findings for biodiversity conservation.
Effects of systematic phase errors on optimized quantum random-walk search algorithm
Yu-Chao Zhang; Wan-Su Bao; Xiang Wang; Xiang-Qun Fu
2015-01-09T23:59:59.000Z
This paper researches how the systematic errors in phase inversions affect the success rate and the number of iterations in optimized quantum random-walk search algorithm. Through geometric description of this algorithm, the model of the algorithm with phase errors is established and the relationship between the success rate of the algorithm, the database size, the number of iterations and the phase error is depicted. For a given sized database, we give both the maximum success rate of the algorithm and the required number of iterations when the algorithm is in the presence of phase errors. Through analysis and numerical simulations, it shows that optimized quantum random-walk search algorithm is more robust than Grover's algorithm.
Performance of wireless sensor networks under random node failures
Bradonjic, Milan [Los Alamos National Laboratory; Hagberg, Aric [Los Alamos National Laboratory; Feng, Pan [Los Alamos National Laboratory
2011-01-28T23:59:59.000Z
Networks are essential to the function of a modern society and the consequence of damages to a network can be large. Assessing network performance of a damaged network is an important step in network recovery and network design. Connectivity, distance between nodes, and alternative routes are some of the key indicators to network performance. In this paper, random geometric graph (RGG) is used with two types of node failure, uniform failure and localized failure. Since the network performance are multi-facet and assessment can be time constrained, we introduce four measures, which can be computed in polynomial time, to estimate performance of damaged RGG. Simulation experiments are conducted to investigate the deterioration of networks through a period of time. With the empirical results, the performance measures are analyzed and compared to provide understanding of different failure scenarios in a RGG.
Longhua Hu; Alexander Y. Grosberg
2007-01-24T23:59:59.000Z
In this paper, we study the role of surface of the globule and the role of interactions with the solvent for designed sequence heteropolymers using random energy model (REM). We investigate the ground state energy and surface monomer composition distribution. By comparing the freezing transition in random and designed sequence heteropolymers, we discuss the effects of design. Based on our results, we are able to show under which conditions solvation effect improves the quality of sequence design. Finally, we study sequence space entropy and discuss the number of available sequences as a function of imposed requirements for the design quality.
Is there quantum chaos in the prime numbers?
Todd Timberlake; Jeffery Tucker
2008-01-07T23:59:59.000Z
A statistical analysis of the prime numbers indicates possible traces of quantum chaos. We have computed the nearest neighbor spacing distribution, number variance, skewness, and excess for sequences of the first N primes for various values of N. All four statistical measures clearly show a transition from random matrix statistics at small N toward Poisson statistics at large N. In addition, the number variance saturates at large lengths as is common for eigenvalue sequences. This data can be given a physical interpretation if the primes are thought of as eigenvalues of a quantum system whose classical dynamics is chaotic at low energy but regular at high energy. We discuss some difficulties with this interpretation in an attempt to clarify what kind of physical system might have the primes as its quantum eigenvalues.
Exact asymptotics of the freezing transition of a logarithmically correlated random energy model
Christian Webb
2011-08-26T23:59:59.000Z
We consider a logarithmically correlated random energy model, namely a model for directed polymers on a Cayley tree, which was introduced by Derrida and Spohn. We prove asymptotic properties of a generating function of the partition function of the model by studying a discrete time analogy of the KPP-equation - thus translating Bramson's work on the KPP-equation into a discrete time case. We also discuss connections to extreme value statistics of a branching random walk and a rescaled multiplicative cascade measure beyond the critical point.
Office of Legacy Management (LM)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports to3,1,50022,3,,0,,6,1,Separation 23Tribal EnergyCatalytic Co - PA 40 FUSRAPChupadera WaterJulyReportN V O 1 8 7 +' , /v-i 2 -i 3 -A, This
Random Surfers on a Web Encyclopedia
Geigl, Florian; Hofmann-Wellenhof, Rainer; Walk, Simon; Strohmaier, Markus; Helic, Denis
2015-01-01T23:59:59.000Z
The random surfer model is a frequently used model for simulating user navigation behavior on the Web. Various algorithms, such as PageRank, are based on the assumption that the model represents a good approximation of users browsing a website. However, the way users browse the Web has been drastically altered over the last decade due to the rise of search engines. Hence, new adaptations for the established random surfer model might be required, which better capture and simulate this change in navigation behavior. In this article we compare the classical uniform random surfer to empirical navigation and page access data in a Web Encyclopedia. Our high level contributions are (i) a comparison of stationary distributions of different types of the random surfer to quantify the similarities and differences between those models as well as (ii) new insights into the impact of search engines on traditional user navigation. Our results suggest that the behavior of the random surfer is almost similar to those of users...
Pipeline MT Instructions Identification Number
Hong, Don
Pipeline MT Instructions Identification Number For identification purposes, you will be assigned a special identification number. M# You can activate your MT email, login to PipelineMT to register for classes or pay tuition and fees. Activating the MTSU Email and PipelineMT accounts: Visit the website
A model and architecture for pseudo-random generation with applications to /dev/random
International Association for Cryptologic Research (IACR)
A model and architecture for pseudo-random generation with applications to /dev/random Boaz Barak@alum.mit.edu September 1, 2005 Abstract We present a formal model and a simple architecture for robust pseudorandom's entropy source. Our model and architecture have the following properties: Â· Resilience. The generator
Dynamics of Glass Forming Liquids with Randomly Pinned Particles
Saurish Chakrabarty; Smarajit Karmakar; Chandan Dasgupta
2015-05-12T23:59:59.000Z
It is frequently assumed that in the limit of vanishing cooling rate, the glass transition phenomenon becomes a thermodynamic transition at a temperature $T_{K}$. However, with any finite cooling rate, the system falls out of equilibrium at temperatures near $T_g(>T_{K})$, implying that the very existence of the putative thermodynamic phase transition at $T_{K}$ can be questioned. Recent studies of systems with randomly pinned particles have hinted that the thermodynamic glass transition may be observed in simulations and experiments carried out for liquids with randomly pinned particles. This expectation is based on the results of approximate calculations that suggest that the temperature of the thermodynamic glass transition increases as the concentration of pinned particles is increased and it may be possible to equilibrate the system at temperatures near the increased transition temperature. We test the validity of this prediction through extensive molecular dynamics simulations of two model glass-forming liquids in the presence of random pinning. We fit the temperature-dependence of the structural relaxation time to the Vogel-Fulcher-Tammann form that predicts a divergence of the relaxation time at a temperature $T_{VFT}$ and identify this temperature with the thermodynamic transition temperature $T_K$. We find that $T_{VFT}$ does not show any sign of increasing with increasing concentration of pinned particles. The main effect of pinning is found to be a rapid decrease in the kinetic fragility of the system with increasing pin concentration. Implications of these observations for current theories of the glass transition are discussed.
Random field models for hydraulic conductivity in ground water flow
Meerschaert, Mark M.
Random field models for hydraulic conductivity in ground water flow Special Session on Random random fields to interpolate sparse data on hydraulic conductivity. The result- ing random field is used and Probability, Michigan State U Hans-Peter Scheffler, Mathematics, Uni Siegen, Germany Remke Van Dam, Institute
A Natural Definition of Random Language Keith Wansbrough \\Lambda
Wansbrough, Keith
definition. 1 Introduction Algorithmic Information Theory (AIT) provides definitions of randomnessA Natural Definition of Random Language Keith Wansbrough \\Lambda October 13, 1995 Abstract We propose a natural definition of random language, based on the standard AIT definitions of random string
Random drift and large shifts in popularity of dog
Hahn, Matthew
citations of scien- tific authors (Simkin & Roychowdhury 2003). We report that the neutral model of random
Burra G. Sidharth
2008-09-03T23:59:59.000Z
We briefly review two concepts of time - the usual time associated with "being" and more recent ideas, answering to the description of "becoming". The approximation involved in the former is examined. Finally we argue that it is (unpredictable) fluctuations that underlie time.
Steering random walks with kicked ultracold atoms
Marcel Weiß; Caspar Groiseau; W. K. Lam; Raffaella Burioni; Alessandro Vezzani; Gil S. Summy; Sandro Wimberger
2015-06-27T23:59:59.000Z
A kicking sequence of the atom optics kicked rotor at quantum resonance can be interpreted as a quantum random walk in momentum space. We show how to steer such a random walk by applying a random sequence of intensities and phases of the kicking lattice chosen according to a probability distribution. This distribution converts on average into the final momentum distribution of the kicked atoms. In particular, it is shown that a power-law distribution for the kicking strengths results in a L\\'evy walk in momentum space and in a power-law with the same exponent in the averaged momentum distribution. Furthermore, we investigate the stability of our predictions in the context of a realistic experiment with Bose-Einstein condensates.
Steering random walks with kicked ultracold atoms
Weiß, Marcel; Lam, W K; Burioni, Raffaella; Vezzani, Alessandro; Summy, Gil S; Wimberger, Sandro
2015-01-01T23:59:59.000Z
A kicking sequence of the atom optics kicked rotor at quantum resonance can be interpreted as a quantum random walk in momentum space. We show how to steer such a random walk by applying a random sequence of intensities and phases of the kicking lattice chosen according to a probability distribution. This distribution converts on average into the final momentum distribution of the kicked atoms. In particular, it is shown that a power-law distribution for the kicking strengths results in a L\\'evy walk in momentum space and in a power-law with the same exponent in the averaged momentum distribution. Furthermore, we investigate the stability of our predictions in the context of a realistic experiment with Bose-Einstein condensates.
Detection efficiency and noise in semi-device independent randomness extraction protocol
Hong-Wei Li; Zhen-Qiang Yin; Marcin Pawlowski; Guang-Can Guo; Zheng-Fu Han
2015-02-05T23:59:59.000Z
In this paper, we analyze several critical issues in semi-device independent quantum information processing protocol. In practical experimental realization randomness generation in that scenario is possible only if the efficiency of the detectors used is above a certain threshold. Our analysis shows that the critical detection efficiency is 0.7071 in the symmetric setup, while in the asymmetric setup if one of the bases has perfect critical detection efficiency then the other one can be arbitrarily close to 0. We also analyze the semi-device independent random number generation efficiency based on different averages of guessing probability. To generate more randomness, the proper averaging method should be applied. Its choice depends on the value of a certain dimension witness. More importantly, the general analytical relationship between the maximal average guessing probability and dimension witness is given.
John Ashmead
2010-05-05T23:59:59.000Z
Normally we quantize along the space dimensions but treat time classically. But from relativity we expect a high level of symmetry between time and space. What happens if we quantize time using the same rules we use to quantize space? To do this, we generalize the paths in the Feynman path integral to include paths that vary in time as well as in space. We use Morlet wavelet decomposition to ensure convergence and normalization of the path integrals. We derive the Schr\\"odinger equation in four dimensions from the short time limit of the path integral expression. We verify that we recover standard quantum theory in the non-relativistic, semi-classical, and long time limits. Quantum time is an experiment factory: most foundational experiments in quantum mechanics can be modified in a way that makes them tests of quantum time. We look at single and double slits in time, scattering by time-varying electric and magnetic fields, and the Aharonov-Bohm effect in time.
Zeilberger, Doron
The Number of Same-Sex Marriages in a Perfectly Bisexual Population is Asymptotically Normal attracted to either sex and chooses his or her mate according to other criteria. Also assume that everyone gets married. Then the expectation of the random variable "Number of same-sex marriages" is 2n (2 n - 1
Random matrix approach to multivariate categorical data analysis
Patil, Aashay
2015-01-01T23:59:59.000Z
Correlation and similarity measures are widely used in all the areas of sciences and social sciences. Often the variables are not numbers but are instead qualitative descriptors called categorical data. We define and study similarity matrix, as a measure of similarity, for the case of categorical data. This is of interest due to a deluge of categorical data, such as movie ratings, top-10 rankings and data from social media, in the public domain that require analysis. We show that the statistical properties of the spectra of similarity matrices, constructed from categorical data, follow those from random matrix theory. We demonstrate this approach by applying it to the data of Indian general elections and sea level pressures in North Atlantic ocean.
Pulse propagation in decorated random chains
Upendra Harbola; Alexandre Rosas; Aldo H. Romero; Katja Lindenberg
2010-05-05T23:59:59.000Z
We study pulse propagation in one-dimensional chains of spherical granules decorated with small randomly-sized granules placed between bigger monodisperse ones. Such "designer chains" are of interest in efforts to control the behavior of the pulse so as to optimize its propagation or attenuation, depending on the desired application. We show that a recently proposed effective description of simple decorated chains can be extended to predict pulse properties in chains decorated with small granules of randomly chosen radii. Furthermore, we also show that the binary collision approximation can again be used to provide analytic results for this system.
Andrews, George E; Gawronski, Wolfgang; Littlejohn, Lance L
2011-01-01T23:59:59.000Z
The Jacobi-Stirling numbers were discovered as a result of a problem involving the spectral theory of powers of the classical second-order Jacobi differential expression. Specifically, these numbers are the coefficients of integral composite powers of the Jacobi expression in Lagrangian symmetric form. Quite remarkably, they share many properties with the classical Stirling numbers of the second kind which, as shown in LW, are the coefficients of integral powers of the Laguerre differential expression. In this paper, we establish several properties of the Jacobi-Stirling numbers and its companions including combinatorial interpretations thereby extending and supplementing known contributions to the literature of Andrews-Littlejohn, Andrews-Gawronski-Littlejohn, Egge, Gelineau-Zeng, and Mongelli.
Departmental Business Instrument Numbering System
Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]
2005-01-27T23:59:59.000Z
The Order prescribes the procedures for assigning identifying numbers to all Department of Energy (DOE) and National Nuclear Security Administration (NNSA) business instruments. Cancels DOE O 540.1. Canceled by DOE O 540.1B.
Departmental Business Instrument Numbering System
Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]
2000-12-05T23:59:59.000Z
To prescribe procedures for assigning identifying numbers to all Department of Energy (DOE), including the National Nuclear Security Administration, business instruments. Cancels DOE 1331.2B. Canceled by DOE O 540.1A.
Convergence properties of polynomial chaos approximations for L2 random variables.
Field, Richard V., Jr. (.,; .); Grigoriu, Mircea (Cornell University, Ithaca, NY)
2007-03-01T23:59:59.000Z
Polynomial chaos (PC) representations for non-Gaussian random variables are infinite series of Hermite polynomials of standard Gaussian random variables with deterministic coefficients. For calculations, the PC representations are truncated, creating what are herein referred to as PC approximations. We study some convergence properties of PC approximations for L{sub 2} random variables. The well-known property of mean-square convergence is reviewed. Mathematical proof is then provided to show that higher-order moments (i.e., greater than two) of PC approximations may or may not converge as the number of terms retained in the series, denoted by n, grows large. In particular, it is shown that the third absolute moment of the PC approximation for a lognormal random variable does converge, while moments of order four and higher of PC approximations for uniform random variables do not converge. It has been previously demonstrated through numerical study that this lack of convergence in the higher-order moments can have a profound effect on the rate of convergence of the tails of the distribution of the PC approximation. As a result, reliability estimates based on PC approximations can exhibit large errors, even when n is large. The purpose of this report is not to criticize the use of polynomial chaos for probabilistic analysis but, rather, to motivate the need for further study of the efficacy of the method.
Diffusive limit for the random Lorentz gas
Alessia Nota
2014-10-14T23:59:59.000Z
We review some recent results concerning the derivation of the diffusion equation and the validation of Fick's law for the microscopic model given by the random Lorentz Gas. These results are achieved by using a linear kinetic equation as an intermediate level of description between our original mechanical system and the diffusion equation.
QUANTUM CHAOS, CLASSICAL RANDOMNESS, AND BOHMIAN MECHANICS
Goldstein, Sheldon
QUANTUM CHAOS, CLASSICAL RANDOMNESS, AND BOHMIAN MECHANICS Detlef DË? urr* ,+ , Sheldon Goldstein of quantum theory, Bohmian mechanics, in which ``quantum chaos'' also arises solely from the dynamical law. Moreover, this occurs in a manner far simpler than in the classical case. KEY WORDS: Quantum chaos; quantum
Random Walks and Nonlinear Dynamics in the
Frey, Erwin
in the experimental biophysics and state-of-the-art concepts of modern nonlinear dynamics and random-walk theory leading experts in cell biology and theoretical physics in order to tie recent advances: Visitors Program Mandy Lochar MPI for the Physics of Complex Systems Nöthnitzer Str. 38, D-01187 Dresden
Distributed QR Factorization Based on Randomized Algorithms
Zemen, Thomas
Distributed QR Factorization Based on Randomized Algorithms Hana Strakov´a1 , Wilfried N. Gansterer of Algorithms Hana.Strakova@univie.ac.at, Wilfried.Gansterer@univie.ac.at 2 Forschungszentrum Telekommunication Wien, Austria Thomas.Zemen@ftw.at Abstract. Most parallel algorithms for matrix computations assume
Performance Characterization of Random Proximity Sensor Networks
Jensen, Grant J.
Performance Characterization of Random Proximity Sensor Networks Agostino Capponi Department-- In this paper, we characterize the localization per- formance and connectivity of sensors networks consisting for signal processing. Each sensor has severe constraints on the battery power, and can only communicate
Random Constraint Satisfaction: theory meets practice?
Walsh, Toby
, and Taylor demonstrated that the hardest search prob- lems often occur around a rapid transition for many di erent NP-complete problems. Experimental results about phase transition behaviour have come thick and fast since the publication of 2]. For example, in random 3-Sat, the phase transition
Purity distribution for bipartite random pure states
O. Giraud
2007-10-10T23:59:59.000Z
Analytic expressions for the probability density distribution of the linear entropy and the purity are derived for bipartite pure random quantum states. The explicit distributions for a state belonging to a product of Hilbert spaces of dimensions p and q are given for p=3 and any q>=3, as well as for p=q=4.
Positive Lyapunov exponent by a random perturbation
Zeng Lian; Mikko Stenlund
2010-12-20T23:59:59.000Z
We study the effect of a random perturbation on a one-parameter family of dynamical systems whose behavior in the absence of perturbation is ill understood. We provide conditions under which the perturbed system is ergodic and admits a positive Lyapunov exponent, with an explicit lower bound, for a large and controlled set of parameter values.
Random Parking and Rubber Elasticity Mathew Penrose
Penrose, Mathew
Random Parking and Rubber Elasticity Mathew Penrose (University of Bath) Joint work with Antoine), Imperial January 2013 #12;Rubber Elasticity Let d, n N (e.g. d = n = 3). Suppose D Rd is a bounded domain. D represents a piece of rubber. Let L Rd be a locally finite point process. L D the locations
S. Kun; Y. Li; M. H. Zhao; M. R. Huang
2013-07-17T23:59:59.000Z
The idea of a thermalized non-equilibrated state of matter offers a conceptually new understanding of the strong angular asymmetry. In this compact review we present some clarifications, corrections and further developments of the approach, and provide a brief account of results previously discussed but not reported in the literature. The cross symmetry compound nucleus $S$-matrix correlations are obtained (i) starting from the unitary $S$-matrix representation, (ii) by explicitly taking into account a process of energy equilibration, and (iii) without taking the thermodynamic limit of an infinite number of particles in the thermalized system. It is conjectured that the long phase memory is due to the exponentially small total spin off-diagonal resonance intensity correlations. This manifestly implies that the strong angular asymmetry intimately relates to extremely small deviations of the eigenfunction distribution from Gaussian law. The spin diagonal resonance intensity correlations determine a new time/energy scale for a validity of random matrix theory. Its definition does not involve overlaps of the many-body interacting configurations with shell model non-interacting states and thus is conceptually different from the physical meaning (inverse energy relaxation time) of the spreading widths introduced by Wigner. Exact Gaussian distribution of the resonance wave functions corresponds to the instantaneous phase relaxation. We invite the nuclear reaction community for the competition to describe, as the first challenge, the strong forward peaking in the typically evaporation part of the proton spectra. This is necessary to initiate revealing long-term misconduct in the heavily cross-disciplinary field, also important for nuclear industry applications.
Signal statistics of phase dependent optical time domain reflectometry
Wojcik, Aleksander Karol
2007-04-25T23:59:59.000Z
The statistics of the phase dependent optical time-domain reflectometer have been analyzed. The optical fiber is modeled by the use of a discrete set of reflectors positioned randomly along the fiber. The statistics of the ...
Maintaining dynamic sequences under equalitytests in polylogarithmic time
Maintaining dynamic sequences under equalitytests in polylogarithmic time K. Mehlhorn R. Sundar C. Uhrig January 16, 1996 Abstract We present a randomized and a deterministic data structure
A Markov Random Field model of contamination source identification in porous media flow
Zabaras, Nicholas J.
A Markov Random Field model of contamination source identification in porous media flow Jingbo Wang A contamination source identification problem in constant porous media flow is addressed by solving the advection-dispersion equation (ADE) with a hierarchical Bayesian computation method backward through time. The contaminant
Microprocessor-based random PWM schemes for DC-AC power conversion
Hui, S.Y.R. [Univ. of Sydney, New South Wales (Australia). Dept. of Electrical Engineering] [Univ. of Sydney, New South Wales (Australia). Dept. of Electrical Engineering; [City Univ. of Hong Kong, Kowloon (Hong Kong). Dept. of Electronic Engineering; Oppermann, I.; Sathiakumar, S. [Univ. of Sydney, New South Wales (Australia). Dept. of Electrical Engineering] [Univ. of Sydney, New South Wales (Australia). Dept. of Electrical Engineering
1997-03-01T23:59:59.000Z
Two classes of microprocessor-based random PWM (RPWM) real-time schemes for dc-ac power conversion are compared and evaluated. Performance of the RPWM schemes based on the mathematical and logical approaches is examined. The proposed schemes exhibit excellent harmonic content with all low and high-order harmonics suppressed and are suitable for both MOSFET and IGBT inverters.
Markets with random lifetimes and private values: mean-reversion and option to trade
Cvitanic, Jaksa
Markets with random lifetimes and private values: mean-reversion and option to trade Jaksa Cvitani values for the single traded asset. A trader's optimal trading decision is formulated in terms of exercising the option to trade one unit of the asset at the optimal stopping time. We solve the optimal
On the Power of Randomization in Algorithmic Mechanism Design Shahar Dobzinski
Sandholm, Tuomas W.
On the Power of Randomization in Algorithmic Mechanism Design Shahar Dobzinski Department Stanford University shaddin@cs.stanford.edu Abstract In many settings the power of truthful mechanisms that no polynomial-time truthful deterministic mechanism provides an approximation ratio better than 2. We also show
Rhythm and Randomness in Human Contact Mervyn P. Freeman, Nicholas W. Watkins
Hand, Steven
(pdf) p(t) of times between human contact is well approximated by a truncated power law i.e. p(t) t-(1 argued that human mobility patterns resemble truncated L´evy walks (TLW). The TLW paradigm representsRhythm and Randomness in Human Contact Mervyn P. Freeman, Nicholas W. Watkins British Antarctic
On the Unification of Random Matrix Theories
Rupert A Small
2015-03-31T23:59:59.000Z
A new method involving particle diagrams is introduced and developed into a rigorous framework for carrying out embedded random matrix calculations. Using particle diagrams and the attendant methodology including loop counting it becomes possible to calculate the fourth, sixth and eighth moments of embedded ensembles in a straightforward way. The method, which will be called the method of particle diagrams, proves useful firstly by providing a means of classifying the components of moments into particle paths, or loops, and secondly by giving a simple algorithm for calculating the magnitude of combinatorial expressions prior to calculating them explicitly. By confining calculations to the limit case $m \\ll l\\to\\infty$ this in many cases provides a sufficient excuse not to calculate certain terms at all, since it can be foretold using the method of particle diagrams that they will not survive in this asymptotic regime. Applying the method of particle diagrams washes out a great deal of the complexity intrinsic to the problem, with sufficient mathematical structure remaining to yield limiting statistics for the unified phase space of random matrix theories. Finally, since the unified form of random matrix theory is essentially the set of all randomised k-body potentials, it should be no surprise that the early statistics calculated for the unified random matrix theories in some instances resemble the statistics currently being discovered for quantum spin hypergraphs and other randomised potentials on graphs [HMH05,ES14,KLW14]. This is just the beginning for studies into the field of unified random matrix theories, or embedded ensembles, and the applicability of the method of particle diagrams to a wide range of questions as well as to the more exotic symmetry classes, such as the symplectic ensembles, is still an area of open-ended research.
TRANSPORT NUMBER GRADIENTS AND SOLID ELECTROLYTE DEGRADATION
De Jonghe, Lutgard C.
2014-01-01T23:59:59.000Z
NUMBER GRADIENTS AND SOLID ELECTROLYTE DEGRADATION LutgardNUMBER GRADIENTS AND SOLID ELECTROLYTE DEGRADATION LutgardNUMBER GRADIENTS AND SOLID ELECTROLYTE DEGRADATION Lutgard
TRANSPORT NUMBER GRADIENTS AND SOLID ELECTROLYTE DEGRADATION
De Jonghe, Lutgard C.
2012-01-01T23:59:59.000Z
NUMBER GRADIENTS AND SOLID ELECTROLYTE DEGRADATION LutgardNUMBER GRADIENTS AND SOLID ELECTROLYTE DEGRADATION LutgardNUMBER GRADIENTS AND SOLID ELECTROLYTE DEGRADATION Lutgard
Abreu, Gabriel
2010-01-01T23:59:59.000Z
In a general time-dependent (3+1)-dimensional spherically symmetric spacetime, the so-called Kodama vector is a naturally defined geometric quantity that is timelike outside the evolving horizon and so defines a preferred class of fiducial observers. However the Kodama vector does not by itself define any preferred notion of time. We demonstrate that a preferred time coordinate - which we shall call Kodama time - can be introduced by taking the additional step of applying the Clebsch decomposition theorem to the Kodama vector. We thus construct a geometrically preferred coordinate system for any time-dependent spherically symmetric spacetime, and explore its properties. In particular we use this formalism to construct a general class of conservation laws, generalizing Kodama's energy flux. We study the geometrically preferred fiducial observers, and demonstrate that it is possible to define and calculate a generalized notion of surface gravity that is valid throughout the entire evolving spacetime. Furthermor...
Texas Rice, Volume V, Number 3
. If it remains unused for extended periods of time, like 3 years, the land be- comes useless for rice farming. Moreover, industry representatives are dwindling. Farm machines, the John Deere stores, they are disap- pearing. Each year, older farmers quit or retire...Texas A&M University System Agricultural Research and Extension Center Beaumont, Texas May 2005 Volume V Number 3 Texas Rice The following is an excerpt of a speech delivered to the U.S. House of Representatives, April 28, 2005...
Texas Rice, Volume VII, Number 7
2007-01-01T23:59:59.000Z
Texas A&M University System Agricultural Research and Extension Center Beaumont, Texas September 2007 Volume VII Number 7 Texas Rice Nobel Peace Prize Recipient Dr. Norman Borlaug continued on page 4 September of 2003 was a time etched... Tabien, and Dr. Lee Tarpley. Four years ago this month, the Texas A&M Research and Exten- sion Center at Beaumont was hon- ored to welcome one of the most influential people in agriculture. Nobel Peace Prize recipient, Dr. Norman Borlaug, has a long...
Casey, S. C.; Patterson, R. L.; Gross, M.; Lickliter, K.; Stein, J. S.
2003-02-25T23:59:59.000Z
The U.S. Department of Energy (DOE) is responsible for disposing of transuranic waste in the Waste Isolation Pilot Plant (WIPP) in southeastern New Mexico. As part of that responsibility, DOE must comply with the U.S. Environmental Protection Agency's (EPA) radiation protection standards in Title 40 Code of Federal Regulations (CFR), Parts 191 and 194. This paper addresses compliance with the criteria of 40 CFR Section 194.24(d) and 194.24(f) that require DOE to either provide a waste loading scheme for the WIPP repository or to assume random emplacement in the mandated performance and compliance assessments. The DOE established a position on waste loading schemes during the process of obtaining the EPA's initial Certification in 1998. The justification for utilizing a random waste emplacement distribution within the WIPP repository was provided to the EPA. During the EPA rulemaking process for the initial certification, the EPA questioned DOE on whether waste would be loaded randomly as modeled in long-term performance assessment (PA) and the impact, if any, of nonrandom loading. In response, DOE conducted an impact assessment for non-random waste loading. The results of this assessment supported the contention that it does not matter whether random or non-random waste loading is assumed for the PA. The EPA determined that a waste loading plan was unnecessary because DOE had assumed random waste loading and evaluated the potential consequences of non-random loading for a very high activity waste stream. In other words, the EPA determined that DOE was not required to provide a waste loading scheme because compliance is not affected by the actual distribution of waste containers in the WIPP.
Parameters affecting the resilience of scale-free networks to random failures.
Link, Hamilton E.; LaViolette, Randall A.; Lane, Terran (University of New Mexico, Albuquerque, NM); Saia, Jared (University of New Mexico, Albuquerque, NM)
2005-09-01T23:59:59.000Z
It is commonly believed that scale-free networks are robust to massive numbers of random node deletions. For example, Cohen et al. in (1) study scale-free networks including some which approximate the measured degree distribution of the Internet. Their results suggest that if each node in this network failed independently with probability 0.99, most of the remaining nodes would still be connected in a giant component. In this paper, we show that a large and important subclass of scale-free networks are not robust to massive numbers of random node deletions. In particular, we study scale-free networks which have minimum node degree of 1 and a power-law degree distribution beginning with nodes of degree 1 (power-law networks). We show that, in a power-law network approximating the Internet's reported distribution, when the probability of deletion of each node is 0.5 only about 25% of the surviving nodes in the network remain connected in a giant component, and the giant component does not persist beyond a critical failure rate of 0.9. The new result is partially due to improved analytical accommodation of the large number of degree-0 nodes that result after node deletions. Our results apply to power-law networks with a wide range of power-law exponents, including Internet-like networks. We give both analytical and empirical evidence that such networks are not generally robust to massive random node deletions.
arXiv:0904.4193v2[cs.GT]24Aug2009 On the Power of Randomization in Algorithmic Mechanism Design
O'Donnell, Ryan
arXiv:0904.4193v2[cs.GT]24Aug2009 On the Power of Randomization in Algorithmic Mechanism Design In many settings the power of truthful mechanisms is severely bounded. In this paper we use randomization in expectation, whereas there is evidence that no polynomial-time truthful deterministic mechanism provides
Chertkov, Michael; Gabitov, Ildar
2004-03-02T23:59:59.000Z
The present invention provides methods and optical fibers for periodically pinning an actual (random) accumulated chromatic dispersion of an optical fiber to a predicted accumulated dispersion of the fiber through relatively simple modifications of fiber-optic manufacturing methods or retrofitting of existing fibers. If the pinning occurs with sufficient frequency (at a distance less than or are equal to a correlation scale), pulse degradation resulting from random chromatic dispersion is minimized. Alternatively, pinning may occur quasi-periodically, i.e., the pinning distance is distributed between approximately zero and approximately two to three times the correlation scale.
Giovannetti, Vittorio
We give a consistent quantum description of time, based on Page and Wootters’s conditional probabilities mechanism, which overcomes the criticisms that were raised against similar previous proposals. In particular we show ...
Unknown
2011-09-05T23:59:59.000Z
-1 THE PREDICTION OF BUS ARRIVAL TIME USING AUTOMATIC VEHICLE LOCATION SYSTEMS DATA A Dissertation by RAN HEE JEONG Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree... of DOCTOR OF PHILOSOPHY December 2004 Major Subject: Civil Engineering THE PREDICTION OF BUS ARRIVAL TIME USING AUTOMATIC VEHICLE LOCATION SYSTEMS DATA A Dissertation by RAN HEE JEONG Submitted to Texas A...
Schmidt, Volker
Stochastic 3D modeling of the microstructure of lithium-ion battery anodes via Gaussian random microstructures of lithium-ion battery anodes, which can serve as input for the simulations. We introduce the use; 1. Introduction Lithium-ion batteries used in electric vehicles need to fulfill a number
On Normal Numbers Veronica Becher
Figueira, Santiago
ends with all zeros; hence, q is not simply normal to base b. 3/23 #12;The problem is still open Theorem (Borel 1909) Almost all real numbers are absolutely normal. Problem (Borel 1909) Give an example transducers. Huffman 1959 calls them lossless compressors. A direct proof of the above theorem Becher
Randomized control of open quantum systems
Lorenza Viola
2006-01-16T23:59:59.000Z
The problem of open-loop dynamical control of generic open quantum systems is addressed. In particular, I focus on the task of effectively switching off environmental couplings responsible for unwanted decoherence and dissipation effects. After revisiting the standard framework for dynamical decoupling via deterministic controls, I describe a different approach whereby the controller intentionally acquires a random component. An explicit error bound on worst-case performance of stochastic decoupling is presented.
Prediction and Estimation of Random Fields
Kohli, Priya
2012-10-19T23:59:59.000Z
; z2) = 1X k=0 1X ‘=0 bk;‘z k 1z ‘ 2; 1(z1; z2) = 1X k=0 1X ‘=0 ak;‘z k 1z ‘ 2; (2.25) 20 from which it follows that the MA and AR parameters of the random field are related to each other via the recursions b0;0 = a0;0 = 1; bi...
Delone dynamical systems and associated random operators
Daniel Lenz; Peter Stollmann
2002-05-13T23:59:59.000Z
We carry out a careful study of basic topological and ergodic features of Delone dynamical systems. We then investigate the associated topological groupoids and in particular their representations on certain direct integrals with non constant fibres. Via non-commutative-integration theory these representations give rise to von Neumann algebras of random operators. Features of these algebras and operators are discussed. Restricting our attention to a certain subalgebra of tight binding operators, we then discuss a Shubin trace formula.
Chopped random-basis quantum optimization
Tommaso Caneva; Tommaso Calarco; Simone Montangero
2011-08-22T23:59:59.000Z
In this work we describe in detail the "Chopped RAndom Basis" (CRAB) optimal control technique recently introduced to optimize t-DMRG simulations [arXiv:1003.3750]. Here we study the efficiency of this control technique in optimizing different quantum processes and we show that in the considered cases we obtain results equivalent to those obtained via different optimal control methods while using less resources. We propose the CRAB optimization as a general and versatile optimal control technique.
Local semicircle law for random regular graphs
Roland Bauerschmidt; Antti Knowles; Horng-Tzer Yau
2015-05-26T23:59:59.000Z
We consider random $d$-regular graphs on $N$ vertices, with degree $d$ at least $(\\log N)^4$. We prove that the Green's function of the adjacency matrix and the Stieltjes transform of its empirical spectral measure are well approximated by Wigner's semicircle law, down to the optimal scale given by the typical eigenvalue spacing (up to a logarithmic correction). Aside from well-known consequences for the local eigenvalue distribution, this result implies the complete delocalization of all eigenvectors.
An implementation and analysis of a randomized distributed stack
Kirkland, Dustin Charles
2013-02-22T23:59:59.000Z
regular register, the randomized distributed stack stands to positively affect the load and availability of a system. Popping this randomized distributed stack, however, sometimes returns incorrect values. Analysis of the data assembled reveals two...
Random parking, Euclidean functionals, and rubber elasticity
Antoine Gloria; Mathew D. Penrose
2012-03-06T23:59:59.000Z
We study subadditive functions of the random parking model previously analyzed by the second author. In particular, we consider local functions $S$ of subsets of $\\mathbb{R}^d$ and of point sets that are (almost) subadditive in their first variable. Denoting by $\\xi$ the random parking measure in $\\mathbb{R}^d$, and by $\\xi^R$ the random parking measure in the cube $Q_R=(-R,R)^d$, we show, under some natural assumptions on $S$, that there exists a constant $\\bar{S}\\in \\mathbb{R}$ such that % $$ \\lim_{R\\to +\\infty} \\frac{S(Q_R,\\xi)}{|Q_R|}\\,=\\,\\lim_{R\\to +\\infty}\\frac{S(Q_R,\\xi^R)}{|Q_R|}\\,=\\,\\bar{S} $$ % almost surely. If $\\zeta \\mapsto S(Q_R,\\zeta)$ is the counting measure of $\\zeta$ in $Q_R$, then we retrieve the result by the second author on the existence of the jamming limit. The present work generalizes this result to a wide class of (almost) subadditive functions. In particular, classical Euclidean optimization problems as well as the discrete model for rubber previously studied by Alicandro, Cicalese, and the first author enter this class of functions. In the case of rubber elasticity, this yields an approximation result for the continuous energy density associated with the discrete model at the thermodynamic limit, as well as a generalization to stochastic networks generated on bounded sets.
Random parking, Euclidean functionals, and rubber elasticity
Gloria, Antoine
2012-01-01T23:59:59.000Z
We study subadditive functions of the random parking model previously analyzed by the second author. In particular, we consider local functions $S$ of subsets of $\\mathbb{R}^d$ and of point sets that are (almost) subadditive in their first variable. Denoting by $\\xi$ the random parking measure in $\\mathbb{R}^d$, and by $\\xi^R$ the random parking measure in the cube $Q_R=(-R,R)^d$, we show, under some natural assumptions on $S$, that there exists a constant $\\bar{S}\\in \\mathbb{R}$ such that % $$ \\lim_{R\\to +\\infty} \\frac{S(Q_R,\\xi)}{|Q_R|}\\,=\\,\\lim_{R\\to +\\infty}\\frac{S(Q_R,\\xi^R)}{|Q_R|}\\,=\\,\\bar{S} $$ % almost surely. If $\\zeta \\mapsto S(Q_R,\\zeta)$ is the counting measure of $\\zeta$ in $Q_R$, then we retrieve the result by the second author on the existence of the jamming limit. The present work generalizes this result to a wide class of (almost) subadditive functions. In particular, classical Euclidean optimization problems as well as the discrete model for rubber previously studied by Alicandro, Cicalese,...
Minnesota Natural Gas Number of Residential Consumers (Number of Elements)
U.S. Energy Information Administration (EIA) Indexed Site
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home PageSummary" ,"Click worksheet nameDomesticResidentialEstimated ProductionHeating OilResidential Consumers (Number of
The role of the Kubo number in two-component turbulence
Qin, G. [State Key Laboratory of Space Weather, Center for Space Science and Applied Research, Chinese Academy of Sciences, Beijing 100190 (China)] [State Key Laboratory of Space Weather, Center for Space Science and Applied Research, Chinese Academy of Sciences, Beijing 100190 (China); Shalchi, A. [Department of Physics and Astronomy, University of Manitoba, Winnipeg, Manitoba R3T 2N2 (Canada)] [Department of Physics and Astronomy, University of Manitoba, Winnipeg, Manitoba R3T 2N2 (Canada)
2013-09-15T23:59:59.000Z
We explore the random walk of magnetic field lines in two-component turbulence by using computer simulations. It is often assumed that the two-component model provides a good approximation for solar wind turbulence. We explore the dependence of the field line diffusion coefficient on the Kubo number which is a fundamental and characteristic quantity in the theory of turbulence. We show that there are two transport regimes. One is the well-known quasilinear regime in which the diffusion coefficient is proportional to the Kubo number squared, and the second one is a nonlinear regime in which the diffusion coefficient is directly proportional to the Kubo number. The so-called percolative transport regime which is often discussed in the literature cannot be found. The numerical results obtained in the present paper confirm analytical theories for random walking field lines developed in the past.
The Golden-Thompson inequality --- historical aspects and random matrix applications
Peter J. Forrester; Colin J. Thompson
2014-08-09T23:59:59.000Z
The Golden-Thompson inequality, ${\\rm Tr} \\, (e^{A + B}) \\le {\\rm Tr} \\, (e^A e^B)$ for $A,B$ Hermitian matrices, appeared in independent works by Golden and Thompson published in 1965. Both of these were motivated by considerations in statistical mechanics. In recent years the Golden-Thompson inequality has found applications to random matrix theory. In this survey article we detail some historical aspects relating to Thompson's work, giving in particular an hitherto unpublished proof due to Dyson, and correspondence with P\\'olya. We show too how the $2 \\times 2$ case relates to hyperbolic geometry, and how the original inequality holds true with the trace operation replaced by any unitarily invariant norm. In relation to the random matrix applications, we review its use in the derivation of concentration type lemmas for sums of random matrices due to Ahlswede-Winter, and Oliveira, generalizing various classical results.
Asymptotics of finite system Lyapunov exponents for some random matrix ensembles
Peter J. Forrester
2015-01-23T23:59:59.000Z
For products $P_N$ of $N$ random matrices of size $d \\times d$, there is a natural notion of finite $N$ Lyapunov exponents $\\{\\mu_i\\}_{i=1}^d$. In the case of standard Gaussian random matrices with real, complex or real quaternion elements, and extended to the general variance case for $\\mu_1$, methods known for the computation of $\\lim_{N \\to \\infty} \\langle \\mu_i \\rangle$ are used to compute the large $N$ form of the variances of the exponents. Analogous calculations are performed in the case that the matrices making up $P_N$ are products of sub-blocks of random unitary matrices with Haar measure. Furthermore, we make some remarks relating to the coincidence of the Lyapunov exponents and the stability exponents relating to the eigenvalues of $P_N$.
Monte Carlo Algorithmsa The randomized bipartite perfect matching algorithm is
Lyuu, Yuh-Dauh
, National Taiwan University Page 461 #12;The Markov Inequalitya Lemma 64 Let x be a random variable taking
Monte Carlo Algorithmsa The randomized bipartite perfect matching algorithm is
Lyuu, Yuh-Dauh
Markov Inequalitya Lemma 61 Let x be a random variable taking nonnegative integer values. Then for any k
Renormalized field theory of collapsing directed randomly branched polymers
Hans-Karl Janssen; Frank Wevelsiep; Olaf Stenull
2009-10-01T23:59:59.000Z
We present a dynamical field theory for directed randomly branched polymers and in particular their collapse transition. We develop a phenomenological model in the form of a stochastic response functional that allows us to address several interesting problems such as the scaling behavior of the swollen phase and the collapse transition. For the swollen phase, we find that by choosing model parameters appropriately, our stochastic functional reduces to the one describing the relaxation dynamics near the Yang-Lee singularity edge. This corroborates that the scaling behavior of swollen branched polymers is governed by the Yang-Lee universality class as has been known for a long time. The main focus of our paper lies on the collapse transition of directed branched polymers. We show to arbitrary order in renormalized perturbation theory with $\\varepsilon$-expansion that this transition belongs to the same universality class as directed percolation.
Spin-Hall-assisted magnetic random access memory
Brink, A. van den, E-mail: a.v.d.brink@tue.nl; Swagten, H. J. M.; Koopmans, B. [Physics of Nanostructures, Eindhoven University of Technology, 5600 MB Eindhoven (Netherlands)] [Physics of Nanostructures, Eindhoven University of Technology, 5600 MB Eindhoven (Netherlands); Cosemans, S.; Manfrini, M.; Van Roy, W.; Min, T. [imec, Kapeldreef 75, B-3001 Leuven (Belgium)] [imec, Kapeldreef 75, B-3001 Leuven (Belgium); Cornelissen, S.; Vaysset, A. [imec, Kapeldreef 75, B-3001 Leuven (Belgium) [imec, Kapeldreef 75, B-3001 Leuven (Belgium); Departement elektrotechniek (ESAT), KU Leuven, Kasteelpark Arenberg 10, B-3001 Heverlee (Belgium)
2014-01-06T23:59:59.000Z
We propose a write scheme for perpendicular spin-transfer torque magnetoresistive random-access memory that significantly reduces the required tunnel current density and write energy. A sub-nanosecond in-plane polarized spin current pulse is generated using the spin-Hall effect, disturbing the stable magnetic state. Subsequent switching using out-of-plane polarized spin current becomes highly efficient. Through evaluation of the Landau-Lifshitz-Gilbert equation, we quantitatively assess the viability of this write scheme for a wide range of system parameters. A typical example shows an eight-fold reduction in tunnel current density, corresponding to a fifty-fold reduction in write energy, while maintaining a 1?ns write time.
Maximally Random Jamming of Two-Dimensional One-Component and Binary Hard Disc Fluids
Xinliang Xu; Stuart A. Rice
2010-10-05T23:59:59.000Z
We report calculations of the density of maximally random jamming (aka random close packing) of one-component and binary hard disc fluids. The theoretical structure used provides a common framework for description of the hard disc liquid to hexatic, the liquid to hexagonal crystal and the liquid-to-maximally random jammed state transitions. Our analysis is based on locating a particular bifurcation of the solutions of the integral equation for the inhomogeneous single particle density at the transition between different spatial structures. The bifurcation of solutions we study is initiated from the dense metastable fluid, and we associate it with the limit of stability of the fluid, which we identify with the transition from the metastable fluid to a maximally random jammed state. For the one-component hard disc fluid the predicted packing fraction at which the metastable fluid to maximally random jammed state transition occurs is 0.84, in excellent agreement with the experimental value 0.84 \\pm 0.02. The corresponding analysis of the limit of stability of a binary hard disc fluid with specified disc diameter ratio and disc composition requires extra approximations in the representations of the direct correlation function, the equation of state, and the number of order parameters accounted for. Keeping only the order parameter identified with the largest peak in the structure factor of the highest density regular lattice with the same disc diameter ratio and disc composition as the binary fluid, the predicted density of maximally random jamming is found to be 0.84 to 0.87, depending on the equation of state used, and very weakly dependent on the ratio of disc diameters and the fluid composition, in agreement with both experimental data and computer simulation data.
Theory of Large Dimensional Random Matrices for Engineers
matrix theory in wireless communication theory, interest in the study of random matrices began of asymptotic random matrix theory, has emerged in the communications and information theory literature of the statistics of random matrices arising in wireless communications. The emphasis will be on asymptotic
Stretched Polymers in Random Environment Dmitry Ioffe and Yvan Velenik
Velenik, Yvan
Stretched Polymers in Random Environment Dmitry Ioffe and Yvan Velenik Abstract We survey recent results and open questions on the ballistic phase of stretched polymers in both annealed and quenched Introduction Stretched polymers or drifted random walks in random potentials could be consid- ered either
Quantum randomness extraction for various levels of characterization of the devices
Yun Zhi Law; Le Phuc Thinh; Jean-Daniel Bancal; Valerio Scarani
2014-10-15T23:59:59.000Z
The amount of intrinsic randomness that can be extracted from measurement on quantum systems depends on several factors: notably, the power given to the adversary and the level of characterization of the devices of the authorized partners. After presenting a systematic introduction to these notions, in this paper we work in the class of least adversarial power, which is relevant for assessing setups operated by trusted experimentalists, and compare three levels of characterization of the devices. Many recent studies have focused on the so-called "device-independent" level, in which a lower bound on the amount of intrinsic randomness can be certified without any characterization. The other extreme is the case when all the devices are fully characterized: this "tomographic" level has been known for a long time. We present for this case a systematic and efficient approach to quantifying the amount of intrinsic randomness, and show that setups involving ancillas (POVMs, pointer measurements) may not be interesting here, insofar as one may extract randomness from the ancilla rather than from the system under study. Finally, we study how much randomness can be obtained in presence of an intermediate level of characterization related to the task of "steering", in which Bob's device is fully characterized while Alice's is a black box. We obtain our results here by adapting the NPA hierarchy of semidefinite programs to the steering scenario.
Utah Natural Gas Number of Residential Consumers (Number of Elements)
Gasoline and Diesel Fuel Update (EIA)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports to3,1,50022,3,,0,,6,1,Separation 23 362 334 318 706Production (Million(MillionFeet) Oil WellsResidential Consumers (Number of
Washington Natural Gas Number of Residential Consumers (Number of Elements)
Gasoline and Diesel Fuel Update (EIA)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports to3,1,50022,3,,0,,6,1,Separation 23 362 334 318 706Production (Million(MillionFeet)TotalResidential Consumers (Number of Elements)
Hawaii Natural Gas Number of Residential Consumers (Number of Elements)
Annual Energy Outlook 2013 [U.S. Energy Information Administration (EIA)]
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports to3,1,50022,3,,0,,6,1,Separation 23 362 334 318 706Production%3.PDFFeet) YearProduction from GreaterResidential Consumers (Number of
Iowa Natural Gas Number of Industrial Consumers (Number of Elements)
Annual Energy Outlook 2013 [U.S. Energy Information Administration (EIA)]
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports to3,1,50022,3,,0,,6,1,Separation 23 362 334 318 706Production%3.PDFFeet) YearProductionYear Jan FebIndustrial Consumers (Number of
Iowa Natural Gas Number of Residential Consumers (Number of Elements)
Annual Energy Outlook 2013 [U.S. Energy Information Administration (EIA)]
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports to3,1,50022,3,,0,,6,1,Separation 23 362 334 318 706Production%3.PDFFeet) YearProductionYear Jan FebIndustrial Consumers (Number
Maine Natural Gas Number of Residential Consumers (Number of Elements)
Annual Energy Outlook 2013 [U.S. Energy Information Administration (EIA)]
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports to3,1,50022,3,,0,,6,1,Separation 23 362 334 318Cubic Feet) Year Jan Feb Mar Apr May Jun Jul Aug Sep OctResidential Consumers (Number
Nebraska Natural Gas Number of Commercial Consumers (Number of Elements)
U.S. Energy Information Administration (EIA) Indexed Site
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home PageSummary" ,"Click worksheet,167,371 6,826,192 6,994,120 7,226,215throughCommercial Consumers (Number of Elements)
Nebraska Natural Gas Number of Industrial Consumers (Number of Elements)
U.S. Energy Information Administration (EIA) Indexed Site
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home PageSummary" ,"Click worksheet,167,371 6,826,192 6,994,120 7,226,215throughCommercial Consumers (Number ofIndustrial
Nebraska Natural Gas Number of Residential Consumers (Number of Elements)
U.S. Energy Information Administration (EIA) Indexed Site
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative Fuels Data Center Home Page on Google Bookmark EERE: Alternative Fuels Data Center Home PageSummary" ,"Click worksheet,167,371 6,826,192 6,994,120 7,226,215throughCommercial Consumers (Number
California Natural Gas Number of Residential Consumers (Number of Elements)
Gasoline and Diesel Fuel Update (EIA)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports to3,1,50022,3,,0,,6,1,Separation 23 362 334 318 706 802 1979-2013OctoberEstimatedDecadeProvedCubicResidential Consumers (Number of
Wyoming Natural Gas Number of Industrial Consumers (Number of Elements)
Annual Energy Outlook 2013 [U.S. Energy Information Administration (EIA)]
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports to3,1,50022,3,,0,,6,1,Separation 23 362 334 318Cubic Feet) YearSalesNew Field Discoveries (Billion CubicIndustrial Consumers (Number
A Linear-Time Approach for Static Timing Analysis Covering All Process Corners
Najm, Farid N.
A Linear-Time Approach for Static Timing Analysis Covering All Process Corners Sari Onaissi into the timing analysis of a circuit. With the increase in the number of interesting process vari- ables process variations lead to circuit timing variability and a corresponding timing yield loss. Traditional
A random walk approach to anomalous particle and energy transport
H. Isliker
2007-10-26T23:59:59.000Z
The combined Continuous Time Random Walk (CTRW) in position and momentum space is introduced, in the form of two coupled integral equations that describe the evolution of the probability distribution for finding a particle at a certain position and with a certain momentum as a function of time. The integral equations are solved numerically with a pseudospectral method that is based on the expansion of the unknown functions in terms of Chebyshev polynomials. In parallel, Monte-Carlo simulation are performed. Through the inclusion of momentum space, the combined CTRW is able to yield results on density and temperature profile evolution, on particle and heat fluxes and diffusivities, and on kinetic energy distributions. Depending on the choice of the probability distributions of the particle displacements in position and momentum space, the combined CTRW is able to model phenomena of anomalous transport in position as well as in momentum (or energy or velocity) space. An application is made to a toroidally confined plasma that undergoes off-center injection of cold plasma (off-axis fueling), using two variants of the model, the mixed model and the critical gradient model. The phenomenon of profile stiffness is addressed, both for the density and for the temperature profile, respectively, and the particle and energy confinement times are determined. The analysis of the particle and heat fluxes shows that the dynamics realized in the combined CTRW is incompatible with the classical approach of Fick's or Fourier's law for particle and heat transport, respectively.
Jung Yu, Dae [School of Space Research, Kyung Hee University, Yongin 446-701 (Korea, Republic of)] [School of Space Research, Kyung Hee University, Yongin 446-701 (Korea, Republic of); Kim, Kihong [Department of Energy Systems Research, Ajou University, Suwon 443-749 (Korea, Republic of)] [Department of Energy Systems Research, Ajou University, Suwon 443-749 (Korea, Republic of)
2013-12-15T23:59:59.000Z
We study the effects of a random spatial variation of the plasma density on the mode conversion of electromagnetic waves into electrostatic oscillations in cold, unmagnetized, and stratified plasmas. Using the invariant imbedding method, we calculate precisely the electromagnetic field distribution and the mode conversion coefficient, which is defined to be the fraction of the incident wave power converted into electrostatic oscillations, for the configuration where a numerically generated random density variation is added to the background linear density profile. We repeat similar calculations for a large number of random configurations and take an average of the results. We obtain a peculiar nonmonotonic dependence of the mode conversion coefficient on the strength of randomness. As the disorder increases from zero, the maximum value of the mode conversion coefficient decreases initially, then increases to a maximum, and finally decreases towards zero. The range of the incident angle in which mode conversion occurs increases monotonically as the disorder increases. We present numerical results suggesting that the decrease of mode conversion mainly results from the increased reflection due to the Anderson localization effect originating from disorder, whereas the increase of mode conversion of the intermediate disorder regime comes from the appearance of many resonance points and the enhanced tunneling between the resonance points and the cutoff point. We also find a very large local enhancement of the magnetic field intensity for particular random configurations. In order to obtain high mode conversion efficiency, it is desirable to restrict the randomness close to the resonance region.
A Proposed Exact Integer Value for Avogadro's Number
Ronald F. Fox; Theodore P. Hill
2007-04-28T23:59:59.000Z
An exact value for Avodagro's number, namely NA* = (84446888)^3, is proposed. The number 84446888 represents the side length of a cube of atoms whose volume is closest, among all integral side lengths, to the current official NIST value of Avogadro's number. This value NA* is nearly dead center of the estimated range for the value of Avogadro's number, and is within the official standard level of uncertainty. Adoption of this value as the fixed value for NA would eliminate the current time-dependent definition of Avogadro's number, which depends on the definition of kilogram via an unstable physical artifact. It would also eliminate the need for the kilogram artifact altogether, since then, by definition, a kilogram would be exactly 1000/12 the mass of NA* atoms of carbon-12.
Non-adiabatic quantum pumping by a randomly moving quantum dot
Stanislav Derevyanko; Daniel Waltner
2015-02-10T23:59:59.000Z
We look at random time dependent fluctuations of the electrical charge in an open 1D quantum system represented by a quantum dot experiencing random lateral motion. In essentially non-adiabatic settings we study both diffusive and ballistic (Levy) regimes of the barrier motion. Here the electric current as well as the net pumped electric charge experience random fluctuations over the static background. We show that in the large-time limit $t \\to \\infty$ the wavefunction is naturally separated into the Berry-phase component (resulting from the singular part of the wave amplitude in the co-moving frame) and the non-adiabatic correction (arising from fast oscillating, slow decaying tails of the same amplitude). In the special limit of a delta-correlated continuous Gaussian random walk we obtain closed analytical expressions for the ensemble averaged amplitude in the co-moving frame and demonstrate that the main contribution to the average wavefunction and probability current comes from the Berry-phase component which leads to the saturation of the fluctuations of the electric current and the pumped charge. We also derive the exact expressions for the average propagator (in the co-moving basis representation) for both types of motion.
Chaotic motion of three-body problem : an origin of macroscopic randomness of the universe
Shijun Liao
2013-04-08T23:59:59.000Z
The famous three-body problem is investigated by means of a numerical approach with negligible numerical noises in a long enough time interval, namely the Clean Numerical Simulation (CNS). From physical viewpoints, position of any bodies contains inherent micro-level uncertainty. The evaluations of such kind of inherent micro-level uncertainty are accurately simulated by means of the CNS. Our reliable, very accurate CNS results indicate that the inherent micro-level uncertainty of position of a star/planet might transfer into macroscopic randomness. Thus, the inherent micro-level uncertainty of a body might be an origin of macroscopic randomness of the universe. In addition, from physical viewpoints, orbits of some three-body systems at large time are inherently random, and thus it has no physical meanings to talk about the accurate long-term prediction of the chaotic orbits. Note that such kind of uncertainty and randomness has nothing to do with the ability of human being. All of these might enrich our knowledge and deepen our understandings about not only the three-body problem but also chaos.
Emergent geometry from random multitrace matrix models
B. Ydri; A. Rouag; K. Ramda
2015-09-11T23:59:59.000Z
A novel scenario for the emergence of geometry in random multitrace matrix models of a single hermitian matrix $M$ with unitary $U(N) $ invariance, i.e. without a kinetic term, is presented. In particular, the dimension of the emergent geometry is determined from the critical exponents of the disorder-to-uniform-ordered transition whereas the metric is determined from the Wigner semicircle law behavior of the eigenvalues distribution of the matrix $M$. If the uniform ordered phase is not sustained in the phase diagram then there is no emergent geometry in the multitrace matrix model.
Open quantum systems and Random Matrix Theory
Declan Mulhall
2015-01-09T23:59:59.000Z
A simple model for open quantum systems is analyzed with Random Matrix Theory. The system is coupled to the continuum in a minimal way. In this paper we see the effect of opening the system on the level statistics, in particular the $\\Delta_3(L)$ statistic, width distribution and level spacing are examined as a function of the strength of this coupling. A super-radiant transition is observed, and it is seen that as it is formed, the level spacing and $\\Delta_3(L)$ statistic exhibit the signatures of missed levels.
Statistical Properties of the T-exponential of Isotropically Distributed Random Matrices
Anton S. Il'yn; Valeria A. Sirota; Kirill P. Zybin
2015-06-05T23:59:59.000Z
A functional method for calculating averages of the time-ordered exponential of a continuous isotropic random $N\\times N$ matrix process is presented. The process is not assumed to be Gaussian. In particular, the Lyapunov exponents and higher correlation functions of the T-exponent are derived from the statistical properties of the process. The approach may be of use in a wide range of physical problems. For example, in theory of turbulence the account of non-gaussian statistics is very important since the non-Gaussian behavior is responsible for the time asymmetry of the energy flow.
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports(Journal Article) |govInstrumentsmfrirtA Journey InsideMicroBooNE LArTPC Sarah Lockwitz, FNAL 2013 DPFTheses 2014No.7 D I STime Off Time Off A
Random unitary maps for quantum state reconstruction
Merkel, Seth T. [Institute for Quantum Computing, Waterloo, Ontario N2L 3G1 (Canada); Riofrio, Carlos A.; Deutsch, Ivan H. [Center for Quantum Information and Control (CQuIC), Department of Physics and Astronomy, University of New Mexico, Albuquerque, New Mexico, 87131 (United States); Flammia, Steven T. [Perimeter Institute for Theoretical Physics, Waterloo, Ontario N2L 2Y5 (Canada); Kavli Institute for Theoretical Physics, University of California, Santa Barbara, California 93106 (United States)
2010-03-15T23:59:59.000Z
We study the possibility of performing quantum state reconstruction from a measurement record that is obtained as a sequence of expectation values of a Hermitian operator evolving under repeated application of a single random unitary map, U{sub 0}. We show that while this single-parameter orbit in operator space is not informationally complete, it can be used to yield surprisingly high-fidelity reconstruction. For a d-dimensional Hilbert space with the initial observable in su(d), the measurement record lacks information about a matrix subspace of dimension {>=}d-2 out of the total dimension d{sup 2}-1. We determine the conditions on U{sub 0} such that the bound is saturated, and show they are achieved by almost all pseudorandom unitary matrices. When we further impose the constraint that the physical density matrix must be positive, we obtain even higher fidelity than that predicted from the missing subspace. With prior knowledge that the state is pure, the reconstruction will be perfect (in the limit of vanishing noise) and for arbitrary mixed states, the fidelity is over 0.96, even for small d, and reaching F>0.99 for d>9. We also study the implementation of this protocol based on the relationship between random matrices and quantum chaos. We show that the Floquet operator of the quantum kicked top provides a means of generating the required type of measurement record, with implications on the relationship between quantum chaos and information gain.
Multidimensional Random Polymers : A Renewal Approach
Dmitry Ioffe
2014-11-30T23:59:59.000Z
In these lecture notes, which are based on the mini-course given at 2013 Prague School on Mathematical Statistical Physics, we discuss ballistic phase of quenched and annealed stretched polymers in random environment on ${\\mathbb Z}^d$ with an emphasis on the natural renormalized renewal structures which appear in such models. In the ballistic regime an irreducible decomposition of typical polymers leads to an effectiverandom walk reinterpretation of the latter. In the annealed casethe Ornstein-Zernike theory based on this approach paves the way to an essentially complete control on the level of local limit results and invariance principles. In the quenched case, the renewal structure maps the model of stretched polymers into an effective model of directed polymers. As a result one is able to use techniques and ideas developed in the context of directed polymers in order to address issues like strong disorder in low dimensions and weak disorder in higher dimensions. Among the topics addressed: Thermodynamics of quenched and annealed models, multi-dimensional renewal theory (under Cramer's condition), renormalization and effective random walk structure of annealed polymers, very weak disorder in dimensions $d\\geq 4$ and strong disorder in dimensions $d=1,2$.
Daiqin Su; T. C. Ralph
2015-07-02T23:59:59.000Z
We show that the particle number distribution of diamond modes, modes that are localised in a finite space-time region, are thermal for the Minkowski vacuum state of a massless scalar field, an analogue to the Unruh effect. The temperature of the diamond is inversely proportional to its size. An inertial observer can detect this thermal radiation by coupling to the diamond modes using an appropriate energy scaled detector. We further investigate the correlations between various diamonds and find that entanglement between adjacent diamonds dominates.
An objective change point analysis of landfalling historical Atlantic hurricane numbers
Jewson, S; Jewson, Stephen; Penzer, Jeremy
2006-01-01T23:59:59.000Z
In previous work we have analysed the Atlantic basin hurricane number time-series to identify decadal time-scale change points. We now repeat the analysis but for US landfalling hurricanes. The results are very different.
Takuya Kanazawa; Tilo Wettig
2014-09-28T23:59:59.000Z
We generalize QCD at asymptotically large isospin chemical potential to an arbitrary even number of flavors. We also allow for small quark chemical potentials, which stress the coincident Fermi surfaces of the paired quarks and lead to a sign problem in Monte Carlo simulations. We derive the corresponding low-energy effective theory in both $p$- and $\\epsilon$-expansion and quantify the severity of the sign problem. We construct the random matrix theory describing our physical situation and show that it can be mapped to a known random matrix theory at low baryon density so that new insights can be gained without additional calculations. In particular, we explain the Silver Blaze phenomenon at high isospin density. We also introduce stressed singular values of the Dirac operator and relate them to the pionic condensate. Finally we comment on extensions of our work to two-color QCD.
The Fermat and Mersenne Numbers
Nowlin, W. D.
1960-01-01T23:59:59.000Z
(mcd 2+1). Moreover, since p=4nt3jh7 (n)0), p 2IW. I~M . Hence N is composite. p p We close this section with a result concerning Mersenne numbers which is very similar to Theorem 8. Theorem 10. If q is prime and q ~ N (po 2), then q=8K-I. p... that, 21 p ~ U n 1, a contradiction to Theorem 14. Thus w = 2 . Moreover, 2 by' Theorem 16, p ) U , and it follows that w 4 p- C, which gives p w g p+h Therefore 2 -lgp+~2-1 whioh is impossible. Hence M must be prime and the proof of Theorem 20...
Ramos Heredia, Rafael Juda
1995-01-01T23:59:59.000Z
the first time I met him. I would also like to convey my appreciation to my sponsor, Instituto Mexicano del Petroleo, and to the Offshore Technology Research Center for providing the experimental data contained in this work. Special thanks go to Dr. John M... of the Department) May 1995 Major Subject: Ocean Engineering Comparisons on Offshore Structure Responses to Random Waves Using Linear and High-order Wave Theories. (May 1995) Refuel Juda Ramos Heredia, B. S. , Instituto Politecnico Nacional, Mexico City Chair...
Fresh look at randomly branched polymers
Hans-Karl Janssen; Olaf Stenull
2009-11-09T23:59:59.000Z
We develop a new, dynamical field theory of isotropic randomly branched polymers, and we use this model in conjunction with the renormalization group (RG) to study several prominent problems in the physics of these polymers. Our model provides an alternative vantage point to understand the swollen phase via dimensional reduction. We reveal a hidden Becchi-Rouet-Stora (BRS) symmetry of the model that describes the collapse ($\\theta$-)transition to compact polymer-conformations, and calculate the critical exponents to 2-loop order. It turns out that the long-standing 1-loop results for these exponents are not entirely correct. A runaway of the RG flow indicates that the so-called $\\theta^\\prime$-transition could be a fluctuation induced first order transition.
Viscoelastic contact mechanics between randomly rough surfaces
Michele Scaraggi; Bo N. J. Persson
2014-06-27T23:59:59.000Z
We present exact numerical results for the friction force and the contact area for a viscoelastic solid (rubber) in sliding contact with hard, randomly rough substrates. The rough surfaces are self-affine fractal with roughness over several decades in length scales. We calculate the contribution to the friction from the pulsating deformations induced by the substrate asperities. We also calculate how the area of real contact, $A(v,p) $, depends on the sliding speed $v$ and on the nominal contact pressure $p$, and we show how the contact area for any sliding speed can be obtained from a universal master curve $A(p)$. The numerical results are found to be in good agreement with the predictions of an analytical contact mechanics theory.
On q-deformed Stirling numbers
Yilmaz Simsek
2007-11-03T23:59:59.000Z
The purpose of this article is to introduce q-deformed Stirling numbers of the first and second kinds. Relations between these numbers, Riemann zeta function and q-Bernoulli numbers of higher order are given. Some relations related to the classical Stirling numbers and Bernoulli numbers of higher order are found. By using derivative operator to the generating function of the q-deformed Stirling numbers of the second kinds, a new function is defined which interpolates the q-deformed Stirling numbers of the second kinds at negative integers. The recurrence relations of the Stirling numbers of the first and second kind are given. In addition, relation between q-deformed Stirling numbers and q-Bell numbers is obtained.
SACI: Statistical Static Timing Analysis of Coupled Interconnects
Pedram, Massoud
in the circuit timing that stem from various sources of variations. However, static timing analysis (STA crosstalk effects in these circuits. As a result, crosstalk analysis and management have been classified line as a linear function of random variables and then use these r.v.'s to compute the circuit mo
Department for Analysis and Computational Number Theory Additive functions and number systems
Department for Analysis and Computational Number Theory Additive functions and number systems systems April 7, 2010 1 / 35 #12;Department for Analysis and Computational Number Theory Outline Number and Computational Number Theory Number systems Let R be an integral domain, b R, and N = {n1, . . . , nm} R
Clay Mathematics Proceedings Noncommutative Geometry and Number Theory
Tretkoff, Paula
Clay Mathematics Proceedings Noncommutative Geometry and Number Theory Paula B. Cohen Introduction of the Riemann Hypothesis, from which we quote several times, is given by Enrico Bombieri on the Clay Mathematics Mathematics Subject Classification 11J06, 58B34. The author acknowledges support from the Clay Foundation. c
HAZARDOUS WASTE & HAZARDOUS MATERIALS Volume 13, Number 2, 1996
Alvarez, Pedro J.
-contaminated aquifers in North America and Europe. Nevertheless, this experience should be extrapolated with care economic boom, during the so called "Brazilian miracle", there was a large increase in the number of gas stations in the country. Considering that the mean life time of underground storage tanks is about 20 years
A Version Numbering Scheme with a Useful Lexicographical Order
Keller, Arthur M.
A Version Numbering Scheme with a Useful Lexicographical Order Arthur M. Kellery Je rey D. Ullmanz Engineering Database. This e ort is funded in part by NSF grant IRI 91 16646. yArthur Keller's e-mail address records can be obtained in little more than the time it takes to access data of this bulk. Our primary
The coordinates of isolated accumulations are exactly computable real numbers
Durand-Lose, JĂ©rĂ´me
The coordinates of isolated accumulations are exactly computable real numbers JÂ´er^ome Durand and Smale. The key is that accumulations can be de- vised to accelerate the computation and provide an exact for coordinates and speeds, the collections of positions of accumulations in both space and time are exactly
Dispatch R427 Time perception: Brain time or event time?
Johnston, Alan
Dispatch R427 Time perception: Brain time or event time? Alan Johnston* and Shin'ya Nishida Recent experiments show that synchronous events can appear to an observer to occur at different times. Neural processing time delays are offered as an explanation of these temporal illusions, but equating perceived time
Evidence for Non-Random Hydrophobicity Structures in Protein Chains
Anders Irbäck; Carsten Peterson; Frank Potthast
1996-10-15T23:59:59.000Z
The question of whether proteins originate from random sequences of amino acids is addressed. A statistical analysis is performed in terms of blocked and random walk values formed by binary hydrophobic assignments of the amino acids along the protein chains. Theoretical expectations of these variables from random distributions of hydrophobicities are compared with those obtained from functional proteins. The results, which are based upon proteins in the SWISS-PROT data base, convincingly show that the amino acid sequences in proteins differ from what is expected from random sequences in a statistical significant way. By performing Fourier transforms on the random walks one obtains additional evidence for non-randomness of the distributions. We have also analyzed results from a synthetic model containing only two amino-acid types, hydrophobic and hydrophilic. With reasonable criteria on good folding properties in terms of thermodynamical and kinetic behavior, sequences that fold well are isolated. Performing the same statistical analysis on the sequences that fold well indicates similar deviations from randomness as for the functional proteins. The deviations from randomness can be interpreted as originating from anticorrelations in terms of an Ising spin model for the hydrophobicities. Our results, which differ from previous investigations using other methods, might have impact on how permissive with respect to sequence specificity the protein folding process is -- only sequences with non-random hydrophobicity distributions fold well. Other distributions give rise to energy landscapes with poor folding properties and hence did not survive the evolution.
Embedding quantum and random optics in a larger field theory
Peter Morgan
2008-06-09T23:59:59.000Z
Introducing creation and annihilation operators for negative frequency components extends the algebra of smeared local observables of quantum optics to include an associated classical random field optics.
Non-classical Random Walks - Simple models, surprising results ...
Jonathon Peterson
2009-04-17T23:59:59.000Z
Apr 25, 2009 ... Example: Probability distribution of simple random walk with p = .75 after 50 steps. ..... Theorem (Lyons, Pemantle, & Peres '96). There exists a ...
18.440 Probability and Random Variables, Spring 2009
Dudley, Richard
This course introduces students to probability and random variables. Topics include distribution functions, binomial, geometric, hypergeometric, and Poisson distributions. The other topics covered are uniform, exponential, ...
Efficient random coordinate descent algorithms for large-scale ...
2013-05-04T23:59:59.000Z
(will be inserted by the editor). Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization. Andrei Patrascu · Ion Necoara.
Kernel Carpentry for Online Regression using Randomly Varying Coefficient Model
Edakunni, Narayanan U.; Schaal, Stefan; Vijayakumar, Sethu
2006-01-01T23:59:59.000Z
We present a Bayesian formulation of locally weighted learning (LWL) using the novel concept of a randomly varying coefficient model. Based on this
Low energy properties of the random displacement model
Jeff Baker; Michael Loss; Günter Stolz
2008-08-05T23:59:59.000Z
We study low-energy properties of the random displacement model, a random Schr\\"odinger operator describing an electron in a randomly deformed lattice. All periodic displacement configurations which minimize the bottom of the spectrum are characterized. While this configuration is essentially unique for dimension greater than one, there are infinitely many different minimizing configurations in the one-dimensional case. The latter leads to unusual low energy asymptotics for the integrated density of states of the one-dimensional random displacement model. For symmetric Bernoulli-distributed displacements it has a $1/\\log^2$-singularity at the bottom of the spectrum. In particular, it is not H\\"older-continuous.
Random Symmetry Breaking and Freezing in Chaotic Networks
Y. Peleg; W. Kinzel; I. Kanter
2012-04-02T23:59:59.000Z
Parameter space of a driven damped oscillator in a double well potential presents either a chaotic trajectory with sign oscillating amplitude or a non-chaotic trajectory with a fixed sign amplitude. A network of such delay coupled damped oscillators is shown to present chaotic dynamics while the amplitude sign of each damped oscillator is randomly frozen. This phenomenon of random broken global symmetry of the network simultaneously with random freezing of each degree of freedom is accompanied by the existence of exponentially many randomly frozen chaotic attractors with the ize of the network. Results are exemplified by a network of modified Duffing oscillators with infinite ange pseudo-inverse delayed interactions.
18.440 Probability and Random Variables, Spring 2011
Sheffield, Scott
This course introduces students to probability and random variables. Topics include distribution functions, binomial, geometric, hypergeometric, and Poisson distributions. The other topics covered are uniform, exponential, ...
Limited Dependent Variable Correlated Random Coefficient Panel Data Models
Liang, Zhongwen
2012-10-19T23:59:59.000Z
and random coefficients. It shows that on average the rate of return of job training is 3.16% per 60 hours training....
A survey of rigorous results on random Schroedinger operators for amorphous solids
Hajo Leschke; Peter Müller; Simone Warzel
2003-12-11T23:59:59.000Z
Electronic properties of amorphous or non-crystalline disordered solids are often modelled by one-particle Schroedinger operators with random potentials which are ergodic with respect to the full group of Euclidean translations. We give a short, reasonably self-contained survey of rigorous results on such operators, where we allow for the presence of a constant magnetic field. We compile robust properties of the integrated density of states like its self-averaging, uniqueness and leading high-energy growth. Results on its leading low-energy fall-off, that is, on its Lifshits tail, are then discussed in case of Gaussian and non-negative Poissonian random potentials. In the Gaussian case with a continuous and non-negative covariance function we point out that the integrated density of states is locally Lipschitz continuous and present explicit upper bounds on its derivative, the density of states. Available results on Anderson localization concern the almost-sure pure-point nature of the low-energy spectrum in case of certain Gaussian random potentials for arbitrary space dimension. Moreover, under slightly stronger conditions all absolute spatial moments of an initially localized wave packet in the pure-point spectral subspace remain almost surely finite for all times. In case of one dimension and a Poissonian random potential with repulsive impurities of finite range, it is known that the whole energy spectrum is almost surely only pure point.
Generalized Deam-Edwards Approach to the Statistical Mechanics of Randomly Crosslinked Systems
Xiangjun Xing; Bing-Sui Lu; Fangfu Ye; Paul M. Goldbart
2013-05-03T23:59:59.000Z
We address the statistical mechanics of randomly and permanently crosslinked networks. We develop a theoretical framework (vulcanization theory) which can be used to systematically analyze the correlation between the statistical properties of random networks and their histories of formation. Generalizing the original idea of Deam and Edwards, we consider an instantaneous crosslinking process, where all crosslinkers (modeled as Gaussian springs) are introduced randomly at once in an equilibrium liquid state, referred to as the preparation state. The probability that two functional sites are crosslinked by a spring exponentially decreases with their distance squared. After formally averaging over network connectivity, we obtained an effective theory with all degrees of freedom replicated 1 + n times. Two thermodynamic ensembles, the preparation ensemble and the measurement ensemble, naturally appear in this theory. The former describes the thermodynamic fluctuations in the state of preparation, while the latter describes the thermodynamic fluctuations in the state of measurement. We classify various correlation functions and discuss their physical significances. In particular, the memory correlation functions characterize how the properties of networks depend on their history of formation, and are the hallmark properties of all randomly crosslinked materials. We clarify the essential difference between our approach and that of Deam-Edwards, discuss the saddle-point order parameters and its physical significance. Finally we also discuss the connection between saddle-point approximation of vulcanization theory, and the classical theory of rubber elasticity as well as the neo-classical theory of nematic elastomers.
Randomized Algorithms for Scalable Machine Learning
Kleiner, Ariel Jacob
2012-01-01T23:59:59.000Z
DNA sequencing caught in deluge of data. The New York Times,are faced with a similar deluge of data. For instance,
COMPUTING THE TOP BETTI NUMBERS OF SEMI-ALGEBRAIC SETS DEFINED BY QUADRATIC
Basu, Saugata
COMPUTING THE TOP BETTI NUMBERS OF SEMI-ALGEBRAIC SETS DEFINED BY QUADRATIC INEQUALITIES IN POLYNOMIAL TIME SAUGATA BASU Abstract. For any > 0, we present an algorithm which takes as input a semi-algebraic the top Betti numbers of S, bk-1(S), . . . , bk- (S), in polynomial time. The complexity of the algorithm
Time Management Managing Time and Tasks
Kunkle, Tom
Time Management Managing Time and Tasks What is time management? Time can't be managed Â but you can manage the amount of time you use each day for fun, work, rest, and time spent with others. Why is time management important? You have responsibilities to yourself, to your family and friends, to your
Adsorption of symmetric random copolymer onto symmetric random surface: the annealed case
A. A. Polotsky
2015-06-12T23:59:59.000Z
Adsorption of a symmetric (AB) random copolymer (RC) onto a symmetric (ab) random heterogeneous surface (RS) is studied in the annealed approximation by using a two-dimensional partially directed walk model of the polymer. We show that in the symmetric case, the expected a posteriori compositions of the RC and the RS have correct values (corresponding to their a priori probabilities) and do not change with the temperature, whereas second moments of monomers and sites distributions in the RC and RS change. This indicates that monomers and sites do not interconvert but only rearrange in order to provide better matching between them and, as a result, a stronger adsorption of the RC on the RS. However, any violation of the system symmetry shifts equilibrium towards the major component and/or more favorable contacts and leads to interconversion of monomers and sites.
Flambaum, V.V.; Izrailev, F.M. [School of Physics, University of New South Wales, Sydney 2052 (Australia)] [School of Physics, University of New South Wales, Sydney 2052 (Australia)
1997-01-01T23:59:59.000Z
A method is developed for calculation of single-particle occupation numbers in finite Fermi systems of interacting particles. It is more accurate than the canonical distribution method and gives the Fermi-Dirac distribution in the limit of large number of particles. It is shown that statistical effects of the interaction are absorbed by an increase of the effective temperature. Criteria for quantum chaos and statistical equilibrium are considered. All results are confirmed by numerical experiments in the two-body random interaction model. {copyright} {ital 1997} {ital The American Physical Society}
Response of an unbalanced rotating machine to a stationary normal random excitation
Boyce, Lola
1975-01-01T23:59:59.000Z
(x) ) dx where P(x) is the distribution function and is defined as the probability that the random variable is less then or equal to a number, x. The probability density function also has the property, P(x) = f p(y) dy. First Order Probability... functions whose distribution is a first order probability density function, p(x), is des- cribed by E[f (x) ] = f f (x)p(x) dx (A-33) where E[f(x)] is known as the mathematical expectation of p(x) . When a second order probability density function...
MAVIDOS Maternal Vitamin D Osteoporosis Study: study protocol for a randomized controlled trial.
Harvey, Nicholas C.; Javaid, Kassim; Bishop, Nicholas; Kennedy, Stephen; Papageorghiou, Aris T.; Fraser, Robert; Gandhi, Saurabh V.; Schoenmakers, Inez; Prentice, Ann; Cooper, Cyrus
2012-02-07T23:59:59.000Z
is measured. Randomization and issue of Investigational Medicinal Product (IMP) The IMP and matched placebo are manufactured by Bil- care GCS (Europe) Ltd, Waller House, Elvicta Business Park, Crickhowell, Powys NP8 1DF, UK. The manufac- turers had no role... /placebo) is supplied to the local pharmacy pre-randomised by the manufacturer (1:1, unstratified by centre) and sequentially numbered for storage and dispensing. Code break envelopes are supplied to the lead pharmacist, but are not available to the investigative team...
Time parallel gravitational collapse simulation
Kreienbuehl, Andreas; Ruprecht, Daniel; Krause, Rolf
2015-01-01T23:59:59.000Z
This article demonstrates the applicability of the parallel-in-time method Parareal to the numerical solution of the Einstein gravity equations for the spherical collapse of a massless scalar field. To account for the shrinking of the spatial domain in time, a tailored load balancing scheme is proposed and compared to load balancing based on number of time steps alone. The performance of Parareal is studied for both the sub-critical and black hole case; our experiments show that Parareal generates substantial speedup and, in the super-critical regime, can also reproduce the black hole mass scaling law.
Prime number generation and factor elimination
Vineet Kumar
2014-10-06T23:59:59.000Z
We have presented a multivariate polynomial function termed as factor elimination function,by which, we can generate prime numbers. This function's mapping behavior can explain the irregularities in the occurrence of prime numbers on the number line. Generally the different categories of prime numbers found till date, satisfy the form of this function. We present some absolute and probabilistic conditions for the primality of the number generated by this method. This function is capable of leading to highly efficient algorithms for generating prime numbers.
Sharp asymptotics for the partition function of some continuous-time directed polymers
Viens, Frederi G.
Sharp asymptotics for the partition function of some continuous-time directed polymers Agnese Cadel This paper is concerned with two related types of directed polymers in a random medium. The rst one is a d regime of the objects under consideration. Key words and phrases: Polymer model, Random medium, Gaussian
Sharp asymptotics for the partition function of some continuous-time directed polymers
Tindel, Samy - Institut de Mathématiques Élie Cartan, Université Henri Poincaré
Sharp asymptotics for the partition function of some continuous-time directed polymers Agnese Cadel This paper is concerned with two related types of directed polymers in a random medium. The first one is a d under consideration. Key words and phrases: Polymer model, Random medium, Gaussian field, Free energy
Random polynomial-time attacks and Dolev-Yao models Mathieu Baudet
Doyen, Laurent
that under sufficient realistic assump- tions the extended models are equivalent to standard Dolev-Yao models by the the RNTL projects EVA and ProuvÂ´e, the ACI SÂ´ecuritÂ´e Informatique Rossignol, the ACI Cryptologie Psi-Robuste, and the ACI jeunes chercheurs "SÂ´ecuritÂ´e informatique, protocoles cryptographiques et dÂ´etection d
TIME REVERSAL FOR WAVES IN RANDOM MEDIA GUILLAUME BAL AND LEONID RYZHIK y
Bal, Guillaume
medium have found important applications in medicine, non-destructive testing, underwater acoustics. The interference of multiple paths will thus be constructive at the source location and destructive anywhere else
TIME REVERSAL AND REFOCUSING IN RANDOM MEDIA GUILLAUME BAL AND LEONID RYZHIK y
Ryzhik, Lenya
medium have found important applications in medicine, non-destructive testing, underwater acoustics. The interference of multiple paths will thus be constructive at the source location and destructive anywhere else
Spin transitions in time-dependent regular and random magnetic fields
Pokrovsky, Valery L.; Sinitsyn, NA.
2004-01-01T23:59:59.000Z
-Zener solution a5exp~2pg2!, b52 A2p expS2 pg22 1 ip4 D gG~2ig2! . ~7! When g varies from 0 to ` , the modulus uau changes from 1 to 0 and the argument of the Jacobi polynomial in Eq. ~6! 2 2 2u A !a !b 2 . 6 ua 2 g , g . . . g the Bloch tensors... gz . ~25! Solving equation for g6 , we find g6~ t !5g6~2`!expS7ib? zt22 7iE 2` t hz~ t8!dt8D ~26! 1~ i/A2 !E 2` t expF7ib? z~ t22t82!2 7iE t8 t hz~ t9!dt9Gh6~ t8!gz~ t8!dt8. ~27! Let us first consider the case of complete initial...
Geiger, S.
2012-01-01T23:59:59.000Z
behavior of naturally fractured reservoirs. SPE Journal, R.the Bristol Channel fractured reservoir analogue (a), ?uidfor naturally fractured reservoirs. These simulations are
Continuous time random walk analysis of solute transport in fractured porous media
Cortis, Andrea
2008-01-01T23:59:59.000Z
using breakthrough curves (BTC, see Figure 4) obtained atthe matrix pore system. The dashed BTC indicates the localmodel domain, L=50 m. The four BTC locations shown in Figure
Geiger, S.
2012-01-01T23:59:59.000Z
a backwards prediction for the BTC at ? = 0.25 (red solidCalibration of the ?(t) on the BTC at ? = 0.25 (not shown)to calibrate the ?(t) on a BTC at ? = 0.1. For other less
Partition Testing versus Random Testing: the Influence of Uncertainty
Gutjahr, Walter
Partition Testing versus Random Testing: the Influence of Uncertainty Walter J. Gutjahr Department of Statistics, O.R. and Computer Science University of Vienna Abstract --- The paper compares partition testing and random testing on the assumption that program failure rates are not known with certainty before testing
Random subgroups of Thompson's group F Sean Cleary
Rechnitzer, Andrew
Random subgroups of Thompson's group F Sean Cleary Department of Mathematics, The City College Classification: 05A05, 20F65. Keywords: Richard Thompson's group F, asymptotic density, subgroup spectrum-finite generating function, non-algebraic generating function Abstract We consider random subgroups of Thompson
LONG WAVE EXPANSIONS FOR WATER WAVES OVER RANDOM TOPOGRAPHY
LONG WAVE EXPANSIONS FOR WATER WAVES OVER RANDOM TOPOGRAPHY ANNE DE BOUARD 1 , WALTER CRAIG 2 with the ran dom bottom. We show that the resulting influence of the random topography is expressed in terms of bottom topography a#ects the equations describing the limit of solutions in the long wave regime. We
GENERATION AND RANDOM GENERATION: FROM SIMPLE GROUPS TO MAXIMAL SUBGROUPS
Burness, Tim
GENERATION AND RANDOM GENERATION: FROM SIMPLE GROUPS TO MAXIMAL SUBGROUPS TIMOTHY C. BURNESS of generators for G. It is well known that d(G) = 2 for all (non-abelian) finite simple groups. We prove that d investigate the random generation of maximal subgroups of simple and almost simple groups. By applying
FAST COMPRESSIVE SAMPLING WITH STRUCTURALLY RANDOM MATRICES Thong T. Do
FAST COMPRESSIVE SAMPLING WITH STRUCTURALLY RANDOM MATRICES Thong T. Do , Trac D. Tran and Lu Gan of fast and efficient com- pressive sampling based on the new concept of structurally random matrices low complexity and fast computation based on block processing and linear filtering. (iv
Choosing a Random Peer in Chord Valerie King
Saia, Jared
sampling is a fundamental statistical operation; a function which chooses a random peer can be used). Our motivation for studying this problem is threefold: to enable data collection by statistically rig-to-peer networks; and to support the creation and maintenance of random links, and thereby offer a simple means
k-Connectivity in Random Key Graphs with Unreliable Links
Yagan, Osman
of Eschenauer and Gligor for securing wireless sensor network (WSN) communications. Random key graphs have real-world networks; e.g., with secure WSN application in mind, link unreliability can be attributed for securing WSN communications is the random predistribution of cryptographic keys to sensor nodes
Trading Structure for Randomness in Wireless Opportunistic Szymon Chachulski
for Randomness in Wireless Opportunistic Routing by Szymon Chachulski Submitted to the Department of ElectricalTrading Structure for Randomness in Wireless Opportunistic Routing by Szymon Chachulski mgr inz., Warsaw University of Technology (2005) Submitted to the Department of Electrical Engineering and Computer
Energy Scaling Laws for Distributed Inference in Random Fusion Networks
Yukich, Joseph E.
1 Energy Scaling Laws for Distributed Inference in Random Fusion Networks Animashree Anandkumar Abstract--The energy scaling laws of multihop data fusion networks for distributed inference are considered. The fusion network consists of randomly located sensors distributed i.i.d. according to a general spatial
An Efficient Method for Random Delay Generation in Embedded Software
International Association for Cryptologic Research (IACR)
An Efficient Method for Random Delay Generation in Embedded Software Jean-SÂ´ebastien Coron and Ilya Process Interrupts (rpi) as well as in software by placing "dummy" cy- cles at some points of the program. We give preliminary information on software random delays in Sect. 2. Related work. First detailed
Forest fires, explosions, and random trees Edward Crane
Wirosoetisno, Djoko
Forest fires, explosions, and random trees Edward Crane HIMR, UoB 13th January 2014 #12 and James Martin at the University of Oxford. Edward Crane (HIMR, UoB) Forest fires, explosions, and random trees 13th January 2014 2 / 20 #12;Overview This talk is about the mean field forest fire model
Probability Distribution of Curvatures of Isosurfaces in Gaussian Random Fields
Paulo R. S. Mendonca; Rahul Bhotika; James V. Miller
2007-05-15T23:59:59.000Z
An expression for the joint probability distribution of the principal curvatures at an arbitrary point in the ensemble of isosurfaces defined on isotropic Gaussian random fields on Rn is derived. The result is obtained by deriving symmetry properties of the ensemble of second derivative matrices of isotropic Gaussian random fields akin to those of the Gaussian orthogonal ensemble.
Applications of Large Random Matrices in Communications Engineering
MĂĽller, Ralf R.
, sooner or later, a hopeÂ less task at first sight. In a combustion engine, many molecules of fuel and air1 Applications of Large Random Matrices in Communications Engineering Ralf R. MË?uller Abstract engineering. Asymptotic eigenvalue distributions of many classes of random matrices are given. The treatment
Applications of Large Random Matrices in Communications Engineering
MĂĽller, Ralf R.
, sooner or later, a hope- less task at first sight. In a combustion engine, many molecules of fuel and air1 Applications of Large Random Matrices in Communications Engineering Ralf R. MÂ¨uller Abstract engineering. Asymptotic eigenvalue distributions of many classes of random matrices are given. The treatment
Critical behavior in inhomogeneous random graphs Remco van der Hofstad
Hofstad, Remco van der
Critical behavior in inhomogeneous random graphs Remco van der Hofstad June 10, 2010 Abstract We study the critical behavior of inhomogeneous random graphs where edges are present independently but with unequal edge occupation probabilities. The edge probabilities are moderated by vertex weights
Wavelet Estimation For Samples With Random Uniform Design
Brown, Lawrence D.
Wavelet Estimation For Samples With Random Uniform Design T. Tony Cai Department of Statistics that for nonparametric regression if the samples have random uniform design, the wavelet method with universal. Simulation result is also discussed. Keywords: wavelets, nonparametric regression, minimax, adaptivity
Explanation of the Random Lengths Framing Lumber Composite Price
Explanation of the Random Lengths Framing Lumber Composite Price May 10, 2006 The Random Lengths Framing Lumber Composite is a broad measure of price behavior in the U.S. framing lumber market prices, 33% comes from Western U.S. prices, and 34% comes from Canadian prices. The Composite does
Continuum Cascade Model: Branching Random Walk for Traveling Wave
Yoshiaki Itoh
2015-07-15T23:59:59.000Z
The food web is a directed graph in which nodes label species and directed links represent the predation between species. Cascade models generate random food webs. The recursion to obtain the probability distribution of the longest chain length has the solution with traveling wave. We consider a branching random walk to study the asymptotic probability on the wave front.
Quinn, H; /SLAC
2009-01-27T23:59:59.000Z
This talk briefly reviews three types of time-asymmetry in physics, which I classify as universal, macroscopic and microscopic. Most of the talk is focused on the latter, namely the violation of T-reversal invariance in particle physics theories. In sum tests of microscopic T-invariance, or observations of its violation, are limited by the fact that, while we can measure many processes, only in very few cases can we construct a matched pair of process and inverse process and observe it with sufficient sensitivity to make a test. In both the cases discussed here we can achieve an observable T violation making use of flavor tagging, and in the second case also using the quantum properties of an antisymmetric coherent state of two B mesons to construct a CP-tag. Both these tagging properties depend only on very general properties of the flavor and/or CP quantum numbers and so provide model independent tests for T-invariance violations. The microscopic laws of physics are very close to T-symmetric. There are small effects that give CP- and T-violating processes in three-generation-probing weak decays. Where a T-violating observable can be constructed we see the relationships between T-violation and CP-violation expected in a CPT conserving theory. These microscopic effects are unrelated to the 'arrow of time' that is defined by increasing entropy, or in the time direction defined by the expansion of our Universe.
Stochastic modeling of random roughness in shock scattering problems: theory and simulations
Lin, Guang; Su, Chau-Hsing; Karniadakis, George E.
2008-08-01T23:59:59.000Z
Random rougness is omnipresent in engineering applications and may often affect performance in unexpected way. Here, we employ synergistically stochastic simulations and second-order stochastic perturbation analysis to study supersonic flow past a wedge with random rough surface. The roughness (of length $d$) starting at the wedge apex is modeled as stochastic process (with zero mean and correlation length $A$) obtained from a new stochastic differential equation. A multi-element probabilistic collocation method (ME-PCM) based on {\\em sparse grids} is employed to solve the stochastic Euler equations while a WENO scheme is used to discretize the equations in two spatial dimensions. The perturbation analysis is used to verify the stochastic simulations and to provide insight for small values of $A$, where stochastic simulations become prohibitively expensive. % We show that the random roughness enhances the lift and drag forces on the wedge beyond the rough region, and this enhancement is proportional to $(d/A)^2$. The effects become more pronounced as the Mach number increases. These results can be used in designing smart rough skins for airfoils for maxiumum lift enhancement at a minimum drag penalty.
Type Systems For Polynomial-time Computation
Hofmann, Martin
This thesis introduces and studies a typed lambda calculus with higher-order primitive recursion over inductive datatypes which has the property that all definable number-theoretic functions are polynomial time computable. ...
Time correlation of cosmic-ray-induced neutrons and gamma rays at sea level
Harilal, S. S.
Time correlation of cosmic-ray-induced neutrons and gamma rays at sea level G. Miloshevsky n , A and evaporation processes of air nuclei are time-correlated. The occurrence of their counts in a fixed time interval is not a random (Poisson) distribution, but rather time-correlated bursts of counts
Collisions of particles advected in random flows
K. Gustavsson; B. Mehlig; M. Wilkinson
2008-01-18T23:59:59.000Z
We consider collisions of particles advected in a fluid. As already pointed out by Smoluchowski [Z. f. physik. Chemie XCII, 129-168, (1917)], macroscopic motion of the fluid can significantly enhance the frequency of collisions between the suspended particles. This effect was invoked by Saffman and Turner [J. Fluid Mech. 1, 16-30, (1956)] to estimate collision rates of small water droplets in turbulent rain clouds, the macroscopic motion being caused by turbulence. Here we show that the Saffman-Turner theory is unsatisfactory because it describes an initial transient only. The reason for this failure is that the local flow in the vicinity of a particle is treated as if it were a steady hyperbolic flow, whereas in reality it must fluctuate. We derive exact expressions for the steady-state collision rate for particles suspended in rapidly fluctuating random flows and compute how this steady state is approached. For incompressible flows, the Saffman-Turner expression is an upper bound.
Smectic Liquid Crystals in Random Environments
Leo Radzihovsky; John Toner
1999-06-04T23:59:59.000Z
We study smectic liquid crystals in random environments, e.g., aerogel. A low temperature analysis reveals that even arbitrarily weak quenched disorder (i.e., arbitrarily low aerogel density) destroys translational (smectic) order. A harmonic approximation to the elastic energy suggests that there is no ``smectic Bragg glass'' phase in this system: even at zero temperature, it is riddled with dislocation loops induced by the quenched disorder. This result implies the destruction of orientational (nematic) order as well, and that the thermodynamically sharp Nematic-Smectic-A transition is destroyed by disorder, in agreement with recent experimental results. We also show that the anharmonic elastic terms neglected in the above treatment are important (i.e., are ``relevant'' in the renormalization group sense); whether they alter the above conclusions about the smectic Bragg glass, orientational disorder, and the existence of sharp transitions, remains an open question. However, they do not alter our conclusion that translational (smectic) order is always destroyed. In contrast, we expect that weak annealed disorder should have no qualitative effects on the smectic order.
Equilibrium ultrastable glasses produced by random pinning
Glen M Hocky; Ludovic Berthier; David R. Reichman
2014-12-08T23:59:59.000Z
Ultrastable glasses have risen to prominence due to their potentially useful material properties and the tantalizing possibility of a general method of preparation via vapor deposition. Despite the importance of this novel class of amorphous materials, numerical studies have been scarce because achieving ultrastability in atomistic simulations is an enormous challenge. Here we bypass this difficulty and establish that randomly pinning the position of a small fraction of particles inside an equilibrated supercooled liquid generates ultrastable configurations at essentially no numerical cost, while avoiding undesired structural changes due to the preparation protocol. Building on the analogy with vapor-deposited ultrastable glasses, we study the melting kinetics of these configurations following a sudden temperature jump into the liquid phase. In homogeneous geometries, we find that enhanced kinetic stability is accompanied by large scale dynamic heterogeneity, while a competition between homogeneous and heterogeneous melting is observed when a liquid boundary invades the glass at constant velocity. Our work demonstrates the feasibility of large-scale, atomistically resolved, and experimentally relevant simulations of the kinetics of ultrastable glasses.
Nonlinear Lattice Waves in Random Potentials
Sergej Flach
2014-09-10T23:59:59.000Z
Localization of waves by disorder is a fundamental physical problem encompassing a diverse spectrum of theoretical, experimental and numerical studies in the context of metal-insulator transition, quantum Hall effect, light propagation in photonic crystals, and dynamics of ultra-cold atoms in optical arrays. Large intensity light can induce nonlinear response, ultracold atomic gases can be tuned into an interacting regime, which leads again to nonlinear wave equations on a mean field level. The interplay between disorder and nonlinearity, their localizing and delocalizing effects is currently an intriguing and challenging issue in the field. We will discuss recent advances in the dynamics of nonlinear lattice waves in random potentials. In the absence of nonlinear terms in the wave equations, Anderson localization is leading to a halt of wave packet spreading. Nonlinearity couples localized eigenstates and, potentially, enables spreading and destruction of Anderson localization due to nonintegrability, chaos and decoherence. The spreading process is characterized by universal subdiffusive laws due to nonlinear diffusion. We review extensive computational studies for one- and two-dimensional systems with tunable nonlinearity power. We also briefly discuss extensions to other cases where the linear wave equation features localization: Aubry-Andre localization with quasiperiodic potentials, Wannier-Stark localization with dc fields, and dynamical localization in momentum space with kicked rotors.
Comment "On the statistics of the product of a Gaussian process and a pseudo random binary code"
Painter, John H.; Jacobs, I.
1966-01-01T23:59:59.000Z
908 PROCEEDINGS OF THE IEEE JUNE Comment "On the Statistics of the Product of a Gaussian Process and a Pseudo Random Binary Code" In a recent correspondence, Painter' shows that the first-order statistics of the product of a Gaussian noise... functions C(t) contain an infinite number of jump discontinuities; hence, almost all sample functions of Z(t) contain jump discontinuities. However, for a stationary Gaussian process, Manuscript received March 2.1966. 1 J. H. Painter. Proc. IEEE...
Random matrices and chaos in nuclear physics: Nuclear structure
Weidenmueller, H. A.; Mitchell, G. E. [Max-Planck-Institut fuer Kernphysik, D-69029 Heidelberg (Germany); North Carolina State University, Raleigh, North Carolina 27695 (United States) and Triangle Universities Nuclear Laboratory, Durham, North Carolina 27706 (United States)
2009-04-15T23:59:59.000Z
Evidence for the applicability of random-matrix theory to nuclear spectra is reviewed. In analogy to systems with few degrees of freedom, one speaks of chaos (more accurately, quantum chaos) in nuclei whenever random-matrix predictions are fulfilled. An introduction into the basic concepts of random-matrix theory is followed by a survey over the extant experimental information on spectral fluctuations, including a discussion of the violation of a symmetry or invariance property. Chaos in nuclear models is discussed for the spherical shell model, for the deformed shell model, and for the interacting boson model. Evidence for chaos also comes from random-matrix ensembles patterned after the shell model such as the embedded two-body ensemble, the two-body random ensemble, and the constrained ensembles. All this evidence points to the fact that chaos is a generic property of nuclear spectra, except for the ground-state regions of strongly deformed nuclei.
Randomized Algorithms and Lower Bounds for Quantum Simulation
Chi Zhang
2009-10-21T23:59:59.000Z
We consider deterministic and {\\em randomized} quantum algorithms simulating $e^{-iHt}$ by a product of unitary operators $e^{-iA_jt_j}$, $j=1,...,N$, where $A_j\\in\\{H_1,...,H_m\\}$, $H=\\sum_{i=1}^m H_i$ and $t_j > 0$ for every $j$. Randomized algorithms are algorithms approximating the final state of the system by a mixed quantum state. First, we provide a scheme to bound the trace distance of the final quantum states of randomized algorithms. Then, we show some randomized algorithms, which have the same efficiency as certain deterministic algorithms, but are less complicated than their opponentes. Moreover, we prove that both deterministic and randomized algorithms simulating $e^{-iHt}$ with error $\\e$ at least have $\\Omega(t^{3/2}\\e^{-1/2})$ exponentials.
Could Planck level physics be driving classical macroscopic physics through a random walk?
C. L. Herzenberg
2011-11-28T23:59:59.000Z
We examine a very simple conceptual model of stochastic behavior based on a random walk process in velocity space. For objects engaged in classical non-relativistic velocities, this leads under asymmetric conditions to acceleration processes that resemble the behavior of objects subject to Newton's second law, and in three dimensional space, acceleration dependent on an inverse square law emerges. Thus, a non-relativistic random walk would appear to be capable of describing certain prominent features of classical physics; however, this classical behavior appears to be able to take place only for objects with mass exceeding a threshold value which we identify with the Planck mass. Under these circumstances, stochastic space-time displacements would be smaller than the Planck length and the Planck time so that such classically behaved objects would be effectively localized. Lower mass objects exhibit more rapid diffusion and less localization, and a relativistic random walk would seem to be required of objects having masses comparable to and smaller than the threshold mass value. Results suggest the possibility of an intrinsic quantum-classical transition in the microgram mass range.
KIAS SEOUL, February 2004 Transcendental Number Theory
Waldschmidt, Michel
) Â Introductio in Analysin Infinitorum. Suggests the transcendence of log 1/ log 2 when this number is irrational in Analysin Infinitorum. Suggests the transcendence of log 1/ log 2 when this number is irrational (for this number is irrational (for algebraic 1 and 2). http://www.math.jussieu.fr/miw/ 14 #12;Euler (1748
Company number 5857955 Wellcome Trust Finance plc
Rambaut, Andrew
Company number 5857955 Wellcome Trust Finance plc Annual Report and Financial Statements Year ended 30 September 2014 #12;Company number 5857955 Wellcome Trust Finance plc Contents Page Strategic number 58579551 Wellcome Trust Finance plc Strategic Report For the year ended 30 September 2014
Clar number of catacondensed benzenoid hydrocarbons
Klavzar, Sandi
Clar number of catacondensed benzenoid hydrocarbons Sandi KlavĹ¸zar a,# , Petra Ĺ¸ Zigert a , Ivan hydrocarbon: CL is equal to the minimum number of straight lines required to intersect all hexagons theory; Clar formula; Clar number; Resonance graph; Benzenoid hydrocarbons 1. Introduction Within
How many eigenvalues of a Gaussian random matrix are positive?
Majumdar, Satya N.; Nadal, Celine [Laboratoire de Physique Theorique et Modeles Statistiques (UMR 8626 du CNRS), Universite Paris-Sud, Batiment 100, 91405 Orsay Cedex (France); Scardicchio, Antonello [Abdus Salam International Centre for Theoretical Physics, Strada Costiera 11, 34151 Trieste (Italy); INFN, Sezione di Trieste, Strada Costiera 11, 34151 Trieste (Italy); Vivo, Pierpaolo [Abdus Salam International Centre for Theoretical Physics, Strada Costiera 11, 34151 Trieste (Italy)
2011-04-15T23:59:59.000Z
We study the probability distribution of the index N{sub +}, i.e., the number of positive eigenvalues of an NxN Gaussian random matrix. We show analytically that, for large N and large N{sub +} with the fraction 0{<=}c=N{sub +}/N{<=}1 of positive eigenvalues fixed, the index distribution P(N{sub +}=cN,N){approx}exp[-{beta}N{sup 2}{Phi}(c)] where {beta} is the Dyson index characterizing the Gaussian ensemble. The associated large deviation rate function {Phi}(c) is computed explicitly for all 0{<=}c{<=}1. It is independent of {beta} and displays a quadratic form modulated by a logarithmic singularity around c=1/2. As a consequence, the distribution of the index has a Gaussian form near the peak, but with a variance {Delta}(N) of index fluctuations growing as {Delta}(N){approx}lnN/{beta}{pi}{sup 2} for large N. For {beta}=2, this result is independently confirmed against an exact finite-N formula, yielding {Delta}(N)=lnN/2{pi}{sup 2}+C+O(N{sup -1}) for large N, where the constant C for even N has the nontrivial value C=({gamma}+1+3ln2)/2{pi}{sup 2}{approx_equal}0.185 248... and {gamma}=0.5772... is the Euler constant. We also determine for large N the probability that the interval [{zeta}{sub 1},{zeta}{sub 2}] is free of eigenvalues. Some of these results have been announced in a recent letter [Phys. Rev. Lett. 103, 220603 (2009)].
Analyzing Cascading Failures in Smart Grids under Random and Targeted Attacks
Ruj, Sushmita
2015-01-01T23:59:59.000Z
We model smart grids as complex interdependent networks, and study targeted attacks on smart grids for the first time. A smart grid consists of two networks: the power network and the communication network, interconnected by edges. Occurrence of failures (attacks) in one network triggers failures in the other network, and propagates in cascades across the networks. Such cascading failures can result in disintegration of either (or both) of the networks. Earlier works considered only random failures. In practical situations, an attacker is more likely to compromise nodes selectively. We study cascading failures in smart grids, where an attacker selectively compromises the nodes with probabilities proportional to their degrees; high degree nodes are compromised with higher probability. We mathematically analyze the sizes of the giant components of the networks under targeted attacks, and compare the results with the corresponding sizes under random attacks. We show that networks disintegrate faster for targeted...
Random walk hierarchy measure: What is more hierarchical, a chain, a tree or a star?
Czégel, Dániel
2015-01-01T23:59:59.000Z
Signs of hierarchy are prevalent in a wide range of systems in nature and society. One of the key problems is quantifying the importance of hierarchical organisation in the structure of the network representing the interactions or connections between the fundamental units of the studied system. Although a number of notable methods are already available, their vast majority is treating all directed acyclic graphs as already maximally hierarchical. Here we propose a hierarchy measure based on random walks on the network. The novelty of our approach is that directed trees corresponding to multi level pyramidal structures obtain higher hierarchy scores compared to directed chains and directed stars. Furthermore, in the thermodynamic limit the hierarchy measure of regular trees is converging to a well defined limit depending only on the branching number. When applied to real networks, our method is computationally very effective, as the result can be evaluated with arbitrary precision by subsequent multiplications...
Top eigenvalue of a random matrix: A tale of Satya N. Majumdar
Udgaonkar, Jayant B.
Top eigenvalue of a random matrix: A tale of tails Satya N. Majumdar Laboratoire de Physique Th, 2012 S.N. Majumdar Top eigenvalue of a random matrix: A tale of tails #12;First Appearence of Random Matrices S.N. Majumdar Top eigenvalue of a random matrix: A tale of tails #12;First Appearence of Random
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
UGE Scheduler Cycle Time UGE Scheduler Cycle Time Genepool Cycle Time Genepool Daily Genepool Weekly Phoebe Cycle Time Phoebe Daily Phoebe Weekly What is the Scheduler Cycle? The...
Tip sheet: Expanded Library of Congress Call Number Classification system Call Number Subject Matter
Kambhampati, Patanjali
Tip sheet: Expanded Library of Congress Call Number Classification system Call Number Subject R: Medicine T: Technology U: Military Science Z: Bibliography. Library Science. Information
Clinical Trials 2009; 6: 320328ARTICLE Nonparametric estimator of relative time with
Cole, Stephen R.
Clinical Trials 2009; 6: 320328ARTICLE Nonparametric estimator of relative time with application) with a history of ocular herpes simplex virus (HSV) were enrolled in 19921996, randomized to acyclovir
Lu, Zhiming
March 2012; published 22 May 2012. [1] Simulated contaminant breakthrough curves (BTC) are often used directly. In this study, we consider each BTC as a random curve, and use time-warping techniques to align
Non-equilibrium transition from dissipative quantum walk to classical random walk
Marco Nizama; Manuel O. Cáceres
2012-06-26T23:59:59.000Z
We have investigated the time-evolution of a free particle in interaction with a phonon thermal bath, using the tight-binding approach. A dissipative quantum walk can be defined and many important non-equilibrium decoherence properties can be investigated analytically. The non-equilibrium statistics of a pure initial state have been studied. Our theoretical results indicate that the evolving wave-packet shows the suppression of Anderson's boundaries (ballistic peaks) by the presence of dissipation. Many important relaxation properties can be studied quantitatively, such as von Neumann's entropy and quantum purity. In addition, we have studied Wigner's function. The time-dependent behavior of the quantum entanglement between a free particle -in the lattice- and the phonon bath has been characterized analytically. This result strongly suggests the non-trivial time-dependence of the off-diagonal elements of the reduced density matrix of the system. We have established a connection between the quantum decoherence and the dissipative parameter arising from interaction with the phonon bath. The time-dependent behavior of quantum correlations has also been pointed out, showing continuous transition from quantum random walk to classical random walk, when dissipation increases.
Wetting on Random Roughness: the Ubiquity of Wenzel Prewetting
Stephan Herminghaus
2012-03-23T23:59:59.000Z
The wetting properties of solid substrates with macroscopic random roughness are considered as a function of the microscopic contact angle of the wetting liquid and its partial pressure in the surrounding gas phase. It is shown that Wenzel prewetting, which has been recently predicted for a rather wide class of roughness pro?les derived from Gaussian random processes by a general distortion procedure, should in fact be ubiquitous and prevail under even much milder conditions. The well-known transition occurring at Wenzel's angle is accompanied by a prewetting transition, at which a jump in the adsorbed liquid volume occurs. This should be present on most surfaces bearing homogeneous, isotropic random roughness.
Handbook Article on Applications of Random Matrix Theory to QCD
J. J. M. Verbaarschot
2009-10-21T23:59:59.000Z
In this chapter of the Oxford Handbook of Random Matrix Theory we introduce chiral Random Matrix Theories with the global symmetries of QCD. In the microscopic domain, these theories reproduce the mass and chemical potential dependence of QCD. The main focus of this chapter is on the spectral properties of the QCD Dirac operator and relations between chiral Random Matrix Theories and chiral Lagrangians. Both spectra of the anti-hermitian Dirac operator and spectra of the nonhermitian Dirac operator at nonzero chemical potential are discussed.
Random free fermions: An analytical example of eigenstate thermalization
Magan, Javier M
2015-01-01T23:59:59.000Z
Having analytical instances of the Eigenstate Thermalization Hypothesis (ETH) is of obvious interest, both for fundamental and applied reasons. This is generically a hard task, due to the belief that non-linear interactions are basic ingredients of the thermalization mechanism. In this article we proof that random gaussian free fermions satisfy ETH in the multiparticle sector, by analytically computing the correlations and entanglement entropies of the theory. With the explicit construction at hand, we finally comment on the differences between fully random Hamiltonians and random Gaussian systems, and on the connection between chaotic energy spectra and ETH.
Using the QBO to predict the number of hurricanes hitting the U.S
Coughlin, Katie
2007-01-01T23:59:59.000Z
A simple study of the relationship between the QBO and the number of hurricanes in the Atlantic, both in the Basin and hitting the U.S. coastline, demonstrates that the QBO is not a particularly useful index to help predict hurricane numbers on five-year time scales. It is shown that there is very little difference between the number of hurricanes following easterly winds in the equatorial stratosphere and the number that follow westerly winds. Given this it is reasonable one would make better predictions just using the mean number of hurricanes in lieu of using the QBO and this is also simply demonstrated here.
Relativistic theory of tidal Love numbers
Taylor Binnington; Eric Poisson
2009-09-16T23:59:59.000Z
In Newtonian gravitational theory, a tidal Love number relates the mass multipole moment created by tidal forces on a spherical body to the applied tidal field. The Love number is dimensionless, and it encodes information about the body's internal structure. We present a relativistic theory of Love numbers, which applies to compact bodies with strong internal gravities; the theory extends and completes a recent work by Flanagan and Hinderer, which revealed that the tidal Love number of a neutron star can be measured by Earth-based gravitational-wave detectors. We consider a spherical body deformed by an external tidal field, and provide precise and meaningful definitions for electric-type and magnetic-type Love numbers; and these are computed for polytropic equations of state. The theory applies to black holes as well, and we find that the relativistic Love numbers of a nonrotating black hole are all zero.
Texas Rice, Volume IV, Number 9, Winter Issue
2004-01-01T23:59:59.000Z
Civic Center • Cash flow Analysis of Rice Farming • Varietal Performance • Varietal Survey Data for 2004 • Second Crop Management • Disease Management • Registering Water Wells • Farm Policy Outlook • Rice Market Outlook • Weed Management • insect... and then, the hard work of our people comes back in the form of praise and recognition. During this month’s Rice Outlook Conference, I had the pleasure of visiting with some of the rice research and extension leaders from across the U.S. The number of times...
Diffusion in random velocity fields with applications to contaminant transport in groundwater
Suciu, Nicolae
Diffusion in random velocity fields with applications to contaminant transport in groundwater is the mathematical object underlying cur- rently used stochastic models of transport in groundwater. The essential: Groundwater, Transport processes, Ergodicity, Random fields, Random walk, PDF methods 1. Introduction
Predicting landfalling hurricane numbers from basin hurricane numbers: basic statistical analysis
Laepple, T; Penzer, J; Bellone, E; Nzerem, K; Laepple, Thomas; Jewson, Stephen; Penzer, Jeremy; Bellone, Enrica; Nzerem, Kechi
2007-01-01T23:59:59.000Z
One possible method for predicting landfalling hurricane numbers is to first predict the number of hurricanes in the basin and then convert that prediction to a prediction of landfalling hurricane numbers using an estimated proportion. Should this work better than just predicting landfalling hurricane numbers directly? We perform a basic statistical analysis of this question in the context of a simple abstract model.
Limited Dependent Variable Correlated Random Coefficient Panel Data Models
Liang, Zhongwen
2012-10-19T23:59:59.000Z
for the average slopes of a linear CRC model with a general nonparametric correlation between regressors and random coefficients. I construct a sqrt(n) consistent estimator for the average slopes via varying coefficient regression. The identification of binary...
Localization at low energies for attractive Poisson random Schrödinger operators
François Germinet; Peter D. Hislop; Abel Klein
2006-03-13T23:59:59.000Z
We prove exponential and dynamical localization at low energies for the Schr\\"odinger operator with an attractive Poisson random potential in any dimension. We also conclude that the eigenvalues in that spectral region of localization have finite multiplicity.
Robust randomized trajectory planning for satellite attitude tracking control
Barker, Drew R. (Drew Richard), 1981-
2006-01-01T23:59:59.000Z
This thesis presents a novel guidance strategy that uses a randomized trajectory planning algorithm in a closed-loop fashion to provide robust motion planning and execution. By closing the guidance, navigation, and control ...
Taking Stock of Our Situation: Pricing and Randomness
O'Leary, Dianne P.
Taking Stock of Our Situation: Pricing and Randomness Dianne P. O'Leary1 Many fascinating study is a supplement to Scientific Computing with Case Studies, Dianne P. O'Leary, SIAM Press
A fast randomized eigensolver with structured LDL factorization update
2014-07-17T23:59:59.000Z
By com- bining the adaptive randomized compression techniques in [20] with the HSS ... for a matrix A and two index sets I and J, A|I denotes a submatrix of A.
Fundamental Scratch Behavior of Styrene-Acrylonitrile Random Copolymers
Browning, Robert Lee
2011-10-21T23:59:59.000Z
The present study employs a standardized progressive load scratch test (ASTM D7027/ISO 19252) to investigate the fundamental physical and mechanistic origins of scratch deformation in styrene-acrylonitrile (SAN) random copolymers. Previous findings...
Dynamic Optimal Random Access for Vehicle-to-Roadside Communications
Huang, Jianwei
significant momentum in recent years, especially after the Federal Communications Commission (FCCDynamic Optimal Random Access for Vehicle-to-Roadside Communications Man Hon Cheung, Fen Hou access, efficient resource allocation schemes are required to fully utilize the limited communication
Randomized coordinate descent methods for big data optimization
Takac, Martin
2014-07-01T23:59:59.000Z
This thesis consists of 5 chapters. We develop new serial (Chapter 2), parallel (Chapter 3), distributed (Chapter 4) and primal-dual (Chapter 5) stochastic (randomized) coordinate descent methods, analyze their complexity ...
Randomized modulation of power converters via Markov chains
Stankovic, Aleksandar M.
Randomized modulation of switching in power converters holds promise for reducing filtering requirements and reducing acoustic noise in motor drive applications. This paper is devoted to issues in analysis and synthesis ...
Estimation of Random-Coefficient Demand Models: Two Empiricists' Perspective
Metaxoglou, Konstantinos
We document the numerical challenges we experienced estimating random-coefficient demand models as in Berry, Levinsohn, and Pakes (1995) using two well-known data sets and a thorough optimization design. The optimization ...
Wrinkling of Random and Regular Semiflexible Polymer Networks
Pascal Müller; Jan Kierfeld
2014-06-05T23:59:59.000Z
We investigate wrinkling of two-dimensional random and triangular semiflexible polymer networks under shear. Both types of semiflexible networks exhibit wrinkling above a small critical shear angle, which scales with an exponent of the bending modulus between 1.9 and 2.0. Random networks exhibit hysteresis at the wrinkling threshold. Wrinkling lowers the total elastic energy by up to 20% and strongly affects the elastic properties of all semiflexible networks such as the crossover between bending and stretching dominated behavior. In random networks, we also find evidence for metastable wrinkled configurations. While the disordered microstructure of random networks affects the scaling behavior of wrinkle amplitudes, it has little effect on wrinkle wavelength. Therefore, wrinkles represent a robust, microstructure-independent assay of shear strain or elastic properties.
Polymer dynamics in random flow with mean shear K. Turitsyn
Fominov, Yakov
Polymer dynamics in random flow with mean shear K. Turitsyn Landau Institute for theoretical;Outline · Motivation: Elastic turbulence · Experimental setup · Flow and polymer models · Results: 1. Angular statistics 2. Polymer elongation distribution · Conclusion #12;Elastic Turbulence Elastic
Probabilistic Flooding for Efficient Information Dissemination in Random Graph
Stavrakakis, Ioannis
Probabilistic Flooding for Efficient Information Dissemination in Random Graph Topologies 1 & Telecommunications, Athens, Greece Abstract Probabilistic flooding has been frequently considered as a suitable) flooding approaches that are used to disseminate globally information in unstructured peer
On Conformal Field Theory and Number Theory
Huang, An
2011-01-01T23:59:59.000Z
Frontiers in Number Theory, Physics, and Ge- ometry II. (Witten, Quantum Field Theory, Crassmannians, and AlgebraicJ. Polchinski, String Theory, Vol. 1, Cambridge Univ.
Saldin, Dilano
Call Numbers** A, B, C 3rd Floor Southeast . D, E, F, G, H, J, K, L 3rd Floor West . . . . . P 3rd Floor West . Q, R
REFINED BOUNDS ON THE NUMBER OF CONNECTED ...
2011-04-06T23:59:59.000Z
Apr 6, 2011 ... Smith inequality (see Theorem 2.5) a bound on the number of semi- ... then using Smith inequality, have been used before in several different ...
On hitting times and fastest strong stationary times for skip-free chains
Fill, James Allen
2007-01-01T23:59:59.000Z
An (upward) skip-free Markov chain with the set of nonnegative integers as state space is a chain for which upward jumps may be only of unit size; there is no restriction on downward jumps. In a 1987 paper, Brown and Shao determined, for an irreducible continuous-time skip-free chain and any d, the passage time distribution from state 0 to state d. When the nonzero eigenvalues nu_j of the generator are all real, their result states that the passage time is distributed as the sum of d independent exponential random variables with rates nu_j. We give another proof of their theorem. In the case of birth-and-death chains, our proof leads to an explicit representation of the passage time as a sum of independent exponential random variables. Diaconis and Miclo recently obtained the first such representation, but our construction is much simpler. We obtain similar (and new) results for a fastest strong stationary time T of an ergodic continuous-time skip-free chain with stochastically monotone time-reversal started ...
Count-doubling time safety circuit
Rusch, Gordon K. (Downers Grove, IL); Keefe, Donald J. (Lemont, IL); McDowell, William P. (Downers Grove, IL)
1981-01-01T23:59:59.000Z
There is provided a nuclear reactor count-factor-increase time monitoring circuit which includes a pulse-type neutron detector, and means for counting the number of detected pulses during specific time periods. Counts are compared and the comparison is utilized to develop a reactor scram signal, if necessary.
Electron Waiting Times in Mesoscopic Conductors
Mathias Albert; Géraldine Haack; Christian Flindt; Markus Büttiker
2012-02-14T23:59:59.000Z
Electron transport in mesoscopic conductors has traditionally involved investigations of the mean current and the fluctuations of the current. A complementary view on charge transport is provided by the distribution of waiting times between charge carriers, but a proper theoretical framework for coherent electronic systems has so far been lacking. Here we develop a quantum theory of electron waiting times in mesoscopic conductors expressed by a compact determinant formula. We illustrate our methodology by calculating the waiting time distribution for a quantum point contact and find a cross-over from Wigner-Dyson statistics at full transmission to Poisson statistics close to pinch-off. Even when the low-frequency transport is noiseless, the electrons are not equally spaced in time due to their inherent wave nature. We discuss the implications for renewal theory in mesoscopic systems and point out several analogies with energy level statistics and random matrix theory.
Time as a parameter of statistical ensemble
Sergei Viznyuk
2011-11-26T23:59:59.000Z
The notion of time is derived as a parameter of statistical ensemble representing the underlying system. Varying population numbers of microstates in statistical ensemble result in different expectation values corresponding to different times. We show a single parameter which equates to the notion of time is logarithm of the total number of microstates in statistical ensemble. We discuss the implications of proposed model for some topics of modern physics: Poincar\\'e recurrence theorem vs. Second Law of Thermodynamics, matter vs. anti-matter asymmetry of the universe, expansion of the universe, Big Bang.
Deschenes, Olivier; Greenstone, Michael
2007-01-01T23:59:59.000Z
Coefficient,” Monthly Weather Review, 94(7), 461-465. UnitedRandom Fluctuations in Weather Olivier Deschęnes and MichaelRandom Fluctuations in Weather* Olivier Deschęnes University
Deschenes, Olivier; Greenstone, Michael
2004-01-01T23:59:59.000Z
Random Fluctuations in Weather* Olivier Deschenes Universityfor generously generating the weather data. GreenstoneRandom Fluctuations in Weather ABSTRACT This paper measures
Markov, Krassimir; Schinkel, Colleen; Stavreva, Nadia; Stavrev, Pavel; Weldon, Michael; Fallone, B. Gino [Department of Medical Physics, Cross Cancer Institute, 11560 University Avenue, Edmonton, Alberta, T6G1Z2 (Canada); Department of Physics, University of Alberta, and Department of Medical Physics, Cross Cancer Institute, 11560 University Avenue, Edmonton, Alberta, T6G1Z2 (Canada); Department of Medical Physics, Cross Cancer Institute, 11560 University Avenue, Edmonton, Alberta, T6G1Z2 (Canada); Department of Medical Physics, Cross Cancer Institute, 11560 University Avenue, Edmonton, Alberta, T6G1Z2 (Canada); Department of Physics, University of Alberta, and Department of Medical Physics, Cross Cancer Institute, 11560 University Avenue, Edmonton, Alberta, T6G1Z2 (Canada); Departments of Physics and Oncology, University of Alberta, and Department of Medical Physics, Cross Cancer Institute, 11560 University Avenue, Edmonton, Alberta, T6G1Z2 (Canada)
2006-09-15T23:59:59.000Z
A very important issue in contemporary inverse treatment radiotherapy planning is the specification of proper dose-volume constraints limiting the treatment planning algorithm from delivering high doses to the normal tissue surrounding the tumor. Recently we have proposed a method called reverse mapping of normal tissue complication probabilities (NTCP) onto dose-volume histogram (DVH) space, which allows the calculation of appropriate biologically based dose-volume constraints to be used in the inverse treatment planning. The method of reverse mapping requires random sampling from the functional space of all monotonically decreasing functions in the unit square. We develop, in this paper, a random function generator for the purpose of the reverse mapping. Since the proposed generator is based on the theory of random walk, it is therefore designated in this work, as a random walk DVH generator. It is theoretically determined that the distribution of the number of monotonically decreasing functions passing through a point in the dose volume histogram space follows the hypergeometric distribution. The proposed random walk DVH generator thus simulates, in a random fashion, trajectories of monotonically decreasing functions (finite series) that are situated in the unit square [0,1]x[1,0] using the hypergeometric distribution. The DVH generator is an important tool in the study of reverse NTCP mapping for the calculation of biologically based dose-volume constraints for inverse treatment planning.
enter part number BNC / RP-BNC
Berns, Hans-Gerd
enter part number Products 7/16 1.0/2.3 1.6/5.6 AFI AMC BNC / RP-BNC C FAKRA SMB FME HN MCX Mini ------- Product Search ------- Inventory Search Search Results for: 31-10152-RFX Results: 1 - 1 of 1 Part Number. All rights reserved. Copyright | Terms & Conditions | RF E-Mail Client | Contact Us | Amphenol
2001 TRAFFIC ZONE BOUNDARIES Zone Numbers
Toronto, University of
2001 TRAFFIC ZONE BOUNDARIES Zone Numbers & Detailed Definitions #12;2001 TRAFFIC ZONE BOUNDARIES of Toronto Joint Program in Transportation January 2003 #12;PREFACE This report presents the 2001 traffic zone numbers by local municipalities in the 2001 TTS survey area. The second part presents detailed
Experimental Number Theory Part I : Tower Arithmetic
Zeilberger, Doron
Experimental Number Theory Part I : Tower Arithmetic by Edinah K. Gnang January 15, 2011 1 rooted trees, which we shall here refer to as towers. The bijection between numbers and towers provides by XXX = (xk)1kn , (1) a tower expansion ( or simply a tower ) over XXX is a finite product of iterated
Real numbers and other completions Fred Richman
Richman, Fred
Real numbers and other completions Fred Richman Florida Atlantic University Boca Raton, FL 33431 11 March 2007 Abstract A notion of completeness and completion suitable for use in the absence of countable choice is developed. This encompasses the con- struction of the real numbers as well as the completion
Company number 5857955 Wellcome Trust Finance plc
Rambaut, Andrew
Company number 5857955 Wellcome Trust Finance plc Annual Report and Financial Statements Year ended 30 September 2012 #12;Company number 5857955 Wellcome Trust Finance plc Contents Page Directors Trust Finance plc Directors' Report for the year ended 30 September 2012 Report of the Directors
Company number 5857955 Wellcome Trust Finance plc
Rambaut, Andrew
Company number 5857955 Wellcome Trust Finance plc Annual Report and Financial Statements Year ended 30 September 2013 #12;Company number 5857955 Wellcome Trust Finance plc Contents Page Directors Trust Finance plc Directors' Report For the year ended 30 September 2013 Report of the Directors
SOCIAL SECURITY NUMBER AND NAME VERIFICATION
Amin, S. Massoud
SOCIAL SECURITY NUMBER AND NAME VERIFICATION Academic Year 20142015 *FA552-A* Please recycle. DIRECTIONS--You must verify your name and Social Security number for processing of your 20142015 Free Application for Federal Student Aid (FAFSA) to continue. Please attach a legible copy of your Social Security
SOCIAL SECURITY NUMBER AND NAME VERIFICATION
Amin, S. Massoud
SOCIAL SECURITY NUMBER AND NAME VERIFICATION Academic Year 20132014 *FA552-A* Please recycle. DIRECTIONS--You must verify your name and Social Security number for processing of your 20132014 Free Application for Federal Student Aid (FAFSA) to continue. Please attach a legible copy of your Social Security
Search for lepton-family-number nonconservation
Hoffman, C.M.
1986-01-01T23:59:59.000Z
A review of the status of lepton-family-number nonconservation is given. After a brief historical and theoretical discussion, a description of how experimental searches for lepton-family-number nonconservation are performed is presented. Finally, a summary of the results from past experiments and prospects for future experiments is given.
A Thermodynamic Classification of Real Numbers
Thomas Garrity
2009-03-15T23:59:59.000Z
A new classification scheme for real numbers is given, motivated by ideas from statistical mechanics in general and work of Knauf and of Fiala and Kleban in particular. Critical for this classification of a real number will be the Diophantine properties of its continued fraction expansion.
How Synchronisation Strategy Approximation in PEPA Implementations affects Passage Time
Imperial College, London
time densities and dis- tributions from stochastic models defined in PEPA, a stochastic process algebra. In stochastic process algebras, the synchronisation policy is important for defin- ing how different system;good approximation to underlying aggregate complex but deterministic dynamics or genuine random
How Synchronisation Strategy Approximation in PEPA Implementations affects Passage Time
Bradley, Jeremy
passage time densities and dis tributions from stochastic models defined in PEPA, a stochastic process algebra. In stochastic process algebras, the synchronisation policy is important for defin ing how, or a #12; good approximation to underlying aggregate complex but deterministic dynamics or genuine random
Real-time Health Monitoring of Mechanical Structures
Ray, Asok
-sensor-based NDE method requires theoretical formulation and experimental validation: (i) a stochastic damage model machinery under anticipated load profiles. Due to the nonstationary and random nature of fatigue crack development and experimental validation of a real-time health monitoring and nondestructive evaluation (NDE
An objective change-point analysis of historical Atlantic hurricane numbers
Jewson, S; Jewson, Stephen; Penzer, Jeremy
2006-01-01T23:59:59.000Z
We perform an objective change-point analysis on 106 years of historical hurricane number data. The algorithm we use looks at all possible combinations of change-points and compares them in terms of the variances of the differences between real and modelled numbers. Overfitting is avoided by using cross-validation. We identify four change-points, and show that the presence of temporal structure in the hurricane number time series is highly statistically significant.
Enhanced drag of a sphere settling in a stratified fluid at small Reynolds numbers
Stocker, Roman
We present a combined experimental and numerical investigation of a sphere settling in a linearly stratified fluid at small Reynolds numbers. Using time-lapse photography and numerical modelling, we observed and quantified ...
Long wave expansions for water waves over random topography
Anne de Bouard; Walter Craig; Oliver Díaz-Espinosa; Philippe Guyenne; Catherine Sulem
2007-10-01T23:59:59.000Z
In this paper, we study the motion of the free surface of a body of fluid over a variable bottom, in a long wave asymptotic regime. We assume that the bottom of the fluid region can be described by a stationary random process $\\beta(x, \\omega)$ whose variations take place on short length scales and which are decorrelated on the length scale of the long waves. This is a question of homogenization theory in the scaling regime for the Boussinesq and KdV equations. The analysis is performed from the point of view of perturbation theory for Hamiltonian PDEs with a small parameter, in the context of which we perform a careful analysis of the distributional convergence of stationary mixing random processes. We show in particular that the problem does not fully homogenize, and that the random effects are as important as dispersive and nonlinear phenomena in the scaling regime that is studied. Our principal result is the derivation of effective equations for surface water waves in the long wave small amplitude regime, and a consistency analysis of these equations, which are not necessarily Hamiltonian PDEs. In this analysis we compute the effects of random modulation of solutions, and give an explicit expression for the scattered component of the solution due to waves interacting with the random bottom. We show that the resulting influence of the random topography is expressed in terms of a canonical process, which is equivalent to a white noise through Donsker's invariance principle, with one free parameter being the variance of the random process $\\beta$. This work is a reappraisal of the paper by Rosales & Papanicolaou \\cite{RP83} and its extension to general stationary mixing processes.