Search NASA⌕ Search

SEARCH · Search NASA

Results for “Randomization”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Random projection using random quantum circuits

The random sampling task performed by Google's Sycamore processor gave us a glimpse of the “quantum supremacy era.” This has definitely shed some light on the power of random quantum circuits in this abstract task of sampling outputs from the (pseudo)random circuits. In this paper, we explore a practical near-term use of local random quantum circuits in dimensional reduction of large low-rank data sets. We make use of the well-studied dimensionality reduction technique called the random projection method. This method has been extensively used in various applications such as image processing, logistic regression, entropy computation of low-rank matrices, etc. We prove that the matrix representations of local random quantum circuits with sufficiently shorter depths [ ∼ O ( n ) ] serve as good candidates for random projection. We demonstrate numerically that their projection abilities are not far off from the computationally expensive classical principal components analysis on MNIST and CIFAR-100 image datasets. We also benchmark the performance of quantum random projection against the commonly used classical random projection in the tasks of dimensionality reduction of image data sets and computing von Neumann entropies of large low-rank density matrices. And finally, using variational quantum singular value decomposition, we demonstrate a near-term implementation of extracting the singular vectors with dominant singular values after quantum random projecting a large low-rank matrix to lower dimensions. All such numerical experiments unequivocally demonstrate the ability of local random circuits to randomize a large Hilbert space at sufficiently shorter depths with robust retention of properties of large data sets in reduced dimensions. Published by the American Physical Society 2024

Kumaran, Keerthi (ORCID:0009000949125721)↗
DOE OSTI2026

Generation of random geological models using multi-randomization for machine learning

Generating high-fidelity geological models is essential for advancing machine learning (ML) methods in automated seismic interpretation. For instance, seismic images paired with corresponding fault labels are foundational for ML-based fault detection from seismic migration sections. While several open-access datasets of random geological models exist, open-source tools specifically designed to produce large volumes of such models for ML applications remain scarce. To address this gap, we present RGM (Random Geological Model), an open-source software package for efficiently generating 2D and 3D synthetic geological models tailored for ML workflows. RGM supports the creation of diverse model components, including medium property distributions (P-/S-wave velocities and density), seismic reflectivity images (i.e., synthetic migration sections), relative geological time, and discrete fault attributes such as probability, dip, strike, rake, and displacement. It also accommodates the creation of complex geological features such as salt bodies and unconformities. The model generation algorithm employs a multi-randomization strategy, yielding an effectively infinite-dimensional model space that encompasses a wide range of geological scenarios and associated seismic features. Furthermore, RGM incorporates a method to generate synthetic elastic migration images using analytical elastic reflection coefficients combined with frequency-dependent scaling. This functionality enables the creation of training datasets for ML models that leverage elastic seismic images. RGM is implemented in modern object-oriented Fortran, allowing users to flexibly control statistical parameters governing model variability. We demonstrate the capability, performance, and geological realism of the package through comprehensive 2D and 3D examples.

58 GEOSCIENCES↗
DOE OSTI2023

Wetting Behavior of A -block- (B- random -C) Copolymers with Equal Block Surface Energies on Surfaces Functionalized with B- random -C Copolymers

To form nanopatterns with self-assembled block copolymers (BCPs), it is desirable to have through-film domains that are oriented perpendicular to the substrate. The domain orientation is determined by the interfacial interactions of the BCP domains with the substrate and with the free surface. Here, we use thin films of two different sets of BCPs with A-block-(B-random-C) architecture matched with a corresponding B-random-C copolymer nanocoating on the substrate to demonstrate two distinct wetting behaviors. The two sets of A-b-(B-r-C) BCPs are made by using thiol–epoxy click chemistry to functionalize polystyrene-block-poly(glycidyl methacrylate) with trifluoroethanethiol (TFET) and either 2-mercaptopyridine (2MP) or methyl thioglycolate (MTG). For each set of BCPs, the composition ratio of the two thiols in the BCP (φ 1 ) is found that results in the two blocks of the modified BCP having equal surface energies (Δγ air = 0). The corresponding B-r-C random copolymers were synthesized and used to modify the substrate, and the composition ratio (φ 2 ) values that resulted in the two blocks of the BCP having equal interfacial energy with the substrate (Δγ sub = 0) were determined with scanning electron microscopy. The correlation between each block’s γ sub value and the interaction parameter, χ, is employed to explain the different wetting behaviors of the two sets of BCPs. For the thiol pair 2MP and TFET, the values of φ 1 and φ 2 that lead to Δγ air = 0 and Δγ sub = 0, respectively, are significantly different. A similar difference was observed between the φ 1 and φ 2 values that lead to Δγ air = 0 and Δγ sub = 0 for the BCPs made with the thiol pair MTG and TFET. In the latter case, for Δγ sub = 0 two windows of φ 2 are identified, which can be explained by the thermodynamic interactions of the specific thiol pair and the A-b-(B-r-C) architecture.

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

Traceable random numbers from a non-local quantum advantage

The unpredictability of random numbers is fundamental to both digital security and applications that fairly distribute resources. However, existing random number generators have limitations—the generation processes cannot be fully traced, audited and certified to be unpredictable. The algorithmic steps used in pseudorandom number generators are auditable, but they cannot guarantee that their outputs were a priori unpredictable given knowledge of the initial seed. Device-independent quantum random number generators can ensure that the source of randomness was unknown beforehand, but the steps used to extract the randomness are vulnerable to tampering. Here we demonstrate a fully traceable random number generation protocol based on device-independent techniques. Our protocol extracts randomness from unpredictable non-local quantum correlations, and uses distributed intertwined hash chains to cryptographically trace and verify the extraction process. This protocol forms the basis for a public traceable and certifiable quantum randomness beacon that we have launched. Over the first 40 days of operation, we completed the protocol 7,434 out of 7,454 attempts—a success rate of 99.7%. Each time the protocol succeeded, the beacon emitted a pulse of 512 bits of traceable randomness. The bits are certified to be uniform with error multiplied by actual success probability bounded by 2−64. Further, the generation of certifiable and traceable randomness represents a public service that operates with an entanglement-derived advantage over comparable classical approaches.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

TRIM: AI Guided Random Number Generation for Resource-Constrained IoT Systems

Random numbers often serve as the backbone for many security solutions in diverse domains such as cryptography, side channel leakage prevention, and moving target defense. However, generating true random numbers requires a physical source of entropy (e.g. hardware, quantum, environmental phenomenon) making it difficult to realize at a large scale and at a low cost. On the flip side, pseudorandom number generators (easy to implement) following a specific distribution (e.g. Gaussian) can be easily compromised given a sufficient amount of traces. In this work, we have developed a machine learning-guided generative approach that can be used to create portable, resource-efficient, and cost-effective random number generators with high throughput and true randomness characteristics. We implement the proposed approach as a highly parameterized framework and perform extensive evaluation for different settings. The framework was able to learn from true random sources such as irrational numbers and environmental audio noise and imitate those sources towards generating new good quality random numbers on demand. We have generated more than 1 billion bits and observed robust performance in terms of true randomness metrics obtained from NIST SP 800-22 and FIPS 140-1 randomness test suites achieving a throughput of up to 142.85 Mbps. Compared to the state-of-the-art (SOTA) technique, the iso-cost setup of our framework can achieve more than 500 Mbps in a distributed setting. We have evaluated the efficacy of running the true randomness imitation AI models on target edge devices such as Raspberry Pi 4 (Model B), Nvidia Jetson Nano, Nvidia Jetson Orin Nano and Nvidia Jetson Xavier. We have also looked at the security of the TRIM framework itself against different adversarial threat models.

Cybersecurity↗
DOE OSTI2023

Reassessing the MCNP Random Number Generator

Random number generators are integral components to Monte Carlo codes. They provide the pseudorandom number sequence used to actually sample the distributions of interest. As a result, they are one of the most important components to the software. The current recommended MCNP random number generator is a 63-bit linear congruential generator (LCG). This generator is quite fast, but it has some drawbacks. First, it only has a period of 2 63 . Due to the necessarily non-optimal usage of random numbers to ensure parallel reproducibility, this amount is too few to guarantee random number sequences are not reused in all configurations the code runs under. As simulation size increases, users will need to be aware of the limitations of the generator and tune configuration variables to best suit their simulations, or they will need to assume that reuse is not negatively affecting their answers. Neither of these are optimal. Second, small LCGs are fairly weak in bit generation quality, and this can have an unknown impact on the quality of the simulation. This paper is an investigation into whether or not more modern random number generators can supersede the current ones. The goal is to find a generator that is similar or superior in speed to the LCGs, has a state space large enough to make strong guarantees about random number reuse, and passes all modern random number test suites. If such a generator is found, it would eliminate the need for the user to even be aware of the limitations of the random number generator and would simplify the use of the code. This paper will be broken into several parts. Sec. 2 will discuss the evolution of the random number generator within the MCNP code. Sec. 3 will go over what a Monte Carlo code needs from a generator to be reproducible and portable and how the current generator behaves in that light. Sec. 4 goes through how each generator was tested. Finally, Sec. 5 will discuss improvements that could be made to the code.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Efficient Unitary Designs from Random Sums and Permutations

A unitary k-design is an ensemble of unitaries that matches the first k moments of the Haar measure. In this work, we provide two efficient constructions of k-designs on n-qubits using new random matrix theory techniques. Our first construction is based on exponentiating sums of random i.i.d. Hermitian matrices and uses O(k2n2)-many gates. In the spirit of central limit theorems, we show that this random sum approximates the Gaussian Unitary Ensemble (GUE). We then show that the product of just two exponentiated GUE matrices is already approximately Haar random. Our second construction is based on products of exponentiated sums of random permutations and uses Õ(k poly (n)) many gates. The k dependence is optimal (up to polylogarithmic factors) and is inherited from the efficiency of existing k-wise independent permutations. Furthermore, replacing random permutations with quantum-secure pseudorandom permutations (PRPs), we also obtain a pseudorandom unitary (PRU) ensemble that is secure under nonadaptive queries. A central feature of both proofs is a new connection between the polynomial method in quantum query complexity and the large-dimension (N) expansion in random matrix theory. In particular, the first construction uses the polynomial method to control high moments of certain random matrix ensembles without requiring delicate Weingarten calculations. In doing so, we define and solve a moment problem on the unit circle, asking whether a finite number of equally weighted points can reproduce a given set of moments. In our second construction, the key step is to exhibit an orthonormal basis for irreducible representations of the partition algebra that has a low-degree large-N expansion. This allows us to show that the distinguishing probability is a low-degree rational polynomial of the dimension N.

algebra↗
DOE OSTI2023

On unifying randomized methods for inverse problems

This work unifies the analysis of various randomized methods for solving linear and nonlinear inverse problems with Gaussian priors by framing the problem in a stochastic optimization setting. By doing so, we show that many randomized methods are variants of a sample average approximation (SAA). More importantly, we are able to prove a single theoretical result that guarantees the asymptotic convergence for a variety of randomized methods. Additionally, viewing randomized methods as an SAA enables us to prove, for the first time, a single non-asymptotic error result that holds for randomized methods under consideration. Another important consequence of our unified framework is that it allows us to discover new randomization methods. Here, we present various numerical results for linear, nonlinear, algebraic, and PDE-constrained inverse problems that verify the theoretical convergence results and provide a discussion on the apparently different convergence rates and the behavior for various randomized methods.

42 ENGINEERING↗
DOE OSTI2024

Reproducible emission from nonlinear random lasers

Multiple scattering of light serves as a mechanism for feedback in random lasers. Consequently, internal spatial mode patterns, lasing wavelengths, and output directionality can all be random. Strong mode interaction can occur in such devices due to spatially overlapping modes resulting in nonlinearity with respect to the pump input power. Nevertheless, temporal coherence and lasing mode amplitude can be fixed at a constant pumping rate. This is a property desirable for applications where unique randomness is exploited but expected to be reliable over time, such as physical unclonable functions. Random lasers can also be cheaply and easily fabricated, exhibit relatively low lasing thresholds and high emission intensity. However, the precise scattering properties of such structures and fluctuations in the pump field can make device emission irreproducible, thereby limiting random laser applications. Here, in this work, we directly compare the random lasing spectra from zinc oxide samples fabricated in four distinct ways: spin-coating, sputtering, solgel deposition, and atomic layer deposition. The particular method of fabrication has a strong impact. Samples made through atomic layer deposition here exhibit both reproducibility and strong nonlinearity desirable for applications. Randomness in emission spectra persists across hundreds of repeated and averaged measurements irrespective of spatial location and is demonstrably nonlinear with respect to input signal intensity.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

A new portable random number generator wrapper library

Random number generator is an important component of many scientific projects. Many projects are written using programming models (like OpenMP and SYCL) to target different architectures. However, some programming models do not provide a random number generator. In this work, we introduce our random number generator wrapper. It is a header-only library that supports three distributions of random numbers: uniform, normal, and poisson. On the GPU backend, it wraps the cuRAND and rocRAND library, and supports various random number engines. It also wraps random123, a counterbased random number generator, on both CPU and GPU. With this library, we can generate random numbers with a few lines of code and target both GPU and multi-thread CPU with the same code. We also investigate the performance and scalability of this wrapper on different architectures with different engines and the number of cores.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Parallel Randomized Tucker Decomposition Algorithms

The Tucker tensor decomposition is a natural extension of the singular value decomposition (SVD) to multiway data. Here, we propose to accelerate Tucker tensor decomposition algorithms by using randomization and parallelization. We present two algorithms that scale to large data and many processors, significantly reduce both computation and communication cost compared to previous deterministic and randomized approaches, and obtain nearly the same approximation errors. The key idea in our algorithms is to perform randomized sketches with Kronecker-structured random matrices, which reduces computation compared to unstructured matrices and can be implemented using a fundamental tensor computational kernel. We provide probabilistic error analysis of our algorithms and implement a new parallel algorithm for the structured randomized sketch. Our experimental results demonstrate that our combination of randomization and parallelization achieves accurate Tucker decompositions much faster than alternative approaches. We observe up to a 16X speedup over the fastest deterministic parallel implementation on 3D simulation data.

Tucker decompositions↗
DOE OSTI2025

Synthesis and Characterization of Methacrylamide-Based Block Random Copolymers via Amine Functionalization of Polystyrene- Block -Poly(Pentafluorophenyl Methacrylate) Toward Enhanced Amenability to Manufacturing Criteria in Nanolithography

Recent interest in manipulating the chemistry of block copolymers (BCPs) to manage the covarying properties necessary to meet manufacturing criteria in nanolithography has resulted in the development and expansion of the A-block-(B-random-C) BCP architecture, where the random block allows for the decoupling of thermodynamic and wetting properties. Previous reports of such BCPs have used click chemistry to create the desired random block, but all such instances possess additional functional groups that are susceptible to undesirable side reactions upon annealing, such as cross-linking and surface grafting. This study reports the substitution reaction of polystyrene-block-poly(pentafluorophenyl methacrylate) (PS-b-PPFMA) with primary amines. The resulting methacrylamide structure of the functionalized random block has only an amide linkage between the attached functional group and the polymer backbone, thereby omitting any sources of side reactions within the BCP. The outcomes of this report also demonstrate the enhanced thermal stability of these materials by virtue of their stable amide bonds. A range of random copolymer compositions is assessed to develop BCPs in which the random block has approximately the same surface energy as the PS block. These BCPs can self-assemble into perpendicular lamellae and are therefore promising candidates for directed self-assembly.

block copolymers↗
DOE OSTI2026

Microphase Separation of Randomly Linked Branched Polystyrene/Polylactic Acid for Formation of Cocontinuous Nanostructures

Cocontinuous polymeric nanomaterials have gained attention for their ability to preserve distinct properties of constituent microphases within a single material. Randomly linked copolymer networks have shown very wide stability windows for disordered cocontinuous phases (extending over ≈ 30 wt % in composition), but the reliance on a network architecture prevents subsequent solution- or melt-processing. Furthermore, the key factors contributing to cocontinuity have remained unclear. We recently found that randomly linked star copolymers (RSCs) can exhibit a cocontinuous window as wide as 25 wt % in the case of 4-arm stars, suggesting that while a network architecture is not essential for the formation of disordered cocontinuous phases, the presence of random elastic forces in such architectures may indeed facilitate their formation. In addition, the behavior was found to be highly sensitive to arm number, with 6-arm RSCs exhibiting almost no cocontinuous phase. These results raised a key mechanistic question regarding the contribution of random elastic forces, originating from strands that bridge between junctions, in stabilizing disordered cocontinuous phases. In the current study, we synthesized randomly linked branched copolymers (RBCs) of polystyrene (PS) and poly(D,L-lactic acid) (PLA), which represent an intermediate architecture between networks and stars. This approach allows for the introduction of elastic contributions from strands bridging between different junctions, while still maintaining the processability advantages of a non-network architecture. The cocontinuous regions of the PS/PLA RBCs, with varying polymer and linker functionalities (f p and f l , respectively), were characterized by small-angle X-ray scattering, gravimetry, and scanning electron microscopy. We found that the cocontinuous windows of RBCs typically expanded with increasing elastic contributions and exhibited reduced sensitivity to junction-functionality compared to RSCs. Notably, RBCs with f p = 1.50 and f l = 3, which had large molecular weights due to proximity to the gel point, achieved a cocontinuous window of ≈ 34 wt %, which is almost twice as wide as analogous 3-arm RSCs and comparable to randomly linked networks. Leveraging this robust cocontinuity and solution-processability, we fabricated a film of interconnected nanoporous PS.

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

RGM: Random Geological Model Generation Package

This Fortran code is to accompany a manuscript to be submitted to Computers & Geosciences, a high-impact, peer-reviewed journal in computer methods for geosciences research. This Fortran code focuses on generation of synthetic geological models using a multi-randomization strategy. Generating high-fidelity synthetic geological models, including realistic seismic reflector migration images, faults, salt bodies, and relative geological time images, is the key for many supervised machine learning methods that aim to delineate faults and other geological properties of interest from seismic migration images. Our package contains two major functionalities: generating 2D synthetic random geological models and generating 3D synthetic random geological models. In each step of the generation process, we set random values for key properties of a geological model to improve the fidelity of the resulting geological model. The package also includes example codes on how to use the random geological model generation subroutines. We name this package RGM – Random Geological Model generation package.

Gao, Kai↗
DOE OSTI2023

Exploring Randomly Wired Neural Networks for Climate Model Emulation

Exploring the climate impacts of various anthropogenic emissions scenarios is key to making informed decisions for climate change mitigation and adaptation. State-of-the-art Earth system models can provide detailed insight into these impacts but have a large associated computational cost on a per-scenario basis. This large computational burden has driven recent interest in developing cheap machine learning models for the task of climate model emulation. In this paper, we explore the efficacy of randomly wired neural networks for this task. We describe how they can be constructed and compare them with their standard feedforward counterparts using the ClimateBench dataset. Specifically, we replace the serially connected dense layers in multilayer perceptrons, convolutional neural networks, and convolutional long short-term memory networks with randomly wired dense layers and assess the impact on model performance for models with 1 million and 10 million parameters. We find that models with less-complex architectures see the greatest performance improvement with the addition of random wiring (up to 30.4% for multilayer perceptrons). Furthermore, of 24 different model architecture, parameter count, and prediction task combinations, only one had a statistically significant performance deficit in randomly wired networks relative to their standard counterparts, with 14 cases showing statistically significant improvement. We also find no significant difference in prediction speed between networks with standard feedforward dense layers and those with randomly wired layers. These findings indicate that randomly wired neural networks may be suitable direct replacements for traditional dense layers in many standard models.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

FORESTR: Finding, Organizing, Representing, Explaining, Summarizing, and Thinning Random forests

Random forests have become popular models used for data driven predictions. As a result, random forests are currently used or being considered for high-consequence mission applications in national security, such as the prediction of yield from optical signals and malware detection. While random forests may provide accurate predictions, the complexity of the algorithm causes a lack of interpretability. Random forests are an ensemble of regression or decision trees. Individual regression and decision trees are interpretable, but ensembles are inherently difficult to interpret due to the compilation of many models. We aim to increase the interpretability of random forests by finding patterns in the ensemble of trees that can be used to “thin” (or remove) trees. As a starting point, in this report, we develop a new distance metric for quantifying the similarity between trees based on their topologies (i.e., shapes). We base the metric on a novel distance metric for graphs that is a proper mathematical distance, is invariant to transformations, has registration between graphs, and computes topological evolutions between graphs. We use the tree distance metric to compute tree statistics such as a “mean tree” and to identify clusters of trees. We apply the developed methodology to a toy dataset and a mission relevant product inspection dataset to demonstrate how the metric can provide insight into random forests. Furthermore, we discuss the limitations of the approach and ideas for future research into how the metric could be used as a thinning tool to develop less complex models.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Random 3D Interpenetrating Electrode Design for Energy Storage Applications

We introduce the concept of random interpenetrating electrode structures, inspired by spinodal decomposition, as a transformative approach for energy storage applications. While ordered architectures, such as double gyroids and Kelvin cell structures, have long been favored for their structural uniformity and surface area utilization, we demonstrate that random structures offer distinct advantages including shorter diffusion pathways, higher packing density, and enhanced reaction kinetics, particularly at low temperatures. Using a combination of computational and electrochemical analysis, we show that random architecture outperforms their ordered counterparts in scenarios where diffusion dominates. This work represents the first systematic exploration of random structures in energy storage, highlighting their potential to overcome limitations of traditional designs. However, challenges such as structural reproducibility and scalability remain, necessitating further investigation into fabrication techniques and material selection. By establishing a framework to optimize random electrode architectures, we provide critical insights into the interplay between geometry, diffusion, and reaction kinetics. This study not only introduces a new design principle for 3D electrodes but also opens pathways for next-generation energy storage systems that demand both high performance and adaptability to a range of operating conditions.

Materials science↗