Results for “network solutions” — Page 23

NASA NTRS2000

Advantages of Parallel Processing and the Effects of Communications Time

Many computing tasks involve heavy mathematical calculations, or analyzing large amounts of data. These operations can take a long time to complete using only one computer. Networks such as the Internet provide many computers with the ability to communicate with each other. Parallel or distributed computing takes advantage of these networked computers by arranging them to work together on a problem, thereby reducing the time needed to obtain the solution. The drawback to using a network of computers to solve a problem is the time wasted in communicating between the various hosts. The application of distributed computing techniques to a space environment or to use over a satellite network would therefore be limited by the amount of time needed to send data across the network, which would typically take much longer than on a terrestrial network. This experiment shows how much faster a large job can be performed by adding more computers to the task, what role communications time plays in the total execution time, and the impact a long-delay network has on a distributed computing system.

Eddy, Wesley M.↗

NASA NTRSDate not supplied

Dynamic Spectrum Allocation in Urban Air Transportation System via Deep Reinforcement Learning

The emerging concepts of Urban Air Mobility (UAM) and Advanced Air Mobility (AAM) open a new paradigm for urban air transportation. A big challenge is that these new aerial vehicles will quickly saturate the already crowded aviation spectrum, which is an essential resource to ensure reliable communications for safe operations. In this paper, we consider an air transportation system where multiple aerial vehicles are operated to transport passengers or cargo from different sources to destinations along their pre-defined paths. During the flight, the minimum communication Quality of Service (QoS) requirement must be achieved to ensure flight safety. Our objective is to minimize the average mission completion time by jointly optimizing the velocity selection and spectrum allocation for all aerial vehicles. We formulate the optimization problem as a multi-stage Markov Decision Process (MDP) where the optimization variables are coupled together. A multi-agent Deep Reinforcement Learning (DRL) based solution is proposed where Value Decomposition Networks (VDN) algorithm is utilized to take discrete actions. Additionally, we propose a heuristic greedy algorithm as a baseline solution. Simulation results show that our learning based solution outperforms the heuristic greedy algorithm and another Orthogonal Multiple Access (OMA) solution in minimizing the mission completion time.

Ruixuan Han↗

NASA NTRSDate not supplied

Dynamic Spectrum Allocation in Urban Air Transportation System via Deep Reinforcement Learning

The emerging concepts of Urban Air Mobility (UAM) and Advanced Air Mobility (AAM) open a new paradigm for urban air transportation. A big challenge is that these new aerial vehicles will quickly saturate the already crowded aviation spectrum, which is an essential resource to ensure reliable communications for safe operations. In this paper, we consider an air transportation system where multiple aerial vehicles are operated to transport passengers or cargo from different sources to destinations along their pre-defined paths. During the flight, the minimum communication Quality of Service (QoS) requirement must be achieved to ensure flight safety. Our objective is to minimize the average mission completion time by jointly optimizing the velocity selection and spectrum allocation for all aerial vehicles. We formulate the optimization problem as a multi-stage Markov Decision Process (MDP) where the optimization variables are coupled together. A multi-agent Deep Reinforcement Learning (DRL) based solution is proposed where Value Decomposition Networks (VDN) algorithm is utilized to take discrete actions. Additionally, we propose a heuristic greedy algorithm as a baseline solution. Simulation results show that our learning based solution outperforms the heuristic greedy algorithm and another Orthogonal Multiple Access (OMA) solution in minimizing the mission completion time.

Ruixuan Han↗

DOE OSTI2024

Approximating accelerator impedances with resonator networks

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

43 PARTICLE ACCELERATORS↗

DOE OSTI2023

Breaking the Window of Detection: Using Multi-Scale Solute Tracer Studies to Assess Mass Recovery at the Detection Limit

Stream solute tracers are commonly injected to assess transport and transformation in study reaches, but results are biased toward the shortest and fastest storage locations. While this bias has been understood for decades, the impact of an experimental constraint on our understanding has yet to be considered. Here, we ask how different our understanding of reach- and segment-scale transport would be if our empirical limits were extended. We demonstrate a novel approach to manipulate experimental conditions and observe mass that is stored at timescales beyond the traditional reach-scale window of detection. We are able to explain the fate of an average of 26% of solute tracer mass that would have been considered as “lost” in a traditional study design across our 14 replicates, extending our detection limits to characterize flowpaths that would have been previously unmeasured. We demonstrate how this formerly lost mass leads to predicting lower magnitudes of gross gains and losses in individual reaches, and ultimately show that the network turnover we infer from solute tracers represents an upper limit on actual, expected behavior. Finally, we review the evolution of tracer studies and their interpretation including this approach and provide a proposed future direction to extend empirical studies to not-before-seen timescales.

54 ENVIRONMENTAL SCIENCES↗

NASA NTRS2002

Ethernet for Space Flight Applications

NASA's Goddard Space Flight Center (GSFC) is adapting current data networking technologies to fly on future spaceflight missions. The benefits of using commercially based networking standards and protocols have been widely discussed and are expected to include reduction in overall mission cost, shortened integration and test (I&T) schedules, increased operations flexibility, and hardware and software upgradeability/scalability with developments ongoing in the commercial world. The networking effort is a comprehensive one encompassing missions ranging from small University Explorer (UNEX) class spacecraft to large observatories such as the Next Generation Space Telescope (NGST). Mission aspects such as flight hardware and software, ground station hardware and software, operations, RF communications, and security (physical and electronic) are all being addressed to ensure a complete end-to-end system solution. One of the current networking development efforts at GSFC is the SpaceLAN (Spacecraft Local Area Network) project, development of a space-qualifiable Ethernet network. To this end we have purchased an IEEE 802.3-compatible 10/100/1000 Media Access Control (MAC) layer Intellectual Property (IP) core and are designing a network node interface (NNI) and associated network components such as a switch. These systems will ultimately allow the replacement of the typical MIL-STD-1553/1773 and custom interfaces that inhabit most spacecraft. In this paper we will describe our current Ethernet NNI development along with a novel new space qualified physical layer that will be used in place of the standard interfaces. We will outline our plans for development of space qualified network components that will allow future spacecraft to operate in significant radiation environments while using a single onboard network for reliable commanding and data transfer. There will be a brief discussion of some issues surrounding system implications of a flight Ethernet. Finally, we will show an onboard network architecture for a proposed new mission using Ethernet for science data transport.

Webb, Evan↗

DOE OSTI2024

Impurity gas detection for SNF canisters using probabilistic deep learning and acoustic sensing *

Abstract Monitoring impurity gases in spent nuclear fuel (SNF) canisters is a novel structural health monitoring approach for SNF in dry storage. The SNF canisters are sealed containers that do not facilitate visual access to the inside. Acoustic sensing can be deployed by taking advantage of the pathways unobstructed by internal hardware. Although the ultrasonic time-of-flight measurement can provide valuable information, it is limited in its ability to discern the concentration of only one impurity gas. As such, deep learning algorithms, particularly convolutional neural networks (CNNs), offer a promising solution. In this study, CNN-based probabilistic deep learning models were implemented to detect and quantify multiple impurity gases in helium. An experimental platform was established to simulate canister conditions, and ultrasonic test data were collected. The presence of argon and air in helium at concentrations ranging from 0% to 1.2% at increments of 0.05% was considered. The multi-layer perceptron, decision tree, and logistic regression classifiers achieved high accuracies when distinguishing pure helium from helium with impurities. CNN with dropout layers and CNN using maximum likelihood estimation showed a similar performance, indicating their ability to capture uncertainties. The ensemble CNN model exhibited improved predictions and the ability to balance individual gas concentration by integrating 1D- and 2D-CNN models. These findings contribute probabilistic deep learning solutions for impurity gas detection and analysis within SNF canisters, thus ensuring safe storage and management of SNFs.

47 OTHER INSTRUMENTATION↗

DOE OSTI2011

Evaluation of Fibrinogen Self-assembly: Role of its alphaC Region

Background: Exposure of cryptic, functional sites on fibrinogen upon its adsorption to hydrophobic surfaces of biomaterials has been linked to an inflammatory response and fibrosis. Such adsorption also induces ordered fibrinogen aggregation which is poorly understood. Objective: To investigate hydrophobic surface-induced fibrinogen aggregation. Methods: Contact and lateral force scanning probe microscopy, yielding topography, image dimensions and fiber elastic modulus measurements were used along with transmission and scanning electron microscopy. Fibrinogen aggregation was induced under non-enzymatic conditions by adsorption on a trioctyl-surface monolayer (trioctylmethylamine) grafted onto silica clay plates. Results: A more than one molecule thick coating was generated by adsorption on the plate from 100 to 200 {mu}g mL{sup -1} fibrinogen solutions, and three-dimensional networks formed from 4 mg mL{sup -1} fibrinogen incubated with uncoated or fibrinogen-coated plates. Fibrils appeared laterally assembled into branching and overlapping fibers whose heights from the surface ranged from approximately 3 to 740 nm. The elastic modulus of fibrinogen fibers was 1.55 MPa. No fibrils formed when fibrinogen lacking {alpha}C-domains was used as a coating or was incubated with intact fibrinogen-coated plates, or when the latter plates were sequentially incubated with anti-A{alpha}529-539 mAb and intact fibrinogen. When an anti-A{alpha}241-476 mAb was used instead, fine, long fibers formed. Similarly, sequential incubations of fibrinogen-coated plates with recombinant {alpha}C-domain (A{alpha}392-610 fragment) or {alpha}C-connector (A{alpha}221-372 fragment) and fibrinogen resulted in distinctly fine fiber networks. Conclusions: Adsorption-induced fibrinogen self-assembly is initiated by a more than one molecule-thick surface layer and eventuates in three-dimensional networks whose formation requires fibrinogen with intact {alpha}C-domains.

60 APPLIED LIFE SCIENCES↗

NASA NTRS1980

Recent research in network problems with applications

The capabilities of network codes and their extensions are surveyed in regard to specially structured integer programming problems which are solved by using the solutions of a series of ordinary network problems.

Thompson, G. L.↗

NASA NTRS1999

Feasibility of Decentralized Linear-Quadratic-Gaussian Control of Autonomous Distributed Spacecraft

A distributed satellite formation, modeled as an arbitrary number of fully connected nodes in a network, could be controlled using a decentralized controller framework that distributes operations in parallel over the network. For such problems, a solution that minimizes data transmission requirements, in the context of linear-quadratic-Gaussian (LQG) control theory, was given by Speyer. This approach is advantageous because it is non-hierarchical, detected failures gracefully degrade system performance, fewer local computations are required than for a centralized controller, and it is optimal with respect to the standard LQG cost function. Disadvantages of the approach are the need for a fully connected communications network, the total operations performed over all the nodes are greater than for a centralized controller, and the approach is formulated for linear time-invariant systems. To investigate the feasibility of the decentralized approach to satellite formation flying, a simple centralized LQG design for a spacecraft orbit control problem is adapted to the decentralized framework. The simple design uses a fixed reference trajectory (an equatorial, Keplerian, circular orbit), and by appropriate choice of coordinates and measurements is formulated as a linear time-invariant system.

Carpenter, J. Russell↗

NASA NTRS1999

Feasibility of Decentralized Linear-Quadratic-Gaussian Control of Autonomous Distributed Spacecraft

A distributed satellite formation, modeled as an arbitrary number of fully connected nodes in a network, could be controlled using a decentralized controller framework that distributes operations in parallel over the network. For such problems, a solution that minimizes data transmission requirements, in the context of linear-quadratic-Gaussian (LQG) control theory, was given by Speyer. This approach is advantageous because it is non-hierarchical, detected failures gracefully degrade system performance, fewer local computations are required than for a centralized controller, and it is optimal with respect to the standard LQG cost function. Disadvantages of the approach are the need for a fully connected communications network, the total operations performed over all the nodes are greater than for a centralized controller, and the approach is formulated for linear time-invariant systems. To investigate the feasibility of the decentralized approach to satellite formation flying, a simple centralized LQG design for a spacecraft orbit control problem is adapted to the decentralized framework. The simple design uses a fixed reference trajectory (an equatorial, Keplerian, circular orbit), and by appropriate choice of coordinates and measurements is formulated as a linear time-invariant system.

Carpenter, J. Russell↗

DOE OSTI2025

Implementing Directive-Based Deferred Execution for Effective Network Aggregation

Remote direct memory access technology provides an efficient mechanism for one-sided communication that can be leveraged to implement a distributed shared memory programming model. However, when applications generate large numbers of small, irregular messages, network congestion often arises. Existing solutions address this small message problem by facilitating message aggregation but typically require disruptive code transformations that detract from the algorithmic intent of applications, or can be limited by dependent operations on aggregated data between synchronisation points. A solution is to use a directive-assisted approach that enables compilers to transform code dependent on aggregated communication for deferred execution. This paper presents an algorithm that a compiler can use to implement and optimise deferred execution for code dependent on aggregated data, based on an "aggregation context" extension for the OpenSHMEM partitioned global address space library. This new capability addresses a key challenge of message aggregation, allowing its full potential to reduce network congestion and enhance programmability to be realised.

Welch, Aaron [ORNL]↗

DOE OSTI2020

Evolving Ensembles of Spiking Neural Networks for Neuromorphic Systems

Evolutionary algorithms have been proposed as a solution to overcome many of the challenges associated with training spiking neural networks. While evolutionary optimization for spiking neural networks is very flexible, its performance has difficulty scaling to complex tasks and correspondingly complex network structures. Here we propose a method for evolving ensembles of spiking neural networks. By using ensemble learning, the flexibility of evolutionary optimization is fully preserved while scaling to more challenging tasks. We test the performance of the proposed method using handwritten digit classification. We investigate multiple strategies for constructing ensembles of spiking neural networks, and demonstrate that evolving ensembles of SNNs offers significant performance advantages over evolutionary optimization.

Elbrecht, Daniel↗

DOE OSTI2025

Efficient Neural Network Approaches for Conditional Optimal Transport with Applications in Bayesian Inference

In this work, we present two neural network approaches that approximate the solutions of static and dynamic conditional optimal transport (COT) problems. Both approaches enable conditional sampling and conditional density estimation, which are core tasks in Bayesian inference—particularly in the simulation-based (“likelihood-free”) setting. Our methods represent the target conditional distribution as a transformation of a tractable reference distribution. Obtaining such a transformation, chosen here to be an approximation of the COT map, is computationally challenging even in moderate dimensions. To improve scalability, our numerical algorithms use neural networks to parameterize candidate maps and further exploit the structure of the COT problem. Our static approach approximates the map as the gradient of a partially input convex neural network. It uses a novel numerical implementation to increase computational efficiency compared to state-of-the-art alternatives. Our dynamic approach approximates the conditional optimal transport via the flow map of a regularized neural ODE; compared to the static approach, it is slower to train but offers more modeling choices and can lead to faster sampling. We demonstrate both algorithms numerically, comparing them with competing state-of-the-art approaches, using benchmark datasets and simulation-based Bayesian inverse problems.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1988

A self-adaptive computational method for transonic turbulent flow past a real projectile

An attempt to develop an effective solution-adaptive computational method for complex unsteady flow problems is reported. The adaptive grid generation technique is critically examined to understand its application to self-adaptive computational procedures. A complex flow problem involving an impulsive Mach 0.96 transonic turbulent flow past a real secant-ogive-cylinder-boattail projectile, including the base flow region at zero angle of attack, is considered. The coupling of the grid generation code to the unsteady Navier-Stokes code makes it possible to generate a new grid network adaptive to the computed solution at every time step.

Hsu, C.-C.↗

NASA NTRS1994

Application of neural networks to unsteady aerodynamic control

The problem under consideration in this viewgraph presentation is to understand, predict, and control the fluid mechanics of dynamic maneuvers, unsteady boundary layers, and vortex dominated flows. One solution is the application of neural networks demonstrating closed-loop control. Neural networks offer unique opportunities: simplify modeling of three dimensional, vortex dominated, unsteady separated flow fields; are effective means for controlling unsteady aerodynamics; and address integration of sensors, controllers, and time lags into adaptive control systems.

Faller, William E.↗

NASA NTRS2003

Mars Digital Image Model 2.1 Control Network

USGS is currently preparing a new version of its global Mars digital image mosaic, which will be known as MDIM 2.1. As part of this process we are completing a new photogrammetric solution of the global Mars control network. This is an improved version of the network established earlier by RAND and USGS personnel, as partially described previously. MDIM 2.1 will have many improvements over earlier Viking Orbiter (VO) global mosaics. Geometrically, it will be an orthoimage product, draped on Mars Orbiter Laser Altimeter (MOLA) derived topography, thus accounting properly for the commonly oblique VO imagery. Through the network being described here it will be tied to the newly defined IAU/IAG 2000 Mars coordinate system via ties to MOLA data. Thus, MDIM 2.1 will provide complete global orthorectified imagery coverage of Mars at the resolution of 1/256 deg of MDIM 2.0, and be compatible with MOLA and other products produced in the current coordinate system.

Archinal, B. A.↗

NASA NTRS1994

Neural Network for Positioning Space Station Solar Arrays

As a shuttle approaches the Space Station Freedom for a rendezvous, the shuttle's reaction control jet firings pose a risk of excessive plume impingement loads on Freedom solar arrays. The current solution to this problem, in which the arrays are locked in a feathered position prior to the approach, may be neither accurate nor robust, and is also expensive. An alternative solution is proposed here: the active control of Freedom's beta gimbals during the approach, positioning the arrays dynamically in such a way that they remain feathered relative to the shuttle jet most likely to cause an impingement load. An artificial neural network is proposed as a means of determining the gimbal angles that would drive plume angle of attack to zero. Such a network would be both accurate and robust, and could be less expensive to implement than the current solution. A network was trained via backpropagation, and results, which compare favorably to the current solution as well as to some other alternatives, are presented. Other training options are currently being evaluated.

Graham, Ronald E.↗