Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “complex network”

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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Advances in Engineering Nucleotide Sugar Metabolism for Natural Product Glycosylation in Saccharomyces cerevisiae

Glycosylation is a ubiquitous modification present across all of biology, affecting many things such as physicochemical properties, cellular recognition, subcellular localization, and immunogenicity. Nucleotide sugars are important precursors needed to study glycosylation and produce glycosylated products. Saccharomyces cerevisiae is a potentially powerful platform for producing glycosylated biomolecules, but it lacks nucleotide sugar diversity. Nucleotide sugar metabolism is complex, and understanding how to engineer it will be necessary to both access and study heterologous glycosylations found across biology. This review overviews the potential challenges with engineering nucleotide sugar metabolism in yeast from the salvage pathways that convert free sugars to their associated UDP-sugars to de novo synthesis where nucleotide sugars are interconverted through a complex metabolic network with governing feedback mechanisms. Finally, recent examples of engineering complex glycosylation of small molecules in S. cerevisiae are explored and assessed.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

Width-Based Discharge Partitioning in Distributary Networks: How Right We Are

River deltas are home to large populations and can be composed of complex channel networks which convey flows of matter to the shoreline. Knowledge of flow within individual channels is needed to quantify the distribution of discharge across the delta, and thus its sustainability over time. Due to a lack of field measurements at the local channel scale, researchers leverage remote sensing data to estimate the partitioning of flow. We compare data from 15 river deltas to discharge partitioning estimates based on channel network graphs derived from remote sensing imagery. We quantify errors in the common width-based method and test alternative partitioning techniques to find that width-based discharge partitioning is universally applicable, suggesting that absent any site-specific information, discharge partitioning by average channel width is an appropriate approach. We also provide networks, streamflow measurements, and flux partitioning estimates for 28 delta networks as the Discharge In Distributary NeTworks (DIDNT) dataset.

58 GEOSCIENCES↗
DOE OSTI2023

Chemical abrasion: the mechanics of zircon dissolution

Chemical abrasion is a technique that combines thermal annealing and partial dissolution in hydrofluoric acid (HF) to selectively remove radiation-damaged portions of zircon crystals prior to U–Pb isotopic analysis, and it is applied ubiquitously to zircon prior to U–Pb isotope dilution thermal ionization mass spectrometry (ID-TIMS). The mechanics of zircon dissolution in HF and the impact of different leaching conditions on the zircon structure, however, are poorly resolved. We present a microstructural investigation that integrates microscale X-ray computed tomography (µCT), scanning electron microscopy, and Raman spectroscopy to evaluate zircon dissolution in HF. We show that µCT is an effective tool for imaging metamictization and complex dissolution networks in three dimensions. Acid frequently reaches crystal interiors via fractures spatially associated with radiation damage zoning and inclusions to dissolve soluble high-U zones, some inclusions, and material around fractures, leaving behind a more crystalline zircon residue. Other acid paths to crystal cores include the dissolution of surface-reaching inclusions and the percolation of acid across zones with high defect densities. In highly crystalline samples dissolution is crystallographically controlled with dissolution proceeding almost exclusively along the c axis. Increasing the leaching temperature from 180 to 210 °C results in deeper etching textures, wider acid paths, more complex internal dissolution networks, and greater volume losses. How a grain dissolves strongly depends on its initial radiation damage content and defect distribution as well as the size and position of inclusions. As such, the effectiveness of any chemical abrasion protocol for ID-TIMS U–Pb geochronology is likely sample-dependent. We also briefly discuss the implications of our findings for deep-time (U-Th)/He thermochronology.

58 GEOSCIENCES↗
DOE OSTI2023

Attention for Causal Relationship Discovery from Biological Neural Dynamics

This paper explores the potential of the transformer models for learning Granger causality in networks with complex nonlinear dynamics at every node, as in neurobiological and biophysical networks. Our study primarily focuses on a proof-of-concept investigation based on simulated neural dynamics, for which the ground-truth causality is known through the underlying connectivity matrix. For transformer models trained to forecast neuronal population dynamics, we show that the cross-attention module effectively captures the causal relationship among neurons, with an accuracy equal to or superior to that of the most popular Granger causality discovery method. While we acknowledge that real-world neurobiology data will bring further challenges, including dynamic connectivity and unobserved variability, this research offers an encouraging preliminary glimpse into the utility of the transformer model for causal representation learning in neuroscience.

Lu, Ziyu↗
DOE OSTI2025

Deep Learning without Global Optimization by Random Fourier Neural Networks

Here we introduce a new training algorithm for deep neural networks that utilize random complex exponential activation functions. Our approach employs a Markov chain Monte Carlo sampling procedure to iteratively train network layers, avoiding global and gradient-based optimization while maintaining error control. It consistently attains the theoretical approximation rate for residual networks with complex exponential activation functions, determined by network complexity. Additionally, it enables efficient learning of multiscale and high-frequency features, producing interpretable parameter distributions. Despite using sinusoidal basis functions, we do not observe Gibbs phenomena in approximating discontinuous target functions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Complexes of tubulin oligomers and tau form a viscoelastic intervening network cross-bridging microtubules into bundles

Abstract The axon-initial-segment (AIS) of mature neurons contains microtubule (MT) fascicles (linear bundles) implicated as retrograde diffusion barriers in the retention of MT-associated protein (MAP) tau inside axons. Tau dysfunction and leakage outside of the axon is associated with neurodegeneration. We report on the structure of steady-state MT bundles in varying concentrations of Mg 2+ or Ca 2+ divalent cations in mixtures containing αβ-tubulin, full-length tau, and GTP at 37 °C in a physiological buffer. A concentration-time kinetic phase diagram generated by synchrotron SAXS reveals a wide-spacing MT bundle phase (B ws ), a transient intermediate MT bundle phase (B int ), and a tubulin ring phase. SAXS with TEM of plastic-embedded samples provides evidence of a viscoelastic intervening network (IN) of complexes of tubulin oligomers and tau stabilizing MT bundles. In this model, αβ-tubulin oligomers in the IN are crosslinked by tau’s MT binding repeats, which also link αβ-tubulin oligomers to αβ-tubulin within the MT lattice. The model challenges whether the cross-bridging of MTs is attributed entirely to MAPs. Tubulin-tau complexes in the IN or bound to isolated MTs are potential sites for enzymatic modification of tau, promoting nucleation and growth of tau fibrils in tauopathies.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Learning Sequential Distribution System Restoration via Graph-Reinforcement Learning

We report a distribution service restoration algorithm as a fundamental resilient paradigm for system operators provides an optimally coordinated, resilient solution to enhance the restoration performance. The restoration problem is formulated to coordinate distribution generators and controllable switches optimally. A model-based control scheme is usually designed to solve this problem, relying on a precise model and resulting in low scalability. To tackle these limitations, this work proposes a graph-reinforcement learning framework for the restoration problem. We link the power system topology with a graph convolutional network, which captures the complex mechanism of network restoration in power networks and understands the mutual interactions among controllable devices. Latent features over graphical power networks produced by graph convolutional layers are exploited to learn the control policy for network restoration using deep reinforcement learning. The solution scalability is guaranteed by modeling distributed generators as agents in a multi-agent environment and a proper pre-training paradigm. Comparative studies on IEEE 123-node and 8500-node test systems demonstrate the performance of the proposed solution.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Confidentiality-preserving machine learning algorithms for soft-failure detection in optical communication networks

Automated fault management is at the forefront of next-generation optical communication networks. The increase in complexity of modern networks has triggered the need for programmable and software-driven architectures to support the operation of agile and self-managed systems. In these scenarios, the European Telecommunications Standards Institute zero-touch network and service management approach is imperative. The need for machine learning algorithms to process the large volume of telemetry data brings safety concerns as distributed cloud-computing solutions become the preferred approach for deploying reliable communication network automation. This paper’s contribution is twofold. First, we propose a simple yet effective method to guarantee the confidentiality of the telemetry data based on feature scrambling. The method allows the operation of third-party computational services without direct access to the full content of the collected data. Additionally, the effectiveness of four unsupervised machine learning algorithms for soft-failure detection is evaluated when applied to the scrambled telemetry data. The methods are based on factor analysis, principal component analysis, nonlinear principal component analysis, and singular value decomposition. Most dimensionality reduction algorithms have the common property that they can maintain similar levels of fault classification performance while hiding the data structure from unauthorized access. Evaluations of the proposed algorithms demonstrate this capability.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

SENTRA: A Modular Computational Graph Framework for Critical Mineral and Materials Supply Chains: Part I: Network Construction Latent-Quantity Estimation, and Temporal Graph Forecasting

Global supply chains for critical minerals and materials are complex, evolving networks of countries, products, production stages, and trade relationships. Existing analytical approaches are limited by fragmented data and static network representations that do not capture the dynamic production dependencies linking raw materials, intermediate products, and final goods across multiple countries. Trade and production statistics provide only a partial view of domestic production, inventories, and material flows, making it difficult to identify indirect sourcing pathways, hidden dependencies, and embedded foreign exposures. This paper introduces the Supply Chain Exposure Network Tracking and Risk Assessment (SENTRA) framework, a modular graph-based computational framework for constructing, analyzing, and forecasting dynamic supply chain networks. As the first paper in a three-part methodological series, it establishes the computational foundation of SENTRA by constructing a temporal attributed multi-relational graph whose nodes represent product–country pairs and whose edges encode observed trade and within-country value-chain relationships. Statistical estimation and constrained optimization recover latent production, final demand, and product input dependency coefficients while enforcing economic accounting constraints. Graph-derived exposure measures quantify direct, transshipment, value-chain, and multi-hop supply chain dependencies independently of the forecasting model. A temporal graph forecasting architecture based on a relational graph neural network then forecasts the evolution of the graph under mass-balance constraints with distribution-free conformal uncertainty quantification. Validation on the global aluminum supply chain shows that the learned graph representations recover economically meaningful supply chain structure, accurately forecast out-of-sample trade relationships, and produce well-calibrated prediction intervals. Subsequent papers apply this computational foundation to exposure assessment, disruption analysis, and scenario-based policy analysis, and extend the framework to multimaterial supply chain modeling and decision support.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Prevalence and scalable control of localized networks

The ability to control network dynamics is essential for ensuring desirable functionality of many technological, biological, and social systems. Such systems often consist of a large number of network elements, and controlling large-scale networks remains challenging because the computation and communication requirements increase prohibitively fast with network size. Here, we introduce a notion of network locality that can be exploited to make the control of networks scalable, even when the dynamics are nonlinear. We show that network locality is captured by an information metric and is almost universally observed across real and model networks. In localized networks, the optimal control actions and system responses are both shown to be necessarily concentrated in small neighborhoods induced by the information metric. This allows us to develop localized algorithms for determining network controllability and optimizing the placement of driver nodes. This also allows us to develop a localized algorithm for designing local feedback controllers that approach the performance of the corresponding best global controllers, while incurring a computational cost orders-of-magnitude lower. Here, we validate the locality, performance, and efficiency of the algorithms in Kuramoto oscillator networks, as well as three large empirical networks: synchronization dynamics in the Eastern US power grid, epidemic spreading mediated by the global air-transportation network, and Alzheimer’s disease dynamics in a human brain network. Taken together, our results establish that large networks can be controlled with computation and communication costs comparable to those for small networks.

42 ENGINEERING↗
DOE OSTI2024

Complex multicomponent spectrum analysis with Deep Neural Network

Here, in this paper, we present the use of deep neural networks to estimate physical parameters from complex optical emission spectra of the D β /H β transition. Specifically, we focus on estimating the radio frequency electric field vector of the lower hybrid wave and isotope ratio within the scrape-off-layer plasma of the WEST tokamak. Fitting the spectral data using a traditional non-linear least squares analysis requires many free parameters and is computationally expensive, rendering the data unusable for real-time control. By implementing relatively small neural networks, the physical parameters can be directly extracted from the spectral data with reasonable accuracy in a few milliseconds. The deep neural network prediction can serve as input for a reduced model using least-squares fitting or for real-time control. We show that deep neural networks can be an effective tool for analyzing complex multicomponent spectra, providing a speedup of more than 10 5 times compared to least residual analysis, with an accuracy of 0.5% for the isotope ratio, and 0.09 kV/cm and 0.38 kV/cm for the RF radial and poloidal electric field respectively.

47 OTHER INSTRUMENTATION↗
DOE OSTI2025

Accurate and rapid acoustic damage characterization in complex structures using sparse sensor networks and deep learning models

Damage diagnosis in critical components is essential for ensuring the safety and reliability of operations across industries, spanning manufacturing, aerospace, and energy. Traditional acoustic nondestructive testing methods primarily focus on detecting defects through the direct scattering of single-mode incident waves from the damage, which limit their applicability to simple structures and small inspection areas. Our earlier research demonstrated that machine learning algorithms combined with sparse sensor networks can identify critical defect signatures even from multiply scattered, multi-mode acoustic signals, indicating the potential for improved defect inspection in complex, real-world structures. In this work, we demonstrate the successful implementation of this approach in a fixed sensor configuration to rapidly and accurately detect simulated defects in a geometrically complex, real-world structure, a brake rotor hub. Three different types of defects were physically simulated on the surface of the hub, and the collected data were used to train an autoencoder-based deep learning model. Two models were tested, one using single measurements and the other using multiple measurements taking advantage of the spatial distribution of the sensor network. After training, the multi-measurement model achieved 100 % accuracy in identifying, classifying, and locating unseen, unique damages. This work illustrates the potential of the proposed method for a wide range of industrial applications.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Complexity Reduction Methods for Large-Scale Spatially Explicit Biofuels Network Design

The size and complexity of energy system optimization models have increased significantly in recent years, driven by the availability of high-resolution spatial data. We present complexity reduction and solution methods that enable us to efficiently represent high-resolution spatial data in the network design of large-scale energy systems. We aim to reduce the size and enhance the computational efficiency of network design models without sacrificing solution accuracy. Specifically, we first present how to aggregate highly granular data into larger resolutions without averaging out their specific properties through a composite-curve-based approach and then develop a method to linearly represent these curves. Second, we utilize a general clustering method to determine groups of geographically proximate biomass fields and establish a single transportation arc for all of them, reducing the number of transportation-related variables while maintaining an accurate representation of the system. Finally, we introduce a two-step algorithm that decomposes large-scale network design problems into two smaller, more manageable subproblems. We demonstrate the application of our methods using a case study of switchgrass-to-biofuels network design in the eight states of the U.S. Midwest, using realistic and highly explicit spatial data.

09 BIOMASS FUELS↗
DOE OSTI2021

Lipid production from non-sugar compounds in pretreated lignocellulose hydrolysates by Rhodococcus jostii RHA1

Valorization of all carbon sources from biorefinery wastes to biofuels and bioproducts is an attractive but challenging strategy to improve the carbon efficiency of the entire biorefinery process for economic competitiveness. Rhodococcus jostii RHA1 is considered as a promising candidate for conversion of non-sugar compounds in pretreated lignocellulose hydrolysate, which contain aromatic monomers, furans and acids derived from biomass. However, the insufficient understanding of the strain’s complex metabolism network limits its application. In this study, furans (furfural, 5-hydroxymethylfurfural), phenols (vanillin, vanillate), and organic acids (acetic acid), which mimic the complex components of the non-sugar compounds in pretreated biomass hydrolysate, were mixed with benzoate or used individually as carbon sources to investigate the growth and lipid accumulation of R. jostii RHA1. Fermentation kinetics, specific growth rates (h-1) and lipid yield (g(g) -1, g(mmol)-1), for each selected biomass-derived compound were compared for lipid production. The order of the specific growth rates (h-1) was benzoate > acetic acid > vanillate > vanillin. Higher consumption rate of benzoate than that of vanillate, as well as different lipid yield from them, suggested the preference of strain employing two branches of ß-ketoadipate pathway and plausibly distinct carbon routing to lipid biosynthesis. And acetic acid showed the lowest lipid yield (g(mmol)-1) indicating less carbon contributed to lipid production. The highest lipid content (0.46 g lipid/g CDW) was achieved using benzoate as a main carbon source in the presence of 5-hydroxymethylfurfural (5-HMF). The generated lipids predominantly contained C16:0 and C17:0 fatty acids. The concentration of furfural and 5-HMF in fermentation broth decreased individually or simultaneously with benzoate catabolism. NMR results revealed the oxidation of furfural and 5-HMF by R. jostii RHA1. This study provides new insights into the catabolism and metabolism of non-sugar compounds derived from biomass by Rhodococcus in terms of growth and lipid production, facilitating its application to 2nd generation biofuel production.

Li, Xiaolu↗
DOE OSTI2021

Characterizing uncertainties in ground “truth” of precipitation over complex terrain through high-resolution numerical modeling

Ground observation of precipitation over complex terrain is subject to large uncertainties due to inadequate sampling. This study explores a method that combines limited gauge data and a high-resolution numerical simulation to quantify the precipitation uncertainties in central Himalaya. Specifically, the Coefficient of spatial Variability (CV) of precipitation and the minimum Number of Required Stations (NRS) to obtain areal-mean precipitation ground truth values within a 0.25-degree area are investigated using fine-scale meteorological simulation at 1.5 km grid spacing. Evaluation over a densely-gauged area demonstrates comparable CV and NRS values between station observations and simulations. The simulated CV and NRS values in a larger area show a strong and positive dependence on each other and an expected positive (negative) correlation with topographic complexity (temporal scale). The proposed method sheds lights on evaluating precipitation products and holds promise for informing the layout of rain gauge networks in complex terrain.

Ouyang, Lin↗
DOE OSTI2025

RWRtoolkit: multi-omic network analysis using random walks on multiplex networks in any species

Abstract We introduce RWRtoolkit, a multiplex generation, exploration, and statistical package built for R and command-line users. RWRtoolkit enables the efficient exploration of large and highly complex biological networks generated from custom experimental data and/or from publicly available datasets, and is species agnostic. A range of functions can be used to find topological distances between biological entities, determine relationships within sets of interest, search for topological context around sets of interest, and statistically evaluate the strength of relationships within and between sets. The command-line interface is designed for parallelization on high-performance cluster systems, which enables high-throughput analysis such as permutation testing. Several tools in the package have also been made available for use in reproducible workflows via the KBase web application.

Kainer, David (ORCID:0000000172714676)↗
DOE OSTI2020

Resilience of Urban Transport Network-of-Networks under Intense Flood Hazards Exacerbated by Targeted Attacks

Natural hazards including floods can trigger catastrophic failures in interdependent urban transport network-of-networks (NoNs). Population growth has enhanced transportation demand while urbanization and climate change have intensified urban floods. However, despite the clear need to develop actionable insights for improving the resilience of critical urban lifelines, the theory and methods remain underdeveloped. Furthermore, as infrastructure systems become more intelligent, security experts point to the growing threat of targeted cyber-physical attacks during natural hazards. Here we develop a hypothesis-driven resilience framework for urban transport NoNs, which we demonstrate on the London Rail Network (LRN). We find that topological attributes designed for maximizing efficiency rather than robustness render the network more vulnerable to compound natural-targeted disruptions including cascading failures. Our results suggest that an organizing principle for post-disruption recovery may be developed with network science principles. Our findings and frameworks can generalize to urban lifelines and more generally to real-world spatial networks.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

Non-Intrusive Appliance Identification with Appliance-Specific Networks

The problem of noninstrusive load monitoring (NILM) is usually formulated as a single-channel blind source separation task, whose successful solution enable fast and convenient load identification and energy disaggregation. When applied at test time, NILM algorithms aim to identify the operating characteristics of individual appliances from an aggregate power measurement of the entire house. Recent advances in deep learning gave rise to many methods that mostly focus on learning a direct mapping from aggregate measurement to individual appliance power. However, these methods are not only computationally expensive, but they often suffer from overfitting and do not generalize very well. In this article, we propose a novel NILM method that leverages advances in statistical learning that have not been properly applied in this domain before. The proposed method consists of three stages: first, a Bayesian nonparametric learning-based approach for appliance state extraction; second, synthetic minority oversampling technique for data augmentation and mitigating the heavy imbalance in switching events; and third, appliance-specific lightweight long short-term memory networks for status classification for each appliance. Here, we adopt a “differential” input (the difference before and after the switching event) to reduce the complexity of network training and make the proposed method robust to multiappliance switching events. Experiments are conducted to demonstrate the effectiveness of the proposed method, achieving superior performance when compared to recent methods. An ablation study is conducted to demonstrate the effectiveness of each module of our method. Finally, we investigate the quality of generated synthetic samples.

42 ENGINEERING↗