Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “networking”

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 847 records · Page 47

Long‐range quantum energy teleportation and distribution on a hyperbolic quantum network

Abstract Teleporting energy to remote locations is new challenge for quantum information science and technology. Developing a method for transferring local energy in laboratory systems to remote locations will enable non‐trivial energy flows in quantum networks. From the perspective of quantum information engineering, we propose a method for distributing local energy to a large number of remote nodes using hyperbolic geometry. Hyperbolic networks are suitable for energy allocation in large quantum networks since the number of nodes grows exponentially. To realise long‐range quantum energy teleportation (QET), we propose a hybrid method of quantum state telepotation and QET. By transmitting local quantum information through quantum teleportation and performing conditional operations on that information, QET can theoretically be realized independent of geographical distance. The method we present will provide new insights into new applications of future large‐scale quantum networks and potential applications of quantum physics to information engineering.

Ikeda, Kazuki↗

Evaluating Supply Prioritization Strategies for Risk-Informed Decision Making in an Arbitrary Gas Network

Supply disruptions and infrastructure failures in natural gas networks present critical challenges to energy reliability and risk-informed planning. This study evaluates two supply prioritization strategies, Maximum Delivery Prioritization (MDP) and Demand-Based Prioritization (DBP), within an arbitrary natural gas network under conditions of supply shortage. Model performance under both strategies is assessed in response to node and edge failure using demand satisfaction metrics, system-wide and localized dependency scores, and geographic information system (GIS)-based spatial analysis. Results show that DBP better preserves supply for high-demand nodes, while MDP offers broader coverage. The underlying network topology plays a critical role in shaping prioritization outcomes. Integrated GIS visualization enhances the interpretability of vulnerability assessments, revealing structurally critical components and localized vulnerabilities. The proposed framework supports scalable, data-driven decision-making for infrastructure planners and engineers, enabling improved disruption recovery and efficiency in constrained natural gas networks. These insights contribute to the development of more robust energy systems capable of withstanding stress and disruptions.

Peterson, Steven [ORNL] (ORCID:0000000287672998)↗

Mapping Critical Vulnerabilities in Natural Gas Pipeline Systems through Network Centrality and GIS Analytics

Natural gas plays a central role in the US energy landscape, providing 43% of electricity generation in 2023. Its exclusive recovery ability on pipelines for transmission underscores the importance of understanding the disruption recovery ability of this infrastructure. This study employs a network-based analytical framework integrating geographic information systems (GIS) with multiple centrality measures—betweenness, closeness, degree, and eigenvector—to pinpoint key segments and evaluate the structural robustness of the national pipeline network. Pipelines are grouped by System ID and Operator ID to capture variations across organizational and physical structures. The analysis reveals uneven patterns of network influence, where certain pipelines function as critical connectors or dominant hubs. Spatial mapping highlights geographic dependencies and potential chokepoints, offering a clear view of where targeted risk prevention measures would be most effective. The findings provide practical guidance for prioritizing maintenance, enhancing system robustness, and mitigating risks to ensure a stable and secure energy supply. Future research will expand the framework to incorporate dynamic operational data and real-time network behavior.

Peterson, Steven [ORNL] (ORCID:0000000287672998)↗

Transition of a network of nonlinear interactions into a regime of strong nonlinear fluctuations: A paradigm for the edge localized mode onset

We study how a network of nonlinear oscillators transits into a regime of strong nonlinear fluctuations when perturbed by a triad. In this regime, most of the potential energy contained in the waves is made available to the system through strong nonlinear fluctuations. This analysis is motivated by recent experimental observations [Dominski and Diallo, Plasma Phys. Control. Fusion 62, 095011 (2020)] where it was found that magnetic fluctuations trigger the onset of edge localized modes by suddenly exciting a network of nonlinear interactions. In our study, we consider the simplest system of many harmonic oscillators that are organized in a network of nonlinear triads. We model and simulate the sudden transition of this network of triads into a regime of strong nonlinear fluctuations—reminiscent of the onset of edge localized modes in tokamaks. This transition is triggered by the activation of a nonlinear perturbation. An abrupt rise of the system's disorder (an entropy-like quantity) is measured during the transition. This transition from weak to strong nonlinear fluctuations is even more abrupt when these fluctuations are chaotic, i.e., when the timescale of the nonlinear interaction is comparable to the timescale of the wave oscillations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Quantum networks based on color centers in diamond

With the ability to transfer and process quantum information, large-scale quantum networks will enable a suite of fundamentally new applications, from quantum communications to distributed sensing, metrology, and computing. This Perspective reviews requirements for quantum network nodes and color centers in diamond as suitable node candidates. We give a brief overview of state-of-the-art quantum network experiments employing color centers in diamond and discuss future research directions, focusing, in particular, on the control and coherence of qubits that distribute and store entangled states, and on efficient spin–photon interfaces. We discuss a route toward large-scale integrated devices combining color centers in diamond with other photonic materials and give an outlook toward realistic future quantum network protocol implementations and applications.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Simulation study of the effects of polymer network dynamics and mesh confinement on the diffusion and structural relaxation of penetrants

The diffusion of small molecular penetrants through polymeric materials represents an important fundamental problem, relevant to the design of materials for applications such as coatings and membranes. Polymer networks hold promise in these applications because dramatic differences in molecular diffusion can result from subtle changes in the network structure. In this paper, we use molecular simulation to understand the role that cross-linked network polymers have in governing the molecular motion of penetrants. By considering the local, activated alpha relaxation time of the penetrant and its long-time diffusive dynamics, we can determine the relative importance of activated glassy dynamics on penetrants at the segmental scale vs entropic mesh confinement on penetrant diffusion. We vary several parameters, such as the cross-linking density, temperature, and penetrant size, to show that cross-links primarily affect molecular diffusion through the modification of the matrix glass transition, with local penetrant hopping at least partially coupled to the segmental relaxation of the polymer network. This coupling is very sensitive to the local activated segmental dynamics of the surrounding matrix, and we also show that penetrant transport is affected by dynamic heterogeneity at low temperatures. To contrast, only at high temperatures and for large penetrants or when the dynamic heterogeneity effect is weak, does the effect of mesh confinement become significant, even though penetrant diffusion more broadly empirically follows similar trends as established models of mesh confinement-based transport.

Chemistry↗

Accelerating defect predictions in semiconductors using graph neural networks

First-principles computations reliably predict the energetics of point defects in semiconductors but are constrained by the expense of using large supercells and advanced levels of theory. Machine learning models trained on computational data, especially ones that sufficiently encode defect coordination environments, can be used to accelerate defect predictions. Here, we develop a framework for the prediction and screening of native defects and functional impurities in a chemical space of group IV, III–V, and II–VI zinc blende semiconductors, powered by crystal Graph-based Neural Networks (GNNs) trained on high-throughput density functional theory (DFT) data. Using an innovative approach of sampling partially optimized defect configurations from DFT calculations, we generate one of the largest computational defect datasets to date, containing many types of vacancies, self-interstitials, anti-site substitutions, impurity interstitials and substitutions, as well as some defect complexes. We applied three types of established GNN techniques, namely crystal graph convolutional neural network, materials graph network, and Atomistic Line Graph Neural Network (ALIGNN), to rigorously train models for predicting defect formation energy (DFE) in multiple charge states and chemical potential conditions. We find that ALIGNN yields the best DFE predictions with root mean square errors around 0.3 eV, which represents a prediction accuracy of 98% given the range of values within the dataset, improving significantly on the state-of-the-art. We further show that GNN-based defective structure optimization can take us close to DFT-optimized geometries at a fraction of the cost of full DFT. The current models are based on the semi-local generalized gradient approximation-Perdew–Burke–Ernzerhof (PBE) functional but are highly promising because of the correlation of computed energetics and defect levels with higher levels of theory and experimental data, the accuracy and necessity of discovering novel metastable and low energy defect structures at the PBE level of theory before advanced methods could be applied, and the ability to train multi-fidelity models in the future with new data from non-local functionals. The DFT-GNN models enable prediction and screening across thousands of hypothetical defects based on both unoptimized and partially optimized defective structures, helping identify electronically active defects in technologically important semiconductors.

Rahman, Md Habibur (ORCID:000000027705984X)↗

Analysis and mitigation of parasitic resistance effects for analog in-memory neural network acceleration

To support the increasing demands for efficient deep neural network processing, accelerators based on analog in-memory computation of matrix multiplication have recently gained significant attention for reducing the energy of neural network inference. However, analog processing within memory arrays must contend with the issue of parasitic voltage drops across the metal interconnects, which distort the results of the computation and limit the array size. This work analyzes how parasitic resistance affects the end-to-end inference accuracy of state-of-the-art convolutional neural networks, and comprehensively studies how various design decisions at the device, circuit, architecture, and algorithm levels affect the system's sensitivity to parasitic resistance effects. Here, a set of guidelines are provided for how to design analog accelerator hardware that is intrinsically robust to parasitic resistance, without any explicit compensation or re-training of the network parameters.

97 MATHEMATICS AND COMPUTING↗

Parametrizing the detector response with neural networks

In high energy physics, characterizing the response of a detector to radiation is one of the most important and fundamental experimental tasks. In many cases, this task is accomplished by parameterizing summary statistics of the full detector response probability density. The parameterized detector response can then be used for calibration as well as for directly improving physics analysis sensitivity. This paper reports on how to parameterize summary statistics of the detector response using neural networks. Specifically, neural networks are powerful tools for incorporating multidimensional data and the loss function used during training determines which summary statistic is learned. One common summary statistic that has not been combined with deep learning (as far as the authors are aware) is the mode. A neural network-based approach to mode learning is proposed and empirically demonstrated in the context of high energy jet calibrations. Altogether, the neural network-based toolkit for detector response parameterization can enhance the utility of data collected at high energy physics experiments and beyond.

47 OTHER INSTRUMENTATION↗

Approximating accelerator impedances with resonator networks

It is common in the accelerator community to use the impedance of accelerator components to describe wake interactions in the frequency domain. However, it is often desirable to understand such wake interactions in the time domain in a general manner for excitations that are not necessarily Gaussian in nature. Here, the conventional method for doing this involves taking the inverse Fourier Transform of the component impedance, obtaining the Green's Function, and then convolving it with the desired excitation distribution. This method can prove numerically cumbersome, for a convolution integral must be evaluated for each individual point in time when the wake function is desired. An alternative to this method would be to compute the wake function analytically, which would sidestep the need for repetitive integration. Only a handful of cases, however, are simple enough for this method to be tenable. One of these cases is the case where the component in question is an RLC resonator, which has a closed-form analytical wake function solution. This means that a component which can be represented in terms of resonators can leverage this solution. As it happens, common network synthesis techniques may be used to map arbitrary impedance profiles to RLC resonator networks in a manner the accelerator community has yet to take advantage of. In this work, we will use Foster Canonical Resonator Networks and partial derivative descent optimization to develop a technique for synthesizing resonator networks that well approximate the impedances of real-world accelerator components. We will link this synthesis to the closed-form resonator wake function solution, giving rise to a powerful workflow that may be used to streamline beam dynamics simulations.

43 PARTICLE ACCELERATORS↗

Information-incorporated gene network construction with FDR control

Abstract Motivation Large-scale gene expression studies allow gene network construction to uncover associations among genes. To study direct associations among genes, partial correlation-based networks are preferred over marginal correlations. However, FDR control for partial correlation-based network construction is not well-studied. In addition, currently available partial correlation-based methods cannot take existing biological knowledge to help network construction while controlling FDR. Results In this paper, we propose a method called Partial Correlation Graph with Information Incorporation (PCGII). PCGII estimates partial correlations between each pair of genes by regularized node-wise regression that can incorporate prior knowledge while controlling the effects of all other genes. It handles high-dimensional data where the number of genes can be much larger than the sample size and controls FDR at the same time. We compare PCGII with several existing approaches through extensive simulation studies and demonstrate that PCGII has better FDR control and higher power. We apply PCGII to a plant gene expression dataset where it recovers confirmed regulatory relationships and a hub node, as well as several direct associations that shed light on potential functional relationships in the system. We also introduce a method to supplement observed data with a pseudogene to apply PCGII when no prior information is available, which also allows checking FDR control and power for real data analysis. Availability and implementation R package is freely available for download at https://cran.r-project.org/package=PCGII.

59 BASIC BIOLOGICAL SCIENCES↗

Host and nonhost bacteria support bacteriophage dissemination along mycelia and abiotic dispersal networks

Abstract Bacteriophages play a crucial role in shaping bacterial communities, yet the mechanisms by which nonmotile bacteriophages interact with their hosts remain poorly understood. This knowledge gap is especially pronounced in structured environments like soil, where spatial constraints and air-filled zones hinder aqueous diffusion. In soil, hyphae of filamentous microorganisms form a network of ‘fungal highways’ (FHs) that facilitate the dispersal of other microorganisms. We propose that FHs also promote bacteriophage dissemination. Viral particles can diffuse in liquid films surrounding hyphae or be transported by infectable (host) or uninfectable (nonhost) bacterial carriers coexisting on FH networks. To test this, two bacteriophages that infect Pseudomonas putida DSM291 (host) but not KT2440 (nonhost) were used. In the absence of carriers, bacteriophages showed limited diffusion on 3D-printed abiotic networks, but diffusion was significantly improved in Pythium ultimum-formed FHs when the number of connecting hyphae exceeded 20. Transport by both host and nonhost carriers enhanced bacteriophage dissemination. Host carriers were five times more effective in transporting bacteriophages, particularly in FHs with over 30 connecting hyphae. This study enhances our understanding of bacteriophage dissemination in nonsaturated environments like soils, highlighting the importance of biotic networks and bacterial hosts in facilitating this process.

Périat, Claire (ORCID:000000020825625X)↗

Efficient DNA sequence compression with neural networks

Abstract Background The increasing production of genomic data has led to an intensified need for models that can cope efficiently with the lossless compression of DNA sequences. Important applications include long-term storage and compression-based data analysis. In the literature, only a few recent articles propose the use of neural networks for DNA sequence compression. However, they fall short when compared with specific DNA compression tools, such as GeCo2. This limitation is due to the absence of models specifically designed for DNA sequences. In this work, we combine the power of neural networks with specific DNA models. For this purpose, we created GeCo3, a new genomic sequence compressor that uses neural networks for mixing multiple context and substitution-tolerant context models. Findings We benchmark GeCo3 as a reference-free DNA compressor in 5 datasets, including a balanced and comprehensive dataset of DNA sequences, the Y-chromosome and human mitogenome, 2 compilations of archaeal and virus genomes, 4 whole genomes, and 2 collections of FASTQ data of a human virome and ancient DNA. GeCo3 achieves a solid improvement in compression over the previous version (GeCo2) of $2.4\%$, $7.1\%$, $6.1\%$, $5.8\%$, and $6.0\%$, respectively. To test its performance as a reference-based DNA compressor, we benchmark GeCo3 in 4 datasets constituted by the pairwise compression of the chromosomes of the genomes of several primates. GeCo3 improves the compression in $12.4\%$, $11.7\%$, $10.8\%$, and $10.1\%$ over the state of the art. The cost of this compression improvement is some additional computational time (1.7–3 times slower than GeCo2). The RAM use is constant, and the tool scales efficiently, independently of the sequence size. Overall, these values outperform the state of the art. Conclusions GeCo3 is a genomic sequence compressor with a neural network mixing approach that provides additional gains over top specific genomic compressors. The proposed mixing method is portable, requiring only the probabilities of the models as inputs, providing easy adaptation to other data compressors or compression-based data analysis tools. GeCo3 is released under GPLv3 and is available for free download at https://github.com/cobilab/geco3.

Silva, Milton↗

Recurrent convolutional neural networks for modeling nonadiabatic dynamics of quantum-classical systems

Recurrent neural networks (RNNs) have recently been extensively applied to model the time evolution in fluid dynamics, weather predictions, and even chaotic systems due to their ability to capture temporal dependencies and sequential patterns in data. Here we present an RNN model based on convolutional neural networks for modeling the nonlinear nonadiabatic dynamics of hybrid quantum-classical systems. The dynamical evolution of the hybrid systems is governed by equations of motion for classical degrees of freedom and von Neumann equation for electrons. The Physics-Aware Recurrent Convolution (PARC) neural network structure incorporates a differentiator-integrator architecture that inductively models the spatiotemporal dynamics of generic physical systems. Here, we apply our RNN approach to learn the space-time evolution of a one-dimensional semiclassical Holstein model after an interaction quench. For shallow quenches (small changes in electron-lattice coupling), the deterministic dynamics can be accurately captured using a single-CNN-based recurrent network. In contrast, deep quenches induce chaotic evolution, making long-term trajectory prediction significantly more challenging. Nonetheless, we demonstrate that the PARC-CNN architecture can effectively learn the statistical climate of the Holstein model under deep-quench conditions.

Holstein model↗

Exact block encoding of imaginary time evolution with universal quantum neural networks

We develop a constructive approach to generate quantum neural networks capable of representing the exact thermal states of all many-body qubit Hamiltonians. The Trotter expansion of the imaginary time propagator is implemented through an exact block encoding by means of a unitary, restricted Boltzmann machine architecture. Marginalization over the hidden-layer neurons (auxiliary qubits) creates the nonunitary action on the visible layer. Then, we introduce a unitary deep Boltzmann machine architecture in which the hidden-layer qubits are allowed to couple laterally to other hidden qubits. We prove that this wave-function is closed under the action of the imaginary time propagator and, more generally, can represent the action of a universal set of quantum gate operations. We provide analytic expressions for the coefficients for both architectures, thus enabling exact network representations of thermal states without stochastic optimization of the network parameters. In the limit of large imaginary time, the yields the ground state of the system. The number of qubits grows linearly with the number of interactions and total imaginary time for a fixed interaction order. Both networks can be readily implemented on quantum hardware via midcircuit measurements of auxiliary qubits. If only one auxiliary qubit is measured and reset, the circuit depth scales linearly with imaginary time and number of interactions, while the width is constant. Alternatively, one can employ a number of auxiliary qubits linearly proportional to the number of interactions, and circuit depth grows linearly with imaginary time only. Every midcircuit measurement has a postselection success probability, and the overall success probability is equal to the product of the probabilities of the midcircuit measurements.

97 MATHEMATICS AND COMPUTING↗

Inferring Quantum Network Topology Using Local Measurements

Statistical correlations that can be generated across the nodes in a quantum network depend crucially on its topology. However, this topological information might not be known a priori, or it may need to be verified. In this paper, we propose an efficient protocol for distinguishing and inferring the topology of a quantum network. We leverage entropic quantities-namely, the von Neumann entropy and the measured mutual information-as well as measurement covariance to uniquely characterize the topology. We show that the entropic quantities are sufficient to distinguish two networks that prepare GHZ states. Moreover, if qubit measurements are available, both entropic quantities and covariance can be used to infer the network topology without state-preparation assumptions. We show that the protocol can be entirely robust to noise and can be implemented via quantum variational optimization. Numerical experiments on both classical simulators and quantum hardware show that covariance is generally more reliable for accurately and efficiently inferring the topology, whereas entropy-based methods are often better at identifying the absence of entanglement in the low-shot regime.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Theory for Equivariant Quantum Neural Networks

Quantum neural network architectures that have little to no inductive biases are known to face trainability and generalization issues. Inspired by a similar problem, recent breakthroughs in machine learning address this challenge by creating models encoding the symmetries of the learning task. This is materialized through the usage of equivariant neural networks the action of which commutes with that of the symmetry. In this work, we import these ideas to the quantum realm by presenting a comprehensive theoretical framework to design equivariant quantum neural networks (EQNNs) for essentially any relevant symmetry group. We develop multiple methods to construct equivariant layers for EQNNs and analyze their advantages and drawbacks. Our methods can find unitary or general equivariant quantum channels efficiently even when the symmetry group is exponentially large or continuous. As a special implementation, we show how standard quantum convolutional neural networks (QCNNs) can be generalized to group-equivariant QCNNs where both the convolution and pooling layers are equivariant to the symmetry group. We then numerically demonstrate the effectiveness of a S U ( 2 ) -equivariant QCNN over symmetry-agnostic QCNN on a classification task of phases of matter in the bond-alternating Heisenberg model. Our framework can be readily applied to virtually all areas of quantum machine learning. Lastly, we discuss about how symmetry-informed models such as EQNNs provide hopes to alleviate central challenges such as barren plateaus, poor local minima, and sample complexity. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Wilson loops with neural networks

Wilson loops are essential objects in QCD and have been pivotal in scale setting and demonstrating confinement. Various generalizations are crucial for computations needed in effective field theories. In lattice gauge theory, Wilson loop calculations face challenges, including excited-state contamination at short times and the signal-to-noise ratio issue at longer times. To address these problems, we develop a new method by using neural networks to parametrize interpolators for the static quark-antiquark pair. We construct gauge-equivariant layers for the network and train it to find the ground state of the system. The trained network itself is then treated as our new observable for the inference. Our results demonstrate a significant improvement in the signal compared to traditional Wilson loops, performing as well as Coulomb-gauge Wilson-line correlators while maintaining gauge invariance. Additionally, we present an example where the optimized ground state is used to measure the static force directly, as well as another example combining this method with the multilevel algorithm. Finally, we extend the formalism to find excited-state interpolators for static quark-antiquark systems. To our knowledge, this work is the first study of neural networks with a physically motivated loss function for Wilson loops.

Bellscheidt, Verena [Massachusetts Inst. of Techno↗