Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Real world networks”

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 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
NASA NTRS1978

Spaceborne ranging system

A spaceborne laser ranging system is described that could survey a large network of ground reflectors, and provide their relative locations to a precision of + or - 1 cm. This performance is believed realizable for networks covering up to 10 to 6th power square kilometers and from only a few days of observations. This system could be used to monitor crustal movements in many areas of the world and has the potential to provide an almost real-time system for detecting precursory ground motions before large earthquakes.

Smith, D. E.↗
DOE OSTI2023

Neural Image Compression: Generalization, Robustness, and Spectral Biases

Recent advances in neural image compression (NIC) have resulted in models which are starting to outperform traditional codecs. While this has led to growing excitement about using these methods in real-world applications, the successful adoption of any machine learning system (including NIC) in the wild requires it to generalize (and be robust) to unseen distribution shifts at deployment time. Unfortunately, current research lacks comprehensive datasets and informative tools to evaluate and understand compression performance in real-world settings. To bridge this crucial gap, first, this paper presents a comprehensive benchmark suite to evaluate the out-of-distribution (OOD) performance of image compression methods. Specifically, we design CLIC-C and Kodak-C by introducing 15 common corruptions to popular CLIC and Kodak benchmarks. Next, we propose spectrally inspired introspection tools to gain a deeper understanding of errors introduced by image compression methods as well as their OOD performance. To this end, we carry out a detailed performance comparison of the classical codec with various variants of NIC (e.g., original, variable rate, pruned), revealing intriguing findings that challenge our current understanding of the strengths and limitations of NIC. Finally, we corroborate our empirical findings with theoretical analysis, providing an in-depth view of the OOD performance of NIC. Our benchmarks, spectral introspection tools, and findings provide a crucial bridge to the real-world adoption of NIC. We hope that our work will propel future efforts in designing more robust and generalizable NIC methods.

neural networks, Variational Autoencoder, robustne↗
DOE OSTI2022

Time series anomaly detection in power electronics signals with recurrent and ConvLSTM autoencoders

The anomalies in the high voltage converter modulator (HVCM) remain a major down time for the spallation neutron source facility, that delivers the most intense neutron beam in the world for scientific materials research. In this work, we propose neural network architectures based on Recurrent AutoEncoders (RAE) to detect anomalies ahead of time in the power signals coming from the HVCM. Bi-directional gated recurrent unit, bi-directional long-short term memory (LSTM), and convolutional LSTM (ConvLSTM) are developed, trained, and tested using real experimental signals from the HVCM module. The results show a good performance of the proposed RAE models, achieving precision up to 91%, recall up to 88%, false omission rate as low as 20% (i.e. 80% of the anomalies were detected), and area under the ROC curve up to 0.9. The three RAE models provide very comparable performance, with LSTM showing slightly better performance than GRU and ConvLSTM. The RAE models are benchmarked against other anomaly detection methods, including isolation forest, support vector machine, local outlier factor, feedforward and convolutional autoencoders, and others; showing a better performance. Here, the results of this study demonstrate the promising potential of RAE in anomaly detection for real-world power systems, and for increasing the reliability of the HVCM modules in the spallation neutron source.

42 ENGINEERING↗
NASA NTRS2007

Flood and Landslide Applications of Near Real-time Satellite Rainfall Products

Floods and associated landslides are one of the most widespread natural hazards on Earth, responsible for tens of thousands of deaths and billions of dollars in property damage every year. During 1993-2002, over 1000 of the more than 2,900 natural disasters reported were due to floods. These floods and associated landslides claimed over 90,000 lives, affected over 1.4 billion people and cost about $210 billion. The impact of these disasters is often felt most acutely in less developed regions. In many countries around the world, satellite-based precipitation estimation may be the best source of rainfall data due to lack of surface observing networks. Satellite observations can be of essential value in improving our understanding of the occurrence of hazardous events and possibly in lessening their impact on local economies and in reducing injuries, if they can be used to create reliable warning systems in cost-effective ways. This article addressed these opportunities and challenges by describing a combination of satellite-based real-time precipitation estimation with land surface characteristics as input, with empirical and numerical models to map potential of landslides and floods. In this article, a framework to detect floods and landslides related to heavy rain events in near-real-time is proposed. Key components of the framework are: a fine resolution precipitation acquisition system; a comprehensive land surface database; a hydrological modeling component; and landslide and debris flow model components. A key precipitation input dataset for the integrated applications is the NASA TRMM-based multi-satellite precipitation estimates. This dataset provides near real-time precipitation at a spatial-temporal resolution of 3 hours and 0.25deg x 0.25deg. By careful integration of remote sensing and in-situ observations, and assimilation of these observations into hydrological and landslide/debris flow models with surface topographic information, prediction of useful probabilistic maps of landslide and floods for emergency management in a timely manner is possible. Early results shows that the potential exists for successful application of satellite precipitation data in improving/developing global monitoring systems for flood/landslide disaster preparedness and management. The scientific and technological prototype can be first applied in a representative test-bed and then the information deliverables for the region can be tailored to the societal and economic needs of the represented affected countries.

Hong, Yang↗
DOE OSTI2025

Understanding and Estimating Error Propagation in Neural Networks for Scientific Data Analysis

Neural networks are increasingly integrated into scientific discovery, where input data reduction and model quantization play a key role in accelerating inference. However, understanding and mitigating the impact of these techniques on output error is critical for ensuring reliable results, particularly in tasks demanding high numerical precision. This paper introduces a comprehensive framework for optimizing neural network inference in scientific computing by combining data reduction and weight quantization while maintaining error-controlled outcomes. We develop theoretical analyses to bound error propagation under these reductions and propose a framework that balances computational performance with error constraints. Evaluation on real-world learning-based combustion simulations and satellite image classification demonstrates that our derived error bounds accurately predict observed errors while enabling significant computational speedup under our framework. This work highlights the potential for further leveraging advancements in modern lossy compression algorithms and hardware accelerators that support lower-precision formats.

He, Weiming [New Jersey Institute of Technology]↗
NASA NTRS1987

The NASA tracking and data acquisition networks - Their history and their future

The NASA Tracking and Data Acquisition Networks were begun in the late 1950s as a part of the U.S. activities associated with the 1958-59 International Geophysical Year. The first network, the Minitrack Net, evolved into the Space Tracking and Data Acquisition Network (STADAN) for support of scientific satellites in earth orbit. The NASA Mercury and Apollo manned flight programs produced more demanding requirements for near real-time tracking, communications, and orbit determination, thus providing the impetus for new, more sophisticated networks. The Deep Space Network was also created to meet unique requirements of the planetary exploration programs. All of these programs necessitated establishing ground stations in various countries around the world, thus promoting the concept of international cooperation in space activities which NASA has fostered in many programs. This paper traces these networks from their beginnings through the various stages of development and introduction of new technologies to meet the requirements of increasingly more complex space missions. The paper also discusses the planning for new capabilities for tracking, data acquisition and communications support of future programs, including particularly the Space Station in the next decade.

Force, Charles T.↗
DOE OSTI2021

Uncertainty bounds for multivariate machine learning predictions on high-strain brittle fracture

Simulation of the crack network evolution on high strain rate impact experiments performed in brittle materials is very compute-intensive. The cost increases even more if multiple simulations are needed to account for the randomness in crack length, location, and orientation, which is inherently found in real-world materials. Constructing a machine learning emulator can make the process faster by orders of magnitude. There has been little work, however, on assessing the error associated with their predictions. Estimating these errors is imperative for meaningful overall uncertainty quantification. In this work, we extend the heteroscedastic uncertainty estimates to bound a multiple output machine learning emulator. Overall, we find that the response prediction is accurate within its predicted errors, but with a somewhat conservative estimate of uncertainty.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Predicting battery capacity from impedance at varying temperature and state of charge using machine learning

Prediction of battery health from electrochemical impedance spectroscopy (EIS) data can enable rapid measurement of battery state in real-world applications without using additional sensors or time-consuming performance measurements. However, deconvoluting the effect of capacity, state of charge, and temperature on EIS response is complicated analytically. Here, various machine-learning models, such as linear, Gaussian process, random forest, and artificial neural network regression, are utilized to predict capacity from EIS using hundreds of capacity, direct current (DC) resistance, and EIS measurements recorded under varying conditions of health, temperature, and state of charge (SOC). Several feature extraction and selection methods from traditional electrochemical analysis and statistical modeling are explored using machine-learning pipelines. EIS data from just two frequencies can accurately predict capacity, and interrogation shows that the optimal set of frequencies is not usually intuitive. Best results are achieved with an ensemble model, which predicts battery capacity with a mean absolute error of 1.9% on data from unobserved cells.

25 ENERGY STORAGE↗
DOE OSTI2024

QFw: A Quantum Framework for Large-scale HPC Ecosystems

This work extends Quantum Framework (QFw) by integrating it with Northwest Quantum Simulator (NWQ-Sim) and by introducing a lightweight python library that allows multiple frontends (e.g., Qiskit) to interact with QFw. This extension enables QFw to flexibly decouple frontends from backends (e.g., NWQ-Sim). We demonstrate this capability by executing a Greenberger-Horne-Zeilinger (GHZ) circuit using Qiskit and Pennylane with NWQ-Sim and Tensor-Network Quantum Virtual-Machine (TN-QVM). QFw enables easy scaling to multiple nodes. We showcase this with scaling tests using GHZ with up to 32 qubits for different number of nodes on the Frontier supercomputer. And, to demonstrate the use of QFw for real world problems, we solve a metamaterial optimization problem, using a Quantum Approximate Optimization Algorithm (QAOA). We observe that QFw over NWQ-Sim marginally improves Qiskit-aer’s accuracy in reaching the lowest energy state. These additions to QFw prepare it to run hybrid applications in a hybrid resource environment since it treats actual quantum hardware and simulators alike.

Chundury, Srikar↗
DOE OSTI2025

Evaluating the Effectiveness of Soil Profile Rehabilitation for Pluvial Flood Mitigation Through Two-Dimensional Hydrodynamic Modeling

Pluvial flooding, driven by increasingly impervious surfaces and intense storm events, presents a growing challenge for urban areas worldwide. In Baltimore City, MD, USA, climate change, rapid urbanization, and aging stormwater infrastructure are exacerbating flooding impacts, resulting in significant socio-economic consequences. This study evaluated the effectiveness of a soil profile rehabilitation scenario using a 2D hydrodynamic modeling approach for the Tiffany Run watershed, Baltimore City. This study utilized different extreme storm events, a high-resolution (1 m) LiDAR Digital Terrain Model (DTM), building footprints, and hydrological soil data. These datasets were integrated into a fully coupled 2D hydrodynamic model, the City Catchment Analysis Tool (CityCAT), to simulate urban flood dynamics. The pre-soil rehabilitation simulation revealed a maximum water depth of 3.00 m in most areas, with hydrologic soil groups C and D, especially downstream of the study area. The post-soil rehabilitation simulation was targeted at vacant lots and public parcels, accounting for 33.20% of the total area of the watershed. This resulted in a reduced water depth of 2.50 m. Additionally, the baseline runoff coefficient of 0.49 decreased to 0.47 following the rehabilitation, and the model consistently recorded a peak runoff reduction rate of 4.10 across varying rainfall intensities. The validation using a contingency matrix demonstrated true-positive rates of 0.75, 0.50, 0.64, and 0 for the selected events, confirming the model’s capability at capturing real-world flood occurrences.

Baltimore City↗
DOE OSTI2022

Learning Latent Interactions for Event Identification via Graph Neural Networks and PMU Data

Phasor measurement units (PMUs) are being widely installed on power systems, providing a unique opportunity to enhance wide-area situational awareness. One essential application is the use of PMU data for real-time event identification. However, how to take full advantage of all PMU data in event identification is still an open problem. Thus, we propose a novel method that performs event identification by mining interaction graphs among different PMUs. The proposed interaction graph inference method follows an entirely data-driven manner without knowing the physical topology. Moreover, unlike previous works that treat interactive learning and event identification as two different stages, our method learns interactions jointly with the identification task, thereby improving the accuracy of graph learning and ensuring seamless integration between the two stages. Moreover, to capture multi-scale event patterns, a dilated inception-based method is investigated to perform feature extraction of PMU data. To test the proposed data-driven approach, a large real-world dataset from tens of PMU sources and the corresponding event logs have been utilized in this work. We report numerical results validate that our method has higher classification accuracy compared to previous methods.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Gleipnir: toward practical error analysis for Quantum programs

Practical error analysis is essential for the design, optimization, and evaluation of Noisy Intermediate-Scale Quantum(NISQ) computing. However, bounding errors in quantum programs is a grand challenge, because the effects of quantum errors depend on exponentially large quantum states. In this work, we present Gleipnir, a novel methodology toward practically computing verified error bounds in quantum programs. Gleipnir introduces the (ρ,δ)-diamond norm, an error metric constrained by a quantum predicate consisting of the approximate state ρ and its distance δ to the ideal state ρ. This predicate (ρ,δ) can be computed adaptively using tensor networks based on the Matrix Product States. Gleipnir features a lightweight logic for reasoning about error bounds in noisy quantum programs, based on the (ρ,δ)-diamond norm metric. Furthermore, our experimental results show that Gleipnir is able to efficiently generate tight error bounds for real-world quantum programs with 10 to 100 qubits, and can be used to evaluate the error mitigation performance of quantum compiler transformations.

Tao, Runzhou↗
DOE OSTI2024

Identifying Potential Sub-Synchronous Oscillations Using Impedance Scan Approach: Preprint

This paper presents an impedance scan study on the real-world power system in Australia that has observed 17 to 20 Hz intermittent subsynchronous oscillations. Through the impedance scan of each of the IBRs, both individually and collectively, potential resonance modes are identified. The impedance scans were carried out using electromagnetic transient PSCAD models of the network. The network comprises of site-specific, black-boxed models of IBRs supplied by the generators. The impedance scan approach was divided in three major steps: (1) the first step is to identify IBRs where impedance analysis needs to be performed based on the magnitude of oscillations observed at their points of interconnection (POIs); (2) the second step focuses on performing impedance scans at selected IBRs in single-machine infinite-bus (SMIB) configuration to identify internal resonance modes of an IBR and to evaluate if any of these modes become unstable under certain grid conditions; (3) the third step performs impedance scans at a few selected IBRs while connected to the wider network model to obtain the impedance response of both the IBR and the grid - this step evaluates control interactions among IBRs. The impedance scan study found that a few IBRs have an underdamped resonance mode at around 17 Hz, which becomes unstable under a certain operating condition. Another interesting finding was that certain IBRs increase the effective grid impedance seen by another IBR in proximity for a particular operating condition. Under this operating condition, the resulting subsynchronous oscillation mode is more pronounced due to a combination of control interactions among IBRs through the transmission network under study and a resonance mode inside the IBRs.

control interactions↗
NASA NTRS2021

Scheduling the NASA Deep Space Network with Deep Reinforcement Learning

With three complexes spread evenly across the Earth, NASA’s Deep Space Network (DSN) is the primary means of communications as well as a significant scientific instrument for dozens of active missions around the world. A rapidly rising number of spacecraft and increasingly complex scientific instruments with higher bandwidth requirements have resulted in demand that exceeds the network’s capacity across its 12 antennae. The existing DSN scheduling process operates on a rolling weekly basis and is time-consuming; for a given week, generation of the final baseline schedule of spacecraft tracking passes takes roughly 5 months from the initial requirements submission deadline, with several weeks of peer-to-peer negotiations in between. This paper proposes a deep reinforcement learning (RL) approach to generate candidate DSN schedules from mission requests and spacecraft ephemeris data with demonstrated capability to address real-world operational constraints. A deep RL agent is developed that takes mission requests for a given week as input, and interacts with a DSN scheduling environment to allocate tracks such that its reward signal is maximized. A comparison is made between an agent trained using Proximal Policy Optimization and its random, untrained counterpart. The results represent a proof-of-concept that, given a well-shaped reward signal, a deep RL agent can learn the complex heuristics used by experts to schedule the DSN. A trained agent can potentially be used to generate candidate schedules to bootstrap the scheduling process and thus reduce the turnaround cycle for DSN scheduling.

Wilson, Brian↗
DOE OSTI2023

Reliable extrapolation of deep neural operators informed by physics or sparse observations

Deep neural operators can learn nonlinear mappings between infinite-dimensional function spaces via deep neural networks. As promising surrogate solvers of partial differential equations (PDEs) for real-time prediction, deep neural operators such as deep operator networks (DeepONets) provide a new simulation paradigm in science and engineering. Pure data-driven neural operators and deep learning models, in general, are usually limited to interpolation scenarios, where new predictions utilize inputs within the support of the training set. However, in the inference stage of real-world applications, the input may lie outside the support, i.e., extrapolation is required, which may result to large errors and unavoidable failure of deep learning models. Here, we address this challenge of extrapolation for deep neural operators. First, we systematically investigate the extrapolation behavior of DeepONets by quantifying the extrapolation complexity, via the 2-Wasserstein distance between two function spaces and propose a new strategy of bias–variance trade-off for extrapolation with respect to model capacity. Subsequently, we develop a complete workflow, including extrapolation determination, and we propose five reliable learning methods that guarantee a safe prediction under extrapolation by requiring additional information—the governing PDEs of the system or sparse new observations. The proposed methods are based on either fine-tuning a pre-trained DeepONet or multifidelity learning. We demonstrate the effectiveness of the proposed framework for various types of parametric PDEs. Furthermore, our systematic comparisons provide practical guidelines for selecting a proper extrapolation method depending on the available information, desired accuracy, and required inference speed.

42 ENGINEERING↗
DOE OSTI2026

Block encoding of the three-dimensional heterogeneous Poisson equation with application to fracture flow

Quantum linear system (QLS) algorithms offer the potential to solve large-scale linear systems exponentially faster than classical methods. However, applying QLS algorithms to real-world problems remains challenging due to issues such as state preparation, data loading, and efficient information extraction. In this work, we study the feasibility of applying QLS algorithms to solve discretized three-dimensional (3D) heterogeneous Poisson equations, with specific examples relating to groundwater flow through geologic fracture networks. We explicitly construct a block encoding for the 3D heterogeneous Poisson matrix by leveraging the sparse local structure of the discretized operator. While classical solvers benefit from preconditioning, we show that block encoding the system matrix and preconditioner separately does not improve the effective condition number that dominates the QLS run-time. This differs from classical approaches where the preconditioner and the system matrix can often be implemented independently. Nevertheless, due to the structure of the problem in three dimensions, the quantum algorithm achieves a run-time of 𝑂⁡(𝑁 2/3 polylog 𝑁 ⋅log (1/𝜖)), outperforming the best classical methods (with run times of 𝑂⁡(𝑁⁢log 𝑁 ⋅log (1/𝜖))) and offering exponential memory savings. These results highlight both the promise and limitations of QLS algorithms for practical scientific computing, and point to effective condition-number reduction as a key barrier in achieving quantum advantages.

58 GEOSCIENCES↗
DOE OSTI2021

PMU-data-driven Event Classification in Power Transmission Grids

This paper presents an event classification in transmission grids. The convolutional neural network (CNN)-based classifier is proposed to capture the temporal similarity of time-synchronized data stream from phasor measurement units (PMUs). The proposed CNN is trained using Bayesian optimization to search for the best hyperparameters. The effectiveness of the proposed event classification is validated through the real-world dataset from the U.S. transmission grids. This dataset includes line outage, transformer outage, frequency, and oscillation events. The validation process also includes different PMU outputs, such as voltage magnitude, phase angle, current magnitude, frequency, and rate of change of frequency (ROCOF). The results show that ROCOF gives the best classification performance compared to other PMU outputs. In addition, it is shown that the classifier trained with a larger dataset has higher accuracy. Moreover, the superiority of the proposed method is validated through comparison with other state-of-the-art classification methods.

Niazazari, Iman↗
DOE OSTI2025

GenAI-Based Digital Twins Aided Data Augmentation Increases Accuracy in Real-Time Cokurtosis-Based Anomaly Detection of Wearable Data

Early detection of potential infectious disease outbreaks is crucial for developing effective interventions. In this study, we introduce advanced anomaly detection methods tailored for health datasets collected from wearables, offering insights at both individual and population levels. Leveraging real-world physiological data from wearables, including heart rate and activity, we developed a framework for the early detection of infection in individuals. Despite the availability of data from recent pandemics, substantial gaps remain in data collection, hindering method development. To bridge this gap, we utilized Wasserstein Generative Adversarial Networks (WGANs) to generate realistic synthetic wearable data, augmenting our dataset for training. Subsequently, we use these augmented datasets to implement a cokurtosis-based technique for anomaly detection in multivariate time-series data. Our approach includes a comprehensive assessment of uncertainties in synthetic data compared to the actual data upon which it was modeled, as well as the uncertainty associated with fine-tuning anomaly detection thresholds in physiological measurements. Through our work, we present an enhanced method for early anomaly detection in multivariate datasets, with promising applications in healthcare and beyond. This framework could revolutionize early detection strategies and significantly impact public health response efforts in future pandemics.

Data-Driven Digital Twins↗