Search NASA⌕ Search

SEARCH · Search NASA

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 307 records · Page 17
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Impact of in situ nuclear networks and atomic opacities on neutron star merger ejecta dynamics, nucleosynthesis, and kilonovae

Context. Binary neutron star merger (BNSM) ejecta are key sites of rapid neutron capture (r-process) nucleosynthesis and they produce kilonovae powered by the radioactive decay of freshly synthesized nuclei. Modeling their evolution requires multi-physics simulations involving hydrodynamics, nuclear reactions, and radiative processes. The impact of nuclear burning and atomic opacity is poorly understood and often treated with simplified prescriptions. Aims. We systematically investigate different treatments of nuclear heating, particle thermalization, and atomic opacities in radiation-hydrodynamics simulations of BNSM ejecta and kilonova light curves. Methods. Ejecta profiles from long-term numerical-relativity simulations of asymmetric neutron star binaries with a massive neutron star remnant were evolved to ∼30 days using a 2D ray-by-ray approach. We compared simplified heating-rate and thermalization prescriptions with in situ Nuclear reaction Network (NN) calculations that track nuclear energy deposition and include a composition-dependent thermalization scheme. We also contrasted various gray opacity models with a frequency-dependent treatment based on atomic calculations. Results. Coupling NN and hydrodynamics significantly affects nucleosynthesis and kilonova emission. Assuming homologous expansion alters abundance evolution and produces a narrower, less populated second r-process peak and a third peak shifted to higher mass numbers. The back-reaction of nuclear heating affects the temperature evolution enough to delay and redden the early (t∼ hours) kilonova peaks. A constant thermalization efficiency underestimates and reddens the early emission while overestimating the late-time luminosity compared to the composition-dependent treatment. Analytical opacity prescriptions yield a more extended, colder photosphere, resulting in dimmer, redder kilonovae at early times (t≲ hour), while the delayed recession of the photosphere prolongs the red emission at t ≳ 5 days. Conclusions. Coupling hydrodynamics to an in situ NN is crucial for reliable nucleosynthesis and kilonova predictions. Resolving the first several hundred milliseconds of the hydrodynamics is essential for robust nucleosynthesis calculations. Composition-dependent thermalization and frequency-dependent, atomic-physics-based opacities are needed to accurately capture the temperature evolution of the ejecta and the brightness and color evolution of the kilonova. Calibrated analytic nuclear-power fits with simplified thermalization and opacity prescriptions can still reproduce the density and temperature evolution of the ejecta.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2025

SIDDA: SInkhorn Dynamic Domain Adaptation

Modern neural networks (NNs) often do not generalize well in the presence of a "covariate shift"; that is, in situations where the training and test data distributions differ, but the conditional distribution of classification labels remains unchanged. In such cases, NN generalization can be reduced to a problem of learning more domain-invariant features. Domain adaptation (DA) methods include a range of techniques aimed at achieving this; however, these methods have struggled with the need for extensive hyperparameter tuning, which then incurs significant computational costs. In this work, we introduce SIDDA, an out-of-the-box DA training algorithm built upon the Sinkhorn divergence, that can achieve effective domain alignment with minimal hyperparameter tuning and computational overhead. We demonstrate the efficacy of our method on multiple simulated and real datasets of varying complexity, including simple shapes, handwritten digits, and real astronomical observations. SIDDA is compatible with a variety of NN architectures, and it works particularly well in improving classification accuracy and model calibration when paired with equivariant neural networks (ENNs). We find that SIDDA enhances the generalization capabilities of NNs, achieving up to a ≈40% improvement in classification accuracy on unlabeled target data. We also study the efficacy of DA on ENNs with respect to the varying group orders of the dihedral group DN, and find that the model performance improves as the degree of equivariance increases. Finally, we find that SIDDA enhances model calibration on both source and target data--achieving over an order of magnitude improvement in the ECE and Brier score. SIDDA's versatility, combined with its automated approach to domain alignment, has the potential to advance multi-dataset studies by enabling the development of highly generalizable models.

Pandya, Sneh [Northeastern U.]↗
NASA NTRS2001

Inferring Instantaneous, Multivariate and Nonlinear Sensitivities for the Analysis of Feedback Processes in a Dynamical System: Lorenz Model Case Study

A new approach is presented for the analysis of feedback processes in a nonlinear dynamical system by observing its variations. The new methodology consists of statistical estimates of the sensitivities between all pairs of variables in the system based on a neural network modeling of the dynamical system. The model can then be used to estimate the instantaneous, multivariate and nonlinear sensitivities, which are shown to be essential for the analysis of the feedbacks processes involved in the dynamical system. The method is described and tested on synthetic data from the low-order Lorenz circulation model where the correct sensitivities can be evaluated analytically.

Aires, Filipe↗
NASA NTRS1993

Model reduction for the dynamics and control of large structural systems via neutral network processing direct numerical optimization

Three neural network processing approaches in a direct numerical optimization model reduction scheme are proposed and investigated. Large structural systems, such as large space structures, offer new challenges to both structural dynamicists and control engineers. One such challenge is that of dimensionality. Indeed these distributed parameter systems can be modeled either by infinite dimensional mathematical models (typically partial differential equations) or by high dimensional discrete models (typically finite element models) often exhibiting thousands of vibrational modes usually closely spaced and with little, if any, damping. Clearly, some form of model reduction is in order, especially for the control engineer who can actively control but a few of the modes using system identification based on a limited number of sensors. Inasmuch as the amount of 'control spillover' (in which the control inputs excite the neglected dynamics) and/or 'observation spillover' (where neglected dynamics affect system identification) is to a large extent determined by the choice of particular reduced model (RM), the way in which this model reduction is carried out is often critical.

Becus, Georges A.↗
NASA NTRS1991

Adjoint-operators and non-adiabatic learning algorithms in neural networks

Adjoint sensitivity equations are presented, which can be solved simultaneously (i.e., forward in time) with the dynamics of a nonlinear neural network. These equations provide the foundations for a new methodology which enables the implementation of temporal learning algorithms in a highly efficient manner.

Toomarian, N.↗
NASA NTRS1994

GPS Data Analysis for Earth Orientation at the Jet Propulsion Laboratory

Beginning June 1992 and continuing indefinitely as part of our contribution to FLINN (Fiducial Laboratories for an International Natural Science Network), DOSE (NASA's Dynamics of the Solid Earth Program), and the IGS (International GPS Geodynamics Service), analysts at the Jet Propulsion Laboratory (JPL) have routinely been reducing data from a globally-distributed network of Rogue Global Positioning System (GPS) receivers.

GPS satellite ephemerides polar motion↗
NASA NTRS2011

Contact Graph Routing

Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology of scheduled communication contacts in a network based on the DTN (Delay-Tolerant Networking) architecture. It is designed to enable dynamic selection of data transmission routes in a space network based on DTN. This dynamic responsiveness in route computation should be significantly more effective and less expensive than static routing, increasing total data return while at the same time reducing mission operations cost and risk. The basic strategy of CGR is to take advantage of the fact that, since flight mission communication operations are planned in detail, the communication routes between any pair of bundle agents in a population of nodes that have all been informed of one another's plans can be inferred from those plans rather than discovered via dialogue (which is impractical over long one-way-light-time space links). Messages that convey this planning information are used to construct contact graphs (time-varying models of network connectivity) from which CGR automatically computes efficient routes for bundles. Automatic route selection increases the flexibility and resilience of the space network, simplifying cross-support and reducing mission management costs. Note that there are no routing tables in Contact Graph Routing. The best route for a bundle destined for a given node may routinely be different from the best route for a different bundle destined for the same node, depending on bundle priority, bundle expiration time, and changes in the current lengths of transmission queues for neighboring nodes; routes must be computed individually for each bundle, from the Bundle Protocol agent's current network connectivity model for the bundle s destination node (the contact graph). Clearly this places a premium on optimizing the implementation of the route computation algorithm. The scalability of CGR to very large networks remains a research topic. The information carried by CGR contact plan messages is useful not only for dynamic route computation, but also for the implementation of rate control, congestion forecasting, transmission episode initiation and termination, timeout interval computation, and retransmission timer suspension and resumption.

Burleigh, Scott C.↗
DOE OSTI2025

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↗
NASA NTRS2004

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.↗
NASA NTRS1993

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.↗
NASA NTRS2006

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.↗
DOE OSTI2024

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↗
DOE OSTI2026

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)↗
NASA NTRS2006

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↗
NASA NTRS1992

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.↗
DOE OSTI2024

Unusual dynamics of tetrahedral liquids caused by the competition between dynamic heterogeneity and structural heterogeneity

Tetrahedral liquids exhibit intriguing thermodynamic and transport properties because of the various ways tetrahedra can be packed and connected. Recently, an unusual temperature dependence of the stretching exponent β in a model tetrahedral liquid ZnCl 2 from T m + 85 K to T m + 35 K has been reported using neutron-spin echo spectroscopy. This discovery stands in sharp contrast to other glass-forming liquids. In this study, we conducted neural network force field driven molecular dynamic simulations of ZnCl 2 . We found a non-monotonic temperature dependence of β from liquid to supercooled liquid temperatures. Further structural decomposition and dynamic analysis suggest that this unusual dynamic behavior is a result of the competition between the decrease in the diversity of tetrahedra motifs (structural heterogeneity) and the increase in glassy dynamic heterogeneity. Furthermore, this result may contribute to new understandings of the structural relaxation of other network liquids.

36 MATERIALS SCIENCE↗
NASA NTRS1991

Engineering monitoring expert system's developer

This research project is designed to apply artificial intelligence technology including expert systems, dynamic interface of neural networks, and hypertext to construct an expert system developer. The developer environment is specifically suited to building expert systems which monitor the performance of ground support equipment for propulsion systems and testing facilities. The expert system developer, through the use of a graphics interface and a rule network, will be transparent to the user during rule constructing and data scanning of the knowledge base. The project will result in a software system that allows its user to build specific monitoring type expert systems which monitor various equipments used for propulsion systems or ground testing facilities and accrues system performance information in a dynamic knowledge base.

Lo, Ching F.↗