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,261 records · Page 70

CondiDiag1.0: a flexible online diagnostic tool for conditional sampling and budget analysis in the E3SM atmosphere model (EAM)

Abstract. Numerical models used in weather and climate prediction take into account a comprehensive set of atmospheric processes (i.e., phenomena) such as the resolved and unresolved fluid dynamics, radiative transfer, cloud and aerosol life cycles, and mass or energy exchanges with the Earth's surface. In order to identify model deficiencies and improve predictive skills, it is important to obtain process-level understanding of the interactions between different processes. Conditional sampling and budget analysis are powerful tools for process-oriented model evaluation, but they often require tedious ad hoc coding and large amounts of instantaneous model output, resulting in inefficient use of human and computing resources. This paper presents an online diagnostic tool that addresses this challenge by monitoring model variables in a generic manner as they evolve within the time integration cycle. The tool is convenient to use. It allows users to select sampling conditions and specify monitored variables at run time. Both the evolving values of the model variables and their increments caused by different atmospheric processes can be monitored and archived. Online calculation of vertical integrals is also supported. Multiple sampling conditions can be monitored in a single simulation in combination with unconditional sampling. The paper explains in detail the design and implementation of the tool in the Energy Exascale Earth System Model (E3SM) version 1. The usage is demonstrated through three examples: a global budget analysis of dust aerosol mass concentration, a composite analysis of sea salt emission and its dependency on surface wind speed, and a conditionally sampled relative humidity budget. The tool is expected to be easily portable to closely related atmospheric models that use the same or similar data structures and time integration methods.

58 GEOSCIENCES↗

WaterTAP-REFLO models of Solar Still, Solar Still ZLD, Enhanced Evaporation pond results for baseline analysis

This folder contains results from models that were adapted into WaterTAP-REFLO. The files contain inputs and outputs for solar still, solar still ZLD, and enhanced evaporation pond unit process models for 4 different locations in the USA: Phoenix, Miami, Houston, and Baltimore. The WaterTAP-REFLO implementation may be different and thus may have different results. The data structure and content are described in a ReadMe.txt file. For WaterTAP-REFLO documentation and/or contact the developers please see: https://github.com/watertap-org/watertap-reflo.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Insights into AMS/PCAT transporters from biochemical and structural characterization of a double Glycine motif protease

The secretion of peptides and proteins is essential for survival and ecological adaptation of bacteria. Dual-functional ATP-binding cassette transporters export antimicrobial or quorum signaling peptides in Gram-positive bacteria. Their substrates contain a leader sequence that is excised by an N-terminal peptidase C39 domain at a double Gly motif. We characterized the protease domain (LahT150) of a transporter from a lanthipeptide biosynthetic operon in Lachnospiraceae and demonstrate that this protease can remove the leader peptide from a diverse set of peptides. The 2.0 Å resolution crystal structure of the protease domain in complex with a covalently bound leader peptide demonstrates the basis for substrate recognition across the entire class of such transporters. The structural data also provide a model for understanding the role of leader peptide recognition in the translocation cycle, and the function of degenerate, non-functional C39-like domains (CLD) in substrate recruitment in toxin exporters in Gram-negative bacteria.

Bobeica, Silvia C.↗

An efficient approach to unstructured mesh hydrodynamics on the cell broadband engine

Unstructured mesh physics for the Cell Broadband Engine (CBE) has received little or no attention to date, largely because the CBE architecture poses particular challenges for unstructured mesh algorithms. The most common SPU memory management strategies cannot be applied to the irregular memory access patterns of unstructured meshes, and the SPU vector instruction set does not support the indirect addressing needed by connectivity arrays. This paper presents an approach to unstructured mesh physics that addresses these challenges, by creating a new mesh data structure and reorganizing code to give efficient CBE performance. The approach is demonstrated on the FLAG production hydrodynamics code using standard test problems, and results show an average speedup of more than 5x over the original code.

99 GENERAL AND MISCELLANEOUS↗

The Structure of the L-myo-inositol-1-phosphate Synthase-NAD[superscript +]-2-deoxy-D-glucitol 6-(E)-Vinylhomophosphonate Complex Demands a Revision of the Enzyme Mechanism

1l-myo-inositol 1-phosphate (MIP) synthase catalyzes the conversion of D-glucose 6-phosphate to 1l-myo-inositol 1-phosphate, the first and rate-limiting step in the biosynthesis of all inositol-containing compounds. It involves an oxidation, enolization, intramolecular aldol cyclization, and reduction. Here we present the structure of MIP synthase in complex with NAD{sup +} and a high-affinity inhibitor, 2-deoxy-D-glucitol 6-(E)-vinylhomophosphonate. This structure reveals interactions between the enzyme active site residues and the inhibitor that are significantly different from that proposed for 2-deoxy-D-glucitol 6-phosphate in the previously published structure of MIP synthase-NAD{sup +}-2-deoxy-D-glucitol 6-phosphate. There are several other conformational changes in NAD{sup +} and the enzyme active site as well. Based on the new structural data, we propose a new and completely different mechanism for MIP synthase.

59 BASIC BIOLOGICAL SCIENCES↗

Why does TNA cross-pair more strongly with RNA than with DNA? An answer from X-ray analysis

L-{alpha}-threofuranosyl (3' {yields} 2') nucleic acid (TNA) residues adopt a C4'-exo pucker when incorporated into an A- (left) or a B-form DNA duplex (right). The resulting intranucleotide P {hor_ellipsis} P distance in TNA is very similar to that in RNA (represented by a C3'-endo puckered adenosine residue; green). The structural data explain earlier observations that TNA hydridizes more stably with RNA than with DNA and that RNA constitutes the better template for ligating TNA fragments.

59 BASIC BIOLOGICAL SCIENCES↗

A Redundant Communication Approach to Scalable Fault Tolerance in PGAS Programming Models

Recent trends in high-performance computing point towards increasingly large machines with millions of processing, storage, and networking elements. Unfortunately, the reliability of these machines is inversely proportional to their size, resulting in a system-wide mean-time-between-failures (MTBF) ranging from a few days to a few hours. As such, for long-running applications, the ability to efficiently recover from frequent failures is essential. Traditional forms of fault tolerance, such as checkpoint/restart, suffer from performance issues related to limited I/O and memory bandwidth. In this paper, we present a fault-tolerance mechanism that reduces the cost of failure recovery by maintaining shadow data structures and performing redundant remote memory accesses. We present results from a computational chemistry application running at scale to show that our techniques provide applications with a high degree of fault tolerance and low (2%--4%) overhead for 2048 processors.

99 GENERAL AND MISCELLANEOUS↗

Continuation and bifurcation analysis of large-scale dynamical systems with LOCA.

Dynamical systems theory provides a powerful framework for understanding the behavior of complex evolving systems. However applying these ideas to large-scale dynamical systems such as discretizations of multi-dimensional PDEs is challenging. Such systems can easily give rise to problems with billions of dynamical variables, requiring specialized numerical algorithms implemented on high performance computing architectures with thousands of processors. This talk will describe LOCA, the Library of Continuation Algorithms, a suite of scalable continuation and bifurcation tools optimized for these types of systems that is part of the Trilinos software collection. In particular, we will describe continuation and bifurcation analysis techniques designed for large-scale dynamical systems that are based on specialized parallel linear algebra methods for solving augmented linear systems. We will also discuss several other Trilinos tools providing nonlinear solvers (NOX), eigensolvers (Anasazi), iterative linear solvers (AztecOO and Belos), preconditioners (Ifpack, ML, Amesos) and parallel linear algebra data structures (Epetra and Tpetra) that LOCA can leverage for efficient and scalable analysis of large-scale dynamical systems.

99 GENERAL AND MISCELLANEOUS↗

Scalable in-memory RDFS closure on billions of triples.

We present an RDFS closure algorithm, specifically designed and implemented on the Cray XMT supercomputer, that obtains inference rates of 13 million inferences per second on the largest system configuration we used. The Cray XMT, with its large global memory (4TB for our experiments), permits the construction of a conceptually straightforward algorithm, fundamentally a series of operations on a shared hash table. Each thread is given a partition of triple data to process, a dedicated copy of the ontology to apply to the data, and a reference to the hash table into which it inserts inferred triples. The global nature of the hash table allows the algorithm to avoid a common obstacle for distributed memory machines: the creation of duplicate triples. On LUBM data sets ranging between 1.3 billion and 5.3 billion triples, we obtain nearly linear speedup except for two portions: file I/O, which can be ameliorated with the additional service nodes, and data structure initialization, which requires nearly constant time for runs involving 32 processors or more.

99 GENERAL AND MISCELLANEOUS↗

Multiple multiresolution representation of functions and calculus for fast computation

We describe the mathematical representations, data structure and the implementation of the numerical calculus of functions in the software environment multiresolution analysis environment for scientific simulations, MADNESS. In MADNESS, each smooth function is represented using an adaptive pseudo-spectral expansion using the multiwavelet basis to a arbitrary but finite precision. This is an extension of the capabilities of most of the existing net, mesh and spectral based methods where the discretization is based on a single adaptive mesh, or expansions.

99 GENERAL AND MISCELLANEOUS↗

PFLOTRAN: Reactive Flow & Transport Code for Use on Laptops to Leadership-Class Supercomputers

PFLOTRAN, a next-generation reactive flow and transport code for modeling subsurface processes, has been designed from the ground up to run efficiently on machines ranging from leadership-class supercomputers to laptops. Based on an object-oriented design, the code is easily extensible to incorporate additional processes. It can interface seamlessly with Fortran 9X, C and C++ codes. Domain decomposition parallelism is employed, with the PETSc parallel framework used to manage parallel solvers, data structures and communication. Features of the code include a modular input file, implementation of high-performance I/O using parallel HDF5, ability to perform multiple realization simulations with multiple processors per realization in a seamless manner, and multiple modes for multiphase flow and multicomponent geochemical transport. Chemical reactions currently implemented in the code include homogeneous aqueous complexing reactions and heterogeneous mineral precipitation/dissolution, ion exchange, surface complexation and a multirate kinetic sorption model. PFLOTRAN has demonstrated petascale performance using 2{sup 17} processor cores with over 2 billion degrees of freedom. Accomplishments achieved to date include applications to the Hanford 300 Area and modeling CO{sub 2} sequestration in deep geologic formations.

58 GEOSCIENCES↗

An efficient approach to unstructured mesh hydrodynamics on the cell broadband engine (u)

Unstructured mesh physics for the Cell Broadband Engine (CBE) has received little or no attention to date, largely because the CBE architecture poses particular challenges for unstructured mesh algorithms. SPU memory management strategies such as data preloading cannot be applied to the irregular memory storage patterns of unstructured meshes; and the SPU vector instruction set does not support the indirect addressing needed by connectivity arrays. This paper presents an approach to unstructured mesh physics that addresses these challenges, by creating a new mesh data structure and reorganizing code to give efficient CBE performance. The approach is demonstrated on the FLAG production hydrodynamics code using standard test problems, and results show an average speedup of more than 5x over the original code.

99 GENERAL AND MISCELLANEOUS↗

A general higher-order remap algorithm for ALE calculations

A numerical technique for solving the equations of fluid dynamics with arbitrary mesh motion is presented. The three phases of the Arbitrary Lagrangian Eulerian (ALE) methodology are outlined: the Lagrangian phase, grid relaxation phase and remap phase. The Lagrangian phase follows a well known approach from the HEMP code; in addition the strain rate andflow divergence are calculated in a consistent manner according to Margolin. A donor cell method from the SALE code forms the basis of the remap step, but unlike SALE a higher order correction based on monotone gradients is also added to the remap. Four test problems were explored to evaluate the fidelity of these numerical techniques, as implemented in a simple test code, written in the C programming language, called Cercion. Novel cell-centered data structures are used in Cercion to reduce the complexity of the programming and maximize the efficiency of memory usage. The locations of the shock and contact discontinuity in the Riemann shock tube problem are well captured. Cercion demonstrates a high degree of symmetry when calculating the Sedov blast wave solution, with a peak density at the shock front that is similar to the value determined by the RAGE code. For a flyer plate test problem both Cercion and FLAG give virtually the same velocity temporal profile at the target-vacuum interface. When calculating a cylindrical implosion of a steel shell, Cercion and FLAG agree well and the Cercion results are insensitive to the use of ALE.

36 MATERIALS SCIENCE↗

Sisal

Sisal (Streams and Iterations in a Single Assignment Language) was a general-purpose applicative language developed for shared-memory and vector supercomputer systems. It provided an hierarchical intermediate form, parallel runtime system, optimizing compiler, and programming environment. The language was strongly typed. It supported both array and stream data structures, and had both iterative and parallel loop constructs.

Feo, John T↗

Self-assembled software and method of overriding software execution

A computer-implemented software self-assembled system and method for providing an external override and monitoring capability to dynamically self-assembling software containing machines that self-assemble execution sequences and data structures. The method provides an external override machine that can be introduced into a system of self-assembling machines while the machines are executing such that the functionality of the executing software can be changed or paused without stopping the code execution and modifying the existing code. Additionally, a monitoring machine can be introduced without stopping code execution that can monitor specified code execution functions by designated machines and communicate the status to an output device.

97 MATHEMATICS AND COMPUTING↗

Understanding Cellulose Through Molecular Simulation and Electron Tomography

High-resolution cellulose crystal structures have been determined from diffraction experiments using large diameter microfibrils as the sample material. However, cellulose microfibrils in plants are much smaller in diameter, and are more difficult to directly examine experimentally. Molecular dynamics simulation combined with quantum chemical calculations can help to elucidate the structure and dynamics of small diameter cellulose microfibrils. These simulation techniques also aid in the interpretation of electron tomography volumetric structural data from maize cell walls, where pretreatment with dilute acid or ammonia reveals microfibril geometry.

36 MATERIALS SCIENCE↗

T.Rex Visual Analytics for Transactional Exploration

T.Rex is PNNL's visual analytics tool that specializes in tabular structured data, like you might open with Excel. It's a client-server application, allowing the server to do a lot of the heavy lifting and the client to open spreadsheets with millions of rows. With datasets of that size, especially if you're unfamiliar with the contents, it's very hard to get a good grasp of what's in it using traditional tools. With T.Rex, the multiple views allow you to see categorical, temporal, numerical, relational, and summary data. The interactivity lets you look across your data and see how things relate to each other.

97 MATHEMATICS AND COMPUTING↗

Distributed Merge Trees

Improved simulations and sensors are producing datasets whose increasing complexity exhausts our ability to visualize and comprehend them directly. To cope with this problem, we can detect and extract significant features in the data and use them as the basis for subsequent analysis. Topological methods are valuable in this context because they provide robust and general feature definitions. As the growth of serial computational power has stalled, data analysis is becoming increasingly dependent on massively parallel machines. To satisfy the computational demand created by complex datasets, algorithms need to effectively utilize these computer architectures. The main strength of topological methods, their emphasis on global information, turns into an obstacle during parallelization. We present two approaches to alleviate this problem. We develop a distributed representation of the merge tree that avoids computing the global tree on a single processor and lets us parallelize subsequent queries. To account for the increasing number of cores per processor, we develop a new data structure that lets us take advantage of multiple shared-memory cores to parallelize the work on a single node. Finally, we present experiments that illustrate the strengths of our approach as well as help identify future challenges.

97 MATHEMATICS AND COMPUTING↗