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 361 records · Page 20

STAR (Simple Tool for Automated Reasoning): Tutorial guide and reference manual

STAR is an interactive, interpreted programming language for the development and operation of Artificial Intelligence application systems. The language is intended for use primarily in the development of software application systems which rely on a combination of symbolic processing, central to the vast majority of AI algorithms, with routines and data structures defined in compiled languages such as C, FORTRAN and PASCAL. References to routines and data structures defined in compiled languages are intermixed with symbolic structures in STAR, resulting in a hybrid operating environment in which symbolic and non-symbolic processing and organization of data may interact to a high degree within the execution of particular application systems. The STAR language was developed in the course of a project involving AI techniques in the interpretation of imaging spectrometer data and is derived in part from a previous language called CLIP. The interpreter for STAR is implemented as a program defined in the language C and has been made available for distribution in source code form through NASA's Computer Software Management and Information Center (COSMIC). Contained within this report are the STAR Tutorial Guide, which introduces the language in a step-by-step manner, and the STAR Reference Manual, which provides a detailed summary of the features of STAR.

Borchardt, G. C.↗

RNTuple: A CMS Perspective

ROOT is planning to move from TTree to RNTuple as the data storage format for HL-LHC in order to, for example, speed up the IO, make the files smaller, and have a modern C++ API. Initially, RNTuple was not planned to support the same set of C++ data structures as TTree supports. CMS has explored the necessary transformations in its standard persistent data types to switch to RNTuple. Many challenges were encountered as alternative data structures were explored. This contribution will discuss the challenges uncovered and how collaboration with the ROOT team allowed them to be overcome. The solution to the challenges allows progressive changes to the CMS data types rather than requiring a sudden change to all data types to be stored in RNTuple. Once the solution was achieved, storage performance comparisons using the CMS data types were possible between RNTuple and TTree. This contribution will also present the results of those comparisons.

Smith, Nick↗

Integrated Process-Structure-Property Simulations for Additive Manufacturing Using the Open-Source Materialite Package

The microstructure and properties of additively manufactured (AM) metals are strongly dependent on process conditions. Therefore, process-structure-property (PSP) simulations are a useful tool for exploring process parameter space, studying process variations, and quantifying uncertainty in material properties. However, integrating process-structure and structure-property simulations often involves connecting multiple software packages. Each package may use unique data structures and require substantial domain knowledge. This presentation demonstrates PSP simulation capabilities of Materialite, an open-source package developed at NASA Langley Research Center. Materialite simplifies model linkages by using a common data structure and model interface, enabling straightforward simulation across a PSP model chain. Physics-based models, including kinetic Monte Carlo and crystal plasticity, are implemented within the package. The model interface is also intended to simplify implementation of new models and enable integration with external simulation tools. Example use cases include uncertainty quantification with PSP models and GPU-accelerated powder bed fusion AM process models.

additive manufacturing↗

Synthesizing information-update functions using off-line symbolic processing

This paper explores the synthesis of programs that track dynamic conditions in their environment. An approach is proposed in which the designer specifies, in a declarative language, aspects of the environment in which the program will be embedded. This specification is then automatically compiled into a program that, when executed, updates internal data structures so as to maintain as an invariant a desired correspondence between internal data structures and states of the external environment. This approach retains much of the flexibility of declarative programming while guaranteeing a hard bound on the execution time of information-update functions.

Rosenschein, Stanley J.↗

NASTRAN/FLEXSTAB procedure for static aeroelastic analysis

Presented is a procedure for using the FLEXSTAB External Structural Influence Coefficients (ESIC) computer program to produce the structural data necessary for the FLEXSTAB Stability Derivatives and Static Stability (SD&SS) program. The SD&SS program computes trim state, stability derivatives, and pressure and deflection data for a flexible airplane having a plane of symmetry. The procedure used a NASTRAN finite-element structural model as the source of structural data in the form of flexibility matrices. Selection of a set of degrees of freedom, definition of structural nodes and panels, reordering and reformatting of the flexibility matrix, and redistribution of existing point mass data are among the topics discussed. Also discussed are boundary conditions and the NASTRAN substructuring technique.

Schuster, L. S.↗

Wind and structural loads data measured on parabolic trough solar collectors at an operational power plant

Abstract Wind loading is a primary contributor to structural design costs of concentrating solar-thermal power collectors, such as heliostats and parabolic troughs. These structures must resist the mechanical forces generated by turbulent wind, while the reflector surfaces must maintain optimal optical performance. Studying wind-driven loads at a full-scale, operational concentrating solar-thermal power plant provides insights into the wind impact on the solar collector field beyond the capabilities of wind tunnel tests or state-of-the-art simulations. We conducted comprehensive field measurements of the atmospheric turbulent wind conditions and the resulting structural wind loads on parabolic troughs at the Nevada Solar One plant over a two-year period. The measurement setup included meteorological masts and structural load sensors on four trough rows. Additionally, a lidar scanned the horizontal plane above the trough field. In this study, we describe the high-resolution dataset characterizing the complex flow field and resulting structural loads. This first-of-its-kind dataset will enhance the understanding of wind loading on collector structures and will help in designing the next-generation solar collectors and photovoltaic trackers.

14 SOLAR ENERGY↗

RAPID and DDS

This talk gives an overview of the the Robot Applications Programmers Interface Delegate (RAPID) as well as the distributed systems middleware Data Distribution Service (DDS). DDS is an open software standard, RAPID is cleared for open-source release under NOSA. RAPID specifies data-structures and semantics for high-level telemetry published by NASA robotic software. These data-structures are supported by multiple robotic platforms at Johnson Space Center (JSC), Jet Propulsion Laboratory (JPL) and Ames Research Center (ARC), providing high-level interoperability between those platforms. DDS is used as the middleware for data transfer. The feature set of the middleware heavily influences the design decision made in the RAPID specification. So it is appropriate to discuss both in this introductory talk.

Utz, Hans Heinrich↗

Architecture of a large object-oriented database for remotely sensed data

Attention is given to the proposed Intelligent Information Fusion System (IIFS) within the framework of the Intelligent Data Management project at NASA-Goddard. IIFS is to use connectionist architectures to extract high-level attributes from incoming sensor images, and then send those characterizations and their associated ephemeris and ancillary image data to a large object-oriented database which will serve as the master catalog of sensor data. Important issues facing this project include the choice of rapid-access data structures (RADSs) for cataloging images by their high-level characterization, the implementation of efficient spatial data structures for cataloging images by their scene location, the automated population of such a database from a continuous stream of incoming ephemeris and ancillary data, and the translation and optimization of natural-language database queries so that RADSs are employed when appropriate.

Dorfman, Erik↗

GOTTCHA Database, Version 1

One major challenge in the field of shotgun metagenomics is the accurate identification of the organisms present within the community, based on classification of short sequence reads. Though microbial community profiling methods have emerged to attempt to rapidly classify the millions of reads output from contemporary sequencers, the combination of incomplete databases, similarity among otherwise divergent genomes, and the large volumes of sequencing data required for metagenome sequencing has led to unacceptably high false discovery rates (FDR). Here we present the application of a novel, gene-independent and signature-based metagenomic taxonomic profiling tool with significantly smaller FDR, which is also capable of classifying never-before seen genomes into the appropriate parent taxa.The algorithm is based upon three primary computational phases: (I) genomic decomposition into bit vectors, (II) bit vector intersections to identify shared regions, and (III) bit vector subtractions to remove shared regions and reveal unique, signature regions.In the Decomposition phase, genomic data is first masked to highlight only the valid (non-ambiguous) regions and then decomposed into overlapping 24-mers. The k-mers are sorted along with their start positions, de-replicated, and then prefixed, to minimize data duplication. The prefixes are indexed and an identical data structure is created for the start positions to mimic that of the k-mer data structure.During the Intersection phase -- which is the most computationally intensive phase -- as an all-vs-all comparison is made, the number of comparisons is first reduced by four methods: (a) Prefix restriction, (b) Overlap detection, (c) Overlap restriction, and (d) Result recording. In Prefix restriction, only k-mers of the same prefix are compared. Within that group, potential overlap of k-mer suffixes that would result in a non-empty set intersection are screened for. If such an overlap exists, the region which intersects is first reduced by performing a binary search of the boundary suffixes of the smaller set into the larger set, which defines the limits of the zipper-based intersection process. Rather than recording the actual k-mers of the intersection, another data structure of identical "shape" is created which consists of only bit vectors so that only a 1 or 0 will be stored in the location of the k-mer suffix that was found in the intersection. This reduces the amount of data generated and stored considerably.During the Subtraction phase, relevant intersection bitmasks are first unionized together to form a single bitmask which is then applied over the original genome to reveal only those regions of the genome that are unique. These regions are then exported to disk in FASTA format and used in the application of determining the constituents of an unknown metagenomic community.The DATABASE provided is the result of the algorithm described.

Freitas, Tracey↗

GOTTCHA Database, Version 1

One major challenge in the field of shotgun metagenomics is the accurate identification of the organisms present within the community, based on classification of short sequence reads. Though microbial community profiling methods have emerged to attempt to rapidly classify the millions of reads output from contemporary sequencers, the combination of incomplete databases, similarity among otherwise divergent genomes, and the large volumes of sequencing data required for metagenome sequencing has led to unacceptably high false discovery rates (FDR). Here we present the application of a novel, gene-independent and signature-based metagenomic taxonomic profiling tool with significantly smaller FDR, which is also capable of classifying never-before seen genomes into the appropriate parent taxa.The algorithm is based upon three primary computational phases: (I) genomic decomposition into bit vectors, (II) bit vector intersections to identify shared regions, and (III) bit vector subtractions to remove shared regions and reveal unique, signature regions.In the Decomposition phase, genomic data is first masked to highlight only the valid (non-ambiguous) regions and then decomposed into overlapping 24-mers. The k-mers are sorted along with their start positions, de-replicated, and then prefixed, to minimize data duplication. The prefixes are indexed and an identical data structure is created for the start positions to mimic that of the k-mer data structure.During the Intersection phase -- which is the most computationally intensive phase -- as an all-vs-all comparison is made, the number of comparisons is first reduced by four methods: (a) Prefix restriction, (b) Overlap detection, (c) Overlap restriction, and (d) Result recording. In Prefix restriction, only k-mers of the same prefix are compared. Within that group, potential overlap of k-mer suffixes that would result in a non-empty set intersection are screened for. If such an overlap exists, the region which intersects is first reduced by performing a binary search of the boundary suffixes of the smaller set into the larger set, which defines the limits of the zipper-based intersection process. Rather than recording the actual k-mers of the intersection, another data structure of identical "shape" is created which consists of only bit vectors so that only a 1 or 0 will be stored in the location of the k-mer suffix that was found in the intersection. This reduces the amount of data generated and stored considerably.During the Subtraction phase, relevant intersection bitmasks are first unionized together to form a single bitmask which is then applied over the original genome to reveal only those regions of the genome that are unique. These regions are then exported to disk in FASTA format and used in the application of determining the constituents of an unknown metagenomic community.The DATABASE provided is the result of the algorithm described.

Freitas, Tracey↗

FleCSPH notes

FleCSI is a compile-time con gurable framework designed to support multi-physics application development. As such, FleCSI provides a very general set of infrastructure design patterns that can be specialized and extended to suit the needs of a broad variety of solver and data requirements. FleCSI currently supports multi-dimensional mesh topology, geometry, and adjacency information, as well as n-dimensional hashed-tree data structures, graph partitioning interfaces, and dependency closures. FleCSI introduces a functional programming model with control, execution, and data abstractions that are consistent both with MPI and with state-of-the-art, task-based runtimes such as Legion and Charm++. The abstraction layer insulates developers from the underlying runtime, while allowing support for multiple runtime systems including conventional models like asynchronous MPI. The intent is to provide developers with a concrete set of user-friendly programming tools that can be used now, while allowing exibility in choosing runtime implementations and optimization that can be applied to future architectures and runtimes. FleCSI's control and execution models provide formal nomenclature for describing poorly understood concepts such as kernels and tasks. FleCSI's data model provides a low-buy-in approach that makes it an attractive option for many application projects, as developers are not locked into particular layouts or data structure representations. FleCSI currently provides a parallel but not distributed implementation of Binary, Quad and Oct-tree topology. This implementation is base on space lling curves domain decomposition, the Morton order. The current FleCSI version requires the implementation of a driver and a specialization driver. The role of the specialization driver is to provide the data distribution. This feature is not complete in FleCSI code and we provide it. The next step will be to incorporate it directly from FleCSPH to FleCSI as we reach a good level of performance. Then the driver represent the general execution of the resolution without worrying of the data locality and communications. As FleCSI is an On-Development code the structure may change in the future and we keep track of these changes in FleCSPH.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The Monotonic Lagrangian Grid for Rapid Air-Traffic Evaluation

The Air Traffic Monotonic Lagrangian Grid (ATMLG) is presented as a tool to evaluate new air traffic system concepts. The model, based on an algorithm called the Monotonic Lagrangian Grid (MLG), can quickly sort, track, and update positions of many aircraft, both on the ground (at airports) and in the air. The underlying data structure is based on the MLG, which is used for sorting and ordering positions and other data needed to describe N moving bodies and their interactions. Aircraft that are close to each other in physical space are always near neighbors in the MLG data arrays, resulting in a fast nearest-neighbor interaction algorithm that scales as N. Recent upgrades to ATMLG include adding blank place-holders within the MLG data structure, which makes it possible to dynamically change the MLG size and also improves the quality of the MLG grid. Additional upgrades include adding FAA flight plan data, such as way-points and arrival and departure times from the Enhanced Traffic Management System (ETMS), and combining the MLG with the state-of-the-art strategic and tactical conflict detection and resolution algorithms from the NASA-developed Stratway software. In this paper, we present results from our early efforts to couple ATMLG with the Stratway software, and we demonstrate that it can be used to quickly simulate air traffic flow for a very large ETMS dataset.

Kaplan, Carolyn↗

Crystal structures of the transpeptidase domain of the Mycobacterium tuberculosis penicillin‐binding protein PonA1 reveal potential mechanisms of antibiotic resistance

Mycobacterium tuberculosis is a human respiratory pathogen that causes the deadly disease tuberculosis. The rapid global spread of antibiotic‐resistant M. tuberculosis makes tuberculosis infections difficult to treat. To overcome this problem new effective antimicrobial strategies are urgently needed. One promising target for new therapeutic approaches is PonA1, a class A penicillin‐binding protein, which is required for maintaining physiological cell wall synthesis and cell shape during growth in mycobacteria. Here, crystal structures of the transpeptidase domain, the enzymatic domain responsible for penicillin binding, of PonA1 from M. tuberculosis in the inhibitor‐free form and in complex with penicillin V are reported. We used site‐directed mutagenesis, antibiotic profiling experiments, and fluorescence thermal shift assays to measure PonA1's sensitivity to different classes of β‐lactams. Structural comparison of the PonA1 apo‐form and the antibiotic‐bound form shows that binding of penicillin V induces conformational changes in the position of the loop β4′‐α3 surrounding the penicillin‐binding site. We have also found that binding of different antibiotics including penicillin V positively impacts protein stability, while other tested β‐lactams such as clavulanate or meropenem resulted in destabilization of PonA1. Our antibiotic profiling experiments indicate that the transpeptidase activity of PonA1 in both M. tuberculosis and M. smegmatis mediates tolerance to specific cell wall‐targeting antibiotics, particularly to penicillin V and meropenem. Because M. tuberculosis is an important human pathogen, these structural data provide a template to design novel transpeptidase inhibitors to treat tuberculosis infections. Database Structural data are available in the PDB database under the accession numbers 5CRF and 5CXW .

PonA1↗

Proving Correctness for Pointer Programs in a Verifying Compiler

This research describes a component-based approach to proving the correctness of programs involving pointer behavior. The approach supports modular reasoning and is designed to be used within the larger context of a verifying compiler. The approach consists of two parts. When a system component requires the direct manipulation of pointer operations in its implementation, we implement it using a built-in component specifically designed to capture the functional and performance behavior of pointers. When a system component requires pointer behavior via a linked data structure, we ensure that the complexities of the pointer operations are encapsulated within the data structure and are hidden to the client component. In this way, programs that rely on pointers can be verified modularly, without requiring special rules for pointers. The ultimate objective of a verifying compiler is to prove-with as little human intervention as possible-that proposed program code is correct with respect to a full behavioral specification. Full verification for software is especially important for an agency like NASA that is routinely involved in the development of mission critical systems.

Kulczycki, Gregory↗

Neutron capture measurements at UMass lowell research reactor

A new facility was designed around the thermal column beam port of the 1 MW Research Reactor at the University of Massachusetts Lowell. Thermal neutrons are collimated to a 1-inch diameter beam and incident on samples to induce the radiative neutron capture. New measurements of capture gamma rays are planned for Mn, Cu, Ni, Cr, and Gd samples in the next few years. The experiments will be carried out in close collaboration with the ENSDF (Evaluated Nuclear Structure Data File) evaluation group at Brookhaven National Laboratory. The gamma rays are measured using an array of high-resolution HPGe detectors. Some of the HPGe detectors use active Compton shields that were designed from scintillation detectors and improve significantly the signal-to-background in the measured gamma-ray spectra with HPGe. The experimental spectra will be validated by the GEANT4 simulations of the array and theoretical models of the emission of gamma rays from the compound nucleus. In conclusion, the new experimental results on the capture gamma ray intensities will be incorporated in future ENSDF evaluations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

System, method, and computer program product for warming a cache for a task launch

A system, method, and computer program product for warming a cache for a task launch is described. The method includes the steps of receiving a task data structure that defines a processing task, extracting information stored in a cache warming field of the task data structure, and, prior to executing the processing task, generating a cache warming instruction that is configured to load one or more entries of a cache storage with data fetched from a memory.

Ricketts, Scott↗