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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

Lithium cobalt(II) pyrophosphate, Li[subscript 1.86]CoP[subscript 2]O[subscript 7], from synchrotron X-ray powder data

Structure refinement of high-resolution X-ray powder diffraction data of the title compound gave the composition Li{sub 1.865}CoP{sub 2}O{sub 7}, which is also verified by the ICP measurement. Two Co sites exist in the structure: one is a CoO{sub 5} square pyramid and the other is a CoO{sub 6} octahedron. They share edges and are further interconnected through P{sub 2}O{sub 7} groups, forming a three-dimensional framework, which exhibits different kinds of intersecting tunnels containing Li cations and could be of great interest in Li ion battery chemistry. The structure also exhibits cation disorder with 13.5% Co residing at the lithium (Li1) site. Co seems to have an average oxidation state of 2.135, as obtained from the strutural stochiometry that closely supports the magnetic susceptibility findings.

Zhou, Hui↗
DOE OSTI2016

System and method for memory allocation in a multiclass memory system

A system for memory allocation in a multiclass memory system includes a processor coupleable to a plurality of memories sharing a unified memory address space, and a library store to store a library of software functions. The processor identifies a type of a data structure in response to a memory allocation function call to the library for allocating memory to the data structure. Using the library, the processor allocates portions of the data structure among multiple memories of the multiclass memory system based on the type of the data structure.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Mountaintop View Requires Minimal Sorting: A Faster Contour Tree Algorithm

Consider a scalar field f : M → R, where M is a triangulated simplicial mesh in R d . A level set, or contour, at value v is a connected component of f –1 (v). As v is changed, these contours change topology, merge into each other, or split. Contour trees are concise representations of f that track this contour behavior. The vertices of these trees are the critical points of f, where the gradient is zero. The edges represent changes in the topology of contours. It is a fundamental data structure in data analysis and visualization, and there is significant previous work (both theoretical and practical) on algorithms for constructing contour trees. Suppose M has n vertices, N facets, and t critical points. A classic result of Carr, Snoeyink, and Axen (2000) gives an algorithm that takes O(n log n+Nα(N)) time (where α(·) is the inverse Ackermann function). A further improvement to O(t log t + N) time was given by Chiang et al. All these algorithms involve a global sort of the critical points, a significant computational bottleneck. Unfortunately, lower bounds of Ω(t log t) also exist. We present the first algorithm that can avoid the global sort and has a refined time complexity that depends on the contour tree structure. Intuitively, if the tree is short and fat, we get significant improvements in running time. For a partition of the contour tree into a set of descending paths, P, our algorithm runs in O($\Sigma$ pϵP |p| log |p| + tα(t) + N). This is at most O(t log D + N), where D is the diameter of the contour tree. Moreover, it is O(tα(t) + N) for balanced trees, a significant improvement over the previous complexity. Our algorithm requires numerous ideas: partitioning the contour tree into join and split trees, a local growing procedure to iteratively build contour trees, and the use of heavy path decompositions for the time complexity analysis. There is a crucial use of a family of binomial heaps to maintain priorities, ensuring that any comparison made is between comparable nodes of the contour tree. We also prove lower bounds showing that the $\Sigma$ pϵP |p| log |p| complexity is inherent to computing contour trees.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

In-depth analysis on parallel processing patterns for high-performance Dataframes

The Data Science domain has expanded monumentally in both research and industry communities during the past decade, predominantly owing to the Big Data revolution. Artificial Intelligence (AI) and Machine Learning (ML) are bringing more complexities to data engineering applications, which are now integrated into data processing pipelines to process terabytes of data. Typically, a significant amount of time is spent on data preprocessing in these pipelines, and hence improving its efficiency directly impacts the overall pipeline performance. The community has recently embraced the concept of Dataframes as the de-facto data structure for data representation and manipulation. However, the most widely used serial Dataframes today (R, pandas) experience performance limitations while working on even moderately large data sets. We believe that there is plenty of room for improvement by taking a look at this problem from a high-performance computing point of view. In a prior publication, we presented a set of parallel processing patterns for distributed dataframe operators and the reference runtime implementation, Cylon. In this paper, we are expanding on the initial concept by introducing a cost model for evaluating the said patterns. Furthermore, we evaluate the performance of Cylon on the ORNL Summit supercomputer.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Clinical Natural Language Processing for Radiation Oncology: A Review and Practical Primer

Natural language processing (NLP), which aims to convert human language into expressions that can be analyzed by computers, is one of the most rapidly developing and widely used technologies in the field of artificial intelligence. Natural language processing algorithms convert unstructured free text data into structured data that can be extracted and analyzed at scale. In medicine, this unlocking of the rich, expressive data within clinical free text in electronic medical records will help untap the full potential of big data for research and clinical purposes. Recent major NLP algorithmic advances have significantly improved the performance of these algorithms, leading to a surge in academic and industry interest in developing tools to automate information extraction and phenotyping from clinical texts. Thus, these technologies are poised to transform medical research and alter clinical practices in the future. Radiation oncology stands to benefit from NLP algorithms if they are appropriately developed and deployed, as they may enable advances such as automated inclusion of radiation therapy details into cancer registries, discovery of novel insights about cancer care, and improved patient data curation and presentation at the point of care. However, challenges remain before the full value of NLP is realized, such as the plethora of jargon specific to radiation oncology, nonstandard nomenclature, a lack of publicly available labeled data for model development, and interoperability limitations between radiation oncology data silos. Successful development and implementation of high quality and high value NLP models for radiation oncology will require close collaboration between computer scientists and the radiation oncology community. Here, we present a primer on artificial intelligence algorithms in general and NLP algorithms in particular; provide guidance on how to assess the performance of such algorithms; review prior research on NLP algorithms for oncology; and describe future avenues for NLP in radiation oncology research and clinics.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2020

Data for Post-Access Report: Tidal Energy Resource Characterization and Model Validation via the Assessment of Cost-effective Spatially Distributed Current Measurements from microFloat Swarms

This project evaluated how high-resolution, spatially distributed field data can be used to refine and validate site-scale hydrodynamic simulations of tidal channels. Use of such spatially-distributed field observations or site-scale hydrodynamic simulations will be needed for producing accurate predictions of tidal energy production over larger arrays of tidal turbines. The data contained in this archive includes field observations of water velocity from a series of short surveys in Agate Pass taken on August 20th, 2020 using station-keeping ADCP (acoustic doppler current profiler) measurements, drifting downward-looking ADCPs, and microFloats, gathered by researchers at APL-UW under a previous project. It also includes high-resolution hydrodynamic model runs for the site during that time generated under TEAMER support. An explanatory file (.pdf format) describes the survey and field data structure. Processed data is stored in .mat format. Survey summary: start time, number of floats, water level. microFloat data: - Cleaned data for each float in survey, - Time series of position (lat., lon.), depth (relative to surface), and horizontal velocity (u, v) Drifting ADCP data: - Cleaned data for each drifting ADCP in survey - Time series of position (lat., lon.), sample depth (relative to surface), and observed water velocity (u,v,w) Stationary ADCP data: - Cleaned data for each station-keeping data set in survey - Time series of position (lat., lon.), sample depth (relative to surface), and observed water velocity (u,v,w) FVCOM (Finite Volume Coastal Ocean Model) model outputs: Water level and velocity, as well as derived variables (e.g., power density) from the final refined model simulations for the Agate Pass subdomain. Contained in NetCDF and ASCII files for the duration of August 18th and 20th 2020 field surveys. Additional scripts for processing the data and generating the figures in the report are included.

16 TIDAL AND WAVE POWER↗
DOE OSTI2017

Deep Learning for Unsupervised Insider Threat Detection in Structured Cybersecurity Data Streams

Situational awareness data is a prototypical example of structured heterogeneous streaming data with asynchronous timing that can quickly scale beyond the cognitive power of a human analyst. We present deep learning methods that can train in real time from unlabeled streams and provide probabilistic anomaly scores. We compare our novel deep and recurrent neural network models to three baseline systems using threat detection recall on the CERT Insider Threat Dataset v6.2. In our experiments, our deep neural network and our recurrent neural network systems outperformed all baselines, and we found that using aggregated activity count features yielded the best performance. Our best model produces on average an anomaly score of 95.53 percentile for the day, suggesting it can facilitate a great reduction in analyst workload. Our models are also interpretable, in that they break down the anomaly score into individual features of user behavior, which could further aid analysts in reviewing potential cases of insider threat.

Tuor, Aaron R.↗
DOE OSTI2022

The LLNL nuclear data infrastructure for the GNDS data format

The next generation of nuclear data infrastructure tools at the Livermore National Laboratory (LLNL) consists of pipeline of codes that read and process nuclear data from evaluated files saved in the new GNDS (Generalised Nuclear Data Structure) nuclear data format. The processing code FUDGE (For Updating Data and Generating Evaluations) is at the front-end of this pipeline as it reads and process the evaluated data for use in downstream transport codes. FUDGE is Python based with C and C++ extensions for computationally intensive tasks. As is the case for the evaluated data, the processed output is also saved in the GNDS format and the GIDI+ API is provided as the interface between the processed data and the transport codes. GIDI+ is a C++ based suite of codes and it includes GIDI (General Interaction Data Interface), a library for reading and writing GNDS data, and MCGIDI which is the cross section lookup, and reaction and product distribution sampling interface between Monte Carlo transport codes and the GNDS data. GIDI provides methods for easy access to the multi-group processed GNDS data and this is demonstrated through its implementation in ARDRA, the LLNL deterministic transport code. The evaluation and sampling methods in MCGIDI are available as both CPU and GPU methods which facilitates the use of MCGIDI in both traditional CPU-based as well as the next generation mixed model computational architectures. This is demonstrated through the GIDI+ implementation in MERCURY, the LLNL Monte Carlo transport code. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2018

pnnl/SHAD

Scalable High-performance Algorithms and Data-structures. Scalable High-performance Algorithms and Data-structures (SHAD) is an application programming interface based on a generic software library. It has a modular design that enables reuse of modules. The core of this software tool set is built on an Abstract Runtime interface and it's library includes the common data structures such as array, vector, map and set. It is designed to accommodate significant amount of data which can be accessed in massively parallel environments, and used as building blocks for SHAD extensions, i.e. higher level software libraries.

Castellana, Vito↗
DOE OSTI2018

Multithreaded sparse matrix-matrix multiplication for many-core and GPU architectures

Sparse matrix-matrix multiplication is a key kernel that has applications in several domains such as scientific computing and graph analysis. Several algorithms have been studied in the past for this foundational kernel. In this work, we develop parallel algorithms for sparse matrix-matrix multiplication with a focus on performance portability across different high performance computing architectures. The performance of these algorithms depend on the data structures used in them. We compare different types of accumulators in these algorithms and demonstrate the performance difference between these data structures. Furthermore, we develop a meta-algorithm, kkSpGEMM, to choose the right algorithm and data structure based on the characteristics of the problem. We show performance comparisons on three architectures and demonstrate the need for the community to develop two phase sparse matrix-matrix multiplication implementations for efficient reuse of the data structures involved.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Multi-threaded Sparse Matrix Sparse Matrix Multiplication for Many-Core and GPU Architectures.

Sparse Matrix-Matrix multiplication is a key kernel that has applications in several domains such as scientific computing and graph analysis. Several algorithms have been studied in the past for this foundational kernel. In this paper, we develop parallel algorithms for sparse matrix- matrix multiplication with a focus on performance portability across different high performance computing architectures. The performance of these algorithms depend on the data structures used in them. We compare different types of accumulators in these algorithms and demonstrate the performance difference between these data structures. Furthermore, we develop a meta-algorithm, kkSpGEMM, to choose the right algorithm and data structure based on the characteristics of the problem. We show performance comparisons on three architectures and demonstrate the need for the community to develop two phase sparse matrix-matrix multiplication implementations for efficient reuse of the data structures involved.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Nuclear Data Sheets for A=170☆

Nuclear structure data pertaining to all nuclei with mass number A=170 have been evaluated, and incorporated into the ENSDF data file. This evaluation supersedes the previous evaluation (Coral M. Baglin), Nuclear Data Sheets 96, 611 (2002), (cutoff date 15 August 2002) and subsequent updates of the ENSDF file for Yb to Dy (cutoff 15 April 2010), Lu (cutoff 8 October 1998), Pt (cutoff 17 February 1999) and Ta, Os (cutoff 7 April 1998). Since the previous evaluation, {sup 170}Gd has been observed and the ground state T{sub 1/2} measured. New excited states have also been observed in the neutron rich {sup 170}Dy. The ground state T{sub 1/2} of {sup 170}Tb has been determined, however, there are currently still no excited states observed in this nucleus. There remains some uncertainty in the ground state and longer-lived isomer in {sup 170}Ir which could warrent further experimental investigation.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2017

The introspective may achieve more: Enhancing existing Geoscientific models with native-language emulated structural reflection

Geoscientific models manage myriad and increasingly complex data structures as trans -disciplinary models are integrated. They often incur significant redundancy with cross-cutting tasks. Reflection, the ability of a program to inspect and modify its structure and behavior at runtime, is known as a powerful tool to improve code reusability, abstraction, and separation of concerns. Reflection is rarely adopted in high-performance Geoscientific models, especially with Fortran, where it was previously deemed implausible. Practical constraints of language and legacy often limit us to feather-weight, native-language solutions. We demonstrate the usefulness of a structural-reflection-emulating, dynamically-linked metaObjects, gd . We show real-world examples including data structure self-assembly, effortless save/restart and upgrade to parallel I/O, recursive actions and batch operations. We share gd and a derived module that reproduces MATLAB-like structure in Fortran and C++. We suggest that both a gd representation and a Fortran-native representation are maintained to access the data, each for separate purposes. In conclusion, embracing emulated reflection allows generically-written codes that are highly re-usable across projects.

58 GEOSCIENCES↗
DOE OSTI2023

Scalable Incremental Checkpointing using GPU-Accelerated De-Duplication

Writing large amounts of data concurrently to stable storage is a typical I/O pattern of many HPC workflows. This pattern introduces high I/O overheads and results in increased storage space utilization especially for workflows that need to capture the evolution of data structures with high frequency as checkpoints. In this context, many applications, such as graph pattern matching, perform sparse updates to large data structures between checkpoints. For these applications, incremental checkpointing techniques that save only the differences from one checkpoint to another can dramatically reduce the checkpoint sizes, I/O bottlenecks, and storage space utilization. However, such techniques are not without challenges: it is non-trivial to transparently determine what data has changed since a previous checkpoint and assemble the differences in a compact fashion that does not result in excessive metadata. State-of-art data reduction techniques (e.g., compression and de-duplication) have significant limitations when applied to modern HPC applications that leverage GPUs: slow at detecting the differences, generate a large amount of metadata to keep track of the differences, and ignore crucial spatiotemporal checkpoint data redundancy. This paper addresses these challenges by proposing a Merkle tree-based incremental checkpointing method to exploit GPUs' high memory bandwidth and massive parallelism. Experimental results at scale show a significant reduction of the I/O overhead and space utilization of checkpointing compared with state-of-the-art incremental checkpointing and compression techniques.

Tan, Nigel↗
DOE OSTI2018

Nuclear Data Sheets for A=164

Experimental nuclear structure data for the known A=164 isobaric nuclides (Sm, Eu, Gd, Tb, Dy, Ho, Er, Tm, Yb, Lu, Hf, Ta, W, Re, Os, Ir) have been evaluated, and presented together with Adopted properties of level energies, and associated γ rays. The decay data for these nuclides have also been evaluated, providing Adopted values of γ and β radiations, and log ft values. No excited states are known in 164 Eu, 164 Tb, and 164 Ir. Information for 164 Gd, 164 Re and 164 Os is limited due to insufficient experimental data. For radioactive nuclides, decay schemes of 164 Sm, 164 Gd and 164 Re are not known, and those of 164 W, 164 Tb, 164 Lu, 164 Hf, 164 Ta and 164 W are incomplete. The decay schemes of 164 Ho and the two activities of 164 Tm seem fairly complete. The decay scheme of 164 Yb presents a major problem that the Q(ε) value of 887 keV 29 recommended in 2017Wa10 is in disagreement with the population of levels at 928, 952 and 1060 keV in the daughter nucleus. This decay scheme, which so far has been mainly reported in a secondary reference (1982AdZZ) needs further investigation. Also the masses of 164 Yb and 164 Tm need either new measurements or a re-evaluation to resolve discrepancy of about 220 keV in the Q value of 164 Yb decay to 164 Tm. The reactions and decays for which no new experimental information has become available since the 2001 update have undergone revisions to incorporate conversion coefficients from BrIcc code, and evaluated Q values from 2017Wa10, but the essential content of such datasets may have remained the same as in previous evaluations. Finally, in this respect the present work greatly benefited from all the previous NDS evaluations (2001Si27,1992Sh07, 1986Sh03,1974Bu30), but at the same time data presented herein supersede all the previous published evaluations.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗
DOE OSTI2019

Nuclear Data Sheets for A=73☆

Experimental nuclear structure data for the known A=73 isobaric nuclides (Mn, Fe, Co, Ni, Cu, Zn, Ga, Ge, As, Se, Br, Kr, Rb and Sr) have been evaluated, and presented together with Adopted properties of level energies, and associated γ rays. The decay data for these nuclides have also been evaluated, providing Adopted values of γ and β radiations, and log ft values. For {sup 73}Mn, only the isotopic identification has been established, with no knowledge of its g.s. half-life. For {sup 73}Fe, {sup 73}Co and {sup 73}Sr, only the ground states and their half-lives are known with no information about the excited states. For {sup 73}Ni, {sup 73}Cu, {sup 73}Zn and {sup 73}Rb, little data are available for excited states. The half-life and decay modes of possibly proton-unbound {sup 73}Rb need firmly established. {sup 73}Ga structure presents a special challenge in that the 1/2{sup −} ground state and the first 3/2{sup −} state have recently been proposed, in a Coulomb excitation experiment by 2010Di14, to form an almost degenerate doublet with an estimated spacing of 229 Th with its first excited state at 7.8 eV, and {sup 235}U with its first excited state at 76 eV. Ultra-high resolution gamma-ray spectroscopic studies are warranted to search for the low-lying (73 Ga, and to determine its half-life. Level structures of {sup 73}Ga, {sup 73}Ge, {sup 73}As, {sup 73}Se, {sup 73}Br and {sup 73}Kr are quite well known, although decay schemes of radioactive ground states of {sup 73}Co, {sup 73}Cu and {sup 73}Br are considered incomplete. The reactions and decays for which no new experimental information has become available since the 2003 update have undergone revisions to incorporate conversion coefficients from BrIcc code, and evaluated Q values from 2017Wa10, but essential content of such datasets may have remained the same as in previous evaluations. In this respect the present work greatly benefited from all the previous NDS evaluations (2004Si08,1993Ki25,1987Ki13, 1980Ek01,1974Al33), but at the same time data presented herein supersede all the previous published evaluations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

The Stellar decomposition: A compact representation for simplicial complexes and beyond

Here, we introduce the Stellar decomposition, a model for efficient topological data structures over a broad range of simplicial and cell complexes. A Stellar decomposition of a complex is a collection of regions indexing the complex’s vertices and cells such that each region has sufficient information to locally reconstruct the star of its vertices, i.e., the cells incident in the region’s vertices. Stellar decompositions are general in that they can compactly represent and efficiently traverse arbitrary complexes with a manifold or non-manifold domain. They are scalable to complexes in high dimension and of large size, and they enable users to easily construct tailored application-dependent data structures using a fraction of the memory required by a corresponding global topological data structure on the complex. As a concrete realization of this model for spatially embedded complexes, we introduce the Stellar tree, which combines a nested spatial tree with a simple tuning parameter to control the number of vertices in a region. Stellar trees exploit the complex’s spatial locality by reordering vertex and cell indices according to the spatial decomposition and by compressing sequential ranges of indices. Stellar trees are competitive with state-of-the-art topological data structures for manifold simplicial complexes and offer significant improvements for cell complexes and non-manifold simplicial complexes. We conclude with a high-level description of several mesh processing and analysis applications that utilize Stellar trees to process large datasets.

97 MATHEMATICS AND COMPUTING↗