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 991 records · Page 55

TH-E-BRE-02: A Forward Scattering Approximation to Dose Calculation Using the Linear Boltzmann Transport Equation

Purpose: To investigate the use of the linear Boltzmann transport equation as a dose calculation tool which can account for interface effects, while still having faster computation times than Monte Carlo methods. In particular, we introduce a forward scattering approximation, in hopes of improving calculation time without a significant hindrance to accuracy. Methods: Two coupled Boltzmann transport equations were constructed, one representing the fluence of photons within the medium, and the other, the fluence of electrons. We neglect the scattering term within the electron transport equation, resulting in an extreme forward scattering approximation to reduce computational complexity. These equations were then solved using a numerical technique for solving partial differential equations, known as a finite difference scheme, where the fluence at each discrete point in space is calculated based on the fluence at the previous point in the particle's path. Using this scheme, it is possible to develop a solution to the Boltzmann transport equations by beginning with boundary conditions and iterating across the entire medium. The fluence of electrons can then be used to find the dose at any point within the medium. Results: Comparisons with Monte Carlo simulations indicate that even simplistic techniques for solving the linear Boltzmann transport equation yield expected interface effects, which many popular dose calculation algorithms are not capable of predicting. Implementation of a forward scattering approximation does not appear to drastically reduce the accuracy of this algorithm. Conclusion: Optimized implementations of this algorithm have been shown to be very accurate when compared with Monte Carlo simulations, even in build up regions where many models fail. Use of a forward scattering approximation could potentially give a reasonably accurate dose distribution in a shorter amount of time for situations where a completely accurate dose distribution is not required, such as in certain optimization algorithms.

97 MATHEMATICS AND COMPUTING↗

A Decision Theoretic Approach to Evaluate Radiation Detection Algorithms

There are a variety of sensor systems deployed at U.S. border crossings and ports of entry that scan for illicit nuclear material. In this work, we develop a framework for comparing the performance of detection algorithms that interpret the output of these scans and determine when secondary screening is needed. We optimize each algorithm to minimize its risk, or expected loss. We measure an algorithm’s risk by considering its performance over a sample, the probability distribution of threat sources, and the consequence of detection errors. While it is common to optimize algorithms by fixing one error rate and minimizing another, our framework allows one to simultaneously consider multiple types of detection errors. Our framework is flexible and easily adapted to many different assumptions regarding the probability of a vehicle containing illicit material, and the relative consequences of a false positive and false negative errors. Our methods can therefore inform decision makers of the algorithm family and parameter values which best reduce the threat from illicit nuclear material, given their understanding of the environment at any point in time. To illustrate the applicability of our methods, in this paper, we compare the risk from two families of detection algorithms and discuss the policy implications of our results.

Nobles, Mallory A.↗

Error Characteristics and Scale Dependence of Current Satellite Precipitation Estimates Products in Hydrological Modeling

Satellite precipitation estimates (SPEs) are promising alternatives to gauge observations for hydrological applications (e.g., streamflow simulation), especially in remote areas with sparse observation networks. However, the existing SPEs products are still biased due to imperfections in retrieval algorithms, data sources and post-processing, which makes the effective use of SPEs a challenge, especially at different spatial and temporal scales. In this study, we used a distributed hydrological model to evaluate the simulated discharge from eight quasi-global SPEs at different spatial scales and explored their potential scale effects of SPEs on a cascade of basins ranging from approximately 100 to 130,000 km 2 . The results indicate that, regardless of the difference in the accuracy of various SPEs, there is indeed a scale effect in their application in discharge simulation. Specifically, when the catchment area is larger than 20,000 km2, the overall performance of discharge simulation emerges an ascending trend with the increase of catchment area due to the river routing and spatial averaging. Whereas below 20,000 km 2 , the discharge simulation capability of the SPEs is more randomized and relies heavily on local precipitation accuracy. Our study also highlights the need to evaluate SPEs or other precipitation products (e.g., merge product or reanalysis data) not only at the limited station scale, but also at a finer scale depending on the practical application requirements. Here we have verified that the existing SPEs are scale-dependent in hydrological simulation, and they are not enough to be directly used in very fine scale distributed hydrological simulations (e.g., flash flood). More advanced retrieval algorithms, data sources and bias correction methods are needed to further improve the overall quality of SPEs.

DTVGM↗

Resolution recovery for Compton camera using origin ensemble algorithm

Purpose: Compton cameras (CCs) use electronic collimation to reconstruct the images of activity distribution. Although this approach can greatly improve imaging efficiency, due to complex geometry of the CC principle, image reconstruction with the standard iterative algorithms, such as ordered subset expectation maximization (OSEM), can be very time-consuming, even more so if resolution recovery (RR) is implemented. We have previously shown that the origin ensemble (OE) algorithm can be used for the reconstruction of the CC data. Here we propose a method of extending our OE algorithm to include RR. Methods: To validate the proposed algorithm we used Monte Carlo simulations of a CC composed of multiple layers of pixelated CZT detectors and designed for imaging small animals. A series of CC acquisitions of small hot spheres and the Derenzo phantom placed in air were simulated. Images obtained from (a) the exact data, (b) blurred data but reconstructed without resolution recovery, and (c) blurred and reconstructed with resolution recovery were compared. Furthermore, the reconstructed contrast-to-background ratios were investigated using the phantom with nine spheres placed in a hot background. Results: Our simulations demonstrate that the proposed method allows for the recovery of the resolution loss that is due to imperfect accuracy of event detection. Additionally, tests of camera sensitivity corresponding to different detector configurations demonstrate that the proposed CC design has sensitivity comparable to PET. When the same number of events were considered, the computation time per iteration increased only by a factor of 2 when OE reconstruction with the resolution recovery correction was performed relative to the original OE algorithm. We estimate that the addition of resolution recovery to the OSEM would increase reconstruction times by 2–3 orders of magnitude per iteration. Conclusions: The results of our tests demonstrate the improvement of image resolution provided by the OE reconstructions with resolution recovery. The quality of images and their contrast are similar to those obtained from the OE reconstructions from scans simulated with perfect energy and spatial resolutions.

60 APPLIED LIFE SCIENCES↗

SU-E-T-496: A Study of Two Commercial Dose Calculation Algorithms in Low Density Phantom

Purpose: Some lung cancer patients have very low lung density due to comorbidities. We investigate calculation accuracy of Eclipse AAA and Acuros(AXB) using a phantom that simulates this situation. Methods: A 2.5 x 5.0 x 5 cm (long) solid water inhomogeneity positioned 10 cm deep in a Balsa lung phantom (density 0.099 gm/cc) was irradiated with an off-center field such that the central axis was parallel to one side of the inhomogeneity. Radiochromic films were placed at 2.5cm(S1) and 5cm(S2) depths. After CT scanning, Hounsfield Units(HU) were converted to electron(ρe) and mass(ρm) density using in-house(IH) and vendor-supplied(V) calibration curves. IH electron densities were generated using a commercial electron density phantom. The phantom was exposed to 6 MV 3x3 and 20x20 fields. Dose distributions were calculated using the AAA and AXB algorithms. Results: The HU of BW is -910±40 which translates to ρe of 0.088±0.050(IH) and 0.090±0.050(V), and ρm of 0.101±0.045(IH) and 0.103±0.039(V). Both ρe(V) and ρm(V) are higher than ρe(IH) and ρm(IH) respectively by 1.4-5.3% and 0.5-12.3%. The average calculated dose inside the solid water ‘tumor’ are within 3.7% and 2.4% of measurements for both calibrations and field sizes using AAA and AXB. Within 10mm outside the ‘tumor’, AAA on average underestimates by 18.3% and 17.0% respectively for 3x3 using IH and V. AXB underestimates by 5.9%(S1)-6.6%(S2) and 13.1%(S1)-16.0%(S2) respectively using IH and V. For 20x20, AAA and AXB underestimate by 2.8%(S1)-4.4%(S2) and 0.3%(S1)-1.4%(S2) respectively with either calibration. Conclusion: The difference in the HU calibration between V and IH is not of clinical significance in normal field sizes. In the low density region of small fields, the calculations from both algorithms differ significantly from measurements. This may be attributed to the insufficient lateral electron transport modeled by two algorithms resulting in the over-estimation in penumbra expansion.

60 APPLIED LIFE SCIENCES↗

Line curvature algorithm in laser ektacytometry of red blood cells

The iso-intensity line curvature algorithm in laser ektacytometry of red blood cells is investigated by numerical simulation. The algorithm is designed to measure the average deformability, as well as the width and asymmetry of the red blood cell deformability distribution in a blood sample under study. The accuracy and scope of the algorithm are determined. Using a bimodal ensemble as an example, the possibility of determining the fraction of weakly deformable red blood cells in a blood sample by laser ektacytometry is demonstrated. (laser medicine)

60 APPLIED LIFE SCIENCES↗

A fast solver for the gyrokinetic field equation with adiabatic electrons

Describing turbulence and microinstabilities in fusion devices is often modelled with the gyrokinetic equation. During the time evolution of the distribution function a field equation for the electrostatic potential needs to be solved. In the case of adiabatic electrons it contains a flux-surface-average term resulting in an integro-differential equation. Its numerical solution is time and memory intensive for three-dimensional configurations. Here a new algorithm is presented which only requires the numerical inversion of a simpler differential operator and a subsequent addition of a correction term. This new procedure is as fast as solving the equation without the surface average.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Coupling the core analysis program DeCART to the fuel performance application BISON

The 3D neutron transport and core analysis program DeCART was coupled to the fuels performance application BISON to provide a higher fidelity tool for fuel performance simulation. This project is motivated by the desire to couple a high fidelity core analysis program (based on the method of characteristics) to a high fidelity fuel performance program, both of which can simulate 3D problems. DeCART provides sub-pin level resolution of the multigroup neutron flux, with resonance treatment, during burnup or a fast transient. BISON implicitly solves coupled thermomechanical equations for the fuel on a sub-millimeter level finite element mesh. A method was developed for mapping the fission rate density and fast neutron flux from DeCART to BISON. Multiple depletion cases were run with one-way data transfer from DeCART to BISON. The one-way data transfer of fission rate density is shown to agree with the fission rate density obtained from an internal Lassman-style model in BISON. One-way data transfer was also demonstrated in a 3D case in which azimuthal asymmetry was induced in the fission rate density profile of a fuel rod modeled in DeCART. Two-way data transfer was established by mapping the temperature distribution from BISON to DeCART. A Picard iterative algorithm was developed for the loose coupling with two-way data transfer. (authors)

97 MATHEMATICS AND COMPUTING↗

Advanced fuel fusion, phase space engineering, and structure-preserving geometric algorithms

Non-thermal advanced fuel fusion trades the requirement of a large amount of recirculating tritium in the system for that of large recirculating power. Phase space engineering technologies utilizing externally injected electromagnetic fields can be applied to meet the challenge of maintaining non-thermal particle distributions at a reasonable cost. The physical processes of the phase space engineering are studied from a theoretical and algorithmic perspective. It is emphasized that the operational space of phase space engineering is limited by the underpinning symplectic dynamics of charged particles. The phase space incompressibility according to the Liouville theorem is just one of many constraints, and Gromov's non-squeezing theorem determines the minimum footprint of the charged particles on every conjugate phase space plane. In this sense and level of sophistication, the mathematical abstraction of phase space engineering is symplectic topology. To simulate the processes of phase space engineering, such as the Maxwell demon and electromagnetic energy extraction, and to accurately calculate the minimum footprints of charged particles, recently developed structure-preserving geometric algorithms can be used. The family of algorithms conserves exactly, on discretized spacetime, symplecticity and thus incompressibility, non-squeezability, and symplectic capacities. The algorithms apply to the dynamics of charged particles under the influence of external electromagnetic fields as well as the charged particle–electromagnetic field system governed by the Vlasov–Maxwell equations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Dark Energy Survey: Galaxy sample for the baryonic acoustic oscillation measurement from the final dataset

In this paper, we present and validate the galaxy sample used for the analysis of the baryon acoustic oscillation (BAO) signal in the Dark Energy Survey (DES) Y6 data. The definition is based on a color and redshift-dependent magnitude cut optimized to select galaxies at redshifts higher than 0.6, while ensuring a high-quality photo- z determination. The optimization is performed using a Fisher forecast algorithm, finding the optimal i -magnitude cut to be given by i < 19.64 + 2.894 z ph . For the optimal sample, we forecast an increase in precision in the BAO measurement of ∼ 25 % with respect to the Y3 analysis. Our BAO sample has a total of 15,937,556 galaxies in the redshift range 0.6 < z ph < 1.2 , and its angular mask covers 4 , 273.42 deg 2 to a depth of i = 22.5 . We validate its redshift distributions with three different methods: directional neighborhood fitting algorithm (DNF), which is our primary photo- z estimation; direct calibration with spectroscopic redshifts from VIPERS, which is a spectroscopic galaxy sample that overlaps with our BAO sample and is complete within our selection cuts; and clustering redshift using SDSS galaxies. The fiducial redshift distribution is a combination of these three techniques performed by modifying the mean and width of the DNF distributions to match those of VIPERS and clustering redshift. In this paper, we also describe the methodology used to mitigate the effect of observational systematics, which is analogous to the one used in the Y3 analysis. This paper is one of the two dedicated to the analysis of the BAO signal in DES Y6. In its companion paper, we present the angular diameter distance constraints obtained through the fitting to the BAO scale.

79 ASTRONOMY AND ASTROPHYSICS↗

Novel tools for stepping source brachytherapy treatment planning: Enhanced geometrical optimization and interactive inverse planning

Purpose: Dose optimization for stepping source brachytherapy can nowadays be performed using automated inverse algorithms. Although much quicker than graphical optimization, an experienced treatment planner is required for both methods. With automated inverse algorithms, the procedure to achieve the desired dose distribution is often based on trial-and-error. Methods: A new approach for stepping source prostate brachytherapy treatment planning was developed as a quick and user-friendly alternative. This approach consists of the combined use of two novel tools: Enhanced geometrical optimization (EGO) and interactive inverse planning (IIP). EGO is an extended version of the common geometrical optimization method and is applied to create a dose distribution as homogeneous as possible. With the second tool, IIP, this dose distribution is tailored to a specific patient anatomy by interactively changing the highest and lowest dose on the contours. Results: The combined use of EGO–IIP was evaluated on 24 prostate cancer patients, by having an inexperienced user create treatment plans, compliant to clinical dose objectives. This user was able to create dose plans of 24 patients in an average time of 4.4 min/patient. An experienced treatment planner without extensive training in EGO–IIP also created 24 plans. The resulting dose-volume histogram parameters were comparable to the clinical plans and showed high conformance to clinical standards. Conclusions: Even for an inexperienced user, treatment planning with EGO–IIP for stepping source prostate brachytherapy is feasible as an alternative to current optimization algorithms, offering speed, simplicity for the user, and local control of the dose levels.

60 APPLIED LIFE SCIENCES↗

Distributed ADMM Using Private Blockchain for Power Flow Optimization in Distribution Network With Coupled and Mixed-Integer Constraints

The optimization problem for scheduling distributed energy resources (DERs) and battery energy storage systems (BESS) integrated with the power grid is important to minimize energy consumption from conventional sources in response to demand. Conventionally this optimization problem is solved in a centralized manner, limiting the size of the problem that can be solved and creating a high communication overhead because all the data is transferred to the central controller. These limitations are addressed by the proposed distributed consensus-based alternating direction method of multiplier (DC-ADMM) optimization algorithm, which decomposes the optimization problem into subproblems with private cost function and constraints. The distribution feeder is partitioned into low coupling subnetworks/regions, which solves the private subproblem locally and exchanges information with the neighboring regions to reach consensus. The relaxation strategy is employed for mixed-integer and coupled constraints introduced in the optimal power flow (OPF) problem by stationary and transportable BESS because DC-ADMM convergence is only guaranteed for strict convex problems. The information exchange and synchronization between subnetworks/regions are vital for distributed optimization. In this work, both of these aspects are addressed by the blockchain. The smart contract deployed on the blockchain network acts as a mediator for secure data exchange and synchronization in distributed computation. The blockchain-based distributed optimization problem’s effectiveness is tested for a 0.5-MW laboratory microgrid for one hour ahead and day-ahead for the IEEE 123-bus and EPRI J1 test feeders, and results are compared with a centralized solution.

25 ENERGY STORAGE↗

Aerosol Vertical Turbulent Mass Flux Retrievals Through Novel Remote Sensing Algorithm

Abstract Integrated measurements of aerosol, radiation, cloud, and turbulent transport in the planetary boundary layer (PBL) are essential for understanding and modeling climate and air quality. Here, we developed a new technique for the identification of convective turbulent regions and deriving the vertical distribution of aerosol turbulent mass fluxes within PBL. The algorithm uses retrievals from coherent Doppler lidars and a high spectral resolution lidar. The technique was applied to study particle mass fluxes over 2 months (November–December 2020) during the campaign conducted at the DOE Atmospheric Radiation Measurement Southern Great Plains (SGP) site in Lamont, Oklahoma. The algorithm developed here is capable of continuously deriving vertically resolved (curtains) aerosol mass fluxes. Our data analysis shows that at the site, the 30‐min averaged fluxes at 135 m above the surface were mainly positive (upward) at ∼1 μg m −2 s −1 , suggesting that the surface is the primary source of the particle mass supplied to the boundary layer at the SGP site. Analyses of the individual case studies have revealed that not all the derived fluxes can be linked to surface emissions. Both positive and negative values in a range of ±5 μg m −2 s −1 can be caused by convective thermals interacting between the residual layer and the mixed layer and by rotation of the horizontal wind with the height. Large erroneous negative fluxes can also be caused by drizzling/precipitating clouds. We anticipate that the application of the current technique will lead to a more realistic representation of aerosol mass budgets and bidirectional mixing rates.

54 ENVIRONMENTAL SCIENCES↗

A generalized multi-resolution expansion for uncertainty propagation with application to cardiovascular modeling

Computational models are used in a variety of fields to improve our understanding of complex physical phenomena. Recently, the realism of model predictions has been greatly enhanced by transitioning from deterministic to stochastic frameworks, where the effects of the intrinsic variability in parameters, loads, constitutive properties, model geometry and other quantities can be more naturally included. A general stochastic system may be characterized by a large number of arbitrarily distributed and correlated random inputs, and a limited support response with sharp gradients or event discontinuities. This motivates continued research into novel adaptive algorithms for uncertainty propagation, particularly those handling high dimensional, arbitrarily distributed random inputs and non-smooth stochastic responses. Here, we generalize a previously proposed multi-resolution approach to uncertainty propagation to develop a method that improves computational efficiency, can handle arbitrarily distributed random inputs and non-smooth stochastic responses, and naturally facilitates adaptivity, i.e., the expansion coefficients encode information on solution refinement. Our approach relies on partitioning the stochastic space into elements that are subdivided along a single dimension, or, in other words, progressive refinements exhibiting a binary tree representation. We also show how these binary refinements are particularly effective in avoiding the exponential increase in the multi-resolution basis cardinality and significantly reduce the regression complexity for moderate to high dimensional random inputs. The performance of the approach is demonstrated through previously proposed uncertainty propagation benchmarks and stochastic multi-scale finite element simulations in cardiovascular flow.

59 BASIC BIOLOGICAL SCIENCES↗

Semantic embedding for quantum algorithms

The study of classical algorithms is supported by an immense understructure, founded in logic, type, and category theory, that allows an algorithmist to reason about the sequential manipulation of data irrespective of a computation’s realizing dynamics. As quantum computing matures, a similar need has developed for an assurance of the correctness of high-level quantum algorithmic reasoning. Parallel to this need, many quantum algorithms have been unified and improved using quantum signal processing (QSP) and quantum singular value transformation (QSVT), which characterize the ability, by alternating circuit ansätze, to transform the singular values of sub-blocks of unitary matrices by polynomial functions. However, while the algebraic manipulation of polynomials is simple (e.g., compositions and products), the QSP/QSVT circuits realizing analogous manipulations of their embedded polynomials are non-obvious. This work constructs and characterizes the runtime and expressivity of QSP/QSVT protocols where circuit manipulation maps naturally to the algebraic manipulation of functional transforms (termed semantic embedding). In this way, QSP/QSVT can be treated and combined modularly, purely in terms of the functional transforms they embed, with key guarantees on the computability and modularity of the realizing circuits. We also identify existing quantum algorithms whose use of semantic embedding is implicit, spanning from distributed search to proofs of soundness in quantum cryptography. The methods used, based in category theory, establish a theory of semantically embeddable quantum algorithms, and provide a new role for QSP/QSVT in reducing sophisticated algorithmic problems to simpler algebraic ones.

Physics↗

Faster than Real-Time Dynamic Simulation for Large-Size Power System with Detailed Dynamic Models using High-Performance Computing Platform

This paper presents a faster-than-real-time dynamic simulation software package that is designed for large-size power system dynamic simulation. It was developed on the GridPACKTM high-performance computing (HPC) framework. The key features of the developed software package include (1) faster-than-real-time dynamic simulation for a WECC system (17,000 buses) with different types of detailed generator, controller, and relay dynamic models, (2) a decoupled parallel dynamic simulation algorithm with optimized computation architecture to better leverage HPC resources and technologies, (3) options for HPC-based linear and iterative solvers, (4) hidden HPC details, such as data communication and distribution, to enable development centered on mathematical models and algorithms rather than on computational details for power system researchers, and (5) easy integration of new dynamic models and related algorithms into the software package.

Huang, Renke↗

Markov properties of the magnetic field in the quiet solar photosphere

The observed magnetic field on the solar surface is characterized by a very complex spatial and temporal behavior. Although feature-tracking algorithms have allowed us to deepen our understanding of this behavior, subjectivity plays an important role in the identification and tracking of such features. In this paper, we study the temporal stochasticity of the magnetic field on the solar surface without relying on either the concept of magnetic feature or on the subjective assumptions about their identification and interaction. The analysis is applied to observations of the magnetic field of the quiet solar photosphere carried out with the Imaging Magnetograph eXperiment (IMaX) instrument on board the stratospheric balloon, Sunrise. We show that the joint probability distribution functions of the longitudinal (B{sub ∥}) and transverse (B{sub ⊥}) components of the magnetic field, as well as of the magnetic pressure (B{sup 2}=B{sub ⊥}{sup 2}+B{sub ∥}{sup 2}), verify the necessary and sufficient condition for the Markov chains. Therefore, we establish that the magnetic field as seen by IMaX with a resolution of 0.″15–0.″18 and 33 s cadence, which can be considered as a memoryless temporal fluctuating quantity.

79 ASTRONOMY AND ASTROPHYSICS↗

A new approach to calculate the transport matrix in RF cavities

A realistic approach to calculate the transport matrix in RF cavities is developed. It is based on joint solution of equations of longitudinal and transverse motion of a charged particle in an electromagnetic field of the linac. This field is a given by distribution (measured or calculated) of the component of the longitudinal electric field on the axis of the linac. New approach is compared with other matrix methods to solve the same problem. The comparison with code ASTRA has been carried out. Complete agreement for tracking results for a TESLA-type cavity is achieved. A corresponding algorithm will be implemented into the MARS15 code. A realistic approach to calculate the transport matrix in RF cavities is developed. Complete agreement for tracking results with existed code ASTRA is achieved. New algorithm will be implemented into MARS15 code.

43 PARTICLE ACCELERATORS↗