Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Network convergence”

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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
NASA NTRS2011

Space Flight Middleware: Remote AMS over DTN for Delay-Tolerant Messaging

This paper describes a technique for implementing scalable, reliable, multi-source multipoint data distribution in space flight communications -- Delay-Tolerant Reliable Multicast (DTRM) -- that is fully supported by the "Remote AMS" (RAMS) protocol of the Asynchronous Message Service (AMS) proposed for standardization within the Consultative Committee for Space Data Systems (CCSDS). The DTRM architecture enables applications to easily "publish" messages that will be reliably and efficiently delivered to an arbitrary number of "subscribing" applications residing anywhere in the space network, whether in the same subnet or in a subnet on a remote planet or vehicle separated by many light minutes of interplanetary space. The architecture comprises multiple levels of protocol, each included for a specific purpose and allocated specific responsibilities: "application AMS" traffic performs end-system data introduction and delivery subject to access control; underlying "remote AMS" directs this application traffic to populations of recipients at remote locations in a multicast distribution tree, enabling the architecture to scale up to large networks; further underlying Delay-Tolerant Networking (DTN) Bundle Protocol (BP) advances RAMS protocol data units through the distribution tree using delay-tolerant storeand- forward methods; and further underlying reliable "convergence-layer" protocols ensure successful data transfer over each segment of the end-to-end route. The result is scalable, reliable, delay-tolerant multi-source multicast that is largely self-configuring.

Disruption Tolerant Networking (DTN)↗
DOE OSTI2022

Fluid – Fluid Interfacial Area and Its Impact on Relative Permeability - A Pore Network Modeling Study

Abstract Relative permeability (kr) is commonly modeled as an empirical function of phase saturation. Although current empirical models can provide a good match of one or two measured relative permeabilities using saturation alone, they are unable to predict relative permeabilities well when there is hysteresis or when physical properties such as wettability change. Further, current models often result in relative permeability discontinuities that can cause convergence and accuracy problems in simulation. To overcome these problems, recent research has modeled relative permeability as a state function of both saturation (S) and phase connectivity (X). Pore network modeling (PNM) data, however, shows small differences in relative permeability for the same S-X value when approached from a different flow direction. This paper examines the impact of one additional Minkowski parameter (Mecke and Arns, 2005), the fluid-fluid interfacial area, on relative permeability to identify if that satisfactorily explains this discrepancy. We calculate the total fluid-fluid interfacial areas (IA) during two-phase (oil/water) flow in porous media using pore network modeling. The area is calculated from PNM simulations using the areas associated with corners and throats in pore elements of different shapes. The pore network is modeled after a Bentheimer sandstone, using square, triangular, and circular pore shapes. Simulations were conducted for numerous primary drainage and imbibition cycles at a constant contact angle of 0° for the wetting phase. Simultaneous measurements of capillary pressure, relative permeability, saturation, and phase connectivity are made for each displacement. Fluid-fluid interfacial area is calculated from the PNM capillary pressure, the fluid location in the pore elements, and the pore element dimensional data. The results show that differences in the relative permeability at the same (S,X) point is explained well by differences in the fluid-fluid interfacial area (IA). That is, for a larger change in IA at these intersection points, the permeability difference is greater. That difference in relative permeability approaches zero as the difference in IA approaches zero. This confirms that relative permeability can be modeled better as a unique function of S, X, and IA. The results also show that an increase in IA restricts flow decreasing the nonwetting (oil) phase permeability. This decrease is caused by an increase in the throat area fraction compared to the corner area as the total area IA increases. The wetting phase relative permeability, however, shows the inverse trend, in that its relative permeability is greater when IA becomes larger owing to a greater fraction of the total area associated with the corners. The area IA, however, impacts the nonwetting phase relative permeability more than the wetting phase relative permeability. Corner flow improves the wetting phase relative permeability because the wetting phase is continuous there. Finally, a sensitivity analysis shows that relative permeability a is more sensitive to change in S than they are for IA for the case studied implying that if only two parameters are used to model relative permeability it is better to choose S and X.

Engineering↗
DOE OSTI2021

Characterizing Reactive Transport Behavior in a Three-Dimensional Discrete Fracture Network

While several studies have linked network and in-fracture scale properties to conservative transport behavior in subsurface fractured media, studies on reactive transport cases remain relatively underdeveloped. In this study, we explore the behavior of an irreversible kinetic reaction during the interaction of two solute plumes, one consisting of species A and the other species B. When the plumes converge, these species react kinetically to form a new species C via A+B→kC. This reactive system is studied using a three-dimensional discrete fracture network (DFN) model coupled with reactive Lagrangian particle tracking. We find that the interplay of network topology and chemical properties of the reactive solutes controls reactive transport processes. The network topology drives species A and B together, and the chemical properties dictate whether and how quickly a reaction occurs. Results demonstrate that reactions are most likely to occur in high-velocity fractures that make up the network backbone. The interplay between species’ chemical properties and transport is characterized by a non-dimensional Damköhler (Da) number. We show that the spatial distribution of reactions is sensitive to Da, which subsequently influences late-time tailing behavior in outlet breakthrough time distributions. The results of this study provide initial insights into how an irreversible reaction occurs during transport in a fracture network, using a methodology that can be applied to study reactive transport in a wide range of fractured media environments and contexts.

58 GEOSCIENCES↗
NASA NTRS2023

High-Rate Delay Tolerant Networking (HDTN) User Guide Version 1.0

Delay Tolerant Networking (DTN) has been identified as a key technology to enable and facilitate the development and growth of future space networks. Classically, space communications networks are collections of disparate links that are manually managed either point-to-point or use space relays. The accelerating accessibility of space enables a new scaling of space nodes, yet both the manual management of configurations and scheduling and the lack of structure connecting links precisely prohibit scaling. This challenge gives rise to newer and larger classes of communications needs that are met by DTN, which must overcome the disconnection, disruption, latency, and mobility featured in space communications systems. DTN joins the underlying links as an overlay, and can be made to communicate over any protocol stack. The core actions of DTN are store, carry, and forward, where data are stored instead of dropped if there is no immediately available outduct. It does this by taking the DTN unit of data, bundles, and providing necessary layers to adapt these bundles to the underlying transport protocols of choice; these are called convergence layers. DTN's Bundle Protocol (BP) can then be used on top of terrestrial protocol stacks, such as TCP/IP, as well as protocols for space, such as LTP/AOS, all in the same network. For emphasis it is noted that bundles can be of essentially any size, and hence this convergence to lower layers of choice is necessary. Existing DTN implementations have operated in constrained environments with limited resources, resulting in low data speeds. However, as various technologies have advanced, data transfer rates and efficiency have advanced, which has pushed the need for a DTN implementation for ground systems and for spacecraft that is performance-oriented in order to not impose an unnecessary bottleneck. High-rate Delay Tolerant Networking (HDTN) takes advantage of modern hardware platforms to substantially reduce latency and improve throughput compared to today’s DTN operations. The HDTN implementation maintains interoperability with existing deployments of DTN that conform to IETF RFCs 4838, 5050, and 9171. At the same time, HDTN defines a new data format better suited to higher-rate operation. It defines and adopts a massively parallel pipelined and message-oriented architecture, allowing the system to scale gracefully as its resources increase. HDTN’s architecture also supports hooks to replace various processing pipeline elements with specialized hardware accelerators. This offers improved Size, Weight, and Power (SWaP) characteristics while reducing development complexity and cost.

Delay Tolerant Networking↗
NASA NTRS2024

High-Rate Delay Tolerant Networking (HDTN) User Guide Version 1.3.0

Delay Tolerant Networking (DTN) has been identified as a key technology to enable and facilitate the development and growth of future space networks. Classically, space communications networks are collections of disparate links that are manually managed either point-to-point or use space relays. The accelerating accessibility of space enables a new scaling of space nodes, yet both the manual management of configurations and scheduling and the lack of structure connecting links precisely prohibit scaling. This challenge gives rise to newer and larger classes of communications needs that are met by DTN, which must overcome the disconnection, disruption, latency, and mobility featured in space communications systems. DTN joins the underlying links as an overlay, and can be made to communicate over any protocol stack. The core actions of DTN are store, carry, and forward, where data are stored instead of dropped if there is no immediately available outduct. It does this by taking the DTN unit of data, bundles, and providing necessary layers to adapt these bundles to the underlying transport protocols of choice; these are called convergence layers. DTN's Bundle Protocol (BP) can then be used on top of terrestrial protocol stacks, such as TCP/IP, as well as protocols for space, such as LTP/AOS, all in the same network. For emphasis it is noted that bundles can be of essentially any size, and hence this convergence to lower layers of choice is necessary. Existing DTN implementations have operated in constrained environments with limited resources, resulting in low data speeds. However, as various technologies have advanced, data transfer rates and efficiency have advanced, which has pushed the need for a DTN implementation for ground systems and for spacecraft that is performance-oriented in order to not impose an unnecessary bottleneck. High-rate Delay Tolerant Networking (HDTN) takes advantage of modern hardware platforms to substantially reduce latency and improve throughput compared to today’s DTN operations. The HDTN implementation maintains interoperability with existing deployments of DTN that conform to IETF RFCs 4838, 5050, and 9171. At the same time, HDTN defines a new data format better suited to higher-rate operation. It defines and adopts a massively parallel pipelined and message-oriented architecture, allowing the system to scale gracefully as its resources increase. HDTN’s architecture also supports hooks to replace various processing pipeline elements with specialized hardware accelerators. This offers improved Size, Weight, and Power (SWaP) characteristics while reducing development complexity and cost.

Delay Tolerant Networking↗
DOE OSTI2023

Optimal Power Flow With State Estimation in the Loop for Distribution Networks

Here in this article, we propose a framework for running optimal control-estimation synthesis in distribution networks. Our approach combines a primal-dual gradient-based optimal power flow solver with a state estimation feedback loop based on a limited set of sensors for system monitoring, instead of assuming exact knowledge of all states. The estimation algorithm reduces uncertainty on unmeasured grid states based on certain online state measurements and noisy "pseudomeasurements." We analyze the convergence of the proposed algorithm and quantify the statistical estimation errors based on a weighted least-squares estimator. The numerical results on a 4521-node network demonstrate that this approach can scale to extremely large networks and provide robustness to both large pseudomeasurement variability and inherent sensor measurement noise.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Network-Level Optimization for Unbalanced Power Distribution System: Approximation and Relaxation

The nonlinear programming (NLP) problem to solve distribution-level optimal power flow (D-OPF) poses convergence issues and does not scale well for unbalanced distribution systems. The existing scalable D-OPF algorithms either use approximations that are not valid for an unbalanced power distribution system, or apply relaxation techniques to the nonlinear power flow equations that do not guarantee a feasible power flow solution. In this paper, we propose scalable D-OPF algorithms that simultaneously achieve optimal and feasible solutions by solving multiple iterations of approximate, or relaxed, D-OPF subproblems of low complexity. The first algorithm is based on a successive linear approximation of the nonlinear power flow equations around the current operating point, where the D-OPF solution is obtained by solving multiple iterations of a linear programming (LP) problem. The second algorithm is based on the relaxation of the nonlinear power flow equations as conic constraints together with directional constraints, which achieves optimal and feasible solutions over multiple iterations of a second-order cone programming (SOCP) problem. Finally, it is demonstrated that the proposed algorithms are able to reach an optimal and feasible solution while significantly reducing the computation time as compared to an equivalent NLPD-OPF model for the same distribution system.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

In situ Parallel Training of Analog Neural Network Using Electrochemical Random-Access Memory

In-memory computing based on non-volatile resistive memory can significantly improve the energy efficiency of artificial neural networks. However, accurate in situ training has been challenging due to the nonlinear and stochastic switching of the resistive memory elements. One promising analog memory is the electrochemical random-access memory (ECRAM), also known as the redox transistor. Its low write currents and linear switching properties across hundreds of analog states enable accurate and massively parallel updates of a full crossbar array, which yield rapid and energy-efficient training. While simulations predict that ECRAM based neural networks achieve high training accuracy at significantly higher energy efficiency than digital implementations, these predictions have not been experimentally achieved. In this work, we train a 3 × 3 array of ECRAM devices that learns to discriminate several elementary logic gates (AND, OR, NAND). We record the evolution of the network’s synaptic weights during parallel in situ (on-line) training, with outer product updates. Due to linear and reproducible device switching characteristics, our crossbar simulations not only accurately simulate the epochs to convergence, but also quantitatively capture the evolution of weights in individual devices. The implementation of the first in situ parallel training together with strong agreement with simulation results provides a significant advance toward developing ECRAM into larger crossbar arrays for artificial neural network accelerators, which could enable orders of magnitude improvements in energy efficiency of deep neural networks.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1994

Optoelectronic Terminal-Attractor-Based Associative Memory

Report presents theoretical and experimental study of optically and electronically addressable optical implementation of artificial neural network that performs associative recall. Shows by computer simulation that terminal-attractor-based associative memory can have perfect convergence in associative retrieval and increased storage capacity. Spurious states reduced by exploiting terminal attractors.

Liu, Hua-Kuang↗
DOE OSTI2021

When and why PINNs fail to train: A neural tangent kernel perspective

Physics-informed neural networks (PINNs) have lately received great attention thanks to their flexibility in tackling a wide range of forward and inverse problems involving partial differential equations. However, despite their noticeable empirical success, little is known about how such constrained neural networks behave during their training via gradient descent. More importantly, even less is known about why such models sometimes fail to train at all. Here in this work, we aim to investigate these questions through the lens of the Neural Tangent Kernel (NTK); a kernel that captures the behavior of fully-connected neural networks in the infinite width limit during training via gradient descent. Specifically, we derive the NTK of PINNs and prove that, under appropriate conditions, it converges to a deterministic kernel that stays constant during training in the infinite-width limit. This allows us to analyze the training dynamics of PINNs through the lens of their limiting NTK and find a remarkable discrepancy in the convergence rate of the different loss components contributing to the total training error. To address this fundamental pathology, we propose a novel gradient descent algorithm that utilizes the eigenvalues of the NTK to adaptively calibrate the convergence rate of the total training error. Finally, we perform a series of numerical experiments to verify the correctness of our theory and the practical effectiveness of the proposed algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Tensor network simulations of quasi-GPDs in the massive Schwinger model

Generalized parton distribution functions (GPDs) are off-diagonal light-cone matrix elements that encode the internal structure of hadrons in terms of quark and gluon degrees of freedom. In this work, we present the first nonperturbative study of quasi-GPDs in the massive Schwinger model, quantum electrodynamics in 1+1 dimensions (QED 2 ), within the Hamiltonian formulation of lattice field theory. Quasidistributions are spatial correlation functions of boosted states, which approach the relevant light-cone distributions in the luminal limit. Using tensor networks, we prepare the first excited state in the strongly coupled regime and boost it to close to the light-cone on lattices of up to 400 lattice sites. We compute both quasiparton distribution functions and, for the first time, quasi-GPDs, and study their convergence for increasingly boosted states. In addition, we perform analytic calculations of GPDs in the two-particle Fock-space approximation and in the Reggeized limit, providing qualitative benchmarks for the tensor network results. Our analysis establishes computational benchmarks for accessing partonic observables in low-dimensional gauge theories, offering a starting point for future extensions to higher dimensions, non-Abelian theories, and quantum simulations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1995

A hybrid neurocomputing/numerical strategy for nonlinear structural analysis

A hybrid neurocomputing/numerical strategy is presented for geometrically nonlinear analysis of structures. The strategy combines model-free data processing capabilities of computational neural networks with a Pade approximants-based perturbation technique to predict partial information about the nonlinear response of structures. In the hybrid strategy, multilayer feedforward neural networks are used to extend the validity of solutions by using training samples produced by Pade approximations to the Taylor series expansion of the response function. The range of validity of the training samples is taken to be the radius of convergence of Pade approximants and is estimated by setting a tolerance on the diverging approximants. The norm of residual vector of unbalanced forces in a given element is used as a measure to assess the quality of network predictions. To further increase the accuracy and the range of network predictions, additional training data are generated by either applying linear regression to weight matrices or expanding the training data by using predicted coefficients in a Taylor series. The effectiveness of the hybrid strategy is assessed by performing large-deflection analysis of a doubly-curved composite panel with a circular cutout, and postbuckling analyses of stiffened composite panels subjected to an in-plane edge shear load. In all the problems considered, the hybrid strategy is used to predict selective information about the structural response, namely the total strain energy and the maximum displacement components only.

Szewczyk, Z. Peter↗
DOE OSTI2025

ON-OFF neuromorphic ISING machines using Fowler-Nordheim annealers

We introduce NeuroSA, a neuromorphic architecture specifically designed to ensure asymptotic convergence to the ground state of an Ising problem using a Fowler-Nordheim quantum mechanical tunneling based threshold-annealing process. The core component of NeuroSA consists of a pair of asynchronous ON-OFF neurons, which effectively map classical simulated annealing dynamics onto a network of integrate-and-fire neurons. The threshold of each ON-OFF neuron pair is adaptively adjusted by an FN annealer and the resulting spiking dynamics replicates the optimal escape mechanism and convergence of SA, particularly at low-temperatures. To validate the effectiveness of our neuromorphic Ising machine, we systematically solved benchmark combinatorial optimization problems such as MAX-CUT and Max Independent Set. Across multiple runs, NeuroSA consistently generates distribution of solutions that are concentrated around the state-of-the-art results (within 99%) or surpass the current state-of-the-art solutions for Max Independent Set benchmarks. Furthermore, NeuroSA is able to achieve these superior distributions without any graph-specific hyperparameter tuning. For practical illustration, we present results from an implementation of NeuroSA on the SpiNNaker2 platform, highlighting the feasibility of mapping our proposed architecture onto a standard neuromorphic accelerator platform.

42 ENGINEERING↗
DOE OSTI2022

Employing Interacting Qubits for Distributed Microgrid Control

To empower flexible and scalable operations, distributed control of multi-inverter microgrids, based on classical communication networks among distributed energy resources, has attracted considerable attention as it can guarantee synchronization and provide suitable remedies to the problem of improper power sharing. Notwithstanding this, resilience of the current schemes on classical communication makes microgrids vulnerable to cyber attacks. Inspired by recent revolutionary breakthroughs in quantum communication, in this paper, we devise a novel synchronization mechanism. We extend the synchronization framework utilized in distributed control algorithms to networks of quantum systems by generating pinning terms and coupling mechanism for the new synchronization rule via exploiting proper quantum jump operators and observables, and show that the quantum system will converge to a time-variant target state. Our devised quantum distributed controller (QDC) gives rise to a novel quantum communication scheme for distributed control of microgrids and enables microgrids to exploit the state-of-the-art quantum communication frameworks as communication infrastructure. Finally, test results on two representative AC and DC networked microgrids validate the efficacy and universality of the quantum distributed control.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
NASA NTRS2019

Convergent Aeronautics Solutions Project: QTech

Overview of QTech work, assessing the feasibility of using quantum computation and communication to assure the availability of the UAS Traffic Management (UTM) network against communication disruptions.

Eleanor Rieffel↗
NASA NTRS2005

At-Least Version of the Generalized Minimum Spanning Tree Problem: Optimization Through Ant Colony System and Genetic Algorithms

The At-Least version of the Generalized Minimum Spanning Tree Problem (L-GMST) is a problem in which the optimal solution connects all defined clusters of nodes in a given network at a minimum cost. The L-GMST is NPHard; therefore, metaheuristic algorithms have been used to find reasonable solutions to the problem as opposed to computationally feasible exact algorithms, which many believe do not exist for such a problem. One such metaheuristic uses a swarm-intelligent Ant Colony System (ACS) algorithm, in which agents converge on a solution through the weighing of local heuristics, such as the shortest available path and the number of agents that recently used a given path. However, in a network using a solution derived from the ACS algorithm, some nodes may move around to different clusters and cause small changes in the network makeup. Rerunning the algorithm from the start would be somewhat inefficient due to the significance of the changes, so a genetic algorithm based on the top few solutions found in the ACS algorithm is proposed to quickly and efficiently adapt the network to these small changes.

Janich, Karl W.↗
DOE OSTI2021

Numerical and Analytical Modeling of Flow Partitioning in Partially Saturated Fracture Networks

Infiltration processes in fractured-porous media remain a crucial, yet not very well understood component of recharge and vulnerability assessment. Under partially-saturated conditions flows in fractures, percolating fracture networks, and fault zones contribute to the fastest spectrum of infiltration velocities via preferential pathways. Specifically, the partitioning dynamics at fracture intersections determine the magnitude of flow fragmentation into vertical and horizontal components and hence the bulk flow velocity and dispersion of fracture networks. In this work, we derive an approximate analytical solution for the partitioning process and validate it using smoothed particle hydrodynamics simulations. The developed transfer function is conceptually based on simulation results and laboratory experiments carried out in previous works. It allows to efficiently simulate flow through fracture networks with simple cubic structure and arbitrary number of fractures and aperture sizes via linear response theory and convolution of a given input signal. We derive a non-dimensional bulk flow velocity ($\widetilde{v}$) and dispersion coefficient ($\widetilde{D}$) to characterize fracture networks in terms of dimensionless horizontal and vertical time scales $\tau_m$ and $\tau_0$. The dispersion coefficient is shown to strongly depend on the horizontal time scale and converges towards a constant value of $0.08$ within reasonable fluid and geometrical parameter ranges, while the non-dimensional velocity exhibits a characteristic $\widetilde{v} \sim \tau_m^{-1/2}$ scaling. Given that hydraulic information is often only available at limited places within (fractured-porous) aquifer system, such as boreholes or springs, our study intends to provide a rudimentary analytical concept to potentially reconstruct internal fracture network geometries from external boundary information, e.g., the dispersive properties of discharge (groundwater level fluctuations).

42 ENGINEERING↗
NASA NTRS1994

Remote sensing and the Mississippi high accuracy reference network

Since 1986, NASA's Commercial Remote Sensing Program (CRSP) at Stennis Space Center has supported commercial remote sensing partnerships with industry. CRSP's mission is to maximize U.S. market exploitation of remote sensing and related space-based technologies and to develop advanced technical solutions for spatial information requirements. Observation, geolocation, and communications technologies are converging and their integration is critical to realize the economic potential for spatial informational needs. Global positioning system (GPS) technology enables a virtual revolution in geopositionally accurate remote sensing of the earth. A majority of states are creating GPS-based reference networks, or high accuracy reference networks (HARN). A HARN can be defined for a variety of local applications and tied to aerial or satellite observations to provide an important contribution to geographic information systems (GIS). This paper details CRSP's experience in the design and implementation of a HARN in Mississippi and the design and support of future applications of integrated earth observations, geolocation, and communications technology.

Mick, Mark↗