Search NASA⌕ Search

SEARCH · Search NASA

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 1,279 records · Page 71

Variable-Width Datapath for On-Chip Network Static Power Reduction

With the tight power budgets in modern large-scale chips and the unpredictability of application traffic, on-chip network designers are faced with the dilemma of designing for worst- case bandwidth demands and incurring high static power overheads, or designing for an average traffic pattern and risk degrading performance. This paper proposes adaptive bandwidth networks (ABNs) which divide channels and switches into lanes such that the network provides just the bandwidth necessary in each hop. ABNs also activate input virtual channels (VCs) individually and take advantage of drowsy SRAM cells to eliminate false VC activations. In addition, ABNs readily apply to silicon defect tolerance with just the extra cost for detecting faults. For application traffic, ABNs reduce total power consumption by an average of 45percent with comparable performance compared to single-lane power-gated networks, and 33percent compared to multi-network designs.

97 MATHEMATICS AND COMPUTING↗

Neurogenesis Deep Learning: Extending deep networks to accommodate new classes

Neural machine learning methods, such as deep neural networks (DNN), have achieved remarkable success in a number of complex data processing tasks. These methods have arguably had their strongest impact on tasks such as image and audio processing – data processing domains in which humans have long held clear advantages over conventional algorithms. In contrast to biological neural systems, which are capable of learning continuously, deep artificial networks have a limited ability for incorporating new information in an already trained network. As a result, methods for continuous learning are potentially highly impactful in enabling the application of deep networks to dynamic data sets. Here, inspired by the process of adult neurogenesis in the hippocampus, we explore the potential for adding new neurons to deep layers of artificial neural networks in order to facilitate their acquisition of novel information while preserving previously trained data representations. Our results on the MNIST handwritten digit dataset and the NIST SD 19 dataset, which includes lower and upper case letters and digits, demonstrate that neurogenesis is well suited for addressing the stability-plasticity dilemma that has long challenged adaptive machine learning algorithms.

59 BASIC BIOLOGICAL SCIENCES↗

Transcriptomic Network Analysis of Cyanobacterial-Methylotroph Interactions in Coculture and Axenic Conditions

A previous study demonstrated the potential for Cyanobacterial-Methylotroph cocultures to facilitate biogas processing as well as to be used in other biotechnological applications. To advance this technology, we investigated potential interactions between Cyanobacterium stanieri HL-69 (HL69) and Methylotuvimicrobium alkaliphilum 20Z (20Z) by inferring and analyzing gene co-expression networks under co-culture and axenic conditions. Five different co-expression networks were examined. These networks were inferred using gene expression profiles for 20Z axenic condition, HL-69 axenic, HL-69, 20Z coculture, HL-69 coculture, and cross-species HL-69-20Z coculture. Through the analysis of node (gene) betweenness and node normalized degree values in all five network cases, we compared adjustments in gene expression between growth conditions (axenic vs co-culture) as well as identify biological functions relevant to interspecies interactions. This analysis was done to distinguish between gene interactions within an organism and gene interactions between two organisms. Moreover, for all five cases we investigated two different network cutoff levels of 3,000 and 10,000. By shedding light on inter- and intra- species interactions, we hope to gain a better understanding of how these two organisms interact. This research will allow the investigation of further biotechnological applications of coculture systems and optimization of such applications for biotechnological purposes.

59 BASIC BIOLOGICAL SCIENCES↗

Ergodicity, lack thereof, and the performance of reservoir computing with memristive networks and nanowire

Networks composed of nanoscale memristive components, such as nanowire and nanoparticle networks, have recently received considerable attention because of their potential use as neuromorphic devices. In this study, we explore ergodicity in memristive networks, showing that the performance on machine leaning tasks improves when these networks are tuned to operate at the edge between two global stability points. We find this lack of ergodicity is associated with the emergence of memory in the system. We measure the level of ergodicity using the Thirumalai-Mountain metric, and we show that in the absence of ergodicity, two different memristive network systems show improved performance when utilized as reservoir computers (RC). We highlight that it is also important to let the system synchronize to the input signal in order for the performance of the RC to exhibit improvements over the baseline.

97 MATHEMATICS AND COMPUTING↗

Detecting and Blocking Network Attacks at Ultra High Speeds

Stateful, in-depth, in-line traffic analysis for intrusion detection and prevention has grown increasingly more difficult as the data rates of modern networks rise. One point in the design space for high-performance network analysis - pursued by a number of commercial products - is the use of sophisticated custom hardware. For very high-speed processing, such systems often cast the entire analysis process in ASICs. This project pursued a different architectural approach, which we term Shunting. Shunting marries a conceptually quite simple hardware device with an Intrusion Prevention System (IPS) running on commodity PC hardware. The overall design goal is was to keep the hardware both cheap and readily scalable to future higher speeds, yet also retain the unparalleled flexibility that running the main IPS analysis in a full general-computing environment provides. The Shunting architecture we developed uses a simple in-line hardware element that maintains several large state tables indexed by packet header fields, including IP/TCP flags, source and destination IP addresses, and connection tuples. The tables yield decision values the element makes on a packet-by-packet basis: forward the packet, drop it, or divert ('shunt') it through the IPS (the default). By manipulating table entries, the IPS can, on a fine-grained basis: (i) specify the traffic it wishes to examine, (ii) directly block malicious traffic, and (iii) 'cut through' traffic streams once it has had an opportunity to 'vet' them, or (iv) skip over large items within a stream before proceeding to further analyze it. For the Shunting architecture to yield benefits, it needs to operate in an environment for which the monitored network traffic has the property that - after proper vetting - much of it can be safely skipped. This property does not universally hold. For example, if a bank needs to examine all Web traffic involving its servers for regulatory compliance, then a monitor in front of one of the bank's server farms cannot safely omit a subset of the traffic from analysis. In this environment, Shunting cannot realize its main performance benefits, and the monitoring task likely calls for using custom hardware instead. However, in many other environments we find Shunting holds promise for delivering major performance gains. This arises due to the the widely documented 'heavy tail' nature of most forms of network traffic, which we might express as 'a few of the connections carry just about all the bytes.' The key additional insight is '... and very often for these few large connections, the very beginning of the connection contains nearly all the information of interest from a security analysis perspective.' We argue that this second claim holds because it is at the beginning of connections that authentication exchanges occur, data or file names and types are specified, request and reply status codes conveyed, and encryption is negotiated. Once these occur, we have seen most of the interesting facets of the dialog. Certainly the remainder of the connection might also yield some grist for analysis, but this is generally less likely, and thus if we want to lower analysis load at as small a loss as possible of information relevant to security analysis, we might best do so by skipping the bulk of large connections. In a different context, the 'Time Machine' work by Kornexl and colleagues likewise shows that in some environments we can realize major reductions in the volume of network traffic processed, by limiting the processing to the first 10-20 KB of each connection. As a concrete example, consider an IPS that monitors SSH traffic. When a new SSH connection arrives and the Shunt fails to find an entry for it in any of its tables (per-address, per-port, per-connection), it executes the default action of diverting the connection through the IPS. The IPS analyzes the beginning of the connection in this fashion. As long as it is satisified with the dialog, it reinjects the packets forwarded to it so that the connection can continue. If the connection successfully negotiates encryption, the IPS can no longer profitably analyze it, so it downloads a per-connection table entry to the Shunt specifying that the action for the connection in the future is 'forward.' For heavy-tailed connections, this means a very large majority of the connection's packets will now pass through the Shunt device without burdening the IPS with any further analysis load. On the other hand, if the IPS is dissatisfied with some element of the initial dialog, it downloads a 'drop' entry to terminate the connection. Note that by providing for reinjection, we can promote an intrusion detection system into an intrusion prevention system, one that does not merely detect attacks but can block them before they complete. Reinjection also allows the IPS to normalize traffic to remove ambiguities that attackers can leverage to evade the IPS.

99 GENERAL AND MISCELLANEOUS↗

Protein Network Signatures Associated with Exogenous Biofuels Treatments in Cyanobacterium Synechocystis sp. PCC 6803

Although recognized as a promising microbial cell factory for producing biofuels, current productivity in cyanobacterial systems is low. To make the processes economically feasible, one of the hurdles, which need to be overcome is the low tolerance of hosts to toxic biofuels. Meanwhile, little information is available regarding the cellular responses to biofuels stress in cyanobacteria, which makes it challenging for tolerance engineering. Using large proteomic datasets of Synechocystis under various biofuels stress and environmental perturbation, a protein co-expression network was first constructed and then combined with the experimentally determined protein–protein interaction network. Proteins with statistically higher topological overlap in the integrated network were identified as common responsive proteins to both biofuels stress and environmental perturbations. In addition, a weighted gene co-expression network analysis was performed to distinguish unique responses to biofuels from those to environmental perturbations and to uncover metabolic modules and proteins uniquely associated with biofuels stress. The results showed that biofuel-specific proteins and modules were enriched in several functional categories, including photosynthesis, carbon fixation, and amino acid metabolism, which may represent potential key signatures for biofuels stress responses in Synechocystis. Network-based analysis allowed determination of the responses specifically related to biofuels stress, and the results constituted an important knowledge foundation for tolerance engineering against biofuels in Synechocystis.

60 APPLIED LIFE SCIENCES↗

Editorial: Edge computation and digital distribution networks

The development of digital technologies is penetrating all areas of energy revolution. Based on the in-depth integration of advanced digital technologies, distribution networks are gradually transforming into digital distribution networks (DDNs) with tremendous changes from the structure to the operation mode. DDNs is the digitalized appearance of the physical distribution network, in which ubiquitous connections and massive data are the basic characteristics (Huo et al., 2022). It is an important task to utilize the massive data and propose novel operation modes to construct more efficient and intelligent distribution networks (Jian et al., 2022). Among the advanced digital technologies in DDNs, edge computing has received wide attention (Zhao et al., 2022). It has superior performance in local sensing and intelligent computation, which can effectively relieve huge communication pressure. However, the limited computing resources and the complex computing tasks at the edge side significantly challenge the collaboration of distribution network regulation and advanced digital technologies (Hu et al., 2022). It is necessary to find out proper methods to utilize advanced digital technology to construct DDNs. This Research Topic is organized to introduce the recent progress in the construction, operation and advanced computational methods for DDNs. Finally, seven papers have been accepted, which can be sorted into the following three categories: 1) Evolution and technical features of DDNs, 2) Intelligent operation control of DDNs, 3) Advanced simulation for large-scale DDNs. The three sections below respectively introduce the major research and contributions of the papers covered in each category.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Principles of robust innate immune response to viral infections: a multiplex network analysis

The human innate immune response, particularly the type-I interferon (IFN) response, is highly robust and effective first line of defense against virus invasion. IFN molecules are produced and secreted frominfected cells upon virus infection and recognition. They then act as signaling/communicationmolecules to activate an antiviral response in neighboring cells so that those cells become refractory to infection. Previous experimental studies have identified the detailed molecular mechanisms for the IFN signaling and response. However, the principles underlying how host cells use IFN to communicate with each other to collectively and robustly halt an infection is not understood. Here we take a multiplex network modeling approach to provide a theoretical framework to identify key factors that determine the effectiveness of the IFN response against virus infection of a host. In this approach, we consider the virus spread among host cells and the interferon signaling to protect host cells as a competition process on a two-layer multiplex network. We focused on two types of network topology, i.e., the Erdős-Rényi (ER) network and the Geometric Random (GR) network, which represent the scenarios when infection of cells is mostly well mixed (e.g., in the blood) and when infection is spatially segregated (e.g., in tissues), respectively.We show that in general, the IFN response works effectively to stop viral infection when virus infection spreads spatially (a most likely scenario for initial virus infection of a host at the peripheral tissue). Importantly, we show that the effectiveness of the IFN response is robust against large variations in the distance of IFN diffusion as long as IFNs diffuse faster than viruses and they can effectively induce antiviral responses in susceptible host cells. This suggests that the effectiveness of the IFN response is insensitive to the specific arrangement of host cells in peripheral tissues. Thus, our work provides a quantitative explanation of why the IFN response can serve an effective and robust response in different tissue types to a wide range of viral infections of a host.

59 BASIC BIOLOGICAL SCIENCES↗

Distributed Energy Management for Networked Microgrids with Hardware-in-the-Loop Validation

For the cooperative operation of networked microgrids, a distributed energy management considering network operational objectives and constraints is proposed in this work. Considering various ownership and privacy requirements of microgrids, utility directly interfaced distributed energy resources (DERs) and demand response, a distributed optimization is proposed for obtaining optimal network operational objectives with constraints satisfied through iteratively updated price signals. The alternating direction method of multipliers (ADMM) algorithm is utilized to solve the formulated distributed optimization. The proposed distributed energy management provides microgrids, utility-directly interfaced DERs and responsive demands the opportunity of contributing to better network operational objectives while preserving their privacy and autonomy. Results of numerical simulation using a networked microgrids system consisting of several microgrids, utility directly interfaced DERs and responsive demands validate the soundness and accuracy of the proposed distributed energy management. The proposed method is further tested on a practical two-microgrid system located in Adjuntas, Puerto Rico, and the applicability of the proposed strategy is validated through hardware-in-the-loop (HIL) testing.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Networked Microgrid Energy Management Considering Ownership and Control Structures: A Comparison

With the growing deployment of microgrids, networked microgrids have emerged for their additional advantages of economy, reliability and resilience by coordinating the operation of multiple microgrids. As microgrids are operated with different ownership, objectives and functionalities, the formed networked microgrids show characteristics of mixed ownership, inconsistent objectives and various functionalities. To enable the coordinated operation of networked microgrids, three control structures, i.e., centralized, distributed and decentralized, have been constructed in the literature. However, the data sharing enabling these different paradigms and the resulted value propositions are not well defined, leading to poor resource management and resilience, etc. To solve this issue, a complete comparison of networked microgrid energy management under centralized, distributed and decentralized structures are performed. As a novel contribution, the required minimum data exchange of networked microgrid energy management under three control structures are identified, respectively. The value propositions are calculated and compared against each other by the results of case studies.

control structures↗

Automated Detection of Instability-Inducing Channel Geometry Transitions in Saint-Venant Simulation of Large-Scale River Networks

A new sweep-search algorithm (SSA) is developed and tested to identify the channel geometry transitions responsible for numerical convergence failure in a Saint-Venant equation (SVE) simulation of a large-scale open-channel network. Numerical instabilities are known to occur at “sharp” transitions in discrete geometry, but the identification of problem locations has been a matter of modeler’s art and a roadblock to implementing large-scale SVE simulations. The new method implements techniques from graph theory applied to a steady-state 1D shallow-water equation solver to recursively examine the numerical stability of each flowpath through the channel network. The SSA is validated with a short river reach and tested by the simulation of ten complete river systems of the Texas–Gulf Coast region by using the extreme hydrological conditions recorded during hurricane Harvey. The SSA successfully identified the problematic channel sections in all tested river systems. Subsequent modification of the problem sections allowed stable solution by an unsteady SVE numerical solver. The new SSA approach permits automated and consistent identification of problem channel geometry in large open-channel network data sets, which is necessary to effectively apply the fully dynamic Saint-Venant equations to large-scale river networks or for city-wide stormwater networks.

54 ENVIRONMENTAL SCIENCES↗

Complex networks as a unified framework for descriptive analysis and predictive modeling in climate

The analysis of climate data has relied heavily on hypothesis-driven statistical methods, while projections of future climate are based primarily on physics-based computational models. However, in recent years a wealth of new datasets has become available. Therefore, we take a more data-centric approach and propose a unified framework for studying climate, with an aim towards characterizing observed phenomena as well as discovering new knowledge in the climate domain. Specifically, we posit that complex networks are well-suited for both descriptive analysis and predictive modeling tasks. We show that the structural properties of climate networks have useful interpretation within the domain. Further, we extract clusters from these networks and demonstrate their predictive power as climate indices. Our experimental results establish that the network clusters are statistically significantly better predictors than clusters derived using a more traditional clustering approach. Using complex networks as data representation thus enables the unique opportunity for descriptive and predictive modeling to inform each other.

99 GENERAL AND MISCELLANEOUS↗

On-demand Overlay Networks for Large Scientific Data Transfers

Large scale scientific data transfers are central to scientific processes. Data from large experimental facilities have to be moved to local institutions for analysis or often data needs to be moved between local clusters and large supercomputing centers. In this paper, we propose and evaluate a network overlay architecture to enable highthroughput, on-demand, coordinated data transfers over wide-area networks. Our work leverages Phoebus and On-demand Secure Circuits and AdvanceReservation System (OSCARS) to provide high performance wide-area network connections. OSCARS enables dynamic provisioning of network paths with guaranteed bandwidth and Phoebus enables the coordination and effective utilization of the OSCARS network paths. Our evaluation shows that this approach leads to improved end-to-end data transfer throughput with minimal overheads. The achievedthroughput using our overlay was limited only by the ability of the end hosts to sink the data.

97 MATHEMATICS AND COMPUTING↗

The dynamics and stratigraphy of distributary channel networks (Final Technical Report)

Sedimentary reservoirs are frequently composed of the deposits of distributary channel networks. These networks are associated with coarse sediments (and high permeability) within the channel network, and relatively fine sediments (and low permeability) outside the channel network. The shape of the network is complex, and a product of the environmental boundary conditions under which it grows (Figure 1). These systems control heterogeneity at small and large scales within sedimentary basins, and understanding this heterogeneity and the links between scales represents the important scientific frontier addressed by this project.

58 GEOSCIENCES↗

Zapiary: Creating Visibility in IOT Networks

Zigbee and Z-Wave are the main networking protocols used by low-power Internet of Things (IOT) devices. These protocols use low frequencies. Mesh architecture, and unique address formats that make them not compatible with traditional network traffic tools like IX-Discovery Tools. Zapiary is a software that takes CSV files with Zigbee and Z-Wave traffic and generates Structured Threat Information eXpression (STIX) JSON bundles illustrating the communication within IOT networks. The bundles can then be viewed within Structured Threat Intelligence Graph (STIG) or used with AI/ML models to provide deeper visibility into nodes that make up the network and the ability to trend the mesh network over time.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Alerts Analysis and Visualization in Network-based Intrusion Detection Systems

The alerts produced by network-based intrusion detection systems, e.g. Snort, can be difficult for network administrators to efficiently review and respond to due to the enormous number of alerts generated in a short time frame. This work describes how the visualization of raw IDS alert data assists network administrators in understanding the current state of a network and quickens the process of reviewing and responding to intrusion attempts. The project presented in this work consists of three primary components. The first component provides a visual mapping of the network topology that allows the end-user to easily browse clustered alerts. The second component is based on the flocking behavior of birds such that birds tend to follow other birds with similar behaviors. This component allows the end-user to see the clustering process and provides an efficient means for reviewing alert data. The third component discovers and visualizes patterns of multistage attacks by profiling the attacker s behaviors.

97 MATHEMATICS AND COMPUTING↗

Multidimensional Distributional Neural Network Output Demonstrated in Super‐Resolution of Surface Wind Speed

Accurate quantification of uncertainty in neural network predictions remains a central challenge for scientific applications involving high-dimensional, correlated data. While existing methods capture either aleatoric or epistemic uncertainty, few offer closed-form, multidimensional distributions that preserve spatial correlation while remaining computationally tractable. In this work, we present a framework for training neural networks with a multidimensional Gaussian loss, generating a closed-form predictive distribution over outputs informed by non-identically distributed training data. Our approach captures aleatoric uncertainty by iteratively estimating the means and covariance matrices, and is demonstrated on a super-resolution example out-of-training-sample. We leverage a Fourier representation of the covariance matrix to stabilize network training and preserve spatial correlation. We introduce a novel regularization strategy—referred to as information sharing—that interpolates between image-specific and global covariance estimates, enabling convergence of the super-resolution downscaling network trained on image-specific distributional loss functions. This framework allows for efficient sampling, explicit correlation modeling, and extensions to more complex distribution families all without disrupting prediction performance. We demonstrate the method on a surface wind speed downscaling task and discuss its broader applicability to uncertainty-aware prediction in scientific models.

17 WIND ENERGY↗

SPIKANs: separable physics-informed Kolmogorov–Arnold networks

Physics-Informed Neural Networks (PINNs) have emerged as a promising method for solving partial differential equations (PDEs) in scientific computing. While PINNs typically use multilayer perceptrons (MLPs) as their underlying architecture, recent advancements have explored alternative neural network structures. One such innovation is the Kolmogorov–Arnold Network (KAN), which has demonstrated benefits over traditional MLPs, including faster neural scaling and better interpretability. The application of KANs to physics-informed learning has led to the development of Physics-Informed KANs (PIKANs), enabling the use of KANs to solve PDEs. However, despite their advantages, KANs often suffer from slower training speeds, particularly in higher-dimensional problems where the number of collocation points grows exponentially with the dimensionality of the system. To address this challenge, we introduce Separable Physics-Informed Kolmogorov–Arnold Networks (SPIKANs). This novel architecture applies the principle of separation of variables to PIKANs, decomposing the problem such that each dimension is handled by an individual KAN. This approach drastically reduces the computational complexity of training without sacrificing accuracy, facilitating their application to higher-dimensional PDEs. Through a series of benchmark problems, we demonstrate the effectiveness of SPIKANs, showcasing their superior scalability and performance compared to PIKANs and highlighting their potential for solving complex, high-dimensional PDEs in scientific computing.

Kolmogorov-Arnold networks↗