Search NASA⌕ Search

SEARCH · Search NASA

Results for “data structure”

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

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

At least 217 records · Page 12

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↗

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↗

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↗

Recent trends in geographic information system research

This paper reviews recent contributions to the body of published research on Geographic Information Systems (GISs). Increased usages of GISs have placed a new demand upon the academic and research community and despite some lack of formalized definitions, categorizations, terminologies, and standard data structures, the community has risen to the challenge. Examinations of published GIS research, in particular on GIS data structures, reveal a healthy, active research community which is using a truly interdisciplinary approach. Future work will undoubtably lead to a clearer understanding of the problems of handling spatial data, while producing a new generation of highly sophisticated GISs.

Clarke, K. C.↗

A spatial data handling system for retrieval of images by unrestricted regions of user interest

The Intelligent Data Management (IDM) project at NASA/Goddard Space Flight Center has prototyped an Intelligent Information Fusion System (IIFS), which automatically ingests metadata from remote sensor observations into a large catalog which is directly queryable by end-users. The greatest challenge in the implementation of this catalog was supporting spatially-driven searches, where the user has a possible complex region of interest and wishes to recover those images that overlap all or simply a part of that region. A spatial data management system is described, which is capable of storing and retrieving records of image data regardless of their source. This system was designed and implemented as part of the IIFS catalog. A new data structure, called a hypercylinder, is central to the design. The hypercylinder is specifically tailored for data distributed over the surface of a sphere, such as satellite observations of the Earth or space. Operations on the hypercylinder are regulated by two expert systems. The first governs the ingest of new metadata records, and maintains the efficiency of the data structure as it grows. The second translates, plans, and executes users' spatial queries, performing incremental optimization as partial query results are returned.

Dorfman, Erik↗

Wildfire Segmentation From Remotely Sensed Data Using Quantum-Compatible Conditional Vector Quantized-Variational Autoencoders

Wildfires represent a critical environmental hazard with multifaceted implications for ecosystems, communities, and public health [1]. The escalating frequency and intensity of wildfires globally have intensified the urgency for robust segmentation methodologies to facilitate effective mitigation, response, and recovery strategies [2]. Accurate wildfire segmentation is pivotal for delineating fire boundaries, assessing progression patterns, and prioritizing resource allocation during emergency scenarios. Furthermore, precise segmentation enables stakeholders, including policymakers, environmental scientists, and emergency responders, to formulate evidence-based strategies, thereby minimizing socio-economic disruptions and ecological degradation. Consequently, advancing wildfire segmentation techniques through innovative technological interventions remains a paramount research imperative. Although foundational in wildfire segmentation, traditional deterministic models exhibit inherent limitations that compromise their efficacy in dynamic and uncertain environments. These models often operate on rigid algorithms prioritizing deterministic classifications, thereby overlooking the inherent complexities and uncertainties associated with wildfire behavior and satellite data variability. Such deterministic frameworks tend to produce oversimplified representations that fail to capture the intricate nuances of evolving fire dynamics, spatial heterogeneity, and environmental interactions [1]. Consequently, the deterministic approach’s propensity for uncertainty collapsing [1, 3] hampers the accuracy, reliability, and applicability of segmentation outcomes in real-world scenarios. Contrastingly, stochastic models offer a more nuanced and adaptable framework for wildfire segmentation. By integrating probabilistic elements into the modeling paradigm, stochastic approaches, particularly probabilistic approaches such as variational auto encoders (VAEs) [4], facilitate comprehensive uncertainty assessment, enabling researchers to quantify and incorporate uncertainties into segmentation outcomes effectively. This probabilistic nature empowers stochastic models to encapsulate variability, account for data inconsistencies, and adapt to evolving environmental conditions, enhancing segmentation accuracy, reliability, and robustness. Embracing stochastic methodologies thus catalyzes advancements in wildfire science by fostering a more holistic, adaptive, and resilient segmentation framework. Despite VAEs demonstrating significant promise in various applications, they come with inherent limitations that have garnered attention within the machine learning community. One of the primary drawbacks lies in their reliance on static priors, which essentially assume a fixed distribution for latent variables, thereby limiting the model’s flexibility to capture complex data structures effectively [5]. This static nature leads to suboptimal representations, especially when dealing with complex and high-dimensional data. Additionally, VAEs often struggle with generating sharp and realistic samples, a phenomenon commonly referred to as mode collapse [5, 7, 6]. Furthermore, the optimization process in VAEs, which involves balancing the reconstruction loss and the regularization term, can sometimes be challenging to fine-tune [7]. In recent efforts to address these shortcomings, alternative approaches like Vector Quantized Variational Auto encoders(VQ-VAEs) [7], address the challenges by incorporating discrete latent variables and leveraging techniques that enhance the quality and diversity of generated samples while maintaining efficient training dynamics. VQ-VAEs propose a dynamic prior distribution generation mechanism that diverges from the static priors commonly associated with traditional VAEs. This dynamic approach allows for more adaptive and context-aware latent variable representations, thereby potentially capturing complex data structures more effectively. Unlike autoregressive prior models such as PixelCNN, which, despite their ability to model dependencies across data dimensions, suffer from significant computational inefficiencies and lack flexibility in handling diverse datasets. In our work, we propose to use a generative quantum-compatible approach to help alleviate the shortcomings of autoregressive prior model in VQ-VAEs. Restricted Boltzmann Machines (RBMs) are a viable alternative prior model that can learn prior distributions in a faster and more flexible manner. In this research endeavor, we meticulously curate a state-of-the-art dataset leveraging satellite MODIS data in conjunction with VIIRS fire masks, derived from Fire Radiative Power (FRP), thereby encapsulating diverse wildfire scenarios and environmental contexts. We developed a conditional VQ-VAE architecture with the RBM prior model that is trained in a supervised manner for segmenting wildfire masks. This innovative approach synergistically harnesses deep learning capabilities, enabling the generation of segmentation maps characterized by heightened precision, granularity, and contextual relevance. Furthermore, replacing the autoregressive prior learning method proposed by the original VQ-VAE with a prior density approximation via quantum-compatible RBM facilitates expedited inference processes, augments flexibility in prior sampling, optimizes computational efficiency and establishes a groundbreaking benchmark in wildfire segmentation methodologies.

quantum machine learning↗

GridTool: A surface modeling and grid generation tool

GridTool is designed around the concept that the surface grids are generated on a set of bi-linear patches. This type of grid generation is quite easy to implement, and it avoids the problems associated with complex CAD surface representations and associated surface parameterizations. However, the resulting surface grids are close to but not on the original CAD surfaces. This problem can be alleviated by projecting the resulting surface grids onto the original CAD surfaces. GridTool is designed primary for unstructured grid generation systems. Currently, GridTool supports VGRID and FELISA systems, and it can be easily extended to support other unstructured grid generation systems. The data in GridTool is stored parametrically so that once the problem is set up, one can modify the surfaces and the entire set of points, curves and patches will be updated automatically. This is very useful in a multidisciplinary design and optimization process. GridTool is written entirely in ANSI 'C', the interface is based on the FORMS library, and the graphics is based on the GL library. The code has been tested successfully on IRIS workstations running IRIX4.0 and above. The memory is allocated dynamically, therefore, memory size will depend on the complexity of geometry/grid. GridTool data structure is based on a link-list structure which allows the required memory to expand and contract dynamically according to the user's data size and action. Data structure contains several types of objects such as points, curves, patches, sources and surfaces. At any given time, there is always an active object which is drawn in magenta, or in their highlighted colors as defined by the resource file which will be discussed later.

Samareh-Abolhassani, Jamshid↗

Effects of Al:Si and (Al+Na):Si Ratios on the Properties of the International Simple Glass, Part II: Structure

High-alumina containing high-level waste (HLW) will be vitrified at the Waste Treatment Plant at the Hanford Site. The resulting glasses, high in alumina, will have distinct composition-structure-property (C-S-P) relationships compared to previously studied HLW glasses. These C-S-P relationships determine the processability and product durability of glasses and therefore must be understood. The main purpose of this study is to understand the detailed structural changes caused by Al:Si and (Al+Na):Si substitutions in a simplified nuclear waste model glass (ISG, International Simple Glass) by combining experimental structural characterizations and molecular dynamics (MD) simulations. The structures of these two series of glasses were characterized by neutron total scattering and 27Al, 23Na, 29Si, and 11B solid-state nuclear magnetic resonance (NMR) spectroscopy. Additionally, MD simulations were used to generate atomistic structural models of the borosilicate glasses and simulation results were validated by the experimental structural data. Short-range (e.g., bond distance, coordination number, etc.) and medium-range (e.g., oxygen speciation, network connectivity, polyhedral linkages) structural features of the borosilicate glasses were systematically investigated as a function of the degree of substitution. The results show that bond distance and coordination number of the cation-oxygen pairs are relatively insensitive to Al:Si and (Al+Na):Si substitutions with the exception of the B-O pair. Additionally, the Al:Si substitution results in an increase of tri-bridging oxygen species, while (Al+Na):Si substitution creates non-bridging oxygen species. Charge compensator preferences were found for Si-[NBO] (Na+), [3]B-[NBO] (Na+), [4]B (mostly Ca2+), [4]Al (nearly equally split Na+ and Ca2+), and [6]Zr (mostly Ca2+). The network former-BO-network former linkages preferences were also tabulated; Si-O-Al and Al-O-Al were preferred at the expense of lower Si-O-[3]B and [3]B-O-[3]B linkages. These results provide insights on the structural origins of property changes such as glass transition temperature caused by the substitutions, providing a basis for future improvements of theoretical and computer simulation models.

Lu, Xiaonan↗

kynema-fmb [SWR-23-07]

Kynema-FMB (FKA: Kynema) is an open-source performance portable flexible multibody (FMB) dynamics solver designed for time-domain simulations. While originally tailored for wind turbine structural dynamics, the formulation and implementation are those of a general flexible-multidbody dynamics solver that can readily be applied to a wide range of systems. Kynema was designed with a narrow focus, namely to provide a lightweight, fast, accurate FMD solver for coupling to computational-fluid-dynamics (CFD) codes, especially the CFD codes in the Kynema suite, for fluid-structure-interaction (FSI) simulations. Kynema-FMB is equipped to model systems that can be represented as a collection of beams and rigid bodies that are connected through constraints. Degrees of freedom are defined in the inertial/global frame of reference and include displacements and rotations (formally as rotation matrices, but stored as quaternions). The underlying formulation is built on a Lie-group time integrator designed for index-3 differential-algebraic equations, which is second-order accurate in time (Bruls et al., 2012). Beam models are based on geometrically exact beam theory and are discretized as high-order spectral finite elements similar to those in BeamDyn (Wang et al., 2017). The governing equations for a FMD system like a wind turbine constitute a highly nonlinear system of constrained partial-differential equations. Kynema-FMB uses analytical Jacobians in the nonlinear-system solves in each time step. Linear systems use sparse storage and several third-party sparse-linear-system solvers are enabled. Ill conditioning of linear systems is mitigated with preconditioning described in Bottasso et al, 2008. Kynema-FMB is integrated with a simple open-source controller (ROSCO). There is an application programming interface (API) for coupling to geometry-resolved CFD (like that in Sharma et al., 2023) and actuator-force CFD (like that in Kuhn et al., 2025). In the latter, for actuator-line models, Kynema-FMB includes an internal blade-element solver that depends on user-provided lookup tables for coefficients of lift and drag, i.e., aerodynamic polars. Kynema-FMB is written in C++ and leverages Kokkos and Kokkos-Kernels (KokkosEcosystem) as its performance portability layer enabling simulations on both CPU and GPU systems. The repository is equipped with extensive automated testing at the unit and regression/system levels. The following describes the high-level development objectives conceived for Kynema: *Kynema will follow modern software development best practices, including test-driven development (TDD), version control, hierarchical automated testing, and continuous integration (CI) for a robust development environment. *The core data structures are memory efficient and enable vectorization and parallelization at multiple levels. *Data structures are data-oriented to exploit methods for accelerated computing including high utilization of chip resources (e.g., single instruction multiple data (SIMD) instruction sets) and parallelization using GP-GPUs. *The computational algorithms incorporate robust open-source libraries for mathematical operations, resource allocation, and data management. *The API design considers multiple stakeholder needs and ensure integration with existing and future ecosystems for data science, machine learning, and AI. *Kynema-FMB is written in modern C++ and leverages Kokkos as its performance-portability library with inspiration from the kynema stack.

Sprague, MichaelA.↗

Reducing Memory Consumption in Calico with Shared Memory

This document details the work to reduce memory consumption in Calico. Calico is SimTools’ Constructive Solid Geometry (CSG) and geometry painting library. It is primarily used to paint material volume fractions in the Eulerian meshes of the physics codes. Calico provides point-in-body checks for the geometry supplied by an Oso model, which are then aggregated by the host codes. In addition, Calico can be used to build Oso models and is used by Ingen for that purpose. Oso models, and thus Calico, provide support for various CSG primitives such as spheres, cylinders, surfaces generated by rotating tabular curve data, and STL files as well as binary combinations of those primitives. Prior to refactoring Calico will run out of memory on CTS-1 machines when 36 MPI ranks are used per node when reading STL models on the order of 1.5 GB. This limitation is a bottleneck in designer workflow. This problem has been alleviated through the use of data structures to both reduce memory consumption and to leverage MPI-3 shared memory. This report details the data structures targeted for refactoring in Calico, the methods and implementation details for reducing memory consumption and leveraging shared memory, and results for one test problem. Results show a memory reduction when loading a 1 GB STL file by a factor of 27.5, from 93.4 to 3.4 GB.

97 MATHEMATICS AND COMPUTING↗