Search NASA⌕ Search

SEARCH · Search NASA

Results for “Stochastic Algorithms”

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 397 records · Page 22
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Learning-accelerated discovery of immune-tumour interactions

We present an integrated framework for enabling dynamic exploration of design spaces for cancer immunotherapies with detailed dynamical simulation models on high-performance computing resources. Our framework combines PhysiCell, an open source agent-based simulation platform for cancer and other multicellular systems, and EMEWS, an open source platform for extreme-scale model exploration. We build an agent-based model of immunosurveillance against heterogeneous tumours, which includes spatial dynamics of stochastic tumour–immune contact interactions. We implement active learning and genetic algorithms using high-performance computing workflows to adaptively sample the model parameter space and iteratively discover optimal cancer regression regions within biological and clinical constraints.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2024

Robust unfolding of MeV x-ray spectra from filter stack spectrometer data

Here, we present an inversion method capable of robustly unfolding MeV x-ray spectra from filter stack spectrometer (FSS) data without requiring an a priori specification of a spectral shape or arbitrary termination of the algorithm. Our inversion method is based upon the perturbative minimization (PM) algorithm, which has previously been shown to be capable of unfolding x-ray transmission data, albeit for a limited regime in which the x-ray mass attenuation coefficient of the filter material increases monotonically with x-ray energy. Our inversion method improves upon the PM algorithm through regular smoothing of the candidate spectrum and by adding stochasticity to the search. With these additions, the inversion method does not require a physics model for an initial guess, fitting, or user-selected termination of the search. Instead, the only assumption made by the inversion method is that the x-ray spectrum should be near a smooth curve. Testing with synthetic data shows that the inversion method can successfully recover the primary large-scale features of MeV x-ray spectra, including the number of x-rays in energy bins of several-MeV widths to within 10%. Fine-scale features, however, are more difficult to recover accurately. Examples of unfolding experimental FSS data obtained at the Texas Petawatt Laser Facility and the OMEGA EP laser facility are also presented.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

Stochastic Approximation for Multi-period Simulation Optimization with Streaming Input Data

We consider a continuous-valued simulation optimization (SO) problem, where a simulator is built to optimize an expected performance measure of a real-world system while parameters of the simulator are estimated from streaming data collected periodically from the system. At each period, a new batch of data is combined with the cumulative data and the parameters are re-estimated with higher precision. The system requires the decision variable to be selected in all periods. Therefore, it is sensible for the decision-maker to update the decision variable at each period by solving a more precise SO problem with the updated parameter estimate to reduce the performance loss with respect to the target system. We define this decision-making process as the multi-period SO problem and introduce a multi-period stochastic approximation (SA) framework that generates a sequence of solutions. Two algorithms are proposed: Re-start SA (ReSA) reinitializes the stepsize sequence in each period, whereas Warm-start SA (WaSA) carefully tunes the stepsizes, taking both fewer and shorter gradient-descent steps in later periods as parameter estimates become increasingly more precise. We show that under suitable strong convexity and regularity conditions, ReSA and WaSA achieve the best possible convergence rate in expected sub-optimality either when an unbiased or a simultaneous perturbation gradient estimator is employed, while WaSA accrues significantly lower computational cost as the number of periods increases. In addition, we present the regularized ReSA, which obviates the need to know the strong convexity constant and achieves the same convergence rate at the expense of additional computation.

Computer Science↗
DOE OSTI2018

Case Study: Nuclear-Renewable-Water Integration in Arizona

This document reports the application of the N-R HES software framework to a case study for Arizona Public Service (APS); the manager and part owner of the Palo Verde (PV) nuclear power plant. The case study is a work in progress of which this report presents a detailed description of the current model input data, assumptions and the corresponding results produced by the developed software framework. The goal of the report is, that with this information APS (together with INL) should be able to identify where more detailed data and more accurate model assumptions are necessary to reproduce all driving physical and economic phenomena in order to capture enough complexity of the reality to allow APS to use the results for their strategic decisions. The N-R HES software framework started being developed at INL two years ago [ref]. The framework has reached some level of maturity so that it can be applied to more than simple demonstration cases, e.g. real industry problems. Nevertheless, more capabilities are constantly added to accommodate the special needs of these challenging real life problems. The N-R HES framework is built on top of the RAVEN code [ref] and uses it as driver and workflow manager for all calculations. The framework has specifically been developed for the economic assessment of N-R HES systems. There are four main cornerstones of the N-R HES simulation framework: 1) generation of stochastic time series, 2) a probabilistic analysis and optimization set of algorithms available in RAVEN, 3) a set of models for representation of the physical behavior of N-R HES, and 4) a RAVEN plug-in that maps physical performance into economic performance called CashFlow. Within this framework, a broad spectrum of questions related to N-R HES can be addressed. One of the challenges currently of high interest is that the increasing penetration of variable renewables is altering the profile of the net demand (demand after removing all non curtailable renewable energy sources), with which the other generators on the grid have to cope. The N-R HES software framework is capable to analyze the potential feasibility of mitigating the resultant volatility in the net electricity demand. One possible solution to that problem currently intensively studied by the energy industry is adding stabilizing loads to the grid. These loads can be external industrial processes that are able to ramp production up and down quickly or adding variable internal loads that will lift the base load of the power plant. The latter is a possible solution currently studied by APS. APS if currently anticipating several challenges that will likely arise in the near future. One of them is, as mentioned, coping with the rapid growth of variable renewable energy (VRE) sources put on the grid. Although APS can sell its electricity for a fixed retail price to cover the local demand first, it also sells electricity in excess of the local demand at the Palo Verde energy hub. Due to the growing VRE penetration, the Palo Verde hub electricity spot price is negative more and more frequently. To mitigate this price volatility, APS is seeking to add more base load, so that the quantity of excess energy to be sold for prices potentially less than the internal retail price or even negative prices at the hub is reduced. A second challenge APS is facing is that their cooling water acquisition contract with the Sub Regional Operating Group (SROG) will expire soon and a renewal can only be done for a significantly higher price of the water. Therefore, APS is also seeking for alternative sources for their cooling water. An opportunity currently under investigation is to pump a limited quantity of brackish water from the regional ground water. Although much cheaper than the water from the new SROG contract, the salinity of the brackish water is so high that a blend of brackish and SROG water would need additional treatment to improve its quality for use in the cooling towers. An on-site reverse osmosis (RO) desalination plant is envisaged to reduce the salinity to an acceptable level. This report investigates the economic impact of such an RO plant. As one can see, the RO plant would help with both problems APS is facing: First, it would rise the APS base load helping to mitigate VRE induced hub price volatility. From this perspective, the RO plant can be seen as a stabilizing load on the grid as would be any other industrial process. Second, the RO’s goods, e.g. the clean water produced can be used by APS itself for a (hopefully) lower cost than 100% SROG water would be. The report will first describe the APS water procurement strategy in detail and lay out the possible alternative scenarios studied in this document. This is covered in Chapter 2. Next, in Chapter 3, the APS case model developed within the N-R HES software framework is described. This chapter includes also a description of the needed framework developments to accommodate the APS study.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Trustworthy Physics-Informed Deep Learning for Predictive Scientific Computing

This project has developed powerful trustworthy physics-informed deep learning (TPiDL) models and methods to fundamentally enhance the scale and power of computational modeling in the scientific and engineering domains. Deep learning (DL) has radically advanced the state-of-the-art in machine learning, computer vision, natural language processing, and also scientific computing. Nevertheless, progress has been driven almost entirely by empirical observations, hacks, and tricks. Under the support of this project, the graph operator learning tools and advanced trustworthy physical informed neural networks have been developed. In addition, stochastic gradient replica-exchange Markov Chain Monte Carlo (MCMC) sampling algorithms have been designed to quantify the uncertainties and speed up the training of large-scale neural networks.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1975

Self-tuning regulators

The results of a research project are discussed for self-tuning regulators for active control. An algorithm for the self-tuning regulator is described as being stochastic, nonlinear, time variable, and not trivial.

Astrom, K. J.↗
NASA NTRS1983

A separated bias identification and state estimation algorithm for nonlinear systems

A computational algorithm for the identification of biases in discrete-time, nonlinear, stochastic systems is derived by extending the separate bias estimation results for linear systems to the extended Kalman filter formulation. The merits of the approach are illustrated by identifying instrument biases using a terminal configured vehicle simulation.

Caglayan, A. K.↗
DOE OSTI2023

BigNeuron: a resource to benchmark and predict performance of algorithms for automated tracing of neurons in light microscopy datasets

BigNeuron is an open community bench-testing platform with the goal of setting open standards for accurate and fast automatic neuron tracing. We gathered a diverse set of image volumes across several species that is representative of the data obtained in many neuroscience laboratories interested in neuron tracing. Here, we report generated gold standard manual annotations for a subset of the available imaging datasets and quantified tracing quality for 35 automatic tracing algorithms. The goal of generating such a hand-curated diverse dataset is to advance the development of tracing algorithms and enable generalizable benchmarking. Together with image quality features, we pooled the data in an interactive web application that enables users and developers to perform principal component analysis, t-distributed stochastic neighbor embedding, correlation and clustering, visualization of imaging and tracing data, and benchmarking of automatic tracing algorithms in user-defined data subsets. The image quality metrics explain most of the variance in the data, followed by neuromorphological features related to neuron size. Furthermore, we observed that diverse algorithms can provide complementary information to obtain accurate results and developed a method to iteratively combine methods and generate consensus reconstructions. The consensus trees obtained provide estimates of the neuron structure ground truth that typically outperform single algorithms in noisy datasets. However, specific algorithms may outperform the consensus tree strategy in specific imaging conditions. Finally, to aid users in predicting the most accurate automatic tracing results without manual annotations for comparison, we used support vector machine regression to predict reconstruction quality given an image volume and a set of automatic tracings.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1993

Numerical experiments with model monophyletic and paraphyletic taxa

The problem of how accurately paraphyletic taxa versus monophyletic (i.e., holophyletic) groups (clades) capture underlying species patterns of diversity and extinction is explored with Monte Carlo simulations. Phylogenies are modeled as stochastic trees. Paraphyletic taxa are defined in an arbitrary manner by randomly choosing progenitors and clustering all descendants not belonging to other taxa. These taxa are then examined to determine which are clades, and the remaining paraphyletic groups are dissected to discover monophyletic subgroups. Comparisons of diversity patterns and extinction rates between modeled taxa and lineages indicate that paraphyletic groups can adequately capture lineage information under a variety of conditions of diversification and mass extinction. This suggests that these groups constitute more than mere "taxonomic noise" in this context. But, strictly monophyletic groups perform somewhat better, especially with regard to mass extinctions. However, when low levels of paleontologic sampling are simulated, the veracity of clades deteriorates, especially with respect to diversity, and modeled paraphyletic taxa often capture more information about underlying lineages. Thus, for studies of diversity and taxic evolution in the fossil record, traditional paleontologic genera and families need not be rejected in favor of cladistically-defined taxa.

Non-NASA Center↗
DOE OSTI2024

Stochastic density functional theory combined with Langevin dynamics for warm dense matter

Here, this study overviews and extends a recently developed stochastic finite-temperature Kohn-Sham density functional theory to study warm dense matter using Langevin dynamics, specifically under periodic boundary conditions. The method's algorithmic complexity exhibits nearly linear scaling with system size and is inversely proportional to the temperature. Additionally, a linear-scaling stochastic approach is introduced to assess the Kubo-Greenwood conductivity, demonstrating exceptional stability for dc conductivity. Utilizing the developed tools, we investigate the equation of state, radial distribution, and electronic conductivity of hydrogen at a temperature of 30 000 K. As for the radial distribution functions, we reveal a transition of hydrogen from gaslike to liquidlike behavior as its density exceeds 4 g/cm 3 . As for the electronic conductivity as a function of the density, we identified a remarkable isosbestic point at frequencies around 7 eV, which may be an additional signature of a gas-liquid transition in hydrogen at 30 000 K.

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

Training reinforcement learning models via an adversarial evolutionary algorithm

When training for control problems, more episodes used in training usually leads to better generalizability, but more episodes also requires significantly more training time. There are a variety of approaches for selecting the way that training episodes are chosen, including fixed episodes, uniform sampling, and stochastic sampling, but they can all leave gaps in the training landscape. In this work, we describe an approach that leverages an adversarial evolutionary algorithm to identify the worst performing states for a given model. We then use information about these states in the next cycle of training; this process can be repeated until the desired level of model performance is met. We demonstrate this approach with the OpenAI Gym cart-pole problem. With this problem, we show that the adversarial evolutionary algorithm did not reduce the number of episodes required in training needed to attain model generalizability when compared with stochastic sampling, and actually performed slightly worse.

Coletti, Mark↗
NASA NTRS1991

Probabilistic structural analysis algorithm development for computational efficiency

The PSAM (Probabilistic Structural Analysis Methods) program is developing a probabilistic structural risk assessment capability for the SSME components. An advanced probabilistic structural analysis software system, NESSUS (Numerical Evaluation of Stochastic Structures Under Stress), is being developed as part of the PSAM effort to accurately simulate stochastic structures operating under severe random loading conditions. One of the challenges in developing the NESSUS system is the development of the probabilistic algorithms that provide both efficiency and accuracy. The main probability algorithms developed and implemented in the NESSUS system are efficient, but approximate in nature. In the last six years, the algorithms have improved very significantly.

Wu, Y.-T.↗
DOE OSTI2018

Efficient Stochastic Inversion Using Adjoint Models and Kernel-PCA

Performing stochastic inversion on a computationally expensive forward simulation model with a high-dimensional uncertain parameter space (e.g. a spatial random field) is computationally prohibitive even with gradient information provided. Moreover, the ‘nonlinear’ mapping from parameters to observables generally gives rise to non-Gaussian posteriors even with Gaussian priors, thus hampering the use of efficient inversion algorithms designed for models with Gaussian assumptions. In this work, we propose a novel Bayesian stochastic inversion methodology, characterized by a tight coupling between a gradient-based Langevin Markov Chain Monte Carlo (LMCMC) method and a kernel principal component analysis (KPCA). This approach addresses the ‘curse-of-dimensionality’ via KPCA to identify a low-dimensional feature space within the high-dimensional and nonlinearly correlated spatial random field. Moreover, non-Gaussian full posterior probability distribution functions are estimated via an efficient LMCMC method on both the projected low-dimensional feature space and the recovered high-dimensional parameter space. We demonstrate this computational framework by integrating and adapting recent developments such as data-driven statistics-on-manifolds constructions and reduction-through-projection techniques to solve inverse problems in linear elasticity.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2008

NASA Tech Briefs, June 2008

Topics covered include: Charge-Control Unit for Testing Lithium-Ion Cells; Measuring Positions of Objects Using Two or More Cameras; Lidar System for Airborne Measurement of Clouds and Aerosols; Radiation-Insensitive Inverse Majority Gates; Reduced-Order Kalman Filtering for Processing Relative Measurements; Spaceborne Processor Array; Instrumentation System Diagnoses a Thermocouple; Chromatic Modulator for a High-Resolution CCD or APS; Commercial Product Activation Using RFID; Cup Cylindrical Waveguide Antenna; Aerobraking Maneuver (ABM) Report Generator; ABM Drag_Pass Report Generator; Transformation of OODT CAS to Perform Larger Tasks; Visualization Component of Vehicle Health Decision Support System; Mars Reconnaissance Orbiter Uplink Analysis Tool; Problem Reporting System; G-Guidance Interface Design for Small Body Mission Simulation; DSN Scheduling Engine; Replacement Sequence of Events Generator; Force-Control Algorithm for Surface Sampling; Tool for Merging Proposals Into DSN Schedules; Micromachined Slits for Imaging Spectrometers; Fabricating Nanodots Using Lift-Off of a Nanopore Template; Making Complex Electrically Conductive Patterns on Cloth; Special Polymer/Carbon Composite Films for Detecting SO2; Nickel-Based Superalloy Resists Embrittlement by Hydrogen; Chemical Passivation of Li+-Conducting Solid Electrolytes; Organic/Inorganic Polymeric Composites for Heat-Transfer Reduction; Composite Cathodes for Dual-Rate Li-Ion Batteries; Improved Descent-Rate Limiting Mechanism; Alignment-Insensitive Lower-Cost Telescope Architecture; Micro-Resistojet for Small Satellites; Using Piezoelectric Devices to Transmit Power through Walls; Miniature Latching Valve; Apparatus for Sampling Surface Contamination; Novel Species of Non-Spore-Forming Bacteria; Chamber for Aerosol Deposition of Bioparticles; Hyperspectral Sun Photometer for Atmospheric Characterization and Vicarious Calibrations; Dynamic Stability and Gravitational Balancing of Multiple Extended Bodies; Simulation of Stochastic Processes by Coupled ODE-PDE; Cluster Inter-Spacecraft Communications; Genetic Algorithm Optimizes Q-LAW Control Parameters; Low-Impact Mating System for Docking Spacecraft; Non-Destructive Evaluation of Materials via Ultraviolet Spectroscopy; Gold-on-Polymer-Based Sensing Films for Detection of Organic and Inorganic Analytes in the Air; and Quantum-Inspired Maximizer.

Source record↗
DOE OSTI2023

Convergence of Hyperbolic Neural Networks Under Riemannian Stochastic Gradient Descent

Abstract We prove, under mild conditions, the convergence of a Riemannian gradient descent method for a hyperbolic neural network regression model, both in batch gradient descent and stochastic gradient descent. We also discuss a Riemannian version of the Adam algorithm. We show numerical simulations of these algorithms on various benchmarks.

Whiting, Wes (ORCID:0000000247505060)↗
DOE OSTI2022

Post-Disaster Microgrid Formation for Enhanced Distribution System Resilience

This paper proposes a deep reinforcement learning (DRL) based approach for post-disaster critical load restoration in active distribution systems to form microgrids through network reconfiguration to minimize critical load curtailments. Distribution networks are represented as graph networks, and optimal network configurations with microgrids are obtained by searching for the optimal spanning forest. The constraints to the research question being explored are the radial topology and power balance. Unlike existing analytical and population-based approaches, which necessitate the repetition of entire analyses and computation for each outage scenario to find the optimal spanning forest, the proposed approach, once properly trained, can quickly determine the optimal, or near-optimal, spanning forest even when outage scenarios change. When multiple lines fail in the system, the proposed approach forms microgrids with distributed energy resources in active distribution systems to reduce critical load curtailment. The proposed DRL-based model learns the action-value function using the REINFORCE algorithm, which is a model-free reinforcement learning technique based on stochastic policy gradients. A case study was conducted on a 33-node distribution test system, demonstrating the effectiveness of the proposed approach for post-disaster critical load restoration.

active distribution systems↗
DOE OSTI2020

Potential Impacts of Assimilating All-sky Satellite Infrared Radiances on Convection-Permitting Analysis and Prediction of Tropical Convection

Geostationary infrared satellite observations are spatially dense [< 1/(20 km)2] and temporally frequent (< 1/hour). These suggest the possibility of using these observations to constrain sub-synoptic features over data sparse regions, such as tropical oceans. In this study, the potential impacts of assimilating water vapor channel brightness temperature (WV-BT) observations from the geostationary Meteorological Satellite 7 (Meteosat-7) on tropical convection analysis and prediction were systematically examined through a series of ensemble data assimilation experiments. WV-BT observations were assimilated hourly into convection-permitting ensembles using Penn State’s ensemble square root filter (EnSRF). Comparisons against independently observed Meteosat-7 window channel brightness temperature (Window-BT) show that the assimilation of WV-BT generally improved the intensities and locations of large-scale cloud patterns at spatial scales larger than 100 km. However, comparisons against independent soundings indicate that the EnSRF analysis produced a much stronger dry bias than the no data assimilation experiment. This strong dry bias is associated with the use of the simulated WV-BT from the prior mean during the EnSRF analysis step. A stochastic variant of the ensemble Kalman filter (NoMeanSF) is proposed. The NoMeanSF algorithm was able to assimilate the WV-BT without causing such a strong dry bias and the quality of the analyses’ horizontal cloud pattern is similar to EnSRF’s analyses. Finally, deterministic forecasts initiated from the NoMeanSF analyses possess better horizontal cloud patterns above 500 km than those of the EnSRF. These results suggest that it might be better to assimilate all-sky WV-BT through the NoMeanSF algorithm than EnSRF algorithm.

Chan, Man-Yau↗
DOE OSTI2022

Quantum computing in power systems

Electric power systems provide the backbone of modern industrial societies. Enabling scalable grid analytics is the keystone to successfully operating large transmission and distribution systems. However, today's power systems are suffering from ever-increasing computational burdens in sustaining the expanding communities and deep integration of renewable energy resources, as well as managing huge volumes of data accordingly. These unprecedented challenges call for transformative analytics to support the resilient operations of power systems. Recently, the explosive growth of quantum computing techniques has ignited new hopes of revolutionizing power system computations. Quantum computing harnesses quantum mechanisms to solve traditionally intractable computational problems, which may lead to ultra-scalable and efficient power grid analytics. This paper reviews the newly emerging application of quantum computing techniques in power systems. We present a comprehensive overview of existing quantum-engineered power analytics from different operation perspectives, including static analysis, transient analysis, stochastic analysis, optimization, stability, and control. We thoroughly discuss the related quantum algorithms, their benefits and limitations, hardware implementations, and recommended practices. We also review the quantum networking techniques to ensure secure communication of power systems in the quantum era. Finally, we discuss challenges and future research directions. This paper will hopefully stimulate increasing attention to the development of quantum-engineered smart grids.

24 POWER TRANSMISSION AND DISTRIBUTION↗