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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
NASA NTRS2012

Visual System for Browsing, Analysis, and Retrieval of Data (ViSBARD)

ViSBARD software provides a way of visualizing multiple vector and scalar quantities as measured by many spacecraft at once. The data are displayed three-dimensionally along the orbits that may be shown either as connected lines or as points. The data display allows the rapid determination of vector configurations, correlations among many measurements at multiple points, and global relationships. Things such as vector field rotations and dozens of simultaneous variables are very difficult to see in (complementary) panel plot representations. The current and next generations of space physics missions require a means to display from tens to hundreds of time series of data in such a way that the mind can comprehend them for the purposes of browsing data, retrieving them in directly useful form, and analyzing them in a global context. Sets of many spacecraft, each carrying many instruments yielding nearly continuous data at high time resolution, have become one of the most effective ways to make progress in understanding the extended, ionized (plasma) atmosphere of the Earth and the Sun. For large collections of data to be effective, they must be extremely readily accessible, with simple, comprehensible overviews of what is available. ViSBARD provides a means to answer these concerns. The ViSBARD package also acts as a remote repository browser; an interface to a Virtual Observatory. Therefore, data can be pulled directly into the application, as opposed to searching for it and downloading separately.

Roberts, Aaron↗
DOE OSTI2019

Scalable Contour Tree Computation by Data Parallel Peak Pruning

As data sets grow to exascale, automated data analysis and visualization are increasingly important, to intermediate human understanding and to reduce demands on disk storage via in situ analysis. Trends in architecture of high performance computing systems necessitate analysis algorithms to make effective use of combinations of massively multicore and distributed systems. One of the principal analytic tools is the contour tree, which analyses relationships between contours to identify features of more than local importance. Unfortunately, the predominant algorithms for computing the contour tree are explicitly serial, and founded on serial metaphors, which has limited the scalability of this form of analysis. While there is some work on distributed contour tree computation, and separately on hybrid GPU-CPU computation, there is no efficient algorithm with strong formal guarantees on performance allied with fast practical performance. Furthermore, we report the first shared SMP algorithm for fully parallel contour tree computation, with formal guarantees of O(lg V lg t) parallel steps and O(V lg V) work for data with V samples and t contour tree supernodes, and implementations with more than 30× parallel speed up on both CPU using TBB and GPU using Thrust and up 70× speed up compared to the serial sweep and merge algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Basic Energy Sciences Exascale Requirements Review. An Office of Science review sponsored jointly by Advanced Scientific Computing Research and Basic Energy Sciences, November 3-5, 2015, Rockville, Maryland

Computers have revolutionized every aspect of our lives. Yet in science, the most tantalizing applications of computing lie just beyond our reach. The current quest to build an exascale computer with one thousand times the capability of today’s fastest machines (and more than a million times that of a laptop) will take researchers over the next horizon. The field of materials, chemical reactions, and compounds is inherently complex. Imagine millions of new materials with new functionalities waiting to be discovered — while researchers also seek to extend those materials that are known to a dizzying number of new forms. We could translate massive amounts of data from high precision experiments into new understanding through data mining and analysis. We could have at our disposal the ability to predict the properties of these materials, to follow their transformations during reactions on an atom-by-atom basis, and to discover completely new chemical pathways or physical states of matter. Extending these predictions from the nanoscale to the mesoscale, from the ultrafast world of reactions to long-time simulations to predict the lifetime performance of materials, and to the discovery of new materials and processes will have a profound impact on energy technology. In addition, discovery of new materials is vital to move computing beyond Moore’s law. To realize this vision, more than hardware is needed. New algorithms to take advantage of the increase in computing power, new programming paradigms, and new ways of mining massive data sets are needed as well. This report summarizes the opportunities and the requisite computing ecosystem needed to realize the potential before us. In addition to pursuing new and more complete physical models and theoretical frameworks, this review found that the following broadly grouped areas relevant to the U.S. Department of Energy (DOE) Office of Advanced Scientific Computing Research (ASCR) would directly affect the Basic Energy Sciences (BES) mission need. Simulation, visualization, and data analysis are crucial for advances in energy science and technology. Revolutionary mathematical, software, and algorithm developments are required in all areas of BES science to take advantage of exascale computing architectures and to meet data analysis, management, and workflow needs. In partnership with ASCR, BES has an emerging and pressing need to develop new and disruptive capabilities in data science. More capable and larger high-performance computing (HPC) and data ecosystems are required to support priority research in BES. Continued success in BES research requires developing the next-generation workforce through education and training and by providing sustained career opportunities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Structure Perception in 3D Point Clouds

Understanding human perception is critical to the design of effective visualizations. The relative benefits of using 2D versus 3D techniques for data visualization is a complex decision space, with varying levels of uncertainty and disagreement in both the literature and in practice. This study aims to add easily reproducible, empirical evidence on the role of depth cues in perceiving structures or patterns in 3D point clouds. We describe a method to synthesize a 3D point cloud that contains a 3D structure, where 2D projections of the data strongly resemble a Gaussian distribution. We performed a within-subjects structure identification study with 128 participants that compared scatterplot matrices (canonical 2D projections) and 3D scatterplots under three types of motion: rotation, xy-translation, and z-translation. We found that users could consistently identify three separate hidden structures under rotation, while those structures remained hidden in the scatterplot matrices and under translation. This work contributes a set of 3D point clouds that provide definitive examples of 3D patterns perceptible in 3D scatterplots under rotation but imperceptible in 2D scatterplots.

data analysis↗
DOE OSTI2021

Structure Perception in 3D Point Clouds: Preprint

Understanding human perception is critical to the design of ef- fective visualizations. The relative benefits of using 2D versus 3D techniques for data visualization is a complex decision space, with varying levels of uncertainty and disagreement in both the liter- ature and in practice. This study aims to add easily reproducible, empirical evidence on the role of depth cues in perceiving structures or patterns in 3D point clouds. We describe a method to synthesize a 3D point cloud that contains a 3D structure, where 2D projec- tions of the data strongly resemble a Gaussian distribution. We performed a within-subjects structure identification study with 128 participants that compared scatterplot matrices (canonical 2D projections) and 3D scatterplots under three types of motion: rota- tion, xy-translation, and z-translation. We found that users could consistently identify three separate hidden structures under ro- tation, while those structures remained hidden in the scatterplot matrices and under translation. This work contributes a set of 3D point clouds that provide definitive examples of 3D patterns per- ceptible in 3D scatterplots under rotation but imperceptible in 2D scatterplots.

data analysis↗
DOE OSTI2024

Open‐Source Anaerobic Digestion Modeling Platform, Anaerobic Digestion Model No. 1 Fast (ADM1F)

An open‐source modeling platform, called Anaerobic Digestion Model No. 1 Fast (ADM1F), is introduced to achieve fast and numerically stable simulations of anaerobic digestion processes. ADM1F is compatible with an iPython interface to facilitate model configuration, simulation, data analysis, and visualization. Faster simulations and more stable results are accomplished by implementing an advanced open‐source library of numerical methods called Portable Extensive Toolkit for Scientific Computation (PETSc) to solve the ADM1 system of equations. Leveraging PETSc, ADM1F can consistently complete a steady‐state simulation under 0.2 s, over 99% faster than a benchmark ADM1 model implemented with MATLAB while achieving agreement of model outputs within 1% of those obtained with the benchmark model. For dynamic simulations, however, ADM1F has a computational speed advantage only when the influent characteristics update more frequently than every 4 h. The ability of ADM1F to be useful as a tool to study anaerobic digestion systems is demonstrated through two example implementations of ADM1F: (1) a two‐phase co‐digestion scenario evaluating the impact of the organic loading rate and the substrate composition on reactor performance and stability, and (2) a conventional digester scenario assessing the effectiveness of recovery strategies after disruptions that led to instability. These examples demonstrate how the high simulation speed and the convenience of the iPython interface allow ADM1F to complete complex analyses within minutes, much faster than computational strategies currently reported in the literature.

anaerobic co-digestion↗
DOE OSTI2022

A quantitative and holistic circular economy assessment framework at the micro level

Circular Economy (CE) aims to solve resource, waste, and emission challenges by creating a production-to-consumption supply chain that is restorative and environmentally benign. A variety of metrics has been developed with the focus mainly on the macro and meso levels. This work introduces a micro level CE assessment framework that provides i) a set of indicators and metrics with sector-specific dimensions, ii) quantitative and holistic CE overall and category-based metrics, iii) media for data visualization and analysis of CE indicators, and iv) an analytical tool to assess multi-national businesses and the multi-scale and interconnected CE supply chains. Using this quantitative tool, companies are able to track their transition towards CE, conduct temporal analysis, and benchmark their performance against their peers and industry’s standards. The applicability and the capabilities of the developed CE assessment framework is demonstrated through three case studies, with the results demonstrating a clear trend towards circularity.

42 ENGINEERING↗
DOE OSTI2021

J-GEM optical and near-infrared follow-up of gravitational wave events during LIGO’s and Virgo’s third observing run

The Laser Interferometer Gravitational-wave Observatory Scientific Collaboration and Virgo Collaboration (LVC) sent out 56 gravitational-wave (GW) notices during the third observing run (O3). The Japanese Collaboration for Gravitational wave ElectroMagnetic follow-up (J-GEM) performed optical and near-infrared observations to identify and observe an electromagnetic (EM) counterpart. We constructed a web-based system that enabled us to obtain and share information on candidate host galaxies for the counterpart, and the status of our observations. Candidate host galaxies were selected from the GLADE catalog with a weight based on the 3D GW localization map provided by LVC. We conducted galaxy-targeted and wide-field blind surveys, real-time data analysis, and visual inspection of observed galaxies. We performed galaxy-targeted follow-ups to 23 GW events during O3, and the maximum probability covered by our observations reached 9.8%. Among these, we successfully started observations for 10 GW events within 0.5 days after the detection. This result demonstrates that our follow-up observation has the potential to constrain EM radiation models for a merger of binary neutron stars at a distance of up to ~100 Mpc with a probability area of ≤ 500 deg 2 .

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Topological Guided Detection of Extreme Wind Phenomena: Implications for Wind Energy

Extreme wind phenomena play a crucial role in the efficient operation of wind farms for renewable energy generation. However, existing detection methods are computationally expensive, limited to specific coordinate. In real-world scenarios, understanding the occurrence of these phenomena over a large area is essential. Therefore, there is a significant demand for a fast and accurate approach to forecast such events. In this paper, we propose a novel method for detecting wind phenomena using topological analysis, leveraging the gradient of wind speed or critical points in a topological framework. By extracting topological features from the wind speed profile within a defined region, we employ topological distance to identify extreme wind phenomena. Our results demonstrate the effectiveness of utilizing topological features derived from regional wind speed profiles. We validate our approach using high-resolution simulations with the Weather Research and Forecasting model (WRF) over a month in the US East Coast.

MATHEMATICS AND COMPUTING,WIND ENERGY↗
DOE OSTI2023

Preface IEEE LDAV 2023

Join us for the 13th IEEE Symposium on Large Data Analysis and Visualization (IEEE LDAV) on Monday, October 23rd 2023 collocated with IEEE VIS 2023 in Melbourne, Victoria, Australia.

Bremer, Peer-Timo↗
DOE OSTI2024

IEEE LDAV 2024 Preface

Join us here for the 14th IEEE Symposium on Large Data Analysis and Visualization (IEEE LDAV) on Sunday, October 13th 2024 collocated with IEEE VIS 2024 in St. Pete Beach, Florida, USA.

Beyer, Johanna↗
DOE OSTI2025

Extremely Scalable Distributed Computation of Contour Trees via Pre-Simplification

Contour trees offer an abstract representation of the level set topology in scalar fields and are widely used in topological data analysis and visualization. However, applying contour trees to large-scale scientific datasets remains challenging due to scalability limitations. Recent developments in distributed hierarchical contour trees have addressed these challenges by enabling scalable computation across distributed systems. Building on these structures, advanced analytical tasks—such as volumetric branch decomposition and contour extraction—have been introduced to facilitate large-scale scientific analysis. Despite these advancements, such analytical tasks substantially increase memory usage, which hampers scalability. In this paper, we propose a pre-simplification strategy to significantly reduce the memory overhead associated with analytical tasks on distributed hierarchical contour trees. We demonstrate enhanced scalability through strong scaling experiments, constructing the largest known contour tree—comprising over half a trillion nodes with complex topology—in under 15 minutes on a dataset containing 550 billion elements.

Li, Mingzhe [University of Utah]↗
DOE OSTI2018

Picviewer v0.0.1

PICviewer is an easy-to-use graphical user interface for data analysis and visualization of Particle-In-Cell (PIC) simulations.

Park, Jaehong↗
DOE OSTI2018

NDDAV

Web-based Interface for the N-Dimensional Data Analysis and Visualization System.

Liu, Shusen↗
DOE OSTI2016

5th Annual Earth System Grid Federation Face-to-Face Conference report, Monterey, California, December 7-11, 2015

The purpose of the Fifth Annual Earth System Grid Federation (ESGF) Face-to-Face (F2F) Conference was to present the most recent information on the state of ESGF’s software stack and to identify and address the data needs and gaps for the climate and weather communities that ESGF supports. This was the first meeting at which members of the international community, under international ESGF Executive Committee leadership, came together to host the conference. The organizers believed that the ESGF F2F Conference was an ideal gateway for agencies and science project leads to express their current and future data infrastructure needs to tool developers. The organizers also envisioned that attendees would brainstorm and share enhancement plans for data distribution, analysis, visualization, hardware and international network infrastructure, standards, and utilization of assorted community resources.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

A Mountaintop View Requires Minimal Sorting: A Faster Contour Tree Algorithm

Consider a scalar field f : M → R, where M is a triangulated simplicial mesh in R d . A level set, or contour, at value v is a connected component of f –1 (v). As v is changed, these contours change topology, merge into each other, or split. Contour trees are concise representations of f that track this contour behavior. The vertices of these trees are the critical points of f, where the gradient is zero. The edges represent changes in the topology of contours. It is a fundamental data structure in data analysis and visualization, and there is significant previous work (both theoretical and practical) on algorithms for constructing contour trees. Suppose M has n vertices, N facets, and t critical points. A classic result of Carr, Snoeyink, and Axen (2000) gives an algorithm that takes O(n log n+Nα(N)) time (where α(·) is the inverse Ackermann function). A further improvement to O(t log t + N) time was given by Chiang et al. All these algorithms involve a global sort of the critical points, a significant computational bottleneck. Unfortunately, lower bounds of Ω(t log t) also exist. We present the first algorithm that can avoid the global sort and has a refined time complexity that depends on the contour tree structure. Intuitively, if the tree is short and fat, we get significant improvements in running time. For a partition of the contour tree into a set of descending paths, P, our algorithm runs in O($\Sigma$ pϵP |p| log |p| + tα(t) + N). This is at most O(t log D + N), where D is the diameter of the contour tree. Moreover, it is O(tα(t) + N) for balanced trees, a significant improvement over the previous complexity. Our algorithm requires numerous ideas: partitioning the contour tree into join and split trees, a local growing procedure to iteratively build contour trees, and the use of heavy path decompositions for the time complexity analysis. There is a crucial use of a family of binomial heaps to maintain priorities, ensuring that any comparison made is between comparable nodes of the contour tree. We also prove lower bounds showing that the $\Sigma$ pϵP |p| log |p| complexity is inherent to computing contour trees.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Quantum Computing – Real-Time Data Processing from a Dilution Refrigerator

This poster presents a real-time data visualization system for monitoring and displaying data from a Bluefors control unit connected to a dilution refrigerator. The goal is to provide an aesthetically pleasing and user-friendly web-based interface that continuously updates and displays critical data such as temperature and flow rates at various points within the refrigerator. Leveraging WebSocket technology, the system establishes multiple connections to the dilution refrigerators, enabling simultaneous monitoring of several units. The interactive webpage dynamically updates the data, providing researchers and operators with instant insights into the system's performance. The system's ability to stream and visualize data in real-time enhances the understanding of the dilution refrigerator's behavior, aiding in optimizing its operation and ensuring efficient scientific experiments. The application's web-based nature makes it easily accessible from any device with internet connectivity, promoting seamless collaboration and remote monitoring capabilities. Overall, this poster offers a comprehensive solution for real-time data visualization and analysis of dilution refrigerators, catering to the needs of researchers and scientists working in low-temperature physics and quantum computing fields.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗