A note on the generation of Poisson-distributed random numbers with large mean
There are no author-identified significant results in this report.
Terrell, G. R.↗
SEARCH · Engineering Papers
Results for “random number generators”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Optoelectronic analogs of self-programming neural nets - Architecture and methodologies for implementing fast stochastic learning by simulated annealing
Self-organization and learning is a distinctive feature of neural nets and processors that sets them apart from conventional approaches to signal processing. It leads to self-programmability which alleviates the problem of programming complexity in artificial neural nets. In this paper architectures for partitioning an optoelectronic analog of a neural net into distinct layers with prescribed interconnectivity pattern to enable stochastic learning by simulated annealing in the context of a Boltzmann machine are presented. Stochastic learning is of interest because of its relevance to the role of noise in biological neural nets. Practical considerations and methodologies for appreciably accelerating stochastic learning in such a multilayered net are described. These include the use of parallel optical computing of the global energy of the net, the use of fast nonvolatile programmable spatial light modulators to realize fast plasticity, optical generation of random number arrays, and an adaptive noisy thresholding scheme that also makes stochastic learning more biologically plausible. The findings reported predict optoelectronic chips that can be used in the realization of optical learning machines.
Farhat, Nabil H.↗
Simulation of a Wireless Authentication Protocol
Abstract—A wireless authentication protocol that employs timeslots and associated frequency-channels (APEC) is simulated using Python as the simulation environment and implemented into radio hardware as a proof of concept. The APEC protocol does not rely on the use of challenge-response, multifactor authentication schemes but relies instead on the physical properties of a wireless signal. The APEC protocol provides opportunities for real-time deployment in cell phone network infrastructure, as well as in adverse civil and military applications. Description of the APEC implementation and the corresponding results of the simulation study are presented.
42 - ENGINEERING↗
APEC Poster
A wireless authentication protocol that employs timeslots and associated frequency- channels (APEC) is simulated using Python as the simulation environment and implemented into radio hardware as a proof of concept. The APEC protocol does not rely o n the use of challenge -response, multifactor authentication schemes but relies instead on the physical properties of a wireless signal. The APEC protocol provides opportunities for real-time deployment in cell phone network infrastructure, as well as in adverse civil and military applications. Description of the APEC implementation and the corresponding results of the simulation study are presented.
42 - ENGINEERING↗
Statistical Analysis of Fading Power Vectors for Real-Time Atmospheric Channel Emulation
The design and testing of a free-space optical communication system requires assessment of the impact of random fluctuations in received power from a laser beam transmitted over an atmospheric channel. A number of methods for generating fading power vectors for in-lab emulation of an atmospheric channel have previously been reported. These techniques include spectral shaping and filtering of a signal from a normally distributed pseudo-random number generator, full wave optics simulations with random phase screens, and pre-recorded measurements from experimental free-space links. In this work, a statistical analysis of atmospheric fading is presented with the goal of producing a practical engineering model for the fading channel suitable for generating synthetic fade vectors in real-time for long-duration receiver testing with channel interleaving. Specifically, a parametric model is developed for turbulence-induced fade on space-to-ground links with large-aperture receivers, including aperture-averaging and the effects of aperture size on the instantaneous coupling efficiency for mode- limited receivers. In particular, we analyze the probability density function and temporal power spectrum for fluctuations of the coupling efficiency for few-mode fibers in a range of turbulence conditions.
free-space optical communication↗
Statistical Analysis of Fading Power Vectors for Real-Time Atmospheric Channel Emulation
The design and testing of a free-space optical communication system requires assessment of the impact of random fluctuations in received power from a laser beam transmitted over an atmospheric channel. A number of methods for generating fading power vectors for in-lab emulation of an atmospheric channel have previously been reported. These techniques include spectral shaping and filtering of a signal from a normally distributed pseudo-random number generator, full wave optics simulations with random phase screens, and pre-recorded measurements from experimental free-space links. In this work, a statistical analysis of atmospheric fading is presented with the goal of producing a practical engineering model for the fading channel suitable for generating synthetic fade vectors in real-time for long-duration receiver testing with channel interleaving. Specifically, a parametric model is developed for turbulence-induced fade on space-to-ground links with large-aperture receivers, including aperture-averaging and the effects of aperture size on the instantaneous coupling efficiency for mode-limited receivers. In particular, we analyze the probability density function and temporal power spectrum for fluctuations of the coupling efficiency for few-mode fibers in a range of turbulence conditions.
free-space optical communication↗
Efficient many-jet event generation with flow matching
We apply for the first time, to the best of our knowledge, the flow matching method to the problem of phase-space sampling for event generation in high-energy collider physics. By training the model to remap the random numbers used to generate the momenta and helicities of the scattering matrix elements as implemented in the portable partonic event generator pepper, we find substantial efficiency improvements in the studied processes. We focus our study on the highest final-state multiplicities in Drell-Yan and top-antitop pair production used in simulated samples for the Large Hadron Collider, which computationally are the most relevant ones. We find that the unweighting efficiencies improve by factors of 184 and 25, respectively, when compared to the standard approach of using a vegas-based optimization. We also compare continuous normalizing flows trained with flow matching against the previously studied normalizing flows based on coupling layers and find that the former leads to better results, faster training and a better scaling behavior across the studied multiplicity range, while the latter evaluate faster. When combining the advantages of both methods using the regflow approach, we find parton-level unweighted event generation walltime gains of about a factor of 10 at the highest final-state multiplicities.
Bothmann, E. [CERN; Gottingen U.] (ORCID:000000016↗
High-accuracy computation of Delta V magnitude probability densities - Preliminary remarks
This paper describes an algorithm for the high accuracy computation of some statistical quantities of the magnitude of a random trajectory correction maneuver (TCM). The trajectory correction velocity increment Delta V is assumed to be a three-component random vector with each component being a normally distributed random scalar having a possibly nonzero mean. Knowledge of the statitiscal properties of the magnitude of a random TCM is important in the planning and execution of maneuver strategies for deep-space missions such as Galileo. The current algorithm involves the numerical integration of a set of differential equations. This approach allows the computation of density functions for specific Delta V magnitude distributions to high accuracy without first having to generate large numbers of random samples. Possible applications of the algorithm to maneuver planning, planetary quarantine evaluation, and guidance success probability calculations are described.
Chadwick, C.↗
On the Generation and Testing of Uniformly Distributed Pseudo-random Numbers
Explore the source record for details and available documents.
Smith, R. J., III↗
Autonomous Byte Stream Randomizer
Net-centric networking environments are often faced with limited resources and must utilize bandwidth as efficiently as possible. In networking environments that span wide areas, the data transmission has to be efficient without any redundant or exuberant metadata. The Autonomous Byte Stream Randomizer software provides an extra level of security on top of existing data encryption methods. Randomizing the data s byte stream adds an extra layer to existing data protection methods, thus making it harder for an attacker to decrypt protected data. Based on a generated crypto-graphically secure random seed, a random sequence of numbers is used to intelligently and efficiently swap the organization of bytes in data using the unbiased and memory-efficient in-place Fisher-Yates shuffle method. Swapping bytes and reorganizing the crucial structure of the byte data renders the data file unreadable and leaves the data in a deconstructed state. This deconstruction adds an extra level of security requiring the byte stream to be reconstructed with the random seed in order to be readable. Once the data byte stream has been randomized, the software enables the data to be distributed to N nodes in an environment. Each piece of the data in randomized and distributed form is a separate entity unreadable on its own right, but when combined with all N pieces, is able to be reconstructed back to one. Reconstruction requires possession of the key used for randomizing the bytes, leading to the generation of the same cryptographically secure random sequence of numbers used to randomize the data. This software is a cornerstone capability possessing the ability to generate the same cryptographically secure sequence on different machines and time intervals, thus allowing this software to be used more heavily in net-centric environments where data transfer bandwidth is limited.
Paloulian, George K.↗
Redshift data and statistical inference
Frequency histograms and the 'power spectrum analysis' (PSA) method, the latter developed by Yu & Peebles (1969), have been widely employed as techniques for establishing the existence of periodicities. We provide a formal analysis of these two classes of methods, including controlled numerical experiments, to better understand their proper use and application. In particular, we note that typical published applications of frequency histograms commonly employ far greater numbers of class intervals or bins than is advisable by statistical theory sometimes giving rise to the appearance of spurious patterns. The PSA method generates a sequence of random numbers from observational data which, it is claimed, is exponentially distributed with unit mean and variance, essentially independent of the distribution of the original data. We show that the derived random processes is nonstationary and produces a small but systematic bias in the usual estimate of the mean and variance. Although the derived variable may be reasonably described by an exponential distribution, the tail of the distribution is far removed from that of an exponential, thereby rendering statistical inference and confidence testing based on the tail of the distribution completely unreliable. Finally, we examine a number of astronomical examples wherein these methods have been used giving rise to widespread acceptance of statistically unconfirmed conclusions.
Newman, William I.↗
Application of neural networks to determine the discrete spectrum of the direct Zakharov – Shabat problem
A neural network architecture is proposed to determine the number of solitons generated by random processes in optical wavelength-division multiplexed telecommunication systems with QPSK, 16-QAM, 64-QAM, and 1024-QAM modulation. The dependence of the prediction quality of a neural network with a special architecture on the number of soliton modes in the signal and the parameters of this signal is studied. (paper)
97 MATHEMATICS AND COMPUTING↗
Experimental Passive-State Preparation for Continuous-Variable Quantum Communications
In the Gaussian-modulated coherent state quantum key distribution (QKD) protocol, the sender first generates Gaussian-distributed random numbers and then encodes them on weak laser pulses actively by performing amplitude and phase modulations. Recently, an equivalent passive QKD scheme has been proposed by exploring the intrinsic field fluctuations of a thermal source [B. Qi, P. G. Evans, and W. P. Grice, Phys. Rev. A 97, 012317 (2018)]. This passive QKD scheme is especially appealing for chip-scale implementation since no active modulation is required. In this paper, we conduct an experimental study of the passively encoded QKD scheme using an off-the-shelf amplified spontaneous emission source operated in continuous-wave mode. Our results show that the excess noise introduced by the passive state preparation scheme can be effectively suppressed by applying optical attenuation and a secure key can be generated over metro-area distances.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Minimal Energy Routing of a Leader and a Wingmate with Periodic Connectivity
We consider a route planning problem in which two unmanned vehicles are required to complete a set of tasks present at distinct locations, referred to as targets, with minimum energy consumption. The mission environment is hazardous, and to ensure a safe operation, the UVs are required to communicate with each other at every target they visit. The problem objective is to determine the allocation of the tasks to the UVs and plan tours for the UVs to visit the targets such that the weighted sum of the distances traveled by the UVs and the distances traveled by the communicating signals between them is minimized. We formulate this problem as an Integer program and show that naively solving the problem using commercially available off-the-shelf solvers is insufficient in determining scalable solutions efficiently. To address this computational challenge, we develop an approximation and a heuristic algorithm, and employ them to compute high-quality solutions to a special case of the problem where equal weights are assigned to the distances traveled by the vehicles and the communicating signals. For this special case, we show that the approximation algorithm has a fixed approximation ratio of 3.75. We also develop lower bounds to the optimal cost of the problem to evaluate the performance of these algorithms on large-scale instances. We demonstrate the performance of these algorithms on 500 randomly generated instances with the number of targets ranging from 6 to 100, and show that the algorithms provide high-quality solutions to the problem swiftly; the average computation time of the algorithmic solutions is within a fraction of a second for instances with at most 100 targets. Finally, we show that the approximation ratio has a variable ratio for the weighted case of the problem. Specifically, if ρ denotes the ratio of the weights assigned to the distances representing the communication and travel costs, the algorithm has an a posteriori ratio of $3 + \frac{3ρ}{4}$ when ρ ≥ 1, and $\frac{3}{ρ}$ + $\frac{3}{4}$ when ρ ≤ 1.
42 ENGINEERING↗
Clustering and Cliques in Preferential Attachment Random Graphs with Edge Insertion
In this paper, we investigate the global clustering coefficient (a.k.a transitivity) and clique number of graphs generated by a preferential attachment random graph model with an additional feature of allowing edge connections between existing vertices. Specifically, at each time step t, either a new vertex is added with probability f(t), or an edge is added between two existing vertices with probability 1 – f(t). We establish concentration inequalities for the global clustering and clique number of the resulting graphs under the assumption that f(t) is a regularly varying function at infinity with index of regular variation –$\gamma$, where $\gamma$ $\in$ [0, 1). Finally, we also demonstrate an inverse relation between these two statistics: the clique number is essentially the reciprocal of the global clustering coefficient.
97 MATHEMATICS AND COMPUTING↗
Probing the Extragalactic Mid-infrared Background with HAWC
The extragalactic background light (EBL) contains all the radiation emitted by nuclear and accretion processes in stars and compact objects since the epoch of recombination. Measuring the EBL density directly is challenging, especially in the near-to-far-infrared wave band, mainly due to the zodiacal light foreground. Instead, gamma-ray astronomy offers the possibility to indirectly set limits on the EBL by studying the effects of gamma-ray absorption in the very high energy (VHE: >100 GeV) spectra of distant blazars. The High Altitude Water Cherenkov Gamma Ray Observatory (HAWC) is one of the few instruments sensitive to gamma rays with energies above 10 TeV. This offers the opportunity to probe the EBL in the near/mid-IR region: λ = 1–100 μm. In this study, we fit physically motivated emission models to Fermi-LAT gigaelectronvolt data to extrapolate the intrinsic teraelectronvolt spectra of blazars. We then simulate a large number of absorbed spectra for different randomly generated EBL model shapes and calculate Bayesian credible bands in the EBL intensity space by comparing and testing the agreement between the absorbed spectra and HAWC extragalactic observations of two blazars. The resulting bands are in agreement with current EBL lower and upper limits, showing a downward trend toward higher wavelength values λ > 10 μm also observed in previous measurements.
79 ASTRONOMY AND ASTROPHYSICS↗
Clustering, randomness and regularity in cloud fields. I - Theoretical considerations. II - Cumulus cloud fields
The current controversy existing in reference to the regularity vs. clustering in cloud fields is examined by means of analysis and simulation studies based upon nearest-neighbor cumulative distribution statistics. It is shown that the Poisson representation of random point processes is superior to pseudorandom-number-generated models and that pseudorandom-number-generated models bias the observed nearest-neighbor statistics towards regularity. Interpretation of this nearest-neighbor statistics is discussed for many cases of superpositions of clustering, randomness, and regularity. A detailed analysis is carried out of cumulus cloud field spatial distributions based upon Landsat, AVHRR, and Skylab data, showing that, when both large and small clouds are included in the cloud field distributions, the cloud field always has a strong clustering signal.
Weger, R. C.↗
Phylogenetic structure of specialization: A new approach that integrates partner availability and phylogenetic diversity to quantify biotic specialization in ecological networks
Abstract Biotic specialization holds information about the assembly, evolution, and stability of biological communities. Partner availabilities can play an important role in enabling species interactions, where uneven partner availabilities can bias estimates of biotic specialization when using phylogenetic diversity indices. It is therefore important to account for partner availability when characterizing biotic specialization using phylogenies. We developed an index, phylogenetic structure of specialization (PSS), that avoids bias from uneven partner availabilities by uncoupling the null models for interaction frequency and phylogenetic distance. We incorporate the deviation between observed and random interaction frequencies as weights into the calculation of partner phylogenetic α‐diversity. To calculate the PSS index, we then compare observed partner phylogenetic α‐diversity to a null distribution generated by randomizing phylogenetic distances among the same number of partners. PSS quantifies the phylogenetic structure (i.e., clustered, overdispersed, or random) of the partners of a focal species. We show with simulations that the PSS index is not correlated with network properties, which allows comparisons across multiple systems. We also implemented PSS on empirical networks of host–parasite, avian seed‐dispersal, lichenized fungi–cyanobacteria, and hummingbird pollination interactions. Across these systems, a large proportion of taxa interact with phylogenetically random partners according to PSS, sometimes to a larger extent than detected with an existing method that does not account for partner availability. We also found that many taxa interact with phylogenetically clustered partners, while taxa with overdispersed partners were rare. We argue that species with phylogenetically overdispersed partners have often been misinterpreted as generalists when they should be considered specialists. Our results highlight the important role of randomness in shaping interaction networks, even in highly intimate symbioses, and provide a much‐needed quantitative framework to assess the role that evolutionary history and symbiotic specialization play in shaping patterns of biodiversity. PSS is available as an R package at https://github.com/cjpardodelahoz/pss .
59 BASIC BIOLOGICAL SCIENCES↗