Search NASA⌕ Search

SEARCH · Search NASA

Results for “performance data”

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,207 records · Page 67

Data decomposition of Monte Carlo particle transport simulations via tally servers

An algorithm for decomposing large tally data in Monte Carlo particle transport simulations is developed, analyzed, and implemented in a continuous-energy Monte Carlo code, OpenMC. The algorithm is based on a non-overlapping decomposition of compute nodes into tracking processors and tally servers. The former are used to simulate the movement of particles through the domain while the latter continuously receive and update tally data. A performance model for this approach is developed, suggesting that, for a range of parameters relevant to LWR analysis, the tally server algorithm should perform with minimal overhead on contemporary supercomputers. An implementation of the algorithm in OpenMC is then tested on the Intrepid and Titan supercomputers, supporting the key predictions of the model over a wide range of parameters. We thus conclude that the tally server algorithm is a successful approach to circumventing classical on-node memory constraints en route to unprecedentedly detailed Monte Carlo reactor simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Toward particle-resolved accuracy in Euler–Lagrange simulations of multiphase flow using machine learning and pairwise interaction extended point-particle (PIEP) approximation

This study presents two different machine learning approaches for the modeling of hydrodynamic force on particles in a particle-laden multiphase flow. Results from particle-resolved direct numerical simulations (PR-DNS) of flow over a random array of stationary particles for eight combinations of particle Reynolds number (Re) and volume fraction (φ) are used in the development of the models. The first approach follows a two-step process. In the first flow prediction step, the perturbation flow due to a particle is obtained as an axisymmetric superposable wake using linear regression. In the second force prediction step, the force on a particle is evaluated in terms of the perturbation flow induced by all its neighbors using the generalized Faxén form of the force expression. In the second approach, the force data on all the particles from the PR-DNS simulations are used to develop an artificial neural network (ANN) model for direct prediction of force on a particle. Due to the unavoidable limitation on the number of fully resolved particles in the PR-DNS simulations, direct force prediction with the ANN model tends to over-fit the data and performs poorly in the prediction of test data. In contrast, due to the millions of grid points used in the PR-DNS simulations, accurate flow prediction is possible, which then allows accurate prediction of particle force. This hybridization of multiphase physics and machine learning is particularly important, since it blends the strength of each, and the resulting pairwise interaction extended point-particle model cannot be developed by either physics or machine learning alone.

42 ENGINEERING↗

Leveraging explainable AI to characterize floating-point exceptions in linear solvers

Linear solver packages are central to many scientific, engineering, and machine learning applications. When floating-point exceptions occur in these solvers, e.g., division by zero or overflow, numerical results are compromised and become unreliable. Existing static and dynamic analysis tools can detect such exceptions, but they do not explain why the exceptions occur in terms of the solver inputs. Here, we present a study to characterize the inputs that cause numerical exceptions in linear solver packages. Our approach uses explainable AI (XAI) to find the most relevant characteristics of input matrices that explain the occurrence of exceptions in the solvers. Since training data in this domain is scarce, we perform extensive data gathering and data augmentation to obtain exception-inducing inputs. Our approach uses a repair strategy on the features blamed by XAI to validate that such features indeed explain the exceptions. We compare the LIME and SHAP XAI techniques using a dozen matrix features with three classifiers. We evaluate the approach on three widely used linear solver packages and find that some input characteristics can explain the occurrence of exceptions 100% of the time, in specific solvers and preconditioners.

Explainable AI↗

Vibrational overtone spectra of N-H stretches and intramolecular dynamics on the ground and electronically excited states of methylamine

The vibrational pattern and energy flow in the N-H stretch manifolds and the dissociation dynamics of methylamine (CH{sub 3}NH{sub 2}) were investigated via vibrationally mediated photodissociation. Action spectra and Doppler profiles, reflecting the yield of the ensuing H photofragments, versus near infrared/visible vibrational excitation and UV excitation, respectively, were measured. The jet-cooled action spectra and the simultaneously measured room temperature photoacoustic spectra of the first to third N-H stretching overtones exhibit broad features, somewhat narrower in the former, consisting of barely recognized multiple bands. Two phases of fitting of the spectroscopic data were performed. In the first phase, the raw data were analyzed to obtain band positions, types, intensities, and transition linewidths. In the second, the information derived from the first phase was then used as data in a fit to joint local mode/normal mode (LM/NM) and NM Hamiltonian parameters. The derived parameters predicted well band positions and allowed band assignment. The LM/NM Hamiltonian and the extracted Lorentzian linewidths enabled the determination of the initial pathways for energy redistribution and the overall temporal behavior of the N-H stretch and doorway states, as a result of Fermi couplings and interactions with bath states. The results indicate a nonstatistical energy flow in the V=2 manifold region, pointing to the dependence of the coupling on specific low order resonances rather than on the total density of bath states. The Doppler profiles suggest lower average translational energies for the released H photofragments, in particular, for V=3 and 4 as compared to V=1 and 2, implying a change in the mechanism for bond cleavage.

74 ATOMIC AND MOLECULAR PHYSICS↗

Jülich-Bonn-Washington model for pion electroproduction multipoles

Pion electroproduction off the proton is analyzed in a new framework based on a general parametrization of transition amplitudes, including constraints from gauge invariance and threshold behavior. Data with energies 1.13 GeV < W < 1.6 GeV and Q 2 below 6 Ge V 2 are included. The model is an extension of the latest Jülich-Bonn solution incorporating constraints from pion-induced and photoproduction data. Here, performing large-scale fits (≈10 5 data) we find a set of solutions with $χ^2_{\text{dof}}$ = 1.69–1.81 which allows us to assess the systematic uncertainty of the approach.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

ASCENDS: Advanced data SCiENce toolkit for Non-Data Scientists

Recently, advances in machine learning and artificial intelligence have been playing more and more critical roles in a wide range of areas. For the last several years, industries have shown that how learning from data, identifying patterns and making decisions with minimal human intervention can be extremely useful to their business (e.g., image classification, recommending a product to a customer, finding friends in a social network, predicting customers actions, etc.). These success stories have been motivating scientists who study physics, chemistry, materials, medicine, and many other subjects, to explore a new pathway of utilizing machine learning techniques like regression and classification for their scientific activities. However, most existing machine learning tools, systems, and methodologies have been developed for programming experts but not for scientists (or any users) who have no or little knowledge of programming. ASCENDS is a toolkit that is developed to assist scientists (or any persons) who want to use their data for machine learning tasks, more specifically, correlation analysis, regression, and classification. ASCENDS does not require programming skills. Instead, it provides a set of simple but powerful CLI (Command Line Interface) and GUI (Graphic User Interface) tools for non-data scientists to be able to intuitively perform advanced data analysis and machine learning techniques. ASCENDS has been implemented by wrapping around opensource software including Keras, TensorFlow, and scikit-learn.

97 MATHEMATICS AND COMPUTING↗

The Scientific Data Management Center: Available Technologies and Highlights

Managing scientific data has been identified by the scientific community as one of the most important emerging needs because of the sheer volume and increasing complexity of data being collected. Effectively generating, managing, and analyzing this information requires a comprehensive, end-to-end approach to data management that encompasses all of the stages from the initial data acquisition to the final analysis of the data. Based on community input, we have identified three significant requirements. First, more efficient access to storage systems is needed. In particular, parallel file system and I/O system improvements are needed to write and read large volumes of data without slowing a simulation. Second, scientists require technologies to facilitate better understanding of their data, in particular the ability to effectively perform complex data analysis and searches over extremely large data sets. Furthermore, exploratory analysis requires techniques for efficiently selecting subsets of the data. Third, generating the data, collecting and storing the results, keeping track of data provenance, data post-processing, and analysis of results is a tedious, fragmented process. Tools for automation of this process in a robust, tractable, and recoverable fashion are required to enhance scientific exploration.

99 GENERAL AND MISCELLANEOUS↗

Search for Dijet Resonances in 7 TeV pp Collisions at CMS

A search for narrow resonances in the dijet mass spectrum is performed using data corresponding to an integrated luminosity of 2.9 inverse pb collected by the CMS experiment at the LHC. Upper limits at the 95% confidence level (CL) are presented on the product of the resonance cross section, branching fraction into dijets, and acceptance, separately for decays into quark-quark, quark-gluon, or gluon-gluon pairs. The data exclude new particles predicted in the following models at the 95% CL: string resonances, with mass less than 2.50 TeV, excited quarks, with mass less than 1.58 TeV, and axigluons, colorons, and E_6 diquarks, in specific mass intervals. This extends previously published limits on these models.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Combination of Searches for Higgs Boson Pair Production in Proton-Proton Collisions at s =13 TeV

This Letter describes a search for Higgs boson pair production using the combined results from four final states: bbγγ, bbττ, bbbb, and bbVV, where V represents a W or Z boson. The search is performed using data collected in 2016 by the CMS experiment from LHC proton-proton collisions at s=13 TeV, corresponding to an integrated luminosity of 35.9 fb-1. Limits are set on the Higgs boson pair production cross section. A 95% confidence level observed (expected) upper limit on the nonresonant production cross section is set at 22.2 (12.8) times the standard model value. A search for narrow resonances decaying to Higgs boson pairs is also performed in the mass range 250-3000 GeV. No evidence for a signal is observed, and upper limits are set on the resonance production cross section. © 2019 CERN.

60 APPLIED LIFE SCIENCES↗

Improving Progressive Retrieval for HPC Scientific Data using Deep Neural Network

As the disparity between compute and I/O on high-performance computing systems has continued to widen, it has become increasingly difficult to perform post-hoc data analytics on full-resolution scientific simulation data due to the high I/O cost. Error-bounded data decomposition and progressive data retrieval framework has recently been developed to address such a challenge by performing data decomposition before storage and reading only part of the decomposed data when necessary. However, the performance of the progressive retrieval framework has been suffering from the over-pessimistic error control theory, such that the achieved maximum error of recomposed data is significantly lower than the required error. Therefore, more data than required is fetched for recomposition, incurring additional I/O overhead. In order to tackle this issue, we propose a DNN-based progressive retrieval framework that can better identify the minimum amount of data to be retrieved. Our contributions are as follows: 1) We provide an in-depth investigation of the recently developed progressive retrieval framework; 2) We propose two designs of prediction models (named D-MGARD and E-MGARD) to estimate the amount of retrieved data size based on error bounds. 3) We evaluate our proposed solutions using scientific datasets generated by real-world simulations from two domains. Evaluation results demonstrate the effectiveness of our solution in accurately predicting the amount of retrieval data size, as well as the advantages of our solution over the traditional approach to reducing the I/O overhead. Based on our evaluation, our solution is shown to read significantly less data (5% - 40% with D-MGARD, 20% - 80% with E-MGARD).

Wang, Jinzhen↗

Benchmarking derivative-free optimization algorithms.

We propose data profiles as a tool for analyzing the performance of derivative-free optimization solvers when there are constraints on the computational budget. We use performance and data profiles, together with a convergence test that measures the decrease in function value, to analyze the performance of three solvers on sets of smooth, noisy, and piecewise-smooth problems. Our results provide estimates for the performance difference between these solvers, and show that on these problems, the model-based solver tested performs better than the two direct search solvers tested.

97 MATHEMATICS AND COMPUTING↗

A High-level Design for Bidirectional Data Streaming to High-Performance Computing Systems from External Science Facilities

Cutting-edge science is increasingly data-driven due to the emergence of scientific machine learning models that can guide scientists toward fruitful areas of exploration. Experimental science facilities such as light and neutron sources, particle colliders, and radio astronomy telescopes are also producing raw measurement data at rates that exceed available data storage and computing capacity at those facilities. As a result, scientific workflows are being developed that concurrently couple experiments at science facilities with high-performance computing (HPC) facilities to enable analysis of experimental data while the experiment is ongoing, and where analysis results are potentially fed back to the experiment for use in experimental control and/or steering in a time-sensitive manner. Our goal is to design, prototype, and deploy a new capability for the Oak Ridge Leadership Computing Facility (OLCF) that enables such workflows through support for bidirectional, memory-based streaming of data from external experiments into and out of OLCF HPC systems. This high-level design document describes the related work and motivating use cases that inform our understanding of the technical requirements for this capability, and describes a proposed architectural solution that meets these requirements and our plans for demonstrating the capability.

97 MATHEMATICS AND COMPUTING↗

Analysis of Needlet Internal Linear Combination performance on B -mode data from sub-orbital experiments

The observation of primordial B modes in cosmic microwave background (CMB) polarisation data represents the main scientific goal of most of the future CMB experiments. This signal is predicted to be much lower than polarised Galactic emission (foregrounds) in any region of the sky, pointing to the need for effective component separation methods. Aims. Among all the techniques, the blind Needlet Internal Linear Combination (NILC) is of great relevance given our current limited knowledge of the B-mode foregrounds. In this work, we explore the possibility of employing NILC for the analysis of B modes reconstructed from partial-sky data, specifically addressing the complications that such an application yields such as E–B leakage, needlet filtering, and beam convolution. We consider two complementary simulated datasets of future experiments: the balloon-borne Short Wavelength Instrument for the Polarisation Explorer (SWIPE) of the Large Scale Polarisation Explorer, which targets the observation of both reionisation and recombination peaks of the primordial CMB B-mode angular power spectrum, and the ground-based Small Aperture Telescope of Simons Observatory, which, instead, is designed to observe only the recombination bump at ℓ ~ 80. We assessed the performance of the following two alternative techniques to correct for the CMB E–B leakage: the recycling technique and the Zhao-Baskaran method. We find that both techniques reduce the E–B leakage residuals at a negligible level given the sensitivity of the considered experiments, except for the recycling method in the SWIPE footprint at ℓ < 20. Thus, we implemented two extensions of the pipeline, the iterative B decomposition and the diffusive inpainting, which enabled us to recover the input CMB B-mode power for ℓ ≥ 5. For the considered experiments, we demonstrate that needlet filtering and beam convolution do not affect the CMB B-mode reconstruction. Finally, with an appropriate masking strategy, we find that NILC foregrounds subtraction allows one to achieve sensitivities on the tensor-to-scalar ratio in agreement with the targets of the considered CMB experiments.

79 ASTRONOMY AND ASTROPHYSICS↗

Domain Adaptation for Measurements of Strong Gravitational Lenses

Upcoming surveys are predicted to discover galaxy-scale strong lenses on the magnitude of 105, making deep learning methods necessary in lensing data analysis. Currently, there is insufficient real lensing data to train deep learning algorithms, but training only on simulated data results in poor performance on real data. Domain adaptation can bridge the gap between simulated and real datasets. We adopt domain adaptation on the estimation of Einstein radius in simulated galaxy-scale gravitational lensing images. We evaluate two domain adaptation techniques - domain adversarial neural networks (DANN) and maximum mean discrepancy (MMD). We train on a source domain of simulated lenses and apply it to a target domain with emulation of DES survey conditions. We show that both domain adaptation techniques can significantly improve the model performance on the more complex target domain datasets. Our results show the potential of using domain adaptation to perform analysis on future survey data with a deep neural network trained on simulated data.

79 ASTRONOMY AND ASTROPHYSICS↗

Domain Adaptation for Measurements of Strong Gravitational Lenses

Upcoming surveys are predicted to discover galaxy-scale strong lenses on the order of 10\textsuperscript{5}, making deep learning methods necessary in lensing data analysis. Currently, there is insufficient real lensing data to train deep learning algorithms, but the alternative of training only on simulated data results in poor performance on real data. Domain Adaptation may be able to bridge the gap between simulated and real datasets. We utilize domain adaptation for the estimation of Einstein radius ($\Theta_E$) in simulated galaxy-scale gravitational lensing images with different levels of observational realism. We evaluate two domain adaptation techniques - Domain Adversarial Neural Networks (DANN) and Maximum Mean Discrepancy (MMD). We train on a source domain of simulated lenses and apply it to a target domain of lenses simulated to emulate noise conditions in the Dark Energy Survey (DES). We show that both domain adaptation techniques can significantly improve the model performance on the more complex target domain dataset. This work is the first application of domain adaptation for a regression task in strong lensing imaging analysis. Our results show the potential of using domain adaptation to perform analysis of future survey data with a deep neural network trained on simulated data.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Domain Adaptation for Measurements of Strong Gravitational Lenses

Upcoming surveys are predicted to discover galaxy-scale strong lenses on the order of $10^5$, making deep learning methods necessary in lensing data analysis. Currently, there is insufficient real lensing data to train deep learning algorithms, but the alternative of training only on simulated data results in poor performance on real data. Domain Adaptation may be able to bridge the gap between simulated and real datasets. We utilize domain adaptation for the estimation of Einstein radius ($\Theta_E$) in simulated galaxy-scale gravitational lensing images with different levels of observational realism. We evaluate two domain adaptation techniques - Domain Adversarial Neural Networks (DANN) and Maximum Mean Discrepancy (MMD). We train on a source domain of simulated lenses and apply it to a target domain of lenses simulated to emulate noise conditions in the Dark Energy Survey (DES). We show that both domain adaptation techniques can significantly improve the model performance on the more complex target domain dataset. This work is the first application of domain adaptation for a regression task in strong lensing imaging analysis. Our results show the potential of using domain adaptation to perform analysis of future survey data with a deep neural network trained on simulated data.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Evaluation of a new commercial Monte Carlo dose calculation algorithm for electron beams

Purpose: In this report the authors present the validation of a Monte Carlo dose calculation algorithm (XiO EMC from Elekta Software) for electron beams. Methods: Calculated and measured dose distributions were compared for homogeneous water phantoms and for a 3D heterogeneous phantom meant to approximate the geometry of a trachea and spine. Comparisons of measurements and calculated data were performed using 2D and 3D gamma index dose comparison metrics. Results: Measured outputs agree with calculated values within estimated uncertainties for standard and extended SSDs for open applicators, and for cutouts, with the exception of the 17 MeV electron beam at extended SSD for cutout sizes smaller than 5 × 5 cm{sup 2}. Good agreement was obtained between calculated and experimental depth dose curves and dose profiles (minimum number of measurements that pass a 2%/2 mm agreement 2D gamma index criteria for any applicator or energy was 97%). Dose calculations in a heterogeneous phantom agree with radiochromic film measurements (>98% of pixels pass a 3 dimensional 3%/2 mm γ-criteria) provided that the steep dose gradient in the depth direction is considered. Conclusions: Clinically acceptable agreement (at the 2%/2 mm level) between the measurements and calculated data for measurements in water are obtained for this dose calculation algorithm. Radiochromic film is a useful tool to evaluate the accuracy of electron MC treatment planning systems in heterogeneous media.

61 RADIATION PROTECTION AND DOSIMETRY↗

Requirements for Defining Utility Drive Cycles: An Exploratory Analysis of Grid Frequency Regulation Data for Establishing Battery Performance Testing Standards

Battery testing procedures are important for understanding battery performance, including degradation over the life of the battery. Standards are important to provide clear rules and uniformity to an industry. The work described in this report addresses the need for standard battery testing procedures that reflect real-world applications of energy storage systems to provide regulation services to grid operators. This work was motivated by the need to develop Vehicle-to-Grid (V2G) testing procedures, or V2G drive cycles. Likewise, the stationary energy storage community is equally interested in standardized testing protocols that reflect real-world grid applications for providing regulation services. As the first of several steps toward standardizing battery testing cycles, this work focused on a statistical analysis of frequency regulation signals from the Pennsylvania-New Jersey-Maryland Interconnect with the goal to identify patterns in the regulation signal that would be representative of the entire signal as a typical regulation data set. Results from an extensive time-series analysis are discussed, and the results are explained from both the statistical and the battery-testing perspectives. The results then are interpreted in the context of defining a small set of V2G drive cycles for standardization, offering some recommendations for the next steps toward standardizing testing protocols.

25 ENERGY STORAGE↗