Search NASA⌕ Search

SEARCH · Search NASA

Results for “lookup”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Efficient verification of anticoncentrated quantum states

I present a method for estimating the fidelity F(μ, τ) between a preparable quantum state μ and a classically specified pure target state τ=|τ> <τ|, using simple quantum circuits and on-the-fly classical calculation (or lookup) of selected amplitudes of |τ>. The method is sample efficient for anticoncentrated states (including many states that are hard to simulate classically), with approximate cost 4ϵ –2 (1 – F)dpcoll where ϵ is the desired precision of the estimate, d is the dimension of the Hilbert space, and pcoll is the collision probability of the target distribution. Furthermore, this scaling is exponentially better than that of any method based on classical sampling. I also present a more sophisticated version of the method that uses any efficiently preparable and well-characterized quantum state as an importance sampler to further reduce the number of copies of μ needed. Though some challenges remain, this work takes a significant step toward scalable verification of complex states produced by quantum processors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Proof-of-concept of a reinforcement learning framework for wind farm energy capture maximization in time-varying wind

Here, we present a proof-of-concept distributed reinforcement learning framework for wind farm energy capture maximization. The algorithm we propose uses Q-Learning in a wake-delayed wind farm environment and considers time-varying, though not yet fully turbulent, wind inflow conditions. These algorithm modifications are used to create the Gradient Approximation with Reinforcement Learning and Incremental Comparison (GARLIC) framework for optimizing wind farm energy capture in time-varying conditions, which is then compared to the FLOw Redirection and Induction in Steady State (FLORIS) static lookup table wind farm controller baseline.

17 WIND ENERGY↗
DOE OSTI2021

A domain wall-magnetic tunnel junction artificial synapse with notched geometry for accurate and efficient training of deep neural networks

Inspired by the parallelism and efficiency of the brain, several candidates for artificial synapse devices have been developed for neuromorphic computing, yet a nonlinear and asymmetric synaptic response curve precludes their use for backpropagation, the foundation of modern supervised learning. Spintronic devices—which benefit from high endurance, low power consumption, low latency, and CMOS compatibility—are a promising technology for memory, and domain-wall magnetic tunnel junction (DW-MTJ) devices have been shown to implement synaptic functions such as long-term potentiation and spike-timing dependent plasticity. In this work, we propose a notched DW-MTJ synapse as a candidate for supervised learning. Using micromagnetic simulations at room temperature, we show that notched synapses ensure the non-volatility of the synaptic weight and allow for highly linear, symmetric, and reproducible weight updates using either spin transfer torque (STT) or spin–orbit torque (SOT) mechanisms of DW propagation. We use lookup tables constructed from micromagnetics simulations to model the training of neural networks built with DW-MTJ synapses on both the MNIST and Fashion-MNIST image classification tasks. Accounting for thermal noise and realistic process variations, the DW-MTJ devices achieve classification accuracy close to ideal floating-point updates using both STT and SOT devices at room temperature and at 400 K. Our work establishes the basis for a magnetic artificial synapse that can eventually lead to hardware neural networks with fully spintronic matrix operations implementing machine learning.

42 ENGINEERING↗
DOE OSTI2023

Sensitivity Analysis of Transient Critical Heat Flux by RIA Under High-Pressure Flow Boiling Conditions in TRTL

A reactivity-initiated accident (RIA) is a design-basis accident under which critical heat flux (CHF) is likely to be exceeded. The operational margin for RIAs is currently determined using steady-state CHF lookup tables, which provide conservative estimates relative to transient CHF phenomena. The Transient Reactor Test Loop (TRTL) facility at Oregon State University is capable of performing out-of-pile rapid heating experiments representative of a RIA at conditions representative of a pressurized water reactor (PWR). Here, to further our understanding of and ability to predict transient CHF under PWR conditions, we performed a sensitivity analysis on a RELAP5-3D model of the TRTL facility coupled to the RAVEN code framework to define a proposed experimental test matrix to be performed at the TRTL facility. We then implemented a flow boiling CHF correlation into RELAP5-3D and performed a secondary sensitivity analysis inspecting the impact of the built-in RELAP5-3D CHF and heat transfer multipliers on both the prediction of CHF and key safety parameters, such as peak cladding temperature and heat flux. The results show that the multiplier with the highest influence toward the prediction of CHF occurrence and the safety parameters is the transient CHF multiplier. Operational performance envelopes have been developed for each of the test matrix cases and will be used for validation once the experiments are performed. The TRTL facility is currently performing shakedown testing to verify system performance prior to proceeding with the experimental campaign. Restart testing results include pump curve restart testing, pressure tests, and heater rod thermocouple transients.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2024

Overlooked cooling effects of albedo in terrestrial ecosystems

Radiative forcing (RF) resulting from changes in surface albedo is increasingly recognized as a significant driver of global climate change but has not been adequately estimated, including by Intergovernmental Panel on Climate Change (IPCC) assessment reports, compared with other warming agents. Here, we first present the physical foundation for modeling albedo-induced RF and the consequent global warming impact (GWI Δα ). We then highlight the shortcomings of available current databases and methodologies for calculating GWI Δα at multiple temporal scales. There is a clear lack of comprehensive in situ measurements of albedo due to sparse geographic coverage of ground-based stations, whereas estimates from satellites suffer from biases due to the limited frequency of image collection, and estimates from earth system models (ESMs) suffer from very coarse spatial resolution land cover maps and associated albedo values in pre-determined lookup tables. Field measurements of albedo show large differences by ecosystem type and large diurnal and seasonal changes. As indicated from our findings in southwest Michigan, GWI Δα is substantial, exceeding the RF Δα values of IPCC reports. Inclusion of GWI Δα to landowners and carbon credit markets for specific management practices are needed in future policies. We further identify four pressing research priorities: developing a comprehensive albedo database, pinpointing accurate reference sites within managed landscapes, refining algorithms for remote sensing of albedo by integrating geostationary and other orbital satellites, and integrating the GWI Δα component into future ESMs.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Emulation of seismic-phase traveltimes with machine learning

SUMMARY We present a machine learning (ML) method for emulating seismic-phase traveltimes that are computed using a global-scale 3-D earth model and physics-based ray tracing. Accurate traveltime predictions based on 3-D earth models are known to reduce the bias of event location estimates, increase our ability to assign phase labels to seismic detections and associate detections to events. However, practical use of 3-D models is challenged by slow computational speed and the unwieldiness of pre-computed lookup tables that are often large and have prescribed computational grids. In this work, we train a ML emulator using pre-computed traveltimes, resulting in a compact and computationally fast way to approximate traveltimes that are based on a 3-D earth model. Our model is trained using approximately 850 million P-wave traveltimes that are based on the global LLNL-G3D-JPS model, which was developed for more accurate event location. The training-set consists of traveltimes between 10 393 global seismic stations and randomly sampled event locations that provide a prescribed, distance-dependent geographic sample density for each station. Prediction accuracy is dependent on event-station distance and whether the station was included in the training set. For stations included in the training set the mean absolute deviation (MAD) of the difference between traveltimes computed using ray tracing through the 3-D model and the ML emulator for local, regional, and teleseismic distances are 0.090, 0.125 and 0.121 s, respectively. For tested station locations not included in the training set, MAD values for the three distance ranges increase to 0.173, 0.219 and 0.210 s, respectively. Empirical traveltime residuals for a global reference data are indistinguishable when ML emulation or the 3-D model is used to compute traveltimes. This result holds regardless of whether the recording station is used in ML training or not.

58 GEOSCIENCES↗
DOE OSTI2023

Addition of tabulated equation of state and neutrino leakage support to illinoisgrmhd

Here we have added support for realistic, microphysical, finite-temperature equations of state (EOS) and neutrino physics via a leakage scheme to illinoisgrmhd, an open-source GRMHD code for dynamical spacetimes in the einstein toolkit. These new features are provided by two new, nrpy+-based codes: nrpyeos, which performs highly efficient EOS table lookups and interpolations, and nrpyleakage, which implements a new, adaptive mesh refinement (AMR)-capable neutrino leakage scheme in the einstein toolkit. We have performed a series of strenuous validation tests that demonstrate the robustness of these new codes, particularly on the Cartesian AMR grids provided by carpet. Furthermore, we show results from fully dynamical GRMHD simulations of single unmagnetized neutron stars, and magnetized binary neutron star mergers. This new version of illinoisgrmhd, as well as nrpyeos and nrpyleakage, is pedagogically documented in jupyter notebooks and fully open source. The codes will be proposed for inclusion in an upcoming version of the einstein toolkit.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Interaction models and configurational entropies of binary MoTa and the MoNbTaW high entropy alloy

We introduce a simplified method to model the interatomic interactions of high entropy alloys based on a lookup table of cluster energies. Furthermore, these interactions are employed in replica exchange Monte Carlo simulations with histogram analysis to obtain thermodynamic properties across a broad temperature range. Kikuchi's cluster variation method entropy formalism is applied to directly calculate entropy from statistics on short- and long-range chemical order, and we discuss the convergence of the entropy as clusters of differing size are included. A high temperature series expansion aids in our understanding of the convergence. Computer codes implementing these methods, and supporting data, are freely available on the internet.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Genetic Algorithm-Based Commutation Angle Control for Torque Ripple Mitigation in Switched Reluctance Motor Drives

This work addresses the application of the Genetic Algorithm (GA) technique to optimize the commutation angles of a 2 kW 8/6 switched reluctance machine (SRM). The primary goal is to reduce the well-known drawback of SRMs: the torque ripple. Firstly, the machine was modeled in Matlab /Simulink ® using lookup tables obtained via finite element method (FEM) simulations. Subsequently, the model was used to perform the GA routine aiming to find the optimal phase commutation angles that minimize the torque ripple factor. Notably, the torque performance of the SRM was significantly affected by the commutation angles during the search for the optimal solution. Afterwards, the GA results for four different operation points were verified experimentally through a developed drive platform with digital signal processor-based (DSP) control and an asymmetric bridge converter. As showed by the experiments, the proposed approach was suitable to reduce the torque ripple by more than 50% for one of the evaluated operating points. Furthermore, it was confirmed that the torque ripple mitigation led to acoustic noise improvement.

42 ENGINEERING↗
DOE OSTI2024

Fail-Safe Logic Design Strategies Within Modern FPGA Architectures

Fail-safe computing refers to computing systems that revert to a non-operational safe state when a fault occurs. In this paper, we investigate a circuit level technique as mitigation for single event upsets (SEUs) and fault injection attacks on field programmable gate arrays (FPGAs), and analyze the effectiveness of the technique as a fail-safe monitor for an encryption algorithm. The propagation of fault effects through FPGA primitives including lookup tables (LUTs) and programmable interconnect points (PIPs) is assessed within an FPGA architecture created using an open source tool, and validated using fault injection experiments on an FPGA. The analysis reveals additional vulnerabilities exist within reconfigurable architectures over those in equivalent fail-safe application specific integrated circuit (ASIC), thus requiring a more elaborate network of redundant circuits and checking logic. The configuration memory bits (CMBs), which configure routing and designate logic functions within the LUTs of the FPGA, add complexity to fail-safe design strategies by introducing additional fault conditions and fault propagation paths. A resource-efficient fail-safe circuit design technique called DEsign for Fail-safe in reCONfigurable systems (DEFCON) is proposed. The benefits and limitations associated with DEFCON are described in the context of fault injection experiments carried out as simulations and in FPGA hardware.

Bhakta, Priya A. [Univ. of New Mexico, Albuquerque↗
DOE OSTI2022

Hvac: Removing I/O Bottleneck for Large-Scale Deep Learning Applications

Scientific communities are increasingly adopting deep learning (DL) models in their applications to accelerate scientific discovery processes. However, with rapid growth in the computing capabilities of HPC supercomputers, large-scale DL applications have to spend a significant portion of training time performing I/O to a parallel storage system. Previous research works have investigated optimization techniques such as prefetching and caching. Unfortunately, there exist non-trivial challenges to adopting the existing solutions on HPC supercomputers for large-scale DL training applications, which include non-performance and/or failures at extreme scale, lack of portability and generality in design, complex deployment methodology, and being limited to a specific application or dataset. To address these challenges, we propose High-Velocity AI Cache (HVAC), a distributed read-cache layer that targets and fully exploits the node-local storage or near node-local storage technology. HVAC seamlessly accelerates read I/O by aggregating node-local or near node-local storage, avoiding metadata lookups and file locking while preserving portability in the application code. We deploy and evaluate HVAC on 1,024 nodes (with over 6000 NVIDIA V100 GPUS) of the Summit supercomputer. In particular, we evaluate the scalability, efficiency, accuracy, and load distribution of HVAC compared to GPFS and XFS-on-NVMe. With four different DL applications, we observe an average 25 % performance improvement atop GPFS and 9% drop against XFS-on-NVMe, which scale linearly and are considered the performance upper bound. We envision HVAC as an important caching library for upcoming HPC supercomputers such as Frontier.

Khan, Awais↗
DOE OSTI2022

Optimal Coordination of Distributed Energy Resources Using Deep Deterministic Policy Gradient

Recent studies showed that reinforcement learning (RL) is a promising approach for coordination and control of distributed energy resources (DER) under uncertainties. Many existing RL approaches, including Q-learning and approximate dynamic programming, are based on lookup table methods, which become inefficient when the problem size is large and infeasible when continuous states and actions are involved. In addition, when modeling battery energy storage system (BESS), the loss of life is not reasonably considered into the decision-making process. This paper proposes an innovative deep RL method for DER coordination considering BESS degradation. The proposed deep RL is designed based on an adaptive actor-critic architecture and employs an off-policy deterministic policy gradient method for determining the dispatch operation that minimizes the operation cost and BESS life loss. Case studies were performed to validate the proposed method and demonstrate the effects of incorporating degradation models into control design.

Das, Avijit↗
DOE OSTI2024

Optimal Coordination of Electric Vehicles for Grid Services using Deep Reinforcement Learning

Recent research has shown the effectiveness of reinforcement learning (RL) in coordinating electric vehicles (EVs) with vehicle-to-grid capabilities for grid services. However, many of these studies rely on lookup table and deep Q-network techniques, which can be impractical when dealing with continuous states and actions. In addition, existing RL designs inadequately account for battery aging effects, EV user satisfaction, uncertain departure and arrival time, and trip distance, which may compromise effective coordination. This paper aims to bridge these gaps by developing an innovative deep deterministic policy gradient-based RL framework for optimal coordination of EVs. Case studies were carried out using a test system with 100 EVs, and numerical analysis results showed that the proposed RL framework can effectively coordinate EVs to maximize economic benefits and user satisfaction while ensuring the expected battery lifespan.

Das, Avijit↗
DOE OSTI2024

Side-by-Side Comparison of Subhourly Clipping Models

Over the past several years there have been numerous attempts at quantifying the inherent power clipping of inverters due to subhourly irradiance variability that is not captured in hourly PV performance models. Different models have been proposed to correct for these clipping losses in PV performance estimates, including matrix lookup models, distribution modeling of the PV power performance within a given hour, and machine learning methods. To date, there have been few comprehensive quantitative comparisons of these inverter clipping correction modeling approaches to evaluate the effectiveness of these approaches in predicting the actual behavior of PV system inverter clipping. In this study, we perform such a comparison, evaluating the Allen and Walker correction loss modeling approaches recently implemented in the System Advisor Model (SAM) against clipping losses modeled with 1-minute climate data. These comparisons were performed across a variety of climate locations and inverter loading ratios to thoroughly analyze the effectiveness of these modeling approaches relative to each other. Results from this analysis reveal that both clipping correction approaches improve annual energy accuracy to within 2% of 1-minute modeled energy yield. The two models predict annual clipping loss more accurately than simple hourly power limit clipping, with the Allen method typically being slightly more accurate at typical ILR values and the Walker method often being slightly more accurate at high ILR values The models can improve accuracy over the status quo clipping approach up to 3 percentage points in systems with ILR of 2.0, showing the importance of this modeling factor in energy yield estimates.

accuracy↗
DOE OSTI2022

Neural network accelerator for quantum control

Efficient quantum control is necessary for practical quantum computing implementations with current technologies. Conventional algorithms for determining optimal control parameters are computationally expensive, largely excluding them from use outside of the simulation. Existing hardware solutions structured as lookup tables are imprecise and costly. By designing a machine learning model to approximate the results of traditional tools, a more efficient method can be produced. Such a model can then be synthesized into a hardware accelerator for use in quantum systems. In this study, we demonstrate a machine learning algorithm for predicting optimal pulse parameters. This algorithm is lightweight enough to fit on a low-resource FPGA and perform inference with a latency of 175 ns and pipeline interval of 5 ns with > 0.99 gate fidelity. In the long term, such an accelerator could be used near quantum computing hardware where traditional computers cannot operate, enabling quantum control at a reasonable cost at low latencies without incurring large data bandwidths outside of the cryogenic environment.

43 PARTICLE ACCELERATORS↗
DOE OSTI2024

BCSR on GPU: A Way Forward Extreme-scale Graph Processing on Accelerator-enabled Frontier Supercomputer

Handling large graphs in a distributed environment requires effective partitioning across processors and efficient management of local partitions. In 2D partitioning, local graphs often become too sparse, making memory-efficient data structures crucial. Using the Compressed Sparse Row (CSR) format wastes space, especially for > 83% of vertices with empty edges for the sparse graphs. This study explores bit-CSR (BCSR), a modified CSR representation, on GPUs to reduce memory usage in graph computations. We achieved 16.67% memory savings on a sparse rmat dataset with 268 million vertices and 357 million edges, without performance degradation, supported by both theoretical and experimental storage savings of 33%. However, we observed a 1.7× slowdown in degree lookup times due to bitwise operations on AMD CPUs. This analysis highlights the potential of BCSR on GPUs for improving Graph500 benchmark performance on GPU-accelerated systems, such as the Frontier supercomputer.

Sattar, Naw Safrin↗
DOE OSTI2021

Qualification of 3-D Printed Mortar With Electrical Conductivity Measurements

Additive manufacturing (AM) or 3D printing of concrete allows for construction of arbitrary shape structures without a mold. Since reproducibility of 3D printed concrete is lower than that of conventional fabrication, each 3D printed structure should be monitored for proper curing. Conventional qualification of concrete is based on several tests, including destructive compressive strength measurements. Because a structure is 3-D printed layer-by-layer, the surfaces of AM concrete structures have significant surface roughness. This limits the applicability of conventional nondestructive testing methods. We investigated qualification of 3D printed mortar by monitoring curing with nondestructive electrical conductivity measurements. Bulk resistance of concrete was extracted from electrochemical impedance spectroscopy (EIS measurements made using custom flexible self-adhesive electrodes, which contour to rough surfaces. We show that bulk resistivity of concrete increases linearly with time. This allows for developing a calibration curve for compressive strength lookup from nondestructive electrical conductivity measurements. Conductivity measurements also allow for estimation of formation factor, which is an indicator of mortar permeability.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Performance Optimization for Relative-Error-Bounded Lossy Compression on Scientific Data

Scientific simulations in high-performance computing (HPC) environments generate vast volume of data, which may cause a severe I/O bottleneck at runtime and a huge burden on storage space for postanalysis. Unlike traditional data reduction schemes such as deduplication or lossless compression, not only can error-controlled lossy compression significantly reduce the data size but it also holds the promise to satisfy user demand on error control. Pointwise relative error bounds (i.e., compression errors depends on the data values) are widely used by many scientific applications with lossy compression since error control can adapt to the error bound in the dataset automatically. Pointwise relative-error-bounded compression is complicated and time consuming. In this article, we develop efficient precomputation-based mechanisms based on the SZ lossy compression framework. Our mechanisms can avoid costly logarithmic transformation and identify quantization factor values via a fast table lookup, greatly accelerating the relative-error-bounded compression with excellent compression ratios. In addition, we reduce traversing operations for Huffman decoding, significantly accelerating the decompression process in SZ. Experiments with eight well-known real-world scientific simulation datasets show that our solution can improve the compression and decompression rates (i.e., the speed) by about 40 and 80 p, respectively, in most of cases, making our designed lossy compression strategy the best-in-class solution in most cases.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗