Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Complex 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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

FlbB forms a distinctive ring essential for periplasmic flagellar assembly and motility in Borrelia burgdorferi

Spirochetes are a widespread group of bacteria with a distinct morphology. Some spirochetes are important human pathogens that utilize periplasmic flagella to achieve motility and host infection. The motors that drive the rotation of periplasmic flagella have a unique spirochete-specific feature, termed the collar, crucial for the flat-wave morphology and motility of the Lyme disease spirochete Borrelia burgdorferi. Here, we deploy cryo-electron tomography and subtomogram averaging to determine high-resolution in-situ structures of the B. burgdorferi flagellar motor. Comparative analysis and molecular modeling of in-situ flagellar motor structures from B. burgdorferi mutants lacking each of the known collar proteins (FlcA, FlcB, FlcC, FlbB, and Bb0236/FlcD) uncover a complex protein network at the base of the collar. Importantly, our data suggest that FlbB forms a novel periplasmic ring around the rotor but also acts as a scaffold supporting collar assembly and subsequent recruitment of stator complexes. The complex protein network based on the FlbB ring effectively bridges the rotor and 16 torque-generating stator complexes in each flagellar motor, thus contributing to the specialized motility and lifestyle of spirochetes in complex environments.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

rNets: a standalone package to visualize reaction networks

In the study of chemical processes, visualizing reaction networks is pivotal for identifying crucial compounds and transformations. Traditional methods, such as network schematics and reaction path linear plots, often struggle to effectively represent complex reaction networks due to their size and intricate connectivity. Alternatives capable of leading with complexity include graph methods, but they are not user-friendly, lacking simplicity and modularity, which hinders their integration with widely-used research software. This work introduces rNets an innovative tool designed for the efficient visualization of reaction networks with a user-friendly interface, modularity, and seamless integration with existing software packages. The effectiveness of rNets is demonstrated through its application in analyzing three catalytic reactions, showcasing its potential to significantly enhance research both in homogeneous and heterogeneous catalysis fields. This tool not only simplifies the visualization process but also opens new avenues for exploring complex reaction networks in diverse research contexts.

Pablo-García, Sergio↗
DOE OSTI2026

Stochastic fracture generation and thermo-hydro-mechanical modeling in an equivalent continuum framework for enhanced geothermal systems

Enhanced geothermal systems (EGS) involve fracturing low permeability material to establish well connectivity and then injecting and circulating fluid into the fractured subsurface for geothermal power production. Changes in fracture aperture from contraction of the cooling matrix rock may alter network connectivity and risk thermal short-circuiting. Thermo-hydro-mechanical (THM) models are a useful tool to study these processes. However, as fracture networks are complex, and data may be limited, fracture networks in THM models are often stochastically generated. Given reliance on stochastic fracture networks and THM modeling to represent the subsurface and assess productivity of EGS, increased understanding of the influence of such statistically derived fracture networks on flow and heat transport in THM models is needed. Here, a new fracture process model is developed in the reactive transport code PFLOTRAN to stochastically generate fracture families and simulate changes in fracture aperture over time due to temperature changes of the rock matrix. Sixty-four different fracture networks ranging from well to poorly-connected, are modeled in PFLOTRAN with and without mechanical processes (THM vs TH). Results indicate that for well-connected fracture networks, thermal short-circuiting is less of a concern due to the abundance of available alternative flowpaths. For poorly-connected fracture networks, inclusion of mechanical processes showed steep thermal drawdown coincident with increase in fracture aperture along developing colder flowpaths, demonstrating the risk of thermal short-circuiting. Simulations with additional, larger fractures engineered to establish connectivity in a poorly-fractured subsurface, indicate that while stochastic variation of fracture orientation of the background network had limited influence, such variation in the engineered fractures significantly affected flow and heat transport.

Discrete fracture networks (DFN)↗
DOE OSTI2021

Transient cycling of nitrogen, organic carbon and oxygen within the free-flowing Columbia River corridor: Linking exposure time dependent biogeochemical reactions to river stage fluctuations (Final project report)

The objective of this project was to develop next-generation techniques for representing the transformations of complex reaction networks like those impacting transient river-corridors, then apply them to develop upscaling tools. The project contributed significantly to the development of Lagrangian “mass transfer particle tracking” (MTPT) tools that are the first numerical framework that explicitly separates mixing and spreading processes; a crucial distinction for accurate representations of reaction rates across scales. The MTPT approach uses an operator splitting scheme where physical transport processes are simulated using classical random walk methods and each particle is treated as a “container” that carries with it any number of chemical species. Mixing between particles is simulated using a colocation-probability based mass transfer kernel and reactions are evaluated on each particle after mixing. The method is stable, accurate, and also allows the explicit modeling of residence time distributions of the individual containers of mass. The MTPT scheme allowed us to explore several research questions related to reactive transport in river corridors and complex reaction networks. We found that it is possible to quantify the exposure time distributions (ETDs) of reactants and that this does suggest some pathways to upscaling. However, comparable approximations can be obtained using simplified (reduced dimensionality) MTPT simulations in less time with similar uncertainty, so development of extensive ETD-based methods was not productive. The major findings are that i) the MTPT schemes are robust and highly accurate across a range of arbitrarily complex reactions, ii) the methods can be efficiently parallelized and the parallel performance characteristics of MTPT are predictable, and iii) the MTPT tools allow simultaneous tracking of residence time. The development of these research tools into efficient software packages continues. The methods are already available to the community because open-source, working examples have been included with all publications.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2026

Powers of magnetic graph matrix: Fourier spectrum, walk compression, and applications

Magnetic graphs, originally developed to model quantum systems under magnetic fields, have recently emerged as a powerful framework for analyzing complex directed networks. Existing research has primarily used the spectral properties of the magnetic graph matrix to study global and stationary network features. However, their capacity to model local, nonequilibrium behaviors, often described by matrix powers, remains largely unexplored. We present a combinatorial interpretation of the magnetic graph matrix powers through directed walk profiles—counts of graph walks indexed by the number of edge reversals. Crucially, we establish that walk profiles correspond to a Fourier transform of magnetic matrix powers. The connection allows exact reconstruction of walk profiles from magnetic matrix powers at multiple discrete potentials, and more importantly, an even smaller number of potentials often suffices for accurate approximate reconstruction in real networks. This shows the empirical compressibility of the information captured by the magnetic matrix. This fresh perspective suggests further applications; for example, we illustrate how powers of the magnetic matrix can identify frustrated directed cycles (e.g., feedforward loops) and can be effectively employed for link prediction by encoding local structural details in directed graphs.

complex networks↗
DOE OSTI2024

Simulation Evaluation of a Large-Scale Implementation of Virtual-Phase Link-Based Model Predictive Control

Traffic congestion is a serious problem in the US, and traffic signal control is one of the effective solutions to congestion. Previous research on model predictive control (MPC)-based traffic signal control showed substantial benefits over conventional methods. This study focused on implementing MPC over a large-scale network with complex intersections and the impact of cycle length, network size, and imperfect state estimation on performances. This study implemented a virtual phase link (VPL)-based model predictive control method which used the number of vehicles in each VPL as input state variables and was suitable for National Electrical Manufacturing Association (NEMA) ring-barrier control. To test the impact of network size, the performance of distributed MPC (36 intersections in the network are divided into five subnetworks) was compared with that of MPC over the full network for a set of cycle lengths. To test the impact of imperfect state estimation, we synthetically infused estimation error and developed two scenarios, MPC-error and MPC-error narrow, which had higher and lower estimation errors, respectively. The performance of these MPC methods was compared with that of the existing time-of-day (TOD) method and an offline method that used Webster's method for split and MULTIBAND for cycle length and offset optimization. Trajectory and linkwise signal performance measures were collected from the simulation to evaluate performance. The distributed MPC method with perfect state estimation had the lowest delay and highest energy efficiency of all the methods. The performance of MPC decreased as the prediction inaccuracy increased. MPC-error had 7% and 11% more delay than MPC-error narrow in the morning and evening peaks, respectively. Overall, simulation results suggest that even with imperfect state estimation, MPC methods will outperform offline methods significantly.

large-scale simulation↗
DOE OSTI2021

Efficient Sampling of Complex Interdependent and Multiplex Networks

Efficient sampling of interdependent and multiplex infrastructure networks is critical for effectively applying failure and recovery algorithms in real-world settings, as well as to generate property-preserving reduced-order graph-based ensembles that address topological uncertainties. In this paper, we first explore the performance, i.e. the success in preserving graph properties, of graph sampling algorithms for interdependent and multiplex networks with synthetic and real-world graphs. We simulate sampling algorithms under different parameter settings. These settings include probabilistic graph generators, coupling patterns, and various performance metrics. Our results show that while Random Node and Random Walk sampling algorithms perform best for interdependent networks, Random Edge and Forest Fire sampling algorithms perform best for multiplex networks. Second, we propose and implement a novel similarity-based sampling algorithm for multiplex networks that samples only log(N) number of layers of an N-layer multiplex network while yielding computational savings with performance guarantees. Experimental results show that similarity sampling outperforms complete sampling of all layers while decreasing performance costs from a linear scale to a logarithmic one. Our results also indicate that similarity-based sampling outperforms complete sampling and random selection in nearly all scenarios when tested with real-world data.

Subasi, Omer↗
DOE OSTI2023

Social network structure and the spread of complex contagions from a population genetics perspective

Ideas, behaviors, and opinions spread through social networks. If the probability of spreading to a new individual is a non-linear function of the fraction of the individuals’ affected neighbors, such a spreading process becomes a “complex contagion”. This non-linearity does not typically appear with physically spreading infections, but instead can emerge when the concept that is spreading is subject to game theoretical considerations (e.g. for choices of strategy or behavior) or psychological effects such as social reinforcement and other forms of peer influence (e.g. for ideas, preferences, or opinions). Here we study how the stochastic dynamics of such complex contagions are affected by the underlying network structure. Motivated by simulations of complex contagions on real social networks, we present a framework for analyzing the statistics of contagions with arbitrary non-linear adoption probabilities based on the mathematical tools of population genetics. The central idea is to use an effective lower-dimensional diffusion process to approximate the statistics of the contagion. This leads to a tradeoff between the effects of ”selection” (microscopic tendencies for an idea to spread or die out), random drift, and network structure. Our framework illustrates intuitively several key properties of complex contagions: stronger community structure and network sparsity can significantly enhance the spread, while broad degree distributions dampen the effect of selection compared to random drift. Finally, we show that some structural features can exhibit critical values that demarcate regimes where global contagions become possible for networks of arbitrary size. Our results draw parallels between the competition of genes in a population and memes in a world of minds and ideas. Our tools provide insight into the spread of information, behaviors, and ideas via social influence, and highlight the role of macroscopic network structure in determining their fate.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

The effect of differential mineral shrinkage on crack formation and network geometry

Rock, concrete, and other engineered materials are often composed of several minerals that change volumetrically in response to variations in the moisture content of the local environment. Such differential shrinkage is caused by varying shrinkage rates between mineral compositions during dehydration. Using both 3D X-ray imaging of geo-architected samples and peridynamic (PD) numerical simulations, we show that the spatial distribution of the clay affects the crack network geometry with distributed clay particles yielding the most complex crack networks and percent damage (99.56%), along with a 60% reduction in material strength. We also demonstrate that crack formation, growth, coalescence, and distribution during dehydration, are controlled by the differential shrinkage rates between a highly shrinkable clay and a homogeneous mortar matrix. Sensitivity tests performed with the PD models show a clay shrinkage parameter of 0.4 yields considerable damage, and reductions in the parameter can result in a significant reduction in fracturing and an increase in material strength. Additionally, isolated clay inclusions induced localized fracturing predominantly due to debonding between the clay and matrix. These insights indicate differential shrinkage is a source of potential failure in natural and engineered barriers used to sequester anthropogenic waste.

58 GEOSCIENCES↗
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↗