Search NASA⌕ Search

SEARCH · Search NASA

Results for “randomized methods”

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 847 records · Page 47
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Effectiveness of supervised exercise, home-based exercise, or walk advice strategies on walking performance and muscle endurance in patients with intermittent claudication (SUNFIT trial): a randomized clinical trial

Abstract Aims Supervised exercise is a guideline-recommended treatment in intermittent claudication (IC). Hospital-based supervised exercise programmes (SEPs) are underutilized, while home-based structured exercise programmes (HSEPs) have attracted interest. The results from HSEP in IC are inconsistent and may confer no benefit over walk advice (WA) and be less effective than SEP. The aim of the study was to compare the effectiveness of best medical treatment, including Nordic pole WA alone, or WA + SEP or WA + HSEP for patients with IC. Methods and results This three-armed, multicentre randomized clinical trial enrolled patients with IC; all patients received best medical treatment including walking poles and the advice of regular Nordic pole walking (WA). For HSEP and SEP, additional exercise programmes were provided. The primarily investigated hypothesis was a non-inferiority analysis of SEP vs. HSEP regarding the 6-min walk test (6MWT) maximum distance, with a pre-defined non-inferiority margin of 50 m. Supporting outcomes included muscle endurance tests and the walking impairment questionnaire. Outcomes were assessed at baseline, 3, 6, and 12 months by a blinded evaluator. Altogether 166 patients (mean age 72 years; 59% males) were randomized. In HSEP and SEP, 24 and 26% patients, respectively, were fully exercise adherent. All three groups improved pain-free walking distance over time, but there were no significant intergroup differences. The intergroup 6MWT difference between SEP and HSEP from 0 to 12 months was –11.6 m, 95% confidence interval: –36.4 to 13.0 m (i.e. within the pre-specified non-inferiority margin). Conclusion The HSEP was non-inferior to SEP in patients with IC. There were no significant differences observed between the three groups at 1 year. Registration ClinicialTrials.gov: NCT02341716.

Sandberg, Anna (ORCID:0000000258432784)↗
DOE OSTI2018

Variational Principle for Mass Transport

A variation principle for mass transport in solids is derived that recasts transport coefficients as minima of local thermodynamic average quantities. The result is independent of diffusion mechanisms and applies to amorphous and crystalline systems. This unifies different computational approaches for diffusion and provides a framework for the creation of new approximation methods with error estimation. It gives a different physical interpretation of the Green function. Lastly, the variational principle quantifies the accuracy of competing approaches for a nontrivial diffusion problem.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
NASA NTRS2002

Probabilistic and Possibilistic Analyses of the Strength of a Bonded Joint

The effects of uncertainties on the predicted strength of a single lap shear joint are examined. Probabilistic and possibilistic methods are used to account for uncertainties. A total of ten variables are assumed to be random, with normal distributions. Both Monte Carlo Simulation and the First Order Reliability Method are used to determine the probability of failure. Triangular membership functions with upper and lower bounds located at plus or minus three standard deviations are used to model uncertainty in the possibilistic analysis. The alpha cut (or vertex) method is used to evaluate the possibility of failure. Linear and geometrically nonlinear finite element analyses are used calculate the response of the joint; fracture in the adhesive and material strength failure in the strap are used to evaluate its strength. Although probabilistic and possibilistic analyses provide significantly more information than do conventional deterministic analyses, they are computationally expensive. A novel scaling approach is developed and used to substantially reduce the computational cost of the probabilistic and possibilistic analyses. The possibilistic approach for treating uncertainties appears to be viable during the conceptual and preliminary design stages when limited data are available and high accuracies are not needed. However, this viability is mixed with several cautions that are discussed herein.

Stroud, W. Jefferson↗
DOE OSTI2021

Dimensional Interpolation for Random Walk

In this work, we employ a simple and accurate dimensional interpolation formula for the shapes of random walks at D = 3 and D = 2 based on the analytically known solutions at both limits D = ∞ and D = 1. The results obtained for the radius of gyration of an arbitrary shaped object have about 2% error compared with accurate numerical results at D = 3 and D = 2. We also calculated the asphericity for a three-dimensional random walk using the dimensional interpolation formula. The results agree very well with the numerically simulated results. The method is general and can be used to estimate other properties of random walks.

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

Rapid Electrochemical Diagnosis of Battery Health and Safety from Cells to Modules

Rapid electrochemical diagnosis of battery health and failure is critical for ensuring reliable battery performance and battery safety. Traditional battery health diagnostics such as capacity measurements and DC pulse tests are reliable and well-understood, however, these measurements of battery capacity and resistance do not capture all aspects of battery degradation. Other aspects of degradation, such as electrolyte decomposition, lithium-plating, and particle cracking are difficult to detect electrochemically but are crucial to measure to get a full picture of battery safety and flag out potential failures. In this work, lab- and field-aged commercial lithium-ion batteries and modules of various chemistries and formats are tested using a variety of traditional electrochemical characterization methods as well as using 2-minute pseudo-random DC pulse sequences at rest and during charge/discharge. The electrochemical measurements are compared to physical cell measurements, cell efficiency, drive cycle performance, physical and thermal heterogeneity, and qualitative safety metrics using statistical and machine-learning methods to discover if a comprehensive "battery health map" can be accurately identified using only rapid DC measurements.

ADVANCED PROPULSION SYSTEMS,ENERGY STORAGE↗
NASA NTRS2004

Truss Optimization for a Manned Nuclear Electric Space Vehicle using Genetic Algorithms

The purpose of this paper is to utilize the genetic algorithm (GA) optimization method for structural design of a nuclear propulsion vehicle. Genetic algorithms provide a guided, random search technique that mirrors biological adaptation. To verify the GA capabilities, other traditional optimization methods were used to generate results for comparison to the GA results, first for simple two-dimensional structures, and then for full-scale three-dimensional truss designs.

Benford, Andrew↗
NASA NTRS1980

Light scattering by randomly oriented spheroidal particles

A study of the light scattering properties of randomly oriented, identical spheroidal particles is presented. A computation method was developed to integrate the Asano and Yamomoto solution (1975) for scattering from a homogeneous spheroid over all particle orientations; the extinction and scattering cross-sections, the asymmetry factor, and scattering matrix elements are calculated for randomly oriented prolate and oblate spheroids and compared with the calculations for spheres and laboratory measurements. The angular scattering behavior of spheroids is found to be different from that of the spheres for side scattering to backscattering directions, and prolate and oblate spheroids of the same shape parameter have similar angular scattering patterns.

Asano, S.↗
DOE OSTI2023

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

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

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A Computational Information Criterion for Particle-Tracking with Sparse or Noisy Data

Traditional probabilistic methods for the simulation of advection-diffusion equations (ADEs) often overlook the entropic contribution of the discretization, e.g., the number of particles, within associated numerical methods. Many times, the gain in accuracy of a highly discretized numerical model is outweighed by its associated computational costs or the noise within the data. Herein, we address the question of how many particles are needed in a simulation to best approximate and estimate parameters in one-dimensional advective-diffusive transport. To do so, we use the well-known Akaike Information Criterion (AIC) and a recently-developed correction called the Computational Information Criterion (COMIC) to guide the model selection process. Random-walk and mass-transfer particle tracking methods are employed to solve the model equations at various levels of discretization. Numerical results demonstrate that the COMIC provides an optimal number of particles that can describe a more efficient model in terms of parameter estimation and model prediction compared to the model selected by the AIC even when the data is sparse or noisy, the sampling volume is not uniform throughout the physical domain, or the error distribution of the data is non-IID Gaussian.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Late Breaking Results: COPPER: Computation Obfuscation by Producing Permutations for Encoding Randomly

Deployed embedded devices face security risks due to increased ease of physical access to the devices by unauthorized users. Capable adversaries can intercept a device to recover the data in memory, including results of performed sensitive computations. Device owners require data confidentiality on their physically insecure devices. To satisfy this goal we implement a novel method, COPPER (Computation Obfuscation by Producing Permutations for Encoding Randomly), to create data which never exists on the device digitally in plaintext format and which is subsequently used for computation. In this paper we utilize COPPER to calculate a moving average computation on encoded data.

embedded systems↗
DOE OSTI2024

RandONets: Shallow networks with random projections for learning linear and nonlinear operators

Deep neural networks have been extensively used for the solution of both the forward and the inverse problem for dynamical systems. However, their implementation necessitates optimizing a high-dimensional space of parameters and hyperparameters. This fact, along with the requirement of substantial computational resources, pose a barrier to achieving high numerical accuracy, but also interpretability. Here, to address the above challenges, we present Random Projection-based Operator Networks (RandONets): shallow networks with random projections and tailor-made numerical analysis methods that learn accurately and fast linear and nonlinear operators. Building on previous works, we prove that RandOnets are universal approximators of linear and nonlinear operators. Due to their simplicity, RandONets provide a one-step transformation of the input space, facilitating interpretability. For the evaluation of their performance, we focus on operators of PDEs. We show, that RandONets outperform by several orders of magnitude, both in terms of numerical approximation accuracy and computational cost, the “vanilla” DeepONets. Hence, we believe that our method will trigger further developments in the field of scientific machine learning, for the development of new ‘’light”schemes that will provide high accuracy while reducing dramatically the computational cost. A MATLAB toolbox for RandONets, including demos, is available on GitHub at https://github.com/GianlucaFabiani/RandONets.

Interpretable machine learning↗
DOE OSTI2018

Robust and non-fragile finite time H{sub ∞} synchronization control for complex networks with uncertain inner coupling

This paper addresses robust finite time H{sub ∞} synchronization problem for non-fragile complex networks with uncertain inner coupling. In order to achieve synchronization, a non-fragile controller subjected to randomly occurring perturbations will be considered. By constructing a suitable Lyapunov–Krasovskii functional and utilizing reciprocally convex approach, the criteria for the networks are established in terms of linear matrix inequalities (LMIs). Theoretical analysis and numerical simulations about robust finite time H{sub ∞} synchronization for uncertain inner coupling complex networks are presented.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1980

Extremes of urine osmolality - Lack of effect on red blood cell survival

Rats were allowed a third of normal water intake for 20 days, and food consumption decreased. The reticulocyte count indicated a suppression of erythropoiesis. Urine osmolality increased from 2,000 mosmol/kg to 3,390 mosmol/kg. Random hemolysis and senescence of a cohort of red blood cell (RBC) previously labeled with (2-(C-14)) glycine was monitored via the production of (C-14)O. Neither hemolysis nor senescence was affected. Following water restriction, the polydipsic rats generated a hypotonic urine. Urine osmolality decreased to 1,300 mosmol/kg for at least 6 days; a reticulocytosis occurred, but RBC survival was unaffected. These results contradict those previously reported, which suggest that RBC survival is influenced by the osmotic stress imposed on the RBC by extremes of urine tonicity. This discrepancy, it is concluded, is due to differences in the methods employed for measuring RBC survival. The random-labeling technique employed previously assumes a steady state between RBC production and destruction. The cohort-labeling technique used here measures hemolysis and senescence independent of changes in RBC production, which is known to be depressed by fasting.

Leon, H. A.↗
DOE OSTI2025

Static Subspace Approximation for Random Phase Approximation Correlation Energies: Applications to Materials for Catalysis and Electrochemistry

Modeling complex materials using high-fidelity, ab initio methods at low cost is a fundamental goal for quantum chemical software packages. The GW approximation and random phase approximation (RPA) provide a unified description of both electronic structure and total energies using the same physics in a many-body perturbative approach that can be more accurate than generalized-gradient density functional theory (DFT) methods. However, GW/RPA implementations have historically been limited to either specific materials classes or application toward small chemical systems. Here, the static subspace approximation allows for reduced cost full-frequency GW/RPA calculations and has previously been benchmarked thoroughly for GW calculations. Here, we describe our approach to including partial occupations of electronic orbitals in full-frequency GW and RPA calculations for the study of electrocatalysts. We benchmarked RPA total energy calculations using the subspace approximation across a diverse test suite of materials for a variety of computational parameters. The benchmarking quantifies the impact of different extrapolation procedures for representing the static polarizability at infinite screened cutoff, and shows that using screened cutoffs above 20-25 Ryd result in diminishing accuracy returns for predicting RPA total energies. Additionally, for moderately sized electrocatalytic models, 2-3 times fewer computational resources are used to compute RPA total energies by representing the static polarizability with 20-30% of the static subspace basis, with an error of approximately 0.01 eV or better in RPA adsorption energy calculations. Finally, we show that for these electrochemical models RPA can shift DFT adsorption energy shifts by up to 0.5 eV and that GW can frequently shift DFT eigenvalues of surface and adsorbate states by approximately 0.5-1 eV.

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

Bayesian and variational Bayesian approaches for flows in heterogeneous random media

In this paper, we study porous media flows in heterogeneous stochastic media. We propose an efficient forward simulation technique that is tailored for variational Bayesian inversion. As a starting point, the proposed forward simulation technique decomposes the solution into the sum of separable functions (with respect to randomness and the space), where each term is calculated based on a variational approach. This is similar to Proper Generalized Decomposition (PGD). Next, we apply a multiscale technique to solve for each term (as in ) and, further, decompose the random function into 1D fields. As a result, our proposed method provides an approximation hierarchy for the solution as we increase the number of terms in the expansion and, also, increase the spatial resolution of each term. We use the hierarchical solution distributions in a variational Bayesian approximation to perform uncertainty quantification in the inverse problem. We conduct a detailed numerical study to explore the performance of the proposed uncertainty quantification technique and show the theoretical posterior concentration.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Efficient Data-Driven Geologic Feature Characterization from Pre-stack Seismic Measurements using Randomized Machine-Learning Algorithm

Conventional seismic techniques for detecting the subsurface geologic features are challenged by limited data coverage, computational inefficiency and subjective human factors. We developed a novel data-driven geological feature characterization approach based on pre-stack seismic measurements. Our characterization method employs an efficient and accurate machine learning method to extract useful subsurface geologic features automatically. Specifically, we use kernel ridge regression to account for the nonlinear relationship between seismic data and geological features. We moreover employ kernel tricks to avoid the explicit nonlinear mapping and infinite dimension of feature space. Yet, the conventional kernel ridge regression can be computationally prohibitive because of the large volume of seismic measurements. We employ a data reduction technique in combination with the conventional kernel ridge regression method to improve the computational efficiency and reduce memory usage. In particular, we utilize a randomized numerical linear algebra technique, named Nyström method, to effectively reduce the dimensionality of the feature space without compromising the information content required for accurate characterization. We provide thorough computational cost analysis to show the efficiency of our new geological feature characterization methods. We validate the performance of our method in characterizing geologic fault zones because faults play an important role in various subsurface applications. Our numerical examples demonstrate that our new characterization method significantly improves the computational efficiency while maintaining comparable accuracy. Interestingly, we demonstrate that our approach yields a speedup ratio on the order of ~102 to ~103 in a multicore computational environment.

58 GEOSCIENCES↗
NASA NTRS1988

Random Process Simulation for stochastic fatigue analysis

A simulation technique is described which directly synthesizes the extrema of a random process and is more efficient than the Gaussian simulation method. Such a technique is particularly useful in stochastic fatigue analysis because the required stress range moment E(R sup m), is a function only of the extrema of the random stress process. The family of autoregressive moving average (ARMA) models is reviewed and an autoregressive model is presented for modeling the extrema of any random process which has a unimodal power spectral density (psd). The proposed autoregressive technique is found to produce rainflow stress range moments which compare favorably with those computed by the Gaussian technique and to average 11.7 times faster than the Gaussian technique. The autoregressive technique is also adapted for processes having bimodal psd's. The adaptation involves using two autoregressive processes to simulate the extrema due to each mode and the superposition of these two extrema sequences. The proposed autoregressive superposition technique is 9 to 13 times faster than the Gaussian technique and produces comparable values for E(R sup m) for bimodal psd's having the frequency of one mode at least 2.5 times that of the other mode.

Larsen, Curtis E.↗
NASA NTRS2011

Markov Chain Monte Carlo Bayesian Learning for Neural Networks

Conventional training methods for neural networks involve starting al a random location in the solution space of the network weights, navigating an error hyper surface to reach a minimum, and sometime stochastic based techniques (e.g., genetic algorithms) to avoid entrapment in a local minimum. It is further typically necessary to preprocess the data (e.g., normalization) to keep the training algorithm on course. Conversely, Bayesian based learning is an epistemological approach concerned with formally updating the plausibility of competing candidate hypotheses thereby obtaining a posterior distribution for the network weights conditioned on the available data and a prior distribution. In this paper, we developed a powerful methodology for estimating the full residual uncertainty in network weights and therefore network predictions by using a modified Jeffery's prior combined with a Metropolis Markov Chain Monte Carlo method.

Goodrich, Michael S.↗