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 469 records · Page 26

Rapid quantification of mutant fitness in diverse bacteria by sequencing randomly bar-coded transposons

Transposon mutagenesis with next-generation sequencing (TnSeq) is a powerful approach to annotate gene function in bacteria, but existing protocols for TnSeq require laborious preparation of every sample before sequencing. Thus, the existing protocols are not amenable to the throughput necessary to identify phenotypes and functions for the majority of genes in diverse bacteria. Here, we present a method, random bar code transposon-site sequencing (RB-TnSeq), which increases the throughput of mutant fitness profiling by incorporating random DNA bar codes into Tn5 and mariner transposons and by using bar code sequencing (BarSeq) to assay mutant fitness. RB-TnSeq can be used with any transposon, and TnSeq is performed once per organism instead of once per sample. Each BarSeq assay requires only a simple PCR, and 48 to 96 samples can be sequenced on one lane of an Illumina HiSeq system. We demonstrate the reproducibility and biological significance of RB-TnSeq with Escherichia coli , Phaeobacter inhibens , Pseudomonas stutzeri , Shewanella amazonensis , and Shewanella oneidensis . To demonstrate the increased throughput of RB-TnSeq, we performed 387 successful genome-wide mutant fitness assays representing 130 different bacterium-carbon source combinations and identified 5,196 genes with significant phenotypes across the five bacteria. In P. inhibens , we used our mutant fitness data to identify genes important for the utilization of diverse carbon substrates, including a putative D-mannose isomerase that is required for mannitol catabolism. RB-TnSeq will enable the cost-effective functional annotation of diverse bacteria using mutant fitness profiling. A large challenge in microbiology is the functional assessment of the millions of uncharacterized genes identified by genome sequencing. Transposon mutagenesis coupled to next-generation sequencing (TnSeq) is a powerful approach to assign phenotypes and functions to genes. However, the current strategies for TnSeq are too laborious to be applied to hundreds of experimental conditions across multiple bacteria. Here, we describe an approach, random bar code transposon-site sequencing (RB-TnSeq), which greatly simplifies the measurement of gene fitness by using bar code sequencing (BarSeq) to monitor the abundance of mutants. We performed 387 genome-wide fitness assays across five bacteria and identified phenotypes for over 5,000 genes. RB-TnSeq can be applied to diverse bacteria and is a powerful tool to annotate uncharacterized genes using phenotype data.

59 BASIC BIOLOGICAL SCIENCES↗

River sinuosity describes a continuum between randomness and ordered growth

River channels are among the most common landscape features on Earth. An essential characteristic of channels is sinuosity: their tendency to take a circuitous path, which is quantified as along-stream length divided by straight-line length. River sinuosity is interpreted as a characteristic that either forms randomly at channel inception or develops over time as meander bends migrate. Studies tend to assume the latter and thus have used river sinuosity as a proxy for both modern and ancient environmental factors including climate, tectonics, vegetation, and geologic structure. But no quantitative criterion for planform expression has distinguished between random, initial sinuosity and that developed by ordered growth through channel migration. This ambiguity calls into question the utility of river sinuosity for understanding Earth’s history. We propose a quantitative framework to reconcile these competing explanations for river sinuosity. Using a coupled analysis of modeled and natural channels, we show that while a majority of observed sinuosity is consistent with randomness and limited channel migration, rivers with sinuosity ≥1.5 likely formed their geometry through sustained, ordered growth due to channel migration. This criterion frames a null hypothesis for river sinuosity that can be applied to evaluate the significance of environmental interpretations in landscapes shaped by rivers. The quantitative link between sinuosity and channel migration further informs strategies for preservation and restoration of riparian habitat and guides predictions of fluvial deposits in the rock record and in remotely sensed environments from the seafloor to planetary surfaces.

58 GEOSCIENCES↗

Color Randomization of Fast Gluon-Gluon Pairs in the Quark-Gluon Plasma

We study the color randomization of two-gluon states produced after splitting of a primary fast gluon in the quark-gluon plasma. We find that for the LHC conditions the color randomization of the gg pairs is rather slow. At jet energies E = 100 and 500 GeV, for typical jet path length in the plasma in central Pb+Pb collisions, the SU(3)-multiplet averaged color Casimir operator of the gg pair differs considerably from its value 2N{sub c} for a fully randomized gg state. Our calculations of the energy dependence for generation of the nearly collinear decuplet gg states, that can lead to the baryon jet fragmentation, show that the contribution of the anomalous decuplet color states to the baryon production should become small at p{sub T} ≳ 10 GeV.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Stochastic basis adaptation and spatial domain decomposition for partial differential equations with random coefficients

We present a novel approach for high-dimensional stochastic partial differential equations that decomposes the computational domain into smaller disjoint subdomains and reduces the random dimension in each subdomain to save computational costs. The proposed approach combines spatial domain decomposition and stochastic basis adaptation in each subdomain. We adapt the stochastic basis in each subdomain such that the local solution has a low-dimensional random space representation. To compute the stochastic solution in each subdomain, we use the Neumann-Neumann algorithm, where we first estimate the interface solution and then evaluate the interior solution in each subdomain using the interface solution as a boundary condition. The interior solutions in each subdomain are computed independently of each other, which reduces the operation count from $\approx O(N^\alpha)$ to $\approx O(M^\alpha),$ where $N$ is the total number of degrees of freedom, $M$ is the number of degrees of freedom in each subdomain, and the exponent $\alpha>1$ depends on the uncertainty quantification method used. In addition, the localized nature of solutions makes the proposed approach highly parallelizable. We illustrate the accuracy and efficiency of the approach for a steady-state diffusion equation with a random space-dependent diffusion coefficient.

uncertainty quantification, basis adaptation↗

Surrogate-Based Autotuning for Randomized Sketching Algorithms in Regression Problems

Algorithms from Randomized Numerical Linear Algebra (RandNLA) are known to be effective in handling high-dimensional computational problems, providing high-quality empirical performance as well as strong probabilistic guarantees. However, their practical application is complicated by the fact that the user needs to set various algorithm-specific tuning parameters which are different from those used in traditional NLA. This paper demonstrates how a surrogate-based autotuning approach can be used to address fundamental problems of parameter selection in RandNLA algorithms. In particular, we provide a detailed investigation of surrogate-based autotuning for sketch-and-precondition (SAP)-based randomized least squares methods, which have been one of the great success stories in modern RandNLA. Empirical results show that our surrogate-based autotuning approach can achieve near-optimal performance with much less tuning cost than a random search (up to about 7.6x fewer trials of different parameter configurations). Moreover, while our experiments focus on least squares, our results demonstrate a general-purpose autotuning pipeline applicable to any kind of RandNLA algorithm.

Cho, Younghyun↗

Efficient Training of Deep Neural Operator Networks via Randomized Sampling

Neural operators (NOs) employ deep neural networks to learn the mappings between infinitedimensional function spaces. Deep operator network (DeepONet), a popular NO architecture, has demonstrated success in the real-time prediction of complex dynamics across various scientific and engineering applications. In this work, we introduce a random sampling technique to be adopted during the training of DeepONet, aimed at improving the generalization ability of the model, while significantly reducing the computational time. The proposed approach targets the trunk network of the DeepONet model that outputs the basis functions corresponding to the spatiotemporal locations of the bounded domain on which the physical system is defined. While constructing the loss function, DeepONet training traditionally considers a uniform grid of spatiotemporal points at which all the output functions are evaluated for each iteration. This approach leads to a larger batch size, resulting in poor generalization and increased memory demands, due to the limitations of the stochastic gradient descent (SGD) optimizer. The proposed random sampling over the inputs of the trunk net mitigates these challenges, improving generalization and reducing the memory requirements during training, resulting in significant computational gains. We validate our hypothesis through three benchmark examples, demonstrating substantial reductions in training time while achieving comparable or lower overall test errors relative to the traditional training approach. Our results indicate that incorporating randomization in the trunk network inputs during training enhances the efficiency and robustness of DeepONet, offering a promising avenue for improving the framework’s performance in modeling complex physical systems.

Karumuri, Sharmila [Department of Civil & Systems ↗

COBRA:COMPUTED-TOMOGRAPHY BASED RANDOM-FIELD APPROXIMATION

SF-25-115 COBRA (COmputed-tomography Based Random-field Approximation) is a Python application for generating statistically equivalent random fields from CT-scan imagery. It leverages Karhunen–Loève expansions to model microstructural variability, enabling users to: Preprocess CT scans (filtering and Gaussian transformation); Fit covariance kernels fromempirical data; Solve eigenproblems to obtain KL modes; Sample random fields onsistent with fitted statistics; Postprocess samples back into the physical domain.

Hu, Tianchen↗

Comparing Algorithms for Graph Isomorphism Using Discrete- and Continuous-Time Quantum Random Walks

Berry and Wang [Phys. Rev. A 83, 042317 (2011)] show numerically that a discrete-time quan- tum random walk of two noninteracting particles is able to distinguish some non-isomorphic strongly regular graphs from the same family. Here we analytically demonstrate how it is possible for these walks to distinguish such graphs, while continuous-time quantum walks of two noninteracting parti- cles cannot. We show analytically and numerically that even single-particle discrete-time quantum random walks can distinguish some strongly regular graphs, though not as many as two-particle noninteracting discrete-time walks. Additionally, we demonstrate how, given the same quantum random walk, subtle di erences in the graph certi cate construction algorithm can nontrivially im- pact the walk's distinguishing power. We also show that no continuous-time walk of a xed number of particles can distinguish all strongly regular graphs when used in conjunction with any of the graph certi cates we consider. We extend this constraint to discrete-time walks of xed numbers of noninteracting particles for one kind of graph certi cate; it remains an open question as to whether or not this constraint applies to the other graph certi cates we consider.

97 MATHEMATICS AND COMPUTING↗

Traceable Device-Independent Randomness as a Service

We implement a traceable protocol for device-independent random number generation. Our demonstration involves transparently integrating a device-independent RNG into a public randomness beacon, and feeding 7434 random number pulses into the beacon over 39 days.

Kavuri, Gautam A.↗

Optical filters made from random metasurfaces using Bayesian optimization

Abstract We theoretically investigate the ability to design optical filters from a single material and a single layer of randomly dispersed resonant dielectric particles, defining a random metasurface. Using a Bayesian and generalized Mie inverse-design approach, we design particle radii distributions that give rise to longpass, shortpass, bandpass, and bandstop spectral bands in the infrared. The optical response is shown to be directly related to electric and magnetic multipole scattering of the constituent particles and their near field coupling. We discuss the effect of the particle size distribution and particle–particle coupling interactions on filter design in random systems lacking long-range order.

Materials Science↗

Exploring Applications of Random Walks on Spiking Neural Algorithms

Neuromorphic computing has many promises in the future of computing due to its energy efficient and scalable implementation. Here we extend a neural algorithm that is able to solve the diffusion equation PDE by implementing random walks on neuromorphic hardware. Additionally, we introduce four random walk applications that use this spiking neural algorithm. The four applications currently implemented are: generating a random walk to replicate an image, finding a path between two nodes, finding triangles in a graph, and partitioning a graph into two sections. We then made these four applications available to be implemented on software using a graphical user interface (GUI).

97 MATHEMATICS AND COMPUTING↗

Random Variation of ACRR Core Report

The research presented in this paper is to be a contribution to a larger research project. The project was designed to test the safety standards of Sandia National Laboratories' ACRR. The MCNP model of the ACRR core is being used to simulate the environment. To test the safety standards, the dimensions and density of the fuel in the core were varied randomly. Each rod had its own dimension and density assigned to it randomly. Ten different cases of the ACRR core were randomly created. The different cases were studied using 640-group neutron fluxes. The fluxes were compared to see how the variations affected the system.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Bringing randomized algorithms to mainstream numerical linear algebra

Numerical linear algebra (NLA) underpins huge swaths of computational science and engineering. For scientists and engineers to make the most of the DOE’s computing resources, it is essential that they have access to high-performance implementations of algorithms with best-in-class scalability and reliability. Despite this, prevailing NLA libraries have little to no support for breakthrough algorithms from the field of randomized numerical linear algebra (RandNLA) that have been developed over the past twenty years. The goal of this LDRD was to break a log-jam that had prevented broad adoption of RandNLA. Our work had two thrusts. The first was to develop RandBLAS: a trustworthy and high-performance C++ library for randomized dimension reduction (an operation widely known as sketching). The second was the development of a novel randomized algorithm for computing a challenging type of matrix decomposition known as Householder QR with column pivoting (Householder QRCP). In this one-year late-start LDRD we successfully delivered RandBLAS 1.0 and new CPU and GPU codes for Householder QRCP. RandBLAS has extensive documentation at https://randblas.readthedocs.io/en/stable/. Papers on RandBLAS and and our high-performance QRCP codes are forthcoming.

97 MATHEMATICS AND COMPUTING↗

Randomized Algorithms for Linear Solvers

Recently, randomized algorithms in numerical linear algebra, specifically those centered around random sketching, have gained traction in primarily theoretical research due to their potential to significantly reduce problem dimensionality at the cost of an O(1) multiplicative distortion factor. It has been assumed that this sketching can be done efficiently, but thorough investigation into how precisely to do it has been neglected. Moreover, the theory-based community has argued for sketching’s ability to reduce computational cost via complexity analysis, but has not researched how it affects the stability of the algorithms. At Sandia, efficient linear solvers that scale well on modern HPC architectures while maintaining stability are imperative for practical applications. In this LDRD, we developed a random sketching strategy that is substantially faster than existing ones, and demonstrate its superior performance in practice on a NVIDIA H100 GPU. Moreover, we show how this can be used to significantly outperform existing linear least squares solvers while improving the solver’s stability as well. Additionally, we demonstrate how this sketching strategy can be used to make a fast, stable QR factorization that can subsequently be used in s-step and block Krylov solvers. Finally, we incorporate a sketching-based block orthogonalization scheme into s-step GMRES, which is stable and faster than existing approaches on the Perlmutter supercomputer.

97 MATHEMATICS AND COMPUTING↗

Circulating levels of micronutrients and risk of osteomyelitis: a Mendelian randomization study

Background Few observational studies have investigated the effect of micronutrients on osteomyelitis, and these findings are limited by confounding and conflicting results. Therefore, we conducted Mendelian randomization (MR) analyses to evaluate the association between blood levels of eight micronutrients (copper, selenium, zinc, vitamin B12, vitamin C, and vitamin D, vitamin B6, vitamin E) and the risk of osteomyelitis. Methods We performed the two-sample and multivariable Mendelian randomization (MVMR) to investigate causation, where instrument variables for the predictor (micronutrients) were derived from the summary data of micronutrients from independent cohorts of European ancestry. The outcome instrumental variables were used from the summary data of European-ancestry individuals ( n = 486,484). The threshold of statistical significance was set at p < 0.00625. Results We found a significant causal association that elevated zinc heightens the risk of developing osteomyelitis in European ancestry individuals OR = 1.23 [95% confidence interval (CI) [1.07, 1.43]; p = 4.26E-03]. Similarly, vitamin B6 showed a similar significant causal effect on osteomyelitis as a risk factor OR = 2.78 (95% CI [1.34, 5.76]; p = 6.04E-03; in the secondary analysis). Post-hoc analysis suggested this result (vitamin B6). However, the multivariable Mendelian randomization (MVMR) provides evidence against the causal association between zinc and osteomyelitis OR = 0.98(95% CI [−0.11, 0.07]; p = 7.20E-1). After searching in PhenoScanner, no SNP with confounding factors was found in the analysis of vitamin B6. There was no evidence of a reverse causal impact of osteomyelitis on zinc and vitamin B6. Conclusion This study supported a strong causal association between vitamin B6 and osteomyelitis while reporting a dubious causal association between zinc and osteomyelitis.

Zhang, Xu↗

Secondary fast magnetoacoustic waves trapped in randomly structured plasmas

Fast magnetoacoustic waves are an important tool for inferring parameters of the solar atmosphere. We numerically simulate the propagation of fast wave pulses in randomly structured plasmas that mimic the highly inhomogeneous solar corona. A network of secondary waves is formed by a series of partial reflections and transmissions. These secondary waves exhibit quasi-periodicities in both time and space. Since the temporal and spatial periods are related simply through the speed of the fast wave, we quantify the properties of secondary waves by examining the dependence of the average temporal period ( p-bar ) on the initial pulse width (w {sub 0}) and studying the density contrast (δ{sub ρ}) and correlation length (L {sub c}) that characterize the randomness of the equilibrium density profiles. For small-amplitude pulses, δ{sub ρ} does not alter p-bar significantly. Large-amplitude pulses, on the other hand, enhance the density contrast when δ{sub ρ} is small but have a smoothing effect when δ{sub ρ} is sufficiently large. We found that p-bar scales linearly with L {sub c} and that the scaling factor is larger for a narrower pulse. However, in terms of the absolute values of p-bar , broader pulses generate secondary waves with longer periods, and this effect is stronger in random plasmas with shorter correlation lengths. Secondary waves carry the signatures of both the leading wave pulse and the background plasma. Our study may find applications in magnetohydrodynamic seismology by exploiting the secondary waves detected in the dimming regions after coronal mass ejections or extreme ultraviolet waves.

79 ASTRONOMY AND ASTROPHYSICS↗

Spectral convergence of the stochastic galerkin approximation to the boltzmann equation with multiple scales and large random perturbation in the collision kernel

In a 2018 article, spectral convergence and long-time decay of the numerical solution towards the global equilibrium of the stochastic Galerkin approximation for the Boltzmann equation with random inputs in the initial data and collision kernel for hard potentials and Maxwellian molecules under Grad's angular cutoff were established using the hypocoercive properties of the collisional kinetic model. One assumption for the random perturbation of the collision kernel is that the perturbation is in the order of the Knudsen number, which can be very small in the fluid dynamical regime. In this article, we remove this smallness assumption, and establish the same results but now for random perturbations of the collision kernel that can be of order one. The new analysis relies on the establishment of a spectral gap for the numerical collision operator.

97 MATHEMATICS AND COMPUTING↗

Land surface model parameter optimisation using in situ flux data: comparison of gradient-based versus random search algorithms (a case study using ORCHIDEE v1.9.5.2)

Land surface models (LSMs), which form the land component of earth system models, rely on numerous processes for describing carbon, water and energy budgets, often associated with highly uncertain parameters. Data assimilation (DA) is a useful approach for optimising the most critical parameters in order to improve model accuracy and refine future climate predictions. In this study, we compare two different DA methods for optimising the parameters of seven plant functional types (PFTs) of the ORCHIDEE LSM using daily averaged eddy-covariance observations of net ecosystem exchange and latent heat flux at 78 sites across the globe. We perform a technical investigation of two classes of minimisation methods – local gradient-based (the L-BFGS-B algorithm, limited memory Broyden–Fletcher–Goldfarb–Shanno algorithm with bound constraints) and global random search (the genetic algorithm) – by evaluating their relative performance in terms of the model–data fit and the difference in retrieved parameter values. We examine the performance of each method for two cases: when optimising parameters at each site independently (“single-site” approach) and when simultaneously optimising the model at all sites for a given PFT using a common set of parameters (“multi-site” approach). We find that for the single site case the random search algorithm results in lower values of the cost function (i.e. lower model–data root mean square differences) than the gradient-based method; the difference between the two methods is smaller for the multi-site optimisation due to a smoothing of the cost function shape with a greater number of observations. The spread of the cost function, when performing the same tests with 16 random first-guess parameters, is much larger with the gradient-based method, due to the higher likelihood of being trapped in local minima. When using pseudo-observation tests, the genetic algorithm results in a closer approximation of the true posterior parameter value in the L-BFGS-B algorithm. We demonstrate the advantages and challenges of different DA techniques and provide some advice on using it for the LSM parameter optimisation.

58 GEOSCIENCES↗