Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Complex Network Data”

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 379 records · Page 21
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Region-based convolutional neural network for wind turbine wake characterization from scanning lidars

A convolutional neural network is applied to lidar scan images from three experimental campaigns to identify and characterize wind turbine wakes. Initially developed as a proof-of-concept model and applied to a single data set in complex terrain, the model is now improved and generalized and applied to two other unique lidar data sets, one located near an escarpment and one located offshore. The model, initially developed using lidar scans collected in predominantly westerly flow, exhibits sensitivity to wind flow direction. The model is thus successfully generalized through implementing a standard rotation process to scan images before input into the convolutional neural network to ensure the flow is westerly. The sample size of lidar scans used to train the model is increased, and along with the generalization process, these changes to the model are shown to enhance accuracy and robustness when characterizing dissipating and asymmetric wakes. Applied to the offshore data set in which nearly 20 wind turbine wakes are included per scan, the improved model exhibits a 95% success rate in characterizing wakes and a 74% success rate in characterizing dissipating wake fragments. The improved model is shown to generalize well to the two new data sets, although an increase in wake characterization accuracy is offset by an increase in model sensitivity and false positive wake identifications.

17 WIND ENERGY↗
DOE OSTI2023

Molecular Hypernetworks for Exploration of Multi-Dimensional Metabolomics Data (Chyper)

Orthogonal separations of data from high-resolution mass spectrometry can provide insight into sample composition and help address the challenge of complete annotation of molecules in untargeted metabolomics. “Molecular networks” (MNs), as used, for example, in the Global Natural Products Social Molecular Networking platform, are an increasingly popular computational strategy for exploring and visualizing molecular relationships and improving annotation. MNs use graph representations to show the relationships between measured multidimensional data features. MNs also show promise for using network science algorithms to automatically identify targets for annotation candidates and to dereplicate features associated to a single molecular identity. However, more advanced methods may better represent the complexity present in samples. Our work aims to increase confidence in annotation propagation by extending molecular network methods to include “molecular hypernetworks” (MHNs), able to natively represent multiway relationships among observations supporting both human and analytical processing. In this paper we first introduce MHNs illustrated with simple examples, and demonstrate how to build them from liquid chromatography- and ion mobility spectrometry- separated MS data. We then describe a method to construct MHNs directly from existing MNs as their “clique reconstructions”, demonstrating their utility by comparing examples of previously published graph-based MNs to their respective MHNs.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS2006

Spacecraft Data and Relay Management using Delay Tolerant Networking

NASA's demonstration of the successful transmission of relay data through the orbiting Mars Odyssey, Mars Global Surveyor, and Mars Express by the Mars Exploration Rovers has shown not only the benefit of using a relay satellite for multiple landed assets in a deep space environment but also the benefit of international standards for such architecture. As NASA begins the quest defined in the Vision for Exploration with robotic and manned missions to the Moon, continues its study of Mars, and is joined in these endeavors by countries world-wide, landed assets transmitting data through relay satellites will be crucial for completing mission objectives. However, this method of delivery of data will result in increased complexity in routing and prioritization of data transmission as the number of missions increases. Also, there is currently no standard method among organizations conducting such missions to return these data sets to Earth given a complex environment. One possibility for establishing such a standard is for mission designers to deploy protocols which fall under the umbrella of Delay Tolerant Networking (DTN). These developing standards include the Bundle Protocol (BP) which provides a standard, secure, store and forward mechanism designed for high latency and asymmetric communication links and the Licklider Transmission Protocol (LTP) which is used to provide a reliable deep space link transmission service.

network congestion control algorithm↗
NASA NTRS2006

Spacecraft data and relay management using delay tolerant networking

NASA’s demonstration of the successful transmission of relay data through the orbiting Mars Odyssey, Mars Global Surveyor, and Mars Express by the Mars Exploration Rovers has shown not only the benefit of using a relay satellite for multiple landed assets in a deep space environment but also the benefit of international standards for such an architecture. As NASA begins the quest defined in the Vision for Exploration with robotic and manned missions to the Moon, continues its study of Mars, and is joined in these endeavors by countries world-wide, landed assets transmitting data through relay satellites will be crucial for completing mission objectives. However, this method of data delivery will result in increased complexity in routing and prioritization of data transmission as the number of missions increases. Also, there is currently no standard method among organizations conducting such missions to return these data sets to Earth given a complex environment. One possibility for establishing such a standard is for mission designers to deploy protocols which fall under the umbrella of Delay Tolerant Networking (DTN). These developing standards include the Bundle Protocol (BP) which provides a standard, secure, store and forward mechanism designed for high latency and asymmetric communication links and the Licklider Transmission Protocol (LTP) which is used to provide a reliable deep space link transmission service.

Torgerson, J. Leigh↗
DOE OSTI2020

Y-12 Groundwater Protection Program Monitoring Well Inspection and Maintenance Plan

This plan describes the systematic approach for: inspecting the physical condition of monitoring wells at Y-12, determining maintenance needs that extend the life of a well, and identifying those wells that no longer meet acceptable monitoring well design or well construction standards and require plugging and abandonment. The inspection and maintenance of groundwater monitoring wells is one of the primary management strategies of the Y-12 Groundwater Protection Program (GWPP) Management Plan, that is, the “proactive stewardship of the extensive monitoring well network at Y-12" (Consolidated Nuclear Security, L.L.C. [CNS], 2018). Effective stewardship, and a program of routine inspections of the physical condition of each monitoring well, ensures that representative water-quality samples and hydrologic data are obtained from the well network and protects the subsurface environment. In accordance with the Y-12 GWPP Monitoring Optimization Plan (MOP) for Groundwater Monitoring Wells at the Y-12 National Security Complex, Oak Ridge, Tennessee (CNS, 2017), the status designation (active or inactive) for each well determines the scope and extent of well inspections and maintenance activities. This plan, in conjunction with the above document, formalizes the GWPP approach to focus available resources on monitoring wells which provide the most useful data, and for that reason the GWPP inspects and performs maintenance on the wells sampled by the GWPP. This plan applies to groundwater monitoring wells installed at Y-12 and the related waste management facilities located within the three hydrogeologic regimes: (1) the Bear Creek Hydrogeologic Regime (Bear Creek Regime), (2) the Upper East Fork Poplar Creek Hydrogeologic Regime (East Fork Regime), and (3) the Chestnut Ridge Hydrogeologic Regime (Chestnut Ridge Regime). The Bear Creek Regime encompasses the section of Bear Creek Valley (BCV) immediately west of Y-12. The East Fork Regime encompasses most of the Y-12 process, operations, and support facilities in BCV west of Scarboro Road. The Chestnut Ridge Regime is directly south of Y-12 and encompasses a section of Chestnut Ridge that is bounded to the west by a surface drainage feature (Dunaway Branch, located immediately west of Industrial Landfill II) and by Scarboro Road to the east. The GWPP maintains an extensive database of geographic and construction details and related information for the monitoring wells in each hydrogeologic regime in the Updated Subsurface Database for Bear Creek Valley, Chestnut Ridge, and Parts of Bethel Valley on the U.S. DOE Oak Ridge Reservation (CNS, 2019). A detailed description of the hydrogeologic framework at Y-12 can be found in the GWPP Management Plan (CNS, 2018).

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Detecting anomalous sequences in electronic health records using higher-order tensor networks

Detecting anomalous sequences is an integral part of building and protecting modern large-scale health information technology (HIT) systems. These HIT systems generate a large volume of records of patients’ state and significant events, which provide a valuable resource to help improve clinical decisions, patient care processes, and other issues. However, detecting anomalous sequences in electronic health records (EHR) remains a challenge in healthcare applications for several reasons, including imbalances in the data, complexity of relationships between events in the sequence, and the curse of dimensionality. Conventional anomaly detection methods use the finite sequence of events to discriminate sequences. They fail to incorporate salient event details under variable higher-order dependencies (e.g., duration between events) that can provide better discrimination of sequences in their models. To address this problem, we propose event sequence and subsequence anomaly detection algorithms that (1) use network-based representations of interactions in the data, (2) account for variable higher-order dependencies in the data, and (3) incorporate events duration for adequate discrimination of the data. The proposed approach identifies anomalies by monitoring the change in the graph after the test sequence is removed from the network. The change is quantified using graph distance metrics so that dramatic changes in the network can be attributed to the removed sequence. Furthermore, the proposed subsequence algorithm recommends plausible paths and salient information for the detected anomalous subsequences. Our results show that the proposed event sequence anomaly detection algorithm outperforms the baseline methods for both synthetic data and real-world EHR data.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2020

Active Learning A Neural Network Model For Gold Clusters & Bulk From Sparse First Principles Training Data

Small metal clusters are of fundamental scientific interest and of tremendous significance in catalysis. These nanoscale clusters display diverse geometries and structural motifs depending on the cluster size; a knowledge of this size-dependent structural motifs and their dynamical evolution has been of longstanding interest. Given the high computational cost of first-principles calculations, molecular modeling and atomistic simulations such as molecular dynamics (MD) has proven to be an important complementary tool to aid this understanding. Classical MD typically employ predefined functional forms which limits their ability to capture such complex size-dependent structural and dynamical transformation. Neural Network (NN) based potentials represent flexible alternatives and in principle, well-trained NN potentials can provide high level of flexibility, transferability and accuracy on-par with the reference model used for training. A major challenge, however, is that NN models are interpolative and requires large quantities (similar to 10 4 or greater) of training data to ensure that the model adequately samples the energy landscape both near and far-from-equilibrium. A highly desirable goal is minimize the number of training data, especially if the underlying reference model is first-principles based and hence expensive. In this work, we introduce an active learning (AL) scheme that trains a NN model on-the-fly with minimal amount of first-principles based training data. Our AL workflow is initiated with a sparse training dataset (similar to 1 to 5 data points) and is updated on-the-fly via a Nested Ensemble Monte Carlo scheme that iteratively queries the energy landscape in regions of failure and updates the training pool to improve the network performance. Using a representative system of gold clusters, we demonstrate that our AL workflow can train a NN with similar to 500 total reference calculations. Using an extensive DFT test set of similar to 1100 configurations, we show that our AL-NN is able to accurately predict both the DFT energies and the forces for clusters of a myriad of different sizes. Our NN predictions are within 30 meV/atom and 40 meV/angstrom of the reference DFT calculations. Moreover, our AL-NN model also adequately captures the various size-dependent structural and dynamical properties of gold clusters in excellent agreement with DFT calculations and available experiments. We finally show that our AL-NN model also captures bulk properties reasonably well, even though they were not included in the training data.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Multi-objective surrogate-assisted calibration of CPFEM models using macroscopic response and in situ EBSD measurements of grain reorientation trajectories

Crystal plasticity finite element method (CPFEM) models are widely used to simulate the deformation behaviour of polycrystalline materials, but their calibration is often limited by their high computational cost and the non-convexity of the optimisation landscape. Here, this study develops a multi-objective surrogate-assisted calibration workflow that couples a multi-objective genetic algorithm (MOGA) with an adaptively trained deep neural network (DNN) surrogate model to efficiently identify CPFEM parameters from experimental data. The workflow is demonstrated on three crystal plasticity (CP) formulations of increasing complexity — Voce hardening (VH), two-coefficient latent hardening (LH2), and six-coefficient latent hardening (LH6) — using in situ electron backscatter diffraction (EBSD) measurements of Alloy 617 under uniaxial tensile loading. The CPFEM models are calibrated against the experimentally observed stress–strain response and reorientation trajectories of eight grains, then validated against eight additional trajectories and overall texture evolution. Across the CP formulations, the macroscopic response was reproduced reliably, while differences emerged in the robustness and accuracy of the grain-scale predictions. Including grain reorientation trajectories in the multi-objective calibration improved texture evolution predictions and filtered out physically inconsistent parameter sets that can arise from calibrating against only the stress–strain data. The workflow also demonstrates good transferability of calibrated parameters from a low- to a high-fidelity microstructural model. These results provide practical guidance for integrating in situ microstructural data into CPFEM through efficient, repeatable, and physically meaningful multi-objective calibration.

Crystal plasticity finite element method↗
DOE OSTI2020

Dynamic Topology Reconfiguration of Boltzmann Machines on Quantum Annealers

Boltzmann machines have useful roles in deep learning applications, such as generative data modeling, initializing weights for other types of networks, or extracting efficient representations from high-dimensional data. Most Boltzmann machines use restricted topologies that exclude looping connectivity, as such connectivity creates complex distributions that are difficult to sample. We have used an open-system quantum annealer to sample from complex distributions and implement Boltzmann machines with looping connectivity. Further, we have created policies mapping Boltzmann machine variables to the quantum bits of an annealer. These policies, based on correlation and entropy metrics, dynamically reconfigure the topology of Boltzmann machines during training and improve performance.

Liu, Jeremy (ORCID:0000000172299417)↗
NASA NTRS1993

Mars Analog Site Study (MASS)

Many proposed missions to Mars involve landing vehicles, including the Mars 94/96 (Russia), Mars Environmental Survey (MESUR, US), and the Marsnet (ESA) missions. Most landers involve in situ measurements of rock and soil compositions, study of local geology by imaging, and establishment of seismic and meteorological networks. The selection of landing sites on Mars is a complex process that must meet engineering constraints and scientific objectives, using available and anticipated data. The goal of the MASS project is to conduct an 'end-to-end' test of the site selection process using Earth analogs.

Greeley, R.↗
DOE OSTI2025

Neural chaos: A spectral stochastic neural operator

Building surrogate models for operators with uncertainty quantification capabilities is essential for many engineering applications where randomness–such as variability in material properties, boundary conditions, and initial conditions–is unavoidable. Polynomial Chaos Expansion (PCE) is widely recognized as a go-to method for constructing stochastic surrogates in both intrusive and non-intrusive ways, and it has recently been used in the context of operator learning. However, its application becomes challenging for complex or high-dimensional processes, as achieving accuracy requires higher-order polynomials, which can increase computational demand and/or the risk of overfitting. Furthermore, PCE requires specialized treatments to manage random variables that are not independent, and these treatments may be problem-dependent or may fail with increasing complexity. Here, in this work, we adopt the same formalism as the spectral expansion used in PCE; however, we replace the classical polynomial basis functions with neural network (NN) basis functions to leverage their expressivity. To achieve this, we propose an algorithm that identifies NN-parameterized basis functions in a purely data-driven manner, without any prior assumptions about the joint distribution of the random variables involved, whether independent or dependent, or about their marginal distributions. The proposed algorithm identifies each NN-parameterized basis function sequentially, ensuring they are orthogonal with respect to the data distribution. The basis functions are constructed directly on the joint stochastic variables without requiring a tensor product structure or assuming independence of the random variables. This approach may offer greater flexibility for complex stochastic models, while simplifying implementation compared to the tensor product structures typically used in PCE to handle random vectors. This is particularly advantageous given the current state of open-source packages, where building and training neural networks can be done with just a few lines of code and extensive community support. We demonstrate the effectiveness of the proposed scheme through several numerical examples of varying complexity and provide comparisons with classical PCE.

Polynomial chaos expansion↗
NASA NTRS2010

Sources of Uncertainty in Predicting Land Surface Fluxes Using Diverse Data and Models

In the domain of predicting land surface fluxes, models are used to bring data from large observation networks and satellite remote sensing together to make predictions about present and future states of the Earth. Characterizing the uncertainty about such predictions is a complex process and one that is not yet fully understood. Uncertainty exists about initialization, measurement and interpolation of input variables; model parameters; model structure; and mixed spatial and temporal supports. Multiple models or structures often exist to describe the same processes. Uncertainty about structure is currently addressed by running an ensemble of different models and examining the distribution of model outputs. To illustrate structural uncertainty, a multi-model ensemble experiment we have been conducting using the Terrestrial Observation and Prediction System (TOPS) will be discussed. TOPS uses public versions of process-based ecosystem models that use satellite-derived inputs along with surface climate data and land surface characterization to produce predictions of ecosystem fluxes including gross and net primary production and net ecosystem exchange. Using the TOPS framework, we have explored the uncertainty arising from the application of models with different assumptions, structures, parameters, and variable definitions. With a small number of models, this only begins to capture the range of possible spatial fields of ecosystem fluxes. Few attempts have been made to systematically address the components of uncertainty in such a framework. We discuss the characterization of uncertainty for this approach including both quantifiable and poorly known aspects.

Dungan, Jennifer L.↗
DOE OSTI2022

A Multi-Branch Decoder Network Approach to Adaptive Temporal Data Selection and Reconstruction for Big Scientific Simulation Data

A key challenge in scientific simulation is that the simulation outputs often require intensive I/O and storage space to store the results for effective post hoc analysis. This article focuses on a quality-aware adaptive temporal data selection and reconstruction problem where the goal is to adaptively select simulation data samples at certain key timesteps in situ and reconstruct the discarded samples with quality assurance during post hoc analysis. This problem is motivated by the limitation of current solutions that a significant amount of simulation data samples are either discarded or aggregated during the sampling process, leading to inaccurate modeling of the simulated phenomena. Two unique challenges exist: 1) the sampling decisions have to be made in situ and adapted to the dynamics of the complex scientific simulation data; 2) the reconstruction error must be strictly bounded to meet the application requirement. To address the above challenges, we develop DeepSample , an error-controlled convolutional neural network framework, that jointly integrates a set of coherent multi-branch deep decoders to effectively reconstruct the simulation data with rigorous quality assurance. The results on two real-world scientific simulation applications show that DeepSample significantly outperforms other state-of-the-art methods on both sampling efficiency and reconstructed simulation data quality.

Zhang, Yang↗
NASA NTRS1981

Definition, analysis and development of an optical data distribution network for integrated avionics and control systems

The potential and functional requirements of fiber optic bus designs for next generation aircraft are assessed. State-of-the-art component evaluations and projections were used in the system study. Complex networks were decomposed into dedicated structures, star buses, and serial buses for detailed analysis. Comparisons of dedicated links, star buses, and serial buses with and without full duplex operation and with considerations for terminal to terminal communication requirements were obtained. This baseline was then used to consider potential extensions of busing methods to include wavelength multiplexing and optical switches. Example buses were illustrated for various areas of the aircraft as potential starting points for more detail analysis as the platform becomes definitized.

Burns, R. R.↗
DOE OSTI2021

Challenges and Solutions for Real-Time Phasor Modeling of Large-scale Distribution Network with High PV Penetration

The conversion process of a practical large-scale feeder data from a quasi-static time series (OpenDSS) model into a real-time phasor model (ePHASORSIM in Opal-RT) is discussed in the paper. The process is implemented using an open source Python software. Previous reported implementations for the conversion process lead to several errors when applied to a larger-scale system such as the one considered here. Hence in this work, we describe the common issues in this conversion and propose a customized solution to enhance the efficiency of the conversion and reduce the complexity in the process. A quantitative validation of the enhanced conversion process is presented in this work using an actual high PV penetration feeder model that consists of 2230 buses, and using actual load and PV profile data. After a detailed analysis, this customized conversion software will be made available as an open source tool and is expected to be helpful for researchers who want to pursue a similar conversion. Solutions to various observed issues such as identifying the lines due to islanded network, representation of full impedance model of transformer/lines as sequential models, complexity in the representation of single phase buses/lines as three phase buses/lines to make it compatible with the simulator platform are discussed. Comparison of power flow and time series simulation results obtained from both OpenDSS and ePHASORsim models show very low errors, validating the accuracy of the proposed conversion process.

14 SOLAR ENERGY↗
DOE OSTI2023

Predicting rare events using neural networks and short-trajectory data

Estimating the likelihood, timing, and nature of events is a major goal of modeling stochastic dynamical systems. When the event is rare in comparison with the timescales of simulation and/or measurement needed to resolve the elemental dynamics, accurate prediction from direct observations becomes challenging. In such cases a more effective approach is to cast statistics of interest as solutions to Feynman-Kac equations (partial differential equations). Here, we develop an approach to solve Feynman-Kac equations by training neural networks on short-trajectory data. Our approach is based on a Markov approximation but otherwise avoids assumptions about the underlying model and dynamics. This makes it applicable to treating complex computational models and observational data. Additionally, we illustrate the advantages of our method using a low-dimensional model that facilitates visualization, and this analysis motivates an adaptive sampling strategy that allows on-the-fly identification of and addition of data to regions important for predicting the statistics of interest. Finally, we demonstrate that we can compute accurate statistics for a 75-dimensional model of sudden stratospheric warming. This system provides a stringent test bed for our method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Optimization-Based Data-Driven Approach for Detecting Fault Location in Power Systems

In grids with large penetration of converterinterfaced resources (CIRs), measurements of voltage, current, and line parameters can fluctuate significantly during fault conditions. These fluctuations, combined with complex network topologies and extensive system branching, make accurate fault location challenging. Faults, such as short circuits, can cause prolonged outages with serious socio-economic impacts, highlighting the need for rapid fault identification to minimize downtime. However, current fault detection methods—such as relays and digital fault recorders—often relay information too slowly, impeding swift corrective action. Given the limited availability of high-resolution phasor measurement units, this paper introduces an optimization-based observer to estimate fault locations, grid line parameters, and voltages using local CIR measurements. To preserve the confidentiality of CIRs and enhance estimation accuracy, this study uses a black-box model of CIRs. This bottom-up, event-driven approach can enhances protection and control systems through optimized and real-time fault detection. Simulation results show that the optimization-based data-driven observer can accurately detect fault locations and estimate grid states and parameters, providing valuable insights for utilities and operators in grid applications.

Subedi, Sunil [ORNL] (ORCID:000000034069090X)↗
DOE OSTI2021

Physics-informed machine learning

Despite great progress in simulating multiphysics problems using the numerical discretization of partial differential equations (PDEs), one still cannot seamlessly incorporate noisy data into existing algorithms, mesh generation remains complex, and high-dimensional problems governed by parameterized PDEs cannot be tackled. Moreover, solving inverse problems with hidden physics is often prohibitively expensive and requires different formulations and elaborate computer codes. Machine learning has emerged as a promising alternative, but training deep neural networks requires big data, not always available for scientific problems. Instead, such networks can be trained from additional information obtained by enforcing the physical laws (for example, at random points in the continuous space-time domain). Such physics-informed learning integrates (noisy) data and mathematical models, and implements them through neural networks or other kernel-based regression networks. Moreover, it may be possible to design specialized network architectures that automatically satisfy some of the physical invariants for better accuracy, faster training and improved generalization. Furthermore, we review some of the prevailing trends in embedding physics into machine learning, present some of the current capabilities and limitations and discuss diverse applications of physics-informed learning both for forward and inverse problems, including discovering hidden physics and tackling high-dimensional problems.

97 MATHEMATICS AND COMPUTING↗