Search NASA⌕ Search

SEARCH · Search NASA

Results for “Domain Distributed Framework”

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 217 records · Page 12

Continual coordination through shared activities

Interacting agents that interleave planning and execution must reach consensus on their commitments to each other. In domains where agents have varying degrees of interaction and different constraints on communication and computation, agents will require different coordination protocols in order to efficiently reach consensus in real time. We briefly describe a largely unexplored class of realtime, distributed planning problems (inspired by interacting spacecraft missions), new challenges they pose, and a general approach to solving the problems. These problems involve self-interested agents that have infrequent communication but collaborate on joint activities. We describe a Shared Activity Coordination (SHAC) framework that provides a decentralized algorithm for negotiating the scheduling of shared activities over the lifetimes of separate missions, a soft, real-time approach to reaching consensus during execution with limited communication, and a foundation for customizing protocols for negotiating planner interactions. We apply SHAC to a realistic simulation of interacting Mars missions and illustrate the simplicity of protocol development.

planning↗

Application of the INSTANT-HPS PN Transport Code to the C5G7 Benchmark Problem

INSTANT is the INL's next generation neutron transport solver to support high-fidelity multi-physics reactor simulation INSTANT is in continuous development to extend its capability Code is designed to take full advantage of middle to large cluster (10-1000 processors) Code is designed to focus on method adaptation while also mesh adaptation will be possible. It utilizes the most modern computing techniques to generate a neutronics tool of full-core transport calculations for reactor analysis and design. It can perform calculations on unstructured 2D/3D triangular, hexagonal and Cartesian geometries. Calculations can be easily extended to more geometries because of the independent mesh framework coded with the model Fortran. This code has a multigroup solver with thermal rebalance and Chebyshev acceleration. It employs second-order PN and Hybrid Finite Element method (PNHFEM) discretization scheme. Three different in-group solvers - preconditioned Conjugate Gradient (CG) method, preconditioned Generalized Minimal Residual Method (GMRES) and Red-Black iteration - have been implemented and parallelized with the spatial domain decomposition in the code. The input is managed with extensible markup language (XML) format. 3D variables including the flux distributions are outputted into VTK files, which can be visualized by tools such as VisIt and ParaView. An extension of the code named INSTANTHPS provides the capability to perform 3D heterogeneous transport calculations within fuel pins. C5G7 is an OECD/NEA benchmark problem created to test the ability of modern deterministic transport methods and codes to treat reactor core problems without spatial homogenization. This benchmark problem had been widely analyzed with various code packages. In this transaction, results of the applying the INSTANT-HPS code to the C5G7 problem are summarized.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Using Boosted Decision Trees to Select High Quality Measurements in the Mu2e Experiment at Fermilab

This thesis presents the implementation and evaluation of a Boosted Decision Tree (BDT) model to improve the selection of high-quality track measurements in the Mu2e experiment at Fermilab. The Mu2e experiment is a high-energy physics experiments seeking to observe a rare theoretical physics process known as Charged Lepton Flavor Violation. A significant challenge faced by the Mu2e experiment are so-called background events, which are events whose data mimics that of the rare physics process the experiment seeks to observe. Without a mechanism to reduce background, it would be impossible to know whether Charged Lepton Flavor Violation occurred or not. To this end, high-quality track measurements must be distinguished from low-quality track measurements. A track can be conceived of as the reconstructed path of a particle that traveled through the Mu2e detector. In addition to other data, data about such tracks is stored using a C++-based framework, specific to the domain of high-energy physics, known as ROOT. A boosted decision tree model was trained using ROOT’s Toolkit For Multivariate Analysis by leveraging variables ancillary to track quality. In evaluation, the BDT achieves a ROC-AUC of 0.927 in discriminating good-quality tracks from poor-quality tracks. Such a score is indicative of both strong discrimination and strong generalization. Subsequently, it is shown that applying a BDT-based quality cut to the distribution of particle momenta significantly enhances the signal-to-background distinction for signal electrons, paving the way for improved sensitivity to Charged Lepton Flavor Violation.

Mullany, Brendan T. [Drew U.] (ORCID:0009000818888↗

On the Definition of Surface Potentials for Finite-Difference Operators

For a class of linear constant-coefficient finite-difference operators of the second order, we introduce the concepts similar to those of conventional single- and double-layer potentials for differential operators. The discrete potentials are defined completely independently of any notion related to the approximation of the continuous potentials on the grid. We rather use all approach based on differentiating, and then inverting the differentiation of a function with surface discontinuity of a particular kind, which is the most general way of introducing surface potentials in the theory of distributions. The resulting finite-difference "surface" potentials appear to be solutions of the corresponding continuous potentials. Primarily, this pertains to the possibility of representing a given solution to the homogeneous equation on the domain as a variety of surface potentials, with the density defined on the domain's boundary. At the same time the discrete surface potentials can be interpreted as one specific realization of the generalized potentials of Calderon's type, and consequently, their approximation properties can be studied independently in the framework of the difference potentials method by Ryaben'kii. The motivation for introducing and analyzing the discrete surface potentials was provided by the problems of active shielding and control of sound, in which the aforementioned source terms that drive the potentials are interpreted as the acoustic control sources that cancel out the unwanted noise on a predetermined region of interest.

Tsynkov, S. V.↗

A Distributed Prognostic Health Management Architecture

This paper introduces a generic distributed prognostic health management (PHM) architecture with specific application to the electrical power systems domain. Current state-of-the-art PHM systems are mostly centralized in nature, where all the processing is reliant on a single processor. This can lead to loss of functionality in case of a crash of the central processor or monitor. Furthermore, with increases in the volume of sensor data as well as the complexity of algorithms, traditional centralized systems become unsuitable for successful deployment, and efficient distributed architectures are required. A distributed architecture though, is not effective unless there is an algorithmic framework to take advantage of its unique abilities. The health management paradigm envisaged here incorporates a heterogeneous set of system components monitored by a varied suite of sensors and a particle filtering (PF) framework that has the power and the flexibility to adapt to the different diagnostic and prognostic needs. Both the diagnostic and prognostic tasks are formulated as a particle filtering problem in order to explicitly represent and manage uncertainties; however, typically the complexity of the prognostic routine is higher than the computational power of one computational element ( CE). Individual CEs run diagnostic routines until the system variable being monitored crosses beyond a nominal threshold, upon which it coordinates with other networked CEs to run the prognostic routine in a distributed fashion. Implementation results from a network of distributed embedded devices monitoring a prototypical aircraft electrical power system are presented, where the CEs are Sun Microsystems Small Programmable Object Technology (SPOT) devices.

Bhaskar, Saha↗

Euler-euler anisotropic gaussian mesoscale simulation of homogeneous cluster-induced gas-particle turbulence

An Euler–Euler anisotropic Gaussian approach (EE-AG) for simulating gas–particle flows, in which particle velocities are assumed to follow a multivariate anisotropic Gaussian distribution, is used to perform mesoscale simulations of homogeneous cluster-induced turbulence (CIT). A three-dimensional Gauss–Hermite quadrature formulation is used to calculate the kinetic flux for 10 velocity moments in a finite-volume framework. The particle-phase volume-fraction and momentum equations are coupled with the Eulerian solver for the gas phase. This approach is implemented in an open-source CFD package, OpenFOAM, and detailed simulation results are compared with previous Euler–Lagrange simulations in a domain size study of CIT. Here, these results demonstrate that the proposed EE-AG methodology is able to produce comparable results to EL simulations, and this moment-based methodology can be used to perform accurate mesoscale simulations of dilute gas–particle flows.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Shared Activity Coordination

Interacting agents that interleave planning and execution must reach consensus on their commitments to each other. In domains where agents have varying degrees of interaction and different constraints on communication and computation, agents will require different coordination protocols in order to efficiently reach consensus in real time. We briefly describe a largely unexplored class of real-time, distributed planning problems (inspired by interacting spacecraft missions), new challenges they pose, and a general approach to solving the problems. These problems involve self-interested agents that have infrequent communication but collaborate on joint activities. We describe a Shared Activity Coordination (SHAC) framework that provides a decentralized algorithm for negotiating the scheduling of shared activities in a dynamic environment, a soft, real-time approach to reaching consensus during execution with limited communication, and a foundation for customizing protocols for negotiating planner interactions. We apply SHAC to a realistic simulation of interacting Mars missions and illustrate the simplicity of protocol development.

coordination↗

Architecture for the Next Generation System Management Tools

To get more results or greater accuracy, computational scientists execute their applications on distributed computing platforms such as Clusters, Grids and Clouds. These platforms are different in terms of hardware and software resources as well as locality: some span across multiple sites and multiple administrative domains whereas others are limited to a single site/domain. As a consequence, in order to scale their applica- tions up the scientists have to manage technical details for each target platform. From our point of view, this complexity should be hidden from the scientists who, in most cases, would prefer to focus on their research rather than spending time dealing with platform configuration concerns. In this article, we advocate for a system management framework that aims to automatically setup the whole run-time environment according to the applications needs. The main difference with regards to usual approaches is that they generally only focus on the software layer whereas we address both the hardware and the software expecta- tions through a unique system. For each application, scientists describe their requirements through the definition of a Virtual Platform (VP) and a Virtual System Environment (VSE). Relying on the VP/VSE definitions, the framework is in charge of: (i) the configuration of the physical infrastructure to satisfy the VP requirements, (ii) the setup of the VP, and (iii) the customization of the execution environment (VSE) upon the former VP. We propose a new formalism that the system can rely upon to successfully perform each of these three steps without burdening the user with the specifics of the configuration for the physical resources, and system management tools. This formalism leverages Goldberg s theory for recursive virtual machines by introducing new concepts based on system virtualization (identity, partitioning, aggregation) and emulation (simple, abstraction). This enables the definition of complex VP/VSE configurations without making assumptions about the hardware and the software re- sources. For each requirement, the system executes the corresponding operation with the appropriate management tool. As a proof of concept, we implemented a first prototype that currently interacts with several system management tools (e.g., OSCAR, the Grid 5000 toolkit, and XtreemOS) and that can be easily extended to integrate new resource brokers or cloud systems such as Nimbus, OpenNebula or Eucalyptus for instance.

99 GENERAL AND MISCELLANEOUS↗

Denudation, solute export, landscape evolution modeling, and geographic information system data for the East River watershed, Colorado, USA (2020-2024)

This data package contains geographic information system (GIS) layers and tabular datasets associated with the study of lithologic controls on denudation, solute export, carbon-scaling relationships, and transient landscape evolution in the East River watershed near Crested Butte, Colorado, USA. The package includes GIS layers used to produce the Figure 2 map, including drainage, hillshade, lithology, sample locations, and basin polygons, together with comma-separated value (CSV) tables and matching CSV data dictionaries. One group of tables reports sample-level and catchment-level information for river-sediment samples analyzed for in situ-produced cosmogenic beryllium-10 (10Be), including sample names, outlet elevations, geographic coordinates, upstream drainage area, rock-type classes, production-rate scaling scheme, analyzed nuclide, catchment-averaged denudation rates, and associated lower and upper analytical uncertainties. Sample and catchment attributes provide the basis for comparing denudation rates across intrusive, shale, sedimentary, and mixed-lithology settings. A second group of tables reports supporting information for landscape-evolution modeling and the mapped geologic framework of the study area. Included files list parameter values and definitions for the two-phase landscape-evolution simulations, summarize full-domain model erosion fluxes and topographic metrics for different simulation configurations, provide a fixed-area carbon-model scaling table, and summarize mapped geologic units within the East River study domain, including geologic code, formation name, lithologic description, mapped area, and lithologic class grouping. Model outputs and geologic summaries support interpretation of transient landscape behavior and its relation to the mapped distribution of shale, intrusive, sedimentary, and surficial units. A third group of tables reports hydrologic and hydrochemical information used to quantify dissolved export from the watershed. Included files provide site-level values for drainage area, mean annual solute export, standard error of annual export, area-normalized solute yield, and equivalent weathering rate for five East River monitoring sites, along with metadata describing the number, sampling cadence, and date range of discharge records and partial and full total dissolved solids observations used in the solute-yield analyses. The package also contains a supplementary daily ion-load time series with daily mean discharge, discharge observation counts, dissolved concentrations, and daily loads for calcium, magnesium, sodium, potassium, chloride, sulfate, nitrate, fluoride, dissolved silica, charge-balance bicarbonate, and total dissolved solids. The package contains GIS files, comma-separated value files (.csv), CSV data dictionaries, a file-level metadata table, a package-tree text file, and a readme text file.

10Be↗

Bounding the Failure Probability Range of Polynomial Systems Subject to P-box Uncertainties

This paper proposes a reliability analysis framework for systems subject to multiple design requirements that depend polynomially on the uncertainty. Uncertainty is prescribed by probability boxes, also known as p-boxes, whose distribution functions have free or fixed functional forms. An approach based on the Bernstein expansion of polynomials and optimization is proposed. In particular, we search for the elements of a multi-dimensional p-box that minimize (i.e., the best-case) and maximize (i.e., the worst-case) the probability of inner and outer bounding sets of the failure domain. This technique yields intervals that bound the range of failure probabilities. The offset between this bounding interval and the actual failure probability range can be made arbitrarily tight with additional computational effort.

Crespo, Luis G.↗

Object-constrained meshless deformable algorithm for high speed 3D nonrigid registration between CT and CBCT

Purpose: High-speed nonrigid registration between the planning CT and the treatment CBCT data is critical for real time image guided radiotherapy (IGRT) to improve the dose distribution and to reduce the toxicity to adjacent organs. The authors propose a new fully automatic 3D registration framework that integrates object-based global and seed constraints with the grayscale-based ''demons'' algorithm. Methods: Clinical objects were segmented on the planning CT images and were utilized as meshless deformable models during the nonrigid registration process. The meshless models reinforced a global constraint in addition to the grayscale difference between CT and CBCT in order to maintain the shape and the volume of geometrically complex 3D objects during the registration. To expedite the registration process, the framework was stratified into hierarchies, and the authors used a frequency domain formulation to diffuse the displacement between the reference and the target in each hierarchy. Also during the registration of pelvis images, they replaced the air region inside the rectum with estimated pixel values from the surrounding rectal wall and introduced an additional seed constraint to robustly track and match the seeds implanted into the prostate. The proposed registration framework and algorithm were evaluated on 15 real prostate cancer patients. For each patient, prostate gland, seminal vesicle, bladder, and rectum were first segmented by a radiation oncologist on planning CT images for radiotherapy planning purpose. The same radiation oncologist also manually delineated the tumor volumes and critical anatomical structures in the corresponding CBCT images acquired at treatment. These delineated structures on the CBCT were only used as the ground truth for the quantitative validation, while structures on the planning CT were used both as the input to the registration method and the ground truth in validation. By registering the planning CT to the CBCT, a displacement map was generated. Segmented volumes in the CT images deformed using the displacement field were compared against the manual segmentations in the CBCT images to quantitatively measure the convergence of the shape and the volume. Other image features were also used to evaluate the overall performance of the registration. Results: The algorithm was able to complete the segmentation and registration process within 1 min, and the superimposed clinical objects achieved a volumetric similarity measure of over 90% between the reference and the registered data. Validation results also showed that the proposed registration could accurately trace the deformation inside the target volume with average errors of less than 1 mm. The method had a solid performance in registering the simulated images with up to 20 Hounsfield unit white noise added. Also, the side by side comparison with the original demons algorithm demonstrated its improved registration performance over the local pixel-based registration approaches. Conclusions: Given the strength and efficiency of the algorithm, the proposed method has significant clinical potential to accelerate and to improve the CBCT delineation and targets tracking in online IGRT applications.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Distribution and diversity of enzymes for polysaccharide degradation in fungi

Fungi are important polysaccharide degraders in the environment and for biotechnology. Here, the increasing number of sequenced fungal genomes allowed for systematic identification of genes and proteins involved in polysaccharide degradation in 218 fungi. Globally, 9,003 sequences for glycoside hydrolases and lytic polysaccharide mono-oxygenases targeting cellulose, xylan, and chitin, were identified. Although abundant in most lineages, the distribution of these enzymes is variable even between organisms from the same genus. However, most fungi are generalists possessing several enzymes for polysaccharide deconstruction. Most identified enzymes were small proteins with simple domain organization or eventually consisted of one catalytic domain associated with a non-catalytic accessory domain. Thus unlike bacteria, fungi's ability to degrade polysaccharides relies on apparent redundancy in functional traits and the high frequency of lytic polysaccharide mono-oxygenases, as well as other physiological adaptation such as hyphal growth. Globally, this study provides a comprehensive framework to further identify enzymes for polysaccharide deconstruction in fungal genomes and will help identify new strains and enzymes with potential for biotechnological application.

59 BASIC BIOLOGICAL SCIENCES↗

MPI-FAUN: An MPI-Based Framework for Alternating-Updating Nonnegative Matrix Factorization

Non-negative matrix factorization (NMF) is the problem of determining two non-negative low rank factors W and H, for the given input matrix A, such that A≈WH. NMF is a useful tool for many applications in different domains such as topic modeling in text mining, background separation in video analysis, and community detection in social networks. Despite its popularity in the data mining community, there is a lack of efficient parallel algorithms to solve the problem for big data sets. The main contribution of this work is a new, high-performance parallel computational framework for a broad class of NMF algorithms that iteratively solves alternating non-negative least squares (NLS) subproblems for W and H. It maintains the data and factor matrices in memory (distributed across processors), uses MPI for interprocessor communication, and, in the dense case, provably minimizes communication costs (under mild assumptions). The framework is flexible and able to leverage a variety of NMF and NLS algorithms, including Multiplicative Update, Hierarchical Alternating Least Squares, and Block Principal Pivoting. Our implementation allows us to benchmark and compare different algorithms on massive dense and sparse data matrices of size that spans from few hundreds of millions to billions. We demonstrate the scalability of our algorithm and compare it with baseline implementations, showing significant performance improvements. The code and the datasets used for conducting the experiments are available online.

2D↗

Lowering entry barriers to developing custom simulators of distributed applications and platforms with SimGrid

Researchers in parallel and distributed computing (PDC) often resort to simulation because experiments conducted using a simulator can be for arbitrary experimental scenarios, are less resource-, labor-, and time-consuming than their real-world counterparts, and are perfectly repeatable and observable. Many frameworks have been developed to ease the development of PDC simulators, and these frameworks provide different levels of accuracy, scalability, versatility, extensibility, and usability. Further, the SimGrid framework has been used by many PDC researchers to produce a wide range of simulators for over two decades. Its popularity is due to a large emphasis placed on accuracy, scalability, and versatility, and is in spite of shortcomings in terms of extensibility and usability. Although SimGrid provides sensible simulation models for the common case, it was difficult for users to extend these models to meet domain-specific needs. Furthermore, SimGrid only provided relatively low-level simulation abstractions, making the implementation of a simulator of a complex system a labor-intensive undertaking. In this work we describe developments in the last decade that have contributed to vastly improving extensibility and usability, thus lowering or removing entry barriers for users to develop custom SimGrid simulators.

97 MATHEMATICS AND COMPUTING↗

Symmetry breaking during low-temperature domain formation in micron-sized magnetite crystals

We report the results of synchrotron Bragg Coherent x-ray Diffraction Imaging (BCDI) experiments to investigate domain formation in a micron-sized magnetite crystal undergoing the Verwey transition at low temperature. A strong splitting of the measured 311 Bragg reflection was observed in the low-temperature phase, indicating the formation of domains. BCDI revealed pronounced strain distributions, characterized by a clear layered stripe domain structure in real-space. Stripes were seen only along the [001] crystallographic direction, normal to the substrate surface direction, breaking the symmetry of the cubic high-temperature phase. It is argued that other domain directions were suppressed by the sample mounting orientation. More surprisingly, only a single domain orientation was observed, suggesting an additional symmetry-breaking influence originating from the shape of the crystal. Gaining insight into how thermal effects induce the formation of layered or striped phases offers a valuable framework for understanding the development of mesoscopic domains and strain patterns in functional materials.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A hierarchical analysis of the impact of methodological decisions on statistical downscaling of daily precipitation and air temperatures

Despite the widespread application of statistical downscaling tools, uncertainty remains regarding the role of model formulation in determining model skill for daily maximum and minimum temperature (Tmax and Tmin), and precipitation occurrence and intensity. Impacts of several key aspects of statistical transfer function form on model skill are evaluated using a framework resistant to model overspecification. We focus on: (a) model structure: simple (generalized linear models, GLMs) versus complex (artificial neural networks, ANNs) models. (b) Predictor selection: Fixed number of predictors chosen a priori versus stepwise selection of predictors and inclusion of grid point values versus predictors derived from application of principal components analysis (PCA) to spatial fields. We also examine the influence of domain size on model performance. For precipitation downscaling, we consider the role of the threshold used to characterize a wet day and apply three approaches (Poisson and Gamma distributions in GLM and ANN) to downscale wet-day precipitation amounts. While no downscaling formulation is optimal for all predictands and at 10 locations representing diverse U.S. climates, and due to the exclusion of variance inflation all of the downscaling formulations fail to reproduce the range of observed variability, models with larger suites of prospective predictors generally have higher skill. For temperature downscaling, ANNs generally outperform GLM, with greater improvements for T min than T max . Furthermore, use of PCA-derived predictors does not systematically improve model skill, but does improve skill for temperature extremes. Model skill for precipitation occurrence generally increases as the wet-day threshold increases and models using PCA-derived predictors tend to outperform those based on grid cell predictors. Each model for wet-day precipitation intensity overestimates annual total precipitation and underestimates the proportion derived from extreme precipitation events, but ANN-based models and those with larger predictor suites tend to have the smallest bias.

54 ENVIRONMENTAL SCIENCES↗

Enhanced molecular dynamics for simulating porous interphase layers in batteries.

Understanding charge transport processes at a molecular level using computational techniques is currently hindered by a lack of appropriate models for incorporating anistropic electric fields in molecular dynamics (MD) simulations. An important technological example is ion transport through solid-electrolyte interphase (SEI) layers that form in many common types of batteries. These layers regulate the rate at which electro-chemical reactions occur, affecting power, safety, and reliability. In this work, we develop a model for incorporating electric fields in MD using an atomistic-to-continuum framework. This framework provides the mathematical and algorithmic infrastructure to couple finite element (FE) representations of continuous data with atomic data. In this application, the electric potential is represented on a FE mesh and is calculated from a Poisson equation with source terms determined by the distribution of the atomic charges. Boundary conditions can be imposed naturally using the FE description of the potential, which then propagates to each atom through modified forces. The method is verified using simulations where analytical or theoretical solutions are known. Calculations of salt water solutions in complex domains are performed to understand how ions are attracted to charged surfaces in the presence of electric fields and interfering media.

25 ENERGY STORAGE↗

A Wind-Driven Snow Redistribution Module for Alpine3d V3.3.0: Adaptations Designed for Downscaling Ice Sheet Surface Mass Balance

Ice sheets gain mass via snow accumulation at the ice sheet surface, which is the primary component of surface mass balance. On the Antarctic ice sheet, winds redistribute snow resulting in surface mass balance that is variable in both space and time. Representing wind-driven snow redistribution processes in models is critical for local assessments of surface mass balance, repeat altimetry studies, and interpretation of ice core accumulation records. To this end, we have adapted Alpine3D, an existing distributed snow modeling framework, to downscale Antarctic surface mass balance to horizontal resolutions up to 1 km. In particular, we have introduced a new two-dimensional advection-based wind-driven snow redistribution module that is driven by an offline coupling between WindNinja, a wind downscaling model, and Alpine3D. We then show that large accumulation variability can be at least partially explained by terrain-induced wind speed variations which subsequently redistribute snow around rolling topography. By comparing Alpine3D to airborne-derived snow accumulation measurements within a testing domain over Pine Island Glacier in West Antarctica, we demonstrate that our Alpine3D downscaling approach improves surface mass balance estimates when compared to MERRA-2, a global atmospheric reanalysis which we use as atmospheric forcing. In particular, when compared to MERRA-2, Alpine3D reduces simulated surface mass balance root mean squared error by 23.4 mm w.e.yr−1 (13%) and increases variance explained by 24%. Despite these improvements, Alpine3D still underestimates observed accumulation variability, thus providing an opportunity for future model improvement.

Eric Keenan↗