SEARCH · Engineering Papers
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.
This final report describes the successful demonstration of AI‑assisted waste sorting and a novel pressurized solids feed system to enable conversion of non‑recyclable municipal solid waste to jet fuel under DOE Award DE‑EE0009265. Results include improved feedstock purity and variability reduction, lab‑scale testing, and technoeconomic and life‑cycle assessments.
This Summary slide deck summarizes the key outcomes of the Advanced Transmission Technologies (ATTs) supplier cohort, part of Idaho National Laboratory’s (INL) Technical Assistance for Digital Assurance (TADA) program. The program aimed to strengthen grid resilience through cybersecurity controls, supply-chain security, and Cyber-Informed Engineering (CIE) for advanced transmission technologies. The cohort brought together vendors representing the full range of Grid-Enhancing Technologies (GETs), including providers of Dynamic Line Ratings (DLR), Advanced Power Flow Control (APFC), Transmission Topology Optimization (TTO), and High-Performance Conductors (HPCs). Discussions focused on institutional, integration, and operational barriers limiting GET adoption; cybersecurity risks at EMS/SCADA, cloud, and network integration points; and supply-chain transparency issues such as semiconductor dependence and SBOM/HBOM expectations. Participants also addressed operator trust, human-in-the-loop requirements, and challenges with utility adoption, while exploring how CIE can support secure deployment of GETs. This deck represents a consolidated summary of challenges and risks identified by vendors, cross-cutting themes and technology-specific insights from three cohort workshops, and actionable mitigations to guide utilities, vendors, and the Department of Energy in advancing secure, trusted deployment of GETs.
The aim of this project is to develop software and hardware for fast real-time data processing and autonomous detector control and calibration for the sPHENIX and the future EIC experiments. Below summarizes Georgia Tech team efforts in the past year: 1. We developed a real-time clustering algorithm and FPGA-based pipeline architecture for processing fired pixel data from ALPIDE sensors in sPHENIX experiments. Our Columnar Clustering Co-Design introduces a hardware-aware, stream-friendly approach that segments pixel data by column pairs using a Column Pair Clustering (CPC) strategy, followed by Cluster Stitching to merge adjacent subclusters. Implemented in Vitis HLS, the pipeline comprises five stages—read-in, subclustering, stitching, analysis, and write-out—connected by tagged HLS streams with custom end-of-event signaling for robust synchronization. We designed a pipelined dataflow model optimized for throughput, low latency, and minimal buffering, enabling scalable clustering across events of arbitrary size. Our system maintains spatial precision via center-of-mass and shape key extraction and efficiently handles edge cases such as fragmented or nested clusters. Compared against DBSCAN in both software and hardware, our approach demonstrates competitive performance under FPGA constraints. 2. We also conducted a comprehensive algorithm-to-hardware co-design of connected component analysis tailored for sPHENIX experiments, focusing on real-time, low-latency processing using FPGAs and High-Level Synthesis (HLS). Starting from a Python-based particle tracking pipeline, the team translated the core logic—graph traversal via DFS and Union-Find—into an HLS-compatible C++ model, replacing dynamic memory and recursion with static arrays and pipelined control flow. The final design includes a fully streamed and dataflow-compatible Union-Find kernel optimized across five iterations, incorporating loop pipelining, array partitioning, AXI/FIFO interface tuning, and function flattening. Experimental results show up to 14.8× speedup over the CPU baseline, reducing per-graph latency to 1.58 μs and demonstrating strong resource efficiency with only ~7k LUTs and zero BRAM usage. The design maintains functional correctness against the Python reference using a Python-based C-simulation framework and Mean Squared Error metrics. This work validates the potential of HLS-driven FPGA designs for edge-level HEP data acquisition, laying a scalable foundation for future integration with real-time detector pipelines and multi-graph processing systems.
This report summarizes the outcomes of the Data Center Cohort under the Department of Energy’s Technical Assistance for Digital Assurance (TADA) initiative, aimed at enhancing grid resilience through cybersecurity, supply chain risk management (SCRM), and Cyber-Informed Engineering (CIE). The cohort engaged 17 organizations across utilities, data center operators, vendors, and technology providers in three sessions combining presentations, discussions, and exercises. Key topics included AI-driven load behavior, cybersecurity vulnerabilities in UPS/BESS and cooling systems, governance gaps at utility–data center boundaries, and supply chain integrity. Five cross-cutting themes emerged: interconnection architecture vulnerabilities, fragmented governance, AI-driven stability risks, lack of regulatory frameworks, and long-term supply chain concerns. Actionable recommendations were developed, including implementing DMZ segmentation, formalizing vendor access agreements, designing AI workload limits, and advancing standards through NERC and state-level programs. These strategies aim to strengthen resilience, clarify responsibilities, and ensure secure integration of data centers into the grid.
The characterization of Hamiltonians and other components of open quantum dynamical systems plays a crucial role in quantum computing and other applications. Scientific machine learning techniques have been applied to this problem in a variety of ways, including by modeling with deep neural networks. However, the majority of mathematical models describing open quantum systems are linear, and the natural nonlinearities in learnable models have not been incorporated using physical principles. We present a data-driven model for open quantum systems that includes learnable, thermodynamically consistent terms. The trained model is interpretable, as it directly estimates the system Hamiltonian and linear components of coupling to the environment. We validate the model on synthetic two and three-level data, as well as experimental two-level data collected from a quantum device at Lawrence Livermore National Laboratory.
We develop new approximate compilation schemes that significantly reduce the expense of compiling the Quantum Approximate Optimization Algorithm (QAOA) for solving the Max-Cut problem. Our main focus is on compilation with trapped-ion simulators using Pauli-X operations and all-to-all Ising Hamiltonian HIsing evolution generated by Molmer-Sorensen or optical dipole force interactions, though some of our results also apply to standard gate-based compilations. Our results are based on principles of graph sparsification and decomposition; the former reduces the number of edges in a graph while maintaining its cut structure, while the latter breaks a weighted graph into a small number of unweighted graphs. Though these techniques have been used as heuristics in various hybrid quantum algorithms, there have been no guarantees on their performance, to the best of our knowledge. This work provides the first provable guarantees using sparsification and decomposition to improve quantum noise resilience and reduce quantum circuit complexity. For quantum hardware that uses edge-by-edge QAOA compilations, sparsification leads to a direct reduction in circuit complexity. For trapped-ion quantum simulators implementing all-to-all HIsing pulses, we show that for a (1−ϵ) factor loss in the Max-Cut approximation (ϵ>0), our compilations improve the (worst-case) number of HIsing pulses from O(n2) to O(nlog(n/ϵ)) and the (worst-case) number of Pauli-X bit flips from O(n2) to O(nlog(n/ϵ)ϵ2) for n-node graphs. This is an asymptotic improvement for any constant ϵ>0. We demonstrate that significant improvements to the approximation ratio are obtained using decomposition in simulated trapped-ion experiments with dephasing noise. We further present a generic argument showing that sparsification results in an exponentially improved circuit fidelity lower bound in digital computing schemes based on one- and two-qubit gates, which are relevant to a wide variety of hardwares such as superconducting qubits and certain neutral atom or trapped ion setups, and more sophisticated noise models. We anticipate these approximate compilation techniques will be useful tools in a variety of future quantum computing experiments.
The ocean plays an essential role in regulating Earth’s climate, influencing weather conditions, providing sustenance for large populations, moderating anthropogenic climate change, encompassing massive biodiversity, and sustaining the global economy. Human activities are changing the oceans, stressing ocean health, threatening the critical services the ocean provides to society, with significant consequences for human well-being and safety, and economic prosperity. Effective and sustainable monitoring of the physical, biogeochemical state and ecosystem structure of the ocean, to enable climate adaptation, carbon management and sustainable marine resource management is urgently needed. The Argo program, a cornerstone of the Global Ocean Observing System (GOOS), has revolutionized ocean observation by providing real-time, freely accessible global temperature and salinity data of the upper 2,000m of the ocean (Core Argo) using cost-effective simple robotics. For the past 25 years, Argo data have underpinned many ocean, climate and weather forecasting services, playing a fundamental role in safeguarding goods and lives. Argo data have enabled clearer assessments of ocean warming, sea level change and underlying driving processes, as well as scientific breakthroughs while supporting public awareness and education. Building on Argo’s success, OneArgo aims to greatly expand Argo’s capabilities by 2030, expanding to full-ocean depth, collecting biogeochemical parameters, and observing the rapidly changing polar regions. Providing a synergistic subsurface and global extension to several key space-based Earth Observation missions and GOOS components, OneArgo will enable biogeochemical and ecosystem forecasting and new long-term climate predictions for which the deep ocean is a key component. Driving forward a revolution in our understanding of marine ecosystems and the poorly-measured polar and deep oceans, OneArgo will be instrumental to assess sea level change, ocean carbon fluxes, acidification and deoxygenation. Emerging OneArgo applications include new views of ocean mixing, ocean bathymetry and sediment transport, and ecosystem resilience assessment. Implementing OneArgo requires about $100 million annually, a significant increase compared to present Argo funding. OneArgo is a strategic and cost-effective investment which will provide decision-makers, in both government and industry, with the critical knowledge needed to navigate the present and future environmental challenges, and safeguard both the ocean and human wellbeing for generations to come.
Timberline marks the transitions from continuous forests to sparse forests and tundra landscapes. As the spatial distribution and dynamics of timberline are closely associated with regional energy and carbon balance, mapping timberline is important to a wide range of environmental and ecological studies. However, current timberline delineation approaches remain under-developed. We proposed an automatic timberline delineation method based on a seeded region-growing segmentation technique and satellite-derived products of tree fractional cover. We applied our approach to the West Siberian Plain and Alaska treeline regions as defined by the Circumpolar Arctic Vegetation Map. The results demonstrate the effectiveness of the proposed method for the accurate delineation of the timberlines that spatially align well with very-high-resolution satellite images. Based on the delineated timberlines, we find regional-scale tree encroachment to be not as substantial as previously reported. The proposed approach can be applied to understanding climate-induced forest responses and inform forest management practices.
We present an automated and probabilistic method to make prediscovery detections of near-Earth asteroids (NEAs) in archival survey images, with the goal of reducing orbital uncertainty immediately after discovery. We refit the Minor Planet Center's astrometry and propagate the full six-parameter covariance to survey epochs to define search regions. We build low-threshold source catalogs for viable images and evaluate every detected source in a search region as a candidate prediscovery. We eliminate false positives by refitting a new orbit to each candidate and probabilistically linking detections across images using a likelihood ratio. Applied to the Zwicky Transient Facility's (ZTF) imaging, we identify approximately 3000 recently discovered NEAs with prediscovery potential, including a doubling of the observational arc for about 500. We use archival ZTF imaging to make prediscovery detections of the potentially hazardous asteroid 2021 DG1, extending its arc by 2.5 yr and reducing future apparition sky plane uncertainty from many degrees to arcseconds. We also recover 2025 FU24 nearly 7 yr before its first known observation, when its sky plane uncertainty covers hundreds of square degrees across thousands of ZTF images. The method is survey agnostic and scalable, enabling rapid orbit refinement for new discoveries from Rubin, NEO Surveyor, and NEOMIR.
Changing-look active galactic nuclei (CLAGN) feature order-of-magnitude variability in both the continuum and broad line luminosities on months-to-years-long timescales, and are currently unexplained. Simulations have demonstrated that rotating black holes (BHs) sometimes tear apart tilted accretion disks. These tearing events violently restructure the disk on timescales much shorter than a viscous timescale, hinting at a connection to CLAGN. Here, we show that disk tearing can power changing-look events. We report synthetic observations of an extremely high-resolution, three-dimensional, general-relativistic magnetohydrodynamic simulation of a geometrically thin, tilted accretion disk around a rapidly rotating, 10 8 M ⊙ BH. We perform ray-tracing calculations that follow the thermal disk emission to both a line-of-sight camera and to a distribution of cameras in a prescribed torus-like broad-line region (BLR). The continuum photoionizes the BLR, and we calculate the resulting spectrum. Both the continuum and line luminosities undergo order-of-magnitude swings on months-to-years-long timescales. We find shorter, week-long variability driven by the geometric precession of the inner disk and an intraday quasiperiodic oscillation driven by radial breathing of the inner disk. When the torn disk precesses, it causes asymmetric illumination of the BLR, driving time-evolving red-to-blue asymmetries of the broad emission lines that may be a smoking gun for disk tearing. We also make predictions for future photometric observations from ULTRASAT and Vera Rubin Observatory, given a Shakura–Sunyaev–like effective temperature profile, both of which may play an important role in detecting future changing-look events. Future work should consider nonthermal emission, especially from the time-variable corona.
On 2022 September 26, the Double Asteroid Redirection Test (DART) spacecraft intentionally collided with Dimorphos, the moon of the binary asteroid system 65803 Didymos. This collision provided the first full-scale test of a kinetic impactor for planetary defense. Images from DART’s DRACO camera revealed Dimorphos to be an oblate spheroid covered in boulders of varying sizes and shapes. Very little was known about Dimorphos prior to DART’s impact, including its shape, structure, and material properties. Approach observations and those following the DART impact have provided crucial knowledge that narrows the parameter space relevant to modeling the impact into Dimorphos. Here we present the results of a suite of hydrocode simulations of the DART impact on Dimorphos. Despite remaining uncertainties, initial models of DART’s kinetic impact provide important information about the results of DART (e.g., potential crater size and morphology, ejecta mass) and the properties of Dimorphos. Simulations here suggest that Dimorphos has near-surface strength ranging from a few Pascals to tens of kPa, which corresponds to crater sizes of ~40–60 m. Simulated crater sizes provide a crucial comparison metric for the European Space Agency Hera mission when it arrives at the Didymos system. Hera’s measurement of crater size in combination with measurement of Dimorphos’s mass will allow us to assess our simulations and provide the information needed to make the DART impact experiment both the first test of a planetary defense mitigation mission and the first full-scale planetary defense simulation validation exercise.
On 2022 September 26 the Double Asteroid Redirection Test (DART) spacecraft collided with Dimorphos, the moon of the near-Earth asteroid 65803 Didymos, in a full-scale demonstration of a kinetic impactor concept. The companion Light Italian Cubesat for Imaging of Asteroids (LICIACube) spacecraft documented the aftermath, capturing images of the expansion and evolution of the ejecta from 29 to 243 s after the impact. We present results from our analyses of these observations, including an improved reduction of the data and new absolute calibration, an updated LICIACube trajectory, and a detailed description of the events and phenomena that were recorded throughout the flyby. One notable aspect of the ejecta was the existence of clusters of boulders, up to 3.6 m in radius, that were ejected at speeds of up to 52 m s −1 . Our analysis of the spatial distribution of 104 of these boulders suggests that they are likely the remnants of larger boulders shattered by the DART spacecraft in the first stages of the impact. The amount of momentum contained in these boulders is more than 3 times that of the DART spacecraft, and it is directed primarily to the south, almost perpendicular to the DART trajectory. Recoil of Dimorphos from the ejection of these boulders has the potential to change its orbital plane by up to a degree and to impart a non-principal-axis component to its rotation state. Damping timescales for these phenomena are such that the Hera spacecraft, arriving at the system in 2026, should be able to measure these effects.
Here, we consider numerical approaches for deterministic, finite-dimensional optimal control problems whose dynamics depend on unknown or uncertain parameters. We seek to amortize the solution over a set of relevant parameters in an offline stage to enable rapid decision-making and be able to react to changes in the parameter in the online stage. To tackle the curse of dimensionality arising when the state and/or parameter are high-dimensional, we represent the policy using neural networks. We compare two training paradigms: First, our model-based approach leverages the dynamics and definition of the objective function to learn the value function of the parameterized optimal control problem and obtain the policy using a feedback form. Second, we use actor-critic reinforcement learning to approximate the policy in a data-driven way. Using an example involving a two-dimensional convection-diffusion equation, which features high-dimensional state and parameter spaces, we investigate the accuracy and efficiency of both training paradigms. While both paradigms lead to a reasonable approximation of the policy, the model-based approach is more accurate and considerably reduces the number of PDE solves.
Neural scaling laws play a pivotal role in the performance of deep neural networks and have been observed in a wide range of tasks. However, a complete theoretical framework for understanding these scaling laws remains underdeveloped. In this paper, we explore the neural scaling laws for deep operator networks, which involve learning mappings between function spaces, with a focus on the Chen and Chen style architecture. These approaches, which include the popular Deep Operator Network (DeepONet), approximate the output functions using a linear combination of learnable basis functions and coefficients that depend on the input functions. We establish a theoretical framework to quantify the neural scaling laws by analyzing its approximation and generalization errors. We articulate the relationship between the approximation and generalization errors of deep operator networks and key factors such as network model size and training data size. Moreover, we address cases where input functions exhibit low-dimensional structures, allowing us to derive tighter error bounds. These results also hold for deep ReLU networks and other similar structures. Our results offer a partial explanation of the neural scaling laws in operator learning and provide a theoretical foundation for their applications.
We introduce the Gradient-MUSIC algorithm for estimating the unknown frequencies and amplitudes of a nonharmonic signal from noisy time samples. While the classical MUSIC algorithm performs a computationally expensive search over a fine grid, Gradient-MUSIC is significantly more efficient and eliminates the need for discretization over a fine grid by using optimization techniques. It coarsely scans the 1D landscape to find initialization simultaneously for all frequencies followed by parallelizable local refinement via gradient descent. We also analyze its performance when the noise level is sufficiently small and the signal frequencies are separated by at least 8π/m, where π/m is the standard resolution of this problem. Even though the 1D landscape is nonconvex, we prove a global convergence result for Gradient-MUSIC: coarse scanning provably finds suitable initialization and gradient descent converges at a linear rate. In addition to convergence results, we also upper bound the error between the true signal frequencies and amplitudes with those found by Gradient-MUSIC. For example, if the noise has $\ell^\infty$ norm at most ϵ, then the frequencies and amplitudes are recovered up to error at most Cϵ/m and Cϵ respectively, which are minimax optimal in m and ϵ. Our theory can also handle stochastic noise with performance guarantees under nonstationary independent Gaussian noise. Our main approach is a comprehensive geometric analysis of the landscape, a perspective that has not been explored before.
In the identification of differential equations from data, significant progresses have been made with the weak/integral formulation. In this paper, we explore the direction of finding more efficient and robust test functions adaptively given the observed data. While this is a difficult task, we propose weighting a collection of localized test functions for better identification of differential equations from a single trajectory of noisy observations on the differential equation. We find that using high dynamic regions is effective in finding the equation as well as the coefficients, and propose a dynamics indicator per differential term and weight the weak form accordingly. For stable identification against noise, we further introduce a voting strategy to identify the active features from an ensemble of recovered results by selecting the features that frequently occur in different weighting of test functions. Systematic numerical experiments are provided to demonstrate the robustness of our method.
Flow depth and velocity are the most important hydrodynamic variables that govern various river functions, including water resources, navigation, sediment transport, and biogeochemical cycling. Existing high-resolution flow depth simulations rely on either computationally expensive river hydrodynamic models (RHMs) or data-driven models with formidable training costs, whereas data-driven modeling of flow velocity has rarely been explored. Here, using the hybrid Low-fidelity, Spatial analysis, and Gaussian process learning (LSG) model, we developed a downscaling approach to construct high-resolution flow depth and velocity from a two-dimensional (2-D) RHM simulation at coarse resolution. The LSG models were trained and tested in an urban watershed in Houston using two different hurricane-driven flood events. The high-resolution (as fine as 30 m resolution) and low-resolution (mostly 1000 m resolution) meshes include 664 724 and 14 536 grid cells, respectively. The results showed that through downscaling, the simulation errors were reduced to less than one-fourth and one-third of the errors of the low-resolution 2-D RHM for flow depth and velocity, respectively. Our analysis further revealed that the dominant uncertainty sources of the downscaled hydrodynamics are different, with flow velocity dominated by the dimensionality reduction error, which we reduced by using a regionalized training procedure. The downscaling approach achieves an 84-fold acceleration in computational time compared to the high-resolution 2-D RHM, making high-fidelity ensemble flood modeling feasible. More importantly, the developed method provides an opportunity to couple large-scale hydrodynamical processes with local physical, chemical, and biological processes in river models.
PDnetwork is an interactive online tool designed to visualize the evolution of the co-authorship network in the field of peridynamics. In this network, each node represents a peridynamics author, and each link represents co-authorship between authors. The tool allows users to obtain collaborative measures for authors using selected network metrics and visualize collaborations for specific authors. Additionally, it provides rankings for authors based on selected collaboration metrics and includes links to the author profiles in the Scopus publication database.