Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “dynamic networks”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 631 records · Page 35

Semi-supervised Learning of Dynamical Systems with Neural Ordinary Differential Equations: A Teacher-Student Model Approach

Modeling dynamical systems is crucial for a wide range of tasks, but it remains challenging due to complex nonlinear dynamics, limited observations, or lack of prior knowledge. Recently, data-driven approaches such as Neural Ordinary Differential Equations (NODE) have shown promising results by leveraging the expressive power of neural networks to model unknown dynamics. However, these approaches often suffer from limited labeled training data, leading to poor generalization and suboptimal predictions. On the other hand, semi-supervised algorithms can utilize abundant unlabeled data and have demonstrated good performance in classification and regression tasks. We propose TS-NODE, the first semi-supervised approach to modeling dynamical systems with NODE. TS-NODE explores cheaply generated synthetic pseudo rollouts to broaden exploration in the state space and to tackle the challenges brought by lack of ground-truth system data under a teacher-student model. TS-NODE employs an unified optimization framework that corrects the teacher model based on the student's feedback while mitigating the potential false system dynamics present in pseudo rollouts. TS-NODE demonstrates significant performance improvements over a baseline Neural ODE model on multiple dynamical system modeling tasks.

Wang, Yu↗

From disorganized data to emergent dynamic models: Questionnaires to partial differential equations

Starting with sets of disorganized observations of spatially varying and temporally evolving systems, obtained at different (also disorganized) sets of parameters, we demonstrate the data-driven derivation of parameter dependent, evolutionary partial differential equation (PDE) models capable of generating the data. This tensor type of data is reminiscent of shuffled (multidimensional) puzzle tiles. The independent variables for the evolution equations (their “space” and “time”) as well as their effective parameters are all emergent , i.e. determined in a data-driven way from our disorganized observations of behavior in them. We use a diffusion map based questionnaire approach to build a smooth parametrization of our emergent space/time/parameter space for the data. This approach iteratively processes the data by successively observing them on the “space,” the “time” and the “parameter” axes of a tensor. Once the data become organized, we use machine learning (here, neural networks) to approximate the operators governing the evolution equations in this emergent space. Our illustrative examples are based (i) on a simple advection–diffusion model; (ii) on a previously developed vertex-plus-signaling model of Drosophila embryonic development; and (iii) on two complex dynamic network models (one neuronal and one coupled oscillator model) for which no obvious smooth embedding geometry is known a priori. This allows us to discuss features of the process like symmetry breaking, translational invariance, and autonomousness of the emergent PDE model, as well as its interpretability.

generative models↗

Anisotropic Dynamics and Mechanics of Macromolecular Crystals Containing Lattice-Patterned Polymer Networks

The mechanical and functional properties of many crystalline materials depend on cooperative changes in lattice arrangements in response to external perturbations. However, the flexibility and adaptiveness of crystalline materials are limited. Additionally, the bottom-up, molecular-level design of crystals with desired dynamic and mechanical properties at the macroscopic level remains a considerable challenge. To address these challenges, we had previously integrated mesoporous, cubic ferritin crystals with hydrogel networks, resulting in hybrid materials (polymer integrated crystals or PIX) which could undergo dramatic structural changes while maintaining crystalline periodicity and display efficient self-healing. Here, the dynamics and mechanics of these ferritin-PIX were devoid of directionality, which is an important attribute of many molecular and macroscopic materials/devices. In this study, we report that such directionality can be achieved through the use of ferritin crystals with anisotropic symmetries (rhombohedral or trigonal), which enable the templated formation of patterned hydrogel networks in crystallo. The resulting PIX expand and contract anisotropically without losing crystallinity, undergo prompt bending motions in response to stimuli, and self-heal efficiently, capturing some of the essential features of sophisticated biological devices like skeletal muscles.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Power Spectrum of Atmospheric Scintillation for the Deep Space Network Goldstone Ka-Band Downlink

Dynamic signal fluctuations due to atmospheric scintillations may impair the Ka-band (around 32-GHz) link sensitivities for a low-margin Deep Space Network (DSN) receiving system. The ranges of frequency and power of the fast fluctuating signals (time scale less than 1 min) are theoretically investigated using the spatial covariance and turbulence theory. Scintillation power spectrum solutions are derived for both a point receiver and a finite-aperture receiver. The aperture-smoothing frequency ((omega(sub s)), corner frequency ((omega(sub c)), and damping rate are introduced to define the shape of the spectrum for a finite-aperture antenna. The emphasis is put on quantitatively describing the aperture-smoothing effects and graphically estimating the corner frequency for a large aperture receiver. Power spectral shapes are analyzed parametrically in detail through both low- and high-frequency approximations. It is found that aperture-averaging effects become significant when the transverse correlation length of the scintillation is smaller than the antenna radius. The upper frequency or corner frequency for a finite-aperture receiver is controlled by both the Fresnel frequency and aperture-smoothing frequency. Above the aperture-smoothing frequency, the spectrum rolls off at a much faster rate of exp (-omega(sup 2)/omega(sup 2, sub s), rather than omega(sup -8/3), which is customary for a point receiver. However, a relatively higher receiver noise level can mask the fast falling-off shape and make it hard to be identified. We also predict that when the effective antenna radius a(sub r) less than or = 6 m, the corner frequency of its power spectrum becomes the same as that for a point receiver. The aperture-smoothing effects are not obvious. We have applied these solutions to the scenario of a DSN Goldstone 34-m-diameter antenna and predicted the power spectrum shape for the receiving station. The maximum corner frequency for the receiver (with omega(sub s) = 0.79 omega(sub 0) is found to be 0.44 Hz (or 1.0 omega(sub 0), while the fading rate (or fading slope) is about 0.06 dB/s.

Ho, C.↗

Dynamics of the solar chromosphere. I - Long-period network oscillations

We analyze differences in solar oscillations between the chromospheric network and internetwork regions from a 1 hr sequence of spectrograms of a quiet region near disk center. The spectrograms contain Ca II H, Ca I 422.7 nm, and various Fe I blends in the Ca II H wing. They permit vertical tracing of oscillations throughout the photosphere and into the low chromosphere. We find that the rms amplitude of Ca II H line center Doppler fluctuations is about 1.5 km/s for both network and internetwork, but that the character of the oscillations differs markedly in these two regions. Within internetwork areas the chromospheric velocity power spectrum is dominated by oscillations with frequencies at and above the acoustic cutoff frequency. They are well correlated with the oscillations in the underlying photosphere, but they are much reduced in the network. In contrast, the network Ca II H line center velocity and intensity power spectra are dominated by low-frequency oscillations with periods of 5-20 min. Their signature is much clearer in our Ca II H line center measurements than in previously used diagnostics which are contaminated by signals from deeper layers. We find that these long-period oscillations are not correlated with underlying photospheric disturbances, and we discuss their nature.

Lites, B. W.↗

DCS-Neural-Network Program for Aircraft Control and Testing

A computer program implements a dynamic-cell-structure (DCS) artificial neural network that can perform such tasks as learning selected aerodynamic characteristics of an airplane from wind-tunnel test data and computing real-time stability and control derivatives of the airplane for use in feedback linearized control. A DCS neural network is one of several types of neural networks that can incorporate additional nodes in order to rapidly learn increasingly complex relationships between inputs and outputs. In the DCS neural network implemented by the present program, the insertion of nodes is based on accumulated error. A competitive Hebbian learning rule (a supervised-learning rule in which connection weights are adjusted to minimize differences between actual and desired outputs for training examples) is used. A Kohonen-style learning rule (derived from a relatively simple training algorithm, implements a Delaunay triangulation layout of neurons) is used to adjust node positions during training. Neighborhood topology determines which nodes are used to estimate new values. The network learns, starting with two nodes, and adds new nodes sequentially in locations chosen to maximize reductions in global error. At any given time during learning, the error becomes homogeneously distributed over all nodes.

Jorgensen, Charles C.↗

Improved Architectures and Training Algorithms for Deep Operator Networks

Operator learning techniques have recently emerged as a powerful tool for learning maps between infinite-dimensional Banach spaces. Trained under appropriate constraints, they can also be effective in learning the solution operator of partial differential equations (PDEs) in an entirely self-supervised manner. In this work we analyze the training dynamics of deep operator networks (DeepONets) through the lens of Neural Tangent Kernel theory, and reveal a bias that favors the approximation of functions with larger magnitudes. To correct this bias we propose to adaptively re-weight the importance of each training example, and demonstrate how this procedure can effectively balance the magnitude of back-propagated gradients during training via gradient descent. We also propose a novel network architecture that is more resilient to vanishing gradient pathologies. Taken together, our developments provide new insights into the training of DeepONets and consistently improve their predictive accuracy by a factor of 10-50x, demonstrated in the challenging setting of learning PDE solution operators in the absence of paired input-output observations.

97 MATHEMATICS AND COMPUTING↗

Robust Self-Healing Adhesives Based on Dynamic Urethane Exchange Reactions

Thermoset polyurethanes (PUs) have been successfully reprocessed as covalent adaptable networks (CANs) by catalyzing carbamate exchange. Here we extend bond exchange beyond the internal network cross-links to create a dynamic urethane adhesive. Interfacing PU CANs to substrates with nucleophilic functional groups creates adhesives capable of reversible transcarbamoylation with the substrate, which has not been demonstrated previously by CAN adhesives. Two types of thermoset PU films were synthesized, one containing the green carbamate exchange catalyst Zr(tmhd)4 and the other containing no catalyst. Although otherwise identical in chemical and network properties, as indicated by FT-IR spectroscopy and dynamic mechanical thermal analysis (DMTA), the film containing catalyst showed dynamic bond exchange behavior through stress relaxation analysis. When evaluated as an adhesive, the CAN film exhibited self-healing properties and retained its adhesive strength for five cycles, which is attributed to reversible covalent bonding to the glass substrate. Furthermore, this work expands industrially relevant CANs to structural adhesives and demonstrates their potential value in an application that presently employs PUs as single-use materials.

adhesive↗

Multi-Agent Control Planes for Quantum Networks: A Scalable Architecture for Autonomous Quantum Internet Management

Quantum networks are expected to enable distributed quantum computing, secure communication, and global entanglement distribution. However, operating such networks presents significant challenges, including stochastic quantum processes, fragile entanglement resources, dynamic topology, and cross-layer control requirements. Current quantum network control architectures largely rely on centralized or hierarchical controllers inspired by classical software-defined networking (SDN). While effective for small testbeds, these approaches face scalability, latency, and reliability limitations as quantum networks grow. This paper proposes a multi-agent control plane architecture for quantum networks. In this design, intelligent software agents operate at quantum nodes, repeaters, and orchestration layers, collectively managing entanglement generation, routing, purification, and scheduling. The distributed intelligence of the agent system allows the network to adapt dynamically to quantum hardware variability and environmental noise. We argue that multi-agent systems provide significant advantages over centralized control approaches, including scalability, resilience, local autonomy, and real-time adaptation. The paper discusses architectural design principles, agent coordination mechanisms, and research challenges in deploying multi-agent control planes for the emerging quantum Internet.

Alnajjar, Anees [ORNL] (ORCID:0000000237101601)↗

Flexspander: augmenting expander networks in high-performance systems with optical bandwidth steering

Communication efficiency is one of the deciding factors in determining many of today’s high-performance computing (HPC) applications. Traditionally, HPC systems have been on static network topologies, making them inflexible to the variety of skewed traffic demands that may arise due to the spatial locality inherent in many applications. To handle traffic locality, researchers have proposed integrating optical circuit switches (OCSs) into the network architecture, which reconfigures the network topology to alter and dynamically adapt to the predicted traffic. In this paper, we present a novel reconfigurable network topology called Flexspander. Beyond offering a flexible interconnect, Flexspander also offers full flexibility in terms of construction and can be built with any arbitrary combination of commercial electrical packet switches and OCSs. We evaluate Flexspander performance through extensive simulations with multiple network traces, and our results show improved performance for Flexspander over currently proposed static and reconfigurable topologies in terms of the flow completion time.

Teh, Min Yee↗

Dynamically Alterable Arrays of Polymorphic Data Types

An application library package was developed that represents data packets for Deep Space Network (DSN) message packets as dynamically alterable arrays composed of arbitrary polymorphic data types. The software was to address a limitation of the present state of the practice for having an array directly composed of a single monomorphic data type. This is a severe limitation when one is dealing with science data in that the types of objects one is dealing with are typically not known in advance and, therefore, are dynamic in nature. The unique feature of this approach is that it enables one to define at run-time the dynamic shape of the matrix with the ability to store polymorphic data types in each of its indices. Existing languages such as C and C++ have the restriction that the shape of the array must be known in advance and each of its elements be a monomorphic data type that is strictly defined at compile-time. This program can be executed on a variety of platforms. It can be distributed in either source code or binary code form. It must be run in conjunction with any one of a number of Lisp compilers that are available commercially or as shareware.

James, Mark↗

Development of novel dynamic machine learning-based optimization of a coal-fired power plant

The increasing fraction of intermittent renewable energy in the electrical grid is resulting in coal-fired boilers now routinely ramp up and down. The current state-of-the-art operation for such boilers is to apply steady-state, neural network-based optimization to make control decisions in real-time, and this report demonstrates the feasibility of extending this to dynamic, neural network-based optimization using a long short-term memory neural network. A simplified numerical simulation of a t-fired coal boiler and supporting equipment is used to represent a real plant subjected to both steady-state, neural network-based optimization and dynamic, neural network-based optimization. Using the same intervals and a particle swarm optimization algorithm, the dynamic optimization outperforms the steady-state optimization and realizes up to 4.58% improvement in thermal efficiency. Dynamic optimization with a long short-term memory neural network is shown to both be feasible and beneficial for operation of a coal-fired boiler under changing load.

42 ENGINEERING↗

Data assimilation empowered neural network parametrizations for subgrid processes in geophysical flows

In the past couple of years, there has been a proliferation in the use of machine learning approaches to represent subgrid-scale processes in geophysical flows with an aim to improve the forecasting capability and to accelerate numerical simulations of these flows. Despite its success for different types of flow, the online deployment of a data-driven closure model can cause instabilities and biases in modeling the overall effect of subgrid-scale processes, which in turn leads to inaccurate prediction. To tackle this issue, we exploit the data assimilation technique to correct the physics-based model coupled with the neural network as a surrogate for unresolved flow dynamics in multiscale systems. In particular, we use a set of neural network architectures to learn the correlation between resolved flow variables and the parametrizations of unresolved flow dynamics and formulate a data assimilation approach to correct the hybrid model during their online deployment. We illustrate our framework in a set of applications of the multiscale Lorenz 96 system for which the parametrization model for unresolved scales is exactly known, and the two-dimensional Kraichnan turbulence system for which the parametrization model for unresolved scales is not known a priori. Our analysis, therefore, comprises a predictive dynamical core empowered by (i) a data-driven closure model for subgrid-scale processes, (ii) a data assimilation approach for forecast error correction, and (iii) both data-driven closure and data assimilation procedures. We show significant improvement in the long-term prediction of the underlying chaotic dynamics with our framework compared to using only neural network parametrizations for future prediction. Moreover, we demonstrate that these data-driven parametrization models can handle the non-Gaussian statistics of subgrid-scale processes, and effectively improve the accuracy of outer data assimilation workflow loops in a modular nonintrusive way.

42 ENGINEERING↗

Learning a trajectory using adjoint functions and teacher forcing

A new methodology for faster supervised temporal learning in nonlinear neural networks is presented which builds upon the concept of adjoint operators to allow fast computation of the gradients of an error functional with respect to all parameters of the neural architecture, and exploits the concept of teacher forcing to incorporate information on the desired output into the activation dynamics. The importance of the initial or final time conditions for the adjoint equations is discussed. A new algorithm is presented in which the adjoint equations are solved simultaneously (i.e., forward in time) with the activation dynamics of the neural network. We also indicate how teacher forcing can be modulated in time as learning proceeds. The results obtained show that the learning time is reduced by one to two orders of magnitude with respect to previously published results, while trajectory tracking is significantly improved. The proposed methodology makes hardware implementation of temporal learning attractive for real-time applications.

Toomarian, Nikzad B.↗