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 613 records · Page 34

The Dynamic Conformational Cycle of the Group I Chaperonin C-Termini Revealed via Molecular Dynamics Simulation

Chaperonins are large ring shaped oligomers that facilitate protein folding by encapsulation within a central cavity. All chaperonins possess flexible C-termini which protrude from the equatorial domain of each subunit into the central cavity. Biochemical evidence suggests that the termini play an important role in the allosteric regulation of the ATPase cycle, in substrate folding and in complex assembly and stability. Despite the tremendous wealth of structural data available for numerous orthologous chaperonins, little structural information is available regarding the residues within the C-terminus. Herein, molecular dynamics simulations are presented which localize the termini throughout the nucleotide cycle of the group I chaperonin, GroE, from Escherichia coli. The simulation results predict that the termini undergo a heretofore unappreciated conformational cycle which is coupled to the nucleotide state of the enzyme. As such, these results have profound implications for the mechanism by which GroE utilizes nucleotide and folds client proteins.

59 BASIC BIOLOGICAL SCIENCES↗

The OME Framework for genome-scale systems biology

The life sciences are undergoing continuous and accelerating integration with computational and engineering sciences. The biology that many in the field have been trained on may be hardly recognizable in ten to twenty years. One of the major drivers for this transformation is the blistering pace of advancements in DNA sequencing and synthesis. These advances have resulted in unprecedented amounts of new data, information, and knowledge. Many software tools have been developed to deal with aspects of this transformation and each is sorely needed. However, few of these tools have been forced to deal with the full complexity of genome-scale models along with high throughput genome-scale data. This particular situation represents a unique challenge, as it is simultaneously necessary to deal with the vast breadth of genome-scale models and the dizzying depth of high-throughput datasets. It has been observed time and again that as the pace of data generation continues to accelerate, the pace of analysis significantly lags behind. It is also evident that, given the plethora of databases and software efforts, it is still a significant challenge to work with genome-scale metabolic models, let alone next-generation whole cell models. We work at the forefront of model creation and systems scale data generation. The OME Framework was borne out of a practical need to enable genome-scale modeling and data analysis under a unified framework to drive the next generation of genome-scale biological models. Here we present the OME Framework. It exists as a set of Python classes. However, we want to emphasize the importance of the underlying design as an addition to the discussions on specifications of a digital cell. A great deal of work and valuable progress has been made by a number of communities towards interchange formats and implementations designed to achieve similar goals. While many software tools exist for handling genome-scale metabolic models or for genome-scale data analysis, no implementations exist that explicitly handle data and models concurrently. The OME Framework structures data in a connected loop with models and the components those models are composed of. This results in the first full, practical implementation of a framework that can enable genome-scale design-build-test. Over the coming years many more software packages will be developed and tools will necessarily change. However, we hope that the underlying designs shared here can help to inform the design of future software.

59 BASIC BIOLOGICAL SCIENCES↗

Myna

The additive manufacturing (AM) community has been developing digital factory tools over the past decade to better leverage the multi-modal process data coming out of the advanced manufacturing process. As a result, numerous databases of additive manufacturing process data exist in the literature and in the archival storage of disparate research groups. While some efforts have been made to create a standard ontology for storing and sharing AM data, in practice a variety of data structures are used to store AM build data, even within a single institution. This causes many problems for maintainability and extensibility when attempting to integrate computational modeling tools with experimental data to either validate models or to provide further insight into results and trends. Myna is a Python-based framework that aims to decrease the effort needed to connect individual computational models to the variety of AM process data that exist in different research groups and institutions. This type of software is sometimes referred to as "middleware" or “glueware,” in that it connects disparate databases and applications into a single computational ecosystem. Instead of maintaining unique interfaces between each application and each database, developers can create a single interface from each application to Myna and thereby gain access to the implemented database connections. Similarly, developing a database connection in Myna provides access to the developed simulation applications. This framework greatly simplifies the maintainability of model applications that rely on experimental data. Using external simulation tools, users will also be able to run pre-configured workflows using the built-in workflow manager. Several examples of input files are provided with Myna for different workflows, including melt pool geometry predictions and detailed melt pool and solidification microstructure predictions.

Knapp, GerryL. [Oak Ridge National Laboratory (ORN↗

The application of remote sensing techniques to inter and intra urban analysis

This is an effort to assess the applicability of air and spaceborne photography toward providing data inputs to urban and regional planning, management, and research. Through evaluation of remote sensing inputs to urban change detection systems, analyzing an effort to replicate an existing urban land use data file using remotely sensed data, estimating population and dwelling units from imagery, and by identifying and evaluating a system of urban places ultilizing space photography, it was determined that remote sensing can provide data concerning land use, changes in commercial structure, data for transportation planning, housing quality, residential dynamics, and population density.

Horton, F. E.↗

DecisionMaker software and extracting fuzzy rules under uncertainty

Knowledge acquisition under uncertainty is examined. Theories proposed in deKorvin's paper 'Extracting Fuzzy Rules Under Uncertainty and Measuring Definability Using Rough Sets' are discussed as they relate to rule calculation algorithms. A data structure for holding an arbitrary number of data fields is described. Limitations of Pascal for loops in the generation of combinations are also discussed. Finally, recursive algorithms for generating all possible combination of attributes and for calculating the intersection of an arbitrary number of fuzzy sets are presented.

Walker, Kevin B.↗

Complexities in Subsetting Level 2 Data

Satellite Level 2 data presents unique challenges for tools and services. From nonlinear spatial geometry to inhomogeneous file data structure to inconsistent temporal variables to complex data variable dimensionality to multiple file formats, there are many difficulties in creating general tools for Level 2 data support. At NASA Goddard Earth Sciences Data and Information Services Center (GES DISC), we are implementing a general Level 2 Subsetting service for Level 2 data to a user-specified spatio-temporal region of interest (ROI). In this presentation, we will unravel some of the challenges faced in creating this service and the strategies we used to surmount them.

Data acces↗

On dark energy isocurvature perturbation

Determining the equation of state of dark energy with astronomical observations is crucially important to understand the nature of dark energy. In performing a likelihood analysis of the data, especially of the cosmic microwave background and large scale structure data the dark energy perturbations have to be taken into account both for theoretical consistency and for numerical accuracy. Usually, one assumes in the global fitting analysis that the dark energy perturbations are adiabatic. In this paper, we study the dark energy isocurvature perturbation analytically and discuss its implications for the cosmic microwave background radiation and large scale structure. Furthermore, with the current astronomical observational data and by employing Markov Chain Monte Carlo method, we perform a global analysis of cosmological parameters assuming general initial conditions for the dark energy perturbations. The results show that the dark energy isocurvature perturbations are very weakly constrained and that purely adiabatic initial conditions are consistent with the data.

79 ASTRONOMY AND ASTROPHYSICS↗

Community Petascale Project for Accelerator Science and Simulation

The UCLA Plasma Simulation Group is a major partner of the "Community Petascale Project for Accelerator Science and Simulation. This is the final technical report. We include an overall summary, a list of publications and individual progress reports for each years. During the past five years we have made tremendous progress in enhancing the capabilities of OSIRIS and QuickPIC, in developing new algorithms and data structures for PIC codes to run on GPUS and many future core architectures, and in using these codes to model experiments and in making new scientific discoveries. Here we summarize some highlights for which SciDAC was a major contributor.

97 MATHEMATICS AND COMPUTING↗

Interfacing with Legacy using Remote Method Invocation

The assignment described was enough to make a neophyte Java developer bolt for the door: provide a remote method for use by an applet which invokes a native method that wraps a function in an existing legacy library. The purpose of the remote method is to return an instance of a class object whose contents reflect the data structure returned by the legacy function. While embroiled in implementation, I would have spent the time wading through their JNI use group archive as well, but I couldn't seem to locate one. Subsequently, I made the decision to try to document my findings in order to assist others. Before we start on the class design, let's look at what the existing legacy code does. The C function to be called, Get-Legacy-Data, consists of two steps: an ASII file is read from the local disk and its contents are parsed into a Legacy_Type structure whose address is passed as an argument by the caller. The legacy code was compiled into a shared object library, legacy. so, using the IRIX 6.2 compiler and then loaded onto the Web server, a Silicon Graphics Indy station loaded with the IRIX 6.4 operating system. As far as the class design is concerned, the first thing required is a class to act as a template for the data structure returned by the legacy function. This class, JLegacy, declares a series of public instance variables which correspond to the members of Legacy_Type and provides a parameterless constructor. This constructor is never called, not even by the native method which allocates the object for return to the remote method. Next, the remote interface declaration for the remote object must be defined. In order for JLegacyRO to implement getJLegacy, JLegacyRO must interface with the existing legacy code through a native method, getn. getn is declared in the JLegacyRO class but implemented in C, just like the legacy code. getn returns a JLegacy instance and is declared static since its implementation is the same for all instances of the JLegacyRO class.

Howard, Scott M.↗

A lock-free priority queue design based on multi-dimensional linked lists

The throughput of concurrent priority queues is pivotal to multiprocessor applications such as discrete event simulation, best-first search and task scheduling. Existing lock-free priority queues are mostly based on skiplists, which probabilistically create shortcuts in an ordered list for fast insertion of elements. The use of skiplists eliminates the need of global rebalancing in balanced search trees and ensures logarithmic sequential search time on average, but the worst-case performance is linear with respect to the input size. In this paper, we propose a quiescently consistent lock-free priority queue based on a multi-dimensional list that guarantees worst-case search time of O(logN) for key universe of size N. The novel multi-dimensional list (MDList) is composed of nodes that contain multiple links to child nodes arranged by their dimensionality. The insertion operation works by first injectively mapping the scalar key to a high-dimensional vector, then uniquely locating the target position by using the vector as coordinates. Nodes in MDList are ordered by their coordinate prefixes and the ordering property of the data structure is readily maintained during insertion without rebalancing nor randomization. Furthermore, in our experimental evaluation using a micro-benchmark, our priority queue achieves an average of 50% speedup over the state of the art approaches under high concurrency.

97 MATHEMATICS AND COMPUTING↗

Structural basis for distinctive recognition of fibrinogen [gamma]C peptide by the platelet integrin [alpha][subscript IIb][beta]3

Hemostasis and thrombosis (blood clotting) involve fibrinogen binding to integrin {alpha}{sub IIb}{beta}{sub 3} on platelets, resulting in platelet aggregation. {alpha}{sub v}{beta}{sub 3} binding fibrinogen via an Arg-Asp-Gly (RGD) motif in fibrinogen's {alpha} subunit. {alpha}{sub IIb}{beta}{sub 3} also binds to fibrinogen; however, it does so via an unstructured RGD-lacking C-terminal region of the {gamma} subunit ({gamma}C peptide). These distinct modes of fibrinogen binding enable {alpha}{sub IIb}{beta}{sub 3} and {alpha}{sub v}{beta}{sub 3} to function cooperatively in hemostasis. In this study, crystal structures reveal the integrin {alpha}{sub IIb}{beta}{sub 3}-{gamma}C peptide interface, and, for comparison, integrin {alpha}{sub IIb}{beta}{sub 3} bound to a lamprey {gamma}C primordial RGD motif. Compared with RGD, the GAKQAGDV motif in {gamma}C adopts a different backbone configuration and binds over a more extended region. The integrin metal ion-dependent adhesion site (MIDAS) Mg{sup 2+} ion binds the {gamma}C Asp side chain. The adjacent to MIDAS (ADMIDAS) Ca{sup 2+} ion binds the {gamma}C C terminus, revealing a contribution for ADMIDAS in ligand binding. Structural data from this natively disordered {gamma}C peptide enhances our understanding of the involvement of {gamma}C peptide and integrin {alpha}{sub IIb}{beta}{sub 3} in hemostasis and thrombosis.

59 BASIC BIOLOGICAL SCIENCES↗

The SprayList: a scalable relaxed priority queue

High-performance concurrent priority queues are essential for applications such as task scheduling and discrete event simulation. Unfortunately, even the best performing implementations do not scale past a number of threads in the single digits. This is because of the sequential bottleneck in accessing the elements at the head of the queue in order to perform a DeleteMin operation. In this paper, we present the SprayList, a scalable priority queue with relaxed ordering semantics. Starting from a non-blocking SkipList, the main innovation behind our design is that the DeleteMin operations avoid a sequential bottleneck by ``spraying'' themselves onto the head of the SkipList list in a coordinated fashion. The spraying is implemented using a carefully designed random walk, so that DeleteMin returns an element among the first O(p log^3 p) in the list, with high probability, where p is the number of threads. We prove that the running time of a DeleteMin operation is O(log^3 p), with high probability, independent of the size of the list. Our experiments show that the relaxed semantics allow the data structure to scale for high thread counts, comparable to a classic unordered SkipList. As a result, we observe that, for reasonably parallel workloads, the scalability benefits of relaxation considerably outweigh the additional work due to out-of-order execution.

97 MATHEMATICS AND COMPUTING↗

Molecular basis of substrate selection by the N-end rule adaptor protein ClpS

The N-end rule is a conserved degradation pathway that relates the stability of a protein to its N-terminal amino acid. Here, we present crystal structures of ClpS, the bacterial N-end rule adaptor, alone and engaged with peptides containing N-terminal phenylalanine, leucine, and tryptophan. These structures, together with a previous structure of ClpS bound to an N-terminal tyrosine, illustrate the molecular basis of recognition of the complete set of primary N-end rule amino acids. In each case, the alpha-amino group and side chain of the N-terminal residue are the major determinants of recognition. The binding pocket for the N-end residue is preformed in the free adaptor, and only small adjustments are needed to accommodate N-end rule residues having substantially different sizes and shapes. M53A ClpS is known to mediate degradation of an expanded repertoire of substrates, including those with N-terminal valine or isoleucine. A structure of Met53A ClpS engaged with an N-end rule tryptophan reveals an essentially wild-type mechanism of recognition, indicating that the Met(53) side chain directly enforces specificity by clashing with and excluding beta-branched side chains. Finally, experimental and structural data suggest mechanisms that make proteins with N-terminal methionine bind very poorly to ClpS, explaining why these high-abundance proteins are not degraded via the N-end rule pathway in the cell.

36 MATERIALS SCIENCE↗

Nanoclusters based on pentagondodecahedra with shells in the form of D32, D42, and D50 deltahedra in crystal structures of intermetallic compounds

The TOPOS software package has been used to form a database of intermetallic compounds containing pentagondodecahedral d clusters (528 crystal structures of intermetallic compounds, 111 topological types, and 47 space symmetry groups). On the whole, 606 atomic d configurations have been selected which are described by 14 point symmetry groups. Examples of nanoclusters are presented which are precursors of the crystal structures of intermetallic compounds with the outer shell in the form of deltahedra D, which are formed above dodecahedra. These nanoclusters are identified in the automatic mode of structural data processing: D32 (K{sub 8}In{sub 6}Ge{sub 40}, Cs{sub 30}Na{sub 3}Sn{sub 162}), D{sub 42} (Ru{sub 3}Be{sub 17}, Y{sub 3}Cd{sub 18}, Ca{sub 3}(Cd{sub 17}Al)), and D{sub 50} (Yb{sub 3}Zn{sub 18}, Ce{sub 3}(Au{sub 14}Sn{sub 3}), Pr{sub 3}Cd{sub 18}, Eu{sub 4}Cd{sub 25}), where 32, 42, and 50 are the numbers of atoms in the shell. Similar deltahedra were found previously in icosahedral nanoclusters (precursors of intermetallic compounds). Structures with the dodecahedral nanocluster precursors containing D42 and D50 deltahedra are approximants of MCd{sub 5.7} (M = Yb or Ca) quasicrystals and belong to the family of MCd{sub 6} (M = Ce, Pr, Nd, Sm, Eu, Gd, Dy, Yb, Y, or Ca).

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

rcsb-api : Python Toolkit for Streamlining Access to RCSB Protein Data Bank APIs

The Protein Data Bank (PDB) was founded in 1971 as the first open-access digital data resource in biology to serve as the single global archive for three-dimensional (3D) macromolecular structure data. Current PDB holdings exceed 230,000 experimentally determined structures of proteins, nucleic acids, viruses, and macromolecular machines. The RCSB Protein Data Bank RCSB.org research-focused web portal facilitates search, analyses, and visualization of every PDB structure along with more than one million Computed Structure Models from AlphaFold DB and the ModelArchive. It is powered by a set of publicly available Application Programming Interfaces (APIs) that both support RCSB.org users and provide programmatic access to PDB data. Given the breadth and levels of granularity encompassed in this rich data collection, efficiently accessing the information programmatically may be challenging for new users. RCSB PDB has developed a Python software package, rcsb-api , that facilitates easy and efficient use of RCSB PDB APIs within a Python environment. This software tool is designed to streamline access to the extensive corpus of data housed within the PDB, enabling researchers to search, retrieve, and analyze 3D biostructure data seamlessly. Its use will accelerate research in structural biology, molecular biology and biochemistry, drug discovery, and bioinformatics by providing more efficient tools for data integration and analysis. The new toolkit is available on GitHub (github.com/rcsb/py-rcsb-api) and published to the public Python package repository (PyPI) to foster wider usage and support basic and applied research in fundamental biology, biomedicine, and the energy sciences.

FAIR principles↗

MOSIQS: Persistent Memory Object Storage With Metadata Indexing and Querying for Scientific Computing

Scientific applications often require high-bandwidth shared storage to perform joint simulations and collaborative data analytics. Shared memory pools provide a chance to satisfy such needs. Recently, a high-speed network such as Gen-Z utilizing persistent memory (PM) offers an opportunity to create a shared memory pool connected to compute nodes. However, there are several challenges to use scientific applications on the shared memory pool directly such as scalability, failure-atomicity, and lack of scientific metadata-based search and query. In this paper, we propose MOSIQS, a persistent memory object storage framework with metadata indexing and querying for scientific computing. We design MOSIQS based on the key idea that memory objects on PM pool can live beyond the application lifetime and can become the sharing currency for applications and scientists. MOSIQS provides an aggregate memory pool atop an array of persistent memory devices to store and access memory objects to accelerate scientific computing. MOSIQS uses a lightweight persistent memory key-value store to manage the metadata of memory objects, which enables memory object sharing. To facilitate metadata search and query over millions of memory objects resident on memory pool, we introduce Group Split and Merge (GSM), a novel persistent index data structure designed primarily for scientific datasets. GSM splits and merges dynamically to minimize the query search space and maintains low query processing time while overcoming the index storage overhead. MOSIQS is implemented on top of PMDK. We evaluate the proposed approach on many-core server with an array of real PM devices. Experimental results show that MOSIQS gains a 100% write performance improvement and executes multi-attribute queries efficiently with 2.7× less index storage overhead offering significant potential to speed up scientific computing applications.

97 MATHEMATICS AND COMPUTING↗

Automatic Data Distribution for CFD Applications on Structured Grids

Data distribution is an important step in implementation of any parallel algorithm. The data distribution determines data traffic, utilization of the interconnection network and affects the overall code efficiency. In recent years a number data distribution methods have been developed and used in real programs for improving data traffic. We use some of the methods for translating data dependence and affinity relations into data distribution directives. We describe an automatic data alignment and placement tool (ADAPT) which implements these methods and show it results for some CFD codes (NPB and ARC3D). Algorithms for program analysis and derivation of data distribution implemented in ADAPT are efficient three pass algorithms. Most algorithms have linear complexity with the exception of some graph algorithms having complexity O(n(sup 4)) in the worst case.

Frumkin, Michael↗