Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “metadata”

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 1,117 records · Page 62
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

DOE Geothermal Data Repository: Getting More Mileage Out of Your Data: Preprint

All data submitted to the U.S. Department of Energy's Geothermal Data Repository (GDR) is eventually made public. The metadata for these data submissions is searchable in multiple data catalogs, including the GDR catalog and the data catalog on OpenEI.org. Because it is a node on the National Geothermal Data System (NGDS), all data on the GDR are also discoverable through both the regular Identifier (DOI), and as a byproduct of this assignment, these submissions are automatically registered in the Office of Science and Technical Information (OSTI) DataCite catalog. From there, these data are federated to additional sites both domestic and international, including Science.gov and WorldWideScience.org. This paper will explore in detail the wide reach of data submitted to the GDR from and how this exposure can dramatically increase the utility of submitted data.

15 GEOTHERMAL ENERGY↗
DOE OSTI2017

HodDB: Design and Analysis of a Query Processor for Brick.

Brick is a recently proposed metadata schema and ontology for describing building components and the relationships between them. It represents buildings as directed labeled graphs using the RDF data model. Using the SPARQL query language, building-agnostic applications query a Brick graph to discover the set of resources and relationships they require to operate. Latency-sensitive applications, such as user interfaces, demand response and modelpredictive control, require fast queries — conventionally less than 100ms. We benchmark a set of popular open-source and commercial SPARQL databases against three real Brick models using seven application queries and find that none of them meet this performance target. This lack of performance can be attributed to design decisions that optimize for queries over large graphs consisting of billions of triples, but give poor spatial locality and join performance on the small dense graphs typical of Brick. We present the design and evaluation of HodDB, a RDF/SPARQL database for Brick built over a node-based index structure. HodDB performs Brick queries 3-700x faster than leading SPARQL databases and consistently meets the 100ms threshold, enabling the portability of important latency-sensitive building applications.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2025

Lessons Learned from AskGDR: Usage and Impact Analysis of the Geothermal Data Repository's AI Research Assistant: Preprint

In October of 2024, the Department of Energy's (DOE) Geothermal Data Repository (GDR) team officially launched AskGDR, an AI research assistant resulting from the integration of a Large Language Model (LLM) with the metadata and supporting documents associated with GDR datasets. AskGDR allows GDR users to ask deeper questions about the origin of datasets, the methods used to collect them, and the findings they help support. Using Retrieval Augmented Generation (RAG), AskGDR can be used to summarize findings spread across dozens of papers and technical reports or to extract relevant information describing a single data field. However, generative AI is experimental. The National Renewable Energy Laboratory (NREL) has been collecting metrics on AskGDR and documenting lessons learned during its deployment. This paper will outline the efficacy and impact of AskGDR through analysis of its use, operating costs, number and types of questions asked, and the quality of answers provided.

15 GEOTHERMAL ENERGY↗
DOE OSTI2015

Load‐balanced and locality‐aware scheduling for data‐intensive workloads at extreme scales

Summary Data‐driven programming models such as many‐task computing (MTC) have been prevalent for running data‐intensive scientific applications. MTC applies over‐decomposition to enable distributed scheduling. To achieve extreme scalability, MTC proposes a fully distributed task scheduling architecture that employs as many schedulers as the compute nodes to make scheduling decisions. Achieving distributed load balancing and best exploiting data locality are two important goals for the best performance of distributed scheduling of data‐intensive applications. Our previous research proposed a data‐aware work‐stealing technique to optimize both load balancing and data locality by using both dedicated and shared task ready queues in each scheduler. Tasks were organized in queues based on the input data size and location. Distributed key‐value store was applied to manage task metadata. We implemented the technique in MATRIX, a distributed MTC task execution framework. In this work, we devise an analytical suboptimal upper bound of the proposed technique, compare MATRIX with other scheduling systems, and explore the scalability of the technique at extreme scales. Results show that the technique is not only scalable but can achieve performance within 15% of the suboptimal solution. Copyright © 2015 John Wiley & Sons, Ltd.

Wang, Ke↗
DOE OSTI2022

Evaluation of a scientific data search infrastructure

The ability to search over large scientific datasets has become crucial to next-generation scientific discoveries as data generated from scientific facilities grow dramatically. In previous work, we developed and deployed ScienceSearch, a search infrastructure for scientific data which uses machine learning to automate metadata creation. Our current deployment is deployed atop a container based platform at a HPC center. In this article, we present an evaluation and discuss our experiences with the ScienceSearch infrastructure. Specifically, we present a performance evaluation of ScienceSearch's infrastructure focusing on scalability trends. The obtained results show that ScienceSearch is able to serve up to 130 queries/min with latency under 3 s. We discuss our infrastructure setup and evaluation results to provide our experiences and a perspective on opportunities and challenges of our search infrastructure.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2018

FishGen.net: An Online Genetic Repository for Salmon and Steelhead Genetic Baselines

Abstract FishGen is a final repository for Pacific salmon Oncorhynchus spp. and steelhead O. mykiss genetic data generated as part of the genetic stock identification and parentage-based tagging projects in the Columbia River basin and throughout the Pacific Coast of North America. Resource Data, Inc., developed this web-based, GIS-interfaced software, which is freely available to the public, with funding from the Pacific Coastal Salmon Recovery Fund and Bonneville Power Administration. FishGen currently houses genetic stock identification baselines for both Chinook Salmon O. tshawytscha and steelhead in the Columbia and Snake river basins, as well as hatchery, parentage-based, tagging baselines for both species in the Snake River basin. Because it has a user-friendly interface and protocol for submitting and storing standardized genetic and sample metadata, it is an excellent tool for supporting genetic research and monitoring projects throughout the region.

McCane, Jesse↗
DOE OSTI2013

Instrumental temperature series in eastern and central China back to the nineteenth century

In this study, we bring together different source data sets and use quality control, interpolation, and homogeneity methods to construct a set of homogenized monthly mean surface air temperature (SAT) series for 18 stations in eastern and central China from the late nineteenth century. Missing values are statistically interpolated, and cross validation is used to assess the accuracy of the interpolation approaches. Results show that the errors of interpolation are small, and the interpolated values are statistically acceptable. Multiple homogeneity methods and all available metadata are used to assess the consistency of the time series and then to develop adjustments when necessary. Thirty-three homogeneity breakpoints are detected in the 18 stations, and the time series is adjusted to the latest segment of the data series. The adjusted annual mean SAT generally shows a range of trends of 1.0° to 4.2°C/100 years in northeastern and southeastern China and a range of trends of -0.3° to 1.0°C/100 years in central China near 30°N. Compared to the adjusted time series, the unadjusted time series underestimates the warming trend during the past 100 years. The regional and annual mean SAT over eastern and central China agrees well with estimates from a much denser station network over this region of China since 1951 and shows a warming trend of 1.52°C/100 years during 1909–2010.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2026

The Zooplankton International Geospatial dataset: A global repository of spatiotemporal freshwater zooplankton community composition data from lakes and reservoirs to support ecological research

Zooplankton transfer substantial energy in aquatic food webs and are used as indicators of environmental change. Syntheses of zooplankton community dynamics globally require datasets that span a wide range of environmental gradients; however, these datasets are limited due to methodological differences across programs, taxonomic inconsistencies, and a lack of standardized metadata. To reconcile these challenges, we created the Zooplankton International Geospatial (ZIG) dataset, which includes original zooplankton, water physical and chemical variables, and lake morphometric data from 311 inland lakes and reservoirs. ZIG includes waterbodies ranging in size from 0.005 to 82,100 km2 and spanning broad latitudinal (−47.26 to 64.90) and longitudinal ranges (−165.04 to 176.53). Temporal coverage for individual waterbodies ranges between 1 and 60 yr with sampling frequency ranging from annually to weekly. With its extensive coverage and content, we consider ZIG to be a cornerstone for future investigations of global scale lake biodiversity change.

Figary, Stephanie [Cornell University, Ithaca, NY]↗
DOE OSTI2018

Advancing our predictive understanding of river corridor exchange

Despite decades of research, we lack an accurate framework to predict and manage hydrologic exchange in the river corridor and the associated ecosystem services and functions at the scales of stream reaches and entire networks. While many individual studies have been conducted to investigate specific mechanisms, they have not been synthesized to account for heterogeneity in space, nonstationarity, and multiscale feedbacks that typify the river corridor. As a result, contradictory predictions of exchange flux, geometry, and timescale are prevalent in the literature. We attribute these contradictions to (a) failure to account for multiscale feedbacks and (b) uncertainty in the information content of common measurement methods. Here, we apply the concept of interacting multiscale spatial and time‐variable domains to the river corridor to demonstrate why more complete multiscale characterization is necessary to achieve predictive understanding. Next, we highlight uncertainties and inconsistencies in measurement methods which may obfuscate our understanding of river corridor exchange. Finally, we briefly outline four necessary advances to achieve predictive understanding of river corridor exchange: standardization of metadata, critical evaluation of the information content and support volumes for measurement techniques, multiscale model‐data integration, and advancing theoretical models of river corridor exchange. This article is categorized under: Science of Water > Hydrological Processes Water and Life > Nature of Freshwater Ecosystems Science of Water > Methods

Ward, Adam S.↗
DOE OSTI2019

A Quantitative Approach to Architecting All-Flash Lustre File Systems

New experimental and AI-driven workloads are moving into the realm of extreme-scale HPC systems at the same time that high-performance flash is becoming cost-effective to deploy at scale. This confluence poses a number of new technical and economic challenges and opportunities in designing the next generation of HPC storage and I/O subsystems to achieve the right balance of bandwidth, latency, endurance, and cost. In this work, we present quantitative models that use workload data from existing, disk-based file systems to project the architectural requirements of all-flash Lustre file systems. Using data from NERSC’s Cori I/O subsystem, we then demonstrate the minimum required capacity for data, capacity for metadata and data-on-MDT, and SSD endurance for a future all-flash Lustre file system.

Lockwood, GK↗
DOE OSTI2020

Performance Improvements on SNS and HFIR Instrument Data Reduction Workflows Using Mantid

Performance of data reduction workflows at the High Flux Isotope Reactor (HFIR) and the Spallation Neutron Source (SNS) at Oak Ridge National Laboratory (ORNL) is mainly determined by the time spent loading raw measurement events stored in large and sparse datasets. This paper describes: (1) our long-term view to leverage SNS and HFIR data management needs with our experience at ORNL’s world-class high performance computing (HPC) facilities, and (2) our short-term efforts to speed up current workflows using Mantid, a data analysis and reduction community framework used across several neutron scattering facilities. We show that minimally invasive short-term improvements in metadata management have a moderate impact in speeding up current production workflows. We propose a more disruptive domain-specific solution: the No Cost Input Output (NCIO) framework, we provide an overview, the risks and challenges in NCIO’s adoption by HFIR and SNS stakeholders.

Godoy, William↗
DOE OSTI2023

Data Center Facility Monitoring with Physics Aware Approach

U.S. Department of Energy's National Renewable Energy Laboratory (NREL) hosts one of the world's most energy-efficient HPC data centers; this system uses component-level warm-water liquid cooling to efficiently remove heat from the data center and capture it for reuse in the building or rejection to the atmosphere. Given the complexity of this system, building data-driven tools for holistically monitoring and operating the entire data center is a priority for ensuring maximal efficiency and resiliency. In this advanced smart facility, over one million metrics are recorded per minute using state-of-the-art streaming data architecture and software to capture and process the state of the system in real time. Here we detail two efforts to effectively analyze, visualize, and interpret this large volume streaming data. We have developed a novel, flexible system for identifying and visualizing individual metric anomalies and component performance across the data center through automatic metadata extraction and physically-motivated visualization for quick interpretation. Additionally, to directly connect system maintenance to data stream processing we explore a physics informed multi-metric drift and anomaly detection application to detect scale-build up in heat exchangers.

anomaly detection↗
DOE OSTI2014

RADAR: Runtime Asymmetric Data-access Driven Scientific Data Replication

Efficient I/O on large-scale spatiotemporal scientific data requires scrutiny of both the logical layout of the data (e.g., row-major vs. column-major) and the physical layout (e.g., distribution on parallel filesystems). For increasingly complex datasets, hand optimization is a difficult matter prone to error and not scalable to the increasing heterogeneity of analysis workloads. Given these factors, we present a partial data replication system called RADAR. We capture datatype- and collective-aware I/O access patterns (indicating logical access) via MPI-IO tracing and use a combination of coarse-grained and fine-grained performance modeling to evaluate and select optimized physical data distributions for the task at hand. Unlike conventional methods, we store all replica data and metadata, along with the original untouched data, under a single file container using the object abstraction in parallel filesystems. Our system results in manyfold improvements in some commonly used subvolume decomposition access patterns.Moreover, the modeling approach can determine whether such optimizations should be undertaken in the first place.

access pattern↗
DOE OSTI2022

Domain-Specific Type-Safe APIs for Hierarchical Scientific Data with Modern C++

General-purpose library application programming interfaces (APIs) for self-describing hierarchical scientific data storage, such as the HDF5 and NetCDF libraries, are traditionally of runtime nature. Runtime errors for entry existence and data types are typically caught later in the development process of higher-level application-specific APIs. In this paper, we propose exploiting modern C++ metaprogramming features to add compile-time type-safety to improve the interaction with a well-defined metadata-rich scientific schema in domain-specific hierarchical datasets. We tackle two aspects of common use: (i) direct data access, (ii) flexible “in-memory” index models for efficient search and data processing. The proposed APIs use C++17’s template type auto deduction features, C++11’s enum class for type-safety and C-style preprocessor macros for generative templated code. We showcase the pros and cons of our initial work on the standard NeXus schema used for annotating and storing experimental neutron scattering data at several facilities around the world on top of HDF5. Extendable compile-time type-safe APIs are a desirable feature that could be indexed by any modern integrated development environment (IDE). Hence, such APIs can help ease the learning curve for domain scientists using a less error-prone software interaction to enhance the findability of their data without resorting to a domain-specific language (DSL).

Godoy, William↗
DOE OSTI2025

Changes to virus taxonomy, the international code of virus classification and nomenclature, and the ICTV statutes ratified by the International Committee on Taxonomy of Viruses (2025)

Abstract The 56th meeting of the Executive Committee (EC) of the International Committee on Taxonomy of Viruses (ICTV) was held in Bari, Italy, in July/August, 2024, and 115 submitted taxonomy proposals were reviewed. A total of 112 were subsequently ratified by the ICTV membership. An additional 9 error correction proposals were also approved in August 2025. This article lists the taxonomy proposals that have now been incorporated into release 40 version v2 of the Master Species List ( https://ictv.global/msl ), the Virus Metadata Resource ( https://ictv.global/vmr ), and associated ICTV databases. In addition to the assignments of 1,563 new virus species, 243genera, 55 families, 11 orders, and 8 classes, there were substantial additions to higher taxonomic ranks. These include the creation of a new realm ( Singelaviria ), which is based on the recognition of a separate evolutionary origin for the hallmark capsid genes of members of the kingdom Helvetiavirae. These express capsid proteins forming a single jelly-roll fold that is structurally and evolutionarily distinct from those of members of the family Bamfordvirae , assigned to the realm Varidnaviria . Furthermore, the realm Varidnaviria underwent a major reorganization, including the addition of a new kingdom, Abadenavirae . Another notable change was the classification of the vertebrate-infecting single-stranded DNA anellovirids into a new phylum Commensaviricota (kingdom Shotokuvirae , realm Monodnaviria ). Archaeal viruses infecting the hyperthermophilic Archaeoglobi were assigned to a new phylum Calorviricota , in the kingdom Trapavirae (realm Monodnaviria ), whereas RNA viruses infecting hyperthermophilic bacteria were classified into a new phylum Artimaviricota (realm Riboviria ). In recognition of his extensive and valuable contributions to virus taxonomic developments in Study Groups and over the period of his EC membership, Stuart Siddell was honoured as a new life member of the ICTV. The ICTV has created a new strategy for disseminating information on taxonomy advances through annual open-access publication of citeable taxonomy proposal summaries from each ICTV Subcommittee. A collective total of 354 co-authors of the seven summaries were drawn from members of each Subcommittee, the EC, and a very large number of contributors from the wider virology community.

Simmonds, Peter (ORCID:0000000279644700)↗
DOE OSTI2026

Do we have globally representative data to understand soil processes?

Understanding and modeling soils and soil organic matter (SOM) are central to a variety of human needs, from food production to ecosystem management. Soil data have been collected for over a century, but the global spatial and process representativeness of soil data remains unclear. We assessed the representativeness of currently available soil data that could be used to understand a variety of SOM processes. We used 16 open-source soil databases and data from over 281,000 unique locations globally, categorizing the databases into three main data types necessary to understand SOM processes: soil carbon stocks and fluxes, mechanistic drivers of these stocks and fluxes, and soil carbon gain or loss potential. We found that stock and driver data have extensive global coverage. However, data on soil carbon gain or loss potential, particularly data describing change in soils over time such as time series data, are severely limited in their global coverage. We conclude that while significant strides have been made in measuring soil carbon stocks and fluxes, and their drivers, we are limited in global data related to changes in soils over time. Our recommendations for soil data generators are to ensure precise metadata reporting and prioritizing sampling in underrepresented areas like tropical, arctic, mountainous, wetland and arid regions. We also encourage designing revisit schemes that explicitly support change detection and reporting multi-modal datasets that can aid in model development. Targeted measurement of low coverage soil data types and regions is necessary for a range of applications including current and future biogeochemical predictions, and their management and policy implications.

carbon fluxes↗
DOE OSTI2024

GraphTango: A Hybrid Representation Format for Efficient Streaming Graph Updates and Analysis

Abstract Streaming graph processing performs batched updates and analytics on a time-evolving graph. The underlying representation format of the graph largely determines the throughputs of these updates and analytics phases. Existing representation formats usually employ variations of hash tables or adjacency lists. However, a recent study showed that the adjacency-list-based approaches perform poorly on heavy-tailed graphs, and the hash table-based approaches suffer on short-tailed graphs. We propose GraphTango, a hybrid representation format that provides excellent update and analytics throughput regardless of the graph’s degree distribution. GraphTango dynamically switches among three different formats based on a vertex’s degree: (i) Low-degree vertices store the edges directly with the neighborhood metadata, confining accesses to a single cache line, (2) Medium-degree vertices use adjacency lists, and (3) High-degree vertices use hash tables as well as adjacency lists. In this case, the adjacency list provides fast traversal during the analytics phase, while the hash table provides constant-time lookups during the update phase. We further optimized the performance by designing an open-addressing-based hash table that fully utilizes every fetched cache line. In addition, we developed a thread-local lock-free memory pool that allows fast growing/shrinking of the adjacency lists and hash tables in a multi-threaded environment. We evaluated GraphTango with the help of the SAGA-Bench framework and compared it with four other representation formats: Stinger, Degree-aware Robin Hood Hashing, and two adjacency list-based formats with different workload balancing scheme. On average, GraphTango provides 4.5x higher insertion throughput, 3.2x higher deletion throughput, and 1.1x higher analytics throughput over the next best format. Furthermore, we integrated GraphTango with the state-of-the-art graph processing frameworks DZiG and RisGraph. Compared to the vanilla DZiG and vanilla RisGraph , [ GraphTango + DZiG ] and [ GraphTango + RisGraph ] reduces the average batch processing time by 2.3x and 1.5x, respectively.

Ahmed, Alif↗