Search NASA⌕ Search

SEARCH · Search NASA

Results for “Random number generation”

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.

At least 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors

Dynamically field-programmable qubit arrays (DPQA) have recently emerged as a promising platform for quantum information processing. In DPQA, atomic qubits are selectively loaded into arrays of optical traps that can be reconfigured during the computation itself. Leveraging qubit transport and parallel, entangling quantum operations, different pairs of qubits, even those initially far away, can be entangled at different stages of the quantum program execution. Such reconfigurability and non-local connectivity present new challenges for compilation, especially in the layout synthesis step which places and routes the qubits and schedules the gates. In this paper, we consider a DPQA architecture that contains multiple arrays and supports 2D array movements, representing cutting-edge experimental platforms. Within this architecture, we discretize the state space and formulate layout synthesis as a satisfiability modulo theories problem, which can be solved by existing solvers optimally in terms of circuit depth. For a set of benchmark circuits generated by random graphs with complex connectivities, our compiler OLSQ-DPQA reduces the number of two-qubit entangling gates on small problem instances by 1.7x compared to optimal compilation results on a fixed planar architecture. To further improve scalability and practicality of the method, we introduce a greedy heuristic inspired by the iterative peeling approach in classical integrated circuit routing. Using a hybrid approach that combined the greedy and optimal methods, we demonstrate that our DPQA-based compiled circuits feature reduced scaling overhead compared to a grid fixed architecture, resulting in 5.1X less two-qubit gates for 90 qubit quantum circuits. These methods enable programmable, complex quantum circuits with neutral atom quantum computers, as well as informing both future compilers and future hardware choices.

Physics↗
DOE OSTI2021

Fast GPU-Based Generation of Large Graph Networks From Degree Distributions

Synthetically generated, large graph networks serve as useful proxies to real-world networks for many graph-based applications. The ability to generate such networks helps overcome several limitations of real-world networks regarding their number, availability, and access. Here, we present the design, implementation, and performance study of a novel network generator that can produce very large graph networks conforming to any desired degree distribution. The generator is designed and implemented for efficient execution on modern graphics processing units (GPUs). Given an array of desired vertex degrees and number of vertices for each desired degree, our algorithm generates the edges of a random graph that satisfies the input degree distribution. Multiple runtime variants are implemented and tested: 1) a uniform static work assignment using a fixed thread launch scheme, 2) a load-balanced static work assignment also with fixed thread launch but with cost-aware task-to-thread mapping, and 3) a dynamic scheme with multiple GPU kernels asynchronously launched from the CPU. The generation is tested on a range of popular networks such as Twitter and Facebook, representing different scales and skews in degree distributions. Results show that, using our algorithm on a single modern GPU (NVIDIA Volta V100), it is possible to generate large-scale graph networks at rates exceeding 50 billion edges per second for a 69 billion-edge network. GPU profiling confirms high utilization and low branching divergence of our implementation from small to large network sizes. For networks with scattered distributions, we provide a coarsening method that further increases the GPU-based generation speed by up to a factor of 4 on tested input networks with over 45 billion edges.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

GenMod: A generative modeling approach for spectral representation of PDEs with random inputs

Here, we propose a method for quantifying uncertainty in high-dimensional PDE systems with random parameters, where the number of solution evaluations is small. Parametric PDE solutions are often approximated using a spectral decomposition based on polynomial chaos expansions. For the class of systems we consider (i.e., high dimensional with limited solution evaluations) the coefficients are given by an underdetermined linear system in a regression formulation. This implies additional assumptions, such as sparsity of the coefficient vector, are needed to approximate the solution. Here, we present an approach where we assume the coefficients are close to the range of a generative model that maps from a low to a high dimensional space of coefficients. Our approach is inspired be recent work examining how generative models can be used for compressed sensing in systems with random Gaussian measurement matrices. Using results from PDE theory on coefficient decay rates, we construct an explicit generative model that predicts the polynomial chaos coefficient magnitudes. The algorithm we developed to find the coefficients, which we call GenMod, is composed of two main steps. First, we predict the coefficient signs using Orthogonal Matching Pursuit. Then, we assume the coefficients are within a sparse deviation from the range of a sign-adjusted generative model. This allows us to find the coefficients by solving a nonconvex optimization problem, over the input space of the generative model and the space of sparse vectors. We obtain theoretical recovery results for a Lipschitz continuous generative model and for a more specific generative model, based on coefficient decay rate bounds. We examine three high-dimensional problems and show that, for all three examples, the generative model approach outperforms sparsity promoting methods at small sample sizes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Spatio-Temporal Surrogates for Interaction of a Jet with High Explosives: Part II - Clustering Extremely High-Dimensional Grid-Based Data

Building an accurate surrogate model for the spatio-temporal outputs of a computer simulation is a challenging task. A simple approach to improve the accuracy of the surrogate is to cluster the outputs based on similarity and build a separate surrogate model for each cluster. This clustering is relatively straightforward when the output at each time step is of moderate size. However, when the spatial domain is represented by a large number of grid points, numbering in the millions, the clustering of the data becomes more challenging. In this report, we consider output data from simulations of a jet interacting with high explosives. These data are available on spatial domains of different sizes, at grid points that vary in their spatial coordinates, and in a format that distributes the output across multiple files at each time step of the simulation. We first describe how we bring these data into a consistent format prior to clustering. Borrowing the idea of random projections from data mining, we reduce the dimension of our data by a factor of thousand, making it possible to use the iterative k-means method for clustering. We show how we can use the randomness of both the random projections, and the choice of initial centroids in k-means clustering, to determine the number of clusters in our data set. Our approach makes clustering of extremely high dimensional data tractable, generating meaningful cluster assignments for our problem, despite the approximation introduced in the random projections.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Establishing metrics to quantify spatial similarity in spherical and red blood cell distributions

As computational power increases and systems with millions of red blood cells can be simulated, it is important to note that varying spatial distributions of cells may affect simulation outcomes. Since a single simulation may not represent the ensemble behavior, many different configurations may need to be sampled to adequately assess the entire collection of potential cell arrangements. In order to determine both the number of distributions needed and which ones to run, we must first establish methods to identify well-generated, randomly placed cell distributions and to quantify distinct cell configurations. We utilize metrics to assess (1) the presence of any underlying structure to the initial cell distribution and (2) similarity between cell configurations. We propose the use of the radial distribution function to identify long-range structure in a cell configuration and apply it to a randomly distributed and structured set of red blood cells. To quantify spatial similarity between two configurations, we make use of the Jaccard index, and characterize sets of red blood cell and sphere initializations. As an extension to our work submitted to the International Conference on Computational Science, we significantly increase our data set size from 72 to 1048 cells, include a similar set of studies using spheres, compare the effects of varying sphere size, and utilize the Jaccard index distribution to probe sets of extremely similar configurations. Our results show that the radial distribution function can be used as a metric to determine long-range structure in both distributions of spheres and RBCs. We determine that the ideal case of spheres within a cube versus bi-concave shaped cells within a cylinder affects the shape of the Jaccard index distributions, as well as the range of Jaccard values, showing that both the shape of particle and the domain may play a role. Furthermore, we also find that the distribution is able to capture very similar configurations through Jaccard index values greater than 95% when appending several nearly identical configurations into the data set.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Using GANs with adaptive training data to search for new molecules

The process of drug discovery involves a search over the space of all possible chemical compounds. Generative Adversarial Networks (GANs) provide a valuable tool towards exploring chemical space and optimizing known compounds for a desired functionality. Standard approaches to training GANs, however, can result in mode collapse, in which the generator primarily produces samples closely related to a small subset of the training data. In contrast, the search for novel compounds necessitates exploration beyond the original data. In this work, we present an approach to training GANs that promotes incremental exploration and limits the impacts of mode collapse using concepts from Genetic Algorithms. In our approach, valid samples from the generator are used to replace samples from the training data. We consider both random and guided selection along with recombination during replacement. By tracking the number of novel compounds produced during training, we show that updates to the training data drastically outperform the traditional approach, increasing potential applications for GANs in drug discovery.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Simulating the filamentation of smoothed laser beams with three-dimensional nonlinear dynamics

In a plasma, the ponderomotive force of an inhomogeneous electromagnetic field expels plasma from regions of high intensity. When a laser propagates through a plasma, this force creates density wells that subsequently modify the index of refraction. The beam refracts and focuses into these wells and may filament. In extreme cases, the laser beam will spray due to increasing angular divergence of the beam. The threshold for ponderomotive self-focusing is well established for isolated laser hotspots or speckles. Here, we define a practical threshold for characterizing the filamentation of thousands of speckles that are found in the focal plane of high-power laser beams spatially smoothed with random phase plates as used at high energy and power laser facilities studying inertial confinement fusion. This threshold is tested against three-dimensional simulations of speckled laser light propagating through plasma. Four metrics are applied to assess filamentation: the fraction of power above five times the average intensity, an effective f-number, the mean-squared perpendicular wavenumber, and the fraction of rarefied density with deviation from the initial density exceeding | δn/ n| = 0.1. The speckled beams studied are generated by random phase plates, both with and without additional polarization smoothing, in a parameter regime of relevance to indirect drive experiments. While filamentation has been discussed extensively in the literature, we believe this to be the first published simulation study with three-dimensional nonlinear hydrodynamics that addresses the onset threshold of ponderomotive filamentation and establishes the lengths and time scales necessary to reach a statistical steady state.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2026

Statistics of base polytopes in F-theory

We propose a new statistical ensemble of toric bases for elliptic Calabi-Yaus used in F-theory models, by focusing on only the convex hull of the base, i.e., the base polytope. This physically motivated coarse-graining greatly simplifies the combinatorial complexity of the part of the 4d F-theory landscape with toric bases. We develop a Monte Carlo approach that randomly samples the base polytopes within fixed boxes, with proper statistical weights. We first apply the algorithm to the set of 2d base polytopes, generating an enlarged set of toric 2d bases that include certain types of codimension-two (4,6) points, and we validate our approach against exact numbers. We then explore the set of 3d base polytopes which fit in a set of “maximal” 3d boxes, and estimate the total number of inequivalent 3d base polytopes to be 10 85 –10 90 . We provide statistical data such as the distribution of non-Higgsable gauge groups on these bases. Amusingly, a similar method can also be applied to generate reflexive polytopes in various dimensions. In both the reflexive and base polytope cases, the number of relevant polytopes obeys a Gaussian distribution as a function of the number of vertices, which can be understood in terms of other results on random polytopes in the math literature.

Differential and algebraic geometry↗
DOE OSTI2024

Fast pseudorandom quantum state generators via inflationary quantum gates

Abstract We propose a mechanism for reaching pseudorandom quantum states, computationally indistinguishable from Haar random, with shallow log-ndepth quantum circuits, wherenis the number of qudits. We argue that$$\log n$$ log n depth 2-qubit-gate-based generic random quantum circuits that are claimed to provide a lower bound on the speed of information scrambling, cannot produce computationally pseudorandom quantum states. This conclusion is connected with the presence of polynomial (inn) tails in the stay probability of short Pauli strings that survive evolution through such shallow circuits. We show, however, that stay-probability-tails can be eliminated and pseudorandom quantum states can be accomplished with shallow$$\log n$$ log n depth circuits built from a special universal family of “inflationary” quantum (IQ) gates. We prove that IQ-gates cannot be implemented with 2-qubit gates, but can be realized either as a subset of 2-qudit-gates inU(d 2 ) withd ≥ 3 anddprime, or as special 3-qubit gates.

Physics↗
DOE OSTI2024

FTTN: Feature-Targeted Testing for Numerical Properties of NVIDIA & AMD Matrix Accelerators

While NVIDIA has been the dominant provider of GPUs for HPC and ML, now AMD has several offerings of GPUs. This encourages programmers to try out AMD GPUs for new codes and also port existing codes over. Unfortunately, without understanding the floating-point differences between these GPU types, software development or porting can introduce bugs—and currently such an understanding is lacking. The magnitude of this open question becomes clear if one imagines the the number of floating-point precision choices (FP16, FP32, etc.), floating-point formats (standard floats, brain-float, etc.), and execution units available (elementary units, matrix/tensor cores, etc.) Questions such as rounding modes and subnormal support are also important. Most of these answers are unknown today or are hard to access. We provide the first testing-guided approach that answers a significant number of these questions. We also devise tests to reveal internal information (e.g., extra bits kept) to make sure that our findings are reliable. Many of our tests employ systematically generated random-programs, others apply fast-math flags and some involve fused multiplyadd. Especially for tensor/matrix cores, the tests have nontrivial logic that we present Our testing approach is reusable for the plethora of GPUs yet to be introduced. Our findings include up to 7 ulps of difference between NVIDIA and AMD for sin and cos at FP32 precision and 3 ulp at FP64. In our study of matrix cores (NVIDIA) and tensor cores (AMD), we have extensively characterized rounding modes (truncation versus round-to-nearest), the number of extra internal bits kept (whether 3 bits are kept or not), subnormal support for inputs and outputs across four different floating-point formats and across NVIDIA A100 and AMD MI250X GPUs. We believe that this wealth of data becoming available for the first time may help avoid significant porting bugs when migrating code across these platforms.

Li, Xinyi↗
DOE OSTI2022

Measuring representative volume elements from high-resolution grain-scale strain fields

Most crystalline materials present a highly heterogeneous response at the microscale, which can be affected by both internal factors (such as microstructural parameters) and external factors (such as loading). Relating microscale inhomogeneities to the macroscale response of a material requires the use of homogenisation techniques, usually based on the concept of a representative volume element (RVE)—the smallest volume of material that represents the global average response. Here, in this work, we present a new and robust experimental method of measuring the size of a strain-based RVE from high-resolution grain-scale strain fields obtained using digital image correlation (DIC). The proposed method is based on the statistical (stereological) nature of the RVE, which has been widely adopted in numerical studies, and involves dividing a strain field into randomly selected regions of varying sizes and statistically analysing the distributions of average strains within them. To validate the new method, we generate a large number of synthetic strain fields from a fractional Gaussian noise algorithm. The proposed stereological method is shown to be capable of producing reliable RVE measurements from a very large range of possible microscale strain fields while at the same time being robust in that it can produce RVE measurement results even in cases where other existing methods may be unable to do so. The proposed method has a low field-of-view requirement, only needing a field-of-view about 1.2 times as large as the RVE to produce reliable measurements. In addition, the stereological method offers significant flexibility since its statistical nature allows for control over how strict the RVE measurement should be in each case.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Neural network reconstruction of the dense matter equation of state from neutron star observables

The Equation of State (EoS) of strongly interacting cold and hot ultra-dense QCD matter remains a major challenge in the field of nuclear astrophysics. With the advancements in measurements of neutron star masses, radii, and tidal deformabilities, from electromagnetic and gravitational wave observations, neutron stars play an important role in constraining the ultra-dense QCD matter EoS. Here, in this work, we present a novel method that exploits deep learning techniques to reconstruct the neutron star EoS from mass-radius (M-R) observations. We employ neural networks (NNs) to represent the EoS in a model-independent way, within the range of ~1-7 times the nuclear saturation density. The unsupervised Automatic Differentiation (AD) framework is implemented to optimize the EoS, so as to yield through TOV equations, an M-R curve that best fits the observations. We demonstrate that this method works by rebuilding the EoS on mock data, i.e., mass-radius pairs derived from a randomly generated polytropic EoS. The reconstructed EoS fits the mock data with reasonable accuracy, using just 11 mock M-R pairs observations, close to the current number of actual observations.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Unraveling Adsorbate-Induced Structural Evolution of Iron Carbide Nanoparticles

Iron carbide (Fe x C y ) nanoparticles (NPs) are promising candidates for replacing platinum group metals in industrial applications, such as high-temperature Fischer–Tropsch synthesis. However, due to their amorphous nature, characterization of the active sites has been challenging experimentally and computationally. Here, using a combined density functional theory (DFT), neural network interatomic potential-assisted global optimization, and ensemble learning study, we evaluate dynamic surface changes associated with syngas (H and CO) interactions. For this purpose, we have developed a general procedure that we use to model an experimentally relevant 270-atom Fe 182 C 88 NP using the neural network-assisted stochastic surface walk global optimization algorithm (SSW-NN). Once generated, the Fe 182 C 88 NP active sites and particle morphology are thoroughly characterized before the effects of syngas adsorbate interactions are explored by using DFT and molecular dynamics simulations. Lastly, we explore correlations between geometric and electronic features of the active sites and the adsorption of H (H ads ), using a regularized random forest machine learning algorithm. In doing so, we identified the Fe–C coordination number and p orbital occupancy as the most important descriptors affecting H ads . Furthermore, using a combined ML and quantum chemistry approach, our work demonstrates a general and efficient procedure for generating and probing complex surface phenomena on binary nanoparticles.

Adsorption↗
DOE OSTI2026

Monte Carlo Event Generation with Continuous Normalizing Flows

We apply continuous normalizing flows trained with the flow matching method to the problem of phase-space sampling in Monte Carlo event generation for high-energy collider physics. Focusing on lepton-pair and top-quark pair production with multiple jets, the two computationally most expensive processes at the Large Hadron Collider, we train helicity-conditioned continuous normalizing flows to remap the random numbers used in matrix element evaluation. Compared to standard methods, we achieve unweighting efficiency improvements by factors of up to 184 and 25 for the two processes at their respective highest jet number, at the cost of an increased evaluation time. When combining the advantages of continuous normalizing flows with the fast evaluation times of coupling-layer-based flows, using the RegFlow approach, we find parton-level unweighted event generation walltime gains of about a factor of 10 at the highest jet numbers. These substantial gains highlight the promise of samplers based on machine learning for next-generation collider experiments.

Bothmann, Enrico [CERN; Gottingen U.] (ORCID:00000↗
DOE OSTI2024

Controlling radioisotope proportions when randomly sampling from Dirichlet distributions in PyRIID

As machine learning models for radioisotope quantification become more powerful, likewise the need for high-quality synthetic training data grows as well. For problem spaces that involve estimating the relative isotopic proportions of various sources in gamma spectra it is necessary to generate training data that accurately represents the variance of proportions encountered. In this report, we aim to provide guidance on how to target a desired variance of proportions which are randomly when using the PyRIID Seed Mixer, which samples from a Dirichlet distribution. We provide a method for properly parameterizing the Dirichlet distribution in order to maintain a constant variance across an arbitrary number of dimensions, where each dimension represents a distinct source template being mixed. We demonstrate that our method successfully parameterizes the Dirichlet distribution to target a specific variance of proportions, provided that several conditions are met. This allows us to follow a principled technique for controlling how random mixture proportions are generated which are then used downstream in the synthesis process to produce the final, noisy gamma spectra.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2021

Flow Redirection and Induction in Steady State (FLORIS) Wind Plant Power Production Data Sets

This dataset contains turbine- and plant-level power outputs for 252,500 cases of diverse wind plant layouts operating under a wide range of yawing and atmospheric conditions. The power outputs were computed using the Gaussian wake model in NREL's FLOw Redirection and Induction in Steady State (FLORIS) model, version 2.3.0. The 252,500 cases include 500 unique wind plants generated randomly by a specialized Plant Layout Generator (PLayGen) that samples randomized realizations of wind plant layouts from one of four canonical configurations: (i) cluster, (ii) single string, (iii) multiple string, (iv) parallel string. Other wind plant layout parameters were also randomly sampled, including the number of turbines (25-200) and the mean turbine spacing (3D-10D, where D denotes the turbine rotor diameter). For each layout, 500 different sets of atmospheric conditions were randomly sampled. These include wind speed in 0-25 m/s, wind direction in 0 deg.-360 deg., and turbulence intensity chosen from low (6%), medium (8%), and high (10%). For each atmospheric inflow scenario, the individual turbine yaw angles were randomly sampled from a one-sided truncated Gaussian on the interval 0 deg.-30 deg. oriented relative to wind inflow direction. This random data is supplemented with a collection of yaw-optimized samples where FLORIS was used to determine turbine yaw angles that maximize power production for the entire plant. To generate this data, a subset of cases were selected (50 atmospheric conditions from 50 layouts each for a total of additional 2,500 cases) for which FLORIS was re-run with wake steering control optimization. The IEA onshore reference turbine, which has a 130 m rotor diameter, a 110 m hub height, and a rated power capacity of 3.4 MW was used as the turbine for all simulations. The simulations were performed using NREL's Eagle high performance computing system in February 2021 as part of the Spatial Analysis for Wind Technology Development project funded by the U.S. Department of Energy Wind Energy Technologies Office. The data was collected, reformatted, and preprocessed for this OEDI submission in May 2023 under the Foundational AI for Wind Energy project funded by the U.S. Department of Energy Wind Energy Technologies Office. This dataset is intended to serve as a benchmark against which new artificial intelligence (AI) or machine learning (ML) tools may be tested. Baseline AI/ML methods for analyzing this dataset have been implemented, and a link to their repository containing those models has been provided. The .h5 data file structure can be found in the GitHub repository under explore_wind_plant_data_h5.ipynb.

AI↗
DOE OSTI2020

Machine learning applied to classifying neutron resonances

The performance of nuclear reactors and other nuclear systems depends on a precise understanding of the neutron interaction cross sections for materials used in these systems. These cross sections exhibit resonance structure whose shape is determined in part by the angular momentum quantum numbers of the resonances. The correct assignment of the quantum numbers of neutron resonances is therefore of paramount importance. In this project, we apply a machine learning technique, namely decision trees, to automate the quantum number assignments. The tree is trained from simulated data generated to mimic the errors found in real data. We explore the use of several physics-motivated features for training our trees, including the nearest neighbor spacing distribution, cumulative level distribution, and channel width distributions. Initial results using random matrix theory motivated fits which demonstrated that we can determine resonance spin groups somewhat reliably. If we use these fits as features in our trees, we can train them to spot outliers corresponding to misassigned resonances. We found that with the large number of features used in this project that the decision tree tended to over t training data resulting in poor performance with respect to the test data. By reducing the number of features, we can achieve nearly perfect assignment of quantum numbers with our training data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Triangle Method for Dense ReLU Layers [SWR-25-72]

This software is an implementation of the methods for initializing and training neural networks to be more efficient per parameter, described more fully below and in the related publication: In theory, depth should make a ReLU network EXPONENTIALLY more efficient by enabling it to produce an exponential number of piecewise linear sections in its output. This reasoning is largely based on the work of mathematicians that have hand-constructed networks that make good use of depth. In practice however, even very deep ReLU networks that have been randomly initialized will behave identically to their shallow counterparts - missing an entire exponential dimension of efficiency. The triangle method is a first attempt at realizing the exponential potential of deep networks. Instead of randomly setting weights, we force pairs of neurons in each layer learn to build triangles (i.e. functions from [0,1] -> [0,1] that look like triangles). This is a very efficient pattern for generating lots of linear pieces because composing two triangular functions doubles the number of pieces with each composition. The triangle method is more than just a different initialization, it is a new paradigm of training. Instead of making direct updates to the matrix weights, we do an extra step of backpropagation to collect the derivatives of the loss function with respect to the shapes of the triangles, training them to tilt left or right. This process essentially holds the networks hand throughout the loss landscape and forces it to always use depth effectively by producing triangular shapes internally. This can produce several orders of magnitude of improvement on convex one-dimensional regression problems. Much more theoretical work is needed to realize its full potential beyond this context, but the implementation in this repository will still work in arbitrary numbers of dimensions. The file Triangle_Method.py is a generalized form of the method that will build each neuron its own custom 1-d convex activation function (with exponential efficiency). Example usage on one dimensional problems can be found in Example_Usage.ipynb and an example of using this in a real neural network can be found in Example_VGG16_CIFAR10.ipynb.

Milkert, Max [National Renewable Energy Laboratory↗