Search NASA⌕ Search

SEARCH · Search NASA

Results for “data discover”

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

EDXplorer: A Utility for APA Analysis

The automated particle analysis (APA) method of scanning electron microscopy (SEM) energy dispersive X-ray spectroscopy (EDS/EDX) is a useful tool for analyzing the elemental and morphological data of particulate samples. Often, such datasets have many thousands of particles, and it can be difficult to sift through the data to find meaningful trends. EDXplorer is a software utility for processing APA data. They enable the user to easily load data and determine the important components and aspects of the datasets using a powerful and versatile library of data plotting functions, mainly centered around scatter plots and histograms. These programs are intended to fill a void in the data processing of data from certain instruments, where often the user must rely on their own code or other software that is not user-friendly. EDXplorer is intended as a general plotting utility for browsing through data and discovering data trends.

Moseley, Duncan [ORNL] (ORCID:0000000343518347)↗

Exploiting Commonly-Reported Age-Hardening Data and Discovering Systematics Across Metallic Alloys and Alloy Systems to Identify Corrosion’s Most Influential Factors

This work explored ways to data mine legacy literature and predict solid-solid precipitation in support of simpler assessment of corrosion propensity in metallic alloys. Of interest was locating the peak age watershed (maximum hardness or strength), beyond which lies the regime termed “overaging.” A diligent search of literature and reference books, discussions with SMEs, and application of various algorithms showed that none of the premises going in held up to scrutiny.

36 MATERIALS SCIENCE↗

An ultra-faint galaxy candidate discovered in early data from the magellanic satellites survey

We report a new ultra-faint stellar system found in Dark Energy Camera data from the first observing run of the Magellanic Satellites Survey (MagLiteS). MagLiteS J0644−5953 (Pictor II or Pic II) is a low surface brightness (μ=28.5{sub −1}{sup +1} mag arcsec{sup −2} within its half-light radius) resolved overdensity of old and metal-poor stars located at a heliocentric distance of 45{sub −4}{sup +5} kpc. The physical size (r{sub 1/2}=46{sub −11}{sup +15} pc ) and low luminosity (M{sub V}=−3.2{sub −0.5}{sup +0.4} mag ) of this satellite are consistent with the locus of spectroscopically confirmed ultra-faint galaxies. MagLiteS J0644−5953 (Pic II) is located 11.3{sub −0.9}{sup +3.1} kpc from the Large Magellanic Cloud (LMC), and comparisons with simulation results in the literature suggest that this satellite was likely accreted with the LMC. The close proximity of MagLiteS J0644−5953 (Pic II) to the LMC also makes it the most likely ultra-faint galaxy candidate to still be gravitationally bound to the LMC.

79 ASTRONOMY AND ASTROPHYSICS↗

Leveraging Application Data Constraints to Optimize Database-Backed Web Applications

Exploiting the relationships among data is a classical query optimization technique. As persistent data is increasingly being created and maintained programmatically, prior work that infers data relationships from data statistics misses an important opportunity. We present Coco, the first tool that identifies data relationships by analyzing database-backed applications. Once identified, Coco leverages the constraints to optimize the application's physical design and query execution. Instead of developing a fixed set of predefined rewriting rules, Coco employs an enumerate-test-verify technique to automatically exploit the discovered data constraints to improve query execution. Each resulting rewrite is provably equivalent to the original query. Using 14 real-world web applications, our experiments show that Coco can discover numerous data constraints from code analysis and improve real-world application performance significantly.

Computer Science↗

Data Transferability and Collection Consistency in Marine Renewable Energy

Concerns about the potential effects of tidal turbines and wave energy devices on the marine environment continue to slow siting and permitting/consenting of single devices and arrays worldwide. While research studies and early results from post-installation monitoring over the past decade have informed interactions between marine renewable energy (MRE) devices, marine animals, and habitats, regulators still demonstrate considerable reluctance to accelerate the permitting/consenting process for devices and arrays. Furthermore, the MRE industry is struggling with the high costs of baseline assessments and post-installation monitoring, as well as long timelines for obtaining permits, which leads to uncertainty and risk related to project financing. Regulators require assessment and monitoring information to allow them to carry out the necessary analyses to describe, permit/consent, and manage the environmental risks associated with new MRE technologies and new uses of ocean space. One way to reduce risks to the industry and the environment and to allow for acceleration of the permitting/consenting process could be to transfer learning, analyses, and data sets from one country to another, among projects, and across jurisdictional boundaries. In addition, data are collected around early-stage MRE devices using many different methods, instruments, and measurement scales. If similar parameters and accessible methods of data collection were used for baseline assessments and post-installation monitoring around all early-stage devices and MRE developments, the results would be more readily comparable. This comparability would lead to a decrease in scientific uncertainty and support a common understanding of the risk of MRE devices to the marine environment. This in turn would facilitate more efficient and shorter permitting/consenting processes, which would decrease the financial risk for MRE project development. As a means of addressing the concept of transferring data (information, learning, analyses, and data sets) among projects and collecting data consistently, Annex IV has developed a data transferability process that has been socialized with the MRE community, which includes regulators, industry, developers, consultants, and researchers. The data transferability process consists of five components: 1. A Data Transferability Framework brings together data sets in an organized fashion, compares the applicability of each data set for use on other projects, and guides the process of data transfer 2. A Data Collection Consistency Table provides preferred measurement methods or processes, reporting units, and the most common methods of analysis or interpretation and use of data 3. A Monitoring Data Sets Discoverability Matrix allows a practitioner to discover data sets based on the approach presented in the Framework 4. Best Management Practices (BMPs) include five BMPs related to data transferability and collection consistency 5. An Implementation Plan presents an approach for implementing and applying the data transferability process. This report documents the background and development of the data transferability process and associated components and summarizes the next steps needed to successfully implement and apply the data transferability process.

16 TIDAL AND WAVE POWER↗

Empowering Geothermal Research: The Geothermal Data Repository's New AI Research Assistant: Preprint

The Department of Energy's (DOE) Geothermal Data Repository (GDR) team has integrated a Large Language Model (LLM) with the metadata and supporting documents associated with GDR datasets to create an Artificially Intelligent (AI) research assistant. By leveraging work done to make GDR metadata machine-readable and an open-source LLM integration model called the Energy Language Model, developed by the National Renewable Energy Laboratory, AskGDR serves as a virtual research assistant to GDR users. It provides answers to a variety of user-provided questions using natural language processing and generative machine learning. Users can get answers to questions about specific datasets, including inquiries about the equipment, assumptions and methodologies used in the origination of the data; or more abstract questions, such as the applicability of data to specific research fields. AskGDR improves the discoverability of geothermal data by helping guide users to datasets beyond simple keyword searches. It enables users to find data based on properties of the data, discover information contained within supporting documents, and explore data from projects related to their research objectives.

access↗

Empowering Geothermal Research: The Geothermal Data Repository's New AI Research Assistant

The Department of Energy's (DOE) Geothermal Data Repository (GDR) team has integrated a Large Language Model (LLM) with the metadata and supporting documents associated with GDR datasets to create an Artificially Intelligent (AI) research assistant. By leveraging work done to make GDR metadata machine-readable and an open-source LLM integration model called the Energy Language Model, developed by the National Renewable Energy Laboratory, AskGDR serves as a virtual research assistant to GDR users. It provides answers to a variety of user-provided questions using natural language processing and generative machine learning. Users can get answers to questions about specific datasets, including inquiries about the equipment, assumptions and methodologies used in the origination of the data; or more abstract questions, such as the applicability of data to specific research fields. AskGDR improves the discoverability of geothermal data by helping guide users to datasets beyond simple keyword searches. It enables users to find data based on properties of the data, discover information contained within supporting documents, and explore data from projects related to their research objectives. This paper will outline the development, integration, output, and efficacy of the AskGDR LLM, including adherence to scientific rigor through improvements designed to increase the accuracy of generated answers, avoid speculation, and provide proper references for all resources used.

access↗

Semi-Analytical Hierarchical Bayesian Inference of Nonlinear Model Structure in Stochastic Dynamics: Applied to Compartmental Models of Infectious Diseases

A Bayesian computational framework for parsimonious inference in stochastic nonlinear dynamical systems is presented. This framework enables the concurrent estimation of system states, time-varying parameters, time-invariant parameters, and the optimal sparsity structure of the model parameters. Because differential equation-based models are often simplified mechanistic or phenomenological representations, robust inference from noisy measurement data requires explicit treatment of model error and uncertainty. Model error and time-varying parameters can be represented as random processes, enabling inference while making minimal assumptions about the underlying sources of discrepancy and variability. Adopting stochastic differential equation representations affords the model significant flexibility, but can also render it susceptible to overfitting during statistical inversion, where the inferred model may track noise rather than the underlying signal. To alleviate the effects of overfitting and to enable the discovery of the optimal sparse representation of the time-invariant parameters, a Bayesian sparse learning algorithm is embedded within the framework. This sparse learning framework adopts an approximate hierarchical Bayesian setting defined by a series of semi-analytical expressions. The model structure inference framework is validated using a stochastic compartmental model for tracking and forecasting active cases of an infectious disease. Compartmental models describe population-level infectious disease dynamics through interactions among population fractions grouped by disease state. Mathematically, such models consist of a system of coupled ordinary differential equations. This example adopts an expressive compartmental model that includes multiple possible interactions between disease states, motivated by early uncertainty surrounding COVID-19 reinfection dynamics and their implications for long-term epidemic forecasting. The sparse learning exercise permits the inference of a priori unknown epidemiological dynamics from simulated public health data, discovering the nested compartmental model that optimizes the trade-off between average data-fit and model complexity. It is shown that inducing sparsity among the model parameters eliminates redundant interactions between compartments, equivalently revealing the optimal coupling structure between differential equations.

97 MATHEMATICS AND COMPUTING↗

A Knowledge Graph Approach for the Secondary Use of Cancer Registry Data

Population-based central cancer registries collect valuable structured and unstructured data primarily for cancer surveillance and research, enhancing insights into clinical features associated with cancer occurrence, cancer treatment, and cancer outcomes to guide interventions which reduce the cancer burden. Cancer registries primarily collect data on (1) cancer type (case or tumor); (2) patient demographics such as age, gender, and residential address at time of diagnosis; (3) planned first course of treatment; and (4) date of last contact, vital status, and cause of death. Cancer registry data is dynamic, structured data, which is extracted from many unstructured sources such as electronic healthcare records, and consolidated for reporting and other purposes. While available advanced analytic tools such as SEER*Stat have the ability to build SAS queries, we, however, explore an innovative knowledge graph approach to organizing cancer registry data for advanced analytics and visualization, which has unique advantages over approaches of existing tools. This innovative knowledge graph approach semantically enriches the data and easily enables linkage with third-party data, which can better explain variation in outcomes. We have developed a prototype knowledge graph based on data from the Louisiana Tumor Registry and other publicly available datasets including Behavioral Risk Factor Surveillance System, Clinical Trials, DBpedia, GeoNames, Rural-Urban Continuum Codes, and Semantic MEDLINE. The resource description framework (RDF) data model was selected to represent our knowledge graph, which contains more than 25 billion triples and is ~4TB in storage size. To exhibit the benefits of the knowledge graph approach, we used scenario specific queries, which find the relationships between cancer treatment sequences and outcomes. To illustrate its ease of use in iterative analysis, the knowledge graph was linked to external datasets for performing complex queries across multiple datasets. In addition, we used knowledge graphs to identify data discrepancies and to handle schema changes. Finally, we visualized the knowledge graph to discover data patterns. Our results demonstrate this graph-based solution enables cancer researchers to execute complex queries and more easily perform iterative analyses to improve understanding of cancer registry data. In the future, we would like to use high-performance computing (HPC) resources for faster-generating hypotheses with clinical potential from our knowledge graph.

Hasan, S M Shamimul↗

Resource Discovery for Extreme Scale Collaboration (RDESC) Final Report - RPI/TWC - Year 3

The amount of data produced in the practice of science is growing rapidly. Despite the accumulation and demand for scientific data, relatively little is actually made available for the broader scientific community. We surmise that the root of the problem is the perceived difficulty to electronically publish scientific data and associated metadata in a way that makes it discoverable. We propose to exploit Semantic Web technologies and practices to make (meta)data discoverable and easy to publish. We share our experiences in curating metadata to illustrate both the flexibility of our approach and the pain of discovering data in the current research environment. We also make recommendations by concrete example of how data publishers can provide their (meta)data by adding some limited, additional markup to HTML pages on the Web. With little additional effort from data publishers, the difficulty of data discovery/access/sharing can be greatly reduced and the impact of research data greatly enhanced.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Saharan Dust Transport Predictability Utilizing a Subseasonal Experiment (SubX) Model

Prediction of Saharan dust customarily requires complex aerosols models and observations. A previous study of the Miami, Florida dust record in conjunction to reanalysis data discovered a possible source of subseasonal predictability using a dust-transport-efficiency (DTE) index. Development of the Subseasonal Forecast Experiment (SubX) has expanded global forecast products; producing multi-model ensemble forecasts out to 45 days. Retrospective forecast data from the Community Climate System Model version 4.0 (CCSM4) is used in direct comparison to National Centers for Environmental Prediction (NCEP) reanalysis to evaluate the CCSM4 subseasonal forecast and DTE index prediction skill of weekly dust variability. Successful prediction of weekly dust transport using the DTE index is variable year-to-year. The DTE most successfully predicts dust when there is high variability in the tropical winds, likely due to a fluctuating subtropical high, and is not dependent on the overall mean flow or total dust mass transported. The CCSM4 SubX retrospective forecast well represents North Atlantic meteorology out to week-3 in both mean flow and variability. Dust transport can be predicted using the DTE index and CCSM4 SubX retrospective forecasts at week-1 leads to the same success as contemporaneous NCEP reanalysis.

54 ENVIRONMENTAL SCIENCES↗

Ontology-Enriched Specifications Enabling Findable, Accessible, Interoperable, and Reusable Marine Metagenomic Datasets in Cyberinfrastructure Systems

Marine microbial ecology requires the systematic comparison of biogeochemical and sequence data to analyze environmental influences on the distribution and variability of microbial communities. With ever-increasing quantities of metagenomic data, there is a growing need to make datasets Findable, Accessible, Interoperable, and Reusable (FAIR) across diverse ecosystems. FAIR data is essential to developing analytical frameworks that integrate microbiological, genomic, ecological, oceanographic, and computational methods. Although community standards defining the minimal metadata required to accompany sequence data exist, they haven’t been consistently used across projects, precluding interoperability. Moreover, these data are not machine-actionable or discoverable by cyberinfrastructure systems. By making ‘omic and physicochemical datasets FAIR to machine systems, we can enable sequence data discovery and reuse based on machine-readable descriptions of environments or physicochemical gradients. In this work, we developed a novel technical specification for dataset encapsulation for the FAIR reuse of marine metagenomic and physicochemical datasets within cyberinfrastructure systems. This includes using Frictionless Data Packages enriched with terminology from environmental and life-science ontologies to annotate measured variables, their units, and the measurement devices used. This approach was implemented in Planet Microbe, a cyberinfrastructure platform and marine metagenomic web-portal. Here, we discuss the data properties built into the specification to make global ocean datasets FAIR within the Planet Microbe portal. We additionally discuss the selection of, and contributions to marine-science ontologies used within the specification. Finally, we use the system to discover data by which to answer various biological questions about environments, physicochemical gradients, and microbial communities in meta-analyses. This work represents a future direction in marine metagenomic research by proposing a specification for FAIR dataset encapsulation that, if adopted within cyberinfrastructure systems, would automate the discovery, exchange, and re-use of data needed to answer broader reaching questions than originally intended.

59 BASIC BIOLOGICAL SCIENCES↗

Discovery of Protein–lncRNA Interactions by Integrating Large-Scale CLIP-Seq and RNA-Seq Datasets

Long non-coding RNAs (lncRNAs) are emerging as important regulatory molecules in developmental, physiological, and pathological processes. However, the precise mechanism and functions of most of lncRNAs remain largely unknown. Recent advances in high-throughput sequencing of immunoprecipitated RNAs after cross-linking (CLIP-Seq) provide powerful ways to identify biologically relevant protein–lncRNA interactions. In this study, by analyzing millions of RNA-binding protein (RBP) binding sites from 117 CLIP-Seq datasets generated by 50 independent studies, we identified 22,735 RBP–lncRNA regulatory relationships. We found that one single lncRNA will generally be bound and regulated by one or multiple RBPs, the combination of which may coordinately regulate gene expression. We also revealed the expression correlation of these interaction networks by mining expression profiles of over 6000 normal and tumor samples from 14 cancer types. Our combined analysis of CLIP-Seq data and genome-wide association studies data discovered hundreds of disease-related single nucleotide polymorphisms resided in the RBP binding sites of lncRNAs. Finally, we developed interactive web implementations to provide visualization, analysis, and downloading of the aforementioned large-scale datasets. Our study represented an important step in identification and analysis of RBP–lncRNA interactions and showed that these interactions may play crucial roles in cancer and genetic diseases.

60 APPLIED LIFE SCIENCES↗

Two Ultra-faint Milky Way Stellar Systems Discovered in Early Data from the DECam Local Volume Exploration Survey

We report the discovery of two ultra-faint stellar systems found in early data from the DECam Local Volume Exploration survey (DELVE). The first system, Centaurus I (DELVE J1238-4054), is identified as a resolved overdensity of old and metal-poor stars with a heliocentric distance of ${\rm D}_{\odot} = 116.3_{-0.6}^{+0.6}$ kpc, a half-light radius of $r_h = 2.3_{-0.3}^{+0.4}$ arcmin, an age of $\tau > 12.85$ Gyr, a metallicity of $Z = 0.0002_{-0.0002}^{+0.0001}$, and an absolute magnitude of $M_V = -5.55_{-0.11}^{+0.11}$ mag. This characterization is consistent with the population of ultra-faint satellites, and confirmation of this system would make Centaurus I one of the brightest recently discovered ultra-faint dwarf galaxies. Centaurus I is detected in Gaia DR2 with a clear and distinct proper motion signal, confirming that it is a real association of stars distinct from the Milky Way foreground; this is further supported by the clustering of blue horizontal branch stars near the centroid of the system. The second system, DELVE 1 (DELVE J1630-0058), is identified as a resolved overdensity of stars with a heliocentric distance of ${\rm D}_{\odot} = 19.0_{-0.6}^{+0.5} kpc$, a half-light radius of $r_h = 0.97_{-0.17}^{+0.24}$ arcmin, an age of $\tau = 12.5_{-0.7}^{+1.0}$ Gyr, a metallicity of $Z = 0.0005_{-0.0001}^{+0.0002}$, and an absolute magnitude of $M_V = -0.2_{-0.6}^{+0.8}$ mag, consistent with the known population of faint halo star clusters. Here, given the low number of probable member stars at magnitudes accessible with Gaia DR2, a proper motion signal for DELVE 1 is only marginally detected. We compare the spatial position and proper motion of both Centaurus I and DELVE 1 with simulations of the accreted satellite population of the Large Magellanic Cloud (LMC) and find that neither is likely to be associated with the LMC.

79 ASTRONOMY AND ASTROPHYSICS↗

Method for discovering relationships in data by dynamic quantum clustering

Data clustering is provided according to a dynamical framework based on quantum mechanical time evolution of states corresponding to data points. To expedite computations, we can approximate the time-dependent Hamiltonian formalism by a truncated calculation within a set of Gaussian wave-functions (coherent states) centered around the original points. This allows for analytic evaluation of the time evolution of all such states, opening up the possibility of exploration of relationships among data-points through observation of varying dynamical-distances among points and convergence of points into clusters. This formalism may be further supplemented by preprocessing, such as dimensional reduction through singular value decomposition and/or feature filtering.

97 MATHEMATICS AND COMPUTING↗

Method for discovering relationships in data by dynamic quantum clustering

Data clustering is provided according to a dynamical framework based on quantum mechanical time evolution of states corresponding to data points. To expedite computations, we can approximate the time-dependent Hamiltonian formalism by a truncated calculation within a set of Gaussian wave-functions (coherent states) centered around the original points. This allows for analytic evaluation of the time evolution of all such states, opening up the possibility of exploration of relationships among data-points through observation of varying dynamical-distances among points and convergence of points into clusters. This formalism may be further supplemented by preprocessing, such as dimensional reduction through singular value decomposition and/or feature filtering.

97 MATHEMATICS AND COMPUTING↗

Beyond union of subspaces: Subspace pursuit on Grassmann manifold for data representation

Discovering the underlying structure of a high-dimensional signal or big data has always been a challenging topic, and has become harder to tackle especially when the observations are exposed to arbitrary sparse perturbations. Here in this paper, built on the model of a union of subspaces (UoS) with sparse outliers and inspired by a basis pursuit strategy, we exploit the fundamental structure of a Grassmann manifold, and propose a new technique of pursuing the subspaces systematically by solving a non-convex optimization problem using the alternating direction method of multipliers. This problem as noted is further complicated by non-convex constraints on the Grassmann manifold, as well as the bilinearity in the penalty caused by the subspace bases and coefficients. Nevertheless, numerical experiments verify that the proposed algorithm, which provides elegant solutions to the sub-problems in each step, is able to de-couple the subspaces and pursue each of them under time-efficient parallel computation.

97 MATHEMATICS AND COMPUTING↗