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,495 records · Page 83

Optimal Power Dispatch of DGs in Radial and Mesh AC Grids: A Hybrid Solution Methodology between the Salps Swarm Algorithm and Successive Approximation Power Flow Method

In this paper, we address the problem of the optimal power dispatch of Distributed Generators (DGs) in Alternating Current (AC) networks, better known as the Optimal Power Flow (OPF) problem. We used, as the objective function, the minimization of power losses (P loss ) associated with energy transport, which are subject to the set of constraints that compose AC networks in an environment of distributed generation. To validate the effectiveness of the proposed methodology in solving the OPF problem in any network topology, we employed one 10-node mesh test system and three radial text systems: 10, 33, and 69 nodes. In each test system, DGs were allowed to inject 20%, 40%, and 60% of the power supplied by the slack generator in the base case. To solve the OPF problem, we used a master–slave methodology that integrates the optimization method Salps Swarm Algorithm (SSA) and the load flow technique based on the Successive Approximation (SA) method. Moreover, for comparison purposes, we employed some of the algorithms reported in the specialized literature to solve the OPF problem (the continuous genetic algorithm, the particle swarm optimization algorithm, the black hole algorithm, the antlion optimization algorithm, and the Multi-Verse Optimizer algorithm), which were selected because of their excellent results in solving such problems. The results obtained by the proposed solution methodology demonstrate its superiority and convergence capacity in terms of minimization of P loss in both radial and mesh systems. It provided the best reduction in minimum P loss in short processing times and showed excellent repeatability in each test system and scenario under analysis.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

SU-F-T-685: Evaluation of Tumor Hypoxic Fraction Using Serial Volumetric Imaging During Radiation Therapy

Purpose: To develop a tumor response model which could be uses to compute tumor hypoxic fraction using serial volumetric tumor imaging. This algorithm may be used for treatment response assessment and also for guidance of more expensive PET imaging of hypoxia. Methods: Previously developed two-level cell population tumor response model was modified to include a third cell level describing hypoxic and necrotic cells. This third level was considered constant value during radiotherapy treatment; therefore, inclusion additional parameter did not compromise stability of model fitting to imaging data. Fitting the model to serial volumetric imaging data was performed using a least squares objective function and simulated annealing algorithm. The problem of reconstruction of radiobiological parameters from serial imaging data was considered as inverse ill-posed problem described by the Fredholm integral equation of the first kind. Variational regularization was used to stabilize solutions. Results: To evaluate performance of the algorithm, we used a set of serial CT imaging data on tumor-volume for 14 head and neck cancer patients. The hypoxic fractions were reconstructed for each patient and the distribution of hypoxic fractions was compared to the distribution of initial hypoxic fractions previously measured using histograph. The measured and reconstructed from imaging data distributions of hypoxic fractions are in good agreement. The reconstructed distribution of cell surviving fraction was also in better agreement with in vitro data than previously obtained using the two-level cell population model. Conclusion: Our results indicate that it is possible to evaluate the initial hypoxic tumor fraction using serial volumetric imaging and a tumor response model. This algorithm can be used for treatment response assessment and guidance of more expensive PET imaging.

60 APPLIED LIFE SCIENCES↗

Density-Aware Clustering Based on Aggregated Heat Kernel and Its Transformation

Current spectral clustering algorithms suffer from the sensitivity to existing noise, and parameter scaling, and may not be aware of different density distributions across clusters. If these problems are left untreated, the consequent clustering results cannot accurately represent true data patterns, in particular, for complex real world datasets with heterogeneous densities. This paper aims to solve these problems by proposing a diffusion-based Aggregated Heat Kernel (AHK) to improve the clustering stability, and a Local Density Affinity Transformation (LDAT) to correct the bias originating from different cluster densities. AHK statistically\ models the heat diffusion traces along the entire time scale, so it ensures robustness during clustering process, while LDAT probabilistically reveals local density of each instance and suppresses the local density bias in the affinity matrix. Our proposed framework integrates these two techniques systematically. As a result, not only does it provide an advanced noise-resisting and density-aware spectral mapping to the original dataset, but also demonstrates the stability during the processing of tuning the scaling parameter (which usually controls the range of neighborhood). Furthermore, our framework works well with the majority of similarity kernels, which ensures its applicability to many types of data and problem domains. The systematic experiments on different applications show that our proposed algorithms outperform state-of-the-art clustering algorithms for the data with heterogeneous density distributions, and achieve robust clustering performance with respect to tuning the scaling parameter and handling various levels and types of noise.

97 MATHEMATICS AND COMPUTING↗

Comparison of calculated dose distributions reported as dose-to-water and dose-to-medium for intensity-modulated radiotherapy of nasopharyngeal cancer patients

Advanced dose calculation algorithms for radiation therapy treatment planning can report external beam photon dose 2-sided, in terms of dose-to-medium (D{sub m}) and dose-to-water (D{sub w}). The purpose of our study was to determinate the effect of D{sub w} and D{sub m} reporting modes built in Elekta Monaco treatment planning system on intensity-modulated radiotherapy dose distributions for patients with nasopharyngeal cancer. For 13 patients involved in this retrospective study, 2 plans were created: 1 using D{sub w} and another according to D{sub m} reporting mode. Treatment plans were normalized such that 100% planning target volume should be covered by 95% of prescribed dose. Dose-volume constraints were assigned according to international standards. The comparison between dose distributions was performed evaluating quantities important for respective volumes of interest. For target volumes, heterogeneity index and conformity index methodology were used along with the maximum dose concept. Also, for the comparisons over particular organ at risk, maximum dose or mean dose as well as dose-volume concepts were used. For all target volumes and majority of organs at risk, the differences between 2 reporting modes are statistically insignificant, but this is not the case for bony structured organs at risks: mandible and cochlea. It was observed that D{sub w} is higher than D{sub m} with mean difference of 9.91% (p = 0.000009) of the mandible volume covered with 70 Gy. The same trend was observed for left and right cochlea with difference in mean dose of 8.74% (p = 0.037) and 6.87% (p = 0.029), respectively. The comparative analysis of dosimetric parameters in this study shows that the selection of reporting modes in Monaco treatment planning system can produce dose differences up to 15% in high-density volumes such as mandible and cochlea, which might have clinical consequences.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Multidisciplinary benchmarks of a conservative spectral solver for the nonlinear Boltzmann equation

The Boltzmann equation describes the evolution of the phase-space probability distribution of classical particles under binary collisions. Approximations to it underlie the basis for several scholarly fields, including aerodynamics and plasma physics. While these approximations are appropriate in their respective domains, they can be violated in niche but diverse applications which require direct numerical solution of the original nonlinear Boltzmann equation. An expanded implementation of the Galerkin–Petrov conservative spectral algorithm is employed to study a wide variety of physical problems. Enabled by distributed precomputation, solutions of the spatially homogeneous Boltzmann equation can be achieved in seconds on modern personal hardware, while spatially-inhomogeneous problems are solvable in minutes. Here, several benchmarks are presented focusing on accuracy compared to both analytic theoretical predictions and other Boltzmann solvers. These benchmarks span several physical domains including weakly ionized plasma, gaseous fluids, and atomic-plasma interaction.

97 MATHEMATICS AND COMPUTING↗

Accelerated simulation of stochastic particle removal processes in particle-resolved aerosol models

Stochastic particle-resolved methods have proven useful for simulating multi-dimensional systems such as composition-resolved aerosol size distributions. While particle-resolved methods have substantial benefits for highly detailed simulations, these techniques suffer from high computational cost, motivating efforts to improve their algorithmic efficiency. Here we formulate an algorithm for accelerating particle removal processes by aggregating particles of similar size into bins. We present the Binned Algorithm for particle removal processes and analyze its performance with application to the atmospherically relevant process of aerosol dry deposition. We show that the Binned Algorithm can dramatically improve the efficiency of particle removals, particularly for low removal rates, and that computational cost is reduced without introducing additional error. In simulations of aerosol particle removal by dry deposition in atmospherically relevant conditions, we demonstrate about 50-times increase in algorithm efficiency.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Using SAD data in Phaser

SAD data can be used in Phaser to solve novel structures, supplement molecular-replacement phase information or identify anomalous scatterers from a final refined model. Phaser is a program that implements likelihood-based methods to solve macromolecular crystal structures, currently by molecular replacement or single-wavelength anomalous diffraction (SAD). SAD phasing is based on a likelihood target derived from the joint probability distribution of observed and calculated pairs of Friedel-related structure factors. This target combines information from the total structure factor (primarily non-anomalous scattering) and the difference between the Friedel mates (anomalous scattering). Phasing starts from a substructure, which is usually but not necessarily a set of anomalous scatterers. The substructure can also be a protein model, such as one obtained by molecular replacement. Additional atoms are found using a log-likelihood gradient map, which shows the sites where the addition of scattering from a particular atom type would improve the likelihood score. An automated completion algorithm adds new sites, choosing optionally among different atom types, adds anisotropic B-factor parameters if appropriate and deletes atoms that refine to low occupancy. Log-likelihood gradient maps can also identify which atoms in a refined protein structure are anomalous scatterers, such as metal or halide ions. These maps are more sensitive than conventional model-phased anomalous difference Fouriers and the iterative completion algorithm is able to find a significantly larger number of convincing sites.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A Surveillance Infrastructure for Malaria Analytics: Provisioning Data Access and Preservation of Interoperability

Background: According to the World Health Organization, malaria surveillance is weakest in countries and regions with the highest malaria burden. A core obstacle is that the data required to perform malaria surveillance are fragmented in multiple data silos distributed across geographic regions. Furthermore, consistent integrated malaria data sources are few, and a low degree of interoperability exists between them. As a result, it is difficult to identify disease trends and to plan for effective interventions. Objective: We propose the Semantics, Interoperability, and Evolution for Malaria Analytics (SIEMA) platform for use in malaria surveillance based on semantic data federation. Using this approach, it is possible to access distributed data, extend and preserve interoperability between multiple dynamic distributed malaria sources, and facilitate detection of system changes that can interrupt mission-critical global surveillance activities. Methods: We used Semantic Automated Discovery and Integration (SADI) Semantic Web Services to enable data access and improve interoperability, and the graphical user interface-enabled semantic query engine HYDRA to implement the target queries typical of malaria programs. We implemented a custom algorithm to detect changes to community-developed terminologies, data sources, and services that are core to SIEMA. This algorithm reports to a dashboard. Valet SADI is used to mitigate the impact of changes by rebuilding affected services. Results: We developed a prototype surveillance and change management platform from a combination of third-party tools, community-developed terminologies, and custom algorithms. We illustrated a methodology and core infrastructure to facilitate interoperable access to distributed data sources using SADI Semantic Web services. This degree of access makes it possible to implement complex queries needed by our user community with minimal technical skill. We implemented a dashboard that reports on terminology changes that can render the services inactive, jeopardizing system interoperability. Using this information, end users can control and reactively rebuild services to preserve interoperability and minimize service downtime. Conclusions: We introduce a framework suitable for use in malaria surveillance that supports the creation of flexible surveillance queries across distributed data resources. The platform provides interoperable access to target data sources, is domain agnostic, and with updates to core terminological resources is readily transferable to other surveillance activities. A dashboard enables users to review changes to the infrastructure and invoke system updates. The platform significantly extends the range of functionalities offered by malaria information systems, beyond the state-of-the-art.

60 APPLIED LIFE SCIENCES↗

Verification of an Algorithm for Processing Data from Multifrequency Lidar Sensing of Aerosols

We consider an algorithm for processing lidar signals, which for a lidar path with constant qualitative aerosol characteristics (particle size distribution in each aerosol mode, complex refractive index of the particles) lets us obtain a concentration profile for the fine aerosol component without using additional a priori information. The algorithm was verified based on lidar data from the Institute of Physics (National Academy of Sciences of Belarus). The vertical volume concentration profile for fine particles obtained by our algorithm is quite consistent with the results of its independent retrieval, based on integrated processing of lidar and sun photometer data.

42 ENGINEERING↗

Improved Particle Swarm Algorithm Using Rubik’s Cube Topology for Bilevel Building Energy Transaction

Following the rapid growth of distributed energy resources (e.g., renewables, battery), localized peer-to-peer energy transactions are receiving more attention for multiple benefits, such as reducing power loss and stabilizing the main power grid. To promote distributed renewables locally, the local trading price is usually set to be within the external energy purchasing and selling price range. Consequently, building prosumers are motivated to trade energy through a local transaction center. This local energy transaction is modeled in bilevel optimization game. A selfish upper level agent is assumed with the privilege to set the internal energy transaction price with an objective of maximizing its arbitrage profit. Meanwhile, the building prosumers at the lower level will response to this transaction price and make decisions on electricity transaction amount. Therefore, this non-cooperative leader-follower trading game is seeking for equilibrium solutions on the energy transaction amount and prices. Additionally, a uniform local transaction price structure (purchase price equals selling price) is considered here. Aiming at reducing the computational burden from classical Karush–Kuhn–Tucker (KKT) transformation and protecting the private information of each stakeholder (e.g., building), swarm intelligence-based solution approach is employed for upper level agent to generate trading price and coordinate the transactive operations. On one hand, to decrease the chance of premature convergence in global-best topology, Rubik’s Cube topology is proposed in this study based on further improvement of a two-dimensional square lattice model (i.e., one local-best topology-Von Neumann topology). Rotating operation of the cube is introduced to dynamically changing the neighborhood and enhancing information flow at the later searching state. Several groups of experiments are designed to evaluate the performance of proposed Rubik’s Cube topology-based particle swarm algorithm. The results have validated the effectiveness of proposed topology and operators comparing with global-best version PSO and Von Neumann topology-based PSO and its scalability on larger scale applications.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Turbulent Mixing Simulation via a Quantum Algorithm

Probability density function (PDF) methods have been very useful in describing many physical aspects of turbulent mixing. In applications of these methods, modeled PDF transport equations are commonly simulated via classical Monte Carlo techniques, which provide estimates of moments of the PDF at arbitrary accuracy. In this paper, recently developed techniques in quantum computing and quantum enhanced measurements (quantum metrology) are used to construct a quantum algorithm that accelerates the computation of such estimates. This quantum algorithm provides a quadratic speedup over classical Monte Carlo methods in terms of the number of repetitions needed to achieve the desired precision. This paper illustrates the power of this algorithm by considering a binary scalar mixing process modeled by means of the coalescence/dispersion (C/D) closure. The equation is first simulated using classical Monte Carlo methods, where error estimates for the computation of central moments are provided. Then the quantum algorithm for this problem is simulated by sampling from the same probability distribution as that of the output of a quantum computer, and it is shown that significantly fewer resources are required to achieve the same precision. Finally, the results demonstrate potential applications of future quantum computers for simulation of turbulent mixing, and large classes of related problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SU-E-I-05: A Correction Algorithm for Kilovoltage Cone-Beam Computed Tomography Dose Calculations in Cervical Cancer Patients

Purpose: To investigate the accuracy and feasibility of dose calculations using kilovoltage cone beam computed tomography in cervical cancer radiotherapy using a correction algorithm. Methods: The Hounsfield units (HU) and electron density (HU-density) curve was obtained for both planning CT (pCT) and kilovoltage cone beam CT (CBCT) using a CIRS-062 calibration phantom. The pCT and kV-CBCT images have different HU values, and if the HU-density curve of CBCT was directly used to calculate dose in CBCT images may have a deviation on dose distribution. It is necessary to normalize the different HU values between pCT and CBCT. A HU correction algorithm was used for CBCT images (cCBCT). Fifteen intensity-modulated radiation therapy (IMRT) plans of cervical cancer were chosen, and the plans were transferred to the pCT and cCBCT data sets without any changes for dose calculations. Phantom and patient studies were carried out. The dose differences and dose distributions were compared between cCBCT plan and pCT plan. Results: The HU number of CBCT was measured by several times, and the maximum change was less than 2%. To compare with pCT, the CBCT and cCBCT has a discrepancy, the dose differences in CBCT and cCBCT images were 2.48%±0.65% (range: 1.3%∼3.8%) and 0.48%±0.21% (range: 0.1%∼0.82%) for phantom study, respectively. For dose calculation in patient images, the dose differences were 2.25%±0.43% (range: 1.4%∼3.4%) and 0.63%±0.35% (range: 0.13%∼0.97%), respectively. And for the dose distributions, the passing rate of cCBCT was higher than the CBCTs. Conclusion: The CBCT image for dose calculation is feasible in cervical cancer radiotherapy, and the correction algorithm offers acceptable accuracy. It will become a useful tool for adaptive radiation therapy.

60 APPLIED LIFE SCIENCES↗

Matrix-free subcell residual distribution for Bernstein finite elements: Monolithic limiting

This paper is focused on the aspects of limiting in residual distribution (RD) schemes for high-order finite element approximations to advection problems. Both continuous and discontinuous Galerkin methods are considered in this work. Discrete maximum principles are enforced using algebraic manipulations of element contributions to the global nonlinear system. The required modifications can be carried out without calculating the element matrices and assembling their global counterparts. The components of element vectors associated with the standard Galerkin discretization are manipulated directly using localized subcell weights to achieve optimal accuracy. Low-order nonlinear RD schemes of this kind were originally developed to calculate local extremum diminishing predictors for flux-corrected transport (FCT) algorithms. In the present paper, we incorporate limiters directly into the residual distribution procedure, which makes it applicable to stationary problems and leads to well-posed nonlinear discrete problems. To circumvent the second-order accuracy barrier, the correction factors of monolithic limiting approaches and FCT schemes are adjusted using smoothness sensors based on second derivatives. Finally, the convergence behavior of presented methods is illustrated by numerical studies for two-dimensional test problems.

97 MATHEMATICS AND COMPUTING↗

Clusterdv: a simple density-based clustering method that is robust, general and automatic

Abstract Motivation How to partition a dataset into a set of distinct clusters is a ubiquitous and challenging problem. The fact that data vary widely in features such as cluster shape, cluster number, density distribution, background noise, outliers and degree of overlap, makes it difficult to find a single algorithm that can be broadly applied. One recent method, clusterdp, based on search of density peaks, can be applied successfully to cluster many kinds of data, but it is not fully automatic, and fails on some simple data distributions. Results We propose an alternative approach, clusterdv, which estimates density dips between points, and allows robust determination of cluster number and distribution across a wide range of data, without any manual parameter adjustment. We show that this method is able to solve a range of synthetic and experimental datasets, where the underlying structure is known, and identifies consistent and meaningful clusters in new behavioral data. Availability and implementation The clusterdv is implemented in Matlab. Its source code, together with example datasets are available on: https://github.com/jcbmarques/clusterdv. Supplementary information Supplementary data are available at Bioinformatics online.

Marques, João C.↗

Dynamic Model Agnostic Reliability Evaluation of Machine-Learning Models Integrated in Instrumentation & Control Systems

In recent years, the field of machine learning (ML), specifically neural networks, has grown significantly and has spurred research in its applicability to digital instrumentation and control systems (DI&C). While ML models have shown promise in operational contexts, the trustworthiness of using such algorithms has not been adequately assessed. Failures of ML integrated systems are not well understood, and the lack of comprehensive risk modeling can degrade the trustworthiness in these systems. In recent reports by the National Institute for Standards and Technology (NIST) [1] and the Nuclear Regulatory Commission (NRC) [2], they indicate that trustworthiness in ML is a critical barrier and will play a vital role in the safe, accountable, and secure operation of intelligent systems. Thus, in this work, we demonstrate a dynamic model-agnostic method to quantify the relative reliability of AI/ML predictions by incorporating out-of-distribution (OOD) detection on the training dataset. It is well documented that most ML algorithms excel at interpolation (or near-interpolation) tasks but experience significant performance degradation at extrapolation. The method, referenced as the Laplacian distributed decay for reliability (LADDR), determines the difference between the operational and training datasets which can used to the relative reliability of AI/ML predictions. LADDR is then demonstrated on a feedforward neural network based digital twin used for the prediction of safety significant factors during a loss-of-flow transient. LADDR is used to demonstrate how training data can be used as evidence to support the relative reliability of ML/AI predictions enhancing the overall trustworthiness of the system.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Synchronization-Avoiding Graph Algorithms

Because they were developed for optimal sequential complexity, classical graph algorithms as found in textbooks have strictly-defined orders of operations. Enforcing a prescribed order of operations, or even an approximate order, in a distributed memory setting requires significant amounts of synchronization, which in turn can severely limit scalability. As a result, new algorithms are typically required to achieve scalable performance, even for solving well-known graph problems. Yet, even in these cases, parallel graph algorithms are written according to parallel programming models that evolved for, e.g., scientific computing, and that still have inherent, and scalability-limiting, amounts of synchronization. In this paper we present a new approach to parallel graph algorithms: synchronization-avoiding algorithms. To eliminate synchronization and its associated overhead, synchronization-avoiding algorithms perform work in an unordered and fully asynchronous fashion in such a way that the result is constantly refined toward its final state. “Wasted” work is minimized by locally prioritizing tasks using problem-dependent task utility metrics. We classify algorithms for graph applications into two broad categories: algorithms with monotonic updates (which evince global synchronization) and algorithms with nonmonotonic updates (which evince vertex-centric synchronization). We apply our approach to both classes and develop novel, synchronization-avoiding algorithms for solving exemplar problems: SSSP and connected components for the former, graph coloring for the latter. We demonstrate that eliminating synchronization in conjunction with effective scheduling policies and optimizations in the runtime results in improved scalability for both classes of algorithms.

Firoz, Jesun S.↗

Uncertainties in Atmospheric River Lifecycles by Detection Algorithms: Climatology and Variability

Atmospheric rivers (ARs) are long and narrow filaments of vapor transport that are responsible for most poleward moisture transport outside of the tropics. Many AR detection algorithms have been developed to automatically identify ARs in climate data. The diversity of these algorithms has introduced appreciable uncertainties in quantitative measures of AR properties and thereby impedes the construction of a unified and internally consistent climatology of ARs. This paper compares nine global AR detection algorithms from the perspective of AR lifecycles following the propagation of ARs from origin to termination in the MERRA2 reanalysis over the period 1980–2017. Uncertainties in AR lifecycle characteristics, including event number, lifetime, intensity, and frequency distribution are discussed. Notably, the number of AR events per year in the Northern Hemisphere can vary by a factor of 5 with different algorithms. Although all algorithms show that the maximum AR origin (termination) frequency is located over the western (eastern) portion of ocean basins, significant disagreements appear in regional distribution. Spreads are large in AR lifetime and intensity. Here, the number of landfalling AR events produced by the algorithms can vary from 16 to 80 events per year, although the agreement improves for stronger ARs. By examining the ARs' connections with the Madden-Julian Oscillation and El Niño Southern Oscillation, we find that the overall responses of ARs (such as changes in AR frequency, origin, and landfall activity) to climate variability are consistent among algorithms.

54 ENVIRONMENTAL SCIENCES↗

Datasets for radiation network algorithm development and testing

Domestic Nuclear Detection Office s (DNDO) Intelligence Radiation Sensors Systems (IRSS) program supported the development of networks of commercial-off-the-shelf (COTS) radiation counters for detecting, localizing, and identifying low-level radiation sources. Under this program, a series of indoor and outdoor tests were conducted with multiple source strengths and types, different background profiles, and various types of source and detector movements. Following the tests, network algorithms were replayed in various re-constructed scenarios using sub-networks. These measurements and algorithm traces together provide a rich collection of highly valuable datasets for testing the current and next generation radiation network algorithms, including the ones (to be) developed by broader R&D communities such as distributed detection, information fusion, and sensor networks. From this multiple TeraByte IRSS database, we distilled out and packaged the first batch of canonical datasets for public release. They include measurements from ten indoor and two outdoor tests which represent increasingly challenging baseline scenarios for robustly testing radiation network algorithms.

Rao, Nageswara S↗