Search NASA⌕ Search

SEARCH · Search NASA

Results for “COMPUTING NETWORK”

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 91 records · Page 5

Cybersecurity Vulnerability Assessment Methodologies for Nuclear Power Plants

As any mechanical system ages, broken or outdated parts must be replaced; nuclear power plants (NPPs) are no different. The average age of a NPP in the United States' aging fleet of commercial reactors is 35 years, with many of these plants operating under extensions of their original licenses. These plants, originally designed in the 1960's and 1970's, are controlled by analog instrumentation and control (I and C) systems, and have since been upgraded (to varying degrees) to hybrid analog-digital systems. As these NPPs are upgraded to continue operating and to meet more stringent safety requirements imposed by the Nuclear Regulatory Commission (NRC), the implementation of digital systems to monitor and run the power plant introduces new vulnerabilities that must be addressed. The main objectives of a vulnerability assessment (VA) are to identify, quantify, and prioritize all of the susceptibilities inherent in a system. This allows for all weaknesses to be analyzed, and for the most serious concerns to be addressed first. Traditional VA methodologies deal with the analysis of physical systems associated with the NPP; with the introduction of digital control systems and computer networks, these methodologies must be expanded to include these fundamentally different systems and vulnerability concerns. Digital systems have been used in NPPs since the 1980's, but only for non-safety control systems; attacks on these systems were not deemed consequential, and no dedicated VA methodology was required. However, 'all new NPPs are being designed with integrated digital instrumentation and control systems as the backbone of protection, controls, alarms, and display and monitoring'. This gives rise to new vulnerabilities such as disrupted data displays, the suppression of critical alarms, or unauthorized access to secure systems from connected networks. The NRC released formal cybersecurity regulations in March 2009 (10 CFR 73.54), as well as a guide for the program in January 2010 (RG 5.71). However, the regulations and guide provide limited insight on how to identify these vulnerabilities; the focus is on remediating them once found. Hence, there is a need for a comprehensive, systematic methodology to conduct a VA on digital computer and communications and network systems. In this paper, we review traditional VA methodologies and discuss relevant cases. Then we discuss challenges to vulnerabilities within the context of modernization of the fleet and what needs to be done to address this issue.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

An Overview of the Usefulness of Machine Learning Techniques on Network Packet Data

Understanding the health and behavior of a computer network allows for better network efficiency and security. We present an overview of various machine learning techniques for classifying network packet data via packet metadata. While some classical machine learning approaches achieve reasonable results, the most accurate classification can be achieved with deep learning. On the four data sets studied herein, a basic deep learning model achieved at or near 100\% classification accuracy. We also propose a method for determining variable importance as a means for potential transfer learning applications to classifying yet unseen network packet data.

97 MATHEMATICS AND COMPUTING↗

Challenges in Long-Term Records Preservation and Access - 19549

The US Department of Energy Office of Legacy Management (LM) mission includes preserving records and information about the nation's Cold War-era weapons projects and making that information available for years to come. As LM assumes responsibility for each project, records documenting operations and cleanup activities are absorbed into a central recordkeeping system. Each record category is governed by a federal retention requirement. Routine administrative records are kept just a few years, while the most important records have 'permanent' retention requirements and are transferred to the National Archives typically within 25 years of creation. It is relatively easy for LM to meet retention requirements for these routine and permanent records. LM's big preservation challenge is with records with tremendously long retention requirements. Records with 75-year retention requirements are common, and a small subset of LM records pertaining to waste disposal requires 150-year retention periods. LM must consider the best format for maintaining each of its records collections. Should physical records be boxed up for long-term storage, or should they be digitized? Each option has associated benefits, costs, and risks. Keeping records in paper format avoids digitizing expense and preserves the original media, but the paper must be maintained in a certified storage facility. A vermin infestation or sprinkler malfunction at a certified facility may be rare but could easily destroy records. Keeping the paper and making reference or backup electronic copies reduces the risk of loss but requires diligence and resources to keep the physical records and electronic versions synchronized. This becomes an overwhelming task in a database with millions of records. Entirely replacing paper records with digitized versions as electronic records introduces the risk that records could be lost due to a cybersecurity incident or made inaccessible by evolving technology. LM's early electronic records management efforts were limited to documents saved to PDF format. More recently, LM has embraced the benefits of maintaining records in native formats. (A spreadsheet includes formulas and other details lost when converted to a PDF file.) But whether the file is saved as a Microsoft Excel spreadsheet or PDF document, how do we ensure the file is readable in 75 or 150 years when these records meet their retention requirement? We have no way of knowing for sure from our 2019 vantage point-no more than we would expect to get good technology advice from someone 150 years ago. We cannot predict the technological future, but we can make sure our current electronic records environment is healthy and future ready. This includes making sure the electronic recordkeeping system is built on a modern platform and ensuring that each record in the system is saved in a current format. Quality standards are critical for electronic records to be future ready. Implementing quality involves an organization-wide approach to having consistently formatted file names and complete and descriptive metadata. Quality PDF documents are scanned to settings that ensure characters are machine-readable (with optical character recognition, or OCR). LM is currently replacing its electronic recordkeeping system and simultaneously modernizing its organizational approach to data management; it is replacing a traditional electronic records repository with a system that also manages records stored anywhere across the computer network. This new records management approach will require new thinking in how LM manages a dramatically increased volume of information across the network while not losing focus on its responsibility for long-term records preservation and access. (author)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

A Bayesian Deep Learning Approach to Near-Term Climate Prediction

Since model bias and associated initialization shock are serious shortcomings that reduce prediction skills in state-of-the-art decadal climate prediction efforts, we pursue a complementary machine-learning-based approach to climate prediction. The example problem setting we consider consists of predicting natural variability of the North Atlantic sea surface temperature on the interannual timescale in the pre-industrial control simulation of the Community Earth System Model. While previous works have considered the use of recurrent networks such as convolutional LSTMs and reservoir computing networks in this and other similar problem settings, we currently focus on the use of feedforward convolutional networks. In particular, we find that a feedforward convolutional network with a Densenet architecture is able to outperform a convolutional LSTM in terms of predictive skill. Next, we go on to consider a probabilistic formulation of the same network based on Stein variational gradient descent and find that in addition to providing useful measures of predictive uncertainty, the probabilistic (Bayesian) version improves on its deterministic counterpart in terms of predictive skill. Finally, we characterize the reliability of the ensemble of machine learning models obtained in the probabilistic setting by using analysis tools developed in the context of ensemble numerical weather prediction.

54 ENVIRONMENTAL SCIENCES↗

Evolving bipartite authentication graph partitions

As large scale enterprise computer networks become more ubiquitous, finding the appropriate balance between user convenience and user access control is an increasingly challenging proposition. Suboptimal partitioning of users’ access and available services contributes to the vulnerability of enterprise networks. Previous edge-cut partitioning methods unduly restrict users’ access to network resources. This paper introduces a novel method of network partitioning superior to the current state-of-the-art which minimizes user impact by providing alternate avenues for access that reduce vulnerability. Networks are modeled as bipartite authentication access graphs and a multi-objective evolutionary algorithm is used to simultaneously minimize the size of large connected components while minimizing overall restrictions on network users. Lastly, results are presented on a real world data set that demonstrate the effectiveness of the introduced method compared to previous naive methods.

97 MATHEMATICS AND COMPUTING↗

SoS-SDQN: System of Systems Software-defined Quantum Networking

Quantum networks are needed for quantum domain applications that may run across different network deployments - point-to-point, multi-node networks, and possibly across inter-domain quantum networks, like the quantum internet. Unlike classical computing networks, quantum networks involve heterogeneous systems nodes that currently require local and manual control. This needs a unified control approach to help them integrate, work seamlessly, and have global knowledge. Software-defined Networking (SDN) has been successfully leveraged in classical networking for seamless and software-driven control of network infrastructure and packet switching, but not in management of quantum network applications across heterogeneous systems. In this paper, we review the current state of the art and present early developments of a System-of-Systems Software-defined Quantum Networking architecture (SoS-SDQN), a generic architecture that supports software-driven quantum network experiments across heterogeneous quantum systems. The architecture modifies the generic SDN to address the domain requirements of quantum networks and proposes a multilevel SDQN to provide a global view of network status, running applications, and control of incorporated heterogeneous quantum systems. We also design and implement a SoS SouthBound Quantum Interface (SoS-SBQI), a quantum infrastructure protocol that abstracts automation of applications across the network.

Alnajjar, Anees [ORNL] (ORCID:0000000237101601)↗

Alfvén eigenmode classification based on ECE diagnostics at DIII-D using deep recurrent neural networks

Modern tokamaks have achieved significant fusion production, but further progress towards steady-state operation has been stymied by a host of kinetic and MHD instabilities. Control and identification of these instabilities is often complicated, warranting the application of data-driven methods to complement and improve physical understanding. In particular, Alfvén eigenmodes are a class of ubiquitous mixed kinetic and MHD instabilities that are important to identify and control because they can lead to loss of confinement and potential damage to the walls of a plasma device. In the present work, we use reservoir computing networks to classify Alfvén eigenmodes in a large labeled database of DIII-D discharges, covering a broad range of operational parameter space. However, despite the large parameter space, we show excellent classification and prediction performance, with an average hit rate of 91% and false alarm ratio of 7%, indicating promise for future implementation with additional diagnostic data and consolidation into a real-time control strategy.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

How Data Becomes Physics: Inside the RACF

The RHIC & ATLAS Computing Facility (RACF) at the U.S. Department of Energy’s (DOE) Brookhaven National Laboratory sits at the center of a global computing network. It connects more than 2,500 researchers around the world with the data generated by millions of particle collisions taking place each second at Brookhaven Lab's Relativistic Heavy Ion Collider (RHIC, a DOE Office of Science User Facility for nuclear physics research), and the ATLAS experiment at the Large Hadron Collider in Europe. Watch this video to learn how the people and computing resources of the RACF serve these scientists to turn petabytes of raw data into physics discoveries.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A system for monitoring the radiation effects of a proton linear accelerator

The system for real-time monitoring of radioactivity of a high-current proton linear accelerator detects secondary neutron emission from proton beam losses in transport channels and measures the activity of radionuclides in gas and aerosol emissions and the radiation background in the environment affected by a linear accelerator. The data provided by gamma, beta, and neutron detectors are transferred over a computer network to the central server. The system allows one to monitor proton beam losses, the activity of gas and aerosol emissions, and the radiation emission level of a linear accelerator in operation.

07 ISOTOPE AND RADIATION SOURCES↗

GPU Lifetimes on Titan Supercomputer: Survival Analysis and Reliability

George Ostrouchov, Don Maxwell, Rizwan Ashraf, Mallikarjun Shankar, and James Rogers. 2020. GPU Lifetimes on Titan Supercomputer: Survival Analysis and Reliability. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC '20). Association for Computing Machinery, New York, NY, USA. Data and code for SC20 paper about Titan GPU reliability analysis: https://github.com/olcf/TitanGPULife. Includes R code to generate graphics for paper and additional analyses. See code/README for instructions. Includes original Titan GPU reliability data on over 100,000 collective hours of operation: data/titan.gpu.history.txt - history data, data/titan.service.txt - service nodes for exclusion. Includes output data files produced by code/TitanGPUmodel.Rmd: data/gc_full.csv - cleaned up data (see paper and R code); data/gc_summary_loc.csv - one record per GPU (variables: SN, time, nlife, nloc, last, col, row, cage, slot, node, max_loc_events, time_max_loc, dbe, dbe_loc, otb, otb_loc, out, batch, days, years, dead, dead_otb, dead_dbe) (see paper and R code). Includes .Rmd analysis document as TitanGPUmode.html. Includes Python code to process data/gc_full.csv into graphics from time-between-failure analyses: See code/tbf-analyses/README for instructions.

42 ENGINEERING↗

Synthetic-domain computing and neural networks using lithium niobate integrated nonlinear phononics

Analogue computing uses the physical behaviours of devices to provide energy-efficient arithmetic operations. However, scaling up analogue computing platforms by simply increasing the number of devices leads to challenges such as device-to-device variation. Here, in this study, we report scalable analogue computing and neural networks in the synthetic frequency domain using an integrated nonlinear phononic platform on lithium niobate. This synthetic-domain computing is robust to device variations, as vectors and matrices are concurrently encoded at different frequencies within a single device, achieving a high throughput per area. Leveraging inherent nonlinearities, our device-aware neural network can perform a four-class classification task with an accuracy of 98.2%. The nonlinear phononic computing hardware also maintains consistent performance over a wide operational temperature range (characterized up to 192 °C). Our synthetic-domain computing combines single-device parallelism, inherent nonlinearity and environmental stability, and could be of use in edge computing applications in which power efficiency and environmental resilience are crucial.

Ji, Jun [Virginia Polytechnic Inst. and State Univ↗

Data directory for Halbach magnets

The data for measurement and survey of the CBETA Halbach magnets is stored on the “DISCOVERY” network computer at BNL Superconducting Magnet Division (SMD), on the network share called “C_Beta”. This serves as storage for the measurements, under systematic filenames, as well as generated reports and other relevant per-magnet documentation such as travellers.

43 PARTICLE ACCELERATORS↗

Performance and usability enhancements for continuous subgraph matching queries on graph-structured data

A query graph, which includes vertices and edges, represents a query on graph-structured data. The query graph is decomposed into query subgraphs. A network analysis tool performs continuous subgraph matching queries to facilitate analysis of computer network traffic, social media events, or other streams of data represented as a dynamic data graph (graph-structured data). This can help identify emerging trends in the data. Some features of the network analysis tool enhance performance by effectively utilizing distributed computing resources (including processing cores and memory at different nodes of a cluster) to speed up the process of updating the dynamic data graph and detecting matches of query subgraphs. Features of a query graph building tool enhance usability by providing intuitive ways to specify query graphs and their subgraphs. Features of a results visualization tool enhance usability by providing an intuitive way to present the results of continuous subgraph matching queries.

Choudhury, Sutanay↗

Gradient Coding With Iterative Block Leverage Score Sampling

Gradient coding is a method for mitigating straggling servers in a centralized computing network that uses erasure-coding techniques to distributively carry out first-order optimization methods. Randomized numerical linear algebra uses randomization to develop improved algorithms for large-scale linear algebra computations. In this study, we propose a method for distributed optimization that combines gradient coding and randomized numerical linear algebra. The proposed method uses a randomized ℓ 2 -subspace embedding and a gradient coding technique to distribute blocks of data to the computational nodes of a centralized network, and at each iteration the central server only requires a small number of computations to obtain the steepest descent update. The novelty of our approach is that the data is replicated according to importance scores, called block leverage scores, in contrast to most gradient coding approaches that uniformly replicate the data blocks. Furthermore, we do not require a decoding step at each iteration, avoiding a bottleneck in previous gradient coding schemes. We show that our approach results in a valid ℓ 2 -subspace embedding, and that our resulting approximation converges to the optimal solution.

97 MATHEMATICS AND COMPUTING↗

Randomized methods to characterize large-scale vortical flow networks

We demonstrate the effective use of randomized methods for linear algebra to perform network-based analysis of complex vortical flows. Network theoretic approaches can reveal the connectivity structures among a set of vortical elements and analyze their collective dynamics. These approaches have recently been generalized to analyze high-dimensional turbulent flows, for which network computations can become prohibitively expensive. In this work, we propose efficient methods to approximate network quantities, such as the leading eigendecomposition of the adjacency matrix, using randomized methods. Specifically, we use the Nyström method to approximate the leading eigenvalues and eigenvectors, achieving significant computational savings and reduced memory requirements. The effectiveness of the proposed technique is demonstrated on two high-dimensional flow fields: two-dimensional flow past an airfoil and two-dimensional turbulence. We find that quasi-uniform column sampling outperforms uniform column sampling, while both feature the same computational complexity.

97 MATHEMATICS AND COMPUTING↗

Pickaxe: a Python library for the prediction of novel metabolic reactions

Abstract Background Biochemical reaction prediction tools leverage enzymatic promiscuity rules to generate reaction networks containing novel compounds and reactions. The resulting reaction networks can be used for multiple applications such as designing novel biosynthetic pathways and annotating untargeted metabolomics data. It is vital for these tools to provide a robust, user-friendly method to generate networks for a given application. However, existing tools lack the flexibility to easily generate networks that are tailor-fit for a user’s application due to lack of exhaustive reaction rules, restriction to pre-computed networks, and difficulty in using the software due to lack of documentation. Results Here we present Pickaxe, an open-source, flexible software that provides a user-friendly method to generate novel reaction networks. This software iteratively applies reaction rules to a set of metabolites to generate novel reactions. Users can select rules from the prepackaged JN1224min ruleset, derived from MetaCyc, or define their own custom rules. Additionally, filters are provided which allow for the pruning of a network on-the-fly based on compound and reaction properties. The filters include chemical similarity to target molecules, metabolomics, thermodynamics, and reaction feasibility filters. Example applications are given to highlight the capabilities of Pickaxe: the expansion of common biological databases with novel reactions, the generation of industrially useful chemicals from a yeast metabolome database, and the annotation of untargeted metabolomics peaks from an E. coli dataset. Conclusion Pickaxe predicts novel metabolic reactions and compounds, which can be used for a variety of applications. This software is open-source and available as part of the MINE Database python package ( https://pypi.org/project/minedatabase/ ) or on GitHub ( https://github.com/tyo-nu/MINE-Database ). Documentation and examples can be found on Read the Docs ( https://mine-database.readthedocs.io/en/latest/ ). Through its documentation, pre-packaged features, and customizable nature, Pickaxe allows users to generate novel reaction networks tailored to their application.

59 BASIC BIOLOGICAL SCIENCES↗

Utilizing Weak Indicators to Detect Anomalous Behaviors in Networks

We consider the use of a novel weak in- dicator alongside more commonly used weak indicators to help detect anomalous behavior in a large computer network. The data of the network which we are studying in this research paper concerns remote log-in information (Virtual Private Network, or VPN sessions) from the internal network of Los Alamos National Laboratory (LANL). The novel indicator we are utilizing is some- thing which, while novel in its application to data science/cyber security research, is a concept borrowed from the business world. The Her ndahl-Hirschman Index (HHI) is a computationally trivial index which provides a useful heuristic for regulatory agencies to ascertain the relative competitiveness of a particular industry. Using this index as a lagging indicator in the monthly format we have studied could help to detect anomalous behavior by a particular or small set of users on the network.

97 MATHEMATICS AND COMPUTING↗