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,351 records · Page 75

Distributed Optimization

We demonstrate a new framework for analyzing and controlling distributed systems, by solving constrained optimization problems with an algorithm based on that framework. The framework is ar. information-theoretic extension of conventional full-rationality game theory to allow bounded rational agents. The associated optimization algorithm is a game in which agents control the variables of the optimization problem. They do this by jointly minimizing a Lagrangian of (the probability distribution of) their joint state. The updating of the Lagrange parameters in that Lagrangian is a form of automated annealing, one that focuses the multi-agent system on the optimal pure strategy. We present computer experiments for the k-sat constraint satisfaction problem and for unconstrained minimization of NK functions.

Macready, William↗

Estimating the Propagation of Interdependent Cascading Outages with Multi-Type Branching Processes

In this paper, the multi-type branching process is applied to describe the statistics and interdependencies of line outages, the load shed, and isolated buses. The offspring mean matrix of the multi-type branching process is estimated by the Expectation Maximization (EM) algorithm and can quantify the extent of outage propagation. The joint distribution of two types of outages is estimated by the multi-type branching process via the Lagrange-Good inversion. The proposed model is tested with data generated by the AC OPA cascading simulations on the IEEE 118-bus system. The largest eigenvalues of the offspring mean matrix indicate that the system is closer to criticality when considering the interdependence of different types of outages. Compared with empirically estimating the joint distribution of the total outages, good estimate is obtained by using the multitype branching process with a much smaller number of cascades, thus greatly improving the efficiency. It is shown that the multitype branching process can effectively predict the distribution of the load shed and isolated buses and their conditional largest possible total outages even when there are no data of them.

97 MATHEMATICS AND COMPUTING↗

Parallel peak pruning for scalable SMP contour tree computation

As data sets grow to exascale, automated data analysis and visualisation are increasingly important, to intermediate human understanding and to reduce demands on disk storage via in situ analysis. Trends in architecture of high performance computing systems necessitate analysis algorithms to make effective use of combinations of massively multicore and distributed systems. One of the principal analytic tools is the contour tree, which analyses relationships between contours to identify features of more than local importance. Unfortunately, the predominant algorithms for computing the contour tree are explicitly serial, and founded on serial metaphors, which has limited the scalability of this form of analysis. While there is some work on distributed contour tree computation, and separately on hybrid GPU-CPU computation, there is no efficient algorithm with strong formal guarantees on performance allied with fast practical performance. Here in this paper, we report the first shared SMP algorithm for fully parallel contour tree computation, withfor-mal guarantees of O(lgnlgt) parallel steps and O(n lgn) work, and implementations with up to 10x parallel speed up in OpenMP and up to 50x speed up in NVIDIA Thrust.

97 MATHEMATICS AND COMPUTING↗

Scalable Contour Tree Computation by Data Parallel Peak Pruning

As data sets grow to exascale, automated data analysis and visualization are increasingly important, to intermediate human understanding and to reduce demands on disk storage via in situ analysis. Trends in architecture of high performance computing systems necessitate analysis algorithms to make effective use of combinations of massively multicore and distributed systems. One of the principal analytic tools is the contour tree, which analyses relationships between contours to identify features of more than local importance. Unfortunately, the predominant algorithms for computing the contour tree are explicitly serial, and founded on serial metaphors, which has limited the scalability of this form of analysis. While there is some work on distributed contour tree computation, and separately on hybrid GPU-CPU computation, there is no efficient algorithm with strong formal guarantees on performance allied with fast practical performance. Furthermore, we report the first shared SMP algorithm for fully parallel contour tree computation, with formal guarantees of O(lg V lg t) parallel steps and O(V lg V) work for data with V samples and t contour tree supernodes, and implementations with more than 30× parallel speed up on both CPU using TBB and GPU using Thrust and up 70× speed up compared to the serial sweep and merge algorithm.

97 MATHEMATICS AND COMPUTING↗

A computer vision algorithm for interpreting lacustrine carbonate textures at Searles Valley, USA

Investigations of the paleohydrologies of pluvial lake systems have often employed lake carbonate deposits called “tufa” that grow subaqueously and can be preserved long after the drying of the lake. For this reason, tufa have been used as a proxy for minimum lake level. However, they exhibit a variety of textures that hold the potential to reveal richer paleoclimatological information. With the goal of determining if tufa texture can be used as a proxy for lake environment, this study investigates the textures of tufa at Mono Lake, California in comparison to the fossil tufa in Searles Valley, California. While observations in the last century suggest that the tufa in the Mono basin grew in waters similar to the modern, the tufa at Searles formed during the last glacial period, when the Great Basin contained a system of pluvial lakes on the scale of the modern Great Lakes. The tufa at both basins have been observed to have a range of classifiable textures, and new methods of inspecting visual data could be informative about what factors control these textures. To this end, a t-Distributed Stochastic Neighbor Embedding (t-SNE) algorithm is used to project images of the tufa at Searles and Mono into a coordinate space, allowing for simple, quantitative comparisons of the visual similarity of textures. In this work, the textures of tufa at Searles are compared to each other, as well as to the tufa at Mono. This study performs a robust assessment of the feasibility of Mono Lake as a modern analogue for Searles Valley. It finds that there is a justifiable basis for the comparison of certain fossil facies at Searles to the tufa at Mono, significant progress towards the goal of using texture as a metric for the environment in which tufa formed.

58 GEOSCIENCES↗

Investigation of realistic PET simulations incorporating tumor patient's specificity using anthropomorphic models: Creation of an oncology database

Purpose: The GATE Monte Carlo simulation toolkit is used for the implementation of realistic PET simulations incorporating tumor heterogeneous activity distributions. The reconstructed patient images include noise from the acquisition process, imaging system's performance restrictions and have limited spatial resolution. For those reasons, the measured intensity cannot be simply introduced in GATE simulations, to reproduce clinical data. Investigation of the heterogeneity distribution within tumors applying partial volume correction (PVC) algorithms was assessed. The purpose of the present study was to create a simulated oncology database based on clinical data with realistic intratumor uptake heterogeneity properties.Methods: PET/CT data of seven oncology patients were used in order to create a realistic tumor database investigating the heterogeneity activity distribution of the simulated tumors. The anthropomorphic models (NURBS based cardiac torso and Zubal phantoms) were adapted to the CT data of each patient, and the activity distribution was extracted from the respective PET data. The patient-specific models were simulated with the Monte Carlo Geant4 application for tomography emission (GATE) in three different levels for each case: (a) using homogeneous activity within the tumor, (b) using heterogeneous activity distribution in every voxel within the tumor as it was extracted from the PET image, and (c) using heterogeneous activity distribution corresponding to the clinical image following PVC. The three different types of simulated data in each case were reconstructed with two iterations and filtered with a 3D Gaussian postfilter, in order to simulate the intratumor heterogeneous uptake. Heterogeneity in all generated images was quantified using textural feature derived parameters in 3D according to the ground truth of the simulation, and compared to clinical measurements. Finally, profiles were plotted in central slices of the tumors, across lines with heterogeneous activity distribution for visual assessment.Results: The accuracy of the simulated database was assessed against the original clinical images. The PVC simulated images matched the clinical ones best. Local, regional, and global features extracted from the PVC simulated images were closest to the clinical measurements, with the exception of the size zone variability and the mean intensity values, where heterogeneous tumors showed better reproducibility. The profiles on PVC simulated tumors after postfiltering seemed to represent the more realistic heterogeneous regions with respect to the clinical reference.Conclusions: In this study, the authors investigated the input activity map heterogeneity in the GATE simulations of tumors with heterogeneous activity distribution. The most realistic heterogeneous tumors were obtained by inserting PVC activity distributions from the clinical image into the activity map of the simulation. Partial volume effect (PVE) can play a crucial role in the quantification of heterogeneity within tumors and have an important impact on applications such as patient follow-up during treatment and assessment of tumor response to therapy. The development of such a database incorporating patient anatomical and functional variability can be used to evaluate new image processing or analysis algorithms, while providing control of the ground truth, which is not available when dealing with clinical datasets. The database includes all images used and generated in this study, as well as the sinograms and the attenuation phantoms for further investigation. It is freely available to the interested reader of the journal at http://www.med.upatras.gr/oncobase/.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Effect of Network Structure on Characterization and Flow Modeling Using X-ray Micro-Tomography Images of Granular and Fibrous Porous Media

Image-based network modeling has become a powerful tool for modeling transport in real materials that have been imaged using X-ray computed micro-tomography (XCT) or other three-dimensional imaging techniques. Network generation is an essential part of image-based network modeling, but little quantitative work has been done to understand the influence of different network structures on modeling. We use XCT images of three different porous materials (disordered packings of spheres, sand, and cylinders) to create a series of four networks for each material. Despite originating from the same data, the networks can be made to vary over two orders of magnitude in pore density, which in turn affects network properties such as pore-size distribution and pore connectivity. Despite the orders-of-magnitude difference in pore density, single-phase permeability predictions remain remarkably consistent for a given material, even for the simplest throat conductance formulas. Detailed explanations for this beneficial attribute are given in the article; in general, it is a consequence of using physically representative network models. The capillary pressure curve generated from quasi-static drainage is more sensitive to network structure than permeability. However, using the capillary pressure curve to extract pore-size distributions gives reasonably consistent results even though the networks vary significantly. These results provide encouraging evidence that robust network modeling algorithms are not overly sensitive to the specific structure of the underlying physically representative network, which is important given the variety image-based network-generation strategies that have been developed in recent years.

42 ENGINEERING↗

Analysis of atomic force microscopy data for surface characterization using fuzzy logic

In this paper we present a methodology to characterize surface nanostructures of thin films. The methodology identifies and isolates nanostructures using Atomic Force Microscopy (AFM) data and extracts quantitative information, such as their size and shape. The fuzzy logic based methodology relies on a Fuzzy Inference Engine (FIE) to classify the data points as being top, bottom, uphill, or downhill. The resulting data sets are then further processed to extract quantitative information about the nanostructures. In the present work we introduce a mechanism which can consistently distinguish crowded surfaces from those with sparsely distributed structures and present an omni-directional search technique to improve the structural recognition accuracy. In order to demonstrate the effectiveness of our approach we present a case study which uses our approach to quantitatively identify particle sizes of two specimens each with a unique gold nanoparticle size distribution. - Research Highlights: {yields} A Fuzzy logic analysis technique capable of characterizing AFM images of thin films. {yields} The technique is applicable to different surfaces regardless of their densities. {yields} Fuzzy logic technique does not require manual adjustment of the algorithm parameters. {yields} The technique can quantitatively capture differences between surfaces. {yields} This technique yields more realistic structure boundaries compared to other methods.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Geometrical characterization of perlite-metal syntactic foam

This paper introduces an improved method for the detailed geometrical characterization of perlite-metal syntactic foam. This novel metallic foam is created by infiltrating a packed bed of expanded perlite particles with liquid aluminium alloy. The geometry of the solidified metal is thus defined by the perlite particle shape, size and morphology. The method is based on a segmented micro-computed tomography data and allows for automated determination of the distributions of pore size, sphericity, orientation and location. The pore (i.e. particle) size distribution and pore orientation is determined by a multi-criteria k-nearest neighbour algorithm for pore identification. The results indicate a weak density gradient parallel to the casting direction and a slight preference of particle orientation perpendicular to the casting direction. - Highlights: •A new method for identification of pores in porous materials was developed. •It was applied on perlite-metal syntactic foam samples. •A porosity decrease in the axial direction of the samples was determined. •Pore shape analysis showed a high percentage of spherical pores. •Orientation analysis showed that more pores are oriented in the radial direction.

36 MATERIALS SCIENCE↗

Towards Integrating Data Quality Assessments and Radiometer Uncertainty for Determining the Expanded Uncertainty of Three-Component Solar Radiation Measurements

Accurate solar irradiance data are fundamental for determining the design and performance characteristics of photovoltaic systems. The uncertainty of solar irradiance measurements depends on many factors including radiometer design, calibration, installation, maintenance, and operational environment. The key contributors to this uncertainty can be classified as the measurement uncertainty of a particular radiometer and the operational uncertainty determined for the time of measurement. Radiometer measurement uncertainty estimates (U R ) can be based on well-established methods used as part of the radiometer calibration process. Estimates of operational uncertainties (U o ) require consideration of additional site-specific factors that affect data quality. A method is needed for establishing the accuracy of solar irradiance data by integrating an existing data quality process and measurement uncertainty estimates for specific radiometers. An algorithm has been developed to integrate data quality analyses and measurement uncertainty estimates for three-component solar irradiance data: global horizontal (total hemispheric) irradiance, direct normal (beam) irradiance, and diffuse horizontal (sky) irradiance collected at one- to 60-minute intervals. The algorithm has been tested using one-minute irradiance measurements. The goal of the project is to distribute a user-friendly software package based on the new algorithm.

data integrity↗

SAMBA: Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos

A new arbitrary Polynomial Chaos (aPC) method is presented for moderately high-dimensional problems characterised by limited input data availability. The proposed methodology improves the algorithm of aPC and extends the method, that was previously only introduced as tensor product expansion, to moderately high-dimensional stochastic problems. The fundamental idea of aPC is to use the statistical moments of the input random variables to develop the polynomial chaos expansion. This approach provides the possibility to propagate continuous or discrete probability density functions and also histograms (data sets) as long as their moments exist, are finite and the determinant of the moment matrix is strictly positive. For cases with limited data availability, this approach avoids bias and fitting errors caused by wrong assumptions. In this work, an alternative way to calculate the aPC is suggested, which provides the optimal polynomials, Gaussian quadrature collocation points and weights from the moments using only a handful of matrix operations on the Hankel matrix of moments. It can therefore be implemented without requiring prior knowledge about statistical data analysis or a detailed understanding of the mathematics of polynomial chaos expansions. The extension to more input variables suggested in this work, is an anisotropic and adaptive version of Smolyak's algorithm that is solely based on the moments of the input probability distributions. It is referred to as SAMBA (PC), which is short for Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos. It is illustrated that for moderately high-dimensional problems (up to 20 different input variables or histograms) SAMBA can significantly simplify the calculation of sparse Gaussian quadrature rules. SAMBA's efficiency for multivariate functions with regard to data availability is further demonstrated by analysing higher order convergence and accuracy for a set of nonlinear test functions with 2, 5 and 10 different input distributions or histograms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Microphysical Retrievals from Simultaneous Measurements by Airborne and Ground Radars during OLYMPEX

The OLYMPEX field campaign took place over the Olympic Peninsula of Washington during winter 2015-2016. During the intensive observing period, several aircraft flights obtained multi-frequency airborne radar measurements at X-, Ku-, Ka, and W-band from radars aboard the ER-2 and DC-8 aircraft. In addition, ground radars at S- and X-band performed RHI scans under the aircraft ground tracks. These coincident datasets provide a wealth of complementary information about the hydrometeor particle sizes, shapes, and orientations.In order to synthesize these measurements and test the robustness of scattering models, an optimal estimation retrieval based upon a Hitschfeld-Bordan profiling algorithm has been developed. This algorithm retrieves profiles of the particle size distribution parameters Nw and Dm, and, in the ice phase, relative proportions of aggregate, pristine, and rimed particles, using scattering models with different size-density and size-aspect ratio relationships. Under this formulation, only the pristine particles are horizontally aligned and capable of producing non-zero ZDR and KDP.From the nadir-looking airborne multifrequency radars, we find that aggregates may be readily distinguished from rimed and pristine particles owing to their uniqueness in triple-frequency space. However, rimed and pristine particles occupy a similar region in this space and thus polarimetric measurements greatly enhance their identification in our retrieval framework. With these capabilities we will present analyses of three-dimensional hydrometeor mapping obtained during various OLYMPEX cases. Some features retrieved in these cases include a layer of enhanced aggregation about 2km above the melting layer, hypothesized to be maintained by orographic uplift. This layer is often situated above a layer of denser, aligned particles. Regions of riming and supercooled liquid water beneath generating cells are also identified by our retrieval algorithm. Comparisons to in-situ observations and evaluation of scattering models will be presented.

Munchak, S. Joseph↗

A multi-objective optimization approach to optimal sensor location problem in $\mathrm{IGCC}$ power plants

Integrated Gasification Combined Cycle (IGCC) power plants provide a cleaner and more efficient way to obtain energy from coal. In order to operate an IGCC power plant in a safe and stable manner, several input and output process parameters need to be monitored. However, due to economic and operational constraints, it is infeasible to place sensors at every input and output process parameter location. Hence, it becomes important to select the most effective sensor locations which lead to maximum information gain about the plant conditions. Practical issues present in an IGCC power plant, such as harsh physical conditions and variability in process parameters, make the optimal sensor location problem an especially complicated one. Further, sensors can have multiple objectives and they can produce uncertainties due to measurement errors. Here this work considers hybrid hardware and virtual sensing for advanced power systems with multiple objectives. In order to solve this real world large scale problem, we use a novel algorithm called Better Optimization of Nonlinear Uncertain Systems (BONUS). BONUS works in probability distribution space and avoids sampling for each optimization and derivative calculations iterations. A new algorithm for multi-objective optimization is also developed specifically for problem. The result of this nonlinear stochastic multi-objective problem is the non-dominated, or Pareto set, which provides trade-offs between various objectives like observability, cost, and thermal efficiency. This is the first attempt at solving the problem of optimal sensor deployment in advanced power plants, with consideration of hybrid hardware and virtual sensing and incorporation of uncertainty with multiple objectives.

01 COAL, LIGNITE, AND PEAT↗

A First-Passage Kinetic Monte Carlo algorithm for complex diffusion-reaction systems

We develop an asynchronous event-driven First-Passage Kinetic Monte Carlo (FPKMC) algorithm for continuous time and space systems involving multiple diffusing and reacting species of spherical particles in two and three dimensions. The FPKMC algorithm presented here is based on the method introduced in Oppelstrup et al. and is implemented in a robust and flexible framework. Unlike standard KMC algorithms such as the n-fold algorithm, FPKMC is most efficient at low densities where it replaces the many small hops needed for reactants to find each other with large first-passage hops sampled from exact time-dependent Green's functions, without sacrificing accuracy. We describe in detail the key components of the algorithm, including the event-loop and the sampling of first-passage probability distributions, and demonstrate the accuracy of the new method. We apply the FPKMC algorithm to the challenging problem of simulation of long-term irradiation of metals, relevant to the performance and aging of nuclear materials in current and future nuclear power plants. The problem of radiation damage spans many decades of time-scales, from picosecond spikes caused by primary cascades, to years of slow damage annealing and microstructure evolution. Our implementation of the FPKMC algorithm has been able to simulate the irradiation of a metal sample for durations that are orders of magnitude longer than any previous simulations using the standard Object KMC or more recent asynchronous algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Passive microwave remote sensing of rainfall with SSM/I: Algorithm development and implementation

A physically based algorithm sensitive to emission and scattering is used to estimate rainfall using the Special Sensor Microwave/Imager (SSM/I). The algorithm is derived from radiative transfer calculations through an atmospheric cloud model specifying vertical distributions of ice and liquid hydrometeors as a function of rain rate. The algorithm is structured in two parts: SSM/I brightness temperatures are screened to detect rainfall and are then used in rain-rate calculation. The screening process distinguishes between nonraining background conditions and emission and scattering associated with hydrometeors. Thermometric temperature and polarization thresholds determined from the radiative transfer calculations are used to detect rain, whereas the rain-rate calculation is based on a linear function fit to a linear combination of channels. Separate calculations for ocean and land account for different background conditions. The rain-rate calculation is constructed to respond to both emission and scattering, reduce extraneous atmospheric and surface effects, and to correct for beam filling. The resulting SSM/I rain-rate estimates are compared to three precipitation radars as well as to a dynamically simulated rainfall event. Global estimates from the SSM/I algorithm are also compared to continental and shipboard measurements over a 4-month period. The algorithm is found to accurately describe both localized instantaneous rainfall events and global monthly patterns over both land and ovean. Over land the 4-month mean difference between SSM/I and the Global Precipitation Climatology Center continental rain gauge database is less than 10%. Over the ocean, the mean difference between SSM/I and the Legates and Willmott global shipboard rain gauge climatology is less than 20%.

Ferriday, James G.↗

Joint Spectrum Access and Power Control in Air-Air Communications - A Deep Reinforcement Learning Based Approach

This paper considers the dynamic spectrum access and power control problem in a single-hop point-to-point Air-Air Communication Network (AACN). Due to spectrum scarcity, we assume the number of Aircraft-to-Aircraft (A2A) communication links is greater than that of the available channels, such that some communication links need to share the same channel, causing co-channel interference. We formulate the joint channel selection and power control optimization problem to maximize the Weighted Sum Spectral Efficiency (WSSE). A distributed and dynamic deep Q learning-based algorithm is proposed to find the optimal solution. Specifically, we design two different policies that are trained by conducting a trial-and-error scheme. Each communication link can achieve the optimal policy by exploiting the local information from its neighbors, and this distributive approach make it scalable to large networks. Finally, our experimental results demonstrate the effectiveness of the proposed solution in various AACN scenarios.

Zhe Wang↗

Joint Spectrum Access and Power Control in Air-Air Communications - A Deep Reinforcement Learning Based Approach

This paper considers the dynamic spectrum access and power control problem in a single-hop point-to-point Air-Air Communication Network (AACN). Due to spectrum scarcity, we assume the number of Aircraft-to-Aircraft (A2A) communication links is greater than that of the available channels, such that some communication links need to share the same channel, causing co-channel interference. We formulate the joint channel selection and power control optimization problem to maximize the Weighted Sum Spectral Efficiency (WSSE). A distributed and dynamic deep Q learning-based algorithm is proposed to find the optimal solution. Specifically, we design two different policies that are trained by conducting a trial-and-error scheme. Each communication link can achieve the optimal policy by exploiting the local information from its neighbors, and this distributive approach make it scalable to large networks. Finally, our experimental results demonstrate the effectiveness of the proposed solution in various AACN scenarios.

Zhe Wang↗

Middle atmosphere project: A radiative heating and cooling algorithm for a numerical model of the large scale stratospheric circulation

A Curtis matrix is used to compute cooling by the 15 micron and 10 micron bands of carbon dioxide. Escape of radiation to space and exchange the lower boundary are used for the 9.6 micron band of ozone. Voigt line shape, vibrational relaxation, line overlap, and the temperature dependence of line strength distributions and transmission functions are incorporated into the Curtis matrices. The distributions of the atmospheric constituents included in the algorithm, and the method used to compute the Curtis matrices are discussed as well as cooling or heating by the 9.6 micron band of ozone. The FORTRAN programs and subroutines that were developed are described and listed.

Wehrbein, W. M.↗