Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimization 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 1,423 records · Page 79
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Graph-based modeling and simulation of complex systems

We present graph-based modeling abstractions to represent cyber-physical dependencies arising in complex systems. Specifically, we propose an algebraic graph abstraction to capture physical connectivity in complex optimization models and a computing graph abstraction to capture communication connectivity in computing architectures. The proposed abstractions are scalable and are used as the backbone of a Julia-based software package that we call Plasmo.j1. Here, we show how the algebraic graph abstraction facilitates the implementation, analysis, and decomposition of optimization problems and we show how the computing graph abstraction facilitates the implementation of optimization and control algorithms and their simulation in virtual environments that involve distributed, centralized, and hierarchical computing architectures.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Quantifying uncertainty for deep learning based forecasting and flow-reconstruction using neural architecture search ensembles

Classical problems in computational physics such as data-driven forecasting and signal reconstruction from sparse sensors have recently seen an explosion in deep neural network (DNN) based algorithmic approaches. However, most DNN models do not provide uncertainty estimates, which are crucial for establishing the trustworthiness of these techniques in downstream decision making tasks and scenarios. In recent years, ensemble-based methods have achieved significant success for the uncertainty quantification in DNNs on a number of benchmark problems. However, their performance on real-world applications remains under-explored. In this work, we present an automated approach to DNN discovery and demonstrate how this may also be utilized for ensemble-based uncertainty quantification. Specifically, we propose the use of a scalable neural and hyperparameter architecture search for discovering an ensemble of DNN models for complex dynamical systems. We highlight how the proposed method not only discovers high-performing neural network ensembles for our tasks, but also quantifies uncertainty seamlessly. This is achieved by using genetic algorithms and Bayesian optimization for sampling the search space of neural network architectures and hyperparameters. Subsequently, a model selection approach is used to identify candidate models for an ensemble set construction. Afterwards, a variance decomposition approach is used to estimate the uncertainty of the predictions from the ensemble. We demonstrate the feasibility of this framework for two tasks — forecasting from historical data and flow reconstruction from sparse sensors for the sea-surface temperature. In conclusion, we demonstrate superior performance from the ensemble in contrast with individual high-performing models and other benchmarks.

Deep ensembles↗
DOE OSTI2018

Excitonic Energy Landscape of the Y16F Mutant of the Chlorobium tepidum Fenna–Matthews–Olson (FMO) Complex: High Resolution Spectroscopic and Modeling Studies

We report high-resolution (low-temperature) absorption, emission, and nonresonant/resonant hole-burned (HB) spectra and results of excitonic calculations using a non-Markovian reduced density matrix theory (with an improved algorithm for parameter optimization in heterogeneous samples) obtained for the Y16F mutant of the Fenna–Matthews–Olson (FMO) trimer from the green sulfur bacterium Chlorobium tepidum. We show that the Y16F mutant is a mixture of FMO complexes with three independent low-energy traps (located near 817, 821, and 826 nm), in agreement with measured composite emission and HB spectra. Two of these traps belong to mutated FMO subpopulations characterized by significantly modified low-energy excitonic states. Hamiltonians for the two major subpopulations (Sub 821 and Sub 817 ) provide new insight into extensive changes induced by the single-point mutation in the vicinity of BChl 3 (where tyrosine Y16 was replaced with phenylalanine F16). The average decay time(s) from the higher exciton state(s) in the Y16F mutant depends on frequency and occurs on a picosecond time scale.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Revealing the Crystalline Architecture of Semicrystalline Ion Exchange Membranes for the Design of Conductive and Durable Alkaline Anion Exchange Membranes

Alkaline anion exchange membrane (AAEM) fuel cells offer a cost-effective alternative to proton exchange membrane (PEM) fuel cells by eliminating the need for expensive precious metal catalysts. In both PEMs and AAEMs, semicrystalline polymers are a common choice, as the crystalline domains can act as mechanical reinforcements that limit swelling and promote mechanical durability in the material. However, spatially resolved characterization of crystalline organization in ion exchange membranes beyond ensemble-averaged X-ray scattering is underrepresented, likely in part due to ionization damage limitations in soft materials. Here, in this study, we resolve the nanometer-size crystallites in semicrystalline ion exchange membranes by applying cryogenic four-dimensional scanning transmission electron microscopy (cryo-4D-STEM) along with data-processing algorithms designed to optimize signals at a low dose to minimize radiation damage. We investigate the effects of synthesis components, including molecular weight and thermal treatment, on a model system of AAEMs in comparison to Nafion, the most commonly used and commercially successful PEM today. We find that excess water uptake in polymer membranes, a property directly associated with weak mechanical durability and with possible negative impacts on ion conductivity, can be reduced by over 30% by varying the polymer's crystalline morphology through changes in synthesis parameters such as molecular weight and thermal history. Our results indicate that this improvement is correlated with smaller crystalline domains with a more homogeneous distribution. More broadly, these results demonstrate how the crystalline architecture of polymer membranes can be tuned through their chemistry and thermal treatment in order to improve their conductivity and durability for commercial fuel cell performance.

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

A compact tunable quadrupole lens for brighter and sharper ultra-fast electron diffraction imaging

In this article, we report our proof-of-principle design and experimental commissioning of a broadly tunable and low-cost transverse focusing lens system for MeV-energy electron beams. The lens system based on electromagnetic (EM) quadrupoles has been built as a part of the existing instrument for ultra-fast electron diffraction (UED) experiments at the Accelerator Test Facility II (ATF-II) at Brookhaven National Laboratory (BNL). We experimentally demonstrated the independent control of the size and divergence of the beam with the charge ranging from 1 to 13 pC. The charge density and divergence of the beam at the sample are the most important factors determining the quality of the Bragg-diffraction image (BDI). By applying the Robust Conjugate Directional Search (RCDS) algorithm for online optimization of the quadrupoles, the transverse beam size can be kept constant down to 75 µm from 1 to 13 pC. The charge density is nearly two orders of magnitude higher than the previously achieved value using a conventional solenoid. Using the BDI method we were able to extract the divergence of the beam in real-time and apply it to the emittance measurement for the first time. Our results agree well with simulations and with the traditional quadrupole scan method. The real-time divergence measurement opens the possibility of online optimization of the beam divergence (< 0.2 mrad) at the sample with the increased beam charge. This optimization is crucial for the future development of single-shot ultra-fast electron microscope (UEM). Finally, we demonstrated BDI with significant improvement, up to 3 times higher peak intensity and 2 times sharper Bragg-diffraction peaks at 13 pC. The charge is now limited by the laser power and increasing charge may improve the quality of BDI further. The capability we demonstrated here provides us with opportunities for new sciences using near-parallel, bright and ultrafast electron beams for single-shot imaging, to directly visualize the dynamics of defects and nanostructured materials, or even record molecular movie, which are impossible using present electron-beam technologies.

43 PARTICLE ACCELERATORS↗
DOE OSTI2021

Anisotropic colloidal interactions & assembly in AC electric fields

In this work, we match experimental and simulated configurations of anisotropic epoxy colloidal particles in high frequency AC electric fields by identifying analytical potentials for dipole-field and dipole-dipole interactions. We report an inverse Monte Carlo simulation algorithm to determine optimal fits of analytical potentials by matching simulated and experimental distribution functions for non-uniform liquid, liquid crystal, and crystal microstructures in varying amplitude electric fields. Two potentials that include accurate particle volume and dimensions along with a concentration dependent prefactor quantitatively capture experimental observations. At low concentrations, an effective ellipsoidal point dipole potential works well, whereas a novel stretched point dipole potential is found to be suitable at all concentrations, field amplitudes, and degrees of ordering. The simplicity, accuracy, and adjustability of the stretched point dipole potential suggest it can be applied to model field mediated microstructures and assembly of systematically varying anisotropic particle shapes.

42 ENGINEERING↗
DOE OSTI2021

Evolutionary inverse design of defects at graphene 2D lateral interfaces

Grain boundaries (GBs) in two-dimensional (2D) materials often have a profound impact on various material properties from mechanical to optical to electronic, yet predicting all possible GB formations is a challenge. Here, we introduce a workflow based on an evolutionary algorithm for exploring possible GBs formed at a lateral 2D interface. In a departure from conventional genetic algorithm based structure optimization methods, we perform genetic operations in the near interface region that allow us to be computationally efficient. We benchmark our method using graphene, which is a well-studied 2D material with a wide range of point defects. An empirical potential was used as the surrogate of the evolutionary search. More than 11.5 × 106 structures in total were evaluated for 128 GB orientations, and for each orientation, the ten best structures are recorded. A subset of low energy GBs predicted by empirical potential based search was relaxed by first-principles calculations and used to validate the energetic rank order. With the validated formation energy, we rank-ordered the best 128 GB structures and performed a detailed statistical analysis of primitive rings to find the correlation between the ring distribution and the formation energy. We found that for low energy GBs (below 0.5eV/Å), Stone–Wales defects will dominate, while structures with a higher energy (0.5–1.1eV/Å) show an increasing population of heptagons and nine-membered rings to form seven-nine defect pairs. For structures with energy higher than 1.1eV/Å, the percentage of octagons and nine-membered rings increases, which indicates that these two types of rings are not energetically favorable. Our proposed methodology is broadly applicable to explore defective low dimensional materials and represents a powerful tool that enables a systematic search of GBs of lateral interfaces for 2D materials.

Zhang, Jianan↗
DOE OSTI2020

A semi-supervised machine learning detector for physics events in tokamak discharges

Databases of physics events have been used in various fusion research applications, including the development of scaling laws and disruption avoidance algorithms, yet they can be time-consuming and tedious to construct. This paper presents a novel application of the label spreading semi-supervised learning algorithm to accelerate this process by detecting distinct events in a large dataset of discharges, given few manually labeled examples. A high detection accuracy (> 85%) for H-L back transitions and initially rotating locked modes is demonstrated on a dataset of hundreds of discharges from DIII-D with manually identified events for which only 3 discharges are initially labeled by the user. Lower yet reasonable performance (~75%) is also demonstrated for the core radiative collapse, an event with a much lower prevalence in the dataset. Additionally, analysis of the performance sensitivity indicates that the same set of algorithmic parameters is optimal for each event. Furthermore, this suggests that the method can be applied to detect a variety of other events not included in this paper, given that the event is well described by a set of 0D signals robustly available on many discharges. Procedures for analysis of new events are demonstrated, showing automatic event detection with increasing fidelity as the user strategically adds manually labeled examples. Detections on Alcator C-Mod and EAST are also shown, demonstrating the potential for this to be used on a multi-tokamak dataset.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2017

Application and performance of an ML-EM algorithm in NEXT

The goal of the NEXT experiment is the observation of neutrinoless double beta decay in (136)Xe using a gaseous xenon TPC with electroluminescent amplification and specialized photodetector arrays for calorimetry and tracking. The NEXT Collaboration is exploring a number of reconstruction algorithms to exploit the full potential of the detector. This paper describes one of them: the Maximum Likelihood Expectation Maximization (ML-EM) method, a generic iterative algorithm to find maximum-likelihood estimates of parameters that has been applied to solve many different types of complex inverse problems. In particular, we discuss a bi-dimensional version of the method in which the photosensor signals integrated over time are used to reconstruct a transverse projection of the event. First results show that, when applied to detector simulation data, the algorithm achieves nearly optimal energy resolution (better than 0.5% FWHM at the Q value of (136)Xe) for events distributed over the full active volume of the TPC.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2020

Automated detector simulation and reconstruction parametrization using machine learning

Rapidly applying the effects of detector response to physics objects (e.g. electrons, muons, showers of particles) is essential in high energy physics. Presently available tools for the transformation from truth-level physics objects to reconstructed detector-level physics objects involve manually defining resolution functions. These resolution functions are typically derived in bins of variables that are correlated with the resolution (e.g. pseudorapidity and transverse momentum). This process is time consuming, requires manual updates when detector conditions change, and can miss important correlations. Machine learning offers a way to automate the process of building these truth-to-reconstructed object transformations and can capture complex correlation for any given set of input variables. Such machine learning algorithms, with sufficient optimization, could have a wide range of applications: improving phenomenological studies by using a better detector representation, allowing for more efficient production of Geant4 simulation by only simulating events within an interesting part of phase space, and studies on future experimental sensitivity to new physics.

47 OTHER INSTRUMENTATION↗
DOE OSTI2020

Short-depth circuits for efficient expectation-value estimation

The evaluation of expectation values Tr[$\rho \mathcal{O}$] for some pure state $\rho$ and Hermitian operator $\mathcal{O}$ is of central importance in a variety of quantum algorithms. Near-optimal techniques have been developed in the past and require a number of measurements N approaching the Heisenberg limit N = O(1/ ε) as a function of target accuracy ε. The use of quantum phase estimation (QPE) requires, however, long circuit depths C = O(1/ ε) making its implementation difficult on near-term noisy devices. The more direct strategy of operator averaging is usually preferred as it can be performed using N = O(1/ε 2 ) measurements and no additional gates aside from those needed for the state preparation. In this work we use a simple but realistic model to describe the bound state of a neutron and a proton (the deuteron) to show that the latter strategy can require an overly large number of measurements in order to achieve a prefixed relative target accuracy ε r . Further, we propose to overcome this problem using a single step of QPE and classical postprocessing. This approach leads to a circuit depth C = O (ε μ ) (with μ ≥ 0) and to a number of measurements N = O (1/ε 2 + ν ) for 0 < ν ≤ 1 and a much smaller prefactor. We provide detailed descriptions of two implementations of our strategy for ν = 1 and ν ≈ 0.5 and derive appropriate conditions that a particular problem instance has to satisfy in order for our method to provide an advantage.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Local chromatic correction optics for Future Circular Collider e + e −

Local chromatic correction optics are proposed for the Future Circular e + − e − Collider. These new optics assume an identical layout of the magnets at all operation energies and include a new design for the arcs, for the straight sections, and for the final focus. The arcs design is a step forward from the classic FODO lattice that achieves near cancellation up to the fourth order of chromatic and geometric aberrations. Straight sections and the final focus benefit from the application of transparency conditions and are thus minimally impacting the global beam dynamics. The final focus design includes both vertical and horizontal chromaticity correction sections, crab sextupoles, and additional specific sextupoles and decapoles for the optimization of the dynamics off-energy. Decapoles are very effective in mitigating the reduction of dynamic aperture due to synchrotron radiation. Nonlinear magnet settings are further optimized with multiobjective algorithms. The overall properties of the new optics proposed are analyzed in the presence of errors and compared to other optics designs.

43 PARTICLE ACCELERATORS↗
DOE OSTI2026

Active learning emulators for nuclear two-body scattering in momentum space

In this work we extend the active learning emulators for two-body scattering in coordinate space with error estimation, recently developed by Maldonado et al. [Phys. Rev. C 112, 024002], to coupled-channel scattering in momentum space. Our full-order model (FOM) solver is based on the Lippmann-Schwinger integral equation for the scattering t-matrix as opposed to the radial Schrödinger equation. We use (Petrov-)Galerkin projections and high-fidelity calculations at a few snapshots across the parameter space of the interaction to construct efficient reduced-order models (ROMs), trained by a greedy algorithm for locally optimal snapshot selection. Both the FOM solver and the corresponding ROMs are implemented efficiently in Python using Google's JAX library. We present results for emulating scattering phase shifts in coupled and uncoupled channels and cross sections, and assess the accuracy of the developed ROMs and their computational speedup factors. We also develop emulator error estimation for both the t-matrix and the total cross section. The software framework for reproducing and extending our results is publicly available. Together with our recent advances in developing active-learning emulators for three-body scattering, these emulator frameworks set the stage for full Bayesian calibrations of chiral nuclear interactions and optical models against scattering data with quantified emulator errors.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Massive compression for high data rate macromolecular crystallography (HDRMX): impact on diffraction data and subsequent structural analysis

New higher-count-rate, integrating, large-area X-ray detectors with framing rates as high as 17400 images per second are beginning to be available. These will soon be used for specialized macromolecular crystallography experiments but will require optimal lossy compression algorithms to enable systems to keep up with data throughput. Some information may be lost. Can we minimize this loss with acceptable impact on structural information? To explore this question, we have considered several approaches: summing short sequences of images, binning to create the effect of larger pixels, use of JPEG-2000 lossy wavelet-based compression, and use of Hcompress, which is a Haar-wavelet-based lossy compression borrowed from astronomy. We also explore the effect of the combination of summing, binning, and Hcompress or JPEG-2000. In each of these last two methods one can specify approximately how much one wants the result to be compressed from the starting file size. These provide particularly effective lossy compressions that retain essential information for structure solution from Bragg reflections.

47 OTHER INSTRUMENTATION↗
DOE OSTI2021

Scaling Out a Combinatorial Algorithm for Discovering Carcinogenic Gene Combinations to Thousands of GPUs

Cancer is a leading cause of death in the US, second only to heart disease. It is primarily a result of a combination of an estimated two-nine genetic mutations (multi-hit combinations). Although a body of research has identified hundreds of cancer-causing genetic mutations, we don’t know the specific combination of mutations responsible for specific instances of cancer for most cancer types. An approximate algorithm for solving the weighted set cover problem was previously adapted to identify combinations of genes with mutations that may be responsible for individual instances of cancer. However, the algorithm’s computational requirement scales exponentially with the number of genes, making it impractical for identifying more than three-hit combinations, even after the algorithm was parallelized and scaled up to a V100 GPU. Since most cancers have been estimated to require more than three hits, we scaled out the algorithm to identify combinations of four or more hits using 1000 nodes (6000 V100 GPUs with ≈48×106 processing cores) on the Summit supercomputer at Oak Ridge National Laboratory. Efficiently scaling out the algorithm required a series of algorithmic innovations and optimizations for balancing an exponentially divergent workload across processors and for minimizing memory latency and inter-node communication. We achieved an average strong scaling efficiency of 90.14% (80.96%–97.96% for 200 to 1000 nodes), compared to a 100 node run, with 84.18% scaling efficiency for 1000 nodes. With experimental validation, the multi-hit combinations identified here could provide further insight into the etiology of different cancer subtypes and provide a rational basis for targeted combination therapy.

Dash, Sajal↗
DOE OSTI2026

An Adaptive Multiparameter Penalty Selection Method for Multiconstraint and Multiblock ADMM

This work presents a new method for online selection of multiple penalty parameters for the alternating direction method of multipliers (ADMM) algorithm applied to optimization problems with multiple constraints or functions with block matrix components. ADMM is widely used for solving constrained optimization problems in a variety of fields, including signal and image processing. Implementations of ADMM often utilize a single hyperparameter, referred to as the penalty parameter, which needs to be tuned to control the rate of convergence. However, in problems with multiple constraints, ADMM may demonstrate slow convergence regardless of penalty parameter selection due to scale differences between constraints. Accounting for scale differences between constraints to improve convergence in these cases requires introducing a penalty parameter for each constraint. The proposed method is able to adaptively account for differences in scale between constraints, providing robustness with respect to problem transformations and initial selection of penalty parameters. It is also simple to understand and implement. Our numerical experiments demonstrate that the proposed method performs favorably compared to a variety of existing penalty parameter selection methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Probabilistic Wind Power Ramp Forecasting Based on a Scenario Generation Method

Wind power ramps (WPRs) are particularly important in the management and dispatch of wind power and currently drawing the attention of balancing authorities. With the aim to reduce the impact of WPRs for power system operations, this paper develops a probabilistic ramp forecasting method based on a large number of simulated scenarios. An ensemble machine learning technique is first adopted to forecast the basic wind power forecasting scenario and calculate the historical forecasting errors. A continuous Gaussian mixture model (GMM) is used to fit the probability distribution function (PDF) of forecasting errors. The cumulative distribution function (CDF) is analytically deduced. The inverse transform method based on Monte Carlo sampling and the CDF is used to generate a massive number of forecasting error scenarios. An optimized swinging door algorithm is adopted to extract all the WPRs from the complete set of wind power forecasting scenarios. The probabilistic forecasting results of ramp duration and start-time are generated based on all scenarios. Numerical simulations on publicly available wind power data show that within a predefined tolerance level, the developed probabilistic wind power ramp forecasting method is able to predict WPRs with a high level of sharpness and accuracy.

17 WIND ENERGY↗
DOE OSTI2020

Distributed Intrusion Detection System using Semantic-based Rules for SCADA in Smart Grid

Cyber-physical system (CPS) security for the smart grid enables secure communication for the SCADA and wide-area measurement system data. Power utilities world-wide use various SCADA protocols, namely DNP3, Modbus, and IEC 61850, for the data exchanges across substation field devices, remote terminal units (RTUs), and control center applications. Adversaries may exploit compromised SCADA protocols for the reconnaissance, data exfiltration, vulnerability assessment, and injection of stealthy cyberattacks to affect power system operation. In this paper, we propose an efficient algorithm to generate robust rule sets. We integrate the rule sets into an intrusion detection system (IDS), which continuously monitors the DNP3 data traffic at a substation network and detects intrusions and anomalies in real-time. To enable CPS-aware wide-area situational awareness, we integrated the methodology into an open-source distributed-IDS (D-IDS) framework. The D-IDS facilitates central monitoring of the detected anomalies from the geographically distributed substations and to the control center. The proposed algorithm provides an optimal solution to detect network intrusions and abnormal behavior. Different types of IDS rules based on packet payload, packet flow, and time threshold are generated. Further, IDS testing and evaluation is performed with a set of rules in different sequences. The detection time is measured for different IDS rules, and the results are plotted. All the experiments are conducted at Power Cyber Lab, Iowa State University, for multiple power grid models. After successful testing and evaluation, knowledge and implementation are transferred to field deployment.

24 POWER TRANSMISSION AND DISTRIBUTION↗