Engineering PapersSearch

SEARCH · Engineering Papers

Results for “temporal computing”

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

PMU Data Quality and Sensor Health Monitoring

Phasor Measurement Units (PMUs) play a critical role in the evolution of the electric power industry by providing high-precision, real-time monitoring of essential power system metrics. However, effectively detecting abnormalities and critical events from PMU data is a complex task, complicated by intricate temporal patterns, a scarcity of labeled data for training algo- rithms, and constraints on online computational power. In this study, we apply TranAD, an innovative algorithm that combines transformer architectures with the refinement of adversarial learning, to both synthetic and real-world PMU datasets for developing a data quality and sensor online health monitoring platform for utilities. Our findings reveal that TranAD not only provides efficient detection and localization but also enhances the detail with which abnormalities are detected, marking a a significant step forward in the field of clean data acquisition processes for power system monitoring

deep neural network, machine learning (ML)

Alternating Direction Decomposition with Strong Bounding and Convexification (ADDSBC) for Solving Security Constrained AC Unit Commitment Problems

This project aims to develop efficient and robust computational methods for solving the security-constrained unit commitment and alternating current optimal power flow problem (SC-UC-ACOPF). The SC-UC-ACOPF problem is at the center of the short-term operation of the U.S. Power Grid. It is solved every week, every day, and every 10 minutes to plan for the optimal action of electricity generation and consumption by minimizing the generation cost and maintaining power system reliability against potential disruptions of equipment failures. In mathematical terms, SC-UC-ACOPF is a challenging large-scale mixed-integer nonlinear optimization model. This means that the decisions involve both discrete variables, e.g. the turning on and off of generators and switching of transmission lines and transformers, and continuous decisions, e.g. the amount of energy generated by each generator and the power flows in the power grid. The physics of the power flow is described by nonlinear equations involving real and reactive power and bus voltages. Another key feature is the large number of contingencies, i.e. the system needs to stay reliable in face of failure of any one equipment, such as transmission lines and generators. The U.S. power grids are extremely complicated and large scale with more than 5,000 generators, 50,000 buses, and 100,000 high-voltage transmission lines, making the SC-UC-ACOPF a very large-scale computation challenge. The research developed in this project aims to solve the SC-UC-ACOPF problems in the three timescales, i.e. weekly, daily, and every 10-min. The proposed computational methods are built on a principled algorithmic approach of decomposition and penalization. More specifically, the algorithm develops spatial and temporal decomposition by exploiting the strong temporal coupling and weak spatial coupling of the UC problem and the complementary feature, i.e. weak temporal coupling and strong spatial coupling of the ACOPF problem. The algorithm also leverages recent progresses in strong convex relaxation of ACOPF. A unique feature of the proposed approach is that it generates a valid, global upper bound on the optimal maximum profit. In this way, a global optimality gap is available to measure the quality of the solution. To further speed up computation, the research team has developed a plethora of effective heuristics to strengthen the iterative penalty-based decomposition framework. For instance, a heuristic is developed to construct inner approximations of the time coupling constraints within the time decoupled problems. Contingencies are pre-screened and low-rank matrix computation is exploited to find the almost unique solution to each contingency. A novel heuristic for line switching is proposed and tested with positive impacts on instances where line switching is beneficial. Taking a systematic approach and carefully handling every detail of the problem pays off. The TIM-GO’s performance throughout the trials and the final event was stellar. TIM-GO garnered the second highest total prize money and is ranked in the top three positions across all categories of comparison.

97 MATHEMATICS AND COMPUTING

Forecasting high-dimensional spatio-temporal systems from sparse measurements

This paper introduces a new neural network architecture designed to forecast high-dimensional spatio-temporal data using only sparse measurements. The architecture uses a two-stage end-to-end framework that combines neural ordinary differential equations (NODEs) with vision transformers. Initially, our approach models the underlying dynamics of complex systems within a low-dimensional space; and then it reconstructs the corresponding high-dimensional spatial fields. Many traditional methods involve decoding high-dimensional spatial fields before modeling the dynamics, while some other methods use an encoder to transition from high-dimensional observations to a latent space for dynamic modeling. In contrast, our approach directly uses sparse measurements to model the dynamics, bypassing the need for an encoder. This direct approach simplifies the modeling process, reduces computational complexity, and enhances the efficiency and scalability of the method for large datasets. We demonstrate the effectiveness of our framework through applications to various spatio-temporal systems, including fluid flows and global weather patterns. Although sparse measurements have limitations, our experiments reveal that they are sufficient to forecast system dynamics accurately over long time horizons. Our results also indicate that the performance of our proposed method remains robust across different sensor placement strategies, with further improvements as the number of sensors increases. This robustness underscores the flexibility of our architecture, particularly in real-world scenarios where sensor data is often sparse and unevenly distributed.

97 MATHEMATICS AND COMPUTING

Spatio–Temporal Machine Learning for Regional to Continental Scale Terrestrial Hydrology

Integrated hydrologic models can simulate coupled surface and subsurface processes but are computationally expensive to run at high resolutions over large domains. Here we develop a novel deep learning model to emulate subsurface flows simulated by the integrated ParFlow–CLM model across the contiguous US. We compare convolutional neural networks like ResNet and UNet run autoregressively against our novel architecture called the Forced SpatioTemporal RNN (FSTR). The FSTR model incorporates separate encoding of initial conditions, static parameters, and meteorological forcings, which are fused in a recurrent loop to produce spatiotemporal predictions of groundwater. We evaluate the model architectures on their ability to reproduce 4D pressure heads, water table depths, and surface soil moisture over the contiguous US at 1 km resolution and daily time steps over the course of a full water year. The FSTR model shows superior performance to the baseline models, producing stable simulations that capture both seasonal and event–scale dynamics across a wide array of hydroclimatic regimes. The emulators provide over 1,000× speedup compared to the original physical model, which will enable new capabilities like uncertainty quantification and data assimilation for integrated hydrologic modeling that were not previously possible. Our results demonstrate the promise of using specialized deep learning architectures like FSTR for emulating complex process–based models without sacrificing fidelity.

54 ENVIRONMENTAL SCIENCES

Performance Improvements of the Griffin Solvers in FY24

The Griffin code is a MOOSE-based reactor physics application jointly developed by Idaho National Laboratory and Argonne National Laboratory under the Department of Energy Office of Nuclear Energy Nuclear Energy Advanced Modeling and Simulation Program. This fiscal year, we have made significant efforts to improve the performance of transport solver options and cross-section generation for the efficient use of Griffin in advanced reactor applications. For the HFEM-PN solver, the residual evaluations of HFEM kernels were optimized by utilizing the pre- computed averaged cross sections for individual elements. Numerical integration involving the evaluation of basis functions at quadrature points was bypassed by facilitating precomputed element mass matrices for response matrices. Red-black iterations were improved by introducing a new generalized minimum residual based solver. The memory usage of response matrix storage was significantly reduced by applying basis function rotations on interfaces and calculating volumetric odd-parity moments on the fly. Additionally, the adjoint flux and transient calculation capabilities of the HFEM-PN solver were successfully implemented and verified using the TWIGL benchmark problem. For the DFEM-SN solver, memory footprint and computation time were significantly reduced by not treating angular flux vectors as the MOOSE nonlinear system vectors. Specifically for IQS, scalar adjoint weighting was introduced to further eliminate angular adjoint flux storage in the MOOSE auxiliary system. It was demonstrated through the three-dimensional Advanced Burner Test Reactor core problem that the memory usage for transient calculations with the IQS method was reduced by over 7.5× compared to before the optimizations. For the self-shielding application programming interface, a new double-heterogeneity treatment method, named the Bell Function-Based Analytic Two-Region Slowing Down Method, was developed to efficiently flux-volume homogenize TRISO particles with the matrix. Additionally, optimizations were made to hyper- fine group (HFG) slowing down calculations by pretabulating collision probability coefficients and grouping isotopes, significantly reducing the computational time for calculating scattering sources per HFG. Lastly, the pin power reconstruction module was extended to account for temporal behavior in a microreactor analysis problem, specifically for a control drum transient. Verification tests for each of these improvements demonstrated significant performance enhancements and memory reduction.

22 - GENERAL STUDIES OF NUCLEAR REACTORS

Compactly‐Supported Nonstationary Kernels for Computing Exact Gaussian Processes on Big Data

The Gaussian process (GP) is a widely used method for analyzing large-scale data sets, including spatio-temporal measurements of nonlinear processes that are now commonplace in the environmental sciences. Traditional implementations of GPs involve stationary kernels (also termed covariance functions) that limit their flexibility, and exact methods for inference that prevent application to data sets with more than about 10,000 points. Modern approaches to address stationarity assumptions generally fail to accommodate large data sets, while all attempts to address scalability focus on approximating the Gaussian likelihood, which can involve subjectivity and lead to inaccuracies. In this work, we explicitly derive an alternative kernel that can discover and encode both sparsity and nonstationarity. We embed the kernel within a fully Bayesian GP model and leverage high-performance computing resources to enable the analysis of massive data sets. We demonstrate the favorable performance of our novel kernel relative to existing exact and approximate GP methods across a variety of synthetic data examples. Furthermore, we conduct space–time prediction based on more than 1 million measurements of daily maximum temperature and verify that our results outperform state-of-the-art methods in the Earth sciences. More broadly, having access to exact GPs that use ultra-scalable, sparsity-discovering, nonstationary kernels allows GP methods to truly compete with a wide variety of machine learning methods.

Gaussian processes

ObstacleSense: Low-Power Neuromorphic Vision for Corridor Obstacle Awareness in Low-Level ADAS

The automotive industry’s pursuit of Level 5 autonomy is constrained by substantial perception-compute power requirements, often reaching 1, 000 + watts in full autonomy stacks. Reducing this energy burden requires rethinking perception not only at the high-end autonomy level, but also at the foundational Advanced Driver Assistance Systems (ADAS) level where low-power, safety-critical sensing can have broad impact. Neuromorphic vision provides a promising starting point: HD Dynamic Vision Sensors (DVS) can operate below 100 mW at the sensor level by reporting only asynchronous brightness changes. However, low-power sensing alone is insufficient if downstream perception reintroduces dense, energy-intensive computation. In particular, many event-driven object-detection pipelines still rely on CNN backbones, while purely spiking alternatives often trade away accuracy or ignore deployment constraints. We introduce ObstacleSense, a highly compact, CNN-free hybrid ANN–SNN framework for Level 0–1 forward-corridor obstacle awareness. Instead of performing full-scene object detection with a convolutional feature backbone, ObstacleSense targets the safety-critical question of whether the ego corridor is occupied and how far the nearest obstacle is. The architecture combines polarity-conditioned event encoding, lightweight temporal spiking dynamics, axial spatial mixing, and coarse-to-fine range estimation within a regular fixed-grid compute pattern. This design avoids the dense CNN backbone commonly used in event-based detection while maintaining a small state footprint suitable for eventual small-FPGA deployment. Before hardware mapping, we evaluate the software implementation using a model-side power proxy derived from MACs, weight and activation traffic, and spiking state updates under shared FP16 assumptions. On simulated CARLA event corpora, the deployment-oriented model achieves 0.9464 objectness F1, 0.9978 grid-level mAP, and 0.8987 m distance Mean Absolute Error at an estimated 1.92 mW proxy cost, while maintaining performance on unseen generalization test sequences.

Johnson-Scott, Zac [ORNL]

Localization of infrasonic sources via Bayesian back projection

SUMMARY A Bayesian framework is investigated for event-specific localization of infrasonic sources using back projection ray tracing. Direction-of-arrival information from array-based detection analysis is used to initialize a back projection ray path originating from the detecting array location and quantifying propagation characteristics from hypothetical source locations. The Fisher statistic, computed from the array’s beam coherence, is mapped into uncertainty in the launch angles of the ray path. Auxiliary parameters previously introduced for solving the Transport equation to compute geometric spreading along ray paths are used to map uncertainty in the ray launch angles into spatial and temporal uncertainties in the ray path. An atmospheric ensemble approach is applied to account for atmospheric uncertainty, and the relation between uncertainties in the atmospheric state and confidence in estimated localization are evaluated using several ensembles with specified variances. The method is evaluated using a synthetic event in the western United States constructed via forward propagation simulations as well as a single-station, multi-arrival detection from a surface explosion in the western United States. Localization results using this event-specific approach are more accurate and exhibit improved precision than existing Bayesian localization methods that leverage generalized, pre-computed propagation statistics.

58 GEOSCIENCES

Generalized approach for rapid entropy calculation of liquids and solids

We build a comprehensive methodology for the fast computation of entropy across both solid and liquid phases. The proposed method utilizes a single trajectory of molecular dynamics (MD) to facilitate the calculation of entropy, which is composed of three components. The electronic entropy is determined through the temporal average acquired from density functional theory MD simulations. The vibrational entropy, typically the predominant contributor to the total entropy, even within the liquid state, is evaluated by computing the phonon density of states via the velocity autocorrelation function. The most arduous component to quantify, the configurational entropy, is assessed by probability analysis of the local structural arrangement and atomic distribution. We illustrate, through a variety of examples, that this method is both a versatile and valid technique for characterizing the thermodynamic states of both solids and liquids. Furthermore, this method is employed to expedite the calculation of melting temperatures, demonstrating its practical utility in computational thermodynamics.

36 MATERIALS SCIENCE

Using Ultrafast Entangled Photon Correlations to Measure the Temporal Evolution of Optically Excited Molecular Entanglement (Final Technical Report)

The goal of this project is to build an ultrafast entangled photon spectrometer and use it to measure theoretical predictions that photoexcited states are enhanced by spin-photon interactions. Entanglement of two states describes a specific type of quantum superposition in which measuring one state gives information about a second state. While entanglement is well explored for quantum information and computing systems, its effects on photoexcited states are less understood, especially in the ultrafast domains of molecular vibronic coupling. The grant designs a frequency and temporally resolved entangled photon spectrometer and uses it to test theoretical predictions like enhanced two photon absorption, non-reciprocal Fourier relations, and coupling of photons to spin systems. The end goal of the project is an understanding of how, when, and where entanglement is useful for spectroscopy.

47 OTHER INSTRUMENTATION

Explainable AI for Multivariate Time Series Pattern Exploration: Latent Space Visual Analytics With Temporal Fusion Transformer and Variational Autoencoders in Power Grid Event Diagnosis

Detecting and analyzing complex patterns in multivariate time-series data is crucial for decision-making in urban and environmental system operations. However, challenges arise from the high dimensionality, intricate complexity, and interconnected nature of complex patterns, which hinder the understanding of their underlying physical processes. Existing AI methods often face limitations in interpretability, computational efficiency, and scalability, reducing their applicability in real-world scenarios. This paper proposes a novel visual analytics framework that integrates two generative AI models, Temporal Fusion Transformer (TFT) and Variational Autoencoders (VAEs), to reduce complex patterns into lower-dimensional latent spaces and visualize them in 2D using dimensionality reduction techniques such as PCA, t-SNE, and UMAP with DBSCAN. These visualizations, presented through coordinated and interactive views and tailored glyphs, enable intuitive exploration of complex multivariate temporal patterns, identifying patterns’ similarities and uncover their potential correlations for a better interpretability of the AI outputs. The framework is demonstrated through a case study on power grid signal data, where it identifies multi-label grid event signatures, including faults and anomalies with diverse root causes. Additionally, novel metrics and visualizations are introduced to validate the models and assess the performance, efficiency, and consistency of latent maps generated by VAE, which have been utilized in prior studies for latent space cartography and used as a benchmark in this study, and the emerging TFT architecture under various configurations. These analyses provide actionable insights for model parameter tuning and reliability improvements. Comparative results highlight that TFT achieves shorter run times and superior scalability to diverse time-series data shapes compared to VAE. This work advances fault diagnosis in multivariate time series, fostering explainable AI to support critical system operations.

Explainable AI

Mapping the nonequilibrium order parameter of a quasi-two dimensional charge density wave system

The driving force of a charge density wave (CDW) transition in quasi-two dimensional systems is still debated, while being crucial in understanding electronic correlation in such materials. Here we use femtosecond time- and angle-resolved photoemission spectroscopy combined with computational methods to investigate the coherent lattice dynamics of a prototypical CDW system. The photo-induced temporal evolution of the periodic lattice distortion associated with the amplitude mode reveals the dynamics of the free energy functional governing the order parameter. Our approach establishes that optically-induced screening rather than CDW melting at the electronic level leads to a transiently modified potential which explains the anharmonic behaviour of the amplitude mode and discloses the structural origin of the symmetry-breaking phase transition.

electronic properties and materials

External Radiation and Magnetic-Field Effects on the Coherence and Stability of Transmon Qubits

Superconducting transmon qubits are a central building block of modern quantum computing architectures, yet their coherence properties remain sensitive to external influences that can limit performance or introduce temporal instabilities. In this talk, I will discuss two experimental studies aimed at quantifying these effects. First, I will examine how ionizing radiation impacts qubit relaxation. Using the same transmon device operated at two locations with dramatically different radiation backgrounds—the above-ground SQMS facility at Fermilab (USA) and the deep-underground Gran Sasso Laboratory (Italy)—we observe a higher rate of radiation-induced decay events above ground, even though intrinsic noise remains the dominant source of single-shot errors. I will also discuss the detection efficiency of a radiation detector made using such a device. Second, I will present results on how small magnetic fields, applied either during cooldown or at millikelvin temperatures, influence device stability. We find that fixed-frequency transmons maintain robust coherence up to approximately 600 mG of trapped out-of-plane field, and that controlled application of magnetic field can reduce temporal fluctuations in T1. Together, these studies provide insight into how external environments shape transmon coherence and offer potential pathways for improving qubit stability in scalable quantum processors.

Roy, Tanay [Fermilab]

Nonsteady Load Responses of Wind Turbines to Atmospheric and Mountain-Generated Turbulence Eddies, With Impacts on the Main Bearing: A Validation Study

Previous computational and field experiments identify three characteristic time scales in the aerodynamic responses of utility-scale wind turbine loads to atmospheric boundary layer (ABL) turbulence: a 30-90 second time scale for the passage of high/low speed "streaks" through the rotor plane, the blade and rotor rotation time scales (approximately 1 to 5 seconds), and a sub-second time scale created by blade rotation through gradients within eddy coherent structure. In the current study we compare aerodynamic load responses from daytime ABL turbulence quantified with large-eddy simulation and a actuator line model of the NREL 5 MW wind turbine with analysis of field data from the NREL/GE 1.5 MW wind turbine 5 kilometers east of the Rocky Mountain Front Range in Colorado. In addition, we contrast the responses to the passage of the mountain-generated eddies embedded within the westerly winds with the ABL eddies embedded within northerly/southerly winds. These analyses are in context with the nonsteady forcing of the main bearing by the aerodynamic generation of nontorque bending moments on the main shaft. Potentially relevant to main bearing failure mechanisms, both computational and field data show that the magnitudes of turbulence-generated nontorque bending moments, that we show generate nonsteady force on the main bearing, are of order, and often larger than, torque (which underlies power). However, the temporal variations in these two responses are uncorrelated, implying that the aerodynamic mechanisms that drive power and main bearing response are fundamentally different. We find this to be the case in the field with both mountain-generated eddies (westerly winds) and ABL-generated eddies (northerly/southerly winds). Whereas the time and length scales are comparable, the mountain eddies were somewhat more energetic than the northerly/southerly ABL eddies. Interestingly, however, the fluctuations in nontorque bending moment that force the main bearing were found to be stronger when forced by the ABL eddies than the mountain eddies. The field studies validate the key results from the computational study and show even stronger response in the nontorque bending moment than in the computer simulations. In all cases, the torque and nontorque bending moments are temporally uncorrelated, torque and power are driven by time variations in rotor-averaged horizontal wind velocity and nontorque bending moments are driven by time changes in the degree of nonuniformity in the distribution of velocity over the rotor plane. Thus the results generalize the mechanisms underlying nonsteady aerodynamic forcing to classes of turbulence eddy types with strength of order or stronger than ABL eddies with transverse scale of order the wind turbine rotor. These include atmospheric turbulence eddies, topography-generated turbulence eddies and, by extension, impacts of turbine-wake-scale turbulence eddies on downstream wind turbine rotors.

17 WIND ENERGY

Hybrid learning techniques for scientific data reduction with performance guarantees

The research initiatives supported by the U.S. Department of Energy (DOE) Grant DE-SC0022265 are fundamentally aimed at pioneering advanced machine learning (ML) techniques for scientific data compression within high-performance computing (HPC) environments. This comprehensive body of work addresses the critical challenge posed by the exponential growth of data generated by scientific simulations in domains such as fusion energy, climate modeling, and computational fluid dynamics (CFD). A core objective is to develop compression algorithms that achieve substantial data reduction—often by orders of magnitude—while rigorously ensuring the fidelity of both the primary data (PD) and scientifically crucial derived quantities of interest (QoI). The methodologies deployed under this grant integrate sophisticated deep learning architectures, prominently featuring autoencoders, advanced generative models like conditional diffusion, and hybrid learning techniques. Key innovations include the development of Guaranteed Autoencoders (GAE) and the Guaranteed Conditional Diffusion with Tensor Correction (GCDTC) framework, which provide explicit, instance-level error bounds on reconstructed data. Furthermore, specialized strategies such as nonlinear constraint satisfaction are employed to preserve the integrity of QoI, a vital requirement for the trustworthiness of downstream scientific analyses. This research also focuses on the design and implementation of scalable, GPU-accelerated software pipelines that seamlessly integrate into existing HPC workflows, ensuring both computational efficiency and practical applicability. The CAESAR framework, for example, unifies foundation and generative models to create an adaptive and efficient compression solution for spatio-temporal scientific data. Collectively, these efforts represent a significant advancement in mitigating the scientific data deluge, enabling more effective data management, accelerated scientific discovery, and optimized utilization of HPC resources.

97 MATHEMATICS AND COMPUTING

Enriching OpenStreetMap network data for transportation applications: Insights into the impact of urban congestion on accessibility

OpenStreetMap (OSM) data is a valuable open-source resource for various transportation, traffic, and planning applications. However, OSM network data lack operating traffic speed information, which is critical for transport planning and operations. Addressing this shortcoming, this study leverages commercial vendor data (to serve as ground truth) with exogenous, open-source variables characterizing local transport infrastructure, land use, and demographic information to predict average congested traffic speeds on OSM networks. Three machine-learning models were tested and estimated for OSM links with and without speed limit information in the Denver metropolitan region. Among these, XGBoost performed best, with mean absolute errors of 3.27 and 3.62 mph for links with and without speed limits, respectively. The developed models accurately predicted traffic speeds for different hours and days of the week compared to ground truth data. Using these predicted speeds, drive accessibility scores were computed for the Denver region for different time periods using the Mobility Energy Productivity (MEP) metric to understand the impact of congestion on energy-efficient accessibility. Results show that congestion-adjusted drive accessibility can be significantly lower compared to accessibility calculated using free flow speeds. Specifically, weekday evening hours saw a 42 % drop in accessibility due to reduced speeds, particularly around downtown Denver. Across the Denver metro region, approximately half as many opportunities and jobs are accessible in under 20 min by car during the evening peak period relative to free flow conditions. These findings underscore the importance of using congestion-adjusted operating speeds rather than speed limits in accessibility calculations, as reliance on speed limits can substantially overestimate energy-efficient drive accessibility in large, car-centric cities susceptible to significant congestion. In conclusion, the methodology presented here could further enrich OSM network data, making them useful for an even broader range of transportation applications.

29 ENERGY PLANNING, POLICY, AND ECONOMY

FLAMES─Fast, Low-Storage, Accurate, and Memory-Efficient Adaptive Sampling─Approach to Resolve Spatially Dependent Dynamics of Molecular Liquids

Many critical phenomena in soft matter occur at large length scales, necessitating the resolution of their structure and dynamics at low wavenumbers. However, resolving wavenumber-dependent dynamics computationally via molecular dynamics simulations presents significant challenges, as these phenomena span several orders of magnitude in both time and length scales, resulting in high computational costs and memory demands. Here, this work highlights the computational and memory challenges associated with analyzing molecular trajectories in reciprocal space and demonstrates a method to address them. We introduce FLAMESFast, Low-storage, Accurate, and Memory-Efficient adaptive Sampling, which is a direct method for calculation of structure factors, allowing us to select only the required number of wavevectors for binning. We also use wavenumber-dependent time steps to extract dynamics. Our FLAMES approach effectively mitigates computational and memory/storage bottlenecks. We demonstrate the method using simulations of a model system, liquid octane, at various temperatures. Comparisons with experimental data and real space computation show that the FLAMES technique achieves high accuracy in resolving temperature- and spatially dependent dynamics while being significantly more computationally efficient and requiring less memory and storage than methods based on a uniform wavevector grid and fixed temporal spacing.

Chen, Guang [Argonne National Laboratory (ANL), Ar

Spatiotemporally Registered In-Situ and Ex-Situ Datasets for Laser-based Blown Powder Directed Energy Deposition

This dataset is comprised of in situ sensing data collected during laser-based, blown powder directed energy deposition (DED) of Inconel 718 representing eight different printing conditions: (1) nominal, (2) +15% scan speed, (3) +12% laser power, (4) +42% powder feed rate, (5) +100% jerk limit, (6) +10% layer height, (7) +20% hatch spacing, (8) +20% carrier gas flow. All eight DED builds constructed an identical test coupon geometry consisting of geometric features representative of industrial print requirements (e.g., bulk deposition, thin walls, overhangs). In situ data consists of xyz-coordinates (100 Hz) and on-axis melt pool camera video (60 Hz), both of which have been temporally synchronized to spatially map the melt pool camera data. In addition, post-build X-ray computed tomography (XCT) data for each of the eight test geometries have been spatially registered to the recorded xyz-coordinates, allowing for comparisons between melt pool camera data and flaws identified in the XCT data.

additive manufacturing