Search NASA⌕ Search

SEARCH · Search NASA

Results for “Data Visualization and Analysis”

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 613 records · Page 34

A User-Centered Design Study in Scientific Visualization Targeting Domain Experts

The development of usable visualization solutions is essential for ensuring both their adoption and effectiveness. User-centered design principles, which involve users throughout the entire development process, have been shown to be effective in numerous information visualization endeavors. We describe how we applied these principles in scientific visualization over a two year collaboration to develop a hybrid in situ/post hoc solution tailored towards combustion researcher needs. Lastly, we examine the importance of user-centered design and lessons learned over the design process in an effort to aid others seeking to develop effective scientific visualization solutions.

97 MATHEMATICS AND COMPUTING↗

A guide to the BRAIN Initiative Cell Census Network data ecosystem

Characterizing cellular diversity at different levels of biological organization and across data modalities is a prerequisite to understanding the function of cell types in the brain. Classification of neurons is also essential to manipulate cell types in controlled ways and to understand their variation and vulnerability in brain disorders. The BRAIN Initiative Cell Census Network (BICCN) is an integrated network of data-generating centers, data archives, and data standards developers, with the goal of systematic multimodal brain cell type profiling and characterization. Emphasis of the BICCN is on the whole mouse brain with demonstration of prototype feasibility for human and nonhuman primate (NHP) brains. Here, we provide a guide to the cellular and spatial approaches employed by the BICCN, and to accessing and using these data and extensive resources, including the BRAIN Cell Data Center (BCDC), which serves to manage and integrate data across the ecosystem. We illustrate the power of the BICCN data ecosystem through vignettes highlighting several BICCN analysis and visualization tools. Finally, we present emerging standards that have been developed or adopted toward Findable, Accessible, Interoperable, and Reusable (FAIR) neuroscience. The combined BICCN ecosystem provides a comprehensive resource for the exploration and analysis of cell types in the brain.

59 BASIC BIOLOGICAL SCIENCES↗

Using Dynamic Quantum Clustering to Analyze Hierarchically Heterogeneous Samples on the Nanoscale

Dynamic Quantum Clustering (DQC) is an unsupervised, high visual data mining technique. DQC was tested as an analysis method for X-ray Absorption Near Edge Structure (XANES) data from the Transmission X-ray Microscopy (TXM) group. The TXM group images hierarchically heterogeneous materials with nanoscale resolution and large field of view. XANES data consists of energy spectra for each pixel of an image. It was determined that DQC successfully identifies structure in data of this type without prior knowledge of the components in the sample. Clusters and sub-clusters clearly reflected features of the spectra that identified chemical component, chemical environment, and density in the image. DQC can also be used in conjunction with the established data analysis technique, which does require knowledge of components present.

99 GENERAL AND MISCELLANEOUS↗

Function Preserving Projection (FPP): A Linear Projection Technique for Visual Interpretation of High-Dimensional Functions

In this work, we propose function preserving projection (FPP), a new class of scalable linear projection techniques for finding interpretable structure in highdimensional datasets. Instead of focusing on preserving the structure of highdimensional points as traditional dimensionality reduction methods, we aim to find a 2D view of the data, in which human interpretable patterns of meaningful properties (that defined on the high-dimensional points, i.e., functions in a highdimensional domain) are revealed. Such a visual-centric approach introduces new avenues for exploratory data analysis and allows efficient implementation that provides a scalable tool for exploring potentially unknown or unexpected relationships in complex and large high-dimensional data (e.g., beyond millions of samples and tens of thousands of dimensions).

97 MATHEMATICS AND COMPUTING↗

Data Summarization and Inference at Scale

This is the final report for the DOE ASCR grant SC-0022260, Data Summarization and Inference at Scale, PI: Alex Pothen, Purdue University. The goal of the project was to solve data-intensive and compute-intensive problems in the physical sciences, engineering, information science, data science, etc. by designing and implementing new algorithms that could work with a subset of the data. The four subgoals were: (a) The solution of problems where the data is too large to be stored in the memory of a computer. In this streaming model of computation, the data arrives as a stream of elements to the computer, each element is processed as it arrives, and a decision is made to discard the data or to store it; only a small subset of the data proportional to the size of the output solution is stored, and when all the data has been streamed, a solution to the problem is computed from the stored subset. (b) The use of machine learning methods to compute solutions to data-intensive problems. The use of GPUs is critical to obtain high performance on machine learning tasks, but their memory sizes are smaller relative to that of CPUs. For large-scale problems, the data is sampled many times, and small samples are used with repetition, for robustness, to compute solutions to inference tasks. This sampling reduces the memory required to solve the problem, but attention is needed to avoid slow convergence to the solutions, and reduced accuracy of inference. We propose submodular optimization, Large Language Models, and physics-informed neural networks to enable GPU computations here. (c) Modeling and visualization of high-dimensional data using interpretable features. Clinical proteomic data sets from immunology for the detection of cancer and other diseases are temporal and high-dimensional, and algorithms for visualizing these data sets using clinically interpretable features are lacking. We propose methods that compute distances based on the optimal transportation problem and graph edit distances to address this problem. We also propose the use of optimal transport-based distances, spatial statistics, and network structure to classify image data sets, We apply these algorithms to electron micrographs of the peripheral nervous system in the digestive tract. (d) The design of data-intensive algorithms on emerging architectures, specifically, noisy, intermediate-scale quantum (NISQ) devices. Quantum computers offer the possibility of exploring large solution spaces due to the principle of superposition, but current quantum computers are limited by few qubits, short coherence times due to noise, poor interconections among the qubits, etc. We propose the use of the divide and conquer paradigm to solve large-scale problems, wherein collections of small subproblems are solved on the quantum devices, and the solutions to the subproblems are integrated into a solution for the original problem on a classical computer.

97 MATHEMATICS AND COMPUTING↗

Adaptive Sampling Algorithms for Probabilistic Risk Assessment of Nuclear Simulations

Nuclear simulations are often computationally expensive, time-consuming, and high-dimensional with respect to the number of input parameters. Thus exploring the space of all possible simulation outcomes is infeasible using finite computing resources. During simulation-based probabilistic risk analysis, it is important to discover the relationship between a potentially large number of input parameters and the output of a simulation using as few simulation trials as possible. This is a typical context for performing adaptive sampling where a few observations are obtained from the simulation, a surrogate model is built to represent the simulation space, and new samples are selected based on the model constructed. The surrogate model is then updated based on the simulation results of the sampled points. In this way, we attempt to gain the most information possible with a small number of carefully selected sampled points, limiting the number of expensive trials needed to understand features of the simulation space. We analyze the specific use case of identifying the limit surface, i.e., the boundaries in the simulation space between system failure and system success. In this study, we explore several techniques for adaptively sampling the parameter space in order to reconstruct the limit surface. We focus on several adaptive sampling schemes. First, we seek to learn a global model of the entire simulation space using prediction models or neighborhood graphs and extract the limit surface as an iso-surface of the global model. Second, we estimate the limit surface by sampling in the neighborhood of the current estimate based on topological segmentations obtained locally. Our techniques draw inspirations from topological structure known as the Morse-Smale complex. We highlight the advantages and disadvantages of using a global prediction model versus local topological view of the simulation space, comparing several different strategies for adaptive sampling in both contexts. One of the most interesting models we propose attempt to marry the two by obtaining a coarse global representation using prediction models, and a detailed local representation based on topology. Our methods are validated on several analytical test functions as well as a small nuclear simulation dataset modeled after a simplified Pressurized Water Reactor.

97 MATHEMATICS AND COMPUTING↗

Analyzing Dynamic Probabilistic Risk Assessment Data through Topology-Based Clustering

We investigate the use of a topology-based clustering technique on the data generated by dynamic event tree methodologies. The clustering technique we utilizes focuses on a domain-partitioning algorithm based on topological structures known as the Morse-Smale complex, which partitions the data points into clusters based on their uniform gradient flow behavior. We perform both end state analysis and transient analysis to classify the set of nuclear scenarios. We demonstrate our methodology on a dataset generated for a sodium-cooled fast reactor during an aircraft crash scenario. The simulation tracks the temperature of the reactor as well as the time for a recovery team to fix the passive cooling system. Combined with clustering results obtained previously through mean shift methodology, we present the user with complementary views of the data that help illuminate key features that may be otherwise hidden using a single methodology. By clustering the data, the number of relevant test cases to be selected for further analysis can be drastically reduced by selecting a representative from each cluster. Identifying the similarities of simulations within a cluster can also aid in the drawing of important conclusions with respect to safety analysis.

97 MATHEMATICS AND COMPUTING↗

MSTAR2019 Code Description and User's Manual

This report describes an ideal cascade model of uranium enrichment that includes side feed and side product streams and flexible input options. It is based on the original MSTAR model developed by Ed Von Halle and implemented in a Visual Basic code. The current version allows the user to specify integer numbers of stages or the stage numbers of external flows instead of assays in those flows. The computational engine is written in FORTRAN-90 and is invoked by a user-friendly GUI written in C++. This version of MSTAR has been demonstrated to operate on Linux, Mac, and Windows platforms, and has undergone significant testing and quality analysis. A number of examples are presented to illustrate the operation of the code and guide the user. The code is extremely fast, and results are returned immediately. The input and output have been specially configured for analysis by the environmental sampling team of the International Atomic Energy Agency (IAEA). A number of additional output features are included to assist the user in visualizing computational results and downloading data to files for use in other analysis software.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Mass Spectrometry Imaging Quick View

MSI QuickView is a software designed to provide a graphical user interface (GUI) for greatly speeding up experimental feedback (visualization and analysis) of mass spectrometry imaging (MSI or IMS) data during data acquisition. Often different software loads the entire data set, i.e., all lines of data into computer memory (RAM). This causes out of memory errors for larger datasets. We solved this in MSI QuickView by reading in the data one line at a time. Only the required information (e.g. the final pixel values for that line of heat map) is maintained in RAM. Interim analysis options include the mean intensity vs. m/z spectrum, intensity vs. time spectrums for up to 6 different m/z values or ranges chosen by the user and heat maps for each line. This assists in validating the usefulness of the particular experiment after scanning the first few lines. In addition, the tool facilitates further processing and analysis of the massive datasets. The user can manually pick different m/z values, time ranges, scroll through the spectra for any line in the data without having to load it in manually, save multiple images, change aspect ratios for the heat maps, and process the heat maps in multiple ways including overlaying images at different m/z values, displaying up to 9 different heat maps, alignment of scans along each line etc. There is no manipulation of the data required by the user to visualize the data.

Carson, JamesP.↗

Opening The NIF Archive To The Scientific User Community

The National Ignition Facility (NIF) is the world’s largest and most energetic laser, providing a research center to study inertial confinement fusion ignition and explore matter at extreme energy densities and pressures. With each experiment potentially generating hundreds of gigabytes of data, it is imperative that scientists be capable of interacting with the NIF Archive efficiently, visually and with tools that facilitate further experimental analysis. To do this, the Shot Data Systems team provides interactive, web-based dashboards, a virtual file system interface, a scripting language for programmatic data integration, and an experimental Wiki to support collaboration.

42 ENGINEERING↗

IMG/M v.5.0: an integrated data management and comparative analysis system for microbial genomes and microbiomes

The Integrated Microbial Genomes & Microbiomes system v.5.0 (IMG/M: https://img.jgi.doe.gov/m/) contains annotated datasets categorized into: archaea, bacteria, eukarya, plasmids, viruses, genome fragments, metagenomes, cell enrichments, single particle sorts, and metatranscriptomes. Source datasets include those generated by the DOE's Joint Genome Institute (JGI), submitted by external scientists, or collected from public sequence data archives such as NCBI. All submissions are typically processed through the IMG annotation pipeline and then loaded into the IMG data warehouse. IMG's web user interface provides a variety of analytical and visualization tools for comparative analysis of isolate genomes and metagenomes in IMG. IMG/M allows open access to all public genomes in the IMG data warehouse, while its expert review (ER) system (IMG/MER: https://img.jgi.doe.gov/mer/) enabled registered users to access their private genomes and to store their private datasets in workspace for sharing and for further analysis. IMG/M data content has increased by 60% since the last report published in the 2017 NAR Database Issue. IMG/M v.5.0 has a new and more powerful genome search feature, new statistical tools, and supports metagenome binning.

59 BASIC BIOLOGICAL SCIENCES↗

Two-stage Framework for Visualization of Clustered High Dimensional Data

In this paper, we discuss 2D visualization methods of high dimensional representation of the data that are clustered and their associated label information is available. We propose a two-stage framework for visualization of such data based on dimension reduction methods. In the first stage, we obtain the reduced dimensional data by a supervised dimension reduction method such as linear discriminant analysis that preserves the original cluster structure in terms of its criterion. The resulting optimal reduced dimension depends on the optimization criteria and is often larger than 2. In the second stage, in order to further reduce the dimension to 2 for visualization purposes, we apply another dimension reduction method such as principal component analysis that minimizes the distortion in the lower dimensional representation of the data obtained in the first stage. Using this framework, we propose several two-stage methods, and present their theoretical characteristics as well as experimental comparisons on both artificial and real-world text data sets.

97 MATHEMATICS AND COMPUTING↗

Simulation process and data flow for a large system dynamics model

This paper documents the workflow and supporting technologies that a large system dynamics model, the biomass scenario model, employs to streamline the data preparation, simulation, quality control, and analysis process at the National Renewable Energy Laboratory. The workflow centers on automation of routine aspects of the flow of data between data stores, simulations, and visualizations. It enforces quality checks on data, reproducibility of computations, and traceability of results, while maintaining complete archives of modeling and analysis artifacts. The resulting frictionless simulation/analysis environment supports large-scale sensitivity analysis, interactive creation of ensembles of simulations, and rapid visualization-based exploration of simulation results.

09 BIOMASS FUELS↗

PHOENIX - Web-Based Application for Accessing Hanford Tank Monitoring Data - 16157

Data volume, complexity, and access issues pose severe challenges for analysts, regulators, and stakeholders interested in evaluating scientific data to support decision making at the Department of Energy's (DOE) Hanford Site. Pacific Northwest National Laboratory (PNNL) has developed a suite of web applications known collectively as PHOENIX (PNNL-Hanford Online Environmental Information exchange) to address data access, transparency, and integration challenges through intuitive query, visualization, and analysis tools that are accessible via desktop computer or mobile device by simply accessing the application web page (http://phoenix.pnnl.gov). Beginning in 2013, DOE's Office of River Protection (ORP) has worked with PNNL to develop a PHOENIX Tank Farm application to provide access to, and visualization of, in-tank monitoring data that had only been available to the public as text downloads for almost two decades. The Tank Farm application's user-friendly web-interface allows the public, stakeholders, regulators, and program managers to quickly and easily visualize in-tank and ex-tank data, facilitating data transparency and high-level decisions related to tank operations and management. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Scientific & Intelligence Exascale Visualization Analysis System

SIEVAS provides an immersive visualization framework for connecting multiple systems in real time for data science. SIEVAS provides the ability to connect multiple COTS and GOTS products in a seamless fashion for data fusion, data analysis, and viewing. It provides this capability by using a combination of micro services, real time messaging, and web service compliant back-end system.

Money, JamesH.↗

Scientific & Intelligence Exascale Visualization Analysis System

SIEVAS provides an immersive visualization framework for connecting multiple systems in real time for data science. SIEVAS provides the ability to connect multiple COTS and GOTS products in a seamless fashion for data fusion, data analysis, and viewing. It provides this capability by using a combination of micro services, real time messaging, and web service compliant back-end system.

Money, James H.↗

Cinema image-based in situ analysis and visualization of MPAS-ocean simulations

We created an in situ exploration visualization of an MPAS-Ocean simulation.We leveraged compositing in Cinema to provide interactive exploration.We decreased the storage footprint of the analysis and visualization results. Due to power and I/O constraints associated with extreme scale scientific simulations, in situ analysis and visualization will become a critical component to scientific exploration and discovery. Current analysis and visualization options at extreme scale are presented in opposition: write files to disk for interactive, exploratory analysis, or perform in situ analysis to save data products about phenomena that a scientists knows about in advance. In this study, we demonstrate extreme scale visualization of MPAS-Ocean simulations leveraging a third option based on Cinema, which is a novel framework for highly interactive, image-based in situ analysis and visualization that promotes exploration.

97 MATHEMATICS AND COMPUTING↗