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 1,423 records · Page 79

Optimal Control of a Surge-Mode WEC in Random Waves

The objective of this project was to develop one or more real-time feedback and feed-forward (MPC) control algorithms for an Oscillating Surge Wave Converter (OSWC) developed by RME called SurgeWEC™ that leverages recent innovations in wave energy converter (WEC) control theory to maximize power production in random wave environments. The control algorithms synthesized innovations in dynamic programming and nonlinear wave dynamics using anticipatory wave sensors and localized sensor measurements; e.g. position and velocity of the WEC Power Take Off (PTO), with predictive wave forecasting data. The result was an advanced control system that uses feedback or feed-forward data from an array of sensor channels comprised of both localized and deployed sensors fused into a single decision process that optimally compensates for uncertainties in the system dynamics, wave forecasts, and sensor measurement errors.

16 TIDAL AND WAVE POWER↗

Flaw Tolerance of Octet Truss Lattices with Random Flaws

We investigate the behavior of octet truss lattices in which some proportion of the bars are randomly removed from a perfect lattice. Using a lattice specimen of 9 × 9 × 9 octet truss unit cells as the nominal design, we simulate the response of prefect and flawed lattices with a finite element method implementation of rod theory. For each of two simple load cases, we perform a Monte Carlo analysis where we consider many instantiations of flawed lattices where between 1% and 20% of the bars are missing, and compare the axial loads in the remaining bars to those in the perfect lattice. We also compare the overall stiffness of the flawed lattices to the perfect lattice. Our results show progressive deterioration of lattice strength and stiffness with increasing proportion of missing bars, as expected, with the location and magnitude of the highest-loaded (most failure-prone) bars depending more on the load case and bar orientation than on the location and connectivity of missing bars. As such, the results reported herein may not be directly transferable to different lattice geometries.

36 MATERIALS SCIENCE↗

A convergence analysis of stochastic collocation method for Navier-Stokes equations with random input data

Stochastic collocation method has proved to be an efficient method and been widely applied to solve various partial differential equations with random input data, including Navier- Stokes equations. However, up to now, rigorous convergence analyses are limited to linear elliptic and parabolic equations; its performance for Navier-Stokes equations was demonstrated mostly by numerical experiments. In this paper, we provide an error analysis of stochastic collocation method for a semi-implicit Backward Euler discretization for NSE and prove the exponential decay of the interpolation error in the probability space. Our analysis indicates that due to the nonlinearity, as final time T increases and NSE solvers pile up, the accuracy may be reduced significantly. Subsequently, the theoretical results are illustrated by the numerical test of time dependent fluid flow around a bluff body.

97 MATHEMATICS AND COMPUTING↗

Random Forest Optimization for Radionuclide Identification

Radionuclide identification through gamma-ray spectroscopy is an indispensable tool in combatting the illicit smuggling of nuclear material. The radionuclide identification devices used in the field need to provide ready-made answers to non-experts, and therefore require sophisticated algorithms that can interpret the underlying data. We investigated the Random Forest classifier as a tool for identifying the radionuclide that is consistent with the data. We were provided with training and validations data sets and used them to optimize the two hyperparameters of the classifiers: maximum features required, and minimum samples used to split each node. The F1 score, a harmonic mean of precision and recall, was used to evaluate the performance of each built classifier. We found the optimal performance with minimum samples of 5 and maximum features of 50, with the F1 score of 0.95.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Randomized Cholesky Preconditioning for Graph Partitioning Applications

A graph is a mathematical representation of a network; we say it consists of a set of vertices, which are connected by edges. Graphs have numerous applications in various fields, as they can model all sorts of connections, processes, or relations. For example, graphs can model intricate transit systems or the human nervous system. However, graphs that are large or complicated become difficult to analyze. This is why there is an increased interest in the area of graph partitioning, reducing the size of the graph into multiple partitions. For example, partitions of a graph representing a social network might help identify clusters of friends or colleagues. Graph partitioning is also a widely used approach to load balancing in parallel computing. The partitioning of a graph is extremely useful to decompose the graph into smaller parts and allow for easier analysis. There are different ways to solve graph partitioning problems. For this work, we focus on a spectral partitioning method which forms a partition based upon the eigenvectors of the graph Laplacian (details presented in Acer, et. al.). This method uses the LOBPCG algorithm to compute these eigenvectors. LOBPCG can be accelerated by an operator called a preconditioner. For this internship, we evaluate a randomized Cholesky (rchol) preconditioner for its effectiveness on graph partitioning problems with LOBPCG. We compare it with two standard preconditioners: Jacobi and Incomplete Cholesky (ichol). This research was conducted from August to December 2021 in conjunction with Sandia National Laboratories.

97 MATHEMATICS AND COMPUTING↗

Randomized Cholesky Preconditioning for Graph Partitioning Applications

Graph partitioning has emerged as an area of interest due to its use in various applications in computational research. One way to partition a graph is to solve for the eigenvectors of the corresponding graph Laplacian matrix. This project focuses on the eigensolver LOBPCG and the evaluation of a new preconditioner: Randomized Cholesky Factorization (rchol). This proconditioner was tested for its speed and accuracy against other well-known preconditioners for the method. After experiments were run on several known test matrices, rchol appears to be a better preconditioner for structured matrices. This research was sponsored by National Nuclear Security Administration Minority Serving Institutions Internship Program (NNSA-MSIIP) and completed at host facility Sandia National Laboratories. As such, after discussion of the research project itself, this report contains a brief reflection on experience gained as a result of participating in the NNSA-MSIIP.

97 MATHEMATICS AND COMPUTING↗

Analysis of Neural Networks as Random Dynamical Systems

In this report we present our findings and outcomes of the NNRDS (analysis of Neural Networks as Random Dynamical Systems) project. The work is largely motivated by the analogy of a large class of neural networks (NNs) with a discretized ordinary differential equation (ODE) schemes. Namely, residual NNs, or ResNets, can be viewed as a discretization of neural ODEs (NODEs) where the NN depth plays the role of the time evolution. We employ several legacy tools from ODE theory, such as stiffness, nonlocality, autonomicity, to enable regularization of ResNets thus improving their generalization capabilities. Furthermore, armed with NN analysis tools borrowed from the ODE theory, we are able to efficiently augment NN predictions with uncertainty overcoming wellknown dimensionality challenges and adding a degree of trust towards NN predictions. Finally, we have developed a Python library QUiNN (Quantification of Uncertainties in Neural Networks) that incorporates improved-architecture ResNets, besides classical feed-forward NNs, and contains wrappers to PyTorch NN models enabling several major classes of uncertainty quantification methods for NNs. Besides synthetic problems, we demonstrate the methods on datasets from climate modeling and materials science.

97 MATHEMATICS AND COMPUTING↗

Studying the Random Number Generators in MCNP6 using an Analytic Benchmark

An analytic solution to a previously studied toy problem is derived and used as a code verification benchmark. Using various Random Number Generators (RNGs) in MCNP6, including the newest SFC64 RNG available in MCNP6.3.1, and their various properties (e.g., RNG stride), we show how these RNGs perform and how to correct or workaround potential issues with respect to the analytic benchmark problem.

97 MATHEMATICS AND COMPUTING↗

Quantum Random Walk Simulator Using Ultrafast Optical Switches

Quantum random walk processes have many intriguing applications in high energy physics including the simulation of parton shower evolution. We will present the design and initial results of a fiber loop time-bin quantum walk architecture using the hardware platform already in operation at the Fermilab Quantum Network in which the state of the photon is defined by its time-of-arrival. The fiber loop consists of an unbalanced Mach-Zehnder interferometer implemented using an ultrafast electro-optical switch. The input switch controls the photon path within the interferometer, while the output switch will direct the photon back into the interferometer or to single photon detectors to measure the probability distribution of arrival times. Depending on which path the photon takes each pass through the loop, its wave function will interfere on these optical switches similar to quantum interference on a beam splitter. This work is an important step towards utilizing real-world advantages of quantum information protocols to solve problems in high energy physics.

Cameron, Andrew [Fermilab]↗

Ensemble Simulation Techniques and Fast Randomized Algorithms

The major goals of the project were to develop and analyze new ensemble simulation techniques, including trajectory stratification and preconditioned MCMC techniques, as well as develop fast numerical linear algebra techniques closely related to ensemble simulation ideas. The trajectory stratification techniques involve simulating in parallel short trajectory fragments of a Markov process confined to a specific region of space‐time and then patching together the statistics gathered to assemble estimates of very general dynamical properties. We have also developed this approach for rare event simulation and extended the techniques to applications requiring a more general framework (such as electronic structure calculations). The preconditioned MCMC techniques involve simulating multiple Markov chains in parallel and then using information from the ensemble to speed the mixing of each individual chain. The fast randomized linear algebra methods are motivated by the diffusion Monte Carlo technique, but are applicable to finding the dominant eigenvalue of (almost) general matrices. For most non‐negative matrices, the schemes result in an error (compared to the power method) that is constant in the dimension of the problem. For more general matrices, we see a very clear sublinear cost trend in computational tests.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Randomized Federated Learning Methods for Nonsmooth, Nonconvex, and Hierarchical Optimization (Final Technical Report)

This final technical report summarizes the outcomes of a DOE-funded project on federated scientific machine learning (FL) under nonsmooth, nonconvex, and hierarchical optimization settings. The project develops new mathematical models, algorithms, and theoretical guarantees for decentralized stochastic, bilevel, and minimax optimization problems arising in DOE mission-relevant applications. A unified framework of randomized and zeroth-order federated optimization methods is introduced, providing provable convergence, communication efficiency, and sample-complexity guarantees. The report documents algorithmic design, theoretical analysis, and empirical validation of the proposed federated learning methods. The project also contributes to workforce development through graduate training and dissemination of results via publications and seminars.

97 MATHEMATICS AND COMPUTING↗

Reducing Randomized Quantum Algorithm Cost [Slides]

We derive the optimal sampling strategy for minimizing total resource cost in randomized quantum algorithms. Our framework is completely general, allowing for resources as diverse as gate counts circuit depth, runtime, or even dissipated energy.

97 MATHEMATICS AND COMPUTING↗

Acceptance sampling using judgmental and randomly selected samples

We present a Bayesian model for acceptance sampling where the population consists of two groups, each with different levels of risk of containing unacceptable items. Expert opinion, or judgment, may be required to distinguish between the high and low-risk groups. Hence, high-risk items are likely to be identifed (and sampled) using expert judgment, while the remaining low-risk items are sampled randomly. We focus on the situation where all observed samples must be acceptable. Consequently, the objective of the statistical inference is to quantify the probability that a large percentage of the unsampled items in the population are also acceptable. We demonstrate that traditional (frequentist) acceptance sampling and simpler Bayesian formulations of the problem are essentially special cases of the proposed model. We explore the properties of the model in detail, and discuss the conditions necessary to ensure that required samples sizes are non-decreasing function of the population size. The method is applicable to a variety of acceptance sampling problems, and, in particular, to environmental sampling where the objective is to demonstrate the safety of reoccupying a remediated facility that has been contaminated with a lethal agent.

54 ENVIRONMENTAL SCIENCES↗

Physics Informed Reinforcement Learning for Power Grid Control using Augmented Random Search

Wide adoption of deep reinforcement learning need to overcome several challenges in energy system domain, including scalability, learning from limited samples, and high-dimensional continuous state and action spaces. In this paper, we integrated physics-based information from the normal generator operation state formula in the reinforcement learning agent's neural network loss function, and applied an augmented random search agent to optimize the generator control under dynamic contingency. Simulation results demonstrated the reliability performance improvements in training speed, reward convergence, sampling efficiency, scalability, and transferability.

physics informed ML, Physics Informed Neural Netwo↗

Advancements on Multi-Fidelity Random Fourier Neural Networks: Application to Hurricane Modeling for Wind Energy

Multi-fidelity approaches are emerging as effective strategies in computational science to handle otherwise intractable tasks like Uncertainty Quantification (UQ), training of Machine Learning (ML) models, and optimization, for expensive high-fidelity applications in which the amount of available simulations or data is limited. The main idea is simple: large datasets generated for low-fidelity approximations of the problem at hand are fused with a much sparser dataset for the target (high-fidelity) system. In this paper, we build on our recent success in designing random Fourier Neural Networks (rFNNs) [1] to target problems arising in wind energy applications and in particular problems of interest for hurricane modeling. In this context, data for the high-fidelity models are limited and lower fidelity alternatives are needed. In this work, we introduce a novel multi-fidelity training approach for our rFNNs and demonstrate its use on a simple verification problem and on a hurricane modeling problem in which high-fidelity data are generated via Large-Eddy Simulations (LES), while low-fidelity data are given by a mesoscale model. Initial results demonstrate how the multi-fidelity training approach can improve the quality of the resulting surrogate.

Fourier Neural Networks↗

Causal relationship between mitochondrial-associated proteins and cerebral aneurysms: a Mendelian randomization study

Background Cerebral aneurysm is a high-risk cerebrovascular disease with a poor prognosis, potentially linked to multiple factors. This study aims to explore the association between mitochondrial-associated proteins and the risk of cerebral aneurysms using Mendelian randomization (MR) methods. Methods We used GWAS summary statistics from the IEU Open GWAS project for mitochondrial-associated proteins and from the Finnish database for cerebral aneurysms (uIA, aSAH). The association between mitochondrial-associated exposures and cerebral aneurysms was evaluated using MR-Egger, weighted mode, IVW, simple mode and weighted median methods. Reverse MR assessed reverse causal relationship, while sensitivity analyses examined heterogeneity and pleiotropy in the instrumental variables. Significant causal relationship with cerebral aneurysms were confirmed using FDR correction. Results Through MR analysis, we identified six mitochondrial proteins associated with an increased risk of aSAH: AIF1 (OR: 1.394, 95% CI: 1.109–1.752, p = 0.0044), CCDC90B (OR: 1.318, 95% CI: 1.132–1.535, p = 0.0004), TIM14 (OR: 1.272, 95% CI: 1.041–1.553, p = 0.0186), NAGS (OR: 1.219, 95% CI: 1.008–1.475, p = 0.041), tRNA PusA (OR: 1.311, 95% CI: 1.096–1.569, p = 0.003), and MRM3 (OR: 1.097, 95% CI: 1.016–1.185, p = 0.0175). Among these, CCDC90B, tRNA PusA, and AIF1 demonstrated a significant causal relationship with an increased risk of aSAH (FDR q < 0.1). Three mitochondrial proteins were associated with an increased risk of uIA: CCDC90B (OR: 1.309, 95% CI: 1.05–1.632, p = 0.0165), tRNA PusA (OR: 1.306, 95% CI: 1.007–1.694, p = 0.0438), and MRM3 (OR: 1.13, 95% CI: 1.012–1.263, p = 0.0303). In the reverse MR study, only one mitochondrial protein, TIM14 (OR: 1.087, 95% CI: 1.004–1.177, p = 0.04), showed a causal relationship with aSAH. Sensitivity analysis did not reveal heterogeneity or pleiotropy. The results suggest that CCDC90B, tRNA PusA, and MRM3 may be common risk factors for cerebral aneurysms (ruptured and unruptured), while AIF1 and NAGS are specifically associated with an increased risk of aSAH, unrelated to uIA. TIM14 may interact with aSAH. Conclusion Our findings confirm a causal relationship between mitochondrial-associated proteins and cerebral aneurysms, offering new insights for future research into the pathogenesis and treatment of this condition.

Wang, Shuai↗