Search NASA⌕ Search

SEARCH · Search NASA

Results for “data mapping”

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 109 records · Page 6

Improving Performance of M-to-N Processing and Data Redistribution in In Transit Analysis and Visualization

In an in transit setting, a parallel data producer, such as a numerical simulation, runs on one set of ranks M, while a data consumer, such as a parallel visualization application, runs on a different set of ranks N. One of the central challenges in this in transit setting is to determine the mapping of data from the set of M producer ranks to the set of N consumer ranks. This is a challenging problem for several reasons, such as the producer and consumer codes potentially having different scaling characteristics and different data models. The resulting mapping from M to N ranks can have a significant impact on aggregate application performance. In this work, we present an approach for performing this M-to-N mapping in a way that has broad applicability across a diversity of data producer and consumer applications. We evaluate its design and performance with a study that runs at high concurrency on a modern HPC platform. By leveraging design characteristics, which facilitate an “intelligent” mapping from M-to-N, we observe significant performance gains are possible in terms of several different metrics, including time-to-solution and amount of data moved.

Loring, Burlen↗

Improving Performance of M-to-N Processing and Data Redistribution in In Transit Analysis and Visualization

In an in transit setting, a parallel data producer, such as a numerical simulation, runs on one set of ranks M, while a data consumer, such as a parallel visualization application, runs on a different set of ranks N: One of the central challenges in this in transit setting is to determine the mapping of data from the set of M producer ranks to the set of N consumer ranks. This is a challenging problem for several reasons, such as the producer and consumer codes potentially having different scaling characteristics and different data models. The resulting mapping from M to N ranks can have a significant impact on aggregate application performance. In this work, we present an approach for performing this M-to-N mapping in a way that has broad applicability across a diversity of data producer and consumer applications. We evaluate its design and performance with a study that runs at high concurrency on a modern HPC platform. By leveraging design characteristics, which facilitate an ''intelligent'' mapping from M-to-N, we observe significant performance gains are possible in terms of several different metrics, including time-to-solution and amount of data moved.

Loring, Burlen↗

Dimension Reduction and Redundancy Removal through Successive Schmidt Decompositions

Quantum computers are believed to have the ability to process huge data sizes, which can be seen in machine learning applications. In these applications, the data, in general, are classical. Therefore, to process them on a quantum computer, there is a need for efficient methods that can be used to map classical data on quantum states in a concise manner. On the other hand, to verify the results of quantum computers and study quantum algorithms, we need to be able to approximate quantum operations into forms that are easier to simulate on classical computers with some errors. Motivated by these needs, in this paper, we study the approximation of matrices and vectors by using their tensor products obtained through successive Schmidt decompositions. We show that data with distributions such as uniform, Poisson, exponential, or similar to these distributions can be approximated by using only a few terms, which can be easily mapped onto quantum circuits. The examples include random data with different distributions, the Gram matrices of iris flower, handwritten digits, 20newsgroup, and labeled faces in the wild. Similarly, some quantum operations, such as quantum Fourier transform and variational quantum circuits with a small depth, may also be approximated with a few terms that are easier to simulate on classical computers. Furthermore, we show how the method can be used to simplify quantum Hamiltonians: In particular, we show the application to randomly generated transverse field Ising model Hamiltonians. The reduced Hamiltonians can be mapped into quantum circuits easily and, therefore, can be simulated more efficiently.

97 MATHEMATICS AND COMPUTING↗

Scalable Data-Intensive Geocomputation: A Design for Real-Time Continental Flood Inundation Mapping

The convergence of data-intensive and extreme-scale computing enables an integrated software and data ecosystem for scientific discovery. Developments in this realm will fuel transformative research in data-driven interdisciplinary domains. Geocomputation provides computing paradigms in Geographic Information Systems (GIS) for interactive computing of geographic data, processes, models, and maps. Because GIS is data-driven, the computational scalability of a geocomputation workflow is directly related to the scale of the GIS data layers, their resolution and extent, as well as the velocity of the geo-located data streams to be processed. Unique in high user interactivity and low end-to-end latency requirements, geocomputation applications will dramatically benefit from the convergence of high-end data analytics (HDA) and high-performance computing (HPC). The application level challenge, however, is to identify and eliminate computational bottlenecks that arise along a geocomputation workflow. Indeed, poor scalability at any of the workflow components is detrimental to the entire end-to-end pipeline. Here, we study a large geocomputation use case in flood inundation mapping that handles multiple national-scale geospatial datasets and targets low end-to-end latency. We discuss benefits and challenges for harnessing both HDA and HPC for data-intensive geospatial data processing and intensive numerical modeling of geographic processes. We propose an HDA+HPC geocomputation architecture design that couples HDA (e.g., Spark)-based spatial data handling and HPC-based parallel data modeling. Key techniques for coupling HDA and HPC to bridge the two different software stacks are reviewed and discussed.

Liu, Yan↗

plexosdb: A Modular Library for Programmatic PLEXOS Model Construction

plexosdb is a lightweight Python library for constructing PLEXOS models using a SQLite-backed data structure. It provides a clear, modular interface that maps relational data directly to model components. By leveraging SQLite and idiomatic Python, it enables fast iteration and reproducible workflows. The result is a performant, composable foundation for scalable PLEXOS model development.

24 POWER TRANSMISSION AND DISTRIBUTION↗

NEON AOP foliar trait maps, maps of model uncertainty estimates, and conifer map, East River, CO 2018

This data package contains mapped trait estimates and their uncertainties, and conifer map, for the National Ecological Observatory Network's Airborne Observation Platform survey data acquired over the Upper East River, Colorado in 2018. For full details, please see associated reference. in brief, trait models were developed independently for needle and non-needle leaf species using partial least squares regression (PLSR) using ground data from additional datasets: doi:10.15485/1618130, doi:10.15485/1618132, and doi:10.15485/1631278, merged with extracted spectral data from doi:10.15485/1618131. We separated vegetated pixels into needle and non-needle classes in order to generate a classification map based on the spectral differences between these leaf types (conifer.tif). We trained a deep learning model with custom architecture, detailed in Chadwick et al. In Press. The model performed with 0.998 true positive rate and 0.982 true negative rate, with ‘positives’ being non-needle identification. We then utilized PLSR to generate models of foliar traits for each leaf type. So that we could also map uncertainty in these predictions, we generated ten different models for needle and non-needle leaf species using different testing holdout sets of discrete sites. Each of these models was developed with a 100-fold cross validation procedure that utilized a 70% training set and 30% validation set with each fold, and then assessed based on the 10% of testing sites that were not included in that model’s development. The mean predicted value across the 10 models is used for the trait estimate in each pixel across the study area. The models are applied according to the leaf type designation in the conifer.tif map. The errors are the standard deviation across the 10 different models developed, with high error suggesting instability in model prediction and areas where values may not be reliable for ecological inference. These maps are only applied to areas with a NDVI > 0.5 to exclude non-vegetated areas. Shade masks could be applied to these data (doi:10.15485/1618131), but have not been for this data package. These data are also available on Google Earth Engine: https://code.earthengine.google.com/?asset=users/kdc/ER_NEON

54 ENVIRONMENTAL SCIENCES↗

Data for: "Inorganic synthesis-structure maps in zeolites with machine learning..."

Repository containing all the data necessary to reproduce the paper "Inorganic synthesis-structure maps in zeolites with machine learning and crystallographic distances". This content includes: raw data for all results in the article; figures appearing in the main paper; and Jupyter notebooks and scripts containing the code for analyzing/reproducing the results.

Schwalbe Koda, Daniel↗

Where are the Data? Automating a Workflow for Carbon Storage Data Gap Analyses

This presentation demonstrates a spatial analysis workflow to assess data availability for the many components of geologic carbon storage technical viability. The workflow relies upon a knowledge-data framework that links the different components of GCS technical viability to the data types needed for evaluation. Using this contextual information, a combination of data science methods (e.g., natural language processing) and spatial analyses are applied to identify areas where sufficient data exists for a given component. The results are aggregated into maps illustrating data density and spatial gaps across all technical viability factors and data categories, as well as the individual component and category level for a more nuanced understanding. Presented at the FECM NETL Carbon Management Program Review Meeting 2024.

Creason, Christopher↗

Where are the Data? Automating a Workflow for Carbon Storage Data Gap Analyses

This presentation demonstrates a spatial analysis workflow to assess data availability for the many components of geologic carbon storage technical viability. The workflow relies upon a knowledge-data framework that links the different components of GCS technical viability to the data types needed for evaluation. Using this contextual information, a combination of data science methods (e.g., natural language processing) and spatial analyses are applied to identify areas where sufficient data exists for a given component. The results are aggregated into maps illustrating data density and spatial gaps across all technical viability factors and data categories, as well as the individual component and category level for a more nuanced understanding. Presented at the Geological Society of America Connects 2024 Annual Meeting in Anaheim, California, 22-25 September 2024.

Creason, Christopher↗

Improving precision and accuracy of genetic mapping with genotyping-by-sequencing data in outcrossing species

This dataset contains all data and supplementary materials from "Improving precision and accuracy of genetic mapping with genotyping-by-sequencing data in outcrossing species". An Excel file a list of all QTLs and linkage group length (in cM) obtained with two different SNP-calling methods (Tassel-Uneak and Tassel-GBS), genetic map-construction method (linkage-only and reference order-corrected) and depth filters (12x, 20x, 30x and 40x) for genetic mapping of 18 biomass yield traits in a biparental Miscanthus sinensis population using RAD-Seq SNPs is provided as "Supplementary file 1". A Perl script with the code for filtering VCF and HapMap-formatted data files is provided as “Supplementary file 2”. Phenotype data used for QTL mapping is provided as “Supplementary File 3”. A Perl script with the code for the simulation study is provided as “Supplementary file 4”.

GenotypingSimulator↗

National Center for Airborne Laser Mapping (NCALM) LiDAR, Imagery, and DEM data from five NGEE Arctic Sites, Seward Peninsula, Alaska, August 2021

From August 8 through August 16 of 2021, airborne remote sensing data was collected by the National Center for Airborne Laser Mapping (NCALM) in collaboration with NGEE Arctic scientists. Data was collected around five NGEE Arctic study sites on the Seward Peninsula of Alaska: Teller mm 27, Teller mm 47, Kougarok mm 64, Kougarok mm 86, and Council mm 71. A Robinson R44 II helicopter with a RIEGL VQ-580 II airborne laser scanner was used to collect the LiDAR point cloud data for each study site. A Phase One iXM-RS100F camera was integrated with the Riegl sensor to collect RGB imagery. This data package contains LiDAR point clouds (.las), RGB imagery (tif), 1 m or 50 cm Digital Elevation Models (.tif) generated from the LiDAR data, and shapefiles of the .las tiling system for each site (.shp). Two supplemental documents are also included in the package: 1) a report describing data collection details, GNSS corrections, and processing steps and 2) a document describing the LiDAR Classification used (.pdf). This survey was conducted towards the end of the summer on the Seward Peninsula, and can be paired with data collected in April of 2022 during the snow-on campaign "National Center for Airborne Laser Mapping (NCALM) LiDAR and DEM data from two NGEE Arctic Sites, Seward Peninsula, Alaska, Winter 2022" (Singhania et.al, 2023) (NGA314). The Next-Generation Ecosystem Experiments: Arctic (NGEE Arctic), was a research effort to reduce uncertainty in Earth System Models by developing a predictive understanding of carbon-rich Arctic ecosystems and feedbacks to climate. NGEE Arctic was supported by the Department of Energy's Office of Biological and Environmental Research. The NGEE Arctic project had two field research sites: 1) located within the Arctic polygonal tundra coastal region on the Barrow Environmental Observatory (BEO) and the North Slope near Utqiagvik (Barrow), Alaska and 2) multiple areas on the discontinuous permafrost region of the Seward Peninsula north of Nome, Alaska. Through observations, experiments, and synthesis with existing datasets, NGEE Arctic provided an enhanced knowledge base for multi-scale modeling and contributed to improved process representation at global pan-Arctic scales within the Department of Energy's Earth system Model (the Energy Exascale Earth System Model, or E3SM), and specifically within the E3SM Land Model component (ELM).

54 ENVIRONMENTAL SCIENCES↗

A priori analysis on deep learning of subgrid-scale parameterizations for Kraichnan turbulence

In the present study, we investigate different data-driven parameterizations for large eddy simulation of two-dimensional turbulence in the a priori settings. These models utilize resolved flow field variables on the coarser grid to estimate the subgrid-scale stresses. We use data-driven closure models based on localized learning that employs a multilayer feedforward artificial neural network with point-to-point mapping and neighboring stencil data mapping, and convolutional neural network fed by data snapshots of the whole domain. The performance of these data-driven closure models is measured through a probability density function and is compared with the dynamic Smagorinksy model (DSM). The quantitative performance is evaluated using the cross-correlation coefficient between the true and predicted stresses. We analyze different frameworks in terms of the amount of training data, selection of input and output features, their characteristics in modeling with accuracy, and training and deployment computational time. We also demonstrate computational gain that can be achieved using the intelligent eddy viscosity model that learns eddy viscosity computed by the DSM instead of subgrid-scale stresses. Here, we detail the hyperparameters optimization of these models using the grid search algorithm.

42 ENGINEERING↗

A Tale of Two Disks: Mapping the Milky Way with the Final Data Release of APOGEE

We present new maps of the Milky Way disk showing the distribution of metallicity ([Fe/H]), α-element abundances ([Mg/Fe]), and stellar age, using a sample of 66,496 red giant stars from the final data release (DR17) of the Apache Point Observatory Galactic Evolution Experiment survey. We measure radial and vertical gradients, quantify the distribution functions for age and metallicity, and explore chemical clock relations across the Milky Way for the low-α disk, high-α disk, and total population independently. The low-α disk exhibits a negative radial metallicity gradient of -0.06 ± 0.001 dex kpc -1 , which flattens with distance from the midplane. The high-α disk shows a flat radial gradient in metallicity and age across nearly all locations of the disk. The age and metallicity distribution functions shift from negatively skewed in the inner Galaxy to positively skewed at large radius. Significant bimodality in the [Mg/Fe]–[Fe/H] plane and in the [Mg/Fe]–age relation persist across the entire disk. The age estimates have typical uncertainties of ~0.15 in log(age) and may be subject to additional systematic errors, which impose limitations on conclusions drawn from this sample. Nevertheless, these results act as critical constraints on galactic evolution models, constraining which physical processes played a dominant role in the formation of the Milky Way disk. We discuss how radial migration predicts many of the observed trends near the solar neighborhood and in the outer disk, but an additional more dramatic evolution history, such as the multi-infall model or a merger event, is needed to explain the chemical and age bimodality elsewhere in the Galaxy.

79 ASTRONOMY AND ASTROPHYSICS↗

The Atacama Cosmology Telescope: a CMB lensing mass map over 2100 square degrees of sky and its cross-correlation with BOSS-CMASS galaxies

In this work, we construct cosmic microwave background lensing mass maps using data from the 2014 and 2015 seasons of observations with the Atacama Cosmology Telescope (ACT). These maps cover 2100 square degrees of sky and overlap with a wide variety of optical surveys. The maps are signal dominated on large scales and have fidelity such that their correlation with the cosmic infrared background is clearly visible by eye. We also create lensing maps with thermal Sunyaev-Zel’dovich contamination removed using a novel cleaning procedure that only slightly degrades the lensing signal-to-noise ratio. The cross-spectrum between the cleaned lensing map and the BOSS CMASS galaxy sample is detected at 10σ significance, with an amplitude of A = 1.02 ± 0.10 relative to the Planck best-fitting Lambda cold dark matter cosmological model with fiducial linear galaxy bias. Our measurement lays the foundation for lensing cross-correlation science with current ACT data and beyond.

79 ASTRONOMY AND ASTROPHYSICS↗

Data Movement Categories

We have endeavored to classify the commonly seen data movement needs, as observed in data-intensive institutions (both commercial and non-profit), into four categories. Knowing how to map a data movement task into one of the four categories helps select proper data mover tools. For each category, how the data storage is involved, high-level examples and the nature of typical solutions are described. Finally, some general remarks are provided to help further orient readers new to this field - the 4th IT pillar.

99 GENERAL AND MISCELLANEOUS↗

Exploiting Colorimetry for Fidelity in Data Visualization

Advances in multimodal characterization methods fuel the generation of increasing immense hyper-dimensional data sets. Color mapping is employed for conveying higher dimensional data in two-dimensional (2D) representations for human consumption without relying on multiple projections. How one constructs these color maps, however, critically affects how accurately one perceives data. For simple scalar fields, perceptually uniform color maps and color selection have been shown to improve data readability and interpretation across research fields. In this work, we review core concepts underlying the design of perceptually uniform color maps and extend the concepts from scalar fields to two-dimensional vector fields and three-component composition fields frequently found in materials-chemistry research to enable high-fidelity visualization. Additionally, we develop the software tools PAPUC and CMPUC to enable researchers to utilize these colorimetry principles and employ perceptually uniform color spaces for rigorously meaningful color mapping of higher dimensional data representations. Last, we demonstrate how these approaches deliver immediate improvements in data readability and interpretation in microscopies and spectroscopies routinely used in discerning materials structure, chemistry, and properties.

36 MATERIALS SCIENCE↗

Dark energy survey year 3 results: likelihood-free, simulation-based w CDM inference with neural compression of weak-lensing map statistics

We present simulation-based cosmological wcold dark matter (wCDM) inference using dark energy survey year 3 weak-lensing maps, via neural data compression of weak-lensing map summary statistics: power spectra, peak counts, and direct map-level compression/inference with convolutional neural networks (CNN). Using simulation-based inference, also known as likelihood-free or implicit inference, we use forward-modelled mock data to estimate posterior probability distributions of unknown parameters. This approach allows all statistical assumptions and uncertainties to be propagated through the forward-modelled mock data; these include sky masks, non-Gaussian shape noise, shape measurement bias, source galaxy clustering, photometric redshift uncertainty, intrinsic galaxy alignments, non-Gaussian density fields, neutrinos, and non-linear summary statistics. We include a series of tests to validate our inference results. This paper also describes the Gower Street simulation suite: 791 full-sky pkdgrav3 dark matter simulations, with cosmological model parameters sampled with a mixed active-learning strategy, from which we construct over 3000 mock dark energy survey lensing data sets. For wCDM inference, for which we allow –1 < w < –$\frac{1}{3}$⁠, our most constraining result uses power spectra combined with map-level (CNN) inference. Using gravitational lensing data only, this map-level combination gives Ω m = 0.283$^{+0.020}_{–0.027}$⁠, S 8 = 0.804$^{+0.025}_{–0.017⁠}$, and w < –0.80 (with a 68 per cent credible interval); compared to the power spectrum inference, this is more than a factor of two improvement in dark energy parameter (Ω⁠ DE , w⁠) precision.

79 ASTRONOMY AND ASTROPHYSICS↗

In-Line Membrane Thickness Mapping with Real-Time Data Processing

The goal of this project is commercialization of a novel, patented by NREL, non-contact, in-line quality control thickness mapping tool that will enable 100% area inspection of multilayer polymer film assemblies, such as a PEM on a casting substrate, during continuous high-volume R2R manufacturing.

ENGINEERING,HYDROGEN↗