Search NASA⌕ Search

SEARCH · Search NASA

Results for “partitioned algorithm”

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 433 records · Page 24

Experimental study on kinetic oxidation of graphite IG-110 by steam

Graphite is proposed for use in High-temperature Gas-cooled Reactors (HTGRs) as the fuel matrix, neutron moderator/reflector, and core structural material. One important property of nuclear grade graphite is their resistance to oxidation in high-temperature environment. Extensive investigation has been performed in the literature for graphite oxidation by air. However, available experimental data are still limited for graphite oxidation by steam under conditions comparable to a postulated steam ingress accident in HTGRs. In this study, the oxidation rate of graphite IG-110 by steam was measured at temperatures from 850 to 1100 °C with the steam partial pressure varying from 0.5 to 20.0 kPa and the hydrogen partial pressure varying from 0 to 2.0 kPa. Further analysis confirms the oxidation process in this present study is dominated by the chemical kinetics, which lends credit to the data for being used to develop numerical models. It was observed that the increase of the kinetic oxidation rate with the steam partial pressure tends to become less apparent if the steam partial pressure keeps increasing. In addition, it was found that the partitioning of hydrogen inhibits the graphite-steam reaction process even with the steam partial pressure up to 20.0 kPa. However, this inhibiting effect starts to become saturated when the hydrogen partial pressure exceeds 1.0 kPa. The oxidation rates were fitted to the conventional Langmuir-Hinshelwood (LH) and Boltzmann-enhanced Langmuir-Hinshelwood (BLH) models by a multivariable optimization algorithm. The BLH model exhibits a better accuracy than the LH model within the specified experimental conditions. The predicted oxidation rate using the BLH model shows a mean relative difference of about 24% with the maximum difference of about 55% when compared with our experimental data.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Dissecting molecular descriptors into atomic contributions in density functional reactivity theory

Density functional reactivity theory (DFRT) employs the electron density of a molecule and its related quantities such as gradient and Laplacian to describe its structure and reactivity properties. Proper descriptions at both molecular (global) and atomic (local) levels are equally important and illuminating. In this work, we make use of Bader's zero-flux partition scheme and consider atomic contributions for a few global reactivity descriptors in DFRT, including the density-based quantification of steric effect and related indices. Earlier, we proved that these quantities are intrinsically correlated for atomic and molecular systems [S. B. Liu, J. Chem. Phys. 126, 191107 (2007); ibid. 126, 244103 (2007)]. In this work, a new basin-based integration algorithm has been implemented, whose reliability and effectiveness have been extensively examined. We also investigated a list of simple hydrocarbon systems and different scenarios of bonding processes, including stretching, bending, and rotating. Interesting changing patterns for the atomic and molecular values of these quantities have been revealed for different systems. This work not only confirms the strong correlation between these global reactivity descriptors for molecular systems, as theoretically proven earlier by us, it also provides new and unexpected changing patterns for their atomic values, which can be employed to understand the origin and nature of chemical phenomena.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Performance Results on CPU/GPU Exascale Architectures for OMEGA: The Ocean Model for E3SM Global Applications

The US Department of Energy (DOE) conducts climate simulations on some of the world’s largest supercomputers. These exascale machines use heterogeneous architectures with both CPUs and GPUs, and scientific codes must adapt to make full use of this computing power. Los Alamos National Lab is developing Omega: The Ocean Model for E3SM Global Applications, which is specifically designed for modern exascale computers. It uses external libraries that have been optimized for a variety of architectures to run on different supercomputers. Omega is an unstructured-mesh ocean model based on TRiSK numerical methods. It will be the new ocean component of the DOE’s Energy Exascale Earth System Model (E3SM). The algorithms in Omega follow those of the current ocean component, MPAS-Ocean, but it will be written in C++ rather than Fortran to take advantage of the Kokkos performance portability library. Omega spatial operators are written as Kokkos kernels to run efficiently on both CPUs and GPUs. Work on Omega began in 2023 with a new C++ framework for unstructured mesh partitioning, halo exchanges, parallel IO, and Kokkos interfaces. The current version, Omega-0, is being developed to solve the shallow water equations and at present includes all of the tendency terms but not time stepping. Here we share the results of Omega-0 verification and performance testing. Verification includes unit tests implemented with CTest as well as convergence tests in Polaris, an in-house python package with a large suite of test problems. Performance tests compare simulations conducted on CPUs versus GPUs and across different architectures: tests are run on Frontier, which has AMD “Optimized 3rd Gen EPYC” CPUs and AMD MI250X GPUs, as well as Perlmutter, which is composed of AMD EPYC 7763 CPUs and NVIDIA A100 GPUs.

58 GEOSCIENCES↗

PCAfold 2.0—Novel tools and algorithms for low-dimensional manifold assessment and optimization

We describe an update to our open-source Python package, PCAfold, designed to help researchers generate, analyze and improve low-dimensional data manifolds. In the current version, PCAfold 2.0, we introduce novel tools and algorithms for assessing and optimizing low-dimensional manifolds. This includes a method that generates a “map” of local feature sizes that can help pinpoint researchers to problematic regions on a manifold. We introduce a novel cost function that characterizes the quality of a manifold topology with a single number. We develop two algorithms for feature selection based on principal component analysis (PCA) that use the cost function as an objective function to minimize. We introduce a quantity of interest (QoI)-aware dimensionality reduction strategy where data projections are computed using an artificial neural network and are directly optimized towards representing various projection-independent and projection-dependent QoIs. We also introduce an implementation of partition of unity networks (POUnets) for efficient reconstruction of QoIs from low-dimensional manifolds based on combining neural network classification with localized polynomial regression. Our software can be broadly applicable in all domains of science and engineering that aim to reduce data dimensionality, as well as in the fundamental research on representation learning.

97 MATHEMATICS AND COMPUTING↗

Modeling the partitioning of amphiphilic molecules and co-solvents in biomembranes

We report amphiphilic co-solvents can have a significant impact on the structure, organization and physical properties of lipid bilayers. Describing the mutual impact of partitioning and induced structure changes is therefore a crucial consideration for a range of topics such as anesthesia and other pharmacokinetic effects, as well as microbial solvent tolerance in the production of biofuels and other fermentation products, where molecules such as ethanol, butanol or acetic acid might be generated. Small-angle neutron scattering (SANS) is a key method for studying lipid and polymer bilayer structures, with many models for extracting bilayer structure (thickness, area per lipid etc.) from scattering data in use today. However, the molecular details of co-solvent partitioning are conflated with induced changes to bilayer structure, making interpretation and modeling of the scattering curves a challenge with the existing set of models. To address this, a model of a bilayer structure is presented which invokes a two-term partition constant accounting for the localization of the co-solvent within the bilayer. This model was validated using a series of SANS measurements of lipid vesicles in the presence of the co-solvent tetrahydrofuran (THF), showing several strategies of how to deploy the two-parameter partition constant model to describe scattering data and extract both structure and partitioning information from the data. Molecular dynamics simulations are then used to evaluate assumptions of the model, provide additional molecular scale details and illustrate its complementary nature to the data fitting procedure. This approach results in estimates of the partition coefficient for THF in 1,2-dimyristoyl-sn-glycero-3-phosphocholine at 35°C, along with an estimate of the fraction of THF residing in the hydrophobic core of the membrane. The authors envision that this model will be applicable to a wide range of other bilayer/amphiphile interactions and provide the associated code needed to implement this model as a fitting algorithm for scattering data in the SasView suite.

59 BASIC BIOLOGICAL SCIENCES↗

Gauging Variational Inference

Computing partition function is the most important statistical inference task arising in applications of Graphical Models (GM). Since it is computationally intractable, approximate methods have been used to resolve the issue in practice, where meanfield (MF) and belief propagation (BP) are arguably the most popular and successful approaches of a variational type. In this paper, we propose two new variational schemes, coined Gauged-MF (G-MF) and Gauged-BP (G-BP), improving MF and BP, respectively. Both provide lower bounds for the partition function by utilizing the so-called gauge transformation which modifies factors of GM while keeping the partition function invariant. Moreover, we prove that both G-MF and G-BP are exact for GMs with a single loop of a special structure, even though the bare MF and BP perform badly in this case. Our extensive experiments, on complete GMs of relatively small size and on large GM (up-to 300 variables) confirm that the newly proposed algorithms outperform and generalize MF and BP.

97 MATHEMATICS AND COMPUTING↗

Scalable Bayesian Nonparametric Clustering and Classification

We develop a scalable multi-step Monte Carlo algorithm for inference under a large class of nonparametric Bayesian models for clustering and classification. Each step is “embarrassingly parallel” and can be implemented using the same Markov chain Monte Carlo sampler. The simplicity and generality of our approach makes inference for a wide range of Bayesian nonparametric mixture models applicable to large datasets. Specifically, we apply the approach to inference under a product partition model with regression on covariates. We show results for inference with two motivating data sets: a large set of electronic health records (EHR) and a bank telemarketing dataset. We find interesting clusters and competitive classification performance relative to other widely used competing classifiers. Supplementary materials for this article are available online.

97 MATHEMATICS AND COMPUTING↗

Causation entropy from symbolic representations of dynamical systems

Identification of causal structures and quantification of direct information flows in complex systems is a challenging yet important task, with practical applications in many fields. Data generated by dynamical processes or large-scale systems are often symbolized, either because of the finite resolution of the measurement apparatus, or because of the need of statistical estimation. By algorithmic application of causation entropy, we investigated the effects of symbolization on important concepts such as Markov order and causal structure of the tent map. We uncovered that these quantities depend nonmonotonically and, most of all, sensitively on the choice of symbolization. Indeed, we show that Markov order and causal structure do not necessarily converge to their original analog counterparts as the resolution of the partitioning becomes finer.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Identification of Mission Sensitivities with Mission Modeling from the One System Organization at Hanford - 13292

The Hanford site in southeast Washington contains approximately 207 million liters of radioactive and hazardous waste stored in 177 underground tanks. The U.S. Department of Energy's Office of River Protection is currently managing the Hanford waste treatment mission, which includes the storage, retrieval, treatment and disposal of the tank waste. Two recent studies, employing the modeling tools managed by the One System organization, have highlighted waste cleanup mission sensitivities. The Hanford Tank Waste Operations Simulator Sensitivity Study evaluated the impact that varying 21 different parameters had on the Hanford Tank Waste Operations Simulator model. It concluded that inaccuracies in the predicted phase partitioning of a few key components can result in significant changes in the waste treatment duration and in the amount of immobilized high-level waste that is produced. In addition, reducing the efficiency with which tank waste is retrieved and staged can increase mission duration. The 2012 WTP Tank Utilization Assessment concluded that flowsheet models need to include the latest low-activity waste glass algorithms or the waste treatment mission duration and the amount of low activity waste that is produced could be significantly underestimated. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Serial crystallography with multi-stage merging of thousands of images

KAMO and BLEND provide particularly effective tools to automatically manage the merging of large numbers of data sets from serial crystallography. The requirement for manual intervention in the process can be reduced by extending BLEND to support additional clustering options such as the use of more accurate cell distance metrics and the use of reflection-intensity correlation coefficients to infer `distances' among sets of reflections. This increases the sensitivity to differences in unit-cell parameters and allows clustering to assemble nearly complete data sets on the basis of intensity or amplitude differences. If the data sets are already sufficiently complete to permit it, one applies KAMO once and clusters the data using intensities only. When starting from incomplete data sets, one applies KAMO twice, first using unit-cell parameters. In this step, either the simple cell vector distance of the original BLEND or the more sensitive NCDist is used. This step tends to find clusters of sufficient size such that, when merged, each cluster is sufficiently complete to allow reflection intensities or amplitudes to be compared. One then uses KAMO again using the correlation between reflections with a common hkl to merge clusters in a way that is sensitive to structural differences that may not have perturbed the unit-cell parameters sufficiently to make meaningful clusters. Many groups have developed effective clustering algorithms that use a measurable physical parameter from each diffraction still or wedge to cluster the data into categories which then can be merged, one hopes, to yield the electron density from a single protein form. Since these physical parameters are often largely independent of one another, it should be possible to greatly improve the efficacy of data-clustering software by using a multi-stage partitioning strategy. Here, one possible approach to multi-stage data clustering is demonstrated. The strategy is to use unit-cell clustering until the merged data are sufficiently complete and then to use intensity-based clustering. Using this strategy, it is demonstrated that it is possible to accurately cluster data sets from crystals that have subtle differences.

36 MATERIALS SCIENCE↗

A Parallel Solver for Graph Laplacians

Problems from graph drawing, spectral clustering, network flow and graph partitioning can all be expressed in terms of graph Laplacian matrices. There are a variety of practical approaches to solving these problems in serial. However, as problem sizes increase and single core speeds stagnate, parallelism is essential to solve such problems quickly. We present an unsmoothed aggregation multigrid method for solving graph Laplacians in a distributed memory setting. We introduce new parallel aggregation and low degree elimination algorithms targeted specifically at irregular degree graphs. These algorithms are expressed in terms of sparse matrix-vector products using generalized sum and product operations. This formulation is amenable to linear algebra using arbitrary distributions and allows us to operate on a 2D sparse matrix distribution, which is necessary for parallel scalability. Our solver outperforms the natural parallel extension of the current state of the art in an algorithmic comparison. We demonstrate scalability to 576 processes and graphs with up to 1.7 billion edges.

Konolige, Tristan↗

Office of River Protection Advanced Low-Activity Waste Glass Research and Development Plan

The U.S. Department of Energy Office of River Protection (ORP) has initiated and leads an integrated Advanced Waste Glass (AWG) program to increase the loading of Hanford tank wastes in glass while meeting melter lifetime expectancies and process, regulatory, and product performance requirements. The integrated ORP program is focused on providing a technical, science-based foundation for making key decisions regarding the successful operation of the Hanford Tank Waste Treatment and Immobilization Plant (WTP) facilities in the context of an optimized River Protection Project (RPP) flowsheet. The fundamental data stemming from this program will support development of advanced glass formulations, key product performance and process control models, and tactical processing strategies to ensure safe and successful operations for both the low-activity waste (LAW) and high-level waste vitrification facilities. These activities will be conducted with the objective of improving the overall RPP mission by enhancing flexibility and reducing cost and schedule. The purpose of this advanced LAW glass research and development plan is to identify the near-term, mid-term, and longer-term research and development activities required to develop and validate advanced LAW glasses, property-composition models and their uncertainties, and an advanced glass algorithm to support WTP facility operations, including both Direct Feed LAW and full pretreatment flowsheets. Data are needed to develop, validate, and implement 1) new glass property-composition models and 2) a new glass formulation algorithm. Hence, this plan integrates specific studies associated with increasing the Na2O and SO3/halide concentrations in glass, because these components will ultimately dictate waste loadings for LAW vitrification. Of equal importance is the development of an efficient and economic strategy for 99Tc management. Specific and detailed studies are being implemented to understand the fate of Tc throughout the WTP flowsheet and the underlying mechanisms that dictate its partitioning between streams within the LAW vitrification facility. These studies are aimed at increasing the single-pass Tc retention in glass and the potential use of high-temperature mineral phases to capture Tc. The Tc-bearing mineral phases would be thermally stable and resistant to Tc release during feed melting reactions or they could serve as alternative waste forms. The LAW glass research and development is focused on reducing the total volume of LAW glass produced and minimizing the impact of (or potentially eliminating) the need for recycle.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Triangle Counting with Cyclic Distributions

Triangles are the simplest non-trivial subgraphs and triangle counting is used in a number of different applications. The order in which vertices are processed in triangle counting strongly effects the amount of work that needs to be done (and thus the overall performance). Ordering vertices by degree has been shown to be one particularly effective ordering approach. However, for graphs with skewed degree distributions (such as power-law graphs), ordering by degree effects the distribution of work; parallelization must account for this distribution in order to balance work among workers. In this paper we provide an in- depth analysis of the ramifications of degree-based ordering on parallel triangle counting. We present approach for partitioning work in triangle counting, based on cyclic distribution and some surprisingly simple C++ implementations. Experimental results demonstrate the effectiveness of our approach, particularly for power-law (and social network) graphs.

Graph algorithms, parallel algorithms↗

Tuning collective communication for Partitioned Global Address Space programming models

Partitioned Global Address Space (PGAS) languages offer programmers the convenience of a shared memory programming style combined with locality control necessary to run on large-scale distributed memory systems. Even within a PGAS language programmers often need to perform global communication operations such as broadcasts or reductions, which are best performed as collective operations in which a group of threads work together to perform the operation. In this study we consider the problem of implementing collective communication within PGAS languages and explore some of the design trade-offs in both the interface and implementation. In particular, PGAS collectives have semantic issues that are different than in send–receive style message passing programs, and different implementation approaches that take advantage of the one-sided communication style in these languages. We present an implementation framework for PGAS collectives as part of the GASNet communication layer, which supports shared memory, distributed memory and hybrids. The framework supports a broad set of algorithms for each collective, over which the implementation may be automatically tuned. In conclusion, we demonstrate the benefit of optimized GASNet collectives using application benchmarks written in UPC, and demonstrate that the GASNet collectives can deliver scalable performance on a variety of state-of-the-art parallel machines including a Cray XT4, an IBM BlueGene/P, and a Sun Constellation system with InfiniBand interconnect.

97 MATHEMATICS AND COMPUTING↗

Man-made objects cuing in satellite imagery

We present a multi-scale framework for man-made structures cuing in satellite image regions. The approach is based on a hierarchical image segmentation followed by structural analysis. A hierarchical segmentation produces an image pyramid that contains a stack of irregular image partitions, represented as polygonized pixel patches, of successively reduced levels of detail (LOOs). We are jumping off from the over-segmented image represented by polygons attributed with spectral and texture information. The image is represented as a proximity graph with vertices corresponding to the polygons and edges reflecting polygon relations. This is followed by the iterative graph contraction based on Boruvka's Minimum Spanning Tree (MST) construction algorithm. The graph contractions merge the patches based on their pairwise spectral and texture differences. Concurrently with the construction of the irregular image pyramid, structural analysis is done on the agglomerated patches. Man-made object cuing is based on the analysis of shape properties of the constructed patches and their spatial relations. The presented framework can be used as pre-scanning tool for wide area monitoring to quickly guide the further analysis to regions of interest.

97 MATHEMATICS AND COMPUTING↗

A generalized multi-resolution expansion for uncertainty propagation with application to cardiovascular modeling

Computational models are used in a variety of fields to improve our understanding of complex physical phenomena. Recently, the realism of model predictions has been greatly enhanced by transitioning from deterministic to stochastic frameworks, where the effects of the intrinsic variability in parameters, loads, constitutive properties, model geometry and other quantities can be more naturally included. A general stochastic system may be characterized by a large number of arbitrarily distributed and correlated random inputs, and a limited support response with sharp gradients or event discontinuities. This motivates continued research into novel adaptive algorithms for uncertainty propagation, particularly those handling high dimensional, arbitrarily distributed random inputs and non-smooth stochastic responses. Here, we generalize a previously proposed multi-resolution approach to uncertainty propagation to develop a method that improves computational efficiency, can handle arbitrarily distributed random inputs and non-smooth stochastic responses, and naturally facilitates adaptivity, i.e., the expansion coefficients encode information on solution refinement. Our approach relies on partitioning the stochastic space into elements that are subdivided along a single dimension, or, in other words, progressive refinements exhibiting a binary tree representation. We also show how these binary refinements are particularly effective in avoiding the exponential increase in the multi-resolution basis cardinality and significantly reduce the regression complexity for moderate to high dimensional random inputs. The performance of the approach is demonstrated through previously proposed uncertainty propagation benchmarks and stochastic multi-scale finite element simulations in cardiovascular flow.

59 BASIC BIOLOGICAL SCIENCES↗

Probabilistic partition of unity networks for high–dimensional regression problems

We explore the probabilistic partition of unity network (PPOU-Net) model in the context of high-dimensional regression problems and propose a general framework focusing on adaptive dimensionality reduction. With the proposed framework, the target function is approximated by a mixture of experts model on a low-dimensional manifold, where each cluster is associated with a fixed-degree polynomial. We present a training strategy that leverages the expectation maximization (EM) algorithm. During the training, we alternate between (i) applying gradient descent to update the DNN coefficients; and (ii) using closed-form formulae derived from the EM algorithm to update the mixture of experts model parameters. Under the probabilistic formulation, step (ii) admits the form of embarrassingly paralleliazable weighted least-squares solves. The PPOU-Nets consistently outperform the baseline fully-connected neural networks of comparable sizes in numerical experiments of various data dimensions. Here, we also explore the proposed model in applications of quantum computing, where the PPOU-Nets act as surrogate models for cost landscapes associated with variational quantum circuits.

97 MATHEMATICS AND COMPUTING↗

Detector Response Function and Directional Gamma-Ray Source Calculations for Polaris

A Directional Unfolded Source Term (DUST) method was developed to compute directionally resolved gamma-ray source terms based on back-projection spectra synthesized by Compton Cameras. Spectral features in the unprocessed spectra are indistinct primarily because the rotational angles for the conical projections cannot be determined, so probability distributions are constructed from overlapping cones. The DUST method uses an angular response function to compute a covariance matrix, which is used to process count rates in back-projection spectra by linear regression to partition the gamma-rays among several spatial regions. This method was applied to analyze data collected by the Polaris detector during an evaluation that was conducted at Oak Ridge National Laboratory (ORNL). The evaluation includes measurements of calibration sources with angular separations ranging from 1° to more than 50°. Measurements were also performed for cylindrical depleted uranium castings and a 137 Cs source inside a large polyethylene sphere. The DUST algorithm was able to differentiate gamma-rays emitted by 137 Cs and 60 Co when the sources were separated by less than 2°, but separation greater than 10° was required to isolate the 133 Ba emission from gamma-rays emitted by the other sources. The computed source terms were consistent with emission profiles from the calibration sources and from models of the spatially-extended sources. Methods for viewing radiation profiles were also evaluated because user input is required to select spatial regions of interest.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗