Search NASA⌕ Search

SEARCH · Search NASA

Results for “network visualization”

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 19 records

Network visualization, intrusion detection, and network healing

The present disclosure is related to a cyber-security system that includes a Supervisory Control and Data Acquisition (SCADA) network monitor configured to receive a data set from a power system network, an event manager, and a mitigation system, where the SCADA network monitor includes an anomaly detector.

Rivera, Joshua Eli↗

Flavor Classification in ICARUS Using Convolutional Visual Networks

In this work, we adapt the Convolutional Visual Network (CVN) approach [1] to the ICARUS detector by incorporating TPC stitching methods inspired by NuGraph[8]. The stitching technique used here is unique to ICARUS, designed specifically to handle its distinct detector segmentations. We then retrain the network using ICARUS-specific data. This study underscores the flexibility of deep learning models in high-energy physics and the importance of accounting for detector-specific features when transferring machine learning techniques between experiments. This poster presents the methods, classification performance, and insights gained from applying CVN to ICARUS data.

Wieler, Felipe [Tech. Fed. Parana U.]↗

Neutrino Flavor Classification in ICARUS Experiment Using Convolutional Visual Networks

In this work, I adapt the Convolutional Visual Network (CVN) approach to the ICARUS detector by incorporating TPC stitching methods inspired by NuGraph. The stitching technique used here is unique to ICARUS, designed specifically to handle its distinct detector segmentation s. I then retrain the network using ICARUS-specific data. This study underscores the flexibility of deep learning models in high-energy physics and the importance of accounting for detector-specific features when transferring machine learning techniques between experiments. This dissertation presents the methods, classification performance, and insights gained from applying CVN to ICARUS data.

Wieler, Felipe Andre [Parana Tech. Fed. U., Toledo↗

CCQE-like $\nu_{e}$ Selection in SBND using Convolutional Visual Network

Neutrinos from the Booster Neutrino Beam (BNB) at Fermilab interact with argon in a Liquid Argon Time Projection Chamber (LArTPC) differently based on their flavour. By examining the particles produced in a charged-current interaction, both the interaction type and the neutrino flavour can be inferred. The Short Baseline Near Detector has the largest neutrino-argon cross section data to date, motivating in-depth studies of various cross-section channels and topologies. This project aims to select electron neutrino quasi-elastic-like (QE-like) interactions in SBND using Convolutional Visual Network (CVN) scores. The CVN is a neural network that processes visual information from an event and assigns scores corresponding to its likelihood of being each interaction type. An inclusive study of electron neutrino charged current interactions using CVN has already been conducted. This analysis aims to build on this study, further utilizing CVN scores to isolate electron neutrino QE-like interactions characterized by the presence of an electron and one or more protons ($N > 0$) in the final state. The project s goal is to contribute to the overall cross-section measurement efforts within the SBN program at Fermilab.

Breen, Genevieve [Mt. Holyoke Coll.]↗

Complex water networks visualized by cryogenic electron microscopy of RNA

The stability and function of biomolecules are directly influenced by their myriad interactions with water. Here we investigated water through cryogenic electron microscopy (cryo-EM) on a highly solvated molecule: the Tetrahymena ribozyme. By using segmentation-guided water and ion modelling (SWIM), an approach combining resolvability and chemical parameters, we automatically modelled and cross-validated water molecules and Mg 2+ ions in the ribozyme core, revealing the extensive involvement of water in mediating RNA non-canonical interactions. Unexpectedly, in regions where SWIM does not model ordered water, we observed highly similar densities in both cryo-EM maps. In many of these regions, the cryo-EM densities superimpose with complex water networks predicted by molecular dynamics, supporting their assignment as water and suggesting a biophysical explanation for their elusiveness to conventional atomic coordinate modelling. Our study demonstrates an approach to unveil both rigid and flexible waters that surround biomolecules through cryo-EM map densities, statistical and chemical metrics, and molecular dynamics simulations.

59 BASIC BIOLOGICAL SCIENCES↗

DUNE Data Management: Network Visualization Monitoring Software

Fermilab’s fagship Deep Underground Neutrino Experiment (DUNE) seeks to better understand the nature of neutrinos within the context of Leptogenesis, neutrino oscillations, multi-messenger Astronomy, and other scientifc phenomena. The experiment will send a beam of neutrinos from the Fermilab site in Illinois to the Sanford Underground Neutrino Facility (SURF) in South Dakota, generating petabytes of scientifc data. Given the high volume of data expected when measurements begin at the end of the decade, DUNE computing and the data management group must carefully monitor data transfers across the 15 remote storage sites and, more generally, the 36 global DUNE computing sites. This report will describe both the frontend and backend data monitoring software designed to analyze and visualize these data transfers. Specifc emphasis will be placed on the software’s setup, usage, and methods for future implementations. The full software code can be found under the DUNE/data-mgmt-testing GitHub repository.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Make the Fastest Faster: Importance Mask Synthesis for Interactive Volume Visualization using Reconstruction Neural Networks

Visualizing a large-scale volumetric dataset with high resolution is challenging due to the substantial computational time and space complexity. Recent deep learning-based image inpainting methods significantly improve rendering latency by reconstructing a high-resolution image for visualization in constant time on GPU from a partially rendered image where only a portion of pixels go through the expensive rendering pipeline. However, existing solutions need to render every pixel of either a predefined regular sampling pattern or an irregular sample pattern predicted from a low-resolution image rendering. Both methods require a significant amount of expensive pixel-level rendering. In this work, we provide Importance Mask Learning (IML) and Synthesis (IMS) networks, which are the first attempts to directly synthesize important regions of the regular sampling pattern from the user’s view parameters, to further minimize the number of pixels to render by jointly considering the dataset, user behavior, and the downstream reconstruction neural network. Our solution is a unified framework to handle various types of inpainting methods through the proposed differentiable compaction/decompaction layers. Experiments show our method can further improve the overall rendering latency of state-of-the-art volume visualization methods using reconstruction neural network for free when rendering scientific volumetric datasets. Our method can also directly optimize the off-the-shelf pre-trained reconstruction neural networks without elongated retraining.

Large-scale data↗

State-based network similarity visualization

We introduce an approach for the interactive visual analysis of weighted, dynamic networks. These networks arise in areas such as computational neuroscience, sociology, and biology. Network analysis remains challenging due to complex time-varying network behavior. For example, edges disappear/reappear, communities grow/vanish, or overall network topology changes. Our technique, TimeSum, detects the important topological changes in graph data to abstract the dynamic network and visualize one summary representation for each temporal phase, a state. We define a network state as a graph with similar topology over a specific time interval. To enable a holistic comparison of networks, we use a difference network to depict edge and community changes. Here, we present case studies to demonstrate that our methods are effective and useful for extracting and exploring complex dynamic behavior of networks.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

rNets: a standalone package to visualize reaction networks

In the study of chemical processes, visualizing reaction networks is pivotal for identifying crucial compounds and transformations. Traditional methods, such as network schematics and reaction path linear plots, often struggle to effectively represent complex reaction networks due to their size and intricate connectivity. Alternatives capable of leading with complexity include graph methods, but they are not user-friendly, lacking simplicity and modularity, which hinders their integration with widely-used research software. This work introduces rNets an innovative tool designed for the efficient visualization of reaction networks with a user-friendly interface, modularity, and seamless integration with existing software packages. The effectiveness of rNets is demonstrated through its application in analyzing three catalytic reactions, showcasing its potential to significantly enhance research both in homogeneous and heterogeneous catalysis fields. This tool not only simplifies the visualization process but also opens new avenues for exploring complex reaction networks in diverse research contexts.

Pablo-García, Sergio↗

The State of the Art in Visualizing Dynamic Multivariate Networks

Abstract Most real‐world networks are both dynamic and multivariate in nature, meaning that the network is associated with various attributes and both the network structure and attributes evolve over time. Visualizing dynamic multivariate networks is of great significance to the visualization community because of their wide applications across multiple domains. However, it remains challenging because the techniques should focus on representing the network structure, attributes and their evolution concurrently. Many real‐world network analysis tasks require the concurrent usage of the three aspects of the dynamic multivariate networks. In this paper, we analyze current techniques and present a taxonomy to classify the existing visualization techniques based on three aspects: temporal encoding, topology encoding, and attribute encoding. Finally, we survey application areas and evaluation methods; and discuss challenges for future research.

Kale, Bharat↗

Accelerating network layouts using graph neural networks

Graph layout algorithms used in network visualization represent the first and the most widely used tool to unveil the inner structure and the behavior of complex networks. Current network visualization software relies on the force-directed layout (FDL) algorithm, whose high computational complexity makes the visualization of large real networks computationally prohibitive and traps large graphs into high energy configurations, resulting in hard-to-interpret “hairball” layouts. Here we use Graph Neural Networks (GNN) to accelerate FDL, showing that deep learning can address both limitations of FDL: it offers a 10 to 100 fold improvement in speed while also yielding layouts which are more informative. We analytically derive the speedup offered by GNN, relating it to the number of outliers in the eigenspectrum of the adjacency matrix, predicting that GNNs are particularly effective for networks with communities and local regularities. Finally, we use GNN to generate a three-dimensional layout of the Internet, and introduce additional measures to assess the layout quality and its interpretability, exploring the algorithm’s ability to separate communities and the link-length distribution. The novel use of deep neural networks can help accelerate other network-based optimization problems as well, with applications from reaction-diffusion systems to epidemics.

97 MATHEMATICS AND COMPUTING↗

Advancing Vision-based Feedback and Convolutional Neural Networks for Visual Outlier Detection

Machine learning has matured into a technology that has immediate applicability to the surveillance needs of nuclear material storage containers. These containers at LANL are the barrier preventing release of radioactive material to the workers, public, and environment during the storage period of the material. Annual surveillance activities can only provide coverage on a handful of containers. There is a significant need for surveillance tools to identify potential issues and precursors to containment failure that can be used during opportunistic inspections and, more generally, outside of annual surveillance activities. In this report we provide details on the advancement of our proposed embodiment that combines an automation system for taking pictures and a high-accuracy machine learning-driven object detection software. We further showcase the improvements on the software side with progress on extracting unique identification features and advances in detecting damage. The current state of the system captures subject matter expert training and a space-conscious design whose implementation is envisioned in the near future.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

Blue Keanu: A Scientific Visualization Tool For Network Data

This software allows the user to visualize complex PCAP-ng files captured from network capture software such as Wireshark. The visualization runs in a GUI window that can be zoomed or moved to areas of interest in a waterfall type display. The user then can see an area of interest that looks different than the typical traffic visually, such as a human interaction or non-repetitive area of data. The program will tell the user the packet number and byte offset of interest for fast analysis of discrete atomic or non-random events. This is particularly useful for visualization of unknown binary format data, such as in PLC or SCADA protocols that may have human or other non-repetitive activity for further analysis, reverse engineering, or fast forensic analysis.

Durller, MichaelGeorge↗

Indicator Patterns of Forced Change Learned by an Artificial Neural Network

Abstract Many problems in climate science require the identification of signals obscured by both the “noise” of internal climate variability and differences across models. Following previous work, we train an artificial neural network (ANN) to predict the year of a given map of annual‐mean temperature (or precipitation) from forced climate model simulations. This prediction task requires the ANN to learn forced patterns of change amidst a background of climate noise and model differences. We then apply a neural network visualization technique (layerwise relevance propagation) to visualize the spatial patterns that lead the ANN to successfully predict the year. These spatial patterns thus serve as “reliable indicators” of the forced change. The architecture of the ANN is chosen such that these indicators vary in time, thus capturing the evolving nature of regional signals of change. Results are compared to those of more standard approaches like signal‐to‐noise ratios and multilinear regression in order to gain intuition about the reliable indicators identified by the ANN. We then apply an additional visualization tool (backward optimization) to highlight where disagreements in simulated and observed patterns of change are most important for the prediction of the year. This work demonstrates that ANNs and their visualization tools make a powerful pair for extracting climate patterns of forced change.

54 ENVIRONMENTAL SCIENCES↗

Reimagining Disassembly Interfaces With Visualization: Combining Instruction Tracing and Control Flow With DisViz

In applications where efficiency is critical, developers may examine their compiled binaries, seeking to understand how the compiler transformed their source code and what performance implications that transformation may have. This analysis is challenging due to the vast number of disassembled binary instructions and the many-to-many mappings between them and the source code. These problems are exacerbated as source code size increases, giving the compiler more freedom to map and disperse binary instructions across the disassembly space. Interfaces for disassembly typically display instructions as an unstructured listing or sacrifice the order of execution. Here, we design a new visual interface for disassembly code that combines execution order with control flow structure, enabling analysts to both trace through code and identify familiar aspects of the computation. Central to our approach is a novel layout of instructions grouped into basic blocks that displays a looping structure in an intuitive way. We add to this disassembly representation a unique block-based mini-map that leverages our layout and shows context across thousands of disassembly instructions. Finally, we embed our disassembly visualization in a web-based tool, DisViz, which adds dynamic linking with source code across the entire application. DizViz was developed in collaboration with program analysis experts following design study methodology and was validated through evaluation sessions with ten participants from four institutions. Participants successfully completed the evaluation tasks, hypothesized about compiler optimizations, and noted the utility of our new disassembly view. Our evaluation suggests that our new integrated view helps application developers in understanding and navigating disassembly code.

Computer science↗

PARETO UI 24.01.24 (0.9.0) Release

This is a standalone release of PARETO UI using the previously released PARETO version 0.9.0 for the backend.. New features in this version of PARETO UI are: - Added functionality to upload GIS map network visualizations and auto generate input templates - Added map visualizations based on GIS data

PARETO,PARETO-UI,PSE,Process Systems Engineering,P↗

Selection Algorithm for electron neutrino charged current interactions in SBND

The Short Baseline Neutrino (SBN) program at Fermilab is a joint proposal by three experimental collaborations primarily for the investigation of the cause behind the low-energy electron-like event excess observed by the MiniBoone experiment. This dissertation focuses on the near detector of the project, named the Short Baseline Near Detector (SBND), a Liquid Argon Time Projection Chamber apparatus which will conduct searches for sterile neutrinos in the mass range of 1 ${eV}^2/{c}^4$, as well as provide cross-section measurements for neutrino interactions in argon and perform other beyond the standard model studies.\\ \indent As is the case for all detectors in the program, the SBND will use the Booster Neutrino Beam as its source, which will provide it with both muon and electron neutrinos. Given that the ability to discern between the neutrino flavors will be crucial to the fulfillment of the detector's physics goals, the objective of this work is to provide the collaboration with a tool capable of doing so. As such, we here present the development process for an inclusive selection algorithm for the identification of electron neutrino charged current (CC) events regardless of their interaction channel. This is done through a combination of traditional techniques, such as the implementation of cuts on the reconstructed interaction properties, with the use of the Convolutional Visual Network, a machine learning algorithm capable of classifying particle interactions through the analysis of the topology of their final states. With this approach, we have developed a selection process that is capable of identifying $\nu_e$ CC interactions across a wide range of topologies with 34.4\% efficiency, as well as a purity of 91.2\%, making it especially promising for use in cross section studies.

Freire, Hector Moya [ABC Federal U.] (ORCID:000900↗

A Measurement of the Pion-Energy Dependence of Muon Neutrino Charged-Current Scattering to Final States With One Charged Pion in NOvA

The study of neutrino oscillations is a main priority for particle physics as the most immediately tractable lever on physics beyond the Standard Model. In particular, more insight into violation of the combined symmetry of charge-conjugation plus parity could yield clues to the origin of matter-antimatter asymmetry, and in some theoretical frameworks the neutrino mass could give insights into dark matter. NOvA is a long-baseline accelerator neutrino experiment with both a near and far detector that seeks to measure several of the parameters of the neutrino mixing matrix, as well as carry out a broad program of additional physics. NOvA has innovated and developed a variety of techniques in the space of neutrino physics, including expanding the use of machine learning techniques in reconstruction. NOvA has also set the stage for the next generation US-based long baseline experiment, DUNE. This dissertation details the creation of a new neutrino interaction vertex reconstruction package for NOvA, which offers enormous improvements in accuracy above the previous vertexer it replaces. This is accomplished using a Convolutional Visual Network trained on large datasets of simulated events. The vertexer is validated thoroughly against data. This dissertation also presents a cross-section measurement for $\nu_\mu + N \rightarrow \mu^- + 1\pi^\pm + X$ (where X does not include additional charged pions) binned in pion kinetic energy, a challenging measurement in general and for NOvA in particular. Measurements like this provide crucial inputs for neutrino interaction models utilized by neutrino oscillation experiments. This measurement in particular is important to the energy ranges relevant for DUNE in a band not well-covered by any other experiment.

Ewart, Erin [Indiana U., Bloomington (main)]↗