Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithmic differentiation”

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,099 records · Page 61

Enabling Extended-Term Simulation of Power Systems with High PV Penetration. Final Report

This is the final Technical Report for DOE-SETO Project Award # DE-EE0036461. The goal of this project is to advance the understanding of the grid impact of high penetration of photovoltaic (PV) generation by developing novel numerical methods to solve the differential algebraic equations (DAEs) that define power systems. This will overcome the limitations of current software packages – namely that they only consider fast dynamics over brief time periods. The work presented in this final project report covers results over the entire period of the project. This includes results on model development, code development for the PST repository, datasets in the PST repository, algorithm development and results from variable time-step simulations, development and results from multirate simulations, and sensitivity analysis of key parameter in variable time-step methods. In addition, this report discusses project outreach activities to stakeholders, and a summary of project products. Also covered in this final report is the writing of two conference papers (one of which has already been accepted) and a journal paper. In addition, the updating of two inverter models (both grid forming and grid following) to be compatible with the latest version of PST software is discussed.

14 SOLAR ENERGY↗

Early Diagnosis of Fibromyalgia Using Surface-Enhanced Raman Spectroscopy Combined with Chemometrics

Fibromyalgia (FM) is a chronic muscle pain disorder that shares several clinical features with other related rheumatologic disorders. This study investigates the feasibility of using surface-enhanced Raman spectroscopy (SERS) with gold nanoparticles (AuNPs) as a fingerprinting approach to diagnose FM and other rheumatic diseases such as rheumatoid arthritis (RA), systemic lupus erythematosus (SLE), osteoarthritis (OA), and chronic low back pain (CLBP). Blood samples were obtained on protein saver cards from FM (n = 83), non-FM (n = 54), and healthy (NC, n = 9) subjects. A semi-permeable membrane filtration method was used to obtain low-molecular-weight fraction (LMF) serum of the blood samples. SERS measurement conditions were standardized to enhance the LMF signal. An OPLS-DA algorithm created using the spectral region 750 to 1720 cm -1 enabled the classification of the spectra into their corresponding FM and non-FM classes (Rcv > 0.99) with 100% accuracy, sensitivity, and specificity. The OPLS-DA regression plot indicated that spectral regions associated with amino acids were responsible for discrimination patterns and can be potentially used as spectral biomarkers to differentiate FM and other rheumatic diseases. This exploratory work suggests that the AuNP SERS method in combination with OPLS-DA analysis has great potential for the label-free diagnosis of FM.

60 APPLIED LIFE SCIENCES↗

High fidelity ground deposition measurement with robots after explosive radiological dispersion

A team of scientists from the Remote Sensing Laboratory at Joint Base Andrews, Maryland, has assembled a remote-controlled robot to field a few sodium iodide scintillators of different size and shape 18″ above ground for measurement of ground deposition of gamma-emitting particles after an explosion of a radiological dispersal device. This system uses a high-precision differential GPS device with submeter accuracy for radiation mapping. The system is most useful in characterizing large-area contamination and detecting gamma radioactivity in invisible, submicron particulate debris deposited on the ground at surface level or embedded in subsurface up to 3″ deep. The system was assembled as part of a larger effort to integrate advanced radiological detection devices into autonomous or remote-controlled robotic systems to eliminate or minimize the need for emergency responders to enter areas that pose significant health and safety risks to humans following a major radiological incident or accident. Research into autonomous algorithms is required to develop automated robotic systems for radiological survey and characterization activities in highly contaminated areas. The scope of this project also includes developing communications pathways and supporting infrastructure capabilities for different types of robotic technologies. The expected result is an advanced autonomous robotic system with integrated radiation detection electronics that allows emergency response personnel to view data remotely and in real time for radiological emergency response and consequence management purposes.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

NSFnets (Navier-Stokes flow nets): Physics-informed neural networks for the incompressible Navier-Stokes equations

In the last 50 years there has been a tremendous progress in solving numerically the Navier-Stokes equations using finite differences, finite elements, spectral, and even meshless methods. Yet, in many real cases, we still cannot incorporate seamlessly (multi-fidelity) data into existing algorithms, and for industrial-complexity applications the mesh generation is time consuming and still an art. Moreover, solving ill-posed problems (e.g., lacking boundary conditions) or inverse problems is often prohibitively expensive and requires different formulations and new computer codes. Here, we employ physics-informed neural networks (PINNs), encoding the governing equations directly into the deep neural network via automatic differentiation, to overcome some of the aforementioned limitations for simulating incompressible laminar and turbulent flows. We develop the Navier-Stokes flow nets (NSFnets) by considering two different mathematical formulations of the Navier-Stokes equations: the velocity-pressure (VP) formulation and the vorticity-velocity (VV) formulation. Since this is a new approach, we first select some standard benchmark problems to assess the accuracy, convergence rate, computational cost and flexibility of NSFnets; analytical solutions and direct numerical simulation (DNS) databases provide proper initial and boundary conditions for the NSFnet simulations. The spatial and temporal coordinates are the inputs of the NSFnets, while the instantaneous velocity and pressure fields are the outputs for the VP-NSFnet, and the instantaneous velocity and vorticity fields are the outputs for the VV-NSFnet. This is unsupervised learning and, hence, no labeled data are required beyond boundary and initial conditions and the fluid properties. The residuals of the VP or VV governing equations, together with the initial and boundary conditions, are embedded into the loss function of the NSFnets. No data is provided for the pressure to the VP-NSFnet, which is a hidden state and is obtained via the incompressibility constraint without extra computational cost. Unlike the traditional numerical methods, NSFnets inherit the properties of neural networks (NNs), hence the total error is composed of the approximation, the optimization, and the generalization errors. Here, we empirically attempt to quantify these errors by varying the sampling (“residual”) points, the iterative solvers, and the size of the NN architecture. For the laminar flow solutions, we show that both the VP and the VV formulations are comparable in accuracy but their best performance corresponds to different NN architectures. The initial convergence rate is fast but the error eventually saturates to a plateau due to the dominance of the optimization error. For the turbulent channel flow, we show that NSFnets can sustain turbulence at , but due to expensive training we only consider part of the channel domain and enforce velocity boundary conditions on the subdomain boundaries provided by the DNS data base. We also perform a systematic study on the weights used in the loss function for balancing the data and physics components, and investigate a new way of computing the weights dynamically to accelerate training and enhance accuracy. In the last part, we demonstrate how NSFnets should be used in practice, namely for ill-posed problems with incomplete or noisy boundary conditions as well as for inverse problems. We obtain reasonably accurate solutions for such cases as well without the need to change the NSFnets and at the same computational cost as in the forward well-posed problems. As a result, we also present a simple example of transfer learning that will aid in accelerating the training of NSFnets for different parameter settings.

97 MATHEMATICS AND COMPUTING↗

On a physics-based model equation for shock-position evolution in PMMA

A governing differential equation for shock position in PMMA was derived from momentum conservation and an experimentally determined decay law for shock pressure. A new multi-diagnostic characterization method for measuring detonator pressure and wave shape output in PMMA witness blocks provided temporally resolved, 1-D, shock-position data that was iteratively fit by solutions to the governing equation via a unique genetic algorithm solver. The goal was to calculate a solution that describes the temporal evolution of shock pressure in PMMA starting at the detonator interface. The empirical decay law was investigated using experimental data, where different regimes were considered for the decay coefficients. A successful solution provides extensive performance information that is directly relevant to the understanding and characterization of detonator function.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Evapotranspiration Dynamics and Effects on Groundwater Recharge and Discharge at the Tuba City, Arizona, Disposal Site

The U.S. Department of Energy Office of Legacy Management is evaluating groundwater flow and contaminant transport at a former uranium mill site near Tuba City, Arizona. We estimated effects of temporal and spatial variability in evapotranspiration (ET) on recharge and discharge within a groundwater model domain (GMD) as part of this evaluation. We used remote sensing algorithms and precipitation (PPT) data to estimate ET and the ET/PPT ratios within the 3531 hectare GMD. For the period from 2000 to 2012, ET and PPT were nearly balanced (129 millimeters per year [mm yr -1 ] and 130 mm yr -1 , respectively; ET/PPT = 0.99). However, seasonal and annual variability in ET and PPT were out of phase, and spatial variability in vegetation differentiated discharge and recharge areas within the GMD. Half of ET occurred during spring and early summer when PPT was low, and about 70% of PPT arriving in fall and winter was discharged as plant transpiration in the spring and summer period. Vegetation type and health had a significant effect on the site water balance. Plant cover and ET were significantly higher (1) during years of lighter compared to years of heavier grazing pressure, and (2) on rangeland protected from grazing compared to rangeland grazed by livestock. Heavy grazing increased groundwater recharge (PPT > ET over the 13-year period). Groundwater discharge (ET > PPT over the 13-year period) was highest in riparian phreatophyte communities but insignificant in desert phreatophyte communities impacted by heavy grazing. Grazing management in desert upland and phreatophyte communities may result in reduced groundwater recharge, increased groundwater discharge, and could be used to influence local groundwater flow.

54 ENVIRONMENTAL SCIENCES↗

Winners are not keepers: Characterizing household engagement, gains, and energy patterns in demand response using machine learning in the United States

Demand-response programs can help utilities manage rapidly evolving electric grids, but these programs are subject to the complexities of human behavior. This paper explores a novel method for uncovering heterogeneity in households. In this work, we use a machine-learning method known as a Conditional Inference Tree (c-tree) algorithm to categorize households based on their energy behavior characteristics collected via smart meters, and explore how this translates through into heterogeneity in their real-world response to a DR program. Using data from randomized controlled trial, we generate estimates of the changes in energy use caused by the program within each household group. Our results show that the c-tree approach differentiates households by their energy-use characteristics in a way that increases the spread in enrollment rates and critical peak reduction among household groups, compared with the spreads achieved via several conventional segmentation methods. Thus, the c-tree analysis enables the most tailored targeting of major potential energy savers and could provide the greatest increase in cost-effectiveness of household recruitment into DR programs. Our results also offer fresh insights into the relationships between household energy behavior characteristics – such as peak energy use and “structural winningness” (the ability to save money under a DR program without changing energy-use behaviors) – and household decisions about enrolling in DR programs and reducing energy use. Our research also demonstrates the potential of smart meter data, combined with machine learning and econometric methods, to provide significant value to utilities, program implementers, researchers, and other stakeholders.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Novel strategies for modal-based structural material identification

Here, we present modal-based methods for model calibration in structural dynamics, and address several key challenges in the solution of gradient-based optimization problems with eigenvalues and eigenvectors, including the solution of singular Helmholtz problems encountered in sensitivity calculations, non-differentiable objective functions caused by mode swapping during optimization, and cases with repeated eigenvalues. Unlike previous literature that relied on direct solution of the eigenvector adjoint equations, we present a parallel iterative domain decomposition strategy (Adjoint Computation via Modal Superposition with Truncation Augmentation) for the solution of the singular Helmholtz problems. For problems with repeated eigenvalues we present a novel Mode Separation via Projection algorithm, and in order to address mode swapping between inverse iterations we present a novel Injective mode ordering metric. We present the implementation of these methods in a massively parallel finite element framework with the ability to use measured modal data to extract unknown structural model parameters from large complex problems. A series of increasingly complex numerical examples are presented that demonstrate the implementation and performance of the methods in a massively parallel finite element framework [7], [5], using gradient-based optimization techniques in the Rapid Optimization Library (ROL) [21].

36 MATERIALS SCIENCE↗

A general framework and review of scatter correction methods in x-ray cone-beam computerized tomography. Part 1: Scatter compensation approaches

Since scattered radiation in cone-beam volume CT implies severe degradation of CT images by quantification errors, artifacts, and noise increase, scatter suppression is one of the main issues related to image quality in CBCT imaging. The aim of this review is to structurize the variety of scatter suppression methods, to analyze the common structure, and to develop a general framework for scatter correction procedures. In general, scatter suppression combines hardware techniques of scatter rejection and software methods of scatter correction. The authors emphasize that scatter correction procedures consist of the main components scatter estimation (by measurement or mathematical modeling) and scatter compensation (deterministic or statistical methods). The framework comprises most scatter correction approaches and its validity also goes beyond transmission CT. Before the advent of cone-beam CT, a lot of papers on scatter correction approaches in x-ray radiography, mammography, emission tomography, and in Megavolt CT had been published. The opportunity to avail from research in those other fields of medical imaging has not yet been sufficiently exploited. Therefore additional references are included when ever it seems pertinent. Scatter estimation and scatter compensation are typically intertwined in iterative procedures. It makes sense to recognize iterative approaches in the light of the concept of self-consistency. The importance of incorporating scatter compensation approaches into a statistical framework for noise minimization has to be underscored. Signal and noise propagation analysis is presented. A main result is the preservation of differential-signal-to-noise-ratio (dSNR) in CT projection data by ideal scatter correction. The objective of scatter compensation methods is the restoration of quantitative accuracy and a balance between low-contrast restoration and noise reduction. In a synopsis section, the different deterministic and statistical methods are discussed with respect to their properties and applications. The current paper is focused on scatter compensation algorithms. The multitude of scatter estimation models will be dealt with in a separate paper.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Measurement of $Z/\gamma^* + b$-jet Production Cross section in $p\bar{p}$ collisions at $\sqrt{s}= 1.96$ TeV with the CDF detector

Processes at hadron colliders, such as the production of jets, are described by the Quantum Chromodynamics theory (QCD). Precise descriptions of processes involving jets in association with a vector boson have nowadays large relevance as they represent irreducible background to other Standard Model (SM) processes and searches for new physics. The experimental study and understanding of the b-jet production in association with a Z boson are crucial for many reasons. For one side, it is the most important background for a light Higgs boson decaying into a bottom-antibottom quark pair and produced in the ZH mode.This is one of the most promising channels for the Higgs search at Tevatron in particular since the latest results have excluded the high mass region (MH > 127 GeV/c 2 ). For another side the signature of b-jets and a Z boson is also background to new physics searches, such as supersymmetry, where a large coupling of the Higgs boson to bottom quarks is allowed. The produ ction cross section measurement of b-jets in events with a Z boson has already been performed at hadron colliders, at the Tevatron by CDF and D0 experiments and are now pursued at the LHC by ATLAS and CMS. In particular the CDF measurement was performed with only 2 fb -1 and was limited by the statistical uncertainty. This PhD thesis presents a new measurement of the $Z/\gamma^* + b$-jet production cross section using the complete dataset collected by CDF during the Run II. $Z/\gamma^*$ bosons are selected in the electron and muon decay modes and are required to have 66 < MZ < 116 GeV/c 2 while jets, reconstructed with the MidPoint algorithm, have to be central (|Y| < 1.5) with pT > 20 GeV/c . The per jet cross section is measured with respect to the $Z/\gamma^*$ inclusive and the $Z/\gamma^* +$ jets cross sections. Results are compared to leading order (LO) event generator plus parton shower and next-to-leading order (NLO) predictions corrected for non perturbative effects such as hadronizat ion and underlying event. Differential distributions as a fu! nction of jet transverse moment and jet rapidity are also presented together with the comparison to NLO pQCD predictions for different renormalization and factorization scales and various PDF sets.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Autoradiography Using OSL for Monitoring Warhead Dismantlement

The use of radiation imaging techniques to provide increased confidence in a dismantlement verification regime is still under investigation. Currently, radiation measurements can be used to confirm attributes such as the presence, quality, and mass of containerized nuclear material. However, imaging techniques can be used to confirm the shape, size, and/or symmetry of the object being interrogated. Imaging can be used as a complementary technique to radiation measurements to confirm a declaration or as a chain of custody measure to confirm that an item has not been tampered with. As with other attribute measurements, the image data must be protected behind an information barrier and analyzed to give an unclassified result when compared to an agreed upon threshold. This paper will discuss the use of Optically Stimulated Luminescence to perform autoradiography of sources using coded apertures to differentiate between point sources and various distributed sources. The coded aperture chosen for this application is based on modified uniform redundant arrays (mURAs) which resulted in the design and manufacture of an efficient, high-resolution mURA mask/antimask system. The potential use of the autoradiography technique with the coded aperture as an intrinsic information barrier and the required protection of the mask and unfolding algorithm will also be discussed. This project has been supported by the US Department of Energy’s National Nuclear Security Administration’s Office of Dismantlement and Transparency (DOE/NNSA/NA-241).

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Shewanella baltica Ecotypes Have Wide Transcriptional Variation under the Same Growth Conditions

In bacterial populations, subtle expressional differences may promote ecological specialization through the formation of distinct ecotypes. In a barrier-free habitat, this process most likely precedes population divergence and may predict speciation events. To examine this, we used four sequenced strains of the bacterium Shewanella baltica, OS155, OS185, OS195, and OS223, as models to assess transcriptional variation and ecotype formation within a prokaryotic population. All strains were isolated from different depths throughout a water column of the Baltic Sea, occupying different ecological niches characterized by various abiotic parameters. Although the genome sequences are nearly 100% conserved, when grown in the laboratory under standardized conditions, all strains exhibited different growth rates, suggesting significant expressional variation. Using the Ecotype Simulation algorithm, all strains were considered to be discrete ecotypes when compared to 32 other S. baltica strains isolated from the same water column, suggesting ecological divergence. Next, we employed custom microarray slides containing oligonucleotide probes representing the core genome of OS155, OS185, OS195, and OS223 to detect natural transcriptional variation among strains grown under identical conditions. Significant transcriptional variation was noticed among all four strains. Differentially expressed gene profiles seemed to coincide with the metabolic signatures of the environment at the original isolation depth. Transcriptional pattern variations such as the ones highlighted here may be used as indicators of short-term evolution emerging from the formation of bacterial ecotypes.

59 BASIC BIOLOGICAL SCIENCES↗

Albany v. 3.0

The Albany code is a general-purpose finite element code for solving partial differential equations (PDEs). Albany is a research code that demonstrates how a PDE code can be built by interfacing many of the open-source software libraries that are released under Sandia's Trilinos project. Part of the mission of Albany is to be a testbed for new Trilinos libraries, to refine their methods, usability, and interfaces. Albany includes hooks to optimization and uncertainty quantification algorithms, including those in Trilinos as well as those in the Dakota toolkit. Because of this, Albany is a desirable starting point for new code development efforts that wish to make heavy use of Trilinos. Albany is both a framework and the host for specific finite element applications. These applications have project names, and can be controlled by configuration option when the code is compiled, but are all developed and released as part of the single Albany code base, These include LCM, QCAD, FELIX, Aeras, and ATO applications.

SciDAC↗

Challenges of Monte Carlo Transport

These are slides from a presentation for Parallel Summer School at Los Alamos National Laboratory. Solving discretized partial differential equations (PDEs) of interest can require a large number of computations. We can identify concurrency to allow parallel solution of discrete PDEs. Simulated particles histories can be used to solve the Boltzmann transport equation. Particle histories are independent in neutral particle transport, making them amenable to parallel computation. Physical parameters and method type determine the data dependencies of particle histories. Data requirements shape parallel algorithms for Monte Carlo. Then, Parallel Computational Physics and Parallel Monte Carlo are discussed and, finally, the results are given. The mesh passing method greatly simplifies the IMC implementation and allows simple load-balancing. Using MPI windows and passive, one-sided RMA further simplifies the implementation by removing target synchronization. The author is very interested in implementations of PGAS that may allow further optimization for one-sided, read-only memory access (e.g. Open SHMEM). The MPICH_RMA_OVER_DMAPP option and library is required to make one-sided messaging scale on Trinitite - Moonlight scales poorly. Interconnect specific libraries or functions are likely necessary to ensure performance. BRANSON has been used to directly compare the current standard method to a proposed method on idealized problems. The mesh passing algorithm performs well on problems that are designed to show the scalability of the particle passing method. BRANSON can now run load-imbalanced, dynamic problems. Potential avenues of improvement in the mesh passing algorithm will be implemented and explored. A suite of test problems that stress DD methods will elucidate a possible path forward for production codes.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Real-Time SCADA Cyber Protection Using Compression Techniques

The Department of Energy’s Office of Electricity Delivery and Energy Reliability (DOE-OE) has a critical mission to secure the energy infrastructure from cyber attack. Through DOE-OE’s Cybersecurity for Energy Delivery Systems (CEDS) program, the Idaho National Laboratory (INL) has developed a method to detect malicious traffic on Supervisory, Control, and Data Acquisition (SCADA) network using a data compression technique. SCADA network traffic is often repetitive with only minor differences between packets. Research performed at the INL showed that SCADA network traffic has traits desirable for using compression analysis to identify abnormal network traffic. An open source implementation of a Lempel-Ziv-Welch (LZW) lossless data compression algorithm was used to compress and analyze surrogate SCADA traffic. Infected SCADA traffic was found to have statistically significant differences in compression when compared against normal SCADA traffic at the packet level. The initial analyses and results are clearly able to identify malicious network traffic from normal traffic at the packet level with a very high confidence level across multiple ports and traffic streams. Statistical differentiation between infected and normal traffic level was possible using a modified data compression technique at the 99% probability level for all data analyzed. However, the conditions tested were rather limited in scope and need to be expanded into more realistic simulations of hacking events using techniques and approaches that are better representative of a real-world attack on a SCADA system. Nonetheless, the use of compression techniques to identify malicious traffic on SCADA networks in real time appears to have significant merit for infrastructure protection.

97 MATHEMATICS AND COMPUTING↗

Albany v. 3.0

The Albany code is a general-purpose finite element code for solving partial differential equations (PDEs). Albany is a research code that demonstrates how a PDE code can be built by interfacing many of the open-source software libraries that are released under Sandia's Trilinos project. Part of the mission of Albany is to be a testbed for new Trilinos libraries, to refine their methods, usability, and interfaces. Albany includes hooks to optimization and uncertainty quantification algorithms, including those in Trilinos as well as those in the Dakota toolkit. Because of this, Albany is a desirable starting point for new code development efforts that wish to make heavy use of Trilinos. Albany is both a framework and the host for specific finite element applications. These applications have project names, and can be controlled by configuration option when the code is compiled, but are all developed and released as part of the single Albany code base, These include LCM, QCAD, FELIX, Aeras, and ATO applications.

Salinger, Andrew↗

A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations

Many applications require minimizing the sum of smooth and nonsmooth functions. For example, basis pursuit denoising problems in data science require minimizing a measure of data misfit plus an $\ell^1$-regularizer. Similar problems arise in the optimal control of partial differential equations (PDEs) when sparsity of the control is desired. Here, we develop a novel trust-region method to minimize the sum of a smooth nonconvex function and a nonsmooth convex function. Our method is unique in that it permits and systematically controls the use of inexact objective function and derivative evaluations. When using a quadratic Taylor model for the trust-region subproblem, our algorithm is an inexact, matrix-free proximal Newton-type method that permits indefinite Hessians. We prove global convergence of our method in Hilbert space and demonstrate its efficacy on three examples from data science and PDE-constrained optimization.

97 MATHEMATICS AND COMPUTING↗

Parametric matrix models

We present a general class of machine learning algorithms called parametric matrix models. In contrast with most existing machine learning models that imitate the biology of neurons, parametric matrix models use matrix equations that emulate physical systems. Similar to how physics problems are usually solved, parametric matrix models learn the governing equations that lead to the desired outputs. Parametric matrix models can be efficiently trained from empirical data, and the equations may use algebraic, differential, or integral relations. While originally designed for scientific computing, we prove that parametric matrix models are universal function approximators that can be applied to general machine learning problems. After introducing the underlying theory, we apply parametric matrix models to a series of different challenges that show their performance for a wide range of problems. For all the challenges tested here, parametric matrix models produce accurate results within an efficient and interpretable computational framework that allows for input feature extrapolation.

Computational science↗