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 1,783 records · Page 99

GPM DPR Retrievals: Algorithm, Evaluation, and Validation

The primary goal of the Dual-frequency Precipitation Radar (DPR) aboard the Global Precipitation Measurement (GPM) core satellite is to infer precipitationrate and raindrop/particle size distributions (DSD/PSD). The focus of this paper is threefold: 1)description of the DPR retrieval algorithm that uses an adjustable relationship between rainrate (R) and the mass-weighted diameter (Dm) or an R-Dm relationship in solving for R and Dmsimultaneously; 2) evaluation of the DPR algorithm based on the physical simulationsthat employ measured DSD/PSD to understand the mechanism and errorcharacteristics of the retrieval method; 3) review of ground validation studies for theDPR product as well as analysis of the strengths and weaknesses of the ground radarand rain gauge/disdrometer validations. Overall, the DPR Version-6 algorithmprovides reasonably accurate estimates of R and Dm in rain. Non-uniformity in therain profile, however, tends to degrade the accuracy of the R and Dm estimates tosome extent as the range-independent assumption of the adjustable parameter () ofthe R-Dm relation is not able to fully account for natural variation of DSD in the verticalprofile. Underestimation of the DPR snow rate is found when compared with theindependent dual-frequency ratio (DFR) technique. This is possibly the result of theconstraint associated with the path integral attenuation (PIA)/differential PIA (dPIA)used in the DPR algorithm to find the best  and range-independent  assumption. Arange-variable  model, proposed in the DPR Version-7 algorithm, is expected toimprove rain and snow retrieval.

Liang Liao↗

Assessing the Sampleability of Bennu’s Surface for the OSIRIS-REx Asteroid Sample Return Mission

NASA’s first asteroid sample return mission, OSIRIS-REx, collected a sample from the surface of near-Earth asteroid Bennu in October 2020 and will deliver it to Earth in September 2023. Selecting a sample collection site on Bennu’s surface was challenging due to the surprising lack of large ponded deposits of regolith particles exclusively fine enough (≤ 2 cm diameter) to be ingested by the spacecraft’s Touch-and-Go Sample Acquisition Mechanism (TAGSAM). Here we describe the Sampleability Map of Bennu, which was constructed to aid in the selection of candidate sampling sites and to estimate the probability of collecting sufficient sample. “Sampleability” is a numeric score that expresses the compatibility of a given area’s surface properties with the sampling mechanism. The algorithm that determines sampleability is a best fit functional form to an extensive suite of laboratory testing outcomes tracking the TAGSAM performance as a function of four observable properties of the target asteroid. The algorithm and testing were designed to measure and subsequently predict TAGSAM collection amounts as a function of the minimum particle size, maximum particle size, particle size frequency distribution, and the tilt of the TAGSAM head off the surface. The sampleability algorithm operated at two general scales, consistent with the resolution and coverage of data collected during the mission. The first scale was global and evaluated nearly the full surface. Due to Bennu’s unexpected boulder coverage and lack of ponded regolith deposits, the global sampleability efforts relied heavily on additional strategies to find and characterize regions of interest based on quantifying and avoiding areas heavily covered by material too large to be collected. The second scale was site-specific and used higher-resolution data to predict collected mass at a given contact location. The rigorous sampleability assessments gave the mission confidence to select the best possible sample collection site and directly enabled successful collection of hundreds of grams of material.

Asteroid exploration↗

OPTIMIZATION OF LONG RURAL FEEDERS USING A GENETIC ALGORITHM

This paper describes the optimization of conductor size and the voltage regulator location and magnitude of long rural distribution lines. The optimization minimizes the lifetime cost of the lines, including capital costs and losses while observing voltage drop and operational constraints using a Genetic Algorithm (GA). The GA optimization is applied to a real Single Wire Earth Return (SWER) network in regional Queensland and results are presented.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Extension of moment projection method to the fragmentation process

The method of moments is a simple but efficient method of solving the population balance equation which describes particle dynamics. Recently, the moment projection method (MPM) was proposed and validated for particle inception, coagulation, growth and, more importantly, shrinkage; here the method is extended to include the fragmentation process. The performance of MPM is tested for 13 different test cases for different fragmentation kernels, fragment distribution functions and initial conditions. Comparisons are made with the quadrature method of moments (QMOM), hybrid method of moments (HMOM) and a high-precision stochastic solution calculated using the established direct simulation algorithm (DSA) and advantages of MPM are drawn.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Performance Evaluation of Three Distributed Computing Environments for Scientific Applications

We present performance results for three distributed computing environments using the three simulated CFD applications in the NAS Parallel Benchmark suite. These environments are the DCF cluster, the LACE cluster, and an Intel iPSC/860 machine. The DCF is a prototypic cluster of loosely coupled SGI R3000 machines connected by Ethernet. The LACE cluster is a tightly coupled cluster of 32 IBM RS6000/560 machines connected by Ethernet as well as by either FDDI or an IBM Allnode switch. Results of several parallel algorithms for the three simulated applications are presented and analyzed based on the interplay between the communication requirements of an algorithm and the characteristics of the communication network of a distributed system.

Fatoohi, Rod↗

Parallel volume ray-casting for unstructured-grid data on distributed-memory architectures

As computing technology continues to advance, computational modeling of scientific and engineering problems produces data of increasing complexity: large in size and unstructured in shape. Volume visualization of such data is a challenging problem. This paper proposes a distributed parallel solution that makes ray-casting volume rendering of unstructured-grid data practical. Both the data and the rendering process are distributed among processors. At each processor, ray-casting of local data is performed independent of the other processors. The global image composing processes, which require inter-processor communication, are overlapped with the local ray-casting processes to achieve maximum parallel efficiency. This algorithm differs from previous ones in four ways: it is completely distributed, less view-dependent, reasonably scalable, and flexible. Without using dynamic load balancing, test results on the Intel Paragon using from two to 128 processors show, on average, about 60% parallel efficiency.

Ma, Kwan-Liu↗

Kinetic theory of particle-in-cell simulation plasma and the ensemble averaging technique

Abstract We derive the kinetic theory of fluctuations in physically and numerically stable particle-in-cell (PIC) simulations of electrostatic plasmas. The starting point is the single-time correlation at the start of the simulation between the statistical fluctuations of the weighted densities of macroparticle centers in the plasma particle phase-space. The fluctuations are associated with different initial conditions, typically due to the random initial conditions (in velocity space) of the macroparticles/simulation plasma, assigned according to their initial distribution of probability. The single-time correlations at all time steps and in each spatial grid cell are then determined from the Laplace–Fourier transforms of the discretized Klimontovich-like equation for the macroparticles and Maxwell’s equations for the fields, as computed by modern PIC codes. We recover the expressions for the electrostatic field and the plasma particle density fluctuation autocorrelation spectra as well as the kinetic equations describing the average evolution of PIC-simulated plasma particles, first derived by Langdon (1970b Proc. 4th Conf. Numerical Simulation of Plasmas ) using a test macroparticle approach perturbing a discretized Vlasovian plasma and then averaging the obtained physical quantity over the initial macroparticle velocity distribution. We generalize and extend these results to the modern algorithms in PIC codes using arbitrary macroparticle weights. Analytical estimates of statistical fluctuation amplitudes are derived as a function of the plasma simulation parameters, using the central limit theorem in the limit of a large number of macroparticles per cell. The theory is then used to analyze the ensemble averaging technique of PIC simulations where statistical averages are performed over ensembles of PIC simulations, modeling the same plasma physics problem but using different statistical realizations of the initial distribution functions of the macroparticles. This method is illustrated by linear Landau damping uncovering (from noise, which is usually considered numerical) the physical fluctuations driven by a single small amplitude electrostatic wave perturbing a PIC simulation plasma in equilibrium.

fluctuations correlations↗

SU-E-J-87: Lung Deformable Image Registration Using Surface Mesh Deformation for Dose Distribution Combination

Purpose: To allow a reliable deformable image registration (DIR) method for dose calculation in radiation therapy. This work proposes a performance assessment of a morphological segmentation algorithm that generates a deformation field from lung surface displacements with 4DCT datasets. Methods: From the 4DCT scans of 15 selected patients, the deep exhale phase of the breathing cycle is identified as the reference scan. Varian TPS EclipseTM is used to draw lung contours, which are given as input to the morphological segmentation algorithm. Voxelized contours are smoothed by a Gaussian filter and then transformed into a surface mesh representation. Such mesh is adapted by rigid and elastic deformations to match each subsequent lung volumes. The segmentation efficiency is assessed by comparing the segmented lung contour and the TPS contour considering two volume metrics, defined as Volumetric Overlap Error (VOE) [%] and Relative Volume Difference (RVD) [%] and three surface metrics, defined as Average Symmetric Surface Distance (ASSD) [mm], Root Mean Square Symmetric Surface Distance (RMSSD) [mm] and Maximum Symmetric Surface Distance (MSSD) [mm]. Then, the surface deformation between two breathing phases is determined by the displacement of corresponding vertices in each deformed surface. The lung surface deformation is linearly propagated in the lung volume to generate 3D deformation fields for each breathing phase. Results: The metrics were averaged over the 15 patients and calculated with the same segmentation parameters. The volume metrics obtained are a VOE of 5.2% and a RVD of 2.6%. The surface metrics computed are an ASSD of 0.5 mm, a RMSSD of 0.8 mm and a MSSD of 6.9 mm. Conclusion: This study shows that the morphological segmentation algorithm can provide an automatic method to capture an organ motion from 4DCT scans and translate it into a volume deformation grid needed by DIR method for dose distribution combination.

60 APPLIED LIFE SCIENCES↗

Methods for Bayesian power spectrum inference with galaxy surveys

We derive and implement a full Bayesian large scale structure inference method aiming at precision recovery of the cosmological power spectrum from galaxy redshift surveys. Our approach improves upon previous Bayesian methods by performing a joint inference of the three-dimensional density field, the cosmological power spectrum, luminosity dependent galaxy biases, and corresponding normalizations. We account for all joint and correlated uncertainties between all inferred quantities. Classes of galaxies with different biases are treated as separate subsamples. This method therefore also allows the combined analysis of more than one galaxy survey. In particular, it solves the problem of inferring the power spectrum from galaxy surveys with non-trivial survey geometries by exploring the joint posterior distribution with efficient implementations of multiple block Markov chain and Hybrid Monte Carlo methods. Our Markov sampler achieves high statistical efficiency in low signal-to-noise regimes by using a deterministic reversible jump algorithm. This approach reduces the correlation length of the sampler by several orders of magnitude, turning the otherwise numerically unfeasible problem of joint parameter exploration into a numerically manageable task. We test our method on an artificial mock galaxy survey, emulating characteristic features of the Sloan Digital Sky Survey data release 7, such as its survey geometry and luminosity-dependent biases. These tests demonstrate the numerical feasibility of our large scale Bayesian inference frame work when the parameter space has millions of dimensions. This method reveals and correctly treats the anti-correlation between bias amplitudes and power spectrum, which are not taken into account in current approaches to power spectrum estimation, a 20% effect across large ranges in k space. In addition, this method results in constrained realizations of density fields obtained without assuming the power spectrum or bias parameters in advance.

79 ASTRONOMY AND ASTROPHYSICS↗

Lion Cub: Minimizing Communication Overhead in Distributed Lion

Communication overhead is a key challenge in distributed deep learning, especially on slower Ethernet intercon nects, and given current hardware trends, communication is likely to become a major bottleneck. While gradient compression techniques have been explored for SGD and Adam, the Lion optimizer has the distinct advantage that its update vectors are the output of a sign operation, enabling straightforward quantization. However, simply compressing updates for communication and using techniques like majority voting fails to lead to end-to-end speedups due to inefficient communication algorithms and reduced convergence. We analyze three factors critical to distributed learning with Lion: optimizing communication methods, identifying effective quantization methods, and assessing the necessity of momentum synchronization. Our findings show that quantization techniques adapted to Lion and selective momentum synchronization can significantly reduce communication costs while maintaining convergence. We combine these into Lion Cub, which enables up to 5x speedups in end-to-end training compared to Lion. This highlights Lion’s potential as a communication-efficient solution for distributed training.

97 MATHEMATICS AND COMPUTING↗

Comparison of the kinetics of different Markov models for ligand binding under varying conditions

We recently derived a Markov model for macromolecular ligand binding dynamics from few physical assumptions and showed that its stationary distribution is the grand canonical ensemble [J. W. R. Martini, M. Habeck, and M. Schlather, J. Math. Chem. 52, 665 (2014)]. The transition probabilities of the proposed Markov process define a particular Glauber dynamics and have some similarity to the Metropolis-Hastings algorithm. Here, we illustrate that this model is the stochastic analog of (pseudo) rate equations and the corresponding system of differential equations. Moreover, it can be viewed as a limiting case of general stochastic simulations of chemical kinetics. Thus, the model links stochastic and deterministic approaches as well as kinetics and equilibrium described by the grand canonical ensemble. We demonstrate that the family of transition matrices of our model, parameterized by temperature and ligand activity, generates ligand binding kinetics that respond to changes in these parameters in a qualitatively similar way as experimentally observed kinetics. In contrast, neither the Metropolis-Hastings algorithm nor the Glauber heat bath reflects changes in the external conditions correctly. Both converge rapidly to the stationary distribution, which is advantageous when the major interest is in the equilibrium state, but fail to describe the kinetics of ligand binding realistically. To simulate cellular processes that involve the reversible stochastic binding of multiple factors, our pseudo rate equation model should therefore be preferred to the Metropolis-Hastings algorithm and the Glauber heat bath, if the stationary distribution is not of only interest.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Joint Estimation of Topology and Injection Statistics in Distribution Grids with Missing Nodes

Optimal operation of distribution grid resources relies on accurate estimation of its state and topology. Practical estimation of such quantities is complicated by the limited presence of real-time meters. This article discusses a theoretical framework to jointly estimate the operational topology and statistics of injections in radial distribution grids under limited availability of nodal voltage measurements. In particular, we show that our proposed algorithms are able to provably learn the exact grid topology and injection statistics at all unobserved nodes as long as they are not adjacent. The algorithm design is based on novel ordered trends in voltage magnitude fluctuations at node groups, that are independently of interest for radial physical flow networks. The complexity of the designed algorithms is theoretically analyzed and their performance is validated using both linearized and nonlinear ac power flow samples in test distribution grids.

97 MATHEMATICS AND COMPUTING↗

Applications of Remote Sensing for Land Use Planning Scenarios with Suitability Analysis

In regions undergoing rapid urbanization, such as West Africa, land use planning (LUP) is vital to accommodate growing population and manage natural resources. Suitability analysis modeling is a widely used tool in LUP to determine the extent to which a land area is suitable for a designated purpose, but there is a gap in the integration of remote sensing time series data into land use decisions. The goal of this study was to incorporate remote sensing time series information with suitability analyses to inform LUP decisions in urban areas. In the study area of Kumasi, Ghana, land cover trends and land surface temperature (LST) from 2000 to 2019 were used to understand climate change trends. Suitability analyses determined the fitness of land areas for predetermined uses. These background processes informed a genetic algorithm to project plausible futures for three land use scenarios. One scenario represented current land use planning practices for addressing population growth, another scenario prioritized minimizing climate change impacts while also accommodating population growth, and the final scenario focused on both of these climate and population goals in addition to high density urban development. Each of these scenarios was successful in achieving population accommodation and respective climate change mitigation goals. The results for these scenarios provide insight into plausible land use distributions in 2050 based on different planning approaches. The genetic algorithm was able to effectively develop results for each scenario through the integration of remotely sensed trends and suitability models, providing a novel approach to land use decision-making.

remote sensing time series↗

Application of Gauss's law space-charge limited emission model in iterative particle tracking method

The particle tracking method with a so-called gun iteration for modeling the space charge is discussed in the following paper. We suggest to apply the emission model based on the Gauss's law for the calculation of the space charge limited current density distribution using considered method. Based on the presented emission model we have developed a numerical algorithm for this calculations. This approach allows us to perform accurate and low time consumpting numerical simulations for different vacuum sources with the curved emitting surfaces and also in the presence of additional physical effects such as bipolar flows and backscattered electrons. The results of the simulations of the cylindrical diode and diode with elliptical emitter with the use of axysimmetric coordinates are presented. The high efficiency and accuracy of the suggested approach are confirmed by the obtained results and comparisons with the analytical solutions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Algorithms for Forward and Inverse Problem Solutions in Phase Contrast Tomography

PhaseTorch is a python package that implements algorithms for forward and inverse problem solutions in X-ray phase contrast tomography (XPCT). XPCT is useful to reconstruct the 3D distribution of the refractive index decrement and absorption index of an imaged object. PhaseTorch implements algorithms for simulation, reconstruction, and analysis of XPCT data. PhaseTorch provides algorithms for simulation of XPCT data of an object with known refractive and absorption indices. It contains algorithms for reconstructing the projections of the absorption index and refractive index decrement.

Sridhar, Venkatesh↗

Estimating the Single-Trial Characteristics of Event-Related Responses: Evaluation of the MCERP Algorithm

Single-trial event-related responses collected during the course of an experiment are typically averaged before analysis resulting in a rather crude picture of event-related brain dynamics. It has been quite clear for some time that these responses exhibit trial-to-trial variability: however, the computational techniques necessary to deal with such responses in noisy conditions have not been available. To this end we have developed the multiple-component, event-related potential model (mcERP), which assumes that the each event-related response consists of a sum of multiple evoked components each described by a stereotypical waveshape. These waveshapes are allowed to vary in amplitude and onset latency from trial to trial, which allows us to capture, to first-order, the trial-dependent variations in event-related brain dynamics. We have constructed many sets of synthetic data designed to simulate intracortical recordings from a 15 channel, linear-array multielectrode implanted acutely in V1 of an awake-behaving macaque undergoing visual stimulation with a red light flash. This synthetic data was used to characterize the performance of the mcERP algorithm. First we quantified the degree to which such trial-to-trial variability aids in the identification of multiple components, and we demonstrate that amplitude variability is a more important factor in component separation than latency variability. Second, we quantified the behavior of the algorithm under two distinct signal-to-noise ratio (SNR) conditions: Gaussian noise independently present in each channel, and highly correlated (1/f distributed), far-field noise presented identically in each channel of the array. The mcERP algorithm was found to be robust to noise accurately identifying all component waveshapes and their associated single-trial characteristics down to SNR levels of -20dB for Gaussian noise and -7dB for 1/f far-field noise. Comparisons of the performance of this algorithm with factor analysis (FA) and independent component analysis (ICA) will be described by Knuth et al. (SFN abstracts, 2002). In addition, the advantages of application of mcERP to real data will be described by Shah et al, (these abstracts, 2002: SFN abstracts, 2002).

Knuth, K. H.↗

Flexible dynamic boundary microgrid operation considering network and load unbalances

Flexible microgrids with dynamic boundaries have recently been introduced in the literature. With the ability to reconfigure the topology of the microgrids dynamically through remotely controlled switches, flexible microgrids with dynamic boundaries can further improve the resiliency and energy efficiency of microgrids with distributed energy resources (DERs). This paper focuses on the optimal operation considering one of the predominant characteristics of microgrids and distribution systems – unbalanced networks and loads. In existing literature, balanced modeling of microgrids is more common due to its attractive simplicity. The three-phase power unbalance has not been considered as a constraint on the generation units in a microgrid. Further, negative sequence constraints have also been neglected. In this article, we propose a set of constraints that is specifically related to the capabilities of inverter interfaced resources to supply unbalanced current/power when the microgrid is islanded from the main distribution grid. We incorporate the new set of constraints into two optimization formulations leveraging two convex relaxations of the three-phase power flow equations: mixed-integer linear programming (MILP) and mixed-integer semidefinite programming (MISDP) that optimize the dispatch of controllable switches and DERs in the microgrid. The algorithms are then extended to networked microgrids with grid-forming sources. We test the algorithms on a realistic community microgrid model in Puerto Rico as well as standardized IEEE distribution test feeders. The testing results demonstrate the performance of the proposed algorithms. The MILP is fast and scalable, and the MISDP enforces the negative sequence voltage constraints.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Users manual for the NASA Lewis three-dimensional ice accretion code (LEWICE 3D)

A description of the methodology, the algorithms, and the input and output data along with an example case for the NASA Lewis 3D ice accretion code (LEWICE3D) has been produced. The manual has been designed to help the user understand the capabilities, the methodologies, and the use of the code. The LEWICE3D code is a conglomeration of several codes for the purpose of calculating ice shapes on three-dimensional external surfaces. A three-dimensional external flow panel code is incorporated which has the capability of calculating flow about arbitrary 3D lifting and nonlifting bodies with external flow. A fourth order Runge-Kutta integration scheme is used to calculate arbitrary streamlines. An Adams type predictor-corrector trajectory integration scheme has been included to calculate arbitrary trajectories. Schemes for calculating tangent trajectories, collection efficiencies, and concentration factors for arbitrary regions of interest for single droplets or droplet distributions have been incorporated. A LEWICE 2D based heat transfer algorithm can be used to calculate ice accretions along surface streamlines. A geometry modification scheme is incorporated which calculates the new geometry based on the ice accretions generated at each section of interest. The three-dimensional ice accretion calculation is based on the LEWICE 2D calculation. Both codes calculate the flow, pressure distribution, and collection efficiency distribution along surface streamlines. For both codes the heat transfer calculation is divided into two regions, one above the stagnation point and one below the stagnation point, and solved for each region assuming a flat plate with pressure distribution. Water is assumed to follow the surface streamlines, hence starting at the stagnation zone any water that is not frozen out at a control volume is assumed to run back into the next control volume. After the amount of frozen water at each control volume has been calculated the geometry is modified by adding the ice at each control volume in the surface normal direction.

Bidwell, Colin S.↗