Search NASA⌕ Search

SEARCH · Search NASA

Results for “data structures”

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 775 records · Page 43

Efficient use of high performance computers for integrated controls and structures design

Simply transporting design codes from sequential-scalar computers to parallel-vector computers does not fully utilize the computational benefits offered by high performance computers. By performing integrated controls and structures design on an experimental truss platform with both sequential-scalar and parallel-vector design codes, conclusive results are presented to substantiate this claim. The efficiency of a Cholesky factorization scheme in conjunction with a variable-band row data structure is presented. In addition, the Lanczos eigensolution algorithm has been incorporated in the design code for both parallel and vector computations. Comparisons of computational efficiency between the initial design code and the parallel-vector design code are presented. It is shown that the Lanczos algorithm with the Cholesky factorization scheme is far superior to the sub-space iteration method of eigensolution when substantial numbers of eigenvectors are required for control design and/or performance optimization. Integrated design results show the need for continued efficiency studies in the area of element computations and matrix assembly.

Belvin, W. K.↗

Visualizing group II intron dynamics between the first and second steps of splicing

Group II introns are ubiquitous self-splicing ribozymes and retrotransposable elements evolutionarily and chemically related to the eukaryotic spliceosome, with potential applications as gene-editing tools. Recent biochemical and structural data have captured the intron in multiple conformations at different stages of catalysis. Here, we employ enzymatic assays, X-ray crystallography, and molecular simulations to resolve the spatiotemporal location and function of conformational changes occurring between the first and the second step of splicing. We show that the first residue of the highly-conserved catalytic triad is protonated upon 5’-splice-site scission, promoting a reversible structural rearrangement of the active site (toggling). Protonation and active site dynamics induced by the first step of splicing facilitate the progression to the second step. Our insights into the mechanism of group II intron splicing parallels functional data on the spliceosome, thus reinforcing the notion that these evolutionarily-related molecular machines share the same enzymatic strategy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Influence of Cation Size on the Electronic and Magnetic Structure of M CoO{sub 3} (M = Bi, La) from Ab Initio Calculations

Using the first-principle DFT method and LSDA+ U calculations, we have performed a detailed investigation on the structural and magnetic ground states of strongly correlated M CoO{sub 3} (M= Bi, La) perovskites. Magneticphase stabilities, structural behaviors and electronic properties of both materials have been investigated. LSDA+ U calculations show that the antiferromagnetic (AFM)-C phase in the tetragonal La/BiCoO{sub 3} is energetically more favorable than the other configurations, and both rhombohedral materials are nonmagnetic. All structural data of tetragonal BiCoO{sub 3} and rhombohedral LaCoO{sub 3} compounds are found in excellent agreement with the experiment for U{sub eff}= 6 eV. We have predicted also band gaps and magnetic moments with a good accuracy via the band structure calculations. From the total and partial densities of states, we have shown the important role of O p Co d and Bi/La s-O p hybridizations in both systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Structural complexity of simple Fe 2 O 3 at high pressures and temperatures

Although chemically very simple, Fe 2 O 3 is known to undergo a series of enigmatic structural, electronic and magnetic transformations at high pressures and high temperatures. So far, these transformations have neither been correctly described nor understood because of the lack of structural data. Here we report a systematic investigation of the behaviour of Fe 2 O 3 at pressures over 100 GPa and temperatures above 2,500 K employing single crystal X-ray diffraction and synchrotron Mössbauer source spectroscopy. Crystal chemical analysis of structures presented here and known Fe(II, III) oxides shows their fundamental relationships and that they can be described by the homologous series nFeO·mFe 2 O 3 . Decomposition of Fe 2 O 3 and Fe 3 O 4 observed at pressures above 60 GPa and temperatures of 2,000 K leads to crystallization of unusual Fe 5 O 7 and Fe 25 O 32 phases with release of oxygen. Lastly, our findings suggest that mixed-valence iron oxides may play a significant role in oxygen cycling between earth reservoirs.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Structure of the EphB6 receptor ectodomain

Eph receptors are the largest group amongst the receptor tyrosine kinases and are divided into two subgroups, A and B, based on ligand binding specificities and sequence conservation. Through ligand-induced and ligand-independent activities, Ephs play central roles in diverse biological processes, including embryo development, regulation of neuronal signaling, immune responses, vasculogenesis, as well as tumor initiation, progression, and metastasis. The Eph extracellular regions (ECDs) are constituted of multiple domains, and previous structural studies of the A class receptors revealed how they interact with ephrin ligands and simultaneously mediate Eph-Eph clustering necessary for biological activity. Specifically, EphA structures highlighted a model, where clustering of ligand-bound receptors relies on two distinct receptor/receptor interfaces. Interestingly, most unliganded A class receptors also form an additional, third interface, between the ligand binding domain (LBD) and the fibronectin III domain (FN3) of neighboring molecules. Structures of B-class Eph ECDs, on the other hand, have never been reported. To further our understanding of Eph receptor function, we crystallized the EphB6-ECD and determined its three-dimensional structure using X-ray crystallography. EphB6 has important functions in both normal physiology and human malignancies and is especially interesting because this atypical receptor innately lacks kinase activity and our understanding of the mechanism of action is still incomplete. Our structural data reveals the overall EphB6-ECD architecture and shows EphB6-LBD/FN3 interactions similar to those observed for the unliganded A class receptors, suggesting that these unusual interactions are of general importance to the Eph group. We also observe unique structural features, which likely reflect the atypical signaling properties of EphB6, namely the need of co-receptor(s) for this kinase-inactive Eph. These findings provide new valuable information on the structural organization and mechanism of action of the B-class Ephs, and specifically EphB6, which in the future will assist in identifying clinically relevant targets for cancer therapy.

59 BASIC BIOLOGICAL SCIENCES↗

STAR - A computer language for hybrid AI applications

Constructing Artificial Intelligence application systems which rely on both symbolic and non-symbolic processing places heavy demands on the communication of data between dissimilar languages. This paper describes STAR (Simple Tool for Automated Reasoning), a computer language for the development of AI application systems which supports the transfer of data structures between a symbolic level and a non-symbolic level defined in languages such as FORTRAN, C and PASCAL. The organization of STAR is presented, followed by the description of an application involving STAR in the interpretation of airborne imaging spectrometer data.

Borchardt, G. C.↗

Systems and methods for an extensible business application framework

Method and systems for editing data from a query result include requesting a query result using a unique collection identifier for a collection of individual files and a unique identifier for a configuration file that specifies a data structure for the query result. A query result is generated that contains a plurality of fields as specified by the configuration file, by combining each of the individual files associated with a unique identifier for a collection of individual files. The query result data is displayed with a plurality of labels as specified in the configuration file. Edits can be performed by querying a collection of individual files using the configuration file, editing a portion of the query result, and transmitting only the edited information for storage back into a data repository.

Bell, David G.↗

A graph-based computational framework for simulation and optimisation of coupled infrastructure networks

Here, we present a computational framework that facilitates the construction, instantiation, and analysis of large-scale optimization and simulation applications of coupled energy networks. The framework integrates the optimization modeling package PLASMO and the simulation package DMNetwork (built around PETSc). These tools use a common graphbased abstraction that enables us to achieve compatibility between data structures and to build applications that use network models of different physical fidelity. We also describe how to embed these tools within complex computational workflows using SWIFT, which is a tool that facilitates parallel execution of multiple simulation runs and management of input and output data. We discuss how to use these capabilities to target coupled natural gas and electricity systems.

42 ENGINEERING↗

Structural and biochemical characterization of Siw14: A protein-tyrosine phosphatase fold that metabolizes inositol pyrophosphates

Inositol pyrophosphates (PP-InsPs) are “energetic” intracellular signals that are ubiquitous in animals, plants, and fungi; structural and biochemical characterization of PP-InsP metabolic enzymes provides insight into their evolution, reaction mechanisms, and regulation. Here, we describe the 2.35-Å-resolution structure of the catalytic core of Siw14, a 5-PP-InsP phosphatase from Saccharomyces cerevisiae and a member of the protein tyrosine-phosphatase (PTP) superfamily. Conclusions that we derive from structural data are supported by extensive site-directed mutagenesis and kinetic analyses, thereby attributing new functional significance to several key residues. Iin this work, we demonstrate the high activity and exquisite specificity of Siw14 for the 5-diphosphate group of PP-InsPs. The three structural elements that demarcate a 9.2-Å-deep substrate-binding pocket each have spatial equivalents in PTPs, but we identify how these are specialized for Siw14 to bind and hydrolyze the intensely negatively charged PP-InsPs. (a) The catalytic P-loop with the CX 5 R(S/T) PTP motif contains additional, positively charged residues. (b) A loop between the $α$5 and $α$6 helices, corresponding to the Q-loop in PTPs, contains a lysine and an arginine that extend into the catalytic pocket due to displacement of the $α$5 helix orientation through intramolecular crowding caused by three bulky, hydrophobic residues. (c) The general-acid loop in PTPs is replaced in Siw14 with a flexible loop that does not use an aspartate or glutamate as a general acid. We propose that an acidic residue is not required for phosphoanhydride hydrolysis.

59 BASIC BIOLOGICAL SCIENCES↗

Skluma: An extensible metadata extraction pipeline for disorganized data

To mitigate the effects of high-velocity data expansion and to automate the organization of filesystems and data repositories, we have developed Skluma-a system that automatically processes a target filesystem or repository, extracts content-and context-based metadata, and organizes extracted metadata for subsequent use. Skluma is able to extract diverse metadata, including aggregate values derived from embedded structured data; named entities and latent topics buried within free-text documents; and content encoded in images. Skluma implements an overarching probabilistic pipeline to extract increasingly specific metadata from files. It applies machine learning methods to determine file types, dynamically prioritizes and then executes a suite of metadata extractors, and explores contextual metadata based on relationships among files. The derived metadata, represented in JSON, describes probabilistic knowledge of each file that may be subsequently used for discovery or organization. Skluma's architecture enables it to be deployed both locally and used as an on-demand, cloud-hosted service to create and execute dynamic extraction workflows on massive numbers of files. It is modular and extensible-allowing users to contribute their own specialized metadata extractors. Thus far we have tested Skluma on local filesystems, remote FTP-accessible servers, and publicly-accessible Globus endpoints. We have demonstrated its efficacy by applying it to a scientific environmental data repository of more than 500,000 files. We show that we can extract metadata from those files with modest cloud costs in a few hours.

data swamp↗

Cyote-attack Chain Estimator

Attack Chain Estimator (ACE) Application Overview The Attack Chain Estimator (ACE) Application is a sophisticated tool designed for the ingestion, classification, sequencing, and enrichment of cybersecurity threat reports. This application leverages advanced machine learning models and extensive historical data to provide comprehensive insights into cyber threats, specifically targeting Industrial Control Systems (ICS). Purpose The primary functions of the ACE Application include: Ingestion of Cybersecurity Threat Reporting: Capable of ingesting text-based threat reports in markdown or text file format. Supports ingestion of structured data from other sources in STIX/JSON format. Classification of Report’s Text-Based Events: Utilizes a DeBERTa classifier, specifically trained on cybersecurity data, to map the events to MITRE ATT&CK for ICS Tactics and Techniques. Classification is performed using multiple Jupyter notebooks and machine learning workflows hosted as FastAPI microservices: regex_data deberta_base_35_train_hft_classifier_mlflow.ipynb hft_regex_classifier_mlflow.ipynb param_train_hft_classifier_mlflow.ipynb regex_tactic_tech.ipynb Ordering of Tactics, Techniques, and Observable Events: Sequences the identified tactics, techniques, and events to form a coherent attack chain. Enrichment with Historical Attack Chain Details: Enhances the attack chain with details from historical attacks using a Markov model developed from CyOTE Precursor Analysis Report data. The Markov model is available as a FastAPI endpoint for seamless integration. Enrichment with Adversary Emulation Capabilities Data: Integrates adversary emulation capabilities data using MITRE Caldera for OT adversary abilities UUIDs. Export of Output Files: Provides options to export the enriched attack chain in JSON or CSV formats. Routing of Output to Other Applications: Facilitates routing of output to various platforms and applications, including: Threat Intelligence Platforms COREII Scout for Threat Intelligence Analysis COREII Modeling and Simulation for Adversary Emulation Technical Description The ACE Application is an advanced cybersecurity tool designed to provide detailed threat analysis and sequence generation. It is built on a robust architecture that integrates natural language processing, machine learning, and historical data modeling. Key Components: Data Ingestion Module: Handles the input of threat reports and data from various formats, ensuring flexibility in data sources. Classification Engine: Employs DeBERTa-based classifiers hosted as FastAPI microservices to analyze and classify threat report events in accordance with the MITRE ATT&CK framework for ICS. Sequence Generator: Orders the classified events into a logical attack chain, providing clear insight into the sequence of tactics and techniques used in the threat. Enrichment Engine: Integrates historical data and adversary emulation capabilities to enhance the attack chain with valuable context and additional details. The historical data enrichment is powered by a Markov model, which is available as a FastAPI endpoint. Export and Routing Module: Facilitates the export of the enriched attack chain in multiple formats and routes the output to designated applications for further analysis or emulation.

Paul, Tony [Idaho National Laboratory (INL), Idaho↗

TAT-C: A Trade-Space Analysis Tool for Constellations

Under a changing technological and economic environment, there is growing interest in implementing future NASA Earth Science missions as Distributed Spacecraft Missions (DSM). The objective of our project is to provide a framework that facilitates DSM Pre-Phase A investigations and optimizes DSM designs with respect to a-priori Science goals. In this first version of our Trade-space Analysis Tool for Constellations (TAT-C), we are investigating questions such as: Which type of constellations should be chosen? How many spacecraft should be included in the constellation? Which design has the best costrisk value? This paper describes the overall architecture of TAT-C including: a User Interface (UI) interacting with multiple users - scientists, missions designers or program managers; an Executive Driver gathering requirements from UI and formulating Trade-space Search Requests for the Trade-space Search Iterator, which in collaboration with the Orbit Coverage, Reduction Metrics, and Cost Risk modules generates multiple potential architectures and their associated characteristics. UI will include Graphical, Command Line and Application Programmer Interfaces to respond to the demands of various levels of users expertise. Science inputs are grouped into various mission concepts, satellite specifications, and payload specifications, while science outputs are grouped into several types of metrics - spatial, temporal, angular and radiometric. Orbit Coverage leverages the use of the Goddard Mission Analysis Tool (GMAT) to compute coverage and ancillary data that are passed to Reduction Metrics. Then, for each architecture design, Cost Risk will provide estimates of the cost and life cycle cost as well as technical and cost risk of the proposed mission. Additionally, the Knowledge Base module is a centralized store of structured data readable by humans and machines. It will support both TAT-C analysis when composing new mission concepts from existing model inputs, and TAT-C exploration when discovering new mission concepts by querying previous results.

Science Data Processing↗

Entwine Point Tiles for 3D Visualization and Querying of ICESat-2

Point Cloud data from non-optical sensors present challenges in scientific computing in both volume of data and files, even for cloud services environments. As part of the Multi-Mission Algorithm and Analysis Platform (MAAP), a joint open science platform for global biomass modelling, we’ve developed a cloud optimized workflow for using ATL08 (ICESat-2) data as a point cloud. For MAAP, the ATL08 data product is published as Entwine Point Tiles (EPT), allowing users to visualize and query the full extent of this collection interactively without pre-downloading, or preprocessing. The EPT format is a cloud-optimized point cloud data format which re-organizes points into a cloud friendly spatially indexed data structure. MAAP uses AWS S3 to store these point clouds and serves them over OGC specified APIs, 3DTiles for visualization, and WFS for querying. This workflow allows for interactive 3D visualizations in a web browser, including notebook environments and facilitates on the fly subsetting for interactive data exploration, all of which can be applied to other similar sensors.

Alex Mandel↗

Protein sequence design with a learned potential

The task of protein sequence design is central to nearly all rational protein engineering problems, and enormous effort has gone into the development of energy functions to guide design. Here, we investigate the capability of a deep neural network model to automate design of sequences onto protein backbones, having learned directly from crystal structure data and without any human-specified priors. The model generalizes to native topologies not seen during training, producing experimentally stable designs. We evaluate the generalizability of our method to a de novo TIM-barrel scaffold. The model produces novel sequences, and high-resolution crystal structures of two designs show excellent agreement with in silico models. Our findings demonstrate the tractability of an entirely learned method for protein sequence design.

59 BASIC BIOLOGICAL SCIENCES↗

A velocity/stress mixed stabilized nodal finite element for elastodynamics: Analysis and computations with strongly and weakly enforced boundary conditions

A new nodal mixed finite element is proposed for the simulation of linear elastodynamics and wave propagation problems in time domain. Our method is based on equal-order interpolation discrete spaces for both the velocity (or displacement) and stress (or strain) tensor variables. The mixed form is derived using either the velocity/stress or velocity/strain pair of unknowns, the latter being instrumental in extensions of the method to nonlinear mechanics. The proposed approach works equally well on hexahedral or tetrahedral grids and, for this reason, it is suitable for time-domain engineering applications in complex geometry. The peculiarity of the proposed approach is the use of the rate form of the stress update equation, which yields a set of governing equations with the structure of a non-dissipative space/time Friedrichs’ system. We complement standard traction boundary conditions for the stress with strongly and weakly enforced boundary conditions for the velocity (or displacement). Weakly enforced boundary conditions are particularly suitable when considering complex geometrical shapes, because they do not require dedicated data structures for the imposition of the boundary degrees of freedom, but, rather, they utilize the structure of the variational formulation. Here we also show how the framework of weakly enforced boundary conditions can be used to develop variational forms for multi-domain simulations of heterogeneous media. A complete analysis including stability and convergence proofs is included, in the case of a space–time variational approach. A series of computational tests are used to demonstrate and verify the performance of the proposed approach.

42 ENGINEERING↗

A quantitative model of application slow-down in multi-resource shared systems

Scheduling multiple jobs onto a platform enhances system utilization by sharing resources. The benefits from higher resource utilization include reduced cost to construct, operate, and maintain a system, which often include energy consumption. Maximizing these benefits comes at a price-resource contention among jobs increases job completion time. In this study, we analyze slow-downs of jobs due to contention for multiple resources in a system; referred to as dilation factor. We observe that multiple-resource contention creates non-linear dilation factors of jobs. From this observation, we establish a general quantitative model for dilation factors of jobs in multi-resource systems. A job is characterized by a vector-valued loading statistics and dilation factors of a job set are given by a quadratic function of their loading vectors. We demonstrate how to systematically characterize a job, maintain the data structure to calculate the dilation factor (loading matrix), and calculate the dilation factor of each job. We validate the accuracy of the model with multiple processes running on a native Linux server, virtualized servers, and with multiple MapReduce workloads co-scheduled in a cluster. Evaluation with measured data shows that the D-factor model has an error margin of less than 16%. We extended the D-factor model to capture the slow-down of applications when multiple identical resources exist such as multi-core environments and multi-disks environments. Finally, validation results of the extended D-factor model with HPC checkpoint applications on the parallel file systems show that D-factor accurately captures the slow down of concurrent applications in such environments.

97 MATHEMATICS AND COMPUTING↗

A unified multigrid solver for the Navier-Stokes equations on mixed element meshes

A unified multigrid solution technique is presented for solving the Euler and Reynolds-averaged Navier-Stokes equations on unstructured meshes using mixed elements consisting of triangles and quadrilaterals in two dimensions, and of hexahedra, pyramids, prisms, and tetrahedra in three dimensions. While the use of mixed elements is by no means a novel idea, the contribution of the paper lies in the formulation of a complete solution technique which can handle structured grids, block structured grids, and unstructured grids of tetrahedra or mixed elements without any modification. This is achieved by discretizing the full Navier-Stokes equations on tetrahedral elements, and the thin layer version of these equations on other types of elements, while using a single edge-based data-structure to construct the discretization over all element types. An agglomeration multigrid algorithm, which naturally handles meshes of any types of elements, is employed to accelerate convergence. An automatic algorithm which reduces the complexity of a given triangular or tetrahedral mesh by merging candidate triangular or tetrahedral elements into quadrilateral or prismatic elements is also described. The gains in computational efficiency afforded by the use of non-simplicial meshes over fully tetrahedral meshes are demonstrated through several examples.

Mavriplis, D. J.↗

Design and implementation of HuREX analysis supporting interface - 171

Human error is recognized as one of the main causes to affect to the socio-technical system including nuclear power plant. Therefore, reducing human error through human reliability analysis (HRA) is a critical issue. Moreover, sufficient and reliable human performance data collection is a prerequisite for ensuring the safety of nuclear power plants. Korea Atomic Energy Research Institute developed the HuREX (Human Reliability data Extraction) framework to collect and analyze the responses of human operators from simulator training records of nuclear power plant. Thus, the development and computer software interfaces of the database are essential to efficiently support human reliability analysis. In this study, OPERA database was developed in accordance with the following process. First, the essential data required for the HRA analysis (e.g., plant data, procedures, system and equipment info, operating crews, results of simulator experiments, and so forth) was stored in the database. In addition, standardized procedures and related items were stored in the database to support HRA quantification. A data structure was developed to store crew responses conducted by operators to cope with an emergency situation during simulator experiments. In addition, various interfaces that escalate efficiency of the HuREX applications were developed. The HuREX analysis support interface was developed with HuREX Video Analyzer for observation of simulator collection data (e.g., audio-visual records, plant parameters, operator's action logs) and HuREX Data Analyzer for analysis of operator's conducted task. By using the OPERA database and HuREX analysis support interface developed through this research, maximizing the efficiency of human reliability analysis based on simulator training data. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗