Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
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 OSTI2022

Random strain induced correlations in materials with intertwined nematic and magnetic orders

Electronic nematicity is rarely observed as an isolated instability of a correlated electron system. Instead, in iron pnictides and in certain cuprates and heavy-fermion materials, nematicity is intertwined with an underlying spin-stripe or charge-stripe state. As a result, random strain, ubiquitous in any real crystal, creates both random-field disorder for the nematic degrees of freedom and random-bond disorder for the spin or charge ones. Here, we put forward an Ashkin-Teller model with random Baxter fields to capture the dual role of random strain in nematic systems for which nematicity is a composite order arising from a stripe state. Using Monte Carlo to simulate this random Baxter-field model, we find not only the expected break-up of the system into nematic domains, but also the emergence of nontrivial disorder-promoted magnetic correlations. Such correlations enhance and tie up the fluctuations associated with the two degenerate magnetic stripe states from which nematicity arises, leaving characteristic signatures in the spatial profile of the magnetic domains, in the configurational space of the spin variables, and in the magnetic noise spectrum. We discuss possible experimental manifestations of these effects in iron-pnictide superconductors. Furthermore, our work establishes the random Baxter-field model as a more complete alternative to the random-field Ising model to describe complex electronic nematic phenomena in the presence of disorder.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

A2Cloud‐RF : A random forest based statistical framework to guide resource selection for high‐performance scientific computing on the cloud

Summary This article proposes a random‐forest based A2Cloud framework to match scientific applications with Cloud providers and their instances for high performance. The framework leverages four engines for this task: PERF engine, Cloud trace engine, A2Cloud‐ext engine, and the random forest classifier (RFC) engine. The PERF engine profiles the application to obtain performance characteristics, including the number of single‐precision (SP) floating‐point operations (FLOPs), double‐precision (DP) FLOPs, x87 operations, memory accesses, and disk accesses. The Cloud trace engine obtains the corresponding performance characteristics of the selected Cloud instances including: SP floating point operations per second (FLOPS), DP FLOPS, x87 operations per second, memory bandwidth, and disk bandwidth. The A2Cloud‐ext engine uses the application and Cloud instance characteristics to generate objective scores that represent the application‐to‐Cloud match. The RFC engine uses these objective scores to generate two types of random forests to assist users with rapid analysis: application‐specific random forests (ARF) and application‐class based random forests. The ARF consider only the input application's characteristics to generate a random forest and provide numerical ratings to the selected Cloud instances. To generate the application‐class based random forests, the RFC engine downloads the application profiles and scores of previously tested applications that perform similar to the input application. Using these data, the RFC engine creates a random forest for instance recommendation. We exhaustively test this framework using eight real‐world applications across 12 instances from different Cloud providers. Our tests show significant statistical agreement between the instance ratings given by the framework and the ratings obtained via actual Cloud executions.

Samuel, David↗
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 OSTI2022

Random field optimization

Herein we present a new modeling paradigm for optimization that we call random field optimization. Random fields are a powerful modeling abstraction that aims to capture the behavior of random variables that live on infinite-dimensional spaces (e.g., space and time) such as stochastic processes (e.g., time series, Gaussian processes, and Markov processes), random matrices, and random spatial fields. This paradigm involves sophisticated mathematical objects (e.g., stochastic differential equations and space-time kernel functions) and has been widely used in neuroscience, geoscience, physics, civil engineering, and computer graphics. Despite of this, however, random fields have seen limited use in optimization; specifically, existing optimization paradigms that involve uncertainty (e.g., stochastic programming and robust optimization) mostly focus on the use of finite random variables. This trend is rapidly changing with the advent of statistical optimization (e.g., Bayesian optimization) and multi-scale optimization (e.g., integration of molecular sciences and process engineering). Our work extends a recently-proposed abstraction for infinite-dimensional optimization problems by capturing more general uncertainty representations. Moreover, we discuss solution paradigms for this new class of problems based on finite transformations and sampling, and identify open questions and challenges.

97 MATHEMATICS AND COMPUTING↗
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 OSTI2020

Dynamically controlled random lasing with colloidal titanium carbide MXene

Control of lasing properties through tailorable and dynamically tunable materials and reconfigurable compositions can augment the performance of random lasers for a wide range of applications. Here, a colloid of randomly dispersed weakly scattering single-layer titanium carbide (Ti 3 C 2 T x ) MXene flakes embedded within rhodamine 101 gain medium is experimentally shown to provide feedback for random lasing. Additionally, in contrast to previously reported random laser systems where the optical properties of scatterers are static, the relative permittivity of Ti 3 C 2 T x MXene flakes can be varied under optical pumping due to the saturable absorption properties. Numerical simulations indicate that the observed nonlinear response of Ti 3 C 2 T x MXene flakes enables dynamically tunable random lasing. Thus, pumping the Ti 3 C 2 T x MXene flakes with a second optical source decreases the gain threshold required to obtain random lasing. Also, using numerical simulations, it is shown that the control over the intensity of the second pump enables tuning the field distribution of the random lasing modes. Considering the diversity of the MXenes family, the proposed MXene colloidal metamaterial design opens up a new avenue to advanced control of lasing properties for photonic applications.

36 MATERIALS SCIENCE↗
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 OSTI2022

Effective Field Theory of Random Quantum Circuits

Quantum circuits have been widely used as a platform to simulate generic quantum many-body systems. In particular, random quantum circuits provide a means to probe universal features of many-body quantum chaos and ergodicity. Some such features have already been experimentally demonstrated in noisy intermediate-scale quantum (NISQ) devices. On the theory side, properties of random quantum circuits have been studied on a case-by-case basis and for certain specific systems, and a hallmark of quantum chaos—universal Wigner–Dyson level statistics—has been derived. This work develops an effective field theory for a large class of random quantum circuits. The theory has the form of a replica sigma model and is similar to the low-energy approach to diffusion in disordered systems. The method is used to explicitly derive the universal random matrix behavior of a large family of random circuits. In particular, we rederive the Wigner–Dyson spectral statistics of the brickwork circuit model by Chan, De Luca, and Chalker [Phys. Rev. X 8, 041019 (2018)] and show within the same calculation that its various permutations and higher-dimensional generalizations preserve the universal level statistics. Finally, we use the replica sigma model framework to rederive the Weingarten calculus, which is a method of evaluating integrals of polynomials of matrix elements with respect to the Haar measure over compact groups and has many applications in the study of quantum circuits. The effective field theory derived here provides both a method to quantitatively characterize the quantum dynamics of random Floquet systems (e.g., calculating operator and entanglement spreading) and a path to understanding the general fundamental mechanism behind quantum chaos and thermalization in these systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
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 OSTI2022

Estimating the randomness of quantum circuit ensembles up to 50 qubits

Random quantum circuits have been utilized in the contexts of quantum supremacy demonstrations, variational quantum algorithms for chemistry and machine learning, and blackhole information. The ability of random circuits to approximate any random unitaries has consequences on their complexity, expressibility, and trainability. To study this property of random circuits, we develop numerical protocols for estimating the frame potential, the distance between a given ensemble and the exact randomness. Our tensor-network-based algorithm has polynomial complexity for shallow circuits and is high-performing using CPU and GPU parallelism. We study 1. local and parallel random circuits to verify the linear growth in complexity as stated by the Brown–Susskind conjecture, and; 2. hardware-efficient ansätze to shed light on its expressibility and the barren plateau problem in the context of variational algorithms. Our work shows that large-scale tensor network simulations could provide important hints toward open problems in quantum information science.

97 MATHEMATICS AND COMPUTING↗
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 OSTI2022

Ch3MS-RF: a random forest model for chemical characterization and improved quantification of unidentified atmospheric organics detected by chromatography–mass spectrometry techniques

Abstract. The chemical composition of ambient organic aerosols plays a critical role in driving their climate and health-relevant properties and holds important clues to the sources and formation mechanisms of secondary aerosol material. In most ambient atmospheric environments, this composition remains incompletely characterized, with the number of identifiable species consistently outnumbered by those that have no mass spectral matches in the literature or the National Institute of Standards and Technology/National Institutes of Health/Environmental Protection Agency (NIST/NIH/EPA) mass spectral databases, making them nearly impossible to definitively identify. This creates significant challenges in utilizing the full analytical capabilities of techniques which separate and generate spectra for complex environmental samples. In this work, we develop the use of machine learning techniques to quantify and characterize novel, or unidentifiable, organic material. This work introduces Ch3MS-RF (Chemical Characterization by Chromatography–Mass Spectrometry Random Forest Modeling), an open-source, R-based software tool, for efficient machine-learning-enabled characterization of compounds separated in chromatography–mass spectrometry applications but not identifiable by comparison to mass spectral databases. A random forest model is trained and tested on a known 130 component representative external standard to predict the response factors of novel environmental organics based on position in volatility–polarity space and mass spectrum, enabling the reproducible, efficient, and optimized quantification of novel environmental species. Quantification accuracy on a reserved 20 % test set randomly split from the external standard compound list indicates that random forest modeling significantly outperforms the commonly used methods in both precision and accuracy, with a median response factor percent error of −2 %, for modeled response factors, compared to > 15 %, for typically used proxy assignment-based methods. Chemical properties modeling, evaluated on the same reserved 20 % test set and an extrapolation set of species identified in ambient organic aerosol samples collected in the Amazon rainforest, also demonstrate robust performance. Extrapolation set property prediction mean absolute errors for carbon number, oxygen to carbon ratio (O : C), average carbon oxidation state (OSc‾), and vapor pressure are 1.8, 0.15, 0.25, and 1.0 (log(atm)), respectively. Extrapolation set out-of-sample R2 for all properties modeled are above 0.75, with the exception of vapor pressure. While predictive performance for vapor pressure is less robust compared to the other chemical properties modeled, random-forest-based modeling was significantly more accurate than other commonly used methods of vapor pressure prediction, decreasing the mean vapor pressure prediction error to 0.24 (log(atm)) from 0.55 (log(atm)) (chromatography-based vapor pressure prediction) and 1.2 (log(atm)) (chemical formula-based vapor pressure prediction). The random forest model significantly advances an untargeted analysis of the full scope of chemical speciation yielded by two-dimensional gas chromatography (GCxGC-MS) techniques and can be applied to gas chromatography coupled with electron ionization mass spectrometry (GC-MS) as well. It enables the accurate estimation of key chemical properties commonly utilized in the atmospheric chemistry community, which may be used to more efficiently identify important tracers for further individual analysis and to characterize compound populations uniquely formed under specific ambient conditions.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Devices and methods for increasing the speed and efficiency at which a computer is capable of modeling a plurality of random walkers using a particle method

A method for increasing a speed or energy efficiency at which a computer is capable of modeling a plurality of random walkers. The method includes defining a virtual space in which a plurality of virtual random walkers will move among different locations in the virtual space. The method also includes either assigning a corresponding set of ringed neurons in a spiking neural network to a corresponding virtual random walker, or assigning a corresponding set of ringed neurons to a point in the virtual space. Movement of a given virtual random walker is tracked by decoding differences between states of individual neurons in a corresponding given set of ringed neurons. A virtual random walk of the plurality of virtual random walkers is executed using the spiking neural network.

Aimone, James Bradley↗