Search NASA⌕ Search

SEARCH · Search NASA

Results for “structured data”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 217 records · Page 12

Global and adaptive K-nearest neighbor graphs in a spectral target detector based on Schroedinger Eigenmaps

The Schroedinger Eigenmaps (SE) embedding has been previously introduced and applied to spectral target detection problems in hyperspectral imagery (HSI). The proposed SEbased detection approach combines the spectral and spatial connectivity of target-like pixels into the Schroedinger operator by using a “knowledge propagation” scheme. Likewise, it has been noted the impact that the local data structure modeling has over the SE-based detector. This local data structure is modeled by using an adjacency graph, i.e, set of vertices and edges, that in most of the applications is a k nearest neighbor (knn) graph. In this paper, the impact of k in the graph-building process is analyzed and assessed from a target detection point of view. Here, two ways to estimate the parameter k in the graph construction are considered and their assessment is performed by using two HSI data sets and the Receiver Optimal Curve (ROC) as a detection performance metric

97 MATHEMATICS AND COMPUTING↗

Tolerating Correlated Failures for Generalized Cartesian Distributions via Bipartite Matching

Faults are expected to play an increasingly important role in how algorithms and applications are designed to run on future extreme-scale systems. A key ingredient of any approach to fault tolerance is effective support for fault tolerant data storage. A typical application execution consists of phases in which certain data structures are modified while others are read-only. Often, read-only data structures constitute a large fraction of total memory consumed. Fault tolerance for read-only data can be ensured through the use of checksums or parities, without resorting to expensive in-memory duplication or checkpointing to secondary storage. In this paper, we present a graph-matching approach to compute and store parity data for read-only matrices that are compatible with fault tolerant linear algebra (FTLA). Typical approaches only support blocked data distributions with each process holding one block with the parity located on additional processes. The matrices are assumed to be blocked by a cartesian grid with each block assigned to a process. We consider a generalized distribution in which each process can be assigned arbitrary blocks. We also account for the fact that multiple processes might be part of the same failure unit, say an SMP node. The flexibility enabled by our novel application of graph matching extends fault tolerance support to data distributions beyond those supported by prior work. We evaluate the matching implementations and cost to compute the parity and recover lost data, demonstrating the low overhead incurred by our approach.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Harnessing expert knowledge: Defining a Bayesian network decision model with limited data-Model structure for the vibration qualification problem

As systems become more complex, systems engineers rely on experts to inform decisions. There are few experts and limited data in many complex new technologies. This challenges systems engineers as they strive to plan activities such as qualification in an environment where technical constraints are coupled with the traditional cost, risk, and schedule constraints. Bayesian network (BN) models provide a framework to aid systems engineers in planning qualification efforts with complex constraints by harnessing expert knowledge and incorporating technical factors. By quantifying causal factors, a BN model can provide data about the risk of implementing a decision supplemented with information on driving factors. This allows a systems engineer to make informed decisions and examine “what-if” scenarios. This paper discusses a novel process developed to define a BN model structure based primarily on expert knowledge supplemented with extremely limited data (25 data sets or less). The model was developed to aid qualification decisions—specifically to predict the suitability of six degrees of freedom (6DOF) vibration testing for qualification. The process defined the model structure with expert knowledge in an unbiased manner. Finally, validation during the process execution and of the model provided evidence the process may be an effective tool in harnessing expert knowledge for a BN model.

97 MATHEMATICS AND COMPUTING↗

ISO_Fortran_binding_m v0.1.0

The Fortran programming language standard defines a broad feature set supporting the interoperability of Fortran programs with program written according to the C programming language standard. Among Fortran's C-interoperability features is a a C header file "ISO_Fortran_binding.h" This header file defines the interface to various C data structures and functions that C programs may use to access Fortran data entities. The ISO_Fortran_binding_m software defines a native Fortran module that presents an interface to these same data structures and functions. ISO_Fortran_bind_m thus enables Fortran programs to access and manipulate Fortran entities in ways that precisely mirror what C programs can do using ISO_Fortran_binding.h. ISO_Fortran_binding_m facilitates writing portable standard-conforming Fortran programs that emulate non-interoperable features, e.g., dynamic polymorphism, in a standard-conforming interoperable way similar but broader than what is demonstrated in Berkeley Lab's Caffeine software [1]. ISO_Fortran_binding_m also enables a Fortran programmer to extend Fortran's capabilities to emulate certain C functionality such as memory address arithmetic or computing C's "sizeof" function. [1] https://github.com/BerkeleyLab/caffeine/blob/213e3df1c319f0663306354414f352acda42a24f/src/caffeine/collective_subroutines/co_reduce_s.f90#L88 [2] https://github.com/BerkeleyLab/ISO_Fortran_binding_m/blob/0c585362bb4f2c72cf9049c800a7115b529ec533/src/iso_fortran_binding_m.F90#L196

Rouson, Damian↗

Data and scripts from: “Denoising autoencoder for reconstructing sensor observation data and predicting evapotranspiration: noisy and missing values repair and uncertainty quantification”

This data package includes data and scripts from the manuscript “Denoising autoencoder for reconstructing sensor observation data and predicting evapotranspiration: noisy and missing values repair and uncertainty quantification”.The study addressed common challenges faced in environmental sensing and modeling, including uncertain input data, missing sensor observations, and high-dimensional datasets with interrelated but redundant variables. Point-scaled meteorological and soil sensor observations were perturbed with noises and missing values, and denoising autoencoder (DAE) neural networks were developed to reconstruct the perturbed data and further predict evapotranspiration. This study concluded that (1) the reconstruction quality of each variable depends on its cross-correlation and alignment to the underlying data structure, (2) uncertainties from the models were overall stronger than those from the data corruption, and (3) there was a tradeoff between reducing bias and reducing variance when evaluating the uncertainty of the machine learning models.This package includes:(1) Four ipython scripts (.ipynb): “DAE_train.ipynb” trains and evaluates DAE neural networks, “DAE_predict.ipynb” makes predictions from the trained DAE models, “ET_train.ipynb” trains and evaluates ET prediction neural networks, and “ET_predict.ipynb” makes predictions from trained ET models.(2) One python file (.py): “methods.py” includes all user-defined functions and python codes used in the ipython scripts.(3) A “sub_models” folder that includes five trained DAE neural networks (in pytorch format, .pt), which could be used to ingest input data before being fed to the downstream ET models in ‘ET_train.ipynb” or ‘ET_predict.ipynb’.(4) Two data files (.csv). Daily meteorological, vegetation, and soil data is in “df_data.csv”, where “df_meta.csv” contains the location and time information of “df_data.csv”. Each row (index) in “df_meta.csv” corresponds to each row in “df_data.csv”. These data files are formatted to follow the data structure requirements and be directly used in the ipython scripts, and they have been shuffled chronologically to train machine learning models. The meteorological and soil data was collected using point sensors between 2019-2023 at(4.a) Three shrub-dominated field sites in East River, Colorado (named “ph1”, “ph2” and “sg5” in “df_meta.csv”, where “ph1” and “ph2” were located at PumpHouse Hillslopes, and “sg5” was at Snodgrass Mountain meadow) and(4.b) One outdoor, mesoscale, and herbaceous-dominated experiment in Berkeley, California (named “tb” in “df_meta.csv”, short for Smartsoils Testbed at Lawrence Berkeley National Lab).- See "df_data_dd.csv" and "df_meta_dd.csv" for variable descriptions and the Methods section for additional data processing steps. See "flmd.csv" and "README.txt" for brief file descriptions.- All ipython scripts and python files are written in and require PYTHON language software.

54 ENVIRONMENTAL SCIENCES↗

Method and system for rendering and interacting with an adaptable computing environment

An adaptable computing environment is implemented with software entities termed "s-machines", which self-assemble into hierarchical data structures capable of rendering and interacting with the computing environment. A hierarchical data structure includes a first hierarchical s-machine bound to a second hierarchical s-machine. The first hierarchical s-machine is associated with a first layer of a rendering region on a display screen and the second hierarchical s-machine is associated with a second layer of the rendering region overlaying at least a portion of the first layer. A screen element s-machine is linked to the first hierarchical s-machine. The screen element s-machine manages data associated with a screen element rendered to the display screen within the rendering region at the first layer.

97 MATHEMATICS AND COMPUTING↗

Oklahoma structural complexity data

Zipped file contains raster data (TIF) files and thumbnail image (PNG) files associated with modeling known and predicting structural complexity (SC) for the state of Oklahoma, two SIMPA simulation files (.SIJN) and two README (.txt) files to run both the known SC and proxy SC models using the SIMPA tool, and a "Source data catalog.xlsx" file that provides information on the source data and how it was used to represent each raster Note: Metadata including processing steps can be viewed in ESRI's ArcCatalog software

raster↗

Timely Reporting of Heavy Hitters Using External Memory

Given an input stream S of size N, a Φ-heavy hitter is an item that occurs at least ΦN times in S. The problem of finding heavy-hitters is extensively studied in the database literature. In this work, we study a real-time heavy-hitters variant in which an element must be reported shortly after we see its T = Φ N-th occurrence (and hence it becomes a heavy hitter). We call this the Timely Event Detection (TED) Problem. The TED problem models the needs of many real-world monitoring systems, which demand accurate (i.e., no false negatives) and timely reporting of all events from large, high-speed streams with a low reporting threshold (high sensitivity). Like the classic heavy-hitters problem, solving the TED problem without false-positives requires large space (Ω (N) words). Thus in-RAM heavy-hitters algorithms typically sacrifice accuracy (i.e., allow false positives), sensitivity, or timeliness (i.e., use multiple passes). We show how to adapt heavy-hitters algorithms to external memory to solve the TED problem on large high-speed streams while guaranteeing accuracy, sensitivity, and timeliness. Our data structures are limited only by I/O-bandwidth (not latency) and support a tunable tradeoff between reporting delay and I/O overhead. With a small bounded reporting delay, our algorithms incur only a logarithmic I/O overhead. We implement and validate our data structures empirically using the Firehose streaming benchmark. Multi-threaded versions of our structures can scale to process 11M observations per second before becoming CPU bound. In comparison, a naive adaptation of the standard heavy-hitters algorithm to external memory would be limited by the storage device’s random I/O throughput, i.e., ≈100K observations per second.

97 MATHEMATICS AND COMPUTING↗

On the vulnerability of data-driven structural health monitoring models to adversarial attack

Many approaches at the forefront of structural health monitoring rely on cutting-edge techniques from the field of machine learning. Recently, much interest has been directed towards the study of so-called adversarial examples; deliberate input perturbations that deceive machine learning models while remaining semantically identical. This article demonstrates that data-driven approaches to structural health monitoring are vulnerable to attacks of this kind. In the perfect information or ‘white-box’ scenario, a transformation is found that maps every example in the Los Alamos National Laboratory three-storey structure dataset to an adversarial example. Also presented is an adversarial threat model specific to structural health monitoring. The threat model is proposed with a view to motivate discussion into ways in which structural health monitoring approaches might be made more robust to the threat of adversarial attack.

60 APPLIED LIFE SCIENCES↗

Structural, mutational and biophysical studies reveal a canonical mode of molecular recognition between immune receptor TIGIT and nectin-2

In addition to antigen-specific stimulation of T cell receptor (TCR) by a peptide-MHC complex, the functional outcome of TCR engagement is regulated by antigen-independent costimulatory signals. Costimulatory signals are provided by an array of interactions involving activating and inhibitory receptors expressed on T cells and their cognate ligands on antigen presenting cells. T cell immunoglobulin and ITIM domain (TIGIT), a recently identified immune receptor expressed on T and NK cells, upon interaction with either of its two ligands, nectin-2 or poliovirus receptor (PVR), inhibits activation of T and NK cells. Here we report the crystal structure of the human TIGIT ectodomain, which exhibits the classic two-layer β-sandwich topology observed in other immunoglobulin super family (IgSF) members. Biophysical studies indicate that TIGIT is monomeric in solution but can form a dimer at high concentrations, consistent with the observation of a canonical immunoglobulin-like dimer interface in the crystalline state. Based on existing structural data, we present a model of the TIGIT:nectin-2 complex and utilized complementary biochemical studies to map the nectin-binding interface on TIGIT. Our data provide important structural and biochemical determinants responsible for the recognition of nectin-2 by TIGIT. Defining the TIGIT:nectin-2 binding interface provides the basis for rational manipulation of this molecular interaction for the development of immunotherapeutic reagents in autoimmunity and cancer.

60 APPLIED LIFE SCIENCES↗

Toward Molecule-Specific Geochemistry of Heavy Ends: Application to the Upstream Oil Industry

Detailed molecular analysis of the composition of petroleum is typically performed on only the light (volatile) fraction, using analyses involving gas chromatography (GC). Heavier (nonvolatile) components such as kerogen, bitumen, and asphaltenes, which are relevant to conventional reservoirs and particularly to unconventional gas shale and tight oil formations, are not amenable to analysis by GC and instead are typically studied by more phenomenological techniques. This report describes a suite of analytical techniques that can provide sufficient average molecular information on the heavy ends (defined as the nonvolatile fraction) to be useful for a variety of industrial applications, expanding the discipline of molecule-specific geochemistry into the non-GC amenable fractions of petroleum materials. Heavy ends are composed of the elements C, H, N, S, and O, and the bonding environments of each can be measured by various solid state spectroscopies: nuclear magnetic resonance (NMR) and infrared (IR) spectroscopies for C, H, and O; X-ray absorption near-edge structure (XANES) spectroscopy for S and N. Additionally, advances in mass spectrometry, including techniques such as laser desorption laser ionization mass spectrometry (L2MS), can be used to measure the molecular weight and dominant molecular architecture of asphaltenes. Moreover, higher-order structures can be measured: samples of kerogen with representative pore geometry can be prepared, and those pore systems are analyzed with techniques such as X-ray diffraction and neutron scattering. Colloidal structures of asphaltenes can be measured with a variety of techniques, which reveal a hierarchical aggregation structure. These analyses provide sufficient structural data to enable structure–property and structure–function relationships to be determined, which can be applied to the characterization of conventional and unconventional resources. In gas shale and tight oil formations, which contain abundant inorganic minerals as well as kerogen, diffuse reflectance infrared Fourier transform spectroscopy (DRIFTS) is used for simultaneous analysis of mineralogy, kerogen content, and maturity, typically performed at the wellsite. In conventional reservoirs, spatial variations in the asphaltene concentration measured by downhole fluid analysis logging tools are being interpreted with a recently developed equation of state to address upstream issues such as reservoir connectivity, tar mat formation, and fault block migration. Furthermore, as more heavy end analyses are developed, further scientific knowledge and industrial applications of heavy end geochemistry are anticipated.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

The Hybrid Toolkit

The Hybrid Toolkit facilitates moving research algorithms into a production environment by creating useful abstractions that separate analytics developers from the intricacies of the production data formats, data flows, and result representations. The toolkit also assists developers with activities such as creating analysis feature vectors, converting between data structures, and creating data pipelines.

Davis IV, WarrenL↗

Mixed Metal Phosphonate- Phosphate Resins for Separation of Lanthanides from Actinides

As indicated in the previous annual report the goals of this project are to develop procedures for efficient separation of lanthanides from actinides and curium from americium. These processes are required for the nuclear fuel cycle to minimize the waste and recover the valuable actinides. The basis for our study is that we have prepared a group of compounds that are porous and favor the uptake of ions with charges 3+ and 4+ over ions of lesser charge. The general formula for these materials is M(O 3 PC 6 H 4 PO 3 ) 1-x/2 (APO 4 )x·nH 2 O: where M=Zr 4+ , Sn 4+ , A=H, Na, or K and X=O, 0.5, 0.8, 1.0, 1.33 and 1.61-3. One of our tasks is to determine which members of this group of compounds are effective in carrying out the required separations. A difficulty in obtaining this required information is that the compounds are amorphous. That is they are not crystalline, therefore we need to resort to synchrotron data to obtain structural data which will be presented in detail. This information will be provided as a separate section.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Electric Vehicle Charging Analytics and Reporting Tool (EV-ChART): Data Format and Preparation Guidance (V.5.0)

The Joint Office of Energy and Transportation maintains the Electric Vehicle Charging Analytics and Reporting Tool (EV-ChART), which provides a centralized hub for submitting electric vehicle (EV) charging infrastructure data directed by the Federal Highway Administration (23 CFR 680.112(a)-(c)). EV-ChART provides a streamlined data submission process and an integrated set of analytic tools, connects to other data sources, and empowers data sharing and access across stakeholders, including the public. Any data shared publicly will be aggregated and anonymized to stay in accordance with 23 CFR 680. This EV-ChART Data Format and Preparation Guidance provides a comprehensive overview of the data reporting requirements as authorized under 23 CFR 680.112(a)-(c)). The guidance is intended to be used alongside the EV-ChART Data Input Template, which defines the tabular data structure that these data submissions must follow. Per 23 CFR 680.112(a)-(c), the annual and quarterly data submissions are required of all National Electric Vehicle Infrastructure (NEVI) Formula Program projects, as well as projects for the construction of publicly accessible EV chargers that are funded with funds made available under Title 23, United States Code, including any EV charging infrastructure project funded with federal funds that is treated as a project on a federal-aid highway. One-time data submissions are required of both the NEVI Formula Program projects and grants awarded under 23 U.S.C. 151(f) for projects that are for EV charging stations located along and designed to serve the users of designated Alternative Fuel Corridors (AFCs). Other information and data required in 23 CFR 680, such as 23 CFR 680.112(d), 23 CFR 680.116(c), and 23 CFR 680.106(a), are not discussed in this guidance.

33 ADVANCED PROPULSION SYSTEMS↗

On a Simplified Approach to Achieve Parallel Performance and Portability Across CPU and GPU Architectures

This paper presents software advances to easily exploit computer architectures consisting of a multi-core CPU and CPU+GPU to accelerate diverse types of high-performance computing (HPC) applications using a single code implementation. The paper describes and demonstrates the performance of the open-source C++ matrix and array (MATAR) library that uniquely offers: (1) a straightforward syntax for programming productivity, (2) usable data structures for data-oriented programming (DOP) for performance, and (3) a simple interface to the open-source C++ Kokkos library for portability and memory management across CPUs and GPUs. The portability across architectures with a single code implementation is achieved by automatically switching between diverse fine-grained parallelism backends (e.g., CUDA, HIP, OpenMP, pthreads, etc.) at compile time. The MATAR library solves many longstanding challenges associated with easily writing software that can run in parallel on any computer architecture. This work benefits projects seeking to write new C++ codes while also addressing the challenges of quickly making existing Fortran codes performant and portable over modern computer architectures with minimal syntactical changes from Fortran to C++. We demonstrate the feasibility of readily writing new C++ codes and modernizing existing codes with MATAR to be performant, parallel, and portable across diverse computer architectures.

97 MATHEMATICS AND COMPUTING↗

Framework for Building Collaborative Research Environment

Wide range of expertise and technologies are the key to solving some global problems. Semantic web technology can revolutionize the nature of how scientific knowledge is produced and shared. The semantic web is all about enabling machine-machine readability instead of a routine human-human interaction. Carefully structured data, as in machine readable data is the key to enabling these interactions. Drupal is an example of one such toolset that can render all the functionalities of Semantic Web technology right out of the box. Drupal’s content management system automatically stores the data in a structured format enabling it to be machine. Within this paper, we will discuss how Drupal promotes collaboration in a research setting such as Oak Ridge National Laboratory (ORNL) and Long Term Ecological Research Center (LTER) and how it is effectively using the Semantic Web in achieving this.

97 MATHEMATICS AND COMPUTING↗

The Hybrid Toolkit

The Hybrid Toolkit facilitates moving research algorithms into a production environment by creating useful abstractions that separate analytics developers from the intricacies of the production data formats, data flows, and result representations. The toolkit also assists developers with activities such as creating analysis feature vectors, converting between data structures, and creating data pipelines.

Davis IV, Warren L↗