Search NASA⌕ Search

SEARCH · Search NASA

Results for “structured data”

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

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

At least 1,153 records · Page 64

Tiling Framework for Heterogeneous Computing of Matrix based Tiled Algorithms

Tiling matrix operations can improve the load balancing and performance of applications on heterogeneous computing resources. Writing a tile-based algorithm for each operation with a traditional, hand-tuned tiling approach that uses for loops in C/C++ is cumbersome and error prone. Moreover, it must enable and support the heterogeneous memory management of data objects and also explore architecture-supported, native, tiled-data transfer APIs instead of copying the tiled data to continuous memory before the data transfer. The tiling framework provides a tiled data structure for heterogeneous memory mapping and parameterization to a heterogeneous task specification API. We have integrated our tiled framework into MatRIS (Math kernels library using IRIS). IRIS is a heterogeneous run-time framework with a heterogeneous programming model, memory model, and task execution model. Experiments reveal that the tiled framework for BLAS operations has improved the programmability of tiled BLAS and improved performance by ~20% when compared against the traditional method that copies the data to continuous memory locations for heterogeneous computing.

Miniskar, Narasinga Rao↗

CCSDS - An approach to the definition of common standards for space data and information systems

The Consultative Committee for Space Data Systems (CCSDS) was formed in 1982 to develop common space system data structures, protocols, and interfaces which would facilitate mutual international support and interoperability. It soon emerged that CCSDS's activities exerted synergistic forces on systems development efforts. Currently, CCSDS is composed of both member-status and observer-status agencies; while only one member agency is admitted from any one country, multiple additional agencies may participate as observers. CCSDS recommendations to date have identified a common architectural approach for the handling and processing of space data.

Greene, Edward P.↗

EV-ELM (Electric Vehicle Policies with the Energy Language Model) [SWR-25-156]

Electric Vehicle Policies with the Energy Language Model (EV-ELM) leverages previous work using Large Language Models (LLMs) to find, download, and parse policy information related to energy infrastructure. In this application, we use LLMs to find policy documents related to the permitting and installation of electric vehicle charging infrastructure. This software contains the code to find, download, and parse these documents, while a related data record in the Open Energy Data Initiative (OEDI) will include the resulting output dataset that can be used for downstream analysis. The EV-ELM repository contains code for the EV-ELM project, which focuses on retrieving and processing EV permitting processes using large language models. The project is composed of two pipelines: (1) a web scraping pipeline for discovering and downloading EV permitting documents, and (2) a document parsing and extraction pipeline that processes the downloaded files to produce structured data. The web scraping pipeline is designed to extract relevant information from various websites, while the document parsing pipeline processes and analyzes the extracted documents to derive meaningful insights. Both pipelines depend on the NLR elm repository, which provides essential tools and functionalities for handling and processing the data. The web scraping pipeline is a modified version of the ordinance_gpt example within the elm repository. It has been adapted to fit the specific requirements of the EV-ELM project, ensuring that it effectively captures and processes the necessary information related to EV permitting.

Olson, Reid [National Laboratory of the Rockies (N↗

Structured Course Objects in a Digital Library

We are developing an Undergraduate Digital Library Framework (UDLF) that will support creation/archiving of courses and reuse of existing course material to evolve courses. UDLF supports the publication of course materials for later instantiation for a specific offering and allows the addition of time-dependent and student-specific information and structures. Instructors and, depending on permissions, students can access the general course materials or the materials for a specific offering. We are building a reference implementation based on NCSTRL+, a digital library derived from NCSTRL. Digital objects in NCSTRL+ are called buckets, self-contained entities that carry their own methods for access and display. Current bucket implementations have a two level structure of packages and elements. This is not a rich enough structure for course objects in UDLF. Typically, courses can only be modeled as a multilevel hierarchy and among different courses, both the syntax and semantics of terms may vary. Therefore, we need a mechanism to define, within a particular library, course models, their constituent objects, and the associated semantics in a flexible, extensible way. In this paper, we describe our approach to define and implement these multilayered course objects. We use XML technology to emulate complex data structures within the NCSTRL+ buckets. We have developed authoring and browsing tools to manipulate these course objects. In our current implementation a user downloading an XML based course bucket also downloads the XML-aware tools: an applet that enables the user to edit or browse the bucket. We claim that XML provides an effective means to represent multi-level structure of a course bucket.

Maly, K.↗

Engineering and Scientific Applications: Using MatLab(Registered Trademark) for Data Processing and Visualization

MatLab(R) (MATrix LABoratory) is a numerical computation and simulation tool that is used by thousands Scientists and Engineers in many cou ntries. MatLab does purely numerical calculations, which can be used as a glorified calculator or interpreter programming language; its re al strength is in matrix manipulations. Computer algebra functionalities are achieved within the MatLab environment using "symbolic" toolbo x. This feature is similar to computer algebra programs, provided by Maple or Mathematica to calculate with mathematical equations using s ymbolic operations. MatLab in its interpreter programming language fo rm (command interface) is similar with well known programming languag es such as C/C++, support data structures and cell arrays to define c lasses in object oriented programming. As such, MatLab is equipped with most ofthe essential constructs of a higher programming language. M atLab is packaged with an editor and debugging functionality useful t o perform analysis of large MatLab programs and find errors. We belie ve there are many ways to approach real-world problems; prescribed methods to ensure foregoing solutions are incorporated in design and ana lysis of data processing and visualization can benefit engineers and scientist in gaining wider insight in actual implementation of their perspective experiments. This presentation will focus on data processing and visualizations aspects of engineering and scientific applicati ons. Specifically, it will discuss methods and techniques to perform intermediate-level data processing covering engineering and scientifi c problems. MatLab programming techniques including reading various data files formats to produce customized publication-quality graphics, importing engineering and/or scientific data, organizing data in tabu lar format, exporting data to be used by other software programs such as Microsoft Excel, data presentation and visualization will be discussed. The presentation will emphasize creating practIcal scripts (pro grams) that extend the basic features of MatLab TOPICS mclude (1) Ma trix and vector analysis and manipulations (2) Mathematical functions (3) Symbolic calculations & functions (4) Import/export data files (5) Program lOgic and flow control (6) Writing function and passing parameters (7) Test application programs

Sen, Syamal K.↗

Use of networked workstations for parallel nonlinear structural dynamic simulations of rotating bladed-disk assemblies

The principal objective of this research is to investigate, develop and demonstrate coarse-grained, parallel-processing strategies for nonlinear dynamic simulations for rotating bladed-disk assemblies. The parallel -processing strategies addressed include numerical algorithms for parallel nonlinear solutions and techniques to effect load balancing among processors. The parallel environment employed is a distributed-memory, coarse-grained one consisting of networked workstations. A parallel explicit time integration method has been implemented for transient nonlinear solutions of rotationg bladed-disk assemblies. Automatic domain partitioning techniques have been investigated for load balancing among processors. Advanced computing environments, data structures and interactive computer graphics all contribute to an integrated parallel finite element analysis system to facilitate more efficient and powerful dynamic simulations.

Hsieh, Shang-Hsien↗

Mesh-free data transfer algorithms for partitioned multiphysics problems: Conservation, accuracy, and parallelism

In this study we analyze and extend mesh-free algorithms for three-dimensional data transfer problems in partitioned multiphysics simulations. We first provide a direct comparison between a mesh-based weighted residual method using the common-refinement scheme and two mesh-free algorithms leveraging compactly supported radial basis functions: one using a spline interpolation and one using a moving least square reconstruction. Through the comparison we assess both the conservation and accuracy of the data transfer obtained from each of the methods. We do so for a varying set of geometries with and without curvature and sharp features and for functions with and without smoothness and with varying gradients. Our results show that the mesh-based and mesh-free algorithms are complementary with cases where each was demonstrated to perform better than the other. We then focus on the mesh-free methods by developing a set of algorithms to parallelize them based on sparse linear algebra techniques. This includes a discussion of fast parallel radius searching in point clouds and restructuring the interpolation algorithms to leverage data structures and linear algebra services designed for large distributed computing environments. The scalability of our new algorithms is demonstrated on a leadership class computing facility using a set of basic scaling studies. Finally, these scaling studies show that for problems with reasonable load balance, our new algorithms for both spline interpolation and moving least square reconstruction demonstrate both strong and weak scalability using more than 100,000 MPI processes with billions of degrees of freedom in the data transfer operation.

97 MATHEMATICS AND COMPUTING↗

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↗

Comparative analysis of data base management systems

A study to determine if the Remote File Inquiry (RFI) system would handle the future requirements of the user community is discussed. RFI is a locally written and locally maintained on-line query/update package. The current and future on-line requirements of the user community were studied. Additional consideration was given to the types of data structuring the users required. The survey indicated the features of greatest benefit were: sort, subtotals, totals, record selection, storage of queries, global updating and the ability to page break. The major deficiencies were: one level of hierarchy, excessive response time, software unreliability, difficult to add, delete and modify records, complicated error messages and the lack of ability to perform interfield comparisons. Missing features users required were: formatted screens, interfield comparions, interfield arithmetic, multiple file access, security and data integrity. The survey team recommended Kennedy Space Center move forward to state-of-the-art software, a Data Base Management System which is thoroughly tested and easy to implement and use.

Smith, R.↗

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↗

Python-Based Scientific Analysis and Visualization of Precipitation Systems at NASA Marshall Space Flight Center

At NASA Marshall Space Flight Center (MSFC), Python is used several different ways to analyze and visualize precipitating weather systems. A number of different Python‐based software packages have been developed, which are available to the larger scientific community. The approach in all these packages is to utilize pre‐existing Python modules as well as to be object‐oriented and scalable. The first package that will be described and demonstrated is the Python Advanced Microwave Precipitation Radiometer (AMPR) Data Toolkit, or PyAMPR for short. PyAMPR reads geolocated brightness temperature data from any flight of the AMPR airborne instrument over its 25‐year history into a common data structure suitable for user‐defined analyses. It features rapid, simplified (i.e., one line of code) production of quick‐look imagery, including Google Earth overlays, swath plots of individual channels, and strip charts showing multiple channels at once. These plotting routines are also capable of significant customization for detailed, publication‐ready figures. Deconvolution of the polarization‐varying channels to static horizontally and vertically polarized scenes is also available. Examples will be given of PyAMPR's contribution toward real‐time AMPR data display during the Integrated Precipitation and Hydrology Experiment (IPHEx), which took place in the Carolinas during May‐June 2014. The second software package is the Marshall Multi‐Radar/Multi‐Sensor (MRMS) Mosaic Python Toolkit, or MMM‐Py for short. MMM‐Py was designed to read, analyze, and display three‐dimensional national mosaicked reflectivity data produced by the NOAA National Severe Storms Laboratory (NSSL). MMM‐Py can read MRMS mosaics from either their unique binary format or their converted NetCDF format. It can also read and properly interpret the current mosaic design (4 regional tiles) as well as mosaics produced prior to late July 2013 (8 tiles). MMM‐Py can easily stitch multiple tiles together to provide a larger regional or national picture of precipitating weather systems. Composites, horizontal and vertical crosssections, and combinations thereof are easily displayed using as little as one line of code. MMM‐Py can also write to the native MRMS binary format, and sub‐sectioning of tiles (or multiple stitched tiles) is anticipated to be in place by the time of this meeting. Thus, MMM‐Py also can be used to power the creation of custom mosaics for targeted regional studies. Overlays of other data (e.g., lightning observations) are easily accomplished. Demonstrations of MMM‐Py, including the creation of animations, will be shown. Finally, Marshall has done significant work to interface Python‐based analysis routines with the U.S. Department of Energy's Py‐ART software package for radar data ingest, processing, and analysis. One example of this is the Python Turbulence Detection Algorithm (PyTDA), an MSFC‐based implementation of the National Center for Atmospheric Research (NCAR) Turbulence Detection Algorithm (NTDA) for the purposes of convective‐scale analysis, situational awareness, and forensic meteorology. PyTDA exploits Py‐ART's radar data ingest routines and data model to rapidly produce aviation‐relevant turbulence estimates from Doppler radar data. Work toward processing speed optimization and better integration within the Py‐ART framework will be highlighted. Python‐based analysis within the Py‐ART framework is also being done for new research related to intercomparison of ground‐based radar data with satellite estimates of ocean winds, as well as research on the electrification of pyrocumulus clouds.

Lang, Timothy J.↗

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↗

Multi-Dimensional Spectral Difference Method for Unstructured Grids

A new, high-order, conservative, and efficient method for conservation laws on unstructured grids is developed. It combines the best features of structured and unstructured grid methods to attain computational efficiency and geometric flexibility; it utilizes the concept of discontinuous and high-order local representations to achieve conservation and high accuracy; and it is based on the finite-difference formulation for simplicity. Universal reconstructions are obtained by distributing unknowns in a geometrically similar manner for all unstructured cells. Placements of the unknown and flux points with various order of accuracy are given for the line, triangular and tetrahedral elements. The data structure of the new method permits an optimum use of cache memory, resulting in further computational efficiency on modern computers. A new pointer system is developed that reduces memory requirements and simplifies programming for any order of accuracy. Numerical solutions are presented and compared with the exact solutions for wave propagation problems in both two and three dimensions to demonstrate the capability of the method. Excellent agreement has been found. The method is simpler and more efficient than previous discontinuous Galerkin and spectral volume methods for unstructured grids.

Liu, Yen↗

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↗

Helicity, membrane incorporation, orientation and thermal stability of the large conductance mechanosensitive ion channel from E. coli

In this report, we present structural studies on the large conductance mechanosensitive ion channel (MscL) from E. coli in detergent micelles and lipid vesicles. Both transmission Fourier transform infrared spectroscopy and circular dichroism (CD) spectra indicate that the protein is highly helical in detergents as well as liposomes. The secondary structure of the proteins was shown to be highly resistant towards denaturation (25-95 degrees C) based on an ellipticity thermal profile. Amide H+/D+ exchange was shown to be extensive (ca. 66%), implying that two thirds of the protein are water accessible. MscL, reconstituted in oriented lipid bilayers, was shown to possess a net bilayer orientation using dichroic ratios measured by attenuated total-reflection Fourier transform infrared spectroscopy. Here, we present and discuss this initial set of structural data on this new family of ion-channel proteins.

NASA Discipline Cell Biology↗

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↗