Engineering PapersSearch

SEARCH · Engineering Papers

Results for “Networked”

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 55 records · Page 3

Science Uses Deployment Operations-Advanced Wireless: Exploring Open Radio Access Network Technologies for Energy Science

Open Radio Access Network is emerging as a solution to the increasing demand for more flexible, cost-effective, and advanced mobile network infrastructures. This evolution is driven by advancements in wireless technologies and the growing complexity of deploying and managing these networks. O-RAN represents a significant shift in wireless technology, building upon the 3rd Generation Partnership Project framework to foster openness, flexibility, and interoperability. By decoupling hardware and software components, Open Radio Access Network enables a multi-vendor ecosystem that encourages innovation and diverse solutions. Open Radio Access Network's potential extends beyond traditional wireless applications, with growing interest in its role in advancing energy systems, particularly in the context of smart grids, microgrids, and the integration of renewable energy sources. While the role of open-wireless technologies in driving energy transformation is increasingly recognized, further exploration is needed. Vendors and utilities are investigating how Open Radio Access Network technologies can optimize energy use cases and improve the performance of 5G and beyond applications. This report outlines efforts under the Science Uses Deployment Operations Advance Wireless project, a collaboration between the National Laboratory of the Rockies' Cybersecurity Research Center, Argonne National Laboratory, Lawrence Berkeley National Laboratory, and the Department of Energy's Energy Science Network research and operations staff. The focus of this project is on due diligence, through testing and evaluation, preparing for the deployment of advanced wireless infrastructure for scientific use cases, with an emphasis on Open Radio Access Network technology, its components, integrations, and its ability to support vertical stack application across the energy sector. Additionally, the report highlights the value cases for utilities, underscoring how adopting open wireless standards can accelerate the evolution of energy systems, foster innovation, and improve the integration of critical energy technologies.

24 POWER TRANSMISSION AND DISTRIBUTION

Hybrid classical-quantum communication networks

Over the past several decades, the proliferation of global classical communication networks has transformed various facets of human society. Concurrently, quantum networking has emerged as a dynamic field of research, driven by its potential applications in distributed quantum computing, quantum sensor networks, and secure communications. This prompts a fundamental question: rather than constructing quantum networks from scratch, can we harness the widely available classical fiber-optic infrastructure to establish hybrid quantum–classical networks? This paper aims to provide a comprehensive review of ongoing research endeavors aimed at integrating quantum communication protocols, such as quantum key distribution, into existing lightwave networks. This approach offers the substantial advantage of reducing implementation costs by allowing classical and quantum communication protocols to share optical fibers, communication hardware, and other network control resources—arguably the most pragmatic solution in the near term. In the long run, classical communication will also reap the rewards of innovative quantum communication technologies, such as quantum memories and repeaters. Accordingly, our vision for the future of the Internet is that of heterogeneous communication networks thoughtfully designed for the seamless support of both classical and quantum communications.

Fiber-optic communication

Highly functional microspheres facilitating Diels–Alder network formation

Introducing particles to dynamic covalent networks is a common approach to improve their performance. However, network formation can be impacted by their size and functionality. The influence can be predicted by common theories for small molecular precursors, but it is unclear whether they are applicable to precursors bearing numerous reactive groups and micrometer-scale dimensions. In this work, an experimental study was undertaken using dynamic covalent networks formed by the Diels–Alder reaction between furan and maleimide groups. The gelation behavior of the Diels–Alder networks was studied using rheometry to track their network formation at 40 °C with varying maleimide-functionalized microsphere loading. The highly functional microspheres can interact with the furan precursor, aiding in the formation of the Diels–Alder networks. A 5 wt% microsphere sample can reduce the gelation time by 23% and facilitate network formation in an unbalanced stoichiometry near the critical composition to form a percolating network.

36 MATERIALS SCIENCE

Enhancing Lattice Kinetic Schemes for Fluid Dynamics with Lattice-Equivariant Neural Networks

A new class of equivariant neural networks is presented, hereby dubbed lattice-equivariant neural networks (LENNs), designed to satisfy local symmetries of a lattice structure. The approach develops within a recently introduced framework aimed at learning neural network-based surrogate models’ lattice Boltzmann collision operators. Whenever neural networks are employed to model physical systems, respecting symmetries and equivariance properties has been shown to be key for accuracy, numerical stability, and performance. Here, hinging on ideas from group representation theory, trainable layers are defined whose algebraic structure is equivariant with respect to the symmetries of the lattice cell. In this work, the presented method naturally allows for efficient implementations, in terms of both memory usage and computational costs, supporting scalable training/testing for lattices in two spatial dimensions and higher (in which the size of symmetry group grows). The approach is validated and tested considering 2D and 3D flowing dynamics, both in laminar and turbulent regimes. It is compared with group-averaged-based symmetric networks and with plain, nonsymmetric, networks, showing how the presented approach unlocks the (a posteriori) accuracy and training stability of the former models and the train/inference speed of the latter networks. (LENNs are about one order of magnitude faster than group-averaged networks in 3D.) The work in this paper opens toward practical use of machine learning-augmented lattice Boltzmann CFD in real-world simulations.

97 MATHEMATICS AND COMPUTING

Electronic Configurational Transformation of Network Modifiers in Aluminate Glass above Megabar Pressures

Electronic responses of glasses under extreme pressures differ from those of crystalline analogs. Their distinct electronic environments are found in network formers with well-defined, covalent-bonded coordination environments (e.g., [4] Si and [4] Al) and in network modifiers with more disordered, ionic-bonded configurations (e.g., [5,6,7] Ca). Deciphering the evolution of the bonding environment of network modifier cations upon compression provides atomic insights into the pressure-driven hardening and transport properties of glasses. Despite the importance, in contrast to extensive efforts to uncover how network formers behave under pressure, considerable structural disorder around network modifiers makes it challenging to probe their electronic bonding environments under compression. Our understanding of the evolution of network modifiers above megabars is currently absent. Here, we report a discovery of highly densified electronic configurations of network modifier Ca in aluminate glass under extreme compression via the first inelastic X-ray scattering at the Ca L-edge up to 140 GPa. As evidenced by the prominent pressure-driven increases in electronic dispersion and delocalization, densified calcium environments are characterized by a decreased average Ca–O distance, the formation of highly coordinated calcium, a broader distribution of topological variables, and a greater distortion of Ca polyhedra above megabars. The spectral features for the Ca environments reveal significant electronic and bonding modifications, including pressure-driven increases in the ligand field interaction, the covalence characteristic of the Ca–O bond, and the electron–hole Coulomb interaction. These densification paths identify the electronic adaptation of network modifiers above megabars, shedding light on the origins of enhanced electron transport and the electron-storing capacity of glasses under pressure.

amorphous materials

Feature learning and generalization in deep networks with orthogonal weights

Fully-connected deep neural networks with weights initialized from independent Gaussian distributions can be tuned to criticality, which prevents the exponential growth or decay of signals propagating through the network. However, such networks still exhibit fluctuations that grow linearly with the depth of the network, which may impair the training of networks with width comparable to depth. We show analytically that rectangular networks with tanh activations and weights initialized from the ensemble of orthogonal matrices have corresponding preactivation fluctuations which are independent of depth, to leading order in inverse width. Moreover, we demonstrate numerically that, at initialization, all correlators involving the neural tangent kernel (NTK) and its descendants at leading order in inverse width—which govern the evolution of observables during training—saturate at a depth of ~20, rather than growing without bound as in the case of Gaussian initializations. We speculate that this structure preserves finite-width feature learning while reducing overall noise, thus improving both generalization and training speed in deep networks with depth comparable to width. We provide some experimental justification by relating empirical measurements of the NTK to the superior performance of deep non-linear orthogonal networks trained under full-batch gradient descent on the MNIST and CIFAR-10 classification tasks.

97 MATHEMATICS AND COMPUTING

A Review of Software for Designing and Operating Quantum Networks

Quantum networks development is crucial to realizing a production-grade network that can support distributed sensing, secure communication, and utility-scale quantum computation. However, the transition from laboratory demonstration to deployable networks requires software implementations of architectures and protocols tailored to the unique constraints of quantum systems. This paper reviews the current state of software implementations for quantum networks, organized around a three-plane abstraction of infrastructure, logical, and control/service planes. We cover software for both designing quantum network protocols (e.g., SeQUeNCe, QuISP, and NetSquid) and operating testbeds, with a focus on essential control/service plane functions such as entanglement, topology, and resource management, in a proposed taxonomy. Our review highlights a persistent gap between theoretical architecture and protocol proposals and their realization in simulators or testbeds, particularly in dynamic topology and network management. We conclude by outlining open challenges and proposing a roadmap for developing scalable software architectures to enable hybrid, large-scale quantum networks.

Network Design

Belowground cross-trophic networks impact CH4 and CO2 emissions in degraded alpine peatlands

Belowground organisms forming complex cross-trophic ecological networks are essential for maintaining peatland carbon stability and energy flow. However, how peatland degradation affects the biodiversity and cross-trophic ecological networks of soil communities remains poorly understood. Here, we examined the degradation effects on soil prokaryotes (i.e., bacteria, archaea), fungi and nematodes in alpine peatlands on the eastern Tibetan Plateau, characterized by varying water table depths (indicating degradation levels). We found that peatland degradation, accompanied by significant shifts in soil moisture and pH (P < 0.05), reduced the taxonomic richness and phylogenetic diversity of prokaryotes, fungi, and nematodes, particularly in deeper soil layers (20–50 cm). Crucially, peatland degradation weakened potential cross-trophic interactions within bipartite networks of prokaryotes-nematodes and fungi-nematodes, resulting in less than 6.5 %–28.8 % of unchanged modules. Degradation-induced changes in soil moisture and pH were identified as primary drivers of biodiversity loss and network restructuring. Furthermore, such changes of belowground cross-trophic networks (particularly prokaryote-nematode) were significantly correlated with greenhouse gas emissions, such as decreased CO2 emissions, maintained CH4 emissions (leading to a higher CH4/CO2 ratio in deep layers), and reduced temperature sensitivity (Q10) of soil respiration. These findings underscore the critical need to protect soil biodiversity and cross-trophic networks in peatlands, particularly under the threat of climate change, to preserve peatland carbon stocks and maintain ecosystem stability. Our findings highlight that belowground cross-trophic networks are pivotal to decipher soil carbon dynamics of degraded peatlands and project the fate of peatland carbon stocks under future climate change scenarios.

Cross-trophic networks

Topology-Informed Design Rules for Deconstructable Thermoset Copolymer Networks

Existing models of thermoset deconstruction facilitated by incorporating cleavable comonomers rely on a mean-field reverse gel point paradigm, which predicts network dissolution once cleavable bonds reach a critical stoichiometric threshold, but does not account for where those bonds reside within the network architecture. Using reactive coarse-grained molecular dynamics simulations coupled with graph-theoretic analysis, we extend this stoichiometric picture to show that deconstructability is governed by the curing-imprinted network topology rather than stoichiometry alone. This topological organization is hierarchical: at the local scale, the elastic effectiveness of cross-link junctions determines which cross-links constitute the load-bearing scaffold; at the mesoscale, the cross-linking rate kinetically templates that scaffold into topologically modular communities─densely cross-linked clusters connected by sparse bridging strands that sustain network connectivity. Using betweenness centrality to identify nodes that disproportionately lie on intercommunity shortest paths, we demonstrate that effective deconstruction of the network into macromolecular fragments requires cleavable comonomers to intercept these high-centrality bridging strands. We further find that under uniform, disassortative comonomer incorporation, this topological requirement provides a mechanistic basis for extending the reverse gel point to incorporate network topology. We also show that modularity imposes a fundamental limit on fragment uniformity that persists even when the centrality requirement is met. Finally, we demonstrate that chain stiffness provides a nearly independent lever to suppress mechanically redundant cross-links and raise the glass transition temperature without significantly altering the deconstruction outcome. Together, these findings reframe the thermoset design space around network topology and provide actionable guidelines for engineering thermoset copolymers with predictable deconstructability and targeted thermomechanical performance.

coarse-grained molecular dynamics

Assessing heat resilience coordination in networks of plans

Networks of plans coordinating on hazard mitigation can limit losses. We offer a novel network analysis methodology to investigate how networks of plans explicitly coordinate, and the purpose and nature of coordination. We illustrate the method using networks of plans shaping heat resilience in seven Arizona cities. The network analysis can help planners to identify influential plans that need to be high quality, peripheral plans, and potential governance silos. Furthermore, investigation into plan roles offers an ontological lens into how plans network, consult, and share information. The nature of coordination varies by purpose. General plans are cited for goals, while hazard mitigation plans are referenced for heat fact base. Transportation plans cite goals and fact base in other transportation plans, but rarely cite other plan types. Furthermore, these findings will help planners to consider the roles and merits of different plans while integrating hazards across the next generation of networks of plans.

coordination

Microscopic Imprints of Learned Solutions in Tunable Networks

In physical networks trained using supervised learning, physical parameters are adjusted to produce desired responses to inputs. An example is an electrical contrastive local learning network of nodes connected by edges that adjust their conductances during training. When an edge conductance changes, it upsets the current balance of every node. In response, physics adjusts the node voltages to minimize the dissipated power. Learning in these systems is therefore a coupled double-optimization process, in which the network descends both a cost landscape in the high-dimensional space of edge conductances and a physical landscape—the power dissipation—in the high-dimensional space of node voltages. Because of this coupling, the physical landscape of a trained network contains information about the learned task. Here, we derive a structure-function relation for trained tunable networks and demonstrate that all the physical information relevant to the trained input-output relation can be captured by a tuning susceptibility, an experimentally measurable quantity. We supplement our theoretical results with simulations to show that the tuning susceptibility is correlated with functional importance and that we can extract physical insight into how the system performs the task from the conductances of highly susceptible edges. Our analysis is general and can be applied directly to mechanical networks, such as networks trained for protein-inspired function such as allostery.

36 MATERIALS SCIENCE

Link Scheduling in Satellite Networks via Machine Learning Over Riemannian Manifolds

Low Earth Orbit (LEO) satellites play a crucial role in enhancing global connectivity, serving a complementary solution to existing terrestrial systems. In wireless networks, scheduling is a vital process that allocates time-frequency resources to users for interference management. However, LEO satellite networks face significant challenges in scheduling their links towards ground users due to the satellites’ mobility and overlapping coverage. This paper addresses the dynamic link scheduling problem in LEO satellite networks by considering spatio-temporal correlations introduced by the satellites’ movements. The first step in the proposed solution involves modeling the network over Riemannian manifolds, thanks to their representation as symmetric positive definite matrices. We introduce two machine learning (ML)-based link scheduling techniques that model the dynamic evolution of satellite positions and link conditions over time and space. To accurately predict satellite link states, we present a recurrent neural network (RNN) over Riemannian manifolds, which captures spatio-temporal characteristics over time. Furthermore, we introduce a separate model, the convolutional neural network (CNN) over Riemannian manifolds, which captures geometric relationships between satellites and users by extracting spatial features from the network topology across all links. Simulation results demonstrate that both RNN and CNN over Riemannian manifolds deliver comparable performance to the fractional programming-based link scheduling (FPLinQ) benchmark. Remarkably, unlike other ML-based models that require extensive training data, both models only need 30 training samples to achieve over 99% of the sum rate while maintaining similar computational complexity relative to the benchmark.

42 ENGINEERING

Recyclability of reversible polymer networks over a Dozen reprocessing cycles

Reversible polymer networks capable of reversible reactions along their backbone provide a promising strategy for addressing waste management challenges associated with conventional thermoset products. However, reversible polymer networks cannot be recycled infinitely. Unavoidable side reactions eventually cause significant degradation of mechanical properties or loss of recyclability. This study aims to answer a simple yet critical question on reversible polymer network systems: how many reprocessing cycles can be achieved before profound mechanical degradation or a loss of recyclability? The recyclability of Diels–Alder (DA) network samples was evaluated by repeating consistent reprocessing cycles until they were no longer reprocessable. To enhance their recyclability, the chemical structure of the maleimide precursor was tailored to mitigating side reactions by maleimide homopolymerization. Remarkably, by employing a maleimide precursor with alkyl substitutions on its phenyl group, the DA network system attained 12 reprocessing cycles using injection molding at 160 °C without significant degradation of mechanical properties. However, the 13th reprocessing cycle did not succeed. Rheological analysis revealed the accumulation of non-reversible bonds within the network structure during repeated reprocessing, despite fairly consistent mechanical properties under operating conditions. This study demonstrates that the rational design of the maleimide precursor is an effective means to enhance the reprocessability of DA networks.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH

Adaptive continuity-preserving simplification of street networks

Street network data is widely used to study human-based activities and urban structure. Often, these data are geared towards transportation applications, which require highly granular, directed graphs that capture the complex relationships of potential traffic patterns. While this level of network detail is critical for certain fine-grained mobility models, it represents a hindrance for studies concerned with the morphology of the street network. For the latter case, street network simplification — the process of converting a highly granular input network into its most simple morphological form — is a necessary, but highly tedious preprocessing step, especially when conducted manually. In this manuscript, we develop and present a novel adaptive algorithm for simplifying street networks that is both fully automated and able to mimic results obtained through a manual simplification routine. The algorithm — available in the neatnet Python package — outperforms current state-of-the-art procedures when comparing those methods to manually, human-simplified data, while preserving network continuity.

Python

Network analysis of memristive device circuits: dynamics, stability and correlations

Abstract Networks with memristive devices are a potential basis for the next generation of computing devices. They are also an important model system for basic science, from modeling nanoscale conductivity to providing insight into the information-processing of neurons. The resistance in a memristive device depends on the history of the applied bias and thus displays a type of memory. The interplay of this memory with the dynamic properties of the network can give rise to new behavior, offering many fascinating theoretical challenges. But methods to analyze general memristive circuits are not well described in the literature. In this paper we develop a general circuit analysis for networks that combine memristive devices alongside resistors, capacitors and inductors and under various types of control. We derive equations of motion for the memory parameters of these circuits and describe the conditions for which a network should display properties characteristic of a resonator system. For the case of a purely memresistive network, we derive Lyapunov functions, which can be used to study the stability of the network dynamics. Surprisingly, analysis of the Lyapunov functions show that these circuits do not always have a stable equilibrium in the case of nonlinear resistance and window functions. The Lyapunov function allows us to study circuit invariances, wherein different circuits give rise to similar equations of motion, which manifest through a gauge freedom and node permutations. Finally, we identify the relation between the graph Laplacian and the operators governing the dynamics of memristor networks operators, and we use these tools to study the correlations between distant memristive devices through the effective resistance.

97 MATHEMATICS AND COMPUTING

Neuralized fermionic tensor networks for quantum many-body systems

In this work, we describe a class of neuralized fermionic tensor network states (NN-fTNSs) that introduce nonlinearity into fermionic tensor networks through configuration-dependent neural network transformations of the local tensors. The construction uses the fTNS algebra to implement a natural fermionic sign structure and is compatible with standard tensor network algorithms but gains enhanced expressivity through the neural network parametrization. Using the 1D and 2D Fermi-Hubbard models as benchmarks, we demonstrate that NN-fTNSs achieve order of magnitude improvements in the ground-state energy compared to pure fTNSs with the same bond dimension and can be systematically improved through both the tensor network bond dimension and the neural network parametrization. Compared to existing fermionic neural quantum states based on Slater determinants and Pfaffians, NN-fTNSs offer a physically motivated alternative fermionic structure. Furthermore, compared to such states, NN-fTNSs naturally exhibit improved computational scaling and we demonstrate a construction that achieves linear scaling with the lattice size.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND

Animal movement estimation and network-based epidemic modeling: Illustration for the swine industry in Iowa (US)

Animal movement plays a critical role in disease transmission between farms. However, in the United States, the lack of available animal shipment data, sometimes coupled with a lack of detailed information about farm demographics and characteristics, presents great challenges for epidemic modeling and prediction. In this study, we proposed a new method based on the maximum entropy to generate “synthetic” animal movement networks, considering available statistics about the premises operation type, operation size, and the distance between premises. We illustrated our method for the swine movement networks in Iowa and performed network analyses to gain insights into the swine industry. We then applied the generated networks to a network-based epidemic model to identify potential system vulnerabilities in terms of disease transmission. The model was parameterized for African Swine Fever (ASF) as the US swine industry is quite concerned about this disease. Results show that premises with a central role in the network are more vulnerable to disease outbreaks and play an important role in disease spread. Simulations with outbreaks starting from random farms reveal no significant large outbreaks, indicating the system’s relative robustness against arbitrary disease introductions. However, outbreaks originating from high out-degree farms can lead to large epidemic sizes. This underscores the importance for stakeholders and policymakers to continue improving animal movement records and traceability programs in the US and the value of making that data available to epidemiologists and modelers to better understand risk and inform strategies aimed to cost-effectively prevent and control disease transmission. Our approach could be easily adapted to estimate movement networks in other animal production systems and to inform disease spread models for various infectious diseases.

60 APPLIED LIFE SCIENCES

Learning the factors controlling mineral dissolution in three-dimensional fracture networks: applications in geologic carbon sequestration

We perform a set of high-fidelity simulations of geochemical reactions within three-dimensional discrete fracture networks (DFN) and use various machine learning techniques to determine the primary factors controlling mineral dissolution. The DFN are partially filled with quartz that gradually dissolves until quasi-steady state conditions are reached. At this point, we measure the quartz remaining in each fracture within the domain as our primary quantity of interest. We observe that a primary sub-network of fractures exists, where the quartz has been fully dissolved out. This reduction in resistance to flow leads to increased flow channelization and reduced solute travel times. However, depending on the DFN topology and the rate of dissolution, we observe substantial variability in the volume of quartz remaining within fractures outside of the primary subnetwork. This variability indicates an interplay between the fracture network structure and geochemical reactions. We characterize the features controlling these processes by developing a machine learning framework to extract their relevant impact. Specifically, we use a combination of high-fidelity simulations with a graph-based approach to study geochemical reactive transport in a complex fracture network to determine the key features that control dissolution. We consider topological, geometric and hydrological features of the fracture network to predict the remaining quartz in quasi-steady state. We found that the dissolution reaction rate constant of quartz and the distance to the primary sub-network in the fracture network are the two most important features controlling the amount of quartz remaining. This study is a first step towards characterizing the parameters that control carbon mineralization using an approach with integrates computational physics and machine learning.

54 ENVIRONMENTAL SCIENCES