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 919 records · Page 51

Multi‐dimensional lock‐free arrays for multithreaded mode‐directed tabling in Prolog

Summary This work proposes a new design for the supporting data structures used to implement multithreaded tabling in Prolog systems. Tabling is an implementation technique that improves the expressiveness of traditional Prolog systems in dealing with recursion and redundant computations. Mode‐directed tabling is an extension to the tabling technique that supports the definition of alternative criteria for specifying how answers are aggregated, thus being very suitable for problems where the goal is to dynamically calculate optimal or selective answers. In this work, we leverage the intrinsic potential that mode‐directed tabling has to express dynamic programming problems by creating a new design that improves the representation of multi‐dimensional arrays in the context of multithreaded tabling. To do so, we introduce a new mode for indexing arguments in mode‐directed tabled evaluations, named dim , where each dim argument features a uni‐dimensional lock‐free array. Experimental results using well‐known dynamic programming problems on a 32‐core machine show that the new design introduces less overheads and clearly improves the execution time for sequential and multithreaded tabled evaluations.

Areias, Miguel↗

Tail queues: A multi-threaded matching architecture

As we approach exascale, computational parallelism will have to drastically increase in order to meet throughput targets. Many–core architectures have exacerbated this problem by trading reduced clock speeds, core complexity, and computation throughput for increasing parallelism. This presents two major challenges for communication libraries such as MPI: the library must leverage the performance advantages of thread level parallelism and avoid the scalability problems associated with increasing the number of processes to that scale. Hybrid programming models, such as MPI+X, have been proposed to address these challenges. MPI THREAD MULTIPLE is MPI's thread safe mode. While there has been work to optimize it, it largely remains non–performant in most implementations. While current applications avoid MPI multithreading due to performance concerns, it is expected to be utilized in future applications. One of the major synchronous data structures required by MPI is the matching engine. In this paper, we present a parallel matching algorithm that can improve MPI matching for multithreaded applications. We then perform a feasibility study to demonstrate the performance benefit of the technique.

97 MATHEMATICS AND COMPUTING↗

Effects of random forest modeling decisions on biogeochemical time series predictions

Abstract Random forests (RF) are an increasingly popular machine learning approach used to model biogeochemical processes in the Earth system. While RF models are robust to many assumptions that complicate deterministic models, there are several important parameterization decisions for appropriate use and optimal model fit. We explored the role that parameter decisions, including training/testing data splitting strategies, variable selection, and hyperparameters play on RF goodness‐of‐fit by constructing models using 1296 unique parameter combinations to predict concentrations of nitrate, a key nutrient for biogeochemical cycling in aquatic ecosystems. Models were built on long‐term, publicly available water quality and meteorology time series collected by the National Estuarine Research Reserve monitoring network for two contrasting ecosystems representing freshwater and brackish estuaries. We found that accounting for temporal dependence when splitting data into training and testing subsets was key for avoiding over‐estimation of model predictive power. In addition, variable selection, the ratio of training to testing data, and to a lesser degree, variables per split and number of trees, were significant parameters for optimizing RF goodness‐of‐fit. We also explored how model parameter decisions influenced interpretation of the relative importance of predictors to the model, and model predictor‐dependent variable relationships, with results suggesting that both data structure and model parameterization influence these factors. Because much of the current RF literature is written for the computational and statistical science communities, the primary goal of this study is to provide guidelines for aquatic scientists new to machine learning to apply RF techniques appropriately to aquatic biogeochemical datasets.

54 ENVIRONMENTAL SCIENCES↗

Nanostructure Scaling in Semi-Dilute Triblock Copolymer Gels

Here, there is a considerable body of work that describes the scaling of diblock copolymer micelle dimensions in dilute and semi-dilute solution based upon block degrees of polymerization and copolymer concentration. However, there is a lack of analogous information for semi-dilute ABA triblock copolymer gels, which consist of ABA triblock copolymer dissolved in midblock-selective (B-selective) solvent. The present study uses small angle X-ray scattering to extract micelle dimensions for numerous triblock copolymer gels that vary in copolymer identity (and hence block lengths) and copolymer concentration, as well as gels that contain various ratios of two unique triblock copolymers. Analysis of micelle structural data subsequently translates to universal scaling expressions for the micelle core radius – r A ≈ N A 0.53 N B -0.14 $\phi$ ABA 0.16 where N A and N B are the endblock and midblock degrees of polymerization, respectively, and $\phi$ ABA is the volume fraction of triblock copolymer in the gel – and for the intermicelle spacing – l AA ≈ N A 0.09 N B 0.29 $\phi$ ABA -0.35 . Each scaling expression describes the full collection of experimental data very well. Additionally, these scaling expressions are partially in line with expectations from semi-dilute diblock copolymer solution theory.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Neutron diffraction and thermoelectric properties of indium filled In x Co 4 Sb 12 ( x =0.05, 0.2) and indium cerium filled Ce 0.05 In 0.1 Co 4 Sb 12 skutterudites: Neutron diffraction and thermoelectric properties of In/Ce skutterudites

The thermoelectric properties on polycrystalline single (In) and double filled (Ce, In) skutterudites are characterized between 300 and 700 K. Powder neutron diffraction measurements of the skutterudite compositions In x Co 4 Sb 12 (x= 0.05, 0.2) and Ce 0.05 In 0.1 Co 4 Sb 12 as a function of temperature (12- 300 K) were carried out, which gives more insight into the structural data of single and double-filled skutterudites. Our results show that due to the annealing treatment, a Sb deficiency is detectable and thus verifies defects at the Sb lattice site of the skutterudite. Furthermore, we show by electron microprobe analysis that a considerable amount of indium is lost during synthesis and post-processing for the single indium filled samples, but not for the double cerium and indium skutterudite sample. The double-filled skutterudite is superior to the single-filled skutterudite composition due to a higher charge carrier density, a comparable lattice thermal resistivity, and a higher density of states effective mass in our experiment. Finally, we obtained a significantly higher Einstein temperature for the double-filled skutterudite composition in comparison to the single-filled species, which reflects the high sensitivity due to filling of the void lattice position within the skutterudite crystal.

36 MATERIALS SCIENCE↗

Automatic inspection of program state in an uncooperative environment

Abstract The program state is formed by the values that the program manipulates. These values are stored in the stack, in the heap, or in static memory. The ability to inspect the program state is useful as a debugging or as a verification aid. Yet, there exists no general technique to insert inspection points in type‐unsafe languages such as C or C++. The difficulty comes from the need to traverse the memory graph in a so‐called uncooperative environment. In this article, we propose an automatic technique to deal with this problem. We introduce a static code transformation approach that inserts in a program the instrumentation necessary to report its internal state. Our technique has been implemented in LLVM. It is possible to adjust the granularity of inspection points trading precision for performance. In this article, we demonstrate how to use inspection points to debug compiler optimizations; to augment benchmarks with verification code; and to visualize data structures.

Magalhães, José Wesley de Souza↗

CAASCADE: A System for Static Analysis of HPC Software Application Portfolios

With the increasing complexity of upcoming HPC systems, so-called “co-design” efforts to develop the hardware and applications in concert for these systems also become more challenging. It is currently difficult to gather information about the usage of programming model features, libraries, and data structure considerations in a quantitative way across a variety of applications, and this information is needed to prioritize development efforts in systems software and hardware optimizations. In this paper we propose CAASCADE, a system that can harvest this information in an automatic way in production HPC environments, and we show some early results from a prototype of the system based on GNU compilers and a MySQL database.

Lopez, Graham↗

Developing an ELM Ecosystem Dynamics Model on GPU with OpenACC

Porting a complex scientific code, such as the E3SM land model (ELM), onto a new computing architecture is challenging. The paper presents design strategies and technical approaches to develop an ELM ecosystem dynamics model with compiler directives (OpenACC) on NVIDIA GPUs. The code has been refactored with advanced OpenACC features (such as deepcopy and routine directives) to reduce memory consumption and to increase the levels of parallelism through parallel loop reconstruction and new data structures. As a result, the optimized parallel implementation achieved more than a 140-time speedup (50 ms vs 7600 ms), compared to a naive implementation that uses OpenACC routine directive and parallelizes the code across existing loops on a single NVIDIA V100. On a fully loaded computing node with 44 CPUs and 6 GPUs, the code achieved over a 3.0-times speedup, compared to the original code on the CPU. Furthermore, the memory footprint of the optimized parallel implementation is 300 MB, which is around 15% of the 2.15 GB of memory consumed by a naive implementation. This study is the first effort to develop the ELM component on GPUs efficiently to support ultra-high-resolution land simulations at continental scales.

Schwartz, Peter↗

Fault tolerance in an inner-outer solver: A GVR-enabled case study

Resilience is a major challenge for large-scale systems. It is particularly important for iterative linear solvers, since they take much of the time of many scientific applications. We show that single bit flip errors in the Flexible GMRES iterative linear solver can lead to high computational overhead or even failure to converge to the right answer. Informed by these results, we design and evaluate several strategies for fault tolerance in both inner and outer solvers appropriate across a range of error rates. We implement them, extending Trilinos’ solver library with the Global View Resilience (GVR) programming model, which provides multi-stream snapshots, multi-version data structures with portable and rich error checking/recovery. Lastly, experimental results validate correct execution with low performance overhead under varied error conditions.

97 MATHEMATICS AND COMPUTING↗

SharP Unified Memory Allocator: An Intent-Based Memory Allocator for Extreme-Scale Systems

The pre-exascale systems will soon be deployed with a deep, complex memory hierarchy composed of many heterogeneous memories. This presents multiple challenges for users including: how to allocate data objects with locality between memories and devices for the various memories in these systems, which includes DRAM, High-bandwidth Memory (HBM), and non-volatile random access memory (NVRAM), and how to perform these allocations while providing portability for their application. Currently, the user can make use of multiple, disjoint libraries to allocate data objects on these memories. However, it is difficult to obtain locality between memories and devices when using libraries that are unaware of each other. This paper presents the Unified Memory Allocator (UMA) of the SHARed data-structure centric Programming abstraction (SharP) library, which provides a unified interface for memory allocations across DRAM, HBM, and NVRAM and is extensible to support future memory types. In addition, the SharP UMA allows for portability between systems by supporting both explicit and implicit, intent-based memory allocations. To demonstrate the ease of use of the SharP UMA, we have extended both Open MPIand OpenSHMEM-Xto support SharP. We validate this work by evaluating the performance implications and intent-based approach with synthetic benchmarks as well as adaptations of the Graph500 benchmark.

Aderholdt, William↗

DisClose: Discovering Colossal Closed Itemsets via a Memory Efficient Compact Row-Tree

Itemset mining has recently focused on discovery of frequent itemsets from high-dimensional datasets with relatively few rows and a larger number of items. With exponentially in-creasing running time as average row length increases, mining such datasets renders most conventional algorithms impracti-cal. Unfortunately, large cardinality closed itemsets are likely to be more informative than small cardinality closed itemsets in this type of dataset. This paper proposes an approach, called DisClose, to extract large cardinality (colossal) closed itemsets from high-dimensional datasets. The approach relies on a memory-efficient Compact Row-Tree data structure to represent itemsets during the search process. The search strategy explores the transposed representation of the dataset. Large cardinality itemsets are enumerated first followed by smaller ones. In addition, we utilize a minimum cardinality threshold to further reduce the search space. Experimental result shows that DisClose can complete the extraction of colossal closed itemsets in the considered dataset, even for low support thresholds. The algorithm immediately discovers closed itemsets without needing to check if each new closed itemset has previously been found.

Zulkurnain, Nurul F.↗

Co doping effect on structural and optical properties of nickel oxide (NiO) thin films via spray pyrolysis

Undoped and cobalt doped nickel oxide thin films (Co:NiO) at different doping concentrations were deposited on a glass substrate at constant substrate temperature by spray pyrolysis. The doping percentage increased from 0 to 10% and the effects of doping content on structural, morphological and optical properties were explored by X-ray diffraction, atomic force microscopy and UV–visible spectroscopy, respectively. X-ray diffraction configurations proved the NiO thin films were polycrystalline in nature having a cubic crystal structure. The regularly used parameters such as crystallite size, micro-strain, dislocation density and texture coefficient are presented from structural data. The average crystallite size is found between 10 and 14 nm with cobalt doping (Co) concentration. The band gap energies were increased with the effect of Co doping concentration in the range between 2.10 and 2.50 eV. The various optical constants as a function of photon energy are modified with Co doping concentration.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

A Library of Local Search Heuristics for the Vehicle Routing Problem

The vehicle routing problem (VRP) is a difficult and well-studied combinatorial optimization problem. Real-world instances of the VRP can contain hundreds and even thousands of customer locations and can involve many complicating constraints, necessitating the use of heuristic methods. We present a software library of local search heuristics that allow one to quickly generate good solutions to VRP instances. The code has a logical, object-oriented design and uses efficient data structures to store and modify solutions. The core of the library is the implementation of seven local search operators that share a similar interface and are designed to be extended to handle additional options with minimal code change. The code is well-documented, is straightforward to compile, and is freely available for download at http://sites.google.com/site/vrphlibrary/ . The distribution of the code contains several applications that can be used to generate solutions to instances of the capacitated VRP.

97 MATHEMATICS AND COMPUTING↗

Flying Cages in Traveling Wave Ion Mobility: Influence of the Instrumental Parameters on the Topology of the Host–Guest Complexes

Supramolecular mass spectrometry has emerged in the last decade as an orthogonal method to access, at the molecular level, the structures of noncovalent complexes extracted from the condensed phase to the rarefied gas phase using electrospray ionization. It is often considered that the soft nature of the ESI source confers to the method the capability to generate structural data comparable to those in the condensed phase. In the present paper, using the ammonium ion/cucurbituril combination as a model system, we investigate using ion mobility and computational chemistry the influence of the instrumental parameters on the topology, i.e., internal versus external association, of gaseous host/guest complex ions. MS and theoretical data are confronted to condensed phase data derived from nuclear magnetic resonance spectroscopy to assess whether the instrumental parameters can play an insidious role when trying to derive condensed phase data from mass spectrometry results. .

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Microstructure and thermoelectric properties of CoSb 2.75 Ge 0.25-x Te x prepared by rapid solidification

Since the vibration modes of the pnicogen rings in CoSb3-based skutterudites fall within the range of frequencies of heat-carrying phonons, disruption of the rings by doping should have a strong influence on heat transport in this material. To test the premise, single-phase double-doped CoSb 2.75 Ge 0.25-x Te x x (x = 0.125–0.20) compounds were synthesized by combining melt spinning with a spark plasma sintering method. Following the melt-spinning process, the side of the ribbons contacting the copper drum is featureless and reflects its amorphous nature while the free surface of the ribbons is composed of 30–80 nm grains. After spark plasma processing the average grain size of the bulk samples is about 200 nm. High-resolution transmission electron microscopy images show an in situ nanostructure consisting of circular, 15 nm diameter dots of Te- and Ge-enriched skutterudite phase embedded in the skutterudite matrix. Transport properties were measured from 2 to 800 K as a function of Te and Ge content on the pnicogen (Sb) rings and the results were correlated with the structural data. Double-doping on pnicogen rings with Ge and Te, and using melt-spinning processing, results in binary skutterudite compounds that possess an impressive figure of merit of ZT ~ 1.1 at 750 K.

36 MATERIALS SCIENCE↗

Geometric characterization and simulation of planar layered elastomeric fibrous biomaterials

Many important biomaterials are composed of multiple layers of networked fibers. While there is a growing interest in modeling and simulation of the mechanical response of these biomaterials, a theoretical foundation for such simulations has yet to be firmly established. Moreover, correctly identifying and matching key geometric features is a critically important first step for performing reliable mechanical simulations. This paper addresses these issues in two ways. First, using methods of geometric probability, we develop theoretical estimates for the mean linear and areal fiber intersection densities for 2-D fibrous networks. These densities are expressed in terms of the fiber density and the orientation distribution function, both of which are relatively easy-to-measure properties. Secondly, we develop a random walk algorithm for geometric simulation of 2-D fibrous networks which can accurately reproduce the prescribed fiber density and orientation distribution function. Furthermore, the linear and areal fiber intersection densities obtained with the algorithm are in agreement with the theoretical estimates. Both theoretical and computational results are compared with those obtained by post-processing of scanning electron microscope images of actual scaffolds. These comparisons reveal difficulties inherent to resolving fine details of multilayered fibrous networks. Finally, the methods provided herein can provide a rational means to define and generate key geometric features from experimentally measured or prescribed scaffold structural data.

36 MATERIALS SCIENCE↗

Comprehensive review of 2 β decay half-lives

Here, the double-beta (2 β )-decay is the rarest nuclear physics process, and its experimental half-lives (T 1/2 ) exceed the age of the Universe from nine to fourteen orders of magnitude. Double-beta decay was observed, and its half-life was measured in 14 parent nuclei using direct, radiochemical, and geochemical methods. The decay observables are analyzed using the Evaluated Nuclear Structure Data File (ENSDF) procedures, and the recommended T 1/2 were deduced. Using the calculated values of phase factors, the effective nuclear matrix elements were extracted and compared with available data. Thousands of theoretical and experimental works have been dedicated to these topics in the last 85 years, and we present two data sets of recommended values to encapsulate the results.

2β-decay↗