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 811 records · Page 45

Final Report

Maps of the distribution of galaxies, or the cosmic {\em large-scale structure}, provide information about the past several billion years of cosmic history. These maps have the power to inform several of the largest scientific puzzles driving the Department of Energy's High Energy Physics program: the neutrino mass scale, properties of dark matter, the existence of new particles, and the mechanism responsible for cosmic acceleration. This research will develop the theory of structure formation in the presence of cosmic neutrinos and other novel types of matter. Without this research, the full power of cosmic-structure data will not be harnessed. The primary goal is to ensure that modeling uncertainties are not an obstacle to detecting the neutrino mass scale and other cosmological parameters with next-generation experiments. A secondary goal is to anticipate the possibility of new physics by developing the astrophysical phenomenology of novel dark-matter and cosmic-acceleration scenarios. This research will produce new tools to study neutrinos, hidden components of dark matter, dynamical dark energy, and structure formation in the Universe.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Extending Thymidine Kinase Activity to the Catalytic Repertoire of Human Deoxycytidine Kinase

Salvage of nucleosides in the cytosol of human cells is carried out by deoxycytidine kinase (dCK) and thymidine kinase 1 (TK1). Whereas TK1 is only responsible for thymidine phosphorylation, dCK is capable of converting dC, dA, and dG into their monophosphate forms. Using structural data on dCK, we predicted that select mutations at the active site would, in addition to making the enzyme faster, expand the catalytic repertoire of dCK to include thymidine. Specifically, we hypothesized that steric repulsion between the methyl group of the thymine base and Arg104 is the main factor preventing the phosphorylation of thymidine by wild-type dCK. Here we present kinetic data on several dCK variants where Arg104 has been replaced by select residues, all performed in combination with the mutation of Asp133 to an alanine. We show that several hydrophobic residues at position 104 endow dCK with thymidine kinase activity. Depending on the exact nature of the mutations, the enzyme's substrate preference is modified. The R104M-D133A double mutant is a pyrimidine-specific enzyme due to large K{sub m} values with purines. The crystal structure of the double mutant R104M-D133A in complex with the L-form of thymidine supplies a structural explanation for the ability of this variant to phosphorylate thymidine and thymidine analogs. The replacement of Arg104 by a smaller residue allows L-dT to bind deeper into the active site, making space for the C5-methyl group of the thymine base. The unique catalytic properties of several of the mutants make them good candidates for suicide-gene/protein-therapy applications.

36 MATERIALS SCIENCE↗

Synthesis and Structure–Activity Characterization of a Single-Site MoO 2 Catalytic Center Anchored on Reduced Graphene Oxide

Molecularly derived single-site heterogeneous catalysts can bridge the understanding and performance gaps between conventional homogeneous and heterogeneous catalysis, guiding the rational design of next-generation catalysts. While impressive advances have been made with well-defined oxide supports, the structural complexity of other supports and the nature of the grafted surface species present an intriguing challenge. In this study, single-site Mo(=O) 2 species grafted onto reduced graphene oxide (rGO/MoO 2 ) are characterized by XPS, DRIFTS, powder XRD, N 2 physisorption, NH 3 -TPD, aqueous contact angle, active site poisoning assay, Mo EXAFS, model compound single-crystal XRD, DFT, and catalytic performance. NH 3 -TPD reveals that the anchored MoO 2 moiety is not strongly acidic, while Mo 3d 5/2 XPS assigns the oxidation state as Mo(VI), and XRD shows little rGO periodicity change on MoO 2 grafting. Contact angle analysis shows that MoO 2 grafting consumes rGO surface polar groups, yielding a more hydrophobic surface. The rGO/MoO 2 DRIFTS assigns features at 959 and 927 cm –1 to the symmetric and antisymmetric Mo=O stretching modes, respectively, of an isolated cis-(O=Mo=O) moiety, in agreement with DFT computation. Moreover, the Mo EXAFS rGO/MoO 2 structural data are consistent with isolated (C–O) 2– Mo(=O) 2 species having two Mo=O bonds and two Mo–O bonds at distances of 1.69(3) and 1.90(3) Å, respectively. rGO/MoO 2 is also more active than the previously reported AC/MoO 2 catalyst, with reductive carbonyl coupling TOFs approaching 1.81 × 10 3 h –1 . rGO/MoO 2 is environmentally robust and multiply recyclable with 69 ± 2% of the Mo sites catalytically significant. Altogether, rGO/MoO 2 is a structurally well-defined and versatile single-site Mo(VI) dioxo heterogeneous catalytic system.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

The ECP SICM project: Managing complex memory hierarchies for exascale applications

The Exascale Computing Project (ECP)’s Simplified Interface to Complex Memories (SICM) effort focuses on developing universal interfaces for discovering, managing, and sharing data across complex memory hierarchies. These facilitate the exploitation of emerging memory technologies and support precise control over their various trade-offs such as high-bandwidth versus low-latency, persistent versus ephemeral, high-capacity versus low-capacity, and near-CPU versus near-GPU. SICM comprises three interrelated components: a low-level interface, a high-level interface, and a persistent-heap interface. The low-level SICM interface is intended for system and run-time developers as well as expert application developers who prefer full control of the memory objects used within their application. The high-level SICM interface builds upon the low-level interface, employing application-level profiling and analysis to optimize data management for complex memory hierarchies. The persistent-heap interface provides applications with a persistent memory allocator that can allocate custom C++ data structures in both block-storage and byte-addressable persistent memories.

97 MATHEMATICS AND COMPUTING↗

Surface distribution of heterogenous clathrin assemblies in resorbing osteoclasts

Highlights: • Platinum replica microscopy has revealed new structural data on the clathrins on the ventralmembrane of osteoclasts. • Various clathrins were visualized, suggesting that they followed variations in the surface topography of the apatite. • Most of the flat clathrins may participate in the adhesive and mechnosensory functions in co-operation with podosomes. • The present findings in osteoclast biology reveal potential novel drug targets or treatment regimens. Osteoclasts seeded on either glass coverslips or apatite pellets have at least two morphologically distinct substrate adhesion sites: actin-based adhesion structures including podosome belts and sealing zones, and adjacent clathrin sheets. Clathrin-coated structures are exclusively localized at the podosome belts and sealing zone, in both of which the plasma membrane forms a tight attachment to the substrate surface. When cultured on apatite osteoclasts can degrade the apatite leading to the formation of resorption lacunae. The sealing zone divides the ventral membrane into different domains, outside and inside of the sealing zones. The former facing the smooth-surfaced intact apatite contains relatively solitary or networks of larger flat clathrin structures; and the latter, facing the rough-surfaced degraded apatite in the resorption lacunae contain clathrin in various shapes and sizes. Clathrin assemblies on the membrane domain facing not only a resorption lacuna, or trails but also intact apatite indeed were observed to be heterogeneous in size and intensity, suggesting that they appeared to follow variations in the surface topography of the apatite surface. These results provide a detailed insight into the flat clathrin sheets that have been suggested to be the sites of adhesion and mechanosensing in co-operation with podosomes.

60 APPLIED LIFE SCIENCES↗

Structure and Engineering of l-Arabinitol 4-Dehydrogenase from Neurospora crassa

L-Arabinitol 4-dehydrogenase (LAD) catalyzes the conversion of L-arabinitol into L-xylulose with concomitant NAD{sup +} reduction. It is an essential enzyme in the development of recombinant organisms that convert L-arabinose into fuels and chemicals using the fungal L-arabinose catabolic pathway. Here we report the crystal structure of LAD from the filamentous fungus Neurospora crassa at 2.6 {angstrom} resolution. In addition, we created a number of site-directed variants of N. crassa LAD that are capable of utilizing NADP{sup +} as cofactor, yielding the first example of LAD with an almost completely switched cofactor specificity. This work represents the first structural data on any LAD and provides a molecular basis for understanding the existing literature on the substrate specificity and cofactor specificity of this enzyme. The engineered LAD mutants with altered cofactor specificity should be useful for applications in industrial biotechnology.

36 MATERIALS SCIENCE↗

Characterization of the Impact of Soft Errors on Iterative Methods

Soft errors caused by transient bit flips have the potential to significantly impact an application’s behavior. This has motivated the design of an array of techniques to detect, isolate, and correct soft errors using microarchitectural, architectural, compilation-based, or application-level techniques to minimize their impact on the executing application. The first step towards the design of good error detection/correction techniques involves an understanding of an application’s vulnerability to soft errors. In this paper, we present the first comprehensive characterization of the impact of soft errors on the convergence characteristics of six iterative methods using application-level fault injection. In particular, we consider the use of iterative methods to incrementally solve a linear systems of equations, which constitutes the core kernel in many scientific applications. We analyze the impact of soft errors in terms of the type of error (single- vs multi-bit), the distribution and location of bits affected, the data structure and the statement impacted, and variation with time. In addition to understanding the vulnerability of iterative solvers to soft errors, this characterization can aid the design of fault injection campaigns that ensure systematic coverage.

fault injection, iterative methods, Silent data co↗

Vulcan-Forge: Architecture and Design of a Multi-Modal Forensic Analysis Plugin for CALDERA

Forge and VULCAN together describe an open-architecture cybersecurity analysis ecosystem that unifies forensic artifact processing, detection engineering, and vulnerability intelligence within integrated platforms. Forge operates as a plugin for MITRE CALDERA, ingesting diverse evidence formats—including EVTX, PCAP/PCAPNG, CSV, JSON, YAML, XML, binaries, and archives—to construct a unified artifact graph enriched with severity scoring, TLP classification, and audit trails. It provides subsystems for artifact parsing, streaming structured-data visualization, NetworkMiner-based packet inspection, PE/.NET binary analysis, and LLM-assisted triage and rule generation, with outputs validated against CCCS-YARA and pySigma schemas. VULCAN complements this by serving as a cybersecurity analyst platform that integrates a Neo4j knowledge graph, Qdrant vector retrieval, SSVC-based triage, and a local LLM to deliver CVE intelligence and forensic analysis through a multi-source ingest pipeline drawing from NVD, CISA KEV, EPSS, MITRE ATT&CK, and CAPEC. Together, they bridge structured threat intelligence with automated forensic analysis and detection workflows.

97 MATHEMATICS AND COMPUTING↗

Review of the fundamental theories behind small angle X-ray scattering, molecular dynamics simulations, and relevant integrated application

In this paper, the fundamental concepts and equations necessary for performing small angle X-ray scattering (SAXS) experiments, molecular dynamics (MD) simulations, and MDSAXS analyses were reviewed. Furthermore, several key biological and non-biological applications for SAXS, MD, and MD-SAXS are presented in this review; however, this article does not cover all possible applications. SAXS is an experimental technique used for the analysis of a wide variety of biological and non-biological structures. SAXS utilizes spherical averaging to produce one- or two-dimensional intensity profiles, from which structural data may be extracted. MD simulation is a computer simulation technique that is used to model complex biological and non-biological systems at the atomic level. MD simulations apply classical Newtonian mechanics’ equations of motion to perform force calculations and to predict the theoretical physical properties of the system. This review presents several applications that highlight the ability of both SAXS and MD to study protein folding and function in addition to non-biological applications, such as the study of mechanical, electrical, and structural properties of non-biological nanoparticles. Lastly, the potential benefits of combining SAXS and MD simulations for the study of both biological and non-biological systems are demonstrated through the presentation of several examples that combine the two techniques.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Hydrological partitioning in the critical zone: Recent advances and opportunities for developing transferable understanding of water cycle dynamics

Here, hydrology is an integrative discipline linking the broad array of water–related research with physical, ecological, and social sciences. The increasing breadth of hydrological research, often where subdisciplines of hydrology partner with related sciences, reflects the central importance of water to environmental science, while highlighting the fractured nature of the discipline itself. This lack of coordination among hydrologic subdisciplines has hindered the development of hydrologic theory and integrated models capable of predicting hydrologic partitioning across time and space. The recent development of the concept of the critical zone (CZ), an open system extending from the top of the canopy to the base of groundwater, brings together multiple hydrological subdisciplines with related physical and ecological sciences. Observations obtained by CZ researchers provide a diverse range of complementary process and structural data to evaluate both conceptual and numerical models. Consequently, a cross–site focus on “critical zone hydrology” has potential to advance the discipline of hydrology and to facilitate the transition of CZ observatories into a research network with immediate societal relevance. Here we review recent work in catchment hydrology and hydrochemistry, hydrogeology, and ecohydrology that highlights a common knowledge gap in how precipitation is partitioned in the critical zone: “how is the amount, routing, and residence time of water in the subsurface related to the biogeophysical structure of the CZ?” Addressing this question will require coordination among hydrologic subdisciplines and interfacing sciences, and catalyze rapid progress in understanding current CZ structure and predicting how climate and land cover changes will affect hydrologic partitioning.

58 GEOSCIENCES↗

Improved Distributed-memory Triangle Counting by Exploiting the Graph Structure

Graphs are ubiquitous in modeling complex systems and representing interactions between entities to uncover structural information of the domain. Traditionally, graph analytics workloads are challenging to efficiently scale (both strong and weak cases) on distributed memory due to the irregular memory-access driven nature (with little or no computations) of the methods. The structure of graphs and their relative distribution over the processing elements poses another level of complexity, making it difficult to attain sustainable scalability across platforms. In this paper, we discuss enhancements to TriC, a distributed-memory implementation of graph triangle counting using Message Passing Interface (MPI), which was featured in the 2020 Graph Challenge competition. We have made some incremental enhancements to TriC, primarily adopting a user-defined buffering strategy to overcome the startup problem for large graphs (by fixing the memory for intermediate data), and experimenting with probabilistic data structures such as bloom filter to improve the query response time for assessing edge existence, at the expense of increasing the overall false positive rate. These adjustments have led to a modest improvements in most cases, as compared to the previous version.

Graph Analytics, HPC↗

Hypernetwork Science: From Multidimensional Networks to Computational Topology

As data structures and mathematical objects used for complex systems modeling, hypergraphs sit nicely poised between on the one hand the world of network models, and on the other that of higher-order mathematical abstractions from algebra, lattice theory, and topology. They are able to represent complex systems interactions more faithfully than graphs and networks, while also being some of the simplest classes of systems representing topological structures as collections of multidimensional objects connected in a particular pattern. In this paper we discuss the role of (undirected) hypergraphs in the science of complex networks, and provide a mathematical overview of the core concepts needed for hypernetwork modeling, including duality and the relationship to bicolored graphs, quantitative adjacency and incidence, the nature of walks in hypergraphs, and available topological relationships and properties. We close with a brief discussion of two example applications: biomedical databases for disease analysis, and domain-name system (DNS) analysis of cyber data.

Joslyn, Cliff A.↗

Structural fold, conservation and Fe(II) binding of the intracellular domain of prokaryote FeoB

FeoB is a G-protein coupled membrane protein essential for Fe(II) uptake in prokaryotes. Here, we report the crystal structures of the intracellular domain of FeoB (NFeoB) from Klebsiella pneumoniae (KpNFeoB) and Pyrococcus furiosus (PfNFeoB) with and without bound ligands. In the structures, a canonical G-protein domain (G domain) is followed by a helical bundle domain (S-domain), which despite its lack of sequence similarity between species is structurally conserved. In the nucleotide-free state, the G-domain's two switch regions point away from the binding site. This gives rise to an open binding pocket whose shallowness is likely to be responsible for the low nucleotide-binding affinity. Nucleotide binding induced significant conformational changes in the G5 motif which in the case of GMPPNP binding was accompanied by destabilization of the switch I region. In addition to the structural data, we demonstrate that Fe(II)-induced foot printing cleaves the protein close to a putative Fe(II)-binding site at the tip of switch I, and we identify functionally important regions within the S-domain. Moreover, we show that NFeoB exists as a monomer in solution, and that its two constituent domains can undergo large conformational changes. The data show that the S-domain plays important roles in FeoB function.

36 MATERIALS SCIENCE↗

GPU-Based Static Data-Flow Analysis for Fast and Scalable Android App Vetting

Many popular vetting tools for Android applications use static code analysis techniques. In particular, Interprocedural Data-Flow Graph (IDFG) construction is the computation at the core of Android static data-flow analysis and consumes most of the analysis time. Many analysis tools use a worklist algorithm, an iterative fixed-point approach, to construct the IDFG. In this paper, we observe that a straightforward GPU parallelization of the worklist algorithm leads to significant underutilization of the GPU resources. We identify four performance bottlenecks, namely, frequent dynamic memory allocations, high branch divergence, workload imbalance, and irregular memory access patterns. Accordingly, we propose GDroid, a GPU-based worklist algorithm implementation with multiple fine-grained optimizations tailored to common characteristics of Android applications. The optimizations considered are: matrix-based data structure, memory access-based node grouping, and worklist merging. Our experimental evaluation, performed on 1000 Android applications, shows that the proposed optimizations are beneficial to performance, and GDroid can achieve up to 128X speedups against a plain GPU implementation.

Android security↗

Structural Insights into Inhibition of Sterol 14[alpha]-Demethylase in the Human Pathogen Trypanosoma cruzi

Trypanosoma cruzi causes Chagas disease (American trypanosomiasis), which threatens the lives of millions of people and remains incurable in its chronic stage. The antifungal drug posaconazole that blocks sterol biosynthesis in the parasite is the only compound entering clinical trials for the chronic form of this infection. Crystal structures of the drug target enzyme, Trypanosoma cruzi sterol 14{alpha}-demethylase (CYP51), complexed with posaconazole, another antifungal agent fluconazole and an experimental inhibitor, (R)-4{prime}-chloro-N-(1-(2,4-dichlorophenyl)-2-(1H-imid-azol-1-yl)ethyl)biphenyl-4-carboxamide (VNF), allow prediction of important chemical features that enhance the drug potencies. Combined with comparative analysis of inhibitor binding parameters, influence on the catalytic activity of the trypanosomal enzyme and its human counterpart, and their cellular effects at different stages of the Trypanosoma cruzi life cycle, the structural data provide a molecular background to CYP51 inhibition and azole resistance and enlighten the path for directed design of new, more potent and selective drugs to develop an efficient treatment for Chagas disease.

36 MATERIALS SCIENCE↗

An optimized FM-index library for nucleotide and amino acid search

Abstract Background Pattern matching is a key step in a variety of biological sequence analysis pipelines. The FM-index is a compressed data structure for pattern matching, with search run time that is independent of the length of the database text. Implementation of the FM-index is reasonably complicated, so that increased adoption will be aided by the availability of a fast and flexible FM-index library. Results We present AvxWindowedFMindex (AWFM-index), a lightweight, open-source, thread-parallel FM-index library written in C that is optimized for indexing nucleotide and amino acid sequences. AWFM-index introduces a new approach to storing FM-index data in a strided bit-vector format that enables extremely efficient computation of the FM-index occurrence function via AVX2 bitwise instructions, and combines this with optional on-disk storage of the index’s suffix array and a cache-efficient lookup table for partial k-mer searches. The AWFM-index performs exact match count and locate queries faster than SeqAn3’s FM-index implementation across a range of comparable memory footprints. When optimized for speed, AWFM-index is $$\sim $$ ∼ 2–4x faster than SeqAn3 for nucleotide search, and $$\sim $$ ∼ 2–6x faster for amino acid search; it is also $$\sim $$ ∼ 4x faster with similar memory footprint when storing the suffix array in on-disk SSD storage. Conclusions AWFM-index is easy to incorporate into bioinformatics software, offers run-time performance parameterization, and provides clients with FM-index functionality at both a high-level (count or locate all instances of a query string) and low-level (step-wise control of the FM-index backward-search process). The open-source library is available for download at https://github.com/TravisWheelerLab/AvxWindowFmIndex.

59 BASIC BIOLOGICAL SCIENCES↗

A Taxonomy for Classification and Comparison of Dataflows for GNN Accelerators

Recently, Graph Neural Networks (GNNs) have received a lot of interest because of their success in learning representations from graph structured data. However, GNNs exhibit different compute and memory characteristics compared to traditional Deep Neural Networks (DNNs). Graph convolutions require feature aggregations from neighboring nodes (known as the aggregation phase), which leads to highly irregular data accesses. GNNs also have a very regular compute phase that can be broken down to matrix multiplications (known as the combination phase). All recently proposed GNN accelerators utilize different dataflows and microarchitecture optimizations for these two phases. Different communication strategies between the two phases have been also used. However, as more custom GNN accelerators are proposed, the harder it is to qualitatively classify them and quantitatively contrast them. In this work, we present a taxonomy to describe several diverse dataflows for running GNN inference on accelerators. This provides a structured way to describe and compare the design-space of GNN accelerators.

97 MATHEMATICS AND COMPUTING↗