Engineering PapersSearch

SEARCH · Engineering Papers

Results for “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 91 records · Page 5

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

GAINN: The Galaxy Assembly and Interaction Neural Networks for High-redshift JWST Observations

We present the Galaxy Assembly and Interaction Neural Networks (Gainn), a series of artificial neural networks for predicting the redshift, stellar mass, halo mass, and mass-weighted age of simulated galaxies based on James Webb Space Telescope (JWST) photometry. Our goal is to determine the best neural network for predicting these variables at 11 < z < 15. The parameters of the optimal neural network can then be used to estimate these variables for real, observed galaxies. The inputs of the neural networks are JWST filter magnitudes of a subset of five broadband filters (F150W, F200W, F277W, F356W, and F444W) and two medium-band filters (F162M and F182M). We compare the performance of the neural networks using different combinations of these filters, as well as different activation functions and numbers of layers. The best neural network predicted redshift with a normalized rms error of $0.010^{+0.003}_{-0.001}$, stellar mass with rms = $0.089^{+0.044}_{-0.022}$, halo mass with a mean-squared error of $0.022^{+0.014}_{-0.008}$, and mass-weighted age with rms = $12.466^{+5.065}_{-2.408}$. We also test the performance of Gainn on real data from MACS0647JD, an object observed by JWST. Predictions from Gainn for the first projection of the object (JD1) have normalized bias $\langle$Δz$\rangle$ < 0.00228, which is significantly smaller than found with template-fitting methods. We find that the optimal filter combination is F277W, F356W, F162M, and F200W when considering both theoretical accuracy and observational resources from JWST.

97 MATHEMATICS AND COMPUTING

Input specific neural networks

Neural networks have emerged as powerful tools for mapping between inputs and outputs. However, their black-box nature limits the ability to encode or impose specific structural relationships between inputs and outputs. Many scientific and engineering problems, such as constitutive modeling in solid mechanics, require networks that can enforce convexity, monotonicity, or other structural constraints to ensure physical consistency. Here, we introduce the Input Specific Neural Network (ISNN), a new architecture that enables multiple, distinct constraints to be imposed on different input subsets for scalar-valued outputs. This framework unifies convex, monotone–convex, monotone, and arbitrary mappings within a single network for the first time. Two ISNN architectures with analytical first- and second-order derivatives are developed. We demonstrate the performance on synthetic toy problems, inverse problems in isotropic hyperelasticity, and finite element simulations. ISNNs achieve improved extrapolation behavior, require fewer invariant inputs than standard input convex networks for polyconvex potentials, and enable significant computational savings via manual differentiation. We also show how ISNNs can be used to learn structural relationships between inputs and outputs via a binary gating mechanism. Particularly, ISNNs are employed to model a homogenized anisotropic free energy potential in a decoupled multiscale setting. The network learns whether or not the potential should be modeled as polyconvex and retains only the relevant layers while using the minimum number of inputs. ISNNs provide a flexible foundation for embedding structural priors into neural networks, enhancing both interpretability and stability. They are broadly applicable across computational mechanics and other scientific domains requiring constrained functional relationships.

Jadoon, Asghar A. [Univ. of Texas, Austin, TX (Uni

Data-Efficient Strategies for Probabilistic Voltage Envelopes under Network Contingencies

This work presents an efficient data-driven method to construct probabilistic voltage envelopes (PVE) using power flow learning in grids with network contingencies. First, a network-aware Gaussian process (GP) termed Vertex-Degree Kernel (VDK-GP), developed in prior work, is used to estimate voltage–power functions for a few network configurations. The paper introduces a novel multi-task vertex degree kernel (MT-VDK) that amalgamates the learned VDK-GPs to determine power flows for unseen networks, with a significant reduction in the computational complexity and hyperparameter requirements compared to alternate approaches. Simulations on the IEEE 30-Bus network demonstrate the retention and transfer of power flow knowledge in both N-1 and N-2 contingency scenarios. The MT-VDK-GP approach achieves over 50 % reduction in mean prediction error for novel N-1 contingency network configurations in low training data regimes (50–250 samples) over VDK-GP. Additionally, MT-VDK-GP outperforms a hyper-parameter based transfer learning approach in over 75 % of N-2 contingency network structures, even without historical N-2 outage data. Furthermore, the proposed method demonstrates the ability to achieve PVEs using sixteen times fewer power flow solutions compared to Monte-Carlo sampling-based methods.

24 POWER TRANSMISSION AND DISTRIBUTION

Synergistic Combination of Living Ring-Opening Metathesis Polymerization and Atom Transfer Radical Polymerization to Synthesize Structurally Tailored and Engineered Macromolecular Networks

Structurally tailored and engineered macromolecular (STEM) networks are attractive materials for soft robotics, stretchable electronics, tissue engineering, and 3D printing due to their tunable properties. To date, STEM networks have been synthesized by atom transfer radical polymerization (ATRP) or the combination of reversible addition–fragmentation chain-transfer (RAFT) polymerization and ATRP. RAFT polymerization could have limited selectivity with ATRP inimer sites that can participate in radical-transfer processes. On the other hand, living ring-opening metathesis polymerization (ROMP) can produce a polymeric network with latent ATRP initiator sites in high selectivity. Herein, for the first time, we report the syntheses of STEM zero-generation (STEM-0) networks using a monomer, a cross-linker, and an ATRP/ROMP inimer via living ROMP, followed by their modification using a second monomer via ATRP to synthesize STEM first-generation (STEM-1) networks. The mechanical property and swelling capacity analyses of these networks were carried out. A change in mechanical properties and swelling capacity of these networks was observed due to their structural modification.

Absorption

Structural and Dynamical Insights into the Formation Process of a Cross-Linked Polymer Network in Acrylic Adhesives During Thermal Curing

Many modern adhesives, sealants, and coatings rely on the controlled transition from a liquid to a solid state by forming a three-dimensional cross-linked polymer network, often referred to as curing. The curing process, which is initiated by the mixing of reactive components or an external trigger, defines the structure of a network and further controls the final mechanical properties of cured materials. However, the curing mechanism is not fully understood yet due to the lack of experimental tools capable of directly probing the structure and dynamics of a network over relevant time- and length scales. Here, in this paper, we report the curing process of a commercial two-component methyl methacrylate (MMA) adhesive using in operando X-ray photon correlation spectroscopy (XPCS), a method that closely simulates the target manufacturing environment of the adhesive. The results are then integrated with those obtained by rheology, differential scanning calorimetry (DSC), and transmission electron microscopy to establish the structure–dynamics–process–property relationship. The XPCS results identify four distinct stages in the curing process after the mixing, extrusion, and deposition of the acrylic adhesive: (i) At a cure time (or “aging time”, t age ) of less than 1 min, nanodomains of polymerized MMA are formed within a liquid monomeric MMA matrix. The average size is several nm and remains constant over t age , while the dynamics of the nanodomains are slowed down with t age due to an increase in the viscosity of the MMA matrix. (ii) After t age > 1 min, the size of the nanodomains increases with t age until the gel point (= 6.3 min after mixing as determined by rheology). The dynamics of the nanodomains also increase due to the heat generated by the exothermic reaction. (iii) At the gel point, the nanodomains begin to interconnect each other, resulting in a network structure with a characteristic length of about 100 nm. This characteristic network size does not change for the rest of the curing process up to t age = 500 min. The dynamics of the network structure, however, show a rapid slowing down with t age up to t age ≈ 12 min, corresponding to the onset of vitrification (as determined by rheology). (iv) At t age > 12 min, when the DSC and rheology data can no longer provide meaningful information, the XPCS data show a further slowing down of the network dynamics associated with vitrification. Our results provide rich and complex insights into the physics and material design of thermosets in commercially relevant processes, which are essential for future industrial applications.

36 MATERIALS SCIENCE

Cooperative effect of local active stresses on the macroscopic contractility of elastic fiber networks

The collective action of actively contractile units embedded in elastic biopolymer networks plays a crucial role in regulating the network's macroscopic mechanical response. Here, in this study, we investigate how the macroscopic boundary stress in model elastic fiber networks depends on the number and nature of embedded contractile units, each exerting an isotropic force dipole, as well as on the bending stiffness of fibers. We find that the macroscopic stress increases nonlinearly with the number of dipoles due to mutual stiffening of initially soft, bending-dominated networks. Using effective medium theory, we relate this enhanced contractility to an increase in the effective average network coordination number due to constraints imposed by the force dipoles. By comparing three distinct force dipole models that differ in their local structures, we demonstrate that the specific manner in which an active unit constrains the network strongly influences the onset and nature of the stiffening transition. Our results highlight that not only the quantity but also the local geometry of force-generating units critically determines the macroscopic mechanical behavior. This framework provides a physical basis for understanding how biological systems—such as molecular motors in the cytoskeleton, or adherent cells in the extracellular matrix—can modulate network-scale nonlinear elastic properties through local tuning of active force-generating units.

Biological and medical sciences