Science Search and Retrieval Using XML
Science missions and instruments continue to produce volumes of useful data and scientists depend on the data systems and tools that archive this data as a means to access and analyze it.
SEARCH · Search NASA
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.
Science missions and instruments continue to produce volumes of useful data and scientists depend on the data systems and tools that archive this data as a means to access and analyze it.
A document presents a concept for run-time implementation of other concepts embodied in the Chapel programming language. (Now undergoing development, Chapel is intended to become a standard language for parallel computing that would surpass older such languages in both computational performance in the efficiency with which pre-existing code can be reused and new code written.) The aforementioned other concepts are those of distributions, domains, allocations, and access, as defined in a separate document called "A Semantic Framework for Domains and Distributions in Chapel" and linked to a language specification defined in another separate document called "Chapel Specification 0.3." The concept presented in the instant report is recognition that a data domain that was invented for Chapel offers a novel approach to distributing and processing data in a massively parallel environment. The concept is offered as a starting point for development of working descriptions of functions and data structures that would be necessary to implement interfaces to a compiler for transforming the aforementioned other concepts from their representations in Chapel source code to their run-time implementations.
Here we develop a distributed framework for the physics-informed neural networks (PINNs) based on two recent extensions, namely conservative PINNs (cPINNs) and extended PINNs (XPINNs), which employ domain decomposition in space and in time-space, respectively. This domain decomposition endows cPINNs and XPINNs with several advantages over the vanilla PINNs, such as parallelization capacity, large representation capacity, efficient hyperparameter tuning, and is particularly effective for multi-scale and multi-physics problems. Here, we present a parallel algorithm for cPINNs and XPINNs constructed with a hybrid programming model described by MPI + X, where X ∈ {CPUs, GPUs}. The main advantage of cPINN and XPINN over the more classical data and model parallel approaches is the flexibility of optimizing all hyperparameters of each neural network separately in each subdomain. We compare the performance of distributed cPINNs and XPINNs for various forward problems, using both weak and strong scalings. Our results indicate that for space domain decomposition, cPINNs are more efficient in terms of communication cost but XPINNs provide greater flexibility as they can also handle time-domain decomposition for any differential equations, and can deal with any arbitrarily shaped complex subdomains. To this end, we also present an application of the parallel XPINN method for solving an inverse diffusion problem with variable conductivity on the United States map, using ten regions as subdomains.
This study presents a parallel preconditioning method for distributed sparse linear systems, based on an approximate inverse of the original matrix, that adopts a general framework of distributed sparse matrices and exploits domain decomposition (DD) and low-rank corrections. The DD approach decouples the matrix and, once inverted, a low-rank approximation is applied by exploiting the Sherman--Morrison--Woodbury formula, which yields two variants of the preconditioning methods. The low-rank expansion is computed by the Lanczos procedure with reorthogonalizations. Numerical experiments indicate that, when combined with Krylov subspace accelerators, this preconditioner can be efficient and robust for solving symmetric sparse linear systems. Comparisons with pARMS, a DD-based parallel incomplete LU (ILU) preconditioning method, are presented for solving Poisson's equation and linear elasticity problems.
A series of scale-resolving simulations of flow over the ONERA OAT15A airfoil have been performed at an angle of attack of 3.5◦, just past the onset of buffet. The focus of this study is to document the sensitivity of the wall-modeled large eddy simulation (WMLES) methodology for curvilinear structured overset grids within the Launch, Ascent, and Vehicle Aerodynamics (LAVA) framework to mesh spacing, mesh distribution, and domain size. A secondary purpose of the study is to compare the results from WMLES to unsteady Reynolds-averaged Navier Stokes (URANS) simulations and hybrid RANS-LES (HRLES) within the same LAVA solver framework. The study provides a unique perspective regarding comparisons between different turbulence modeling approaches, time-integration methods, and computational performance since many of the same numerical routines are used for all three types of simulations. The results are compared with experiments and previous numerical studies of the same geometry and flow conditions.
State of the art astronomical simulations have provided datasets which enabled the training of novel deep learning techniques for constraining cosmological parameters. However, differences in subgrid physics implementation and numerical approximations among simulation suites lead to differences in simulated datasets, which pose a hard challenge when trying to generalize across diverse data domains and ultimately when applying models to observational data. Recent work reveals deep learning algorithms are able to extract more information from complex cosmological simulations than summary statistics like power spectra. We introduce Domain Adaptive Graph Neural Networks (DA-GNNs), trained on CAMELS data, inspired by CosmoGraphNet (Villanueva-Domingo et al 2023). By utilizing GNNs, we can capitalize on their capacity to capture both astrophysical and topological features of galaxy distributions. Mixing these capabilities with domain adaptation techniques such as Maximum Mean Discrepancy (MMD), which enable extraction of domain-invariant features, our framework demonstrates enhanced accuracy and robustness. We present experimental results, including the alignment of distributions across domains through data visualization. These findings suggest that DA-GNNs are an efficient way of extracting domain independent cosmological information, a vital step toward robust deep learning for real cosmic survey data.
Sufficient pore size, appropriate stability, and hierarchical porosity are three prerequisites for open frameworks designed for drug delivery, enzyme immobilization, and catalysis involving large molecules. In this work, we report a powerful and general strategy, linker thermolysis, to construct ultrastable hierarchically porous metal–organic frameworks (HP-MOFs) with tunable pore size distribution. Linker instability, usually an undesirable trait of MOFs, was exploited to create mesopores by generating crystal defects throughout a microporous MOF crystal via thermolysis. The crystallinity and stability of HP-MOFs remain after thermolabile linkers are selectively removed from multivariate metal–organic frameworks (MTV-MOFs) through a decarboxylation process. A domain-based linker spatial distribution was found to be critical for creating hierarchical pores inside MTV-MOFs. Furthermore, linker thermolysis promotes the formation of ultrasmall metal oxide nanoparticles immobilized in an open framework that exhibits high catalytic activity for Lewis acid-catalyzed reactions. Lastly and most importantly, this work provides fresh insights into the connection between linker apportionment and vacancy distribution, which may shed light on probing the disordered linker apportionment in multivariate systems, a long-standing challenge in the study of MTV-MOFs.
This work examines the possible migration of radionuclides from a deep geologic nuclear waste repository sited in fractured crystalline host rock. The key safety concern is the potential effect on waste isolation of the inter-connectivity of the fracture network, which is primarily established by the temporal evolution of the temperature and stress fields at the time of original rock intrusion and cooling. Two end members are considered in these simulations, one with a high degree of connectivity to the biosphere, such that advective transport through the fracture and fault network controls radionuclide migration, and the other with a low degree of connectivity, such that slow diffusive transport through the crystalline rock matrix is the controlling process for radionuclide migration to the biosphere. Both end members have several areally extensive, high-transmissivity deformation zones, whose distance to the repository is an important factor for waste isolation capability. Uncertainties in fracture properties (transmissivity, orientation, radius) and fracture distribution also give rise to uncertainty in waste isolation capability (i.e., the overall connectivity of the repository with the surface biosphere). These types of natural system uncertainties are generally present in any geologic site-characterization program and thus represent an important factor in assessing repository performance in hard rock environments. The waste considered in these simulations are spent fuel rod assemblies from the U.S. commercial nuclear reactor fleet. Thermal output of the waste must be considered in the simulations and can influence the rate and timing of waste package failure, waste form degradation, and fluid flux due to thermal expansion around the repository horizon. To achieve a high-fidelity representation of radionuclide transport in fractures and rock matrix, combined with thermal energy transport and fluid flow in fractures and matrix, the mathematical model is solved numerically in a parallel high-performance computing (HPC) environment on a finite volume unstructured grid consisting of approximately 5 million cells, using Geologic Disposal Safety Assessment (GDSA) Framework (https://pa.sandia.gov), an open-source performance assessment tool for deep underground disposal of nuclear waste. GDSA Framework uses PFLOTRAN to solve the balance equations on a three-dimensional grid with heterogeneous properties, using multiple processors in a parallel configuration based on domain decomposition. The fracture networks in these simulations are originally generated as discrete fracture networks (DFNs), which are sets of two-dimensional planes distributed in a three-dimensional domain. The method used in GDSA Framework maps the stochastically generated DFN to an equivalent continuous porous medium (ECPM) domain that allows for the simulation of coupled heat flow, fluid flow, and radionuclide transport, including heat conduction through the matrix of the fractured rock, which is a process not easily modeled in a DFN representation. Computational efficiency is also greatly enhanced using the ECPM method, allowing for a realistic representation and analysis of uncertainties in a multi-realization performance assessment of a deep geologic repository. The effect of fracture connectivity on the waste isolation safety function, as brought to light by these GDSA Framework simulations, points to the importance of including a realistic representation of uncertainties in fracture properties and distribution (effectively, uncertainty in spatial heterogeneity) in repository safety assessment simulations. (authors)
Hydrologic processes interact with geomorphic patterns to create the spatial and temporal variation in riverine habitat that affects the distribution of aquatic species throughout stream networks. The process domains concept (PDC) states that longitudinally-abrupt changes in geomorphic processes along streams determine temporal patterns of natural disturbance that influence the distribution of stream organisms. Despite its potential generality, the PDC has been applied primarily to mountain streams of western North America. We tested the utility of the PDC as a conceptual framework for characterizing spatiotemporal variability in abiotic conditions and assessed the influence of process domains (PDs) on community composition of fishes and mussels along a fifth order river mainstem in the gulf coastal plain of the southeastern United States. We measured channel cross sections at three transects nested within three sites nested within three stream reaches to quantify multi-scale spatial variability in channel geomorphology along the mainstem of the Neches River, Texas, USA. Next, we modeled stage-dependent channel hydraulics to quantify temporal variability in habitat area and benthic disturbance. Lastly, we sampled fishes and mussels at each site and tested whether PDs correlate with spatial variation in taxonomic and functional community composition. Channel cross-sectional dimensions varied at the reach scale and affected the modeled temporal variability in habitat area and benthic disturbance. This interaction between channel geomorphology and disturbance regime indicated the presence of distinct PDs at the reach scale. Taxonomic composition of fishes did not differ among reaches, whereas abundance and richness of mussels were strongly reduced in the upper reach compared to the middle and lower reaches. Only slight differences in functional traits of fishes and mussels were apparent among reaches, suggesting that reach scale PDs do not influence community composition via the filtering of these functional traits. This study provides empirical evidence that the PDC is a useful framework for describing hydrogeomorphic conditions and mussel abundance and richness and can guide channel restorations in streams draining regions of low topography.
This article provides an in-depth analysis of blockchain research in the energy sector, focusing on projects funded by the U.S. Department of Energy (DOE) and comparing them with industry-funded initiatives. A total of 110 funded activities within the U.S. power industry were successfully tracked and mapped into a newly developed categorization framework. This framework is designed to help research agencies to systematically understand their funded portfolio. Such characterization is expected to help them make effective investments, identify research gaps, measure impact, and advance technological progress to meet national goals. In line with this need, the proposed framework proposes a 2-D categorization matrix to systematically classify blockchain efforts within the energy sector.Under the proposed framework, the Energy System Domain serves as the primary classification dimension, categorizing use cases into 30 distinct applications. The second dimension, Blockchain Properties, captures the specific needs and functionalities provided by Blockchain technology. The aim was to capture blockchain’s applicability and functionality: where and why blockchain? Principles behind the selection of the viewpoint dimensions were carefully defined based on consensus obtained through the Blockchain for Optimized Security and Energy Management (BLOSEM) project. The mapped results show that activities within the Grid Automation, Coordination, and Control (31.8%), Marketplaces and Trading (25.5%), Foundational Blockchain Research (19.1%), and Supply Chain Management (17.3%) domains have been actively pursued to date. The three leading specific use case applications were identified as Transactive Energy Management for Marketplaces and Trading, Asset Management for Supply Chain Management, and Fundamental Blockchain for Foundational Blockchain Research. The Marketplaces and Trading and Retail Services Enablement domains stood out as being favored by industry by a factor greater than 2 (2.3 and 2.6, respectively), yet there seemed to be little to zero investment from DOE. Approximately 76% of the total projects prioritized Immutability, Identity Management, and Decentralization and/or Disintermediation compared to Asset Digitization and/or Tokenization, Automation, and Privacy and/or Anonymity. The greatest discrepancies between DOE and industry were in Asset Digitization and/or Tokenization and Automation. The industry efforts (36% in Asset Digitization/Tokenization and 22% in Automation) was 14 times and 2.4 times, respectively, more intensive than the DOE-sponsored efforts, indicating a significant discrepancy in industry versus government priorities. Overall, quantifying DOE-sponsored projects and industry activities through mapping provides clarity on portfolio investments and opportunities for future research.
This paper describes the Integrated Grid Modeling System (IGMS), a novel electric power system modeling platform for integrated transmission-distribution analysis that co-simulates off-the-shelf tools on high performance computing (HPC) platforms to offer unprecedented resolution from ISO markets down to appliances and other end uses. Specifically, the system simultaneously models hundreds or thousands of distribution systems in co-simulation with detailed Independent System Operator (ISO) markets and AGC-level reserve deployment. IGMS uses a new MPI-based hierarchical co-simulation framework to connect existing sub-domain models. Our initial efforts integrate opensource tools for wholesale markets (FESTIV), bulk AC power flow (MATPOWER), and full-featured distribution systems including physics-based end-use and distributed generation models (many instances of GridLAB-D[TM]). The modular IGMS framework enables tool substitution and additions for multi-domain analyses. This paper describes the IGMS tool, characterizes its performance, and demonstrates the impacts of the coupled simulations for analyzing high-penetration solar PV and price responsive load scenarios.
Improvements in redox flow battery (RFB) performance and durability can be achieved through the development of new active materials, electrolytes, and membranes. While a rich design space exists for emerging materials, complex tradeoffs challenge the articulation of unambiguous target criteria, as the relationships between component selection and cycling performance are multifaceted. Here, we derive zero-dimensional, analytical expressions for mass balances and cell voltages under galvanostatic cycling, enabling direct connections between material/electrolyte properties, cell operating conditions, and resulting performance metrics (e.g., energy efficiency, capacity fade). To demonstrate the utility of this modeling framework, we highlight several considerations for RFB design, including upper bound estimation, active species decay, and membrane/separator conductivity-selectivity tradeoffs. Furthermore, we also discuss modalities for extending this framework to incorporate kinetic losses, distributed ohmic losses, and multiple spatial domains. Importantly, because the mass balances are solved analytically, hundreds of cycles can be simulated in seconds, potentially facilitating detailed parametric sweeps, system optimization, and parameter estimation from cycling experiments. More broadly, this approach provides a means for assessing the impact of cell components that simultaneously influence multiple performance-defining processes, aiding in the elucidation of key descriptors and the identification of favorable materials combinations for specific applications.
Many disciplines such as biology, economics, engineering, physics, and the social sciences represent their data as graphs to capture patterns, trends, and associations. There are are many commercially available graph libraries in different programming languages to analyze these complex graphs. But there is no distributed graph library package in R - the popular statistical programming language to analyze graphs that bigger than a single machine's memory. Many domain experts prefer R over the numerous other alternatives. Towards this, we present a distributed graph analytics framework for R called programming with big graph using R (pBGR.) Our proposed framework leverages the Programming with Big Data in R (pbdR) ecosystem that provides scalable R packages for distributed computing in data science. We present an early prototype implementation of this framework using the distributed-memory parallel graph library CombBLAS and evaluate the framework's performance on leadership class computing platforms. Our experimental results demonstrate that the proposed framework is capable of performing large-scale parallel graph mining through the easyto-use R language. This enhanced graph processing capability coupled with other statistical tools already available in R, should be valuable to many domain experts.
ABSTRACT Motivation Biomedical machine reading comprehension (biomedical-MRC) aims to comprehend complex biomedical narratives and assist healthcare professionals in retrieving information from them. The high performance of modern neural network-based MRC systems depends on high-quality, large-scale, human-annotated training datasets. In the biomedical domain, a crucial challenge in creating such datasets is the requirement for domain knowledge, inducing the scarcity of labeled data and the need for transfer learning from the labeled general-purpose (source) domain to the biomedical (target) domain. However, there is a discrepancy in marginal distributions between the general-purpose and biomedical domains due to the variances in topics. Therefore, direct-transferring of learned representations from a model trained on a general-purpose domain to the biomedical domain can hurt the model’s performance. Results We present an adversarial learning-based domain adaptation framework for the biomedical machine reading comprehension task (BioADAPT-MRC), a neural network-based method to address the discrepancies in the marginal distributions between the general and biomedical domain datasets. BioADAPT-MRC relaxes the need for generating pseudo labels for training a well-performing biomedical-MRC model. We extensively evaluate the performance of BioADAPT-MRC by comparing it with the best existing methods on three widely used benchmark biomedical-MRC datasets—BioASQ-7b, BioASQ-8b and BioASQ-9b. Our results suggest that without using any synthetic or human-annotated data from the biomedical domain, BioADAPT-MRC can achieve state-of-the-art performance on these datasets. Availability and implementation BioADAPT-MRC is freely available as an open-source project at https://github.com/mmahbub/BioADAPT-MRC. Supplementary information Supplementary data are available at Bioinformatics online.
In this work, we explore how the functional response framework can be implemented in pest management. Here, managers take the role of predators foraging on pests and facing monetary costs for survey and control in a spatial domain where the pest distribution and control strategy do not have to be random. To investigate this framework quantitatively, we simulated various management processes on different pest spatial distributions using a spatially-explicit individual-based model and Monte-Carlo simulations, and also confirmed some of the results analytically. By graphing the number of pests controlled versus pest density, we obtained management functional response curves. Whether the management functional response was shaped like a type I, type II or type III functional response depended on the management costs and the search area. Yet, the management spatial strategy and the pest spatial distribution had little effect on the functional response. We applied our model to the management of mountain pine beetle epidemic in Cypress Hills, Saskatchewan, Canada, with simulations matching the real number of attacked trees controlled by managers. We showed how to make an analogy between functional responses in predator–prey interactions and in human–pest interactions and thereby, apply insights from the functional response framework to pest management.
Summary Anomaly detection refers to the identification of patterns in a dataset that do not conform to expected patterns. Such non‐conformant patterns typically correspond to samples of interest and are assigned to different labels in different domains, such as outliers, anomalies, exceptions, and malware. A daunting challenge is to detect anomalies in rapid voluminous streams of data. This paper presents a novel, generic real‐time distributed anomaly detection framework for multi‐source stream data. As a case study, we investigate anomaly detection for a multi‐source VMware‐based cloud data center, which maintains a large number of virtual machines (VMs). This framework continuously monitors VMware performance stream data related to CPU statistics (e.g., load and usage). It collects data simultaneously from all of the VMs connected to the network and notifies the resource manager to reschedule its CPU resources dynamically when it identifies any abnormal behavior from its collected data. A semi‐supervised clustering technique is used to build a model from benign training data only. During testing, if a data instance deviates significantly from the model, then it is flagged as an anomaly. Effective anomaly detection in this case demands a distributed framework with high throughput and low latency. Distributed streaming frameworks like Apache Storm, Apache Spark, S4, and others are designed for a lower data processing time and a higher throughput than standard centralized frameworks. We have experimentally compared the average processing latency of a tuple during clustering and prediction in both Spark and Storm and demonstrated that Spark processes a tuple much quicker than storm on average. Copyright © 2016 John Wiley & Sons, Ltd.
The simulation of multiscale physics is an important challenge for scientific computing. For this class of problem, large three-dimensional simulations are performed to advance scientific inquiry. On massively parallel computing systems, the volume of data generated by such approaches can become a productivity bottleneck if the raw data generated from the simulation is analyzed in a post-processing step. To address this, we present a physics-based framework for in situ data reduction that is theoretically grounded in multiscale averaging theory. We show how task parallelism can be exploited to concurrently perform a variety of analysis tasks with data-dependent costs, including the generation of iso-surfaces, morphological analyses, and connected components analysis. All analyses are performed in parallel using distributed memory and use the same domain decomposition as the simulation. A task management framework is constructed to leverage available parallelism within a node for analysis. The capabilities of the framework are to launch asynchronous analysis threads, manage dependencies between different tasks, promote data locality and minimize the impact of data transfers. The framework is applied to analyze GPU-based simulations of two-fluid-phase flow in porous media, generating a set of averaged measures that represents the overall system behavior. We demonstrate how the approach can be applied to perform physically-consistent analysis over fluid sub-regions determined from connected components analysis. Simulations performed on Oak Ridge National Lab's Titan supercomputer are profiled to demonstrate the performance of the associated multi-threaded in situ analysis approach for typical production simulation of two-fluid-phase flow.
Abstract To improve the predictability of complex computational models in the experimentally-unknown domains, we propose a Bayesian statistical machine learning framework utilizing the Dirichlet distribution that combines results of several imperfect models. This framework can be viewed as an extension of Bayesian stacking. To illustrate the method, we study the ability of Bayesian model averaging and mixing techniques to mine nuclear masses. We show that the global and local mixtures of models reach excellent performance on both prediction accuracy and uncertainty quantification and are preferable to classical Bayesian model averaging. Additionally, our statistical analysis indicates that improving model predictions through mixing rather than mixing of corrected models leads to more robust extrapolations.