Search NASA⌕ Search

SEARCH · Search NASA

Results for “Data structures”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

BCL: A Cross-Platform Distributed Data Structures Library

One-sided communication is a useful paradigm for irregular parallel applications, but most one-sided programming environments, including MPI's one-sided interface and PGAS programming languages, lack application-level libraries to support these applications. We present the Berkeley Container Library, a set of generic, cross-platform, high-performance data structures for irregular applications, including queues, hash tables, Bloom filters and more. BCL is written in C++ using an internal DSL called the BCL Core that provides one-sided communication primitives such as remote get and remote put operations. The BCL Core has backends for MPI, OpenSHMEM, GASNet-EX, and UPC++, allowing BCL data structures to be used natively in programs written using any of these programming environments. Along with our internal DSL, we present the BCL ObjectContainer abstraction, which allows BCL data structures to transparently serialize complex data types while maintaining efficiency for primitive types. We also introduce the set of BCL data structures and evaluate their performance across a number of high-performance computing systems, demonstrating that BCL programs are competitive with hand-optimized code, even while hiding many of the underlying details of message aggregation, serialization, and synchronization.

Brock, Benjamin↗
DOE OSTI2021

NWGraph: A Library of Generic Graph Algorithms and Data Structures in C++20

The C++ Standard Library is a valuable collection of generic algorithms and data structures that improves the usability and reliability of C++ software. Graph algorithms and data structures are notably absent from the standard library, and previous attempts to fill this gap have not gained widespread adoption. With the new addition of ranges and concepts in C++20, the language has the mechanisms to cleanly support generic graph algorithms as operations on a range of ranges. This report presents NWGraph, a generic C++ graph library for expressing graph algorithms in a modern, composable, and extensible, aka generic, fashion.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

iEEG-BIDS, extending the Brain Imaging Data Structure specification to human intracranial electrophysiology

he Brain Imaging Data Structure (BIDS) is a community-driven specification for organizing neuroscience data and metadata with the aim to make datasets more transparent, reusable, and reproducible. Intracranial electroencephalography (iEEG) data offer a unique combination of high spatial and temporal resolution measurements of the living human brain. To improve internal (re)use and external sharing of these unique data, we present a specification for storing and sharing iEEG data: iEEG-BIDS.

Science & Technology - Other Topics↗
DOE OSTI2018

Algorithms and data structures to accelerate network analysis

As the sheer amount of computer generated data continues to grow exponentially, new bottlenecks are unveiled that require rethinking our traditional software and hardware architectures. Here in this paper we present five algorithms and data structures (long queue emulation, lockless bimodal queues, tail early dropping, LFN tables, and multiresolution priority queues) designed to optimize the process of analyzing network traffic. We integrated these optimizations on R-Scope, a high performance network appliance that runs the Bro network analyzer, and present benchmarks showcasing performance speed ups of 5X at traffic rates of 10 Gbps.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Efficient accesses of data structures using processing near memory

Systems, apparatuses, and methods for implementing efficient queues and other data structures. A queue may be shared among multiple processors and/or threads without using explicit software atomic instructions to coordinate access to the queue. System software may allocate an atomic queue and corresponding queue metadata in system memory and return, to the requesting thread, a handle referencing the queue metadata. Any number of threads may utilize the handle for accessing the atomic queue. The logic for ensuring the atomicity of accesses to the atomic queue may reside in a management unit in the memory controller coupled to the memory where the atomic queue is allocated.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Evaluated Nuclear Structure Data File (ENSDF)

Contains recommended nuclear structure and decay data for all the known nuclides, which are obtained following a critical review of all available experimental data, supplemented with systematic trend studies and theoretical models. ENSDF data include (i) nuclear level properties, such as observation source, energy, half-life, decay modes, spin and parity; (ii) gamma ray energies, intensities, multipolarities, mixing ratios and conversion coefficients; (iii) nuclear radiation energy and intensity as well as radiation-specific data for different radiation types, such as such as gammas, alphas, betas and neutrons. Data for about 220 nuclides are fully evaluated each year; additionally, many datasets are partially updated each year. Nearly all the evaluation work is supported by the US Nuclear Data Program. The National Nuclear Data Center at Brookhaven National Laboratory is responsible for coordinating the evaluation effort as well as its web and journal dissemination.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2016

Detailed requirements for a next generation nuclear data structure.

This document attempts to compile the requirements for the top-levels of a hierarchical arrangement of nuclear data such as found in the ENDF format. This set of requirements will be used to guide the development of a new data structure to replace the legacy ENDF format.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2018

On the relationship between the structural and volumetric properties of solvated metal ions in O -donor solvents using new structural data in amide solvents

The structures of the N , N -dimethylformamide (dmf), N , N -dimethylacetamide (dma), and N , N -dimethylpropionamide (dmp) solvated strontium and barium ions have been determined in solution using large angle X-ray scattering and EXAFS spectroscopy. The strontium ion has a mean coordination number (CN) between 6.2 and 6.8, and the barium ion has a mean CN between 7.1 and 7.8 in these amide solvents. The non-integer numbers indicates that equilibria between different coordination numbers and geometries exist in these systems. Structural information of the alkali, alkaline earth, and selected transition metal and lanthanoid( III ) ions, and the halide ions in water, methanol, ethanol, dimethylsulfoxide, formamide, dmf and dma has been combined with previously reported standard partial molar volumes, V 0 . The ionic radii and charge densities (charge/ionic volume), and corresponding V 0 values have been used to gain information on the relationship between structural and volumetric properties. For the structure-breaking ions, i.e. the alkali metal and halide ions, there is an almost linear relationship between the ionic radius and V 0 . On the other hand, for the structure-making ions, here the alkaline earth, transition metal and lanthanoid( III ) ions, a linear relationship is observed between the charge density and V 0 . Solvents with a well-defined bulk structure through hydrogen bonding, specifically, water, methanol and ethanol, will be more contracted through solvation than aprotic solvents, as the space between the solvent molecules is lost as a result of the hydrogen bonding. In this respect, methanol stands out as the most compressed solvent participating in solvation compared to its bulk structure.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

The growth of density perturbations in the last ~10 billion years from tomographic large-scale structure data

In order to investigate the origin of the ongoing tension between the amplitude of matter fluctuations measured by weak lensing experiments at low redshifts and the value inferred from the cosmic microwave background anisotropies, we reconstruct the evolution of this amplitude from z ~ 2 using existing large-scale structure data. To do so, we decouple the linear growth of density inhomogeneities from the background expansion, and constrain its redshift dependence making use of a combination of 6 different data sets, including cosmic shear, galaxy clustering and CMB lensing. We analyze these data under a consistent harmonic-space angular power spectrum-based pipeline. We show that current data constrain the amplitude of fluctuations mostly in the range 0.2 < z < 0.7, where it is lower than predicted by . This difference is mostly driven by current cosmic shear data, although the growth histories reconstructed from different data combinations are consistent with each other, and we find no evidence of systematic deviations in any particular experiment. In spite of the tension with , the data are well-described by the model, albeit with a lower value of S 8 ≡ σ 8 (Ω m /0.3) 0.5 . As part of our analysis, we find constraints on this parameter of S 8 = 0.7781 ± 0.0094 (68% confidence level), reaching almost percent-level errors comparable with CMB measurements, and 3.4σ away from the value found by .

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Enriched immersed finite element and isogeometric analysis: algorithms and data structures

Immersed finite element methods provide a convenient analysis framework for problems involving geometrically complex domains, such as those found in topology optimization and microstructures for engineered materials. However, their implementation remains a major challenge due to, among other things, the need to apply nontrivial stabilization schemes and generate custom quadrature rules. This article introduces the robust and computationally efficient algorithms and data structures comprising an immersed finite element preprocessing framework. The input to the preprocessor consists of a background mesh and one or more geometries defined on its domain. The output is structured into groups of elements with custom quadrature rules formatted such that common finite element assembly routines may be used without or with only minimal modifications. The key to the preprocessing framework is the construction of material topology information, concurrently with the generation of a quadrature rule, which is then used to perform enrichment and generate stabilization rules. While the algorithmic framework applies to a wide range of immersed finite element methods using different types of meshes, integration, and stabilization schemes, the preprocessor is presented within the context of the extended isogeometric analysis. This method utilizes a structured B-spline mesh, a generalized Heaviside enrichment strategy considering the material layout within individual basis functions’ supports, and face-oriented ghost stabilization. Using a set of examples, the effectiveness of the enrichment and stabilization strategies is demonstrated alongside the preprocessor’s robustness in geometric edge cases. Additionally, the performance and parallel scalability of the implementation are evaluated.

Computer implementation↗
DOE OSTI2016

On the elimination of the electronic structure bottleneck in on the fly nonadiabatic dynamics for small to moderate sized (10-15 atom) molecules using fit diabatic representations based solely on ab initio electronic structure data: The photodissociation of phenol

In this work, we demonstrate that for moderate sized systems, here a system with 13 atoms, global coupled potential energy surfaces defined for several electronic states over a wide energy range and for distinct regions of nuclear coordinate space characterized by distinct electron configurations, can be constructed with precise energetics and an excellent description of non-adiabatic interactions in all regions. This is accomplished using a recently reported algorithm for constructing quasi-diabatic representations, H{sup d}, of adiabatic electronic states coupled by conical intersections. In this work, the algorithm is used to construct an H{sup d} to describe the photodissociation of phenol from its first and second excited electronic states. The representation treats all 33 internal degrees of freedom in an even handed manner. The ab initio adiabatic electronic structure data used to construct the fit are obtained exclusively from multireference configuration interaction with single and double excitation wave functions comprised of 88 × 10{sup 6} configuration state functions, at geometries determined by quasi-classical trajectories. Since the algorithm uses energy gradients and derivative couplings in addition to electronic energies to construct H{sup d}, data at only 7379 nuclear configurations are required to construct a representation, which describes all nuclear configurations involved in H atom photodissociation to produce the phenoxyl radical in its ground or first excited electronic state, with a mean unsigned energy error of 202.9 cm{sup −1} for electronic energies <60 000 cm{sup −1}.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

cuTS: Scaling Subgraph Isomorphism on Distributed Multi-GPUSystems Using Trie Based Data Structure

Subgraph isomorphism is a pattern-matching algorithm widely used in many domains such as chem-informatics, bioinformatics, databases, and social network analysis. It is computationally expensive and is a proven NP-hard problem. The massive parallelism offered by the GPU hardware is well suited for solving the subgraph isomorphism. However, current GPU implementations are far from the achievable performance. Moreover, the enormous memory requirement of current approaches limits the problem size that can be handled. This work analyzes the fundamental challenges associated with processing the subgraph isomorphism on GPUs and develops an efficient GPU hardware-aware implementation. We also develop a new GPU-friendly trie-based data structure to drastically reduce the intermediate storage space requirement. Hence, our approach runs larger benchmarks than the competitors. We also develop the first distributed sub-graph isomorphism algorithm for GPUs. Our experimental evaluation section demonstrates the efficacy of our approach by comparing the execution time and number of cases that we can handle against the state-of-the-art GPU implementations.

Xiang, Lizhi↗
DOE OSTI2019

PDB Structure Data Impacted Discovery and Development of Recently FDA‐Approved Drugs

Protein Data Bank (PDB) was established in 1971 as the 1 st open access digital data resource in biology and medicine. Today, the PDB currently houses >145,000 atomic level biomolecular structures determined by crystallography, NMR spectroscopy, and 3D electron microscopy. Managed by the Worldwide Protein Data Bank partnership (wwPDB; wwpdb.org ), PDB data are used by researchers and educators to understand the role molecules play in health and disease of humans, animals, and plants, food and energy production, and other topics of concern to global prosperity and sustainability. RCSB PDB operates the US data center for the global PDB archive, and makes PDB data available at no charge to all data consumers without limitations on usage. During calendar 2017, >679 million structure data files were downloaded from the PDB by Data Consumers working worldwide. RCSB PDB served >1 million RCSB.org users worldwide with PDB data integrated with ~40 external data resources providing rich structural views of fundamental biology, biomedicine, and energy sciences, and supported >600,000 PDB101.rcsb.org educational website users around the globe. RCSB PDB examined the impact of PDB archiving and open access availability on the discovery of 210 new molecular entities (NMEs or drugs) approved by the United States (US) Food and Drug Administration (FDA) between 2010 and 2016. Biological targets for 90% of NMEs are known. Approximately 6,000 PDB structures containing one of these drug targets and/or one approved NME were identified, providing 85% coverage of known targets and 88% coverage of 2010–2016 approved NMEs. Coverage was comparable across all therapeutic areas. Most structures were both published and freely accessible from the PDB long before the NMEs were approved. Additional analyses revealed these PDB structures were cited by more than 200,000 PubMed‐indexed publications reporting pre‐competitive research on the would‐be drug targets. PDB structures and citing publications contributed substantially to understanding of the target biology, and led to biopharmaceutical company investment in successful drug discovery/development programs. Overall, access to PDB data contribute to patent applications, drug discovery and development, publication of scientific studies, innovations that can lead to new product development and company formation, and STEM education. Support or Funding Information RCSB PDB is funded by a grant (DBI‐1338415) from the National Science Foundation , the National Institutes of Health , and the US Department of Energy . This abstract is from the Experimental Biology 2019 Meeting. There is no full text article associated with this abstract published in The FASEB Journal .

Zardecki, Christine↗
DOE OSTI2022

Universally Accessible Structural Data on Macromolecular Conformation, Assembly, and Dynamics by Small Angle X-Ray Scattering for DNA Repair Insights.

Structures provide a critical breakthrough step for biological analyses, and small angle X-ray scattering (SAXS) is a powerful structural technique to study dynamic DNA repair proteins. As toxic and mutagenic repair intermediates need to be prevented from inadvertently harming the cell, DNA repair proteins often chaperone these intermediates through dynamic conformations, coordinated assemblies, and allosteric regulation. By measuring structural conformations in solution for both proteins, DNA, RNA, and their complexes, SAXS provides insight into initial DNA damage recognition, mechanisms for validation of their substrate, and pathway regulation. Here, we describe exemplary SAXS analyses of a DNA damage response protein spanning from what can be derived directly from the data to obtaining super resolution through the use of SAXS selection of atomic models. We outline strategies and tactics for practical SAXS data collection and analysis. Making these structural experiments in reach of any basic and clinical researchers who have protein, SAXS data can readily be collected at government-funded synchrotrons, typically at no cost for academic researchers. In addition to discussing how SAXS complements and enhances cryo-electron microscopy, X-ray crystallography, NMR, and computational modeling, we furthermore discuss taking advantage of recent advances in protein structure prediction in combination with SAXS analysis.

Chinnam, Naga Babu↗