Search NASA⌕ Search

SEARCH · Search NASA

Results for “Network Models”

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 1,315 records · Page 73

Ka-band (32-GHz) performance of 70-meter antennas in the Deep Space Network

Two models are provided of the Deep Space Network (DSN) 70 m antenna performance at Ka-band (32 GHz) and, for comparison purposes, one at X-band (8.4 GHz). The baseline 70 m model represents expected X-band and Ka-band performance at the end of the currently ongoing 64 m to 70 m mechanical upgrade. The improved 70 m model represents two sets of Ka-band performance estimates (the X-band performance will not change) based on two separately developed improvement schemes: the first scheme, a mechanical approach, reduces tolerances of the panels and their settings, the reflector structure and subreflector, and the pointing and tracking system. The second, an electronic/mechanical approach, uses an array feed scheme to compensate fo lack of antenna stiffness, and improves panel settings using microwave holographic measuring techniques. Results are preliminary, due to remaining technical and cost uncertainties. However, there do not appear to be any serious difficulties in upgrading the baseline DSN 70 m antenna network to operate efficiently in an improved configuration at 32 GHz (Ka-band). This upgrade can be achieved by a conventional mechanical upgrade or by a mechanical/electronic combination. An electronically compensated array feed system is technically feasible, although it needs to be modeled and demonstrated. Similarly, the mechanical upgrade requires the development and demonstration of panel actuators, sensors, and an optical surveying system.

Imbriale, W. A.↗

The Network Completion Problem: Inferring Missing Nodes and Edges in Networks

Network structures, such as social networks, web graphs and networks from systems biology, play important roles in many areas of science and our everyday lives. In order to study the networks one needs to first collect reliable large scale network data. While the social and information networks have become ubiquitous, the challenge of collecting complete network data still persists. Many times the collected network data is incomplete with nodes and edges missing. Commonly, only a part of the network can be observed and we would like to infer the unobserved part of the network. We address this issue by studying the Network Completion Problem: Given a network with missing nodes and edges, can we complete the missing part? We cast the problem in the Expectation Maximization (EM) framework where we use the observed part of the network to fit a model of network structure, and then we estimate the missing part of the network using the model, re-estimate the parameters and so on. We combine the EM with the Kronecker graphs model and design a scalable Metropolized Gibbs sampling approach that allows for the estimation of the model parameters as well as the inference about missing nodes and edges of the network. Experiments on synthetic and several real-world networks show that our approach can effectively recover the network even when about half of the nodes in the network are missing. Our algorithm outperforms not only classical link-prediction approaches but also the state of the art Stochastic block modeling approach. Furthermore, our algorithm easily scales to networks with tens of thousands of nodes.

97 MATHEMATICS AND COMPUTING↗

Modeling Emergence in Neuroprotective Regulatory Networks

The use of predictive modeling in the analysis of gene expression data can greatly accelerate the pace of scientific discovery in biomedical research by enabling in silico experimentation to test disease triggers and potential drug therapies. Techniques that focus on modeling emergence, such as agent-based modeling and multi-agent simulations, are of particular interest as they support the discovery of pathways that may have never been observed in the past. Thus far, these techniques have been primarily applied at the multi-cellular level, or have focused on signaling and metabolic networks. We present an approach where emergence modeling is extended to regulatory networks and demonstrate its application to the discovery of neuroprotective pathways. An initial evaluation of the approach indicates that emergence modeling provides novel insights for the analysis of regulatory networks that can advance the discovery of acute treatments for stroke and other diseases.

agent-based modeling↗

0D Modeling of Reactor Networks Within Zuzax

We report on progress in developing macroscopic balance equations for combustion and electrochemistry systems. A steady state solution capability is described for the macroscopic reactor network, with an associated steady state continuation method and solution storage capability added in. An example is provided of continuation of a hydrogen flame versus the equivalence ratio. The reactor modeling capability is extended to charged fluid systems, with a description of the new ChargedFluidReactor, SubstrateElement, and MetalCurrentElement reactor classes and novel setup of unknowns within these reactors that preserve charge neutrality. Zuzax's setup for electrochemistry is explained including the specification of the electron chemical potential and the adherence to the SHE Reference electrode specification. The description of the different ways to enter electrochemical reaction rates are described, contrasted, and their derivations with respect to one another are derived. An example of using the ChargedFluidReactor within corrosion problems is provided. We present a description of calculations to understand the phenomena of corrosion of copper from a micron sized droplet of NaCl water droplet, where secondary spreading occurs. An analysis of the discrepancies with experiment is carried out, demonstrating that macroscopic balances can be an important tool for understanding what major factors need to be addressed for a better understanding of a physical system.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Pyrolysis reaction networks for lignin model compounds: unraveling thermal deconstruction of β-O-4 and α-O-4 compounds

Although lignin is one of the main components of biomass, its pyrolysis chemistry is not well understood due to complex heterogeneity. To gain insights into this chemistry, the pyrolysis of seven lignin model compounds (five ..beta..-O-4 and two ..alpha..-O-4 linked molecules) was investigated in a micropyrolyzer connected to GC-MS/FID. According to quantitative product mole balance for the reaction networks, concerted retro-ene fragmentation and homolytic dissociation were strongly suggested as the initial reaction step for ..beta..-O-4 compounds and ..alpha..-O-4 compounds, respectively. The difference in reaction pathway between compounds with different linkages was believed to result from thermodynamics of the radical initiation. The rate constants for the different reaction pathways were predicted from ab initio density functional theory calculations and pre-exponential literature values. The computational findings were consistent with the experiment results, further supporting the different pyrolysis mechanisms for the ..beta..-ether linked and ..alpha..-ether linked compounds. A combination of the two pathways from the dimeric model compounds was able to describe qualitatively the pyrolysis of a trimeric lignin model compound containing both ..beta..-O-4 and ..alpha..-O-4 linkages.

09 BIOMASS FUELS↗

System Analysis for the Huntsville Operation Support Center, Distributed Computer System

HOSC as a distributed computing system, is responsible for data acquisition and analysis during Space Shuttle operations. HOSC also provides computing services for Marshall Space Flight Center's nonmission activities. As mission and nonmission activities change, so do the support functions of HOSC change, demonstrating the need for some method of simulating activity at HOSC in various configurations. The simulation developed in this work primarily models the HYPERchannel network. The model simulates the activity of a steady state network, reporting statistics such as, transmitted bits, collision statistics, frame sequences transmitted, and average message delay. These statistics are used to evaluate such performance indicators as throughout, utilization, and delay. Thus the overall performance of the network is evaluated, as well as predicting possible overload conditions.

Ingels, F. M.↗

Sparse Deep Neural Network Inference using different Programming Models

Sparse deep neural networks have gained increasing attention recently in achieving speedups on inference with reduced memory footprints. However, the real-world applications are little shown with specialized optimizations, yet a wide variety of DNN tasks remain dense without exploiting the advantages of sparsity in networks. Recent work presented by MIT/IEEE/Amazon GraphChallenge has demonstrated significant speedups and various techniques. Still, we find that there is limited investigation of the impact of various Python and C\slash C++ based programming models to explore new opportunities in general cases. In this work, we provide performance evaluation through different programming models using CuPy, cuSPARSE, and OpenMP to discuss the advantages and disadvantages of our sparse implementations on single-GPU and multiple GPUs of NVIDIA DGX-A100 40GB/80GB platforms.

machine learning, HPC↗

CSK hopping pattern model for visible light communication networks

This paper proposes a new channel access method for visible light communications. The transmitter uses the CSK hopping pattern mode to load data to the R, G, and B light-emitting diodes of LEDs and establishes the network access point (AP) of the LEDs for the illumination coverage area. The coordinator controls the work of each AP to ensure that it simultaneously uses different color patterns to distinguish its respective networks. When the receiver (mobile terminal) detects a particular color pattern in the illumination coverage area, it establishes a communication access network process with the AP that is transmitting the particular color pattern. The advantage of this method is that interference between adjacent APs can be avoided. In addition, due to the simplification of the access network, the proposed CSK hopping model can shorten delays in the terminal’s access network. Through modeling and simulation, it is found that this method can effectively support network power and reduce network delay. Moreover, the fairness and stability of terminals that access the network are improved to a certain extent.

42 ENGINEERING↗

Discrete generative diffusion models without stochastic differential equations: A tensor network approach

Diffusion models (DMs) are a class of generative machine learning methods that sample a target distribution by transforming samples of a trivial (often Gaussian) distribution using a learned stochastic differential equation. In standard DMs, this is done by learning a “score function” that reverses the effect of adding diffusive noise to the distribution of interest. Here we consider the generalisation of DMs to lattice systems with discrete degrees of freedom, and where noise is added via Markov chain jump dynamics. We show how to use tensor networks (TNs) to efficiently define and sample such “discrete diffusion models” (DDMs) without explicitly having to solve a stochastic differential equation. We show the following: (i) by parametrising the data and evolution operators as TNs, the denoising dynamics can be represented exactly; (ii) the auto-regressive nature of TNs allows to generate samples efficiently and without bias; (iii) for sampling Boltzmann-like distributions, TNs allow to construct an efficient learning scheme that integrates well with Monte Carlo. We illustrate this approach to study the equilibrium of two models with non-trivial thermodynamics, the d = 1 constrained Fredkin chain and the d = 2 Ising model. Published by the American Physical Society 2025

Causer, Luke (ORCID:0000000194243473)↗

a priori uncertainty quantification of reacting turbulence closure models using Bayesian neural networks

While many physics-based closure model forms have been posited for the sub-filter scale (SFS) in large eddy simulation (LES), vast amounts of data available from direct numerical simulations (DNS) create opportunities to leverage data-driven modeling techniques. Albeit flexible, data-driven models still depend on the dataset and the functional form of the model chosen. Increased adoption of such models requires reliable uncertainty estimates both in the data-informed and out-of-distribution regimes. Here, in this work, we employ Bayesian neural networks (BNNs) to capture both epistemic and aleatoric uncertainties in a reacting flow model. In particular, we model the filtered progress variable scalar dissipation rate which plays a key role in the dynamics of turbulent premixed flames. We demonstrate that BNN models can provide unique insights about the structure of uncertainty of the data-driven closure models. We also propose a method for the incorporation of out-of-distribution information in a BNN, which can be used for out-of-distribution query detection. The efficacy of the model is demonstrated by a priori evaluation on a dataset consisting of a variety of flame conditions and fuels.

97 MATHEMATICS AND COMPUTING↗

Topological Relationship–Based Flow Direction Modeling: Mesh–Independent River Networks Representation

River networks are important features in surface hydrology. However, accurately representing river networks in spatially distributed hydrologic and Earth system models is often sensitive to the model's spatial resolution. Specifically, river networks are often misrepresented because of the mismatch between the model's spatial resolution and river network details, resulting in significant uncertainty in the projected flow direction. In this study, we developed a topological relationship-based river network representation method for spatially distributed hydrologic models. This novel method uses (a) graph theory algorithms to simplify real-world vector-based river networks and assist in mesh generation; and (b) a topological relationship-based method to reconstruct conceptual river networks. The main advantages of our method are that (a) it combines the strengths of vector-based and DEM raster-based river network extraction methods; and (b) it is mesh-independent and can be applied to both structured and unstructured meshes. This method paves a path for advanced terrain analysis and hydrologic modeling across different scales.

54 ENVIRONMENTAL SCIENCES↗

Computation of signal delays in RC networks

A model for signal delay computation in RC networks is presented. The strength of the paradigm is its generality and simplicity. The definition of delay is applicable to RC meshes with potential resistive attenuating paths to ground. The algorithms can also be applied to undriven circuits (static charge sharing) and circuits with initial charge. To compute the delays, each node in the network is explored locally to derive a system of sparse linear equations. The solutions of the system are delay values based on the Elmore time constant at each point in the circuit.

Hidalgo, Juan Carlos↗

Bio-Inspired Neural Model for Learning Dynamic Models

A neural-network mathematical model that, relative to prior such models, places greater emphasis on some of the temporal aspects of real neural physical processes, has been proposed as a basis for massively parallel, distributed algorithms that learn dynamic models of possibly complex external processes by means of learning rules that are local in space and time. The algorithms could be made to perform such functions as recognition and prediction of words in speech and of objects depicted in video images. The approach embodied in this model is said to be "hardware-friendly" in the following sense: The algorithms would be amenable to execution by special-purpose computers implemented as very-large-scale integrated (VLSI) circuits that would operate at relatively high speeds and low power demands.

Duong, Tuan↗

Finite-dimensional modeling of network-induced delays for real-time control systems

In integrated control systems (ICS), a feedback loop is closed by the common communication channel, which multiplexes digital data from the sensor to the controller and from the controller to the actuator along with the data traffic from other control loops and management functions. Due to asynchronous time-division multiplexing in the network access protocols, time-varying delays are introduced in the control loop, which degrade the system dynamic performance and are a potential source of instability. The delayed control system is represented by a finite-dimensional, time-varying, discrete-time model which is less complex than the existing continuous-time models for time-varying delays; this approach allows for simpler schemes for analysis and simulation of the ICS.

Ray, Asok↗

Hierarchical, rotation‐equivariant neural networks to select structural models of protein complexes

Abstract Predicting the structure of multi‐protein complexes is a grand challenge in biochemistry, with major implications for basic science and drug discovery. Computational structure prediction methods generally leverage predefined structural features to distinguish accurate structural models from less accurate ones. This raises the question of whether it is possible to learn characteristics of accurate models directly from atomic coordinates of protein complexes, with no prior assumptions. Here we introduce a machine learning method that learns directly from the 3D positions of all atoms to identify accurate models of protein complexes, without using any precomputed physics‐inspired or statistical terms. Our neural network architecture combines multiple ingredients that together enable end‐to‐end learning from molecular structures containing tens of thousands of atoms: a point‐based representation of atoms, equivariance with respect to rotation and translation, local convolutions, and hierarchical subsampling operations. When used in combination with previously developed scoring functions, our network substantially improves the identification of accurate structural models among a large set of possible models. Our network can also be used to predict the accuracy of a given structural model in absolute terms. The architecture we present is readily applicable to other tasks involving learning on 3D structures of large atomic systems.

Eismann, Stephan↗

Communications network design and costing model programmers manual

Otpimization algorithms and techniques used in the communications network design and costing model for least cost route and least cost network problems are examined from the programmer's point of view. All system program modules, the data structures within the model, and the files which make up the data base are described.

Logan, K. P.↗