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 739 records · Page 41

Theoretical Analysis of the EPR Spectrum Saturation Effect with Account for Spectral Diffusion in a System with a Gaussian Distribution of Spin Resonance Frequencies

We have analyzed the effect of saturation of the EPR spectrum for the model situation when a set of resonance frequencies of spin packets is described by a Gaussian distribution and spectral diffusion, which is a random process without correlation, exists. We have obtained the form of the spectrum for arbitrary values of magnetic–resonant parameters: relaxation times for the longitudinal and transverse components of the magnetization vector of the system, the spectral diffusion rate, the dispersion of the Gaussian distribution of resonance frequency, and the magnetic induction of the microwave field. We have derived an analytic expression for the saturation curve of the EPR spectrum. Detailed analysis of the dependence of the spectrum saturation curve on the spin system parameters is performed for the optimal case when the microwave field frequency coincides with the average frequency of the Gaussian distribution for resonance frequencies. The value of the microwave field induction at which the peak of the saturation curve is attained has been determined for arbitrary values of the paramagnetic relaxation time, spectral diffusion rate, and dispersion of the Gaussian spin frequency distribution. We have formulated the algorithm for determining the spin–lattice relaxation time using the experimentally determined microwave field induction for which the saturation curve passes through the peak. It should be noted that numerical calculations have been performed for parameters typical of EPR spectroscopy. The general analytic expression derived for the shape of the spectrum in the saturation conditions and qualitative conclusions concerning the effect of spectral diffusion on the saturation of stationary spectra obtained in this study can also be used in other fields of spectroscopy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Influence of molecular clustering on the interpretation of diffractograms of hydrocarbon films from tokamak T-10

The influence of molecular clustering on the formerly suggested interpretation of diffraction patterns of hydrocarbon films formed in the vacuum vessel of the tokamak T-10 is analyzed numerically. The simulation of clustering of simple hydrocarbon molecules C(D, H){sub 4}, C{sub 2}(D, H){sub 4}, and C{sub 6}(D, H){sub 6} and molecules composed of curved graphene (fullerenes and toroidal nanotubes) is carried out with the rigid body molecular dynamics method. It is shown that formerly neglected atomic correlations C–C and C–D(H) in the amorphous hydrocarbon component decrease the calculated values of the scattered intensity in the range of scattering vector modulus 5 < q < 20 nm{sup –1} because of homogenization of scatters on the spatial scale of ∼1 nm. The allowance for these correlations does not change the diffraction patterns in the range q > 20 nm{sup –1}. The results suggest the necessity to introduce to the procedure of determining the structural content of the films, similar to those from the tokamak T-10, the clusters formed by the van der Waals adhesion of hydrocarbon molecules to “graphene” nanoparticles. This simplifies the mathematical optimization to the former level of complexity—but for an extended ensemble of objects—and makes it possible to calculate the diffraction patterns of these objects using the distributed computing resources. A modified algorithm of structural content identification on the basis of joint X-ray and neutron diffractometry is suggested.

36 MATERIALS SCIENCE↗

Distributed-Memory Parallel JointNMF

Joint Nonnegative Matrix Factorization (JointNMF) is a hybrid method for mining information from datasets that contain both feature and connection information. We propose distributed-memory parallelizations of three algorithms for solving the JointNMF problem based on Alternating Nonnegative Least Squares, Projected Gradient Descent, and Projected Gauss-Newton. We extend well-known communication-avoiding algorithms using a single processor grid case to our coupled case on two processor grids. We demonstrate the scalability of the algorithms on up to 960 cores (40 nodes) with 60% parallel efficiency. The more sophisticated Alternating Nonnegative Least Squares (ANLS) and Gauss-Newton variants outperform the first-order gradient descent method in reducing the objective on large-scale problems. We perform a topic modelling task on a large corpus of academic papers that consists of over 37 million paper abstracts and nearly a billion citation relationships, demonstrating the utility and scalability of the methods.

Eswar, Srinivas↗

Parallel Markov Random Fields for Image Segmentation (PMRF-IS) v1.0

This software performs multi-label segmentation of 2D/3D images. It is highly accurate, results rely on use of an Markov random field (MRF) formulation. It runs in both shared and distributed memory parallel modes. MRF algorithms are powerful tools in image analysis to explore contextual information of data.

Heinemann, Colleen↗

Image reconstruction exploiting object sparsity in boundary-enhanced X-ray phase-contrast tomography

Propagation-based X-ray phase-contrast tomography (PCT) seeks to reconstruct information regarding the complex-valued refractive index distribution of an object. In many applications, a boundary-enhanced image is sought that reveals the locations of discontinuities in the real-valued component of the refractive index distribution. We investigate two iterative algorithms for few-view image reconstruction in boundary-enhanced PCT that exploit the fact that a boundary-enhanced PCT image, or its gradient, is often sparse. In order to exploit object sparseness, the reconstruction algorithms seek to minimize the {ell}{sub 1}-norm or TV-norm of the image, subject to data consistency constraints. We demonstrate that the algorithms can reconstruct accurate boundary-enhanced images from highly incomplete few-view projection data.

47 OTHER INSTRUMENTATION↗

Asynchronous Navier-Stokes Solver on 3D Unstructured Grids for the Exascale Era

This project has developed multiple fluid dynamics solvers for complex 3D flows using fully asynchronous distributed-memory task-parallel algorithms on top of the Charm++ runtime system. The algorithms solve the Euler or Navier-Stokes equations of compressible flows using unstructured tetrahedron meshes with optional solution-adaptive mesh-, and polynomial-order refinement. We have demonstrated excellent strong scaling up 50K compute cores and the benefits of Charm++’s automatic load balancing.

97 MATHEMATICS AND COMPUTING↗

Quantitative Uncertainty Analysis for Diffraction

Current software uses a least squares statistical method. For each model parameter, current software yields a point estimate and estimated standard error for each point estimate. In contrast, we have employed a Bayesian approach with sampling algorithm to provide a full posterior probability density function on each model parameter. This yields a different type of solution (probabilistic) with better fidelity. The Quantitative Uncertainty Analysis for Diffraction (QUAD) package returns a matrix of affect model parameters as a function of iteration through the MCMC analysis. QUAD is a Python code that allows for analysis of X-ray and neutron diffraction data to infer the structure of materials with quantifiable certainty. The code uses Bayesian statistics and Markov chain sampling algorithms to create posterior probability distributions on all material structure parameters that are modeled by a researcher. The statistical packages use the open source GSASII project as a library to calculate model diffraction patterns.

Fancher, ChristopherM↗

nuSTORM Pion Beamline Design Update

A facility producing neutrinos from muons that decay in a racetrack ring can provide extremely well understood neutrino beams for oscillation physics and the search for sterile neutrinos. The “neutrinos from STORed Muons” (nuSTORM) facility based on this idea has been introduced by Bross, Neuffer et al. The design of the nuSTORM facility and the particle tracking have been presented in the paper of Liu, et al. This paper demonstrates the recent optimization results of the pion beamline, with G4beamline simulations. The optimum choice of pion beam center momentum, a new algorithm on fitting bivariate Gaussian distribution to the pion phase space data at the downstream side of the horn, and the comparison of the beamline performance with the optics designed based on Graphite and Inconel targets are also described.

43 PARTICLE ACCELERATORS↗

Grid Topology Discovery Algorithm Evaluation of Suitability for Utility Deployment (CRADA 606 Final Report)

This work presents the results of a field-informed demonstration aimed at evaluating the practical suitability of a topology discovery algorithm for utility environments. We demonstrated an algorithm that uses a graph-theory-informed state estimation approach for model selection. In collaboration with Survalent and Peninsula Light Co., the algorithm was applied to real feeder models and field measurements from supervisory control and data acquisition (SCADA) and advanced metering infrastructure (AMI) systems to identify the operational topology of a power distribution system. The demonstration assessed the algorithm’s performance under realistic data conditions, including sparse and noisy measurements, and examined its ability to identify the most likely network configurations. The results confirmed that the approach can effectively narrow down feasible topologies, providing operators with improved situational awareness of network status. Key lessons learned emphasize the need for systematic data validation and strategic sensor placement to enhance observability. These insights inform future deployment strategies and guide refinements for broader adoption in utility operations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Enhancing approximate modular Bayesian inference by emulating the conditional posterior

In modular Bayesian analyses, complex models are composed of distinct modules, each representing different aspects of the data or prior information. In this context, fully Bayesian approaches can sometimes lead to undesirable feedback between modules, compromising the integrity of the inference. The “cut-distribution” prevents unwanted influence between modules by “cutting” feedback. The direct sampling (DS) algorithm is standard practice for approximating the cut-distribution, but it can be computationally intensive, especially when the number of imputations required is large. An enhanced method is proposed, the Emulating the Conditional Posterior (ECP) algorithm, which leverages emulation to increase the number of imputations. Through numerical experiment it is demonstrated that the ECP algorithm outperforms the traditional DS approach in terms of accuracy and computational efficiency, particularly when resources are constrained. Here, it is also shown how the DS algorithm can be improved using ideas from design of experiments. Some practical recommendations are given for algorithm choice in modular Bayesian analyses.

97 MATHEMATICS AND COMPUTING↗

PLANC: Parallel Low-rank Approximation with Nonnegativity Constraints

In this work, we consider the problem of low-rank approximation of massive dense nonnegative tensor data, for example, to discover latent patterns in video and imaging applications. As the size of data sets grows, single workstations are hitting bottlenecks in both computation time and available memory. We propose a distributed-memory parallel computing solution to handle massive data sets, loading the input data across the memories of multiple nodes, and performing efficient and scalable parallel algorithms to compute the low-rank approximation. We present a software package called Parallel Low-rank Approximation with Nonnegativity Constraints, which implements our solution and allows for extension in terms of data (dense or sparse, matrices or tensors of any order), algorithm (e.g., from multiplicative updating techniques to alternating direction method of multipliers), and architecture (we exploit GPUs to accelerate the computation in this work). We describe our parallel distributions and algorithms, which are careful to avoid unnecessary communication and computation, show how to extend the software to include new algorithms and/or constraints, and report efficiency and scalability results for both synthetic and real-world data sets.

97 MATHEMATICS AND COMPUTING↗

The Occurrence of Particle Size Distribution Bimodality in Midlatitude Cirrus as Inferred from Ground-Based Remote Sensing Data

To better understand the role of small particles in the microphysical processes and the radiative properties of cirrus, the reliability of historical in-situ data must be understood. Recent studies call into question the validity of that data because of shattering of large crystals on probe and aircraft surfaces thereby artificially amplifying the concentration of crystals smaller than approximately 50 μm. We contend that the general character of the in-situ measurements must be consistent, in a broad sense, with statistics derived from long-term remote sensing data. To examine this consistency, an algorithm using Doppler radar moments and Raman lidar extinction is developed to retrieve a bimodal particle size distribution and its uncertainty. Using case studies and statistics compiled over one year we show that the existence of high concentrations (> 1 cm -3 ) of small (sub 50 μm) particles in cirrus are not consistent with any reasonable interpretation of the remote sensing data. We conclude that the high concentrations of small particles found in many aircraft data sets are therefore likely an artifact of the in situ measurement process.

54 ENVIRONMENTAL SCIENCES↗

New approach for absolute fluence distribution calculations in Monte Carlo simulations of light propagation in turbid media

A novel way to attain three dimensional fluence rate maps from Monte-Carlo simulations of photon propagation is presented in this work. The propagation of light in a turbid medium is described by the radiative transfer equation and formulated in terms of radiance. For many applications, particularly in biomedical optics, the fluence rate is a more useful quantity and directly derived from the radiance by integrating over all directions. Contrary to the usual way which calculates the fluence rate from absorbed photon power, the fluence rate in this work is directly calculated from the photon packet trajectory. The voxel based algorithm works in arbitrary geometries and material distributions. It is shown that the new algorithm is more efficient and also works in materials with a low or even zero absorption coefficient. The capabilities of the new algorithm are demonstrated on a curved layered structure, where a non-scattering, non-absorbing layer is sandwiched between two highly scattering layers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optical homodyne tomography with polynomial series expansion

We present and demonstrate a method for optical homodyne tomography based on the inverse Radon transform. Different from the usual filtered back-projection algorithm, this method uses an appropriate polynomial series to expand the Wigner function and the marginal distribution, and discretize Fourier space. We show that this technique solves most technical difficulties encountered with kernel deconvolution-based methods and reconstructs overall better and smoother Wigner functions. We also give estimators of the reconstruction errors for both methods and show improvement in noise handling properties and resilience to statistical errors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dose Calculation Accuracy of the Monte Carlo Algorithm for CyberKnife Compared with Other Commercially Available Dose Calculation Algorithms

Monte Carlo dose calculation algorithms have the potential for greater accuracy than traditional model-based algorithms. This enhanced accuracy is particularly evident in regions of lateral scatter disequilibrium, which can develop during treatments incorporating small field sizes and low-density tissue. A heterogeneous slab phantom was used to evaluate the accuracy of several commercially available dose calculation algorithms, including Monte Carlo dose calculation for CyberKnife, Analytical Anisotropic Algorithm and Pencil Beam convolution for the Eclipse planning system, and convolution-superposition for the Xio planning system. The phantom accommodated slabs of varying density; comparisons between planned and measured dose distributions were accomplished with radiochromic film. The Monte Carlo algorithm provided the most accurate comparison between planned and measured dose distributions. In each phantom irradiation, the Monte Carlo predictions resulted in gamma analysis comparisons >97%, using acceptance criteria of 3% dose and 3-mm distance to agreement. In general, the gamma analysis comparisons for the other algorithms were <95%. The Monte Carlo dose calculation algorithm for CyberKnife provides more accurate dose distribution calculations in regions of lateral electron disequilibrium than commercially available model-based algorithms. This is primarily because of the ability of Monte Carlo algorithms to implicitly account for tissue heterogeneities, density scaling functions; and/or effective depth correction factors are not required.

61 RADIATION PROTECTION AND DOSIMETRY↗

PEAK FLUX DISTRIBUTIONS OF SOLAR RADIO TYPE-I BURSTS FROM HIGHLY RESOLVED SPECTRAL OBSERVATIONS

Solar radio type-I bursts were observed on 2011 January 26 by high resolution observations with the radio telescope AMATERAS in order to derive their peak flux distributions. We have developed a two-dimensional auto burst detection algorithm that can distinguish each type-I burst element from complex noise storm spectra that include numerous instances of radio frequency interference (RFI). This algorithm removes RFI from the observed radio spectra by applying a moving median filter along the frequency axis. Burst and continuum components are distinguished by a two-dimensional maximum and minimum search of the radio dynamic spectra. The analysis result shows that each type-I burst element has one peak flux without double counts or missed counts. The peak flux distribution of type-I bursts derived using this algorithm follows a power law with a spectral index between 4 and 5.

79 ASTRONOMY AND ASTROPHYSICS↗

Development of a statistically based access delay timeline methodology.

The charter for adversarial delay is to hinder access to critical resources through the use of physical systems increasing an adversary s task time. The traditional method for characterizing access delay has been a simple model focused on accumulating times required to complete each task with little regard to uncertainty, complexity, or decreased efficiency associated with multiple sequential tasks or stress. The delay associated with any given barrier or path is further discounted to worst-case, and often unrealistic, times based on a high-level adversary, resulting in a highly conservative calculation of total delay. This leads to delay systems that require significant funding and personnel resources in order to defend against the assumed threat, which for many sites and applications becomes cost prohibitive. A new methodology has been developed that considers the uncertainties inherent in the problem to develop a realistic timeline distribution for a given adversary path. This new methodology incorporates advanced Bayesian statistical theory and methodologies, taking into account small sample size, expert judgment, human factors and threat uncertainty. The result is an algorithm that can calculate a probability distribution function of delay times directly related to system risk. Through further analysis, the access delay analyst or end user can use the results in making informed decisions while weighing benefits against risks, ultimately resulting in greater system effectiveness with lower cost.

Rivera, W. Gary↗

Improvements on the minimax algorithm for the Laplace transformation of orbital energy denominators

We present a robust and non-heuristic algorithm that finds all extremum points of the error distribution function of numerically Laplace-transformed orbital energy denominators. The extremum point search is one of the two key steps for finding the minimax approximation. If pre-tabulation of initial guesses is supposed to be avoided, strategies for a sufficiently robust algorithm have not been discussed so far. We compare our non-heuristic approach with a bracketing and bisection algorithm and demonstrate that 3 times less function evaluations are required altogether when applying it to typical non-relativistic and relativistic quantum chemical systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗