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 1,153 records · Page 64

pnnl/sven

This is a JavaScript library for a storyline layout algorithm. Storylines are adept at communicating complex change by encoding time on the x-axis and using the proximity of lines in the y direction to represent interaction between entities. The library in this disclosure takes as input a list of objects containing an id, time, and state. The output is a data structure that can be used to conveniently render a storyline visualization. Most importantly, the library computes the y-coordinate of the entities over time that decreases layout artifacts including crossings, wiggles, and whitespace. This is accomplished through multi-objective, multi-stage optimization problem, where the output of one stage produces input and constraints for the next stage.

Arendt, Dustin↗

Neural Network Export Package (nexport) v0.1.0

nexport is a lightweight python 3 package which enables neural network developers to export the weights and biases of trained networks to useful file types. It provides I/O support for applications which require specific data types for instantiating neural networks in various inference environments. It was initially developed to support exporting to the data structure used by 'inference-engine', a Fortran inference package.

Welsman, Jordan↗

Accessible Content Optimization for Research Needs (ACORN)

ACORN employs a set of automated processes for informing and/or enforcing defined content schemas to create standardized and highly structured data. Because of its standardized data source, ACORN easily applies computer automation to generate communication assets such as PDFs, Powerpoint presentations, and web pages. Built using the memory-safe Rust programming language, ACORN is portable and accessible for use on any Windows, Mac, or Linux machine.

Wohlgemuth, JasonHoward [Oak Ridge National Labora↗

ATcT — Active Thermochemical Tables Python Interface

SF-25-140 atct is a lightweight, Python client for the ATcT v1 API that enables programmatic access to high-accuracy thermochemical data and turnkey reaction-enthalpy analysis. The package implements full v1 endpoint coverage (species lookup by ATcT ID, name, formula, SMILES, InChI, CAS RN; covariance queries; health checks) with robust error handling, retries, and environment-based configuration for local/production endpoints. Beyond data retrieval, atct provides rigorously implemented reaction calculators that propagate uncertainties via either (i) a conventional independent-errors method (0 K or 298.15 K) or (ii) covariance-aware propagation using provided covariances at 298.15 K. Typed data classes ensure transparent, reproducible data structures and carry ATcT Thermochemical Network (TN) version identifiers for provenance. Dual import paths and comprehensive examples facilitate integration into research pipelines, enabling reproducible thermochemical calculations, automated validation, and downstream method development.

Bross, DavidHamilton [Argonne National Laboratory ↗

Fortran mimetic abstraction language (Formal) v0.1.

The Fortran mimetic abstraction language ("Formal") is a domain-specific language (DSL) embedded in Fortran 202Y [1]. Formal provides novel software abstractions for simulating phenomena governed by the partial differential equations (PDEs) of vector and tensor calculus. Such equations model an extremely broad set of physical phenomena, ranging from atmospheric winds to light propagation. Formal's data structures and algorithms mimic in form and behavior continuous functions and operators. Formal supports these mathematical constructs using mimetic discretizations that define a discrete calculus satisfying various tensor calculus theorems, thereby ensuring high-fidelity representations of the physics being modeled. [2] Formal 0.1.0 also lays a foundation for the future use of Fortran 202Y type-safe templates to facilitate the formal verification of tensor contractions in computational physics and artificial intelligence [3]. [1] "Fortran 202Y" is Fortran standard committee's informal designation for the next Fortran revision, which will likely be "Fortran 2028". [2] Corbino, J. and Castillo, J. (2020) Journal of Computational and Applied Mathematics, https://doi.org/10.1016/j.cam.2019.06.042. [3] Haveraaen, M., Järvi, J., & Rouson, D. (2019). Reflecting on Generics for Fortran. https://j3-fortran.org/doc/year/19/19-188.pdf.

Rouson, Damian [Lawrence Berkeley National Laborat↗

Sparse triangular solves for ILU revisited: data layout crucial to better performance.; .

A key to good processor utilization for sparse matrix computations is storing the data in the format that is most conducive to fast access by the memory system. In particular, for sparse matrix triangular solves the traditional compressed sparse matrix format is poor, and minor adjustments to the data structure can increase the processor utilization dramatically. Such adjustments involve storing the L and U factors separately and storing the U rows 'backwards' so that they are accessed in a simple streaming fashion during the triangular solves. Changes to the PETSc libraries to use this modified storage format resulted in over twice the floating-point rate for some matrices. This improvement can be accounted for by a decrease in the cache misses and TLB (transaction lookaside buffer) misses in the modified code.

99 GENERAL AND MISCELLANEOUS↗

A method for increasing expressivity of Gene Ontology annotations using a compositional approach

Background: The Gene Ontology project integrates data about the function of gene products across a diverse range of organisms, allowing the transfer of knowledge from model organisms to humans, and enabling computational analyses for interpretation of high-throughput experimental and clinical data. The core data structure is the annotation, an association between a gene product and a term from one of the three ontologies comprising the GO. Historically, it has not been possible to provide additional information about the context of a GO term, such as the target gene or the location of a molecular function. This has limited the specificity of knowledge that can be expressed by GO annotations. Results: The GO Consortium has introduced annotation extensions that enable manually curated GO annotations to capture additional contextual details. Extensions represent effector–target relationships such as localization dependencies, substrates of protein modifiers and regulation targets of signaling pathways and transcription factors as well as spatial and temporal aspects of processes such as cell or tissue type or developmental stage. We describe the content and structure of annotation extensions, provide examples, and summarize the current usage of annotation extensions. Conclusions: The additional contextual information captured by annotation extensions improves the utility of functional annotation by representing dependencies between annotations to terms in the different ontologies of GO, external ontologies, or an organism’s gene products. These enhanced annotations can also support sophisticated queries and reasoning, and will provide curated, directional links between many gene products to support pathway and network reconstruction.

59 BASIC BIOLOGICAL SCIENCES↗

Validation of Play Fairway Analysis of the geothermal potential of Camas Prairie, south-central Idaho, by an exploration well

Abstract Play Fairway Analysis (PFA) methodology was adapted for geothermal exploration at Camas Prairie, Idaho. Geophysical data, structural and geologic mapping, volcanic rock ages and vent locations, and the distribution of thermal springs and wells all indicated a relatively high geothermal potential along the southern margin of the Prairie. An exploration well (USU Camas-1) was drilled to a depth of 618.3 m to validate the PFA. A permeable zone was encountered at ~ 357.5 m with a maximum measured temperature of ~ 80 °C, which was suppressed following the injection of cold water. A moderate transmissivity of ~ 0.25–1 cm 2 /s estimated from an injection test as well a seasonal artesian flow at ~ 0.7 L/s corroborate the presence of a permeable zone. The existence of a lacustrine clay seal was confirmed near the bottom of the basin-fill sediment occupying the upper 314 m of the well. Geothermometers suggest the USU Camas-1 well water equilibrated at a reservoir temperature of ~ 120 °C. Based on the locations of both thermal and cold wells, geothermal fluids appear to be flowing upward along one or both of two fault systems. The presence of young basalts and elevated helium isotope ratios suggest that the heat source of Camas Prairie is magmatic. However, the faults may be acting as a conduit for geothermal fluids to rise from great depth without a shallow magmatic source being present. Camas Prairie is a promising area for geothermal development, but the relatively low reservoir temperatures indicate this resource may not be suitable for electric generation. Perhaps the best use would be for heating.

Lachmar, Thomas E. (ORCID:0000000249640119)↗

Extreme-Scale De Novo Genome Assembly

De novo whole genome assembly reconstructs genomic sequence from short, overlapping, and potentially erroneous DNA segments and is one of the most important computations in modern genomics. This work presents HipMER, a high-quality end-to-end de novo assembler designed for extreme scale analysis, via efficient parallelization of the Meraculous code. Genome assembly software has many components, each of which stresses different components of a computer system. This chapter explains the computational challenges involved in each step of the HipMer pipeline, the key distributed data structures, and communication costs in detail. We present performance results of assembling the human genome and the large hexaploid wheat genome on large supercomputers up to tens of thousands of cores.

59 BASIC BIOLOGICAL SCIENCES↗

NovoGraph: Human genome graph construction from multiple long-read de novo assemblies

Genome graphs are emerging as an important novel approach to the analysis of high-throughput human sequencing data. By explicitly representing genetic variants and alternative haplotypes in a mappable data structure, they can enable the improved analysis of structurally variable and hyperpolymorphic regions of the genome. In most existing approaches, graphs are constructed from variant call sets derived from short-read sequencing. As long-read sequencing becomes more cost-effective and enables de novo assembly for increasing numbers of whole genomes, a method for the direct construction of a genome graph from sets of assembled human genomes would be desirable. Such assembly-based genome graphs would encompass the wide spectrum of genetic variation accessible to long-read-based de novo assembly, including large structural variants and divergent haplotypes. We present NovoGraph, a method for the construction of a human genome graph directly from a set of de novo assemblies. NovoGraph constructs a genome-wide multiple sequence alignment of all input contigs and creates a graph by merging the input sequences at positions that are both homologous and sequence-identical. NovoGraph outputs resulting graphs in VCF format that can be loaded into third-party genome graph toolkits. To demonstrate NovoGraph, we construct a genome graph with 23,478,835 variant sites and 30,582,795 variant alleles from de novo assemblies of seven ethnically diverse human genomes (AK1, CHM1, CHM13, HG003, HG004, HX1, NA19240). Initial evaluations show that mapping against the constructed graph reduces the average mismatch rate of reads from sample NA12878 by approximately 0.2%, albeit at a slightly increased rate of reads that remain unmapped.

59 BASIC BIOLOGICAL SCIENCES↗

Chimera D-Series Gravitational Wave Emission Sourced from Neutrino Anisotropy

Gravitational wave data sourced from the time-dependent anisotropic neutrino emission, as well as the time-dependent fluid quadrupole motion, in the Chimera D-Series three-dimensional core collapse supernova simulations. Data from three models initiated from three different progenitors are presented: D9.6-3D, D15-3D, and D25-3D. Please see the README for more information about the data structure and progenitors.

79 ASTRONOMY AND ASTROPHYSICS↗

Chimera D-Series Gravitational Wave Emission Sourced from Matter

Gravitational wave data sourced from the the time-dependent fluid quadrupole motion, in the Chimera D-Series three-dimensional core collapse supernova simulations. Data from three models initiated from three different progenitors are presented: D9.6-3D, D15-3D, and D25-3D. Please see the README for more information about the data structure and progenitors.

79 ASTRONOMY AND ASTROPHYSICS↗

Chimera F-Series Gravitational Wave Emission Sourced from Matter and Neutrino Anisotropy

This dataset contains gravitational wave data sourced from the the time-dependent fluid quadrupole motion as well as neutrino anisotropy, in the Chimera F-Series two-dimensional core collapse supernova simulations. Data from two models initiated from two different progenitors are presented: F15.78 and F15.79. Please see the README for more information about the data structure and progenitors.

79 ASTRONOMY AND ASTROPHYSICS↗

STILGAR Seismic Array Data

Two three-component dense seismic arrays were deployed above an active limestone mine in Pleasant Gap, Pennsylvania; one in the fall and one in the spring of 2023. Each campaign lasted approximately four weeks and included 80 to 100 seismic stations with stations spaced between 100 and 400 meters apart. Each campaign also included several small dense seismic arrays. Two types of seismic stations were deployed including FairfieldNodal ZLand 3C All-in-One seismometers and Geospace 3C GS-ONE geophone paired with GSX3 and GSX4 dataloggers. This dataset includes ~ 4 TB of three-component continuously recorded seismic data in the miniseed format data from both campaigns as well as a readme file for the data structure.

58 GEOSCIENCES↗

Confidentiality-preserving machine learning algorithms for soft-failure detection in optical communication networks

Automated fault management is at the forefront of next-generation optical communication networks. The increase in complexity of modern networks has triggered the need for programmable and software-driven architectures to support the operation of agile and self-managed systems. In these scenarios, the European Telecommunications Standards Institute zero-touch network and service management approach is imperative. The need for machine learning algorithms to process the large volume of telemetry data brings safety concerns as distributed cloud-computing solutions become the preferred approach for deploying reliable communication network automation. This paper’s contribution is twofold. First, we propose a simple yet effective method to guarantee the confidentiality of the telemetry data based on feature scrambling. The method allows the operation of third-party computational services without direct access to the full content of the collected data. Additionally, the effectiveness of four unsupervised machine learning algorithms for soft-failure detection is evaluated when applied to the scrambled telemetry data. The methods are based on factor analysis, principal component analysis, nonlinear principal component analysis, and singular value decomposition. Most dimensionality reduction algorithms have the common property that they can maintain similar levels of fault classification performance while hiding the data structure from unauthorized access. Evaluations of the proposed algorithms demonstrate this capability.

97 MATHEMATICS AND COMPUTING↗

Discovery of PF-06928215 as a high affinity inhibitor of cGAS enabled by a novel fluorescence polarization assay

Cyclic GMP-AMP synthase (cGAS) initiates the innate immune system in response to cytosolic dsDNA. After binding and activation from dsDNA, cGAS uses ATP and GTP to synthesize 2', 3' -cGAMP (cGAMP), a cyclic dinucleotide second messenger with mixed 2'-5' and 3'-5' phosphodiester bonds. Inappropriate stimulation of cGAS has been implicated in autoimmune disease such as systemic lupus erythematosus, thus inhibition of cGAS may be of therapeutic benefit in some diseases; however, the size and polarity of the cGAS active site makes it a challenging target for the development of conventional substrate-competitive inhibitors. We report here the development of a high affinity (K D = 200 nM) inhibitor from a low affinity fragment hit with supporting biochemical and structural data showing these molecules bind to the cGAS active site. We also report a new high throughput cGAS fluorescence polarization (FP)-based assay to enable the rapid identification and optimization of cGAS inhibitors. This FP assay uses Cy5-labelled cGAMP in combination with a novel high affinity monoclonal antibody that specifically recognizes cGAMP with no cross reactivity to cAMP, cGMP, ATP, or GTP. Given its role in the innate immune response, cGAS is a promising therapeutic target for autoinflammatory disease. Our results demonstrate its druggability, provide a high affinity tool compound, and establish a high throughput assay for the identification of next generation cGAS inhibitors.

59 BASIC BIOLOGICAL SCIENCES↗

Sage: parallel semi-asymmtric graph algorithms for NVRAMs

Non-volatile main memory (NVRAM) technologies provide an attractive set of features for large-scale graph analytics, including byte-addressability, low idle power, and improved memory-density. NVRAM systems today have an order of magnitude more NVRAM than traditional memory (DRAM). NVRAM systems could therefore potentially allow very large graph problems to be solved on a single machine, at a modest cost. However, a significant challenge in achieving high performance is in accounting for the fact that NVRAM writes can be much more expensive than NVRAM reads. In this paper, we propose an approach to parallel graph analytics using the Parallel Semi-Asymmetric Model (PSAM), in which the graph is stored as a read-only data structure (in NVRAM), and the amount of mutable memory is kept proportional to the number of vertices. Similar to the popular semi-external and semi-streaming models for graph analytics, the PSAM approach assumes that the vertices of the graph fit in a fast read-write memory (DRAM), but the edges do not. In NVRAM systems, our approach eliminates writes to the NVRAM, among other benefits. To experimentally study this new setting, we develop Sage, a parallel semi-asymmetric graph engine with which we implement provably-efficient (and often work-optimal) PSAM algorithms for over a dozen fundamental graph problems. We experimentally study Sage using a 48--core machine on the largest publicly-available real-world graph (the Hyperlink Web graph with over 3.5 billion vertices and 128 billion edges) equipped with Optane DC Persistent Memory, and show that Sage outperforms the fastest prior systems designed for NVRAM. Importantly, we also show that Sage nearly matches the fastest prior systems running solely in DRAM, by effectively hiding the costs of repeatedly accessing NVRAM versus DRAM.

97 MATHEMATICS AND COMPUTING↗