Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “leverage points”

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 127 records · Page 7

Development of process parameters and post-build conditions for qualification of LPBF 316 SS

To harness the potential of laser powder bed fusion (LPBF) 316H stainless steel (SS) for use in advanced nuclear reactors, extensive research efforts are needed to develop optimal laser processing parameters and appropriate heat treatments, taking into account various manufacturing platforms and locations. Furthermore, it is crucial to assess the material properties in environments relevant to reactor operating conditions. In collaboration with Oak Ridge National Laboratory (ORNL) and Los Alamos National Laboratory (LANL), Argonne National Laboratory (ANL) is dedicated to gaining insights into how the manufacturing process and post-build treatments impact the performance of LPBF 316H SS. This report provides an overview of ANL's research findings for FY23, focusing on LPBF 316H SS produced using a Renishaw AM400 laser system. Specifically, our research has concentrated on three key areas: 1) Optimum laser processing parameters: Leveraging the high-throughput printing technology, we systematically varied the laser power, exposure time and point distance within the same build. By measuring the as-printed porosity, we identified an optimum printing parameter window that produced materials with near-complete density; 2) Post-built treatment development: Materials printed with the optimum laser parameters underwent treatments including stress relief, solution annealing, and hot isostatic pressing. Subsequently, we fabricated tension, creep, and fatigue specimens from materials subjected to these different conditions. Over the next year, a series of scoping tests will be conducted to facilitate the selection of the most suitable post-build treatment condition; 3) Thermal aging effects on microstructure and properties: thermal aging at 550°C, 650°C and 750°C was conducted on LPBF 316H SS specimens up to 2500 h. Microstructural characterization was performed with electron microscopy, and the evolution of the dislocation cell structures and secondary phases was studied. Microhardness tests and tension tests were conducted to quantify changes in mechanical properties. The results revealed that the aged LPBF 316H SS exhibited a high density of Cr-rich and Mo-rich fine precipitates within grains due to the presence of a high density of dislocations and the globally distributed dislocation cell structures, which served as heterogeneous nucleation sites for secondary phases. Along grain boundaries, a Mo-Cr-rich phase, observed in 750°C-aged conditions, displayed significant thermal coarsening. Throughout the aging process, various mechanisms, including stress relaxation, dislocation cell structure recovery, solution hardening, and precipitation hardening, competed to influence materials strength. These results contribute towards establishing the technical basis for qualifying LPBF 316H SS for advanced nuclear reactor applications.

36 MATERIALS SCIENCE↗

Perspectives on Next Steps in Arms Control and Non-Proliferation

Much has happened in arms control over the last year as this chapter has been in development. The prospects for arms control as a viable national security tool have, if anything, grown darker. Russia has falsely equated tearing down the remaining arms control edifice with creating potential leverage vis-à-vis its actions in Ukraine. China has failed to update its talking points on being a responsible arms control actor with its massive nuclear force expansion. The United States has stated clearly that it is open for business on arms control and risk reduction, but it unfortunately has no customers in Russia and China. It remains unclear what specifically the United States is selling in terms of what it wants in a potential agreement. Competitive dynamics and an atmosphere of great power competition are driving all parties further away from the table.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

DAVINCI Venus Entry, Descent, and Landing Modeling and Simulation

The Deep Atmosphere Venus Investigation of Noble gases, Chemistry, and Imaging (DAVINCI) mission will launch in June 2029 and explore Venus via two flybys and a probe landing scheduled for June 2031. The goals of the mission are to study the origin, evolution, and current state of Venus and to understand if it was habitable at a point in the past. The entry, descent, and landing (EDL) concept of operations of the probe leverages on the successful Pioneer Venus large probe mission. The science objectives of the mission levy certain requirements on the EDL system, such as landing in the scientifically important Alpha Regio Tessera and telemetering several gigabytes of instrumentation data to the orbiting relay spacecraft before the probe impacts the surface. In order to optimize the EDL sequence of the lander and to verify key driving requirements, a six degree of freedom EDL flight mechanics simulation has been created based on the best available aerodynamic and atmospheric models valid for Venus. This paper describes the EDL modeling and simulation and summarizes the current flight mechanics results for the mission.

Soumyo Dutta↗

DAVINCI Venus Entry, Descent, and Landing Modeling and Simulation

The Deep Atmosphere Venus Investigation of Noble gases, Chemistry, and Imaging (DAVINCI) mission will launch in June 2029 and explore Venus via two flybys and a probe landing scheduled for June 2031. The goals of the mission are to study the origin, evolution, and current state of Venus and to understand if it was habitable at a point in the past. The entry, descent, and landing (EDL) concept of operations of the probe leverages on the successful Pioneer Venus large probe mission. The science objectives of the mission levy certain requirements on the EDL system, such as landing in the scientifically important Alpha Regio Tessera and telemetering several gigabytes of instrumentation data to the orbiting relay spacecraft before the probe impacts the surface. In order to optimize the EDL sequence of the lander and to verify key driving requirements, a six degree of freedom EDL flight mechanics simulation has been created based on the best available aerodynamic and atmospheric models valid for Venus. This paper describes the EDL modeling and simulation and summarizes the current flight mechanics results for the mission.

Soumyo Dutta↗

Leveraging PHIL for Inverter Functionality Requirement Evaluation to Ensure a Reliable Grid

This presentation showcases NREL's ongoing research on advanced Multi-point Power Hardware-in-the-Loop (PHIL) systems, enabling comprehensive evaluation of interoperability, stability, and wide-area stability in complex power grids. Key features include high-power PHIL capabilities, seamless PHIL Interfaces for effortless Grid-Following (GFL) and Grid-Forming (GFM) mode switching, and advanced multi-domain PHIL/Controller Hardware-in-the-Loop (CHIL) capabilities for evaluating diverse technology mixes, facilitating rigorous testing and validation of emerging power systems for reliable integration, enhanced resilience, and optimal performance.

lab capabilities↗

A Comparison between Invariant and Equivariant Classical and Quantum Graph Neural Networks

Machine learning algorithms are heavily relied on to understand the vast amounts of data from high-energy particle collisions at the CERN Large Hadron Collider (LHC). The data from such collision events can naturally be represented with graph structures. Therefore, deep geometric methods, such as graph neural networks (GNNs), have been leveraged for various data analysis tasks in high-energy physics. One typical task is jet tagging, where jets are viewed as point clouds with distinct features and edge connections between their constituent particles. The increasing size and complexity of the LHC particle datasets, as well as the computational models used for their analysis, have greatly motivated the development of alternative fast and efficient computational paradigms such as quantum computation. In addition, to enhance the validity and robustness of deep networks, we can leverage the fundamental symmetries present in the data through the use of invariant inputs and equivariant layers. In this paper, we provide a fair and comprehensive comparison of classical graph neural networks (GNNs) and equivariant graph neural networks (EGNNs) and their quantum counterparts: quantum graph neural networks (QGNNs) and equivariant quantum graph neural networks (EQGNN). The four architectures were benchmarked on a binary classification task to classify the parton-level particle initiating the jet. Based on their area under the curve (AUC) scores, the quantum networks were found to outperform the classical networks. However, seeing the computational advantage of quantum networks in practice may have to wait for the further development of quantum technology and its associated application programming interfaces (APIs).

Forestano, Roy T. (ORCID:0000000203552076)↗

A Systematic Exploration of Kilonova Candidates from Neutron Star Mergers during the Third Gravitational-wave Observing Run

We present a comprehensive analysis of 653 optical candidate counterparts reported during the third gravitational-wave (GW) observing run. Our sample concentrates on candidates from the 15 events (published in GWTC-2, GWTC-3, or not retracted on GraceDB) that had a >1% chance of including a neutron star in order to assess their viability as true kilonovae. In particular, we leverage tools available in real time, including pre-merger detections and cross-matching with catalogs (i.e., point-source, variable-star, quasar and host-galaxy redshift data sets), to eliminate 65% of candidates in our sample. We further employ spectroscopic classifications, late-time detections, and light-curve behavior analyses and conclude that 66 candidates remain viable kilonovae. These candidates lack sufficient information to determine their classifications, and the majority would require luminosities greater than that of AT 2017gfo. Pre-merger detections in public photometric survey data and comparison of cataloged host-galaxy redshifts with the GW event distances are critical to incorporate into vetting procedures, as these tools eliminated >20% and >30% of candidates, respectively. We expect that such tools that leverage archival information will significantly reduce the strain on spectroscopic and photometric follow-up resources in future observing runs. Finally, we discuss the critical role prompt updates from GW astronomers to the EM community play in reducing the number of candidates requiring vetting.

79 ASTRONOMY AND ASTROPHYSICS↗

A Data-Driven Methodology for Contextual Unit Commitment Using Regression Residuals

Day after day, system operators are faced with the challenge of taking unit commitment (UC) decisions under uncertain net load conditions. The standard operating procedure for taking UC decisions begins by leveraging auxiliary data on covariates (such as the day of the week or latest weather information) to generate a point prediction for net load, which is used in solving a deterministic UC problem. Such an approach, however, is known to deliver a notoriously poor out-of-sample (OOS) performance, as it completely disregards the stochastic nature of net load. While stochastic programming models explicitly represent uncertainty, they mostly do so using a generic set of scenarios that neglect covariate observations, squandering useful auxiliary data that could be harnessed to glean insights into uncertainty. In this article, we discuss a contextual stochastic optimization approach to UC, which effectively exploits covariate observations while explicitly assessing uncertainty so as to boost the OOS performance of UC decisions. The key thrust of our approach is to leverage regression models, along with their empirical residuals, to set up and solve sample average approximation problems. Not only do we prove that our approach satisfies the requisite conditions for asymptotic optimality and consistency laid out in (Kannan et al., 2022), but we also assess its performance on several case studies conducted using real-world data collected in California ISO and New York ISO grids. In conclusion, results show that the proposed approach can significantly improve OOS performance compared to alternative methods proposed in the literature under varying dataset sizes.

Yurdakul, Ogun↗

A Scalable Interior‐Point Gauss–Newton Method for PDE‐Constrained Optimization With Bound Constraints

Here, we present a scalable approach to solve a class of partial differential equation (PDE)‐constrained optimization problems with bound constraints. This approach utilizes a robust full‐space interior‐point (IP)‐Gauss–Newton optimization method. To cope with the poorly‐conditioned IP‐Gauss–Newton saddle‐point linear systems that need to be solved approximately, once per optimization step, we propose two spectrally related preconditioners. These preconditioners leverage the limited informativeness of data in regularized PDE‐constrained optimization problems. A block Gauss–Seidel preconditioner is proposed for the GMRES‐based solution of the IP‐Gauss–Newton linear systems. It is shown, for a large‐class of PDE‐ and bound‐constrained optimization problems, that the spectrum of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix is asymptotically independent of discretization and is not impacted by the ill‐conditioning that notoriously plagues interior‐point methods. We exploit symmetry of the IP‐Gauss–Newton linear systems and propose a regularization and log‐barrier Hessian preconditioner for the preconditioned conjugate gradient (PCG)‐based solution of the equivalent IP‐Gauss–Newton–Schur complement linear systems. The eigenvalues of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix, that are not equal to one, are identical to the eigenvalues of the regularization and log‐barrier Hessian preconditioned Schur complement matrix. The scalability of the approach is demonstrated on two example problems. The numerical solution of these optimization problems is shown to require a discretization independent number of IP‐Gauss–Newton linear solves. Furthermore, the linear systems are solved in a discretization and IP ill‐conditioning independent number of preconditioned Krylov subspace iterations. The parallel scalability of the preconditioner, achieved via algebraic multigrid component solvers when applicable, and the aforementioned algorithmic scalability permits a parallel scalable means to compute solutions of a large class of PDE‐ and bound‐constrained problems.

PDE-constrained optimization↗

Access to Mars from Earth-Moon Libration Point Orbits:

This investigation is focused specifically on transfers from Earth-Moon L(sub 1)/L(sub 2) libration point orbits to Mars. Initially, the analysis is based in the circular restricted three-body problem to utilize the framework of the invariant manifolds. Various departure scenarios are compared, including arcs that leverage manifolds associated with the Sun-Earth L(sub 2) orbits as well as non-manifold trajectories. For the manifold options, ballistic transfers from Earth-Moon L(sub 2) libration point orbits to Sun-Earth L(sub 1)/L(sub 2) halo orbits are first computed. This autonomous procedure applies to both departure and arrival between the Earth-Moon and Sun-Earth systems. Departure times in the lunar cycle, amplitudes and types of libration point orbits, manifold selection, and the orientation/location of the surface of section all contribute to produce a variety of options. As the destination planet, the ephemeris position for Mars is employed throughout the analysis. The complete transfer is transitioned to the ephemeris model after the initial design phase. Results for multiple departure/arrival scenarios are compared.

Dynamical Systems↗

Proto-Examples of Data Access and Visualization Components of a Potential Cloud-Based GEOSS-AI System

Once a research or application problem has been identified, one logical next step is to search for available relevant data products. Thus, an early component of a potential GEOSS-AI system, in the continuum between observations and end point research, applications, and decision making, would be one that enables transparent data discovery and access by users. Such a component might be effected via the systems data agents. Presumably, some kind of data cataloging has already been implemented, e.g., in the GEOSS Common Infrastructure (GCI). Both the agents and cataloging could also leverage existing resources external to the system. The system would have some means to accept and integrate user-contributed agents. The need or desirability for some data format internal to the system should be evaluated. Another early component would be one that facilitates browsing visualization of the data, as well as some basic analyses.Three ongoing projects at the NASA Goddard Earth Sciences Data and Information Services Center (GES DISC) provide possible proto-examples of potential data access and visualization components of a cloud-based GEOSS-AI system. 1. Reorganizing data archived as time-step arrays to point-time series (data rods), as well as leveraging the NASA Simple Subset Wizard (SSW), to significantly increase the number of data products available, at multiple NASA data centers, for production as on-the-fly (virtual) data rods. SSWs data discovery is based on OpenSearch. Both pre-generated and virtual data rods are accessible via Web services. 2. Developing Web Feature Services to publish the metadata, and expose the locations, of pre-generated and virtual data rods in the GEOSS Portal and enable direct access of the data via Web services. SSW is also leveraged to increase the availability of both NASA and non-NASA data.3.Federating NASA Giovanni (Geospatial Interactive Online Visualization and Analysis Interface), for multi-sensor data exploration, that would allow each cooperating data center, currently the NASA Distributed Active Archive Centers (DAACs), to configure its own Giovanni deployment, while also allowing all the deployments to incorporate each others data. A federated Giovanni comprises Giovanni Virtual Machines, which can be run on local servers or in the cloud.

access↗

Enhancing Discovery, Search, and Access of NASA Hydrological Data by Leveraging GEOSS

An ongoing NASA-funded project has removed a longstanding barrier to accessing NASA data (i.e., accessing archived time-step array data as point-time series) for selected variables of the North American and Global Land Data Assimilation Systems (NLDAS and GLDAS, respectively) and other EOSDIS (Earth Observing System Data Information System) data sets (e.g., precipitation, soil moisture). These time series (data rods) are pre-generated. Data rods Web services are accessible through the CUAHSI Hydrologic Information System (HIS) and the Goddard Earth Sciences Data and Information Services Center (GES DISC) but are not easily discoverable by users of other non-NASA data systems. The Global Earth Observation System of Systems (GEOSS) is a logical mechanism for providing access to the data rods. An ongoing GEOSS Water Services project aims to develop a distributed, global registry of water data, map, and modeling services cataloged using the standards and procedures of the Open Geospatial Consortium and the World Meteorological Organization. The ongoing data rods project has demonstrated the feasibility of leveraging the GEOSS infrastructure to help provide access to time series of model grid information or grids of information over a geographical domain for a particular time interval. A recently-begun, related NASA-funded ACCESS-GEOSS project expands on these prior efforts. Current work is focused on both improving the performance of the generation of on-the-fly (OTF) data rods and the Web interfaces from which users can easily discover, search, and access NASA data.

GEOSS↗

$\text{GPLaSDI}$: Gaussian Process-based interpretable Latent Space Dynamics Identification through deep autoencoder

Numerically solving partial differential equations (PDEs) can be challenging and computationally expensive. This has led to the development of reduced-order models (ROMs) that are accurate but faster than full order models (FOMs). Recently, machine learning advances have enabled the creation of non-linear projection methods, such as Latent Space Dynamics Identification (LaSDI). LaSDI maps full-order PDE solutions to a latent space using autoencoders and learns the system of ODEs governing the latent space dynamics. By interpolating and solving the ODE system in the reduced latent space, fast and accurate ROM predictions can be made by feeding the predicted latent space dynamics into the decoder. In this paper, we introduce GPLaSDI, a novel LaSDI-based framework that relies on Gaussian process (GP) for latent space ODE interpolations. Using GPs offers two significant advantages. First, it enables the quantification of uncertainty over the ROM predictions. Second, leveraging this prediction uncertainty allows for efficient adaptive training through a greedy selection of additional training data points. This approach does not require prior knowledge of the underlying PDEs. Consequently, GPLaSDI is inherently non-intrusive and can be applied to problems without a known PDE or its residual. Here we demonstrate the effectiveness of our approach on the Burgers equation, Vlasov equation for plasma physics, and a rising thermal bubble problem. Our proposed method achieves between 200 and 100,000 times speed-up, with up to 7% relative error.

97 MATHEMATICS AND COMPUTING↗

Omega-Limit Sets and Input-To-State Stability in Power Grids with Switching Equilibria

This paper studies a power transmission system with both conventional generators (CGs) and distributed energy assets (DEAs) providing frequency control. We consider an operating condition with demand aggregating two dynamic components: one that switches between different values on a finite set, and one that varies smoothly over time. Such dynamic operating conditions may result from protection scheme activations, external cyber-attacks, or due to the integration of dynamic loads, such as data centers. Mathematically, the dynamics of the resulting system are captured by a system that switches between a finite number of vector fields - or modes -, with each mode having a distinct equilibrium point induced by the demand aggregation. To analyze the stability properties of the resulting switching system, we leverage tools from hybrid dynamic inclusions and the concept of ..omega.. -limit sets from sets. Specifically, we characterize a compact set that is semi-globally practically asymptotically stable under the assumption that the switching frequency and load variation rate are sufficiently slow. For arbitrarily fast variations of the load, we use a level-set argument with multiple Lyapunov functions to establish input-to-state stability of a larger set and with respect to the rate of change of the loads. The theoretical results are illustrated via numerical simulations on the IEEE 39-bus test system.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Data-based and secure switched cyber–physical systems

In this work, we develop a completely model-free moving target defense framework for the detection and mitigation of sensor and/or actuator attacks in cyber–physical systems with dynamics that evolve in discrete-time. We incorporate an intrusion detection mechanism based on an approximate dynamic programming technique that learns the policies for optimal regulation and optimal tracking while simultaneously defending against actuator and sensor attacks in a model-free fashion. Switching rules are leveraged to force proactive and reactive defense mechanisms as well as, guarantee the stability of the equilibrium point. Finally, as a case study, we apply the proposed moving target defense framework to a DC–DC converter that is used in electric vehicles.

42 ENGINEERING↗

Determining the Conformation of Supported Complexes Using an 17 O TEDOR-like NMR Experiment

Dynamic nuclear polarization surface-enhanced nuclear magnetic resonance (NMR) spectroscopy has enabled the determination of the three-dimensional configuration of surface sites, in particular supported metal complexes of relevance to single-site heterogeneous catalysis. These approaches have chiefly leveraged the application of NMR double-resonance experiments that either reveal the complex conformation via point-to-point intramolecular distances between spin-labeled atoms or the complex-surface orientation via distances between the spins and the surface plane. Either method typically requires expensive isotope labeling and each reports on different structural features. The application of an experiment that simultaneously reveals both types of distances with chemical resolution would be ideal. Here, in this article, we describe an 17 O{ 1 H} pseudo-3D correlation experiment that achieves this goal. Specifically, Si–O–Si and Si–O–M oxygens are well-resolved by 17 O NMR; therefore, distances can be simultaneously measured radially, between Si– 17 O–M and the 1 H’s of the ligands, and vertically to the Si– 17 O–Si linkages of the silica support. We demonstrate the experiment using supported yttrium and zirconium complexes. Good agreement is obtained when comparing the experimental results to theoretical predictions from density functional theory calculations, highlighting the reliability of this relatively simple experiment.

alkyls↗

FINETUNA: fine-tuning accelerated molecular simulations

Abstract Progress towards the energy breakthroughs needed to combat climate change can be significantly accelerated through the efficient simulation of atomistic systems. However, simulation techniques based on first principles, such as density functional theory (DFT), are limited in their practical use due to their high computational expense. Machine learning approaches have the potential to approximate DFT in a computationally efficient manner, which could dramatically increase the impact of computational simulations on real-world problems. However, they are limited by their accuracy and the cost of generating labeled data. Here, we present an online active learning framework for accelerating the simulation of atomic systems efficiently and accurately by incorporating prior physical information learned by large-scale pre-trained graph neural network models from the Open Catalyst Project. Accelerating these simulations enables useful data to be generated more cheaply, allowing better models to be trained and more atomistic systems to be screened. We also present a method of comparing local optimization techniques on the basis of both their speed and accuracy. Experiments on 30 benchmark adsorbate-catalyst systems show that our method of transfer learning to incorporate prior information from pre-trained models accelerates simulations by reducing the number of DFT calculations by 91%, while meeting an accuracy threshold of 0.02 eV 93% of the time. Finally, we demonstrate a technique for leveraging the interactive functionality built in to Vienna ab initio Simulation Package (VASP) to efficiently compute single point calculations within our online active learning framework without the significant startup costs. This allows VASP to work in tandem with our framework while requiring 75% fewer self-consistent cycles than conventional single point calculations. The online active learning implementation, and examples using the VASP interactive code, are available in the open source FINETUNA package on Github.

97 MATHEMATICS AND COMPUTING↗

Distributionally Robust Decentralized Volt-Var Control With Network Reconfiguration

Here, this paper presents a decentralized volt-var optimization (VVO) and network reconfiguration strategy to address the challenges arising from the growing integration of distributed energy resources, particularly photovoltaic (PV) generation units, in active distribution networks. To reconcile control measures with different time resolutions and empower local control centers to handle intermittency locally, the proposed approach leverages a two-stage distributionally robust optimization; decisions on slow-responding control measures and set points that link neighboring subnetworks are made in advance while considering all plausible distributions of uncertain PV outputs. We present a decomposition algorithm with an acceleration scheme for solving the proposed model. Numerical experiments on the IEEE 123 bus distribution system are given to demonstrate its outstanding out-of-sample performance and computational efficiency, which suggests that the proposed method can effectively localize uncertainty via risk-informed proactive timely decisions.

24 POWER TRANSMISSION AND DISTRIBUTION↗