Search NASA⌕ Search

SEARCH · Search NASA

Results for “distributed 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 883 records · Page 49

MCCCS-MN

The MCCCS‒MN (Monte Carlo for Complex Chemical Systems‒Minnesota) software is developed by the Siepmann research group at the University of Minnesota. MCCCS‒MN allows for the simulation of multi-component molecular systems in the canonical, isobaric-isothermal (including constant stress for solids), grand-canonical, semi-grand, and Gibbs (NVT, NPT, and more than two simulation boxes) ensembles. It uses the configurational-bias Monte Carlo method to efficiently sample phase space for linear, branched and cyclic chain molecules, the adiabatic nuclear and electronic sampling Monte Carlo method to treat many-body polarization effects, and the aggregation-volume-bias Monte Carlo algorithm to efficiently sample the spatial distribution of associating molecules. MCCCS-MN employs a molecular representation of the system where force fields contain bonded and non-bonded terms. Funding for the development of MCCCS-MN through grants from the National Science Foundation (simulation of fluid phase equilibria and chromatography) and the Department of Energy (simulation of adsorption equilibria) is gratefully acknowledged.

Siepmann, J.Ilja [University of Minnesota - Twin C↗

Emulator-Based Bayesian Calibration of the CISNET Colorectal Cancer Models

Purpose To calibrate Cancer Intervention and Surveillance Modeling Network (CISNET)'s SimCRC, MISCAN-Colon, and CRC-SPIN simulation models of the natural history colorectal cancer (CRC) with an emulator-based Bayesian algorithm and internally validate the model-predicted outcomes to calibration targets.Methods We used Latin hypercube sampling to sample up to 50,000 parameter sets for each CISNET-CRC model and generated the corresponding outputs. We trained multilayer perceptron artificial neural networks (ANNs) as emulators using the input and output samples for each CISNET-CRC model. We selected ANN structures with corresponding hyperparameters (i.e., number of hidden layers, nodes, activation functions, epochs, and optimizer) that minimize the predicted mean square error on the validation sample. We implemented the ANN emulators in a probabilistic programming language and calibrated the input parameters with Hamiltonian Monte Carlo-based algorithms to obtain the joint posterior distributions of the CISNET-CRC models' parameters. We internally validated each calibrated emulator by comparing the model-predicted posterior outputs against the calibration targets.Results The optimal ANN for SimCRC had 4 hidden layers and 360 hidden nodes, MISCAN-Colon had 4 hidden layers and 114 hidden nodes, and CRC-SPIN had 1 hidden layer and 140 hidden nodes. The total time for training and calibrating the emulators was 7.3, 4.0, and 0.66 h for SimCRC, MISCAN-Colon, and CRC-SPIN, respectively. The mean of the model-predicted outputs fell within the 95% confidence intervals of the calibration targets in 98 of 110 for SimCRC, 65 of 93 for MISCAN, and 31 of 41 targets for CRC-SPIN.Conclusions Using ANN emulators is a practical solution to reduce the computational burden and complexity for Bayesian calibration of individual-level simulation models used for policy analysis, such as the CISNET CRC models. In this work, we present a step-by-step guide to constructing emulators for calibrating 3 realistic CRC individual-level models using a Bayesian approach.

artificial neural networks↗

ORNL ADCP Post-Processing Guide and MATLAB Algorithms for MHK Site Flow and Turbulence Analysis

Standard methods, along with guidance for post-processing the ADCP stationary measurements using MATLAB algorithms that were evaluated and tested by Oak Ridge National Laboratory (ORNL), are presented following an overview of the ADCP operating principles, deployment methods, error sources and recommended protocols for removing and replacing spurious data.

99 GENERAL AND MISCELLANEOUS↗

IC Report for project “Developing nonlinear laser-plasma instability models for high-fidelity, multi-physics simulation capability for ICF/HED” [Slides]

We’ve achieved our technical goals: (1) Perform large-scale kinetic simulations of SRS and CBET a range of plasma and laser conditions; (2) Develop a new $\delta f$-Gaussian-mixture algorithm to represent non-Maxwellian distribution functions from particle trapping and time-dependent plasma response; (3) Develop physics-based preliminary nonlinear LPI models for coupling to LRT/ Mazinisin and AMP; and (4) Begin implementation of LPI sub-grid models into Mazinisin.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Advanced Multi-Dimensional Capacitance Sensors Based Subsea Multiphase Mass Flow Meter to Measure and Monitor Offshore Enhanced Oil

This innovation is based on advanced multi-dimensional extensions of ECVT sensors that involve ECVT, Displacement Current Phase Tomography (DCPT), Maxwell-Wagner-Sillars polarization effect (MWS), and velocimetry which exploit the variation of electric properties between the oil, water, and gas coming out of the well. Capacitance sensors are embedded on the inside of a pipe spool and placed in-line with the subsea oil line piping on the extraction end of the well. The difference in dielectric, dielectric loss, surface polarization, and velocity of each phase are used in the multi-dimensional algorithm to measure the volume fraction, distribution, velocity, mass flow rate, and flow regime of the mixture moving through the pipe.

02 PETROLEUM↗

Improvements in Representations of Cloud Microphysics for BBHRP and Models using Data Collected during M-PACE and TWP-ICE

In our research we proposed to use data collected during the 2004 Mixed-Phase Arctic Cloud Experiment (MPACE) and the 2006 Tropical Warm Pool International Cloud Experiment (TWP-ICE) to improve retrievals of ice and mixed-phase clouds, to improve our understanding of how cloud and radiative processes affect cloud life cycles, and to develop and test methods for using ARM data more effectively in model. In particular, we proposed to: 1) use MPACE in-situ data to determine how liquid water fraction and cloud ice and liquid effective radius (r{sub ei} and r{sub ew}) vary with temperature, normalized cloud altitude and other variables for Arctic mixed-phase clouds, and to use these data to evaluate the performance of model parameterization schemes and remote sensing retrieval algorithms; 2) calculate rei and size/shape distributions using TWP-ICE in-situ data, investigate their dependence on cirrus type (oceanic or continental anvils or cirrus not directly traced to convection), and develop and test representations for MICROBASE; 3) conduct fundamental research enhancing our understanding of cloud/radiative interactions, concentrating on effects of small crystals and particle shapes and sizes on radiation; and 4) improve representations of microphysical processes for models (fall-out, effective density, mean scattering properties, rei and rew) and provide them to ARM PIs. In the course of our research, we made substantial progress on all four goals.

54 ENVIRONMENTAL SCIENCES↗

ITeM: Independent temporal motifs to summarize and compare temporal networks

We report networks are a fundamental and flexible way of representing various complex systems. Many domains such as communication, citation, procurement, biology, social media, and transportation can be modeled as a set of entities and their relationships. Temporal networks are a specialization of general networks where every relationship occurs at a discrete time. The temporal evolution of such networks is as important to understand as the structure of the entities and relationships. We present the Independent Temporal Motif (ITeM) to characterize temporal graphs from different domains. ITeMs can be used to model the structure and the evolution of the graph. In contrast to existing work, ITeMs are edge-disjoint directed motifs that measure the temporal evolution of ordered edges within the motif. For a given temporal graph, we produce a feature vector of ITeM frequencies and the time it takes to form the ITeM instances. We apply this distribution to measure the similarity of temporal graphs. We show that ITeM has higher accuracy than other motif frequency-based approaches. We define various ITeM-based metrics that reveal salient properties of a temporal network. We also present importance sampling as a method to efficiently estimate the ITeM counts. We present a distributed implementation of the ITeM discovery algorithm using Apache Spark and GraphFrame. We evaluate our approach on both synthetic and real temporal networks.

97 MATHEMATICS AND COMPUTING↗

A Comprehensive Analysis of PINNs for Power System Transient Stability

The integration of machine learning in power systems, particularly in stability and dynamics, addresses the challenges brought by the integration of renewable energies and distributed energy resources (DERs). Traditional methods for power system transient stability, involving solving differential equations with computational techniques, face limitations due to their time-consuming and computationally demanding nature. This paper introduces physics-informed Neural Networks (PINNs) as a promising solution for these challenges, especially in scenarios with limited data availability and the need for high computational speed. PINNs offer a novel approach for complex power systems by incorporating additional equations and adapting to various system scales, from a single bus to multi-bus networks. Our study presents the first comprehensive evaluation of physics-informed Neural Networks (PINNs) in the context of power system transient stability, addressing various grid complexities. Additionally, we introduce a novel approach for adjusting loss weights to improve the adaptability of PINNs to diverse systems. Our experimental findings reveal that PINNs can be efficiently scaled while maintaining high accuracy. Furthermore, these results suggest that PINNs significantly outperform the traditional ode45 method in terms of efficiency, especially as the system size increases, showcasing a progressive speed advantage over ode45.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Two-Dimensional Thomson Scattering in Laser-Produced Plasmas

We present two-dimensional (2D) optical Thomson scattering measurements of electron density and temperature in laser-produced plasmas. The novel instrument directly measures ne(x,y) and Te(x,y) in two dimensions over large spatial regions (cm2) with sub-mm spatial resolution, by automatically translating the scattering volume while the plasma is produced repeatedly by irradiating a solid target with a high-repetition-rate laser beam (10 J, ∼1012 W/cm2, 1 Hz). In this paper, we describe the design and motorized auto-alignment of the instrument and the computerized algorithm that autonomously fits the spectral distribution function to the tens-of-thousands of measured scattering spectra, and captures the transition from the collective to the non-collective regime with distance from the target. As an example, we present the first 2D scattering measurements in laser-driven shock waves in ambient nitrogen gas at a pressure of 0.13 mbar.

Zhang, Haiping (ORCID:0009000228133852)↗

DEVELOPING ATMOSPHERIC RETRIEVAL METHODS FOR DIRECT IMAGING SPECTROSCOPY OF GAS GIANTS IN REFLECTED LIGHT. I. METHANE ABUNDANCES AND BASIC CLOUD PROPERTIES

Upcoming space-based coronagraphic instruments in the next decade will perform reflected light spectroscopy and photometry of cool directly imaged extrasolar giant planets. We are developing a new atmospheric retrieval methodology to help assess the science return and inform the instrument design for such future missions, and ultimately interpret the resulting observations. Our retrieval technique employs a geometric albedo model coupled with both a Markov chain Monte Carlo Ensemble Sampler ( emcee ) and a multimodal nested sampling algorithm ( MultiNest ) to map the posterior distribution. This combination makes the global evidence calculation more robust for any given model and highlights possible discrepancies in the likelihood maps. As a proof of concept, our current atmospheric model contains one or two cloud layers, methane as a major absorber, and a H{sub 2}–He background gas. This 6-to-9 parameter model is appropriate for Jupiter-like planets and can be easily expanded in the future. In addition to deriving the marginal likelihood distribution and confidence intervals for the model parameters, we perform model selection to determine the significance of methane and cloud detection as a function of expected signal-to-noise ratio in the presence of spectral noise correlations. After internal validation, the method is applied to realistic spectra of Jupiter, Saturn, and HD 99492c, a model observing target. We find that the presence or absence of clouds and methane can be determined with high confidence, while parameter uncertainties are model dependent and correlated. Such general methods will also be applicable to the interpretation of direct imaging spectra of cloudy terrestrial planets.

79 ASTRONOMY AND ASTROPHYSICS↗

Solving Optimal Power Flow for Distribution Networks with State Estimation Feedback

Conventional optimal power flow (OPF) solvers assume full observability of the involved system states. However in practice, there is a lack of reliable system monitoring devices in the distribution networks. To close the gap between the theoretic algorithm design and practical implementation, this work proposes to solve the OPF problems based on the state estimation (SE) feedback for the distribution networks where only a part of the involved system states are physically measured. The SE feedback increases the observability of the under-measured system and provides more accurate system states monitoring when the measurements are noisy. We analytically investigate the convergence of the proposed algorithm. The numerical results demonstrate that the proposed approach is more robust to large pseudo measurement variability and inherent sensor noise in comparison to the other frameworks without SE feedback.

distirbution systems↗

SU-E-T-188: Film Dosimetry Verification of Monte Carlo Generated Electron Treatment Plans

Purpose: The purpose of this study was to compare dose distributions from film measurements to Monte Carlo generated electron treatment plans. Irradiation with electrons offers the advantages of dose uniformity in the target volume and of minimizing the dose to deeper healthy tissue. Using the Monte Carlo algorithm will improve dose accuracy in regions with heterogeneities and irregular surfaces. Methods: Dose distributions from GafChromic{sup ™} EBT3 films were compared to dose distributions from the Electron Monte Carlo algorithm in the Eclipse{sup ™} radiotherapy treatment planning system. These measurements were obtained for 6MeV, 9MeV and 12MeV electrons at two depths. All phantoms studied were imported into Eclipse by CT scan. A 1 cm thick solid water template with holes for bonelike and lung-like plugs was used. Different configurations were used with the different plugs inserted into the holes. Configurations with solid-water plugs stacked on top of one another were also used to create an irregular surface. Results: The dose distributions measured from the film agreed with those from the Electron Monte Carlo treatment plan. Accuracy of Electron Monte Carlo algorithm was also compared to that of Pencil Beam. Dose distributions from Monte Carlo had much higher pass rates than distributions from Pencil Beam when compared to the film. The pass rate for Monte Carlo was in the 80%–99% range, where the pass rate for Pencil Beam was as low as 10.76%. Conclusion: The dose distribution from Monte Carlo agreed with the measured dose from the film. When compared to the Pencil Beam algorithm, pass rates for Monte Carlo were much higher. Monte Carlo should be used over Pencil Beam for regions with heterogeneities and irregular surfaces.

60 APPLIED LIFE SCIENCES↗

Investigating CT to CBCT image registration for head and neck proton therapy as a tool for daily dose recalculation

Purpose: Intensity modulated proton therapy (IMPT) of head and neck (H and N) cancer patients may be improved by plan adaptation. The decision to adapt the treatment plan based on a dose recalculation on the current anatomy requires a diagnostic quality computed tomography (CT) scan of the patient. As gantry-mounted cone beam CT (CBCT) scanners are currently being offered by vendors, they may offer daily or weekly updates of patient anatomy. CBCT image quality may not be sufficient for accurate proton dose calculation and it is likely necessary to perform CBCT CT number correction. In this work, the authors investigated deformable image registration (DIR) of the planning CT (pCT) to the CBCT to generate a virtual CT (vCT) to be used for proton dose recalculation. Methods: Datasets of six H and N cancer patients undergoing photon intensity modulated radiation therapy were used in this study to validate the vCT approach. Each dataset contained a CBCT acquired within 3 days of a replanning CT (rpCT), in addition to a pCT. The pCT and rpCT were delineated by a physician. A Morphons algorithm was employed in this work to perform DIR of the pCT to CBCT following a rigid registration of the two images. The contours from the pCT were deformed using the vector field resulting from DIR to yield a contoured vCT. The DIR accuracy was evaluated with a scale invariant feature transform (SIFT) algorithm comparing automatically identified matching features between vCT and CBCT. The rpCT was used as reference for evaluation of the vCT. The vCT and rpCT CT numbers were converted to stopping power ratio and the water equivalent thickness (WET) was calculated. IMPT dose distributions from treatment plans optimized on the pCT were recalculated with a Monte Carlo algorithm on the rpCT and vCT for comparison in terms of gamma index, dose volume histogram (DVH) statistics as well as proton range. The DIR generated contours on the vCT were compared to physician-drawn contours on the rpCT. Results: The DIR accuracy was better than 1.4 mm according to the SIFT evaluation. The mean WET differences between vCT (pCT) and rpCT were below 1 mm (2.6 mm). The amount of voxels passing 3%/3 mm gamma criteria were above 95% for the vCT vs rpCT. When using the rpCT contour set to derive DVH statistics from dose distributions calculated on the rpCT and vCT the differences, expressed in terms of 30 fractions of 2 Gy, were within [−4, 2 Gy] for parotid glands (D{sub mean}), spinal cord (D{sub 2%}), brainstem (D{sub 2%}), and CTV (D{sub 95%}). When using DIR generated contours for the vCT, those differences ranged within [−8, 11 Gy]. Conclusions: In this work, the authors generated CBCT based stopping power distributions using DIR of the pCT to a CBCT scan. DIR accuracy was below 1.4 mm as evaluated by the SIFT algorithm. Dose distributions calculated on the vCT agreed well to those calculated on the rpCT when using gamma index evaluation as well as DVH statistics based on the same contours. The use of DIR generated contours introduced variability in DVH statistics.

60 APPLIED LIFE SCIENCES↗

Iterative methods for solving nonlinear problems of nuclear reactor criticality

The paper presents iterative methods for calculating the neutron flux distribution in nonlinear problems of nuclear reactor criticality. Algorithms for solving equations for variations in the neutron flux are considered. Convergence of the iterative processes is studied for two nonlinear problems in which macroscopic interaction cross sections are functionals of the spatial neutron distribution. In the first problem, the neutron flux distribution depends on the water coolant density, and in the second one, it depends on the fuel temperature. Simple relationships connecting the vapor content and the temperature with the neutron flux are used.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

An evaluation of point-insertion sequences for incremental Delaunay tessellations

Currently, incremental algorithms may be seen as the lowest-cost computational methods to generate Delaunay tessellations in several point distributions. In this work, eight point-insertion sequences in incremental algorithms for generating Delaunay tessellations are evaluated. More specifically, four point-insertion sequences in incremental algorithms for generating Delaunay tessellations are proposed: with orders given by the red–black tree with in-order and level-order traversals, spiral ordering, and H-indexing. These four incremental algorithms with such sequences are compared with four incremental algorithms with point-insertion orders given by the following sequences: the Hilbert and Lebesgue curves, cut-longest-edge kd-tree, and random order. Six 2-D and seven 3-D point distributions are tested, with sets ranging from 25,000 to 8,000,000 points. The results of computational and storage costs of these eight algorithms are analyzed. It follows that the incremental algorithm with a point-insertion sequence in the order given by the cut-longest-edge kd-tree shows the lowest computational and storage costs of the sequences tested.

97 MATHEMATICS AND COMPUTING↗

Constraining the scatter in the galaxy–halo connection at Milky Way masses

In this work, we develop and implement two new methods for constraining the scatter in the relationship between galaxies and dark matter haloes. These new techniques are sensitive to the scatter at low halo masses, making them complementary to previous constraints that are dependent on clustering amplitudes or rich galaxy groups, both of which are only sensitive to more massive haloes. In both of our methods, we use a galaxy group finder to locate central galaxies in the Sloan Digital Sky Survey main galaxy sample. Our first technique uses the small-scale cross-correlation of central galaxies with all lower mass galaxies. This quantity is sensitive to the satellite fraction of low-mass galaxies, which is in turn driven by the scatter between haloes and galaxies. The second technique uses the kurtosis of the distribution of line-of-sight velocities between central galaxies and neighbouring galaxies. This quantity is sensitive to the distribution of halo masses that contain the central galaxies at fixed stellar mass. Theoretical models are constructed using peak halo circular velocity, Vpeak, as our property to connect galaxies to haloes, and all comparisons between theory and observation are made after first passing the model through the group-finding algorithm. We parametrize scatter as a lognormal distribution in M* at fixed Vpeak, σ[M*|Vpeak]. The cross-correlation technique yields a constraint of σ[M*|Vpeak] = 0.27 ± 0.05 dex at a mean Vpeak of 168 km s-1, corresponding to a scatter in log M* at fixed Mh of σ[M*|Mh] = 0.38 ± 0.06 dex at $M_\text{h}=10^{11.8}\, \text{M}_\odot$. The kurtosis technique yields σ[M*|Vpeak] = 0.30 ± 0.03 at Vpeak = 209 km s-1, corresponding to σ[M*|Mh] = 0.34 ± 0.04 at $M_\text{h}=10^{12.2}\, \text{M}_\odot$. The values of σ[M*|Mh] are significantly larger than the constraints at higher masses, in agreement with the results of hydrodynamic simulations. This increase is only partly due to the scatter between Vpeak and Mh, and it represents an increase of nearly a factor of 2 relative to the values inferred from clustering and group studies at high masses.

59 BASIC BIOLOGICAL SCIENCES↗

diBELLA: Distributed Long Read to Long Read Alignment

© 2019 ACM. We present a parallel algorithm and scalable implementation for genome analysis, specifically the problem of finding overlaps and alignments for data from "third generation" long read sequencers [29]. While long sequences of DNA offer enormous advantages for biological analysis and insight, current long read sequencing instruments have high error rates and therefore require different approaches to analysis than their short read counterparts. Our work focuses on an efficient distributed-memory parallelization of an accurate single-node algorithm for overlapping and aligning long reads. We achieve scalability of this irregular algorithm by addressing the competing issues of increasing parallelism, minimizing communication, constraining the memory footprint, and ensuring good load balance. The resulting application, diBELLA, is the first distributed memory overlapper and aligner specifically designed for long reads and parallel scalability. We describe and present analyses for high level design trade-offs and conduct an extensive empirical analysis that compares performance characteristics across state-of-the-art HPC systems as well as a commercial cloud architectures, highlighting the advantages of state-of-the-art network technologies.

Ellis, Marquita↗