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,297 records · Page 72

Contextual classification of multispectral image data - An unbiased estimator for the context distribution

Recent investigations have demonstrated the effectiveness of a contextual classifier that combines spatial and spectral information employing a general statistical approach. This statistical classification algorithm exploits the tendency of certain ground-cover classes to occur more frequently in some spatial contexts than in others. Indeed, a key input to this algorithm is a statistical characterization of the context: the context distribution. Here a discussion is given of an unbiased estimator of the context distribution which, besides having the advantage of statistical unbiasedness, has the additional advantage over other estimation techniques of being amenable to an adaptive implementation in which the context distribution estimate varies according to local contextual information. Results from applying the unbiased estimator to the contextual classification of three real Landsat data sets are presented and contrasted with results from noncontextual classifications and from contextual classifications utilizing other context distribution estimation techniques.

Tilton, J. C.↗

Comparison of Surface Radiation Budget Satellite algorithms for downwelled shortwave irradiance with Wisconsin Fire/SRB surface-truth data

Surface radiation instruments were operated at various locations during the Wisconsin First ISSCP (International Satellite Cloud Climatology Project) Regional Experiment (FIRE) and Surface Radiation Budget (SRB) experiment in October 1986. Satellite data were distributed to scientists who had previously developed satellite algorithms to estimate downwelled shortwave irradiance. Results of intercomparison of ground-truth values with the satellite-derived estimates are described.

Whitlock, C. H.↗

Narrowing Frequency Probability Density Function for Achieving Minimized Uncertainties in Power Systems Operation – a Stochastic Distribution Control Perspective

With the increased penetration of renewables and other distributed energy resources (DERs), the frequency response in power systems exhibits stochastic nature, where the standard deterministic swing equation should be either represented or transferred into an Ito stochastic differential equation whose solution should be the non-stationary transient behavior of the probability density function (PDF) of the frequency. This transfers the frequency quality control for power systems into a stochastic distribution control problem, where the shape of the frequency distribution, namely the frequency PDF, needs to be directly controlled. In this context, this requires the development of control strategies via controlling the power balance so that the PDF of the frequency is made as narrow as possible whilst centered at its required mean value simple because such a sharp distribution shape means less uncertainties or randomness for the frequency response. In this paper, the formulation of the stochastic swing equation will be made first taking into account of DERs. This will then be followed by the development of stochastic distribution control model that links the power sources with the PDF of the frequency using Fokker Planck Kolmogorov (FPK) equations. A generic constrained optimization problem will be formulated where the cost function is composed of a functional distance between the actual and the desired PDFs of the frequency. A feasible solution using B-spine Neural Networks based stochastic distribution control model will be described. Using the obtained stochastic distribution control model, a set of control algorithms will be described that uses available power sources to shape the PDF of the frequency or to minimize the randomness of the frequency via minimized entropy approach. Future directions will be discussed in the later part of the paper

Swing equation, Power Systems, stchastic distribut↗

Improved cache performance in Monte Carlo transport calculations using energy banding

We present an energy banding algorithm for Monte Carlo (MC) neutral particle transport simulations which depend on large cross section lookup tables. In MC codes, read-only cross section data tables are accessed frequently, exhibit poor locality, and are typically too much large to fit in fast memory. Thus, performance is often limited by long latencies to RAM, or by off-node communication latencies when the data footprint is very large and must be decomposed on a distributed memory machine. The proposed energy banding algorithm allows maximal temporal reuse of data in band sizes that can flexibly accommodate different architectural features. The energy banding algorithm is general and has a number of benefits compared to the traditional approach. In the present analysis we explore its potential to achieve improvements in time-to-solution on modern cache-based architectures.

97 MATHEMATICS AND COMPUTING↗

Extreme-Scale Bayesian Inference for Uncertainty Quantification of Complex Simulations

Uncertainty quantification (UQ)—that is, quantifying uncertainties in complex mathematical models and their large-scale computational implementations—is widely viewed as one of the outstanding challenges facing the field of CS&E over the coming decade. The EUREKA project set to address the most difficult class of UQ problems: those for which both the underlying PDE model as well as the uncertain parameters are of extreme scale. In the project we worked on these extreme-scale challenges in the following four areas: 1. Scalable parallel algorithms for sampling and characterizing the posterior distribution that exploit the structure of the underlying PDEs and parameter-to-observable map. These include structure-exploiting versions of the randomized maximum likelihood method, which aims to overcome the intractability of employing conventional MCMC methods for solving extreme-scale Bayesian inversion problems by appealing to and adapting ideas from large-scale PDE-constrained optimization, which have been very successful at exploring high-dimensional spaces. 2. Scalable parallel algorithms for construction of prior and likelihood functions based on learning methods and non-parametric density estimation. Constructing problem-specific priors remains a critical challenge in Bayesian inference, and more so in high dimensions. Another challenge is construction of likelihood functions that capture unmodeled couplings between observations and parameters. We will create parallel algorithms for non-parametric density estimation using high dimensional N-body methods and combine them with supervised learning techniques for the construction of priors and likelihood functions. 3. Bayesian inadequacy models, which augment physics models with stochastic models that represent their imperfections. The success of the Bayesian inference framework depends on the ability to represent the uncertainty due to imperfections of the mathematical model of the phenomena of interest. This is a central challenge in UQ, especially for large-scale models. We propose to develop the mathematical tools to address these challenges in the context of extreme-scale problems. 4. Parallel scalable algorithms for Bayesian optimal experimental design (OED). Bayesian inversion yields quantified uncertainties in the model parameters, which can be propagated forward through the model to yield uncertainty in outputs of interest. This opens the way for designing new experiments to reduce the uncertainties in the model parameters and model predictions. Such experimental design problems have been intractable for large-scale problems using conventional methods; we will create OED algorithms that exploit the structure of the PDE model and the parameter-to-output map to overcome these challenges. Parallel algorithms for these four problems were created, analyzed, prototyped, implemented, tuned, and scaled up for leading-edge supercomputers, including UT-Austin’s own 10 petaflops Stampede system, ANL’s Mira system, and ORNL’s Titan system. While our focus is on fundamental mathematical/computational methods and algorithms, we will assess our methods on model problems derived from several DOE mission applications, including multiscale mechanics and ice sheet dynamics.

97 MATHEMATICS AND COMPUTING↗

Robust random number generation using steady-state emission of gain-switched laser diodes

We demonstrate robust, high-speed random number generation using interference of the steady-state emission of guaranteed random phases, obtained through gain-switching a semiconductor laser diode. Steady-state emission tolerates large temporal pulse misalignments and therefore significantly improves the interference quality. Using an 8-bit digitizer followed by a finite-impulse-response unbiasing algorithm, we achieve random number generation rates of 8 and 20 Gb/s, for laser repetition rates of 1 and 2.5 GHz, respectively, with a ±20% tolerance in the interferometer differential delay. We also report a generation rate of 80 Gb/s using partially phase-correlated short pulses. In relation to the field of quantum key distribution, our results confirm the gain-switched laser diode as a suitable light source, capable of providing phase-randomized coherent pulses at a clock rate of up to 2.5 GHz.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Geometry modeling and grid generation using 3D NURBS control volume

The algorithms for volume grid generation using NURBS geometric representation are presented. The parameterization algorithm is enhanced to yield a desired physical distribution on the curve, surface and volume. This approach bridges the gap between CAD surface/volume definition and surface/volume grid generation. Computational examples associated with practical configurations have shown the utilization of these algorithms.

Yu, Tzu-Yi↗

Optimal source codes for geometrically distributed integer alphabets

An approach is shown for using the Huffman algorithm indirectly to prove the optimality of a code for an infinite alphabet if an estimate concerning the nature of the code can be made. Attention is given to nonnegative integers with a geometric probability assignment. The particular distribution considered arises in run-length coding and in encoding protocol information in data networks. Questions of redundancy of the optimal code are also investigated.

Gallager, R. G.↗

A quantum algorithm to efficiently sample from interfering binary trees

Quantum computers provide an opportunity to efficiently sample from probability distributions that include non-trivial interference effects between amplitudes. Using a simple process wherein all possible state histories can be specified by a binary tree, we construct an explicit quantum algorithm that runs in polynomial time to sample from the process once. The corresponding naive Markov Chain algorithm does not produce the correct probability distribution and an explicit classical calculation of the full distribution requires exponentially many operations. Finally, the problem can be reduced to a system of two qubits with repeated measurements, shedding light on a quantum-inspired efficient classical algorithm.

97 MATHEMATICS AND COMPUTING↗

Fundamental form of the electrostatic δf-PIC algorithm and discovery of a converged numerical instability

The δf particle-in-cell algorithm has been a useful tool in studying the physics of plasmas, particularly turbulent magnetized plasmas in the context of gyrokinetics. The reduction in noise due to not having to resolve the full distribution function indicates an efficiency advantage over the standard (“full-f”) particle-in-cell. Despite its successes, the algorithm behaves strangely in some circumstances. In this work, we document a fully resolved numerical instability that occurs in the simplest of multiple-species test cases: the electrostatic Ω{sub H} mode. There is also a poorly understood numerical instability that occurs when one is under-resolved in particle number, which may require a prohibitively large number of particles to stabilize. Both of these are independent of the time-stepping scheme, and we conclude that they exist if the time advancement were exact. The exact analytic form of the algorithm is presented, and several schemes for mitigating these instabilities are also presented.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Improved Results for Route Planning in Stochastic Transportation Networks

In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times are not determined by a fixed schedule but instead may be random. the problem requires more than standard shortest path techniques. In recent work, Datar and Ranade provide algorithms in the case where bus arrivals are assumed to be independent and exponentially distributed. We offer solutions to two important generalizations of the problem, answering open questions posed by Datar and Ranade. First, we provide a polynomial time algorithm for a much wider class of arrival distributions, namely those with increasing failure rate. This class includes not only exponential distributions but also uniform, normal, and gamma distributions. Second, in the case where bus arrival times are independent and geometric discrete random variable,. we provide an algorithm for transportation networks of buses and trains, where trains run according to a fixed schedule.

Boyan, Justin↗

Coordinated Steering Angle and Yaw Moment Distribution to Increase Vehicle Regenerative Energy in Autonomous Driving

This paper presents an algorithm that increases vehicle regenerative braking energy recovery in autonomous driving by leveraging connected and automated vehicle (CAV) technology. Autonomous vehicles may select different maneuvers to increase kinetic energy recovery during deceleration. In the proposed algorithm, the cornering resistance that influences regenerative energy and energy consumption is defined in terms of steering angle during regenerative braking. In particular, a model predictive controller that distributes control inputs of the vehicle is adopted to reduce the cornering resistance for increasing regenerative braking torque. Utilizing the information from CAV technology, this algorithm enables the vehicle to safely conduct braking while increasing its regenerative energy recovery. CarSim-Simulink joint simulations demonstrate the effectiveness of the proposed method.

Choi, Junghyun↗

SU-E-T-752: Three-Dimensional Carcinogenic Maps Induced by Photons and Protons

Purpose: Evaluate the excess relative risk (ERR) induced by photons and protons in each voxel of the lung, and display it as a three-dimensional map, known as the ERRM (i.e. excess relative risk map) along with the dose distribution map. In addition, we also study the effect of variations in the linear energy transfer (LET) distribution on ERRM for a given proton plan. Methods: The excess relative risk due to radiation is estimated using the initiation-inactivation-proliferation formalism. This framework accounts for three biological phenomenon: mutation induction, cell kill and proliferation. Cell kill and mutation induction are taken as a function of LET using experimental data. LET distributions are calculated using a Monte Carlo algorithm. ERR is then estimated for each voxel in the organ, and displayed as a three dimensional carcinogenic map. Results: The differences in the ERR’s between photons and protons is seen from the three-dimensional ERR map. In addition, we also varied the LET of a proton plan and observed the differences in the corresponding ERR maps demonstrating variations in the ERR maps depend on features of a proton plan. Additionally, our results suggest that any two proton plans that have the same integral dose does not necessarily imply identical ERR maps, and these changes are due to the variations in the LET distribution map. Conclusion: Clinically, it is important to have a three dimensional display of biological end points. This study is an effort to introduce 3D ERR maps into the treatment planning workflow for certain sites such as pediatric head and neck tumors.

60 APPLIED LIFE SCIENCES↗

Parallel Harness for Informatic Stream Hashing

PHISH is a lightweight framework which a set of independent processes can use to exchange data as they run on the same desktop machine, on processors of a parallel machine, or on different machines across a network. This enables them to work in a coordinated parallel fashion to perform computations on either streaming, archived, or self-generated data. The PHISH distribution includes a simple, portable library for performing data exchanges in useful patterns either via MPI message-passing or ZMQ sockets. PHISH input scripts are used to describe a data-processing algorithm, and additional tools provided in the PHISH distribution convert the script into a form that can be launched as a parallel job.

Plimpton, Steve↗

Parallel Harness for Informatic Stream Hashing

PHISH is a lightweight framework which a set of independent processes can use to exchange data as they run on the same desktop machine, on processors of a parallel machine, or on different machines across a network. This enables them to work in a coordinated parallel fashion to perform computations on either streaming, archived, or self-generated data. The PHISH distribution includes a simple, portable library for performing data exchanges in useful patterns either via MPI message-passing or ZMQ sockets. PHISH input scripts are used to describe a data-processing algorithm, and additional tools provided in the PHISH distribution convert the script into a form that can be launched as a parallel job.

Steve Plimpton, Tim Shead↗

Computer-aided design and distributed system technology development for large space structures

Proposed large space structures have many characteristics that make them difficult to analyze and control. They are highly flexible, with components mathematically modeled by partial differential equations or very large systems of ordinary differential equations. They have many resonant frequencies, typically low and closely spaced. Natural damping may be low and/or improperly modeled. Coupled with stringent operational requirements of orientation, shape control, and vibration suppression, and the inability to perform adequate ground testing, these characteristics present an unconventional identification and control design problem to the systems theorist. Some of the research underway within Langley's Spacecraft Control Branch, Guidance and Control Division aimed at developing theory and algorithms to treat large space structures systems identification and control problems is described. The research areas to be considered are computer-aided design algorithms, and systems identification and control of distributed systems.

Armstrong, Ernest S.↗

SU-F-BRD-08: Guaranteed Epsilon-Optimal Treatment Plans with Minimum Number of Beams for SBRT Using RayStation

Purpose: To efficiently find quality-guaranteed treatment plans with the minimum number of beams for stereotactic body radiation therapy using RayStation. Methods: For a pre-specified pool of candidate beams we use RayStation (a treatment planning software for clinical use) to identify the deliverable plan which uses all the beams with the minimum dose to organs at risk (OARs) and dose to the tumor and other structures in specified ranges. Then use the dose matrix information for the generated apertures from RayStation to solve a linear program to find the ideal plan with the same objective and constraints allowing use of all beams. Finally we solve a mixed integer programming formulation of the beam angle optimization problem (BAO) with the objective of minimizing the number of beams while remaining in a predetermined epsilon-optimality of the ideal plan with respect to the dose to OARs. Since the treatment plan optimization is a multicriteria optimization problem, the planner can exploit the multicriteria optimization capability of RayStation to navigate the ideal dose distribution Pareto surface and select a plan of desired target coverage versus OARs sparing, and then use the proposed technique to reduce the number of beams while guaranteeing quality. For the numerical experiments two liver cases and one lung case with 33 non-coplanar beams are considered. Results: The ideal plan uses an impractically large number of beams. The proposed technique reduces the number of beams to the range of practical application (5 to 9 beams) while remaining in the epsilon-optimal range of 1% to 5% optimality gap. Conclusion: The proposed method can be integrated into a general algorithm for fast navigation of the ideal dose distribution Pareto surface and finding the treatment plan with the minimum number of beams, which corresponds to the delivery time, in epsilon-optimality range of the desired ideal plan. The project was supported by the Federal Share of program income earned by Massachusetts General Hospital on C06 CA059267, Proton Therapy Research and Treatment Center and partially by RaySearch Laboratories.

60 APPLIED LIFE SCIENCES↗

The Differential Algebra Based Multiple Level Fast Multipole Algorithm for 3D Space Charge Field Calculation and Photoemission Simulation

Coulomb interaction between charged particles inside a bunch is one of the most importance collective effects in beam dynamics, becoming even more significant as the energy of the particle beam is lowered to accommodate analytical and low-Z material imaging purposes such as in the time resolved Ultrafast Electron Microscope (UEM) development currently underway at Michigan State University. In addition, space charge effects are the key limiting factor in the development of ultrafast atomic resolution electron imaging and diffraction technologies and are also correlated with an irreversible growth in rms beam emittance due to fluctuating components of the nonlinear electron dynamics. In the short pulse regime used in the UEM, space charge effects also lead to virtual cathode formation in which the negative charge of the electrons emitted at earlier times, combined with the attractive surface field, hinders further emission of particles and causes a degradation of the pulse properties. Space charge and virtual cathode effects and their remediation are core issues for the development of the next generation of high-brightness UEMs. Since the analytical models are only applicable for special cases, numerical simulations, in addition to experiments, are usually necessary to accurately understand the space charge effect. In this paper we will introduce a grid-free differential algebra based multiple level fast multipole algorithm, which calculates the 3D space charge field for n charged particles in arbitrary distribution with an efficiency of O(n), and the implementation of the algorithm to a simulation code for space charge dominated photoemission processes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗