Search NASA⌕ Search

SEARCH · Search NASA

Results for “Network Design”

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,225 records · Page 68

Cascade Back-Propagation Learning in Neural Networks

The cascade back-propagation (CBP) algorithm is the basis of a conceptual design for accelerating learning in artificial neural networks. The neural networks would be implemented as analog very-large-scale integrated (VLSI) circuits, and circuits to implement the CBP algorithm would be fabricated on the same VLSI circuit chips with the neural networks. Heretofore, artificial neural networks have learned slowly because it has been necessary to train them via software, for lack of a good on-chip learning technique. The CBP algorithm is an on-chip technique that provides for continuous learning in real time. Artificial neural networks are trained by example: A network is presented with training inputs for which the correct outputs are known, and the algorithm strives to adjust the weights of synaptic connections in the network to make the actual outputs approach the correct outputs. The input data are generally divided into three parts. Two of the parts, called the "training" and "cross-validation" sets, respectively, must be such that the corresponding input/output pairs are known. During training, the cross-validation set enables verification of the status of the input-to-output transformation learned by the network to avoid over-learning. The third part of the data, termed the "test" set, consists of the inputs that are required to be transformed into outputs; this set may or may not include the training set and/or the cross-validation set. Proposed neural-network circuitry for on-chip learning would be divided into two distinct networks; one for training and one for validation. Both networks would share the same synaptic weights.

Duong, Tuan A.↗

Assessment of Existing Synchrophasor Networks (Final, Version 0.5)

In 2007-09, DOE worked with NASPI to fund the development of an architecture framework for synchrophasor data networks. That “NASPInet” framework has been the prevailing guidance since that time, and various NASPInet elements were incorporated and tested in several of the SGIG synchrophasor projects. But the NASPInet framework is now outdated; synchrophasor technology has evolved; data volumes are increasing exponentially, and networking technology changes markedly every year. Many of the NASPInet design concepts remain useful, but implementations have fallen short; the NASPInet architecture must be sharpened and projected forward in terms of technology capability to enable the design and deployment of the next generation of synchrophasor data networks. The NASPInet 2.0 project is intended to update the NASPInet framework to address the new technology opportunities and needs for synchrophasor data networks. The main objectives of this project are to assess existing synchrophasor data networks, evaluate current and future networking technologies and synchrophasor network needs, perform a gap analysis, and recommend a path forward and specific technology and design recommendations for the next generation of synchrophasor data networks (henceforth to be called NASPInet 2.0).

97 MATHEMATICS AND COMPUTING↗

Data-Driven Optimal Control of Traffic Signals for Urban Road Networks

This paper studies the issue of data-driven optimal control design for traffic signals of oversaturated urban road networks. The signal control system based on the store and forward model is generally uncontrollable for which the controllable decomposition is needed. Instead of identifying the unknown parameters like saturation rates and turning ratios, a finite number of measured trajectories can be used to parametrize the system and help directly construct a transformation matrix for Kalman controllable decomposition through the fundamental lemma of J. C. Willems. On top of that, an infinite-horizon linear quadratic regulator (LQR) problem is formulated considering the constraints of green times for traffic signals. The problem can be solved through a two-phase data-driven learning process, where one solves an infinite-horizon unconstrained LQR problem and the other solves a finite-horizon constrained LQR problem. The simulation result shows the theoretical analysis is effective and the proposed data-driven controller can yield desired performance for reducing traffic congestion.

Liu, Tong↗

Tailoring Lifetimes and Properties of Carbodiimide-Fueled Covalently Cross-linked Polymer Networks

The mechanical properties of nonequilibrium polymer hydrogels obtained from the transient cross-linking of polymer chains by a chemical fuel were investigated. Aqueous polymers featuring pendant carboxylic acids were treated with a carbodiimide to give anhydride-cross-linked gels. The anhydrides spontaneously hydrolyze back to the polymer solution, and the cycle can be repeated multiple times. Oscillatory rheology was employed to study the effects of temperature, fuel concentration, chain length, and polymer composition on the storage and loss moduli of the polymeric materials as well as the time taken for the polymers to undergo decross-linking. Regardless of the temperature used, at constant carbodiimide concentration, degelation times are more sensitive to experimental temperature than are the peak storage moduli. Decross-linking times decrease with increasing temperature. As carbodiimide concentration decreases, there is a decrease in moduli and decross-linking times. Within the scope of materials studied, the polymer structure was found to have a relatively small impact on the transient properties of gel networks compared to the fuel concentration and temperature. Furthermore, these findings facilitate the design of tunable on-demand networks and gels.

36 MATERIALS SCIENCE↗

A Miniaturized Laser Heterodyne Radiometer for a Global Ground-Based Column Carbon Monitoring Network

We present progress in the development of a passive, miniaturized Laser Heterodyne Radiometer (mini-LHR) that will measure key greenhouse gases (C02, CH4, CO) in the atmospheric column as well as their respective altitude profiles, and O2 for a measure of atmospheric pressure. Laser heterodyne radiometry is a spectroscopic method that borrows from radio receiver technology. In this technique, a weak incoming signal containing information of interest is mixed with a stronger signal (local oscillator) at a nearby frequency. In this case, the weak signal is sunlight that has undergone absorption by a trace gas of interest and the local oscillator is a distributive feedback (DFB) laser that is tuned to a wavelength near the absorption feature of the trace gas. Mixing the sunlight with the laser light, in a fast photoreceiver, results in a beat signal in the RF. The amplitude of the beat signal tracks the concentration of the trace gas in the atmospheric column. The mini-LHR operates in tandem with AERONET, a global network of more than 450 aerosol sensing instruments. This partnership simplifies the instrument design and provides an established global network into which the mini-LHR can rapidly expand. This network offers coverage in key arctic regions (not covered by OCO-2) where accelerated warming due to the release of CO2 and CH4 from thawing tundra and permafrost is a concern as well as an uninterrupted data record that will both bridge gaps in data sets and offer validation for key flight missions such as OCO-2, OCO-3, and ASCENDS. Currently, the only ground global network that routinely measures multiple greenhouse gases in the atmospheric column is TCCON (Total Column Carbon Observing Network) with 18 operational sites worldwide and two in the US. Cost and size of TCCON installations will limit the potential for expansion, We offer a low-cost $30Klunit) solution to supplement these measurements with the added benefit of an established aerosol optical depth measurement. Aerosols induce a radiative effect that is an important modulator of regional carbon cycles. Changes in the diffuse radiative flux fraction (DRF) due to aerosol loading have the potential to alter the terrestrial carbon exchange.

Wilson, Emily L.↗

Joint Estimation of Topology and Injection Statistics in Distribution Grids with Missing Nodes

Optimal operation of distribution grid resources relies on accurate estimation of its state and topology. Practical estimation of such quantities is complicated by the limited presence of real-time meters. This article discusses a theoretical framework to jointly estimate the operational topology and statistics of injections in radial distribution grids under limited availability of nodal voltage measurements. In particular, we show that our proposed algorithms are able to provably learn the exact grid topology and injection statistics at all unobserved nodes as long as they are not adjacent. The algorithm design is based on novel ordered trends in voltage magnitude fluctuations at node groups, that are independently of interest for radial physical flow networks. The complexity of the designed algorithms is theoretically analyzed and their performance is validated using both linearized and nonlinear ac power flow samples in test distribution grids.

97 MATHEMATICS AND COMPUTING↗

Fast GPU-Based Generation of Large Graph Networks From Degree Distributions

Synthetically generated, large graph networks serve as useful proxies to real-world networks for many graph-based applications. The ability to generate such networks helps overcome several limitations of real-world networks regarding their number, availability, and access. Here, we present the design, implementation, and performance study of a novel network generator that can produce very large graph networks conforming to any desired degree distribution. The generator is designed and implemented for efficient execution on modern graphics processing units (GPUs). Given an array of desired vertex degrees and number of vertices for each desired degree, our algorithm generates the edges of a random graph that satisfies the input degree distribution. Multiple runtime variants are implemented and tested: 1) a uniform static work assignment using a fixed thread launch scheme, 2) a load-balanced static work assignment also with fixed thread launch but with cost-aware task-to-thread mapping, and 3) a dynamic scheme with multiple GPU kernels asynchronously launched from the CPU. The generation is tested on a range of popular networks such as Twitter and Facebook, representing different scales and skews in degree distributions. Results show that, using our algorithm on a single modern GPU (NVIDIA Volta V100), it is possible to generate large-scale graph networks at rates exceeding 50 billion edges per second for a 69 billion-edge network. GPU profiling confirms high utilization and low branching divergence of our implementation from small to large network sizes. For networks with scattered distributions, we provide a coarsening method that further increases the GPU-based generation speed by up to a factor of 4 on tested input networks with over 45 billion edges.

97 MATHEMATICS AND COMPUTING↗

Bayesian Entropy Neural Networks for physics-aware prediction

This article addresses the need for deep learning models to integrate well-defined constraints into their outputs, driven by their application in surrogate models, learning with limited data and partial information, and scenarios requiring flexible model behavior to incorporate non-data sample information. We introduce Bayesian Entropy Neural Networks (BENN), a framework grounded in Maximum Entropy (MaxEnt) principles, designed to impose constraints on Bayesian Neural Network (BNN) predictions. BENN is capable of constraining not only the predicted values but also their derivatives and variances, ensuring a more robust and reliable model output. To achieve simultaneous uncertainty quantification and constraint satisfaction, we employ the method of multipliers approach. This allows for the concurrent estimation of neural network parameters and the Lagrangian multipliers associated with the constraints. Our experiments, spanning diverse applications such as beam deflection modeling and microstructure generation, demonstrate the effectiveness of BENN. The results highlight significant improvements over traditional BNNs and showcase competitive performance relative to contemporary constrained deep learning methods.

14 SOLAR ENERGY↗

An Online Reinforcement Learning Controller Design For Mars Ascent Vehicle

This paper presents a neural network (NN) approximator-based online reinforcement learning (ORL) controller design for Mars Ascent Vehicle (MAV) under parametric variation and significant external disturbances. The ORL controller, which does not require any offline training, involves two NNs where an action NN produces optimal short-term control performance while a critic NN evaluates the performance of the action NN using an approximated cost function. The simulation example with comparisons against baseline Proportional-Integral-Derivative (PID) and gain scheduled pole-placement PID (GS-PP-PID) controllers show the proposed controller’s effectiveness and robustness under parametric variation and high external disturbances.

Han Woong Bae↗

Traffic Management in ATM Networks Over Satellite Links

This report presents a survey of the traffic management Issues in the design and implementation of satellite Asynchronous Transfer Mode (ATM) networks. The report focuses on the efficient transport of Transmission Control Protocol (TCP) traffic over satellite ATM. First, a reference satellite ATM network architecture is presented along with an overview of the service categories available in ATM networks. A delay model for satellite networks and the major components of delay and delay variation are described. A survey of design options for TCP over Unspecified Bit Rate (UBR), Guaranteed Frame Rate (GFR) and Available Bit Rate (ABR) services in ATM is presented. The main focus is on traffic management issues. Several recommendations on the design options for efficiently carrying data services over satellite ATM networks are presented. Most of the results are based on experiments performed on Geosynchronous (GEO) latencies. Some results for Low Earth Orbits (LEO) and Medium Earth Orbit (MEO) latencies are also provided.

Goyal, Rohit↗

Compression Analytics for Classification and Anomaly Detection within Network Communication

Here, the flexibility of network communication within Internet protocols is fundamental to network function, yet this same flexibility permits the possibility of malicious use. In particular, malicious behavior can masquerade as benign traffic, thus evading systems designed to catch misuse of network resources. However, perfect imitation of benign traffic is difficult, meaning that small unintentional deviations from normal can occur. Identifying these deviations requires that the defenders know what features reveal malicious behavior. Herein we present an application of compression-based analytics to network communication that can reduce the need for defenders to know a priori what features they need to examine. Motivating the approach is the idea that compression relies on the ability to discover and make use of predictable elements in information, thereby highlighting any deviations between expected and received content. We introduce a so-called “slice compression” score to identify malicious or anomalous communication in two ways. First, we apply normalized compression distances (NCDs) to classification problems and discuss methods for reducing the noise by excising application content (as opposed to protocol features) using slice compression. Second, we present a new technique for anomaly detection, referred to as slice compression for anomaly detection (SCADe). A diverse collection of datasets are analyzed to illustrate the efficacy of the proposed approaches. While our focus is network communication, other types of data are also considered to illustrate the generality of the method.

97 MATHEMATICS AND COMPUTING↗

Design and Development of a Flight Route Modification, Logging, and Communication Network

There is an overwhelming desire to create and enhance communication mechanisms between entities that operate within the National Airspace System. Furthermore, airlines are always extremely interested in increasing the efficiency of their flights. An innovative system prototype was developed and tested that improves collaborative decision making without modifying existing infrastructure or operational procedures within the current Air Traffic Management System. This system enables collaboration between flight crew and airline dispatchers to share and assess optimized flight routes through an Internet connection. Using a sophisticated medium-fidelity flight simulation environment, a rapid-prototyping development, and a unified modeling language, the software was designed to ensure reliability and scalability for future growth and applications. Ensuring safety and security were primary design goals, therefore the software does not interact or interfere with major flight control or safety systems. The system prototype demonstrated an unprecedented use of in-flight Internet to facilitate effective communication with Airline Operations Centers, which may contribute to increased flight efficiency for airlines.

Merlino, Daniel K.↗

Software For Monitoring A Computer Network

SNMAT is rule-based expert-system computer program designed to assist personnel in monitoring status of computer network and identifying defective computers, workstations, and other components of network. Also assists in training network operators. Network for SNMAT located at Space Flight Operations Center (SFOC) at NASA's Jet Propulsion Laboratory. Intended to serve as data-reduction system providing windows, menus, and graphs, enabling users to focus on relevant information. SNMAT expected to be adaptable to other computer networks; for example in management of repair, maintenance, and security, or in administration of planning systems, billing systems, or archives.

Lee, Young H.↗

Water Network Tool for Resilience v. 1.0

WNTR is a python package designed to simulate and analyze resilience of water distribution networks. The software includes: - Pressure driven and demand driven hydraulic simulation - Water quality simulation to track concentration, trace, and water age - Conditional controls to simulate power outages - Models to simulate pipe breaks - A wide range of resilience metrics - Analysis and visualization tools

Source record↗

Development of a space-systems network testbed

This paper describes a communications network testbed which has been designed to allow the development of architectures and algorithms that meet the functional requirements of future NASA communication systems. The central hardware components of the Network Testbed are programmable circuit switching communication nodes which can be adapted by software or firmware changes to customize the testbed to particular architectures and algorithms. Fault detection, isolation, and reconfiguration has been implemented in the Network with a hybrid approach which utilizes features of both centralized and distributed techniques to provide efficient handling of faults within the Network.

Lala, Jaynarayan↗

Development of specifications for surface and subsurface oceanic environmental data

The existing need for synoptic subsurface observations was demonstrated giving special attention to the requirements of meteorology. The current state of synoptic oceanographic observations was assessed; a preliminary design for the Basic Observational Network needed to fulfill the minimum needs of synoptic meteorology and oceanography was presented. There is an existing critical need for such a network in the support of atmospheric modeling and operational meteorological prediction, and through utilization of the regional water mass concept an adequate observational system can be designed which is realistic in terms of cost and effort.

Wolff, P. M.↗

Accelerated Charged Particle Tracking with Graph Neural Networks on FPGAs

We develop and study FPGA implementations of algorithms for charged particle tracking based on graph neural networks. The two complementary FPGA designs are based on OpenCL, a framework for writing programs that execute across heterogeneous platforms, and hls4ml, a high-level-synthesis-based compiler for neural network to firmware conversion. We evaluate and compare the resource usage, latency, and tracking performance of our implementations based on a benchmark dataset. We find a considerable speedup over CPU-based execution is possible, potentially enabling such algorithms to be used effectively in future computing workflows and the FPGA-based Level-1 trigger at the CERN Large Hadron Collider.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Interpretable design of Ir-free trimetallic electrocatalysts for ammonia oxidation with graph neural networks

The electrochemical ammonia oxidation to dinitrogen as a means for energy and environmental applications is a key technology toward the realization of a sustainable nitrogen cycle. The state-of-the-art metal catalysts including Pt and its bimetallics with Ir show promising activity, albeit suffering from high overpotentials for appreciable current densities and the soaring price of precious metals. Herein, the immense design space of ternary Pt alloy nanostructures is explored by graph neural networks trained on ab initio data for concurrently predicting site reactivity, surface stability, and catalyst synthesizability descriptors. Among a few Ir-free candidates that emerge from the active learning workflow, Pt 3 Ru-M (M: Fe, Co, or Ni) alloys were successfully synthesized and experimentally verified to be more active toward ammonia oxidation than Pt, Pt 3 Ir, and Pt 3 Ru. More importantly, feature attribution analyses using the machine-learned representation of site motifs provide fundamental insights into chemical bonding at metal surfaces and shed light on design strategies for high-performance catalytic systems beyond the d-band center metric of binding sites.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗