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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
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 OSTI2016

Mitochondrial protein functions elucidated by multi-omic mass spectrometry profiling

Mitochondrial dysfunction is associated with many human diseases, including cancer and neurodegeneration, that are often linked to proteins and pathways that are not well-characterized. To begin defining the functions of such poorly characterized proteins, we used mass spectrometry to map the proteomes, lipidomes and metabolomes of 174 yeast strains, each lacking a single gene related to mitochondrial biology. 144 of these genes have human homologs, 60 of which are associated with disease and 39 of which are uncharacterized. We present a multi-omic data analysis and visualization tool that we use to find covariance networks that can predict molecular functions, correlations between profiles of related gene deletions, gene-specific perturbations that reflect protein functions, and a global respiration deficiency response. Using this multi-omic approach, we link seven proteins including Hfd1p and its human homolog ALDH3A1 to mitochondrial coenzyme Q (CoQ) biosynthesis, an essential pathway disrupted in many human diseases. This Resource should provide broad molecular insights into mitochondrial protein functions.

59 BASIC BIOLOGICAL SCIENCES↗
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 OSTI2014

Dax v. 1.0

The Dax Toolkit enables the fine-grained concurrency for data analysis and visualization required to drive multi-core processors, many-core GPU accelerators, and emerging architectures for exascale computing. Dax simplifies the design of finely threaded algorithms by characterizing them in per element operations, which we call worklets. Worklets simplify design because they can behave as serial processes without the complications of memory clashes or other race conditions. Yet worklets can be scheduled on a practically unlimited number of threads, thereby making effective utilization of many processing cores. Operations coordinated across elements are encapsulated in a few versatile communicative operations that are adapted to the specifics of computing devices.

SciDAC↗
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 OSTI2013

Light Water Reactor Sustainability Program Support and Modeling for the Boiling Water Reactor Station Black Out Case Study Using RELAP and RAVEN

The existing fleet of nuclear power plants is in the process of extending its lifetime and increasing the power generated. In order to evaluate the impact of these two factors on the safety of the plant, the Risk Informed Safety Margin Characterization (RISMC) project aims to provide insight to decision makers through a series of simulations of the plant dynamics for different initial conditions (e.g., probabilistic analysis and uncertainty quantification). This report focuses, in particular, on the impact of power uprate on the safety of a boiled water reactor system. The case study considered is a loss of off-site power followed by the loss of diesel generators, i.e., a station black out (SBO) event. Analysis is performed by using a thermo-hydraulic code, i.e. RELAP-5, and a stochastic analysis tool currently under development at INL, i.e. RAVEN. Starting from the event tree models contained in SAPHIRE, we built the input file for RELAP-5 that models in great detail system dynamics under SBO conditions. We also interfaced RAVEN with RELAP-5 so that it would be possible to run multiple RELAP-5 simulation runs by changing specific keywords of the input file. We both employed classical statistical tools, i.e. Monte-Carlo, and more advanced machine learning based algorithms to perform uncertainty quantification in order to quantify changes in system performance and limitations as a consequence of power uprate. We also employed advanced data analysis and visualization tools that helped us to correlate simulation outcome such as maximum core temperature with a set of input uncertain parameters. Results obtained gave a detailed overview of the issues associated to power uprate for a SBO accident scenario. We were able to quantify how timing of safety related events were impacted by a higher reactor core power. Such insights can provide useful material to the decision makers to perform risk-infomed safety margins management.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2015

An Update on Improvements to NiCE Support for PROTEUS

The Department of Energy Office of Nuclear Energy's Nuclear Energy Advanced Modeling and Simulation (NEAMS) program has supported the development of the NEAMS Integrated Computational Environment (NiCE), a modeling and simulation workflow environment that provides services and plugins to facilitate tasks such as code execution, model input construction, visualization, and data analysis. This report details the development of workflows for the reactor core neutronics application, PROTEUS. This advanced neutronics application (primarily developed at Argonne National Laboratory) aims to improve nuclear reactor design and analysis by providing an extensible and massively parallel, finite-element solver for current and advanced reactor fuel neutronics modeling. The integration of PROTEUS-specific tools into NiCE is intended to make the advanced capabilities that PROTEUS provides more accessible to the nuclear energy research and development community. This report will detail the work done to improve existing PROTEUS workflow support in NiCE. We will demonstrate and discuss these improvements, including the development of flexible IO services, an improved interface for input generation, and the addition of advanced Fortran development tools natively in the platform.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
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↗
DOE OSTI2021

SoDaH: the SOils DAta Harmonization database, an open-source synthesis of soil data from research networks, version 1.0

Data collected from research networks present opportunities to test theories and develop models about factors responsible for the long-term persistence and vulnerability of soil organic matter (SOM). Synthesizing datasets collected by different research networks presents opportunities to expand the ecological gradients and scientific breadth of information available for inquiry. Synthesizing these data is challenging, especially considering the legacy of soil data that have already been collected and an expansion of new network science initiatives. To facilitate this effort, here we present the SOils DAta Harmonization database (SoDaH; https://lter.github.io/som-website, last access: 22 December 2020), a flexible database designed to harmonize diverse SOM datasets from multiple research networks. SoDaH is built on several network science efforts in the United States, but the tools built for SoDaH aim to provide an open-access resource to facilitate synthesis of soil carbon data. Moreover, SoDaH allows for individual locations to contribute results from experimental manipulations, repeated measurements from long-term studies, and local- to regional-scale gradients across ecosystems or landscapes. Finally, we also provide data visualization and analysis tools that can be used to query and analyze the aggregated database. The SoDaH v1.0 dataset is archived and available at https://doi.org/10.6073/pasta/9733f6b6d2ffd12bf126dc36a763e0b4 (Wieder et al., 2020).

54 ENVIRONMENTAL SCIENCES↗