Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Networking”

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 577 records · Page 32
All sourcesNASA NTRSDOE OSTI
DOE OSTI2014

Sensor Authentication in Collaborating Sensor Networks

In this thesis, we address a new security problem in the realm of collaborating sensor networks. By collaborating sensor networks, we refer to the networks of sensor networks collaborating on a mission, with each sensor network is independently owned and operated by separate entities. Such networks are practical where a number of independent entities can deploy their own sensor networks in multi-national, commercial, and environmental scenarios, and some of these networks will integrate complementary functionalities for a mission. In the scenario, we address an authentication problem wherein the goal is for the Operator O i of Sensor Network S i to correctly determine the number of active sensors in Network Si. Such a problem is challenging in collaborating sensor networks where other sensor networks, despite showing an intent to collaborate, may not be completely trustworthy and could compromise the authentication process. We propose two authentication protocols to address this problem. Our protocols rely on Physically Unclonable Functions, which are a hardware based authentication primitive exploiting inherent randomness in circuit fabrication. Our protocols are light-weight, energy efficient, and highly secure against a number of attacks. To the best of our knowledge, ours is the first to addresses a practical security problem in collaborating sensor networks.

42 ENGINEERING↗
DOE OSTI2025

Enhancing Security and Resiliency in Operational Technology Environments Through Network Slicing and Federated Learning

The growing convergence of Information Technology (IT) and Operational Technology (OT) within Industry 4.0 environments has introduced new demands on industrial network infrastructure. As cyber-physical systems become increasingly interconnected, ensuring the secure, timely, and efficient exchange of critical data is essential. This thesis explores how network slicing, a method of creating isolated virtual network segments, can be applied within OT environments to address challenges such as latency, security, and resource allocation. The first research question addressed in this thesis is: How can OT networks take advantage of NFV and SDN technology to become cyber resilient? This study examines the operational, security, and architectural implications of introducing network slicing into traditionally static OT infrastructures such as Industrial Control Systems (ICS) and SCADA. Through simulated deployments and case studies, the research demonstrates how slicing enables better isolation between critical and non-critical services, thereby improving response time, throughput, and security in sensitive environments. The second question considers: How to dynamically implement network slicing and take advantage of network resources towards integrating decentralized machine learning? In response, this thesis proposes a framework that combines Software-Defined Networking (SDN), Network Function Virtualization (NFV), and Federated Learning (FL) to enable real-time analytics while maintaining data locality. The proposed approach reduces the burden on centralized infrastructure and minimizes privacy risks by supporting on-site training of models across distributed OT nodes, coordinated through dynamically allocated network slices. The third focus explores: How slicing helps to increase the resiliency of OT networks through the orchestration of a dynamic DMZ? To answer this, the thesis presents a method for creating and managing Dynamic Demilitarized Zones (DMZs) using network slicing. This enables flexible and automated isolation of sensitive subsystems during threat scenarios or high-risk operations. Coupled with intelligent orchestration and containerized security services, the dynamic DMZ significantly enhances the system's ability to respond to cyber incidents without halting production. Ultimately, this thesis contributes a comprehensive architecture that blends network slicing with machine learning, secure segmentation, and automation, paving the way for resilient, adaptive, and intelligent OT environments. Performance evaluations across multiple scenarios show improvements in system reliability, threat response time, model accuracy, and resource utilization, providing a strong foundation for future industrial automation systems.

Rodiles Delgado, Brian G↗
DOE OSTI2017

The AmeriFlux network: A coalition of the willing

AmeriFlux scientists were early adopters of a network-enabled approach to ecosystem science that continues to transform the study of land-atmosphere interactions. In the 20 years since its formation, AmeriFlux has grown to include more than 260 flux tower sites in the Americas that support continuous observation of ecosystem carbon, water, and energy fluxes. Many of these sites are co-located within a similar climate regime, and more than 50 have data records that exceed 10 years in length. In this prospective assessment of AmeriFlux's strengths in a new era of network-enabled ecosystem science, we discuss how the longevity and spatial distribution of AmeriFlux data make them exceptionally well suited for disentangling ecosystem response to slowly evolving changes in climate and land-cover, and to rare events like droughts and biological disturbances. More recently, flux towers have also been integrated into environmental observation networks that have broader scientific goals; in North America these include the National Ecological Observatory Network (NEON), Critical Zone Observatory network (CZO), and Long-Term Ecological Research network (LTER). AmeriFlux stands apart from these other networks in its reliance on voluntary participation of individual sites, which receive funding from diverse sources to pursue a wide, transdisciplinary array of research topics. This diffuse, grassroots approach fosters methodological and theoretical innovation, but also challenges network-level data synthesis and data sharing to the network. In conclusion, while AmeriFlux has had strong ties to other regional flux networks and FLUXNET, better integration with networks like NEON, CZO and LTER provides opportunities for new types of cooperation and synergies that could strengthen the scientific output of all these networks.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

Quantifying the generalization error in deep learning in terms of data distribution and neural network smoothness

We report the accuracy of deep learning, i.e., deep neural networks, can be characterized by dividing the total error into three main types: approximation error, optimization error, and generalization error. Whereas there are some satisfactory answers to the problems of approximation and optimization, much less is known about the theory of generalization. Most existing theoretical works for generalization fail to explain the performance of neural networks in practice. To derive a meaningful bound, we study the generalization error of neural networks for classification problems in terms of data distribution and neural network smoothness. We introduce the cover complexity (CC) to measure the difficulty of learning a data set and the inverse of the modulus of continuity to quantify neural network smoothness. A quantitative bound for expected accuracy/error is derived by considering both the CC and neural network smoothness. Although most of the analysis is general and not specific to neural networks, we validate our theoretical assumptions and results numerically for neural networks by several data sets of images. The numerical results confirm that the expected error of trained networks scaled with the square root of the number of classes has a linear relationship with respect to the CC. We also observe a clear consistency between test loss and neural network smoothness during the training process. In addition, we demonstrate empirically that the neural network smoothness decreases when the network size increases whereas the smoothness is insensitive to training dataset size.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

DiagSoftfailure: Automated Soft-Failure Diagnostic Tool Using Machine Learning for Network Users

Network performance problems resulting in slow data communication speed become a significant obstacle for a satisfactory user experience. Currently, there is a lack of an automated diagnostic tool that can help network users to find the complicated network problems that degrade network performance. To fill up this gap, InfoBeyond proposes DiagSoftfailure to provide an automated diagnosis tool. DiagSoftfailure is a machine learning-based approach to infer the location and root cause of network failures that result in performance degradation. As a user-focused tool, it allows a network user to request a diagnosis. DiagSoftfailure can automatically collect the raw packet traces in the network. Base on the network signature, automated classifiers trained by combining supervised and semi-supervised machine learning is used to identify both known and unknown soft-failures in the network. A report allows novice and expert users to understand network problems for troubleshooting. In this document, we describe the DiagSoftfailure diagnosis algorithms and our experiments in a live high-speed network. DiagSoftfailure achieves 96.39% accuracy for known soft-failure diagnosis and 99.82% for unknown soft-failure diagnosis, respectively. Such results demonstrate that DiagSoftfailure is a viable technology. InfoBeyond would develop it as a marketable product that can be used by universities, Labs, DOE, government agencies, organizations, enterprises, and scientific communities to improve their network diagnosis capabilities.

42 ENGINEERING↗
DOE OSTI2023

Updated Application of Frequency of Detection Methods for the INL Site Ambient Air Monitoring Network

This report presents a quantitative assessment of the current INL Site air monitoring network using frequency of detection (FD) methods. The first assessment of the INL network was performed in 2015 and made recommendations for improving the network. As a result of changes made in response to the recommendations and the addition of new source locations, the network was modified and reassessed in 2017. Since 2017, administration of the air sampling program has been consolidated under one contractor, which resulted in additional changes to the network (sampler numbers and locations) and changes in radionuclide detection levels. As a result of these changes and others, an updated assessment of the INL Site ambient air monitoring network was performed. The same two exposure scenarios used in previous assessments were used for this assessment: a resident scenario and a shepherd/rancher scenario. The resident was assumed to be continuously present at their residence/business/farm operation outside the INL Site boundary while the shepherd/rancher was assumed to be present 24-hours at the nearest INL grazing allotment boundary in each of the 22.5-degree sectors along the sector centerline from each source. Updates to both the resident and shepherd/rancher receptor locations were included. Other changes include updates to flow rates for stack sources, expansion of the list of important radionuclides based on the most recent National Emission Standards for Hazardous Pollutants (NESHAPs) analysis, and updated dose coefficients. The assessment was conducted to determine whether the current INL monitoring network is capable of detecting releases of important radionuclides from INL Site sources that have the potential to exceed a conservative dose threshold for the two exposure scenarios. The assessment revealed that for the resident scenario, the current network meets the desired performance objective (FD = 95%) for all radionuclides and sources except for Cl-36 from the TRA-770 stack (94.4%). For the shepherd/rancher scenario, the FD performance objective is met for all radionuclides and sources except tritium from MFC-774 and TAN 679 (91% for both). An investigation of reported emissions for the past three years revealed that Cl 36 is not emitted from TRA-770, and routine tritium emissions from MFC-774 and TAN-679 are very small and the sources are likely incapable of emitting enough tritium to cause a release that should be detectable by the monitoring network. This assessment is based on a conservative dose threshold. This coupled with fact that the FD for Cl 36 is only slightly less than the performance objective and Cl-36 is not emitted from TRA-770, modifying the network (i.e. adding another sampler, increasing sampler flow rate, moving samplers) to meet the 95% performance objective for this radionuclide/source/receptor scenario is not warranted. Similarly, because tritium emissions from MFC-774 and TAN-679 are very small and these two sources are likely incapable of causing a dose due to tritium release that should be detectable by the network, modifications to increase tritium detection for these sources is also unwarranted at this time. However, if it is required to meet the performance objective for tritium for all sources and receptor scenarios, additional analysis determined the FD could be raised from 91% to > 99% for both sources by adding two tritium samplers to the network.

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2021

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

Determining flow directions in river channel networks using planform morphology and topology

Abstract. The abundance of global, remotely sensed surface water observations has accelerated efforts toward characterizing and modeling how water moves across the Earth's surface through complex channel networks. In particular, deltas and braided river channel networks may contain thousands of links that route water, sediment, and nutrients across landscapes. In order to model flows through channel networks and characterize network structure, the direction of flow for each link within the network must be known. In this work, we propose a rapid, automatic, and objective method to identify flow directions for all links of a channel network using only remotely sensed imagery and knowledge of the network's inlet and outlet locations. We designed a suite of direction-predicting algorithms (DPAs), each of which exploits a particular morphologic characteristic of the channel network to provide a prediction of a link's flow direction. DPAs were chained together to create “recipes”, or algorithms that set all the flow directions of a channel network. Separate recipes were built for deltas and braided rivers and applied to seven delta and two braided river channel networks. Across all nine channel networks, the recipe-predicted flow directions agreed with expert judgement for 97 % of all tested links, and most disagreements were attributed to unusual channel network topologies that can easily be accounted for by pre-seeding critical links with known flow directions. Our results highlight the (non)universality of process–form relationships across deltas and braided rivers.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

Evaluating software defined networking solutions to reduce the digital attack surface of nuclear security systems

Most nuclear security systems used today were not designed for today’s threat environment. Systems that were intended to be stand alone are now interconnected. Devices that have a single purpose are built on multi-purpose platforms and communication protocols that, while effective, have no ability to authenticate authorized versus unauthorized commands. These attributes provide an attacker significant ability to affect the system, pivot throughout the interconnected networks, and remain undetected if he/she is able to compromise a single node. Software defined networking (SDN) has been used for years by information technology (IT) cloud service providers to quickly provision or remove servers or other systems to meet changing demand. The same concept has recently been applied to operational technology (OT) systems to enable very fast failover on critical systems that have stringent and deterministic (<5ms) transmit/receive times. By carefully engineering the communication flows through a network using preplanned routes and specific pathways it is possible to achieve deterministic and extremely reliable message delivery even when components fail. This engineering approach to network design has added security benefits including securing the networking control plane, eliminating network scanning and mapping, inhibiting ARP spoofing and host masquerading, eliminating unauthorized network pivoting and enabling greater situational awareness on the network. SDN in OT environments is new but early testing in electrical power and other critical infrastructure has shown it to be a very powerful tool for building reliable networks and reducing the digital attack surface of the network. The authors tested a software defined network switch on a simple physical protection system with components commonly found in nuclear security systems and found improved mitigations to denial of service attacks, lateral movement and network reconnaissance. The paper details the tests and their results.

Cyber security, Nuclear security, software defined↗
DOE OSTI2020

Stochasticity and robustness in spiking neural networks

Despite drawing inspiration from biological systems which are inherently noisy and variable, artificial neural networks have been shown to require precise weights to carry out the task which they are trained to accomplish. This creates a challenge when adapting these artificial networks to specialized execution platforms which may encode weights in a manner which restricts their accuracy and/or precision.Reflecting back on the non-idealities which are observed in biological systems, we investigated the effect these properties have on the robustness of spiking neural networks under perturbations to weights. First, we examined techniques extant in conventional neural networks which resemble noisy processes, and postulated they may produce similar beneficial effects in spiking neural networks. Second, we evolved a set of spiking neural networks utilizing biological non-idealities to solve a pole-balancing task, and estimated their robustness. We showed it is higher in networks using noisy neurons, and demonstrated that one of these networks can perform well under the variance expected when a hafnium-oxide based resistive memory is used to encode synaptic weights. Lastly, we trained a series of networks using a surrogate gradient method on the MNIST classification task. We confirmed that these networks demonstrate similar trends in robustness to the evolved networks. We discuss these results and argue that they display empirical evidence supporting the role of noise as a regularizer which can increase network robustness.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Modeling and dynamical topology properties of VANET based on complex networks theory

Vehicular Ad hoc Network (VANET) is a special subset of multi-hop Mobile Ad hoc Networks in which vehicles can not only communicate with each other but also with the fixed equipments along the roads through wireless interfaces. Recently, it has been discovered that essential systems in real world share similar properties. When they are regarded as networks, among which the dynamic topology structure of VANET system is an important issue. Many real world networks are actually growing with preferential attachment like Internet, transportation system and telephone network. Those phenomena have brought great possibility in finding a strategy to calibrate and control the topology parameters which can help find VANET topology change regulation to relieve traffic jam, prevent traffic accident and improve traffic safety. VANET is a typical complex network which has its basic characteristics. In this paper, we focus on the macroscopic Vehicle-to-Infrastructure (V2I) and Vehicle-to-Vehicle (V2V) inter-vehicle communication network with complex network theory. In particular, this paper is the first one to propose a method analyzing the topological structure and performance of VANET and present the communications in VANET from a new perspective. Accordingly, we propose degree distribution, clustering coefficient and the short path length of complex network to implement our strategy by numerical example and simulation. All the results demonstrate that VANET shows small world network features and is characterized by a truncated scale-free degree distribution with power-law degree distribution. The average path length of the network is simulated numerically, which indicates that the network shows small-world property and is rarely affected by the randomness. What’s more, we carry out extensive simulations of information propagation and mathematically prove the power law property when γ > 2. The results of this study provide useful information for VANET optimization from a macroscopic perspective.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Xylem network connectivity and embolism spread in grapevine( Vitis vinifera L.)

Abstract Xylem networks are vulnerable to the formation and spread of gas embolisms that reduce water transport. Embolisms spread through interconduit pits, but the three-dimensional (3D) complexity and scale of xylem networks means that the functional implications of intervessel connections are not well understood. Here, xylem networks of grapevine (Vitis vinifera L.) were reconstructed from 3D high-resolution X-ray micro-computed tomography (microCT) images. Xylem network performance was then modeled to simulate loss of hydraulic conductivity under increasingly negative xylem sap pressure simulating drought stress conditions. We also considered the sensitivity of xylem network performance to changes in key network parameters. We found that the mean pit area per intervessel connection was constant across 10 networks from three, 1.5-m stem segments, but short (0.5 cm) segments fail to capture complete network connectivity. Simulations showed that network organization imparted additional resistance to embolism spread beyond the air-seeding threshold of pit membranes. Xylem network vulnerability to embolism spread was most sensitive to variation in the number and location of vessels that were initially embolized and pit membrane vulnerability. Our results show that xylem network organization can increase stem resistance to embolism spread by 40% (0.66 MPa) and challenge the notion that a single embolism can spread rapidly throughout an entire xylem network.

Wason, Jay↗
DOE OSTI2025

Throughput Measurements and Profile Analysis of Cloud Networks

Cloud networks utilize virtual connections to connect virtual machines distributed across cloud sites. They are increasingly deployed due to flexible provisioning using software and cost-effectiveness in not requiring to build physical network infrastructure. However, their extensive virtualization makes it unclear how well the established practices of conventional networks translate to them. Here, we study throughput measurements over a Google Cloud network using a matching hardware emulated conventional network, which provide production and exploratory conditions, respectively. The measurements span connections representing local, cross-continental and around the Earth distances. We study the effects of parallel flows, congestion control algorithms and retransmissions on the network throughput profile expressed as a function of RTT. We compare the throughput profile of Google Cloud network with those of emulated network under various loss conditions, including those too disruptive or expensive in the former. Our analysis based on the concave-convex shape and utilization-concavity coefficients of throughput profiles indicates an overall agreement of performance between the two networks, thereby justifying the use of conventional network emulations to analyze cloud networks. In terms of practical use, our study establishes that BBR and BBRv2 alpha TCP achieve higher throughput compared to loss-based congestion control algorithms under most network configurations, especially, under losses at large RTT.

Phanekham, Derek [Southern Methodist Univ., Dallas↗
DOE OSTI2017

Accurate Characterization of Real Networks from Inaccurate Measurements

Our nation's dependence on information networks makes it vital to anticipate disruptions or find weaknesses in these networks. But networks like the Internet are vast, distributed, and there is no mechanism to completely collect their structure. We are restricted to specific data collection schemes (like traceroute samples from router interfaces) that examine tiny portions of such a network. It has been empirically documented and theoretically proven that these measurements have significant biases, and direct inferences from them will be wrong. But these data collection mechanisms have limited flexibility and cannot be easily modified. Moreover, in many applications there are limits on how much data can be collected. How do we make accurate inferences of network properties with biased and limited measurements? The general problem this report deals with is how to work with incompletely observed networks. We will present several different approaches to this problem. First we will present an approach to estimate the degree distribution of a graph by sampling only a small portion of the vertices. This algorithm provides provably accurate results with sublinear samples. An alternative approach would be to try to enhance the information in the by selective collecting new information by probing for neighbors of a vertex or presence of individual edges. A different setting for working with incomplete arises when we have full access to local information, but do not have any global version of the graph. Can we still identify critical nodes in such a graph? We present an approach to identify such nodes efficiently. Finally, how can we put these ideas together to identify the structure of a network? We present an approach that can complement the existing approaches for network mapping. We start with an estimate of network structure based on existing network mapping methods. Then we find a critical router in the network, use the traffic through this network to selectively collect new data to enhance our prediction.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1992

NCC Simulation Model: Simulating the operations of the network control center, phase 2

The simulation of the network control center (NCC) is in the second phase of development. This phase seeks to further develop the work performed in phase one. Phase one concentrated on the computer systems and interconnecting network. The focus of phase two will be the implementation of the network message dialogues and the resources controlled by the NCC. These resources are requested, initiated, monitored and analyzed via network messages. In the NCC network messages are presented in the form of packets that are routed across the network. These packets are generated, encoded, decoded and processed by the network host processors that generate and service the message traffic on the network that connects these hosts. As a result, the message traffic is used to characterize the work done by the NCC and the connected network. Phase one of the model development represented the NCC as a network of bi-directional single server queues and message generating sources. The generators represented the external segment processors. The served based queues represented the host processors. The NCC model consists of the internal and external processors which generate message traffic on the network that links these hosts. To fully realize the objective of phase two it is necessary to identify and model the processes in each internal processor. These processes live in the operating system of the internal host computers and handle tasks such as high speed message exchanging, ISN and NFE interface, event monitoring, network monitoring, and message logging. Inter process communication is achieved through the operating system facilities. The overall performance of the host is determined by its ability to service messages generated by both internal and external processors.

Benjamin, Norman M.↗
NASA NTRS1995

An executable specification for the message processor in a simple combining network

While the primary function of the network in a parallel computer is to communicate data between processors, it is often useful if the network can also perform rudimentary calculations. That is, some simple processing ability in the network itself, particularly for performing parallel prefix computations, can reduce both the volume of data being communicated and the computational load on the processors proper. Unfortunately, typical implementations of such networks require a large fraction of the hardware budget, and so combining networks are viewed as being impractical. The FFP Machine has such a combining network, and various characteristics of the machine allow a good deal of simplification in the network design. Despite being simple in construction however, the network relies on many subtle details to work correctly. This paper describes an executable model of the network which will serve several purposes. It provides a complete and detailed description of the network which can substantiate its ability to support necessary functions. It provides an environment in which algorithms to be run on the network can be designed and debugged more easily than they would on physical hardware. Finally, it provides the foundation for exploring the design of the message receiving facility which connects the network to the individual processors.

Middleton, David↗
NASA NTRS2004

Real-Time Adaptive Color Segmentation by Neural Networks

Artificial neural networks that would utilize the cascade error projection (CEP) algorithm have been proposed as means of autonomous, real-time, adaptive color segmentation of images that change with time. In the original intended application, such a neural network would be used to analyze digitized color video images of terrain on a remote planet as viewed from an uninhabited spacecraft approaching the planet. During descent toward the surface of the planet, information on the segmentation of the images into differently colored areas would be updated adaptively in real time to capture changes in contrast, brightness, and resolution, all in an effort to identify a safe and scientifically productive landing site and provide control feedback to steer the spacecraft toward that site. Potential terrestrial applications include monitoring images of crops to detect insect invasions and monitoring of buildings and other facilities to detect intruders. The CEP algorithm is reliable and is well suited to implementation in very-large-scale integrated (VLSI) circuitry. It was chosen over other neural-network learning algorithms because it is better suited to realtime learning: It provides a self-evolving neural-network structure, requires fewer iterations to converge and is more tolerant to low resolution (that is, fewer bits) in the quantization of neural-network synaptic weights. Consequently, a CEP neural network learns relatively quickly, and the circuitry needed to implement it is relatively simple. Like other neural networks, a CEP neural network includes an input layer, hidden units, and output units (see figure). As in other neural networks, a CEP network is presented with a succession of input training patterns, giving rise to a set of outputs that are compared with the desired outputs. Also as in other neural networks, the synaptic weights are updated iteratively in an effort to bring the outputs closer to target values. A distinctive feature of the CEP neural network and algorithm is that each update of synaptic weights takes place in conjunction with the addition of another hidden unit, which then remains in place as still other hidden units are added on subsequent iterations. For a given training pattern, the synaptic weight between (1) the inputs and the previously added hidden units and (2) the newly added hidden unit is updated by an amount proportional to the partial derivative of a quadratic error function with respect to the synaptic weight. The synaptic weight between the newly added hidden unit and each output unit is given by a more complex function that involves the errors between the outputs and their target values, the transfer functions (hyperbolic tangents) of the neural units, and the derivatives of the transfer functions.

Duong, Tuan A.↗
NASA NTRS2012

NASA Integrated Space Communications Network

The NASA Integrated Network for Space Communications and Navigation (SCaN) has been in the definition phase since 2010. It is intended to integrate NASA s three existing network elements, i.e., the Space Network, Near Earth Network, and Deep Space Network, into a single network. In addition to the technical merits, the primary purpose of the Integrated Network is to achieve a level of operating cost efficiency significantly higher than it is today. Salient features of the Integrated Network include (a) a central system element that performs service management functions and user mission interfaces for service requests; (b) a set of common service execution equipment deployed at the all stations that provides return, forward, and radiometric data processing and delivery capabilities; (c) the network monitor and control operations for the entire integrated network are conducted remotely and centrally at a prime-shift site and rotating among three sites globally (a follow-the-sun approach); (d) the common network monitor and control software deployed at all three network elements that supports the follow-the-sun operations.

Tai, Wallace↗