SEARCH · Engineering Papers

Results for “distributed algorithms”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 487 records · Page 27

All sources NASA NTRS DOE OSTI

DOE OSTI2017

PeleC [SWR-17-35]

PeleC is an adaptive-mesh compressible hydrodynamics code for reacting flows. It solves the compressible Navier-Stokes with multispecies transport in a block structured framework. The resulting algorithm is well suited for flows with localized resolution requirements and robust to discontinuities. User controllable refinement crieteria has the potential to result in extremely small numerical dissipation and dispersion, making this code appropriate for both research and applied usage. The code is built on the AMReX library which facilitates hierarchical parallelism and manages distributed memory parallism. PeleC algorithms are implemented to express shared memory parallelism.

Source record↗

DOE OSTI2017

PELEC

Source record↗

DOE OSTI2015

EAGLE: 'EAGLE'Is an' Algorithmic Graph Library for Exploration

The Resource Description Framework (RDF) and SPARQL Protocol and RDF Query Language (SPARQL) were introduced about a decade ago to enable flexible schema-free data interchange on the Semantic Web. Today data scientists use the framework as a scalable graph representation for integrating, querying, exploring and analyzing data sets hosted at different sources. With increasing adoption, the need for graph mining capabilities for the Semantic Web has emerged. Today there is no tools to conduct "graph mining" on RDF standard data sets. We address that need through implementation of popular iterative Graph Mining algorithms (Triangle count, Connected component analysis, degree distribution, diversity degree, PageRank, etc.). We implement these algorithms as SPARQL queries, wrapped within Python scripts and call our software tool as EAGLE. In RDF style, EAGLE stands for "EAGLE 'Is an' algorithmic graph library for exploration. EAGLE is like 'MATLAB' for 'Linked Data.'

Source record↗

DOE OSTI2023

A Peer-to-Peer Market-Based Control Strategy for a Smart Residential Community with Behind-the-Meter Distributed Energy Resources

This paper presents a distributed peer-to-peer market control strategy to manage and to enable resource sharing of behind-the-meter distributed energy resources in a residential community. In the proposed strategy, each consumer or prosumer determines the flexibility of their point of connection to the power network such that the obtained flexibility is network-feasible. Based on the feasible flexibility, the consumers and the prosumers trade power among each other at each time instance to fulfil their preferred load requirements while maximizing their payoffs and helping to regulate node voltages inside the community. Because the problem to be solved is non-convex, a distributed particle swarm optimization algorithm is used to coordinate the consumers/prosumers in a fully autonomous manner without any centralized or hierarchical coordination. Numerical simulations performed on a community of 48 homes demonstrate the efficacy of the proposed approach.

distributed energy resource↗

DOE OSTI2015

SU-E-T-422: Fast Analytical Beamlet Optimization for Volumetric Intensity-Modulated Arc Therapy

Purpose: To implement a fast optimization algorithm on CPU/GPU heterogeneous computing platform and to obtain an optimal fluence for a given target dose distribution from the pre-calculated beamlets in an analytical approach. Methods: The 2D target dose distribution was modeled as an n-dimensional vector and estimated by a linear combination of independent basis vectors. The basis set was composed of the pre-calculated beamlet dose distributions at every 6 degrees of gantry angle and the cost function was set as the magnitude square of the vector difference between the target and the estimated dose distribution. The optimal weighting of the basis, which corresponds to the optimal fluence, was obtained analytically by the least square method. Those basis vectors with a positive weighting were selected for entering into the next level of optimization. Totally, 7 levels of optimization were implemented in the study.Ten head-and-neck and ten prostate carcinoma cases were selected for the study and mapped to a round water phantom with a diameter of 20cm. The Matlab computation was performed in a heterogeneous programming environment with Intel i7 CPU and NVIDIA Geforce 840M GPU. Results: In all selected cases, the estimated dose distribution was in a good agreement with the given target dose distribution and their correlation coefficients were found to be in the range of 0.9992 to 0.9997. Their root-mean-square error was monotonically decreasing and converging after 7 cycles of optimization. The computation took only about 10 seconds and the optimal fluence maps at each gantry angle throughout an arc were quickly obtained. Conclusion: An analytical approach is derived for finding the optimal fluence for a given target dose distribution and a fast optimization algorithm implemented on the CPU/GPU heterogeneous computing environment greatly reduces the optimization time.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2017

HyperHeadTail v. 1.0

HyperHeadTail is a streaming algorithm for estimating the degree distribution of a graph from a stream of edges using very small storage space. Our algorithm builds upon the HeadTail algorithm of Simpson, Comandur, and McGregor [14], but extends it to handle repeat edges and variable-length sliding time windows, making it suitable for application to real-world streams such as those generated by network traffic or other communication networks.

Stolman, Andrew↗

DOE OSTI2022

Optimal resource allocation for flexible-grid entanglement distribution networks

We use a genetic algorithm (GA) as a design aid for determining the optimal provisioning of entangled photon spectrum in flex-grid quantum networks with arbitrary numbers of channels and users. After introducing a general model for entanglement distribution based on frequency-polarization hyperentangled biphotons, we derive upper bounds on fidelity and entangled bit rate for networks comprising one-to-one user connections. Simple conditions based on user detector quality and link efficiencies are found that determine whether entanglement is possible. We successfully apply a GA to find optimal resource allocations in four different representative network scenarios and validate features of our model experimentally in a quantum local area network in deployed fiber. Our results show promise for the rapid design of large-scale entanglement distribution networks.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2017

Modified Monte Carlo method for study of electron transport in degenerate electron gas in the presence of electron–electron interactions, application to graphene

Standard computational methods used to take account of the Pauli Exclusion Principle into Monte Carlo (MC) simulations of electron transport in semiconductors may give unphysical results in low field regime, where obtained electron distribution function takes values exceeding unity. Modified algorithms were already proposed and allow to correctly account for electron scattering on phonons or impurities. Present paper extends this approach and proposes improved simulation scheme allowing including Pauli exclusion principle for electron–electron (e–e) scattering into MC simulations. Simulations with significantly reduced computational cost recreate correct values of the electron distribution function. Proposed algorithm is applied to study transport properties of degenerate electrons in graphene with e–e interactions. This required adapting the treatment of e–e scattering in the case of linear band dispersion relation. Hence, this part of the simulation algorithm is described in details.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

DOE OSTI2022

A Peer-to-Peer Market-Based Control Strategy for a Smart Residential Community with Behind-the-Meter Distributed Energy Resources

This paper presents a distributed peer-to-peer market control strategy to manage and to enable resource sharing of behind-the-meter distributed energy resources in a residential community. In the proposed strategy, each consumer or prosumer determines the flexibility of their point of connection to the power network such that the obtained flexibility is network-feasible. Based on the feasible flexibility, the consumers and the prosumers trade power among each other at each time instance to fulfill their preferred load requirements while maximizing their payoffs and helping to regulate node voltages inside the community. Because the problem to be solved is non-convex, a distributed particle swarm optimization algorithm is used to coordinate the consumers/prosumers in a fully autonomous manner without any centralized or hierarchical coordination. Numerical simulations performed on a community of 48 homes demonstrate the efficacy of the proposed approach.

behind-the-meter↗

DOE OSTI2022

A Peer-to-Peer Market-Based Control Strategy for a Smart Residential Community with Behind-the-Meter Distributed Energy Resources: Preprint

This paper presents a distributed peer-to-peer market control strategy to manage and to enable resource sharing of behind-the-meter distributed energy resources in a residential community. In the proposed strategy, each consumer or prosumer determines the flexibility of their point of connection to the power network such that the obtained flexibility is network-feasible. Based on the feasible flexibility, the consumers and the prosumers trade power among each other at each time instance to fulfill their preferred load requirements while maximizing their payoffs and helping to regulate node voltages inside the community. Because the problem to be solved is non-convex, a distributed particle swarm optimization algorithm is used to coordinate the consumers/prosumers in a fully autonomous manner without any centralized or hierarchical coordination. Numerical simulations performed on a community of 48 homes demonstrate the efficacy of the proposed approach.

behind-the-meter↗

DOE OSTI2018

Quantum Key Distribution with Temporal Coding of Time-Bin Qubits

In this study, we demonstrate the possibility of realizing the quantum key distribution system by temporal coding of time-bin qubits that are prepared and measured using unbalanced Mach-Zehnder interferometers. We also show that, to exclude a clear a priori identification of time-bin qubits with equal bases, their encoding with the symbols 0 and 1 can be accomplished by delaying one of them by half the clock interval. The uniqueness of measurements of qutrits in this algorithm is shown to be based on the ability of quantum particles in β-states to interfere with the probability amplitudes at the ports of the system interferometers, as well as the absence of collisions of signaling states of the qutrits in adjacent clock intervals. We describe a method for controlling such collisions, including those that are based on qubits prepared from quasi-one-photon coherent laser states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2016

SU-D-BRC-03: Development and Validation of an Online 2D Dose Verification System for Daily Patient Plan Delivery Accuracy Check

Purpose: All plan verification systems for particle therapy are designed to do plan verification before treatment. However, the actual dose distributions during patient treatment are not known. This study develops an online 2D dose verification tool to check the daily dose delivery accuracy. Methods: A Siemens particle treatment system with a modulated scanning spot beam is used in our center. In order to do online dose verification, we made a program to reconstruct the delivered 2D dose distributions based on the daily treatment log files and depth dose distributions. In the log files we can get the focus size, position and particle number for each spot. A gamma analysis is used to compare the reconstructed dose distributions with the dose distributions from the TPS to assess the daily dose delivery accuracy. To verify the dose reconstruction algorithm, we compared the reconstructed dose distributions to dose distributions measured using PTW 729XDR ion chamber matrix for 13 real patient plans. Then we analyzed 100 treatment beams (58 carbon and 42 proton) for prostate, lung, ACC, NPC and chordoma patients. Results: For algorithm verification, the gamma passing rate was 97.95% for the 3%/3mm and 92.36% for the 2%/2mm criteria. For patient treatment analysis,the results were 97.7%±1.1% and 91.7%±2.5% for carbon and 89.9%±4.8% and 79.7%±7.7% for proton using 3%/3mm and 2%/2mm criteria, respectively. The reason for the lower passing rate for the proton beam is that the focus size deviations were larger than for the carbon beam. The average focus size deviations were −14.27% and −6.73% for proton and −5.26% and −0.93% for carbon in the x and y direction respectively. Conclusion: The verification software meets our requirements to check for daily dose delivery discrepancies. Such tools can enhance the current treatment plan and delivery verification processes and improve safety of clinical treatments.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2014

Design of Experiments, Model Calibration and Data Assimilation

This presentation provides an overview of emulation, calibration and experiment design for computer experiments. Emulation refers to building a statistical surrogate from a carefully selected and limited set of model runs to predict unsampled outputs. The standard kriging approach to emulation of complex computer models is presented. Calibration refers to the process of probabilistically constraining uncertain physics/engineering model inputs to be consistent with observed experimental data. An initial probability distribution for these parameters is updated using the experimental information. Markov chain Monte Carlo (MCMC) algorithms are often used to sample the calibrated parameter distribution. Several MCMC algorithms commonly employed in practice are presented, along with a popular diagnostic for evaluating chain behavior. Space-filling approaches to experiment design for selecting model runs to build effective emulators are discussed, including Latin Hypercube Design and extensions based on orthogonal array skeleton designs and imposed symmetry requirements. Optimization criteria that further enforce space-filling, possibly in projections of the input space, are mentioned. Designs to screen for important input variations are summarized and used for variable selection in a nuclear fuels performance application. This is followed by illustration of sequential experiment design strategies for optimization, global prediction, and rare event inference.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2025

Grid Modernization of Cooperatives and Municipal Utilities via Breakthrough System Monitoring, Control and Optimization (CRADA Final Report)

This project aims at developing and demonstrating successful implementation of breakthrough approaches in real-time data visualization as well as real-time distributed DER control and optimization to provide ample benefits to both utilities and end users. The National Renewable Energy Laboratory (NREL), Holy Cross Energy (HCE), National Rural Electric Cooperative Association (NRECA) and Survalent are collaborating to enable Cooperative and Municipal utilities to fully leverage DERs as part of their strategies for providing safe, reliable, and affordable electric services to their customers and help meet DOE Grid modernization goal of achieving at least 10% active devices to provide grid flexibility by 2035. This project will use novel real-time control algorithms and approaches for distributed control recently developed under DOE-funded projects, using the date from the Survalent’s basic SCADA engine, GIS and AMI engines deployed at HCE combined with NRECA’s globally-used MultiSpeak(R) software interoperability specification for seamless and real-time communications between electric utility enterprise software to embrace DER as part of their strategies for providing safe, reliable and affordable electric service to their customers.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2016

Developing Soret Transport Coefficients for Lanthanides from Experimental Results

Understanding the nature of lanthanide transport in metallic fuels and its relation to fuel clad chemical interaction (FCCI) has been has been a topic that is long on interest and short on data. Recent experiments have shown a strong temperature-gradient based diffusion (Soret diffusion) and have thus provided vitally important information for modelers. However, details about the actual coefficients and many of the relevant processes that crucially participate in the cerium migration and precipitation process have not yet been disclosed. Using a combination of computing tools (primarily python and BISON) we are exploring methods that may extract useful information from visual data. In this specific example, we are using what is formally called 'blob detection' algorithms to analyzed the precipitate distribution of cerium in a U-Zr metal that has had a fixed temperature gradient enforced upon it for a specified period of time. These algorithms, once properly adapted to the problem at hand, may be useful at extracting information from radial and axial scans of metallic fuels which are much more abundant than direct measurements of lanthanides. We have developed a model that qualitatively works to move mass along a temperature gradient and precipitate heavily in the cold regions. Additionally, we have observed that the solubility of cerium in U-Zr held under this kind of temperature gradient is subject to some amount of U-Zr constituent redistribution. Our results predict movement of the Zr toward the hot end of the rod followed by a U-rich layer with the cooler 3/5 of the rod staying close the the initial U-Zr distribution. A more complete analysis will define groups of correlated parameters that correctly simulate the resulting distribution of precipitates. This restricted parameters space will give smaller bounds to modelers and will expedite the analysis of future works as new and more accurate data are made available. A follow-up experiment that started with 1/10 of the initial concentration of cerium may provide valuable additional information with regard to the effect of the rates of precipitation and dissolution as well as demonstrating the potential rapidity of migration in a lower burnup scenario. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

DOE OSTI2018

A Two-Step Load Disaggregation Algorithm for Quasi-static Time-series Analysis on Actual Distribution Feeders

This paper focuses on developing a two-step load disaggregation method for conducting quasi-static time-series analysis using actual distribution feeder data. This can help utilities conduct power flow studies using smart meter measurements to assess the impact of high penetration of distributed energy resources. In the first step, load profiles of residential and commercial buildings obtained from smart meter data are used to match the load profile at the feeder head. This step will determine the number of residential and commercial loads on the feeder. The second step is to allocate the selected load profiles to each load node based on its transformer rating. This allows each load node to have its own load profile and the aggregation of those nodal load profiles matches closely to the metered feeder load shape at the substation. This algorithm is validated using smart meter data and the SCADA data of a real feeder. We compared the performance of the proposed method with the traditional load allocation method (i.e. use the feeder load shape for all subsequent load nodes scaling by the transformer capacities) when conducting quasi-static power flow studies. Results show that the proposed algorithm matches the utility data well and the obtained voltage profiles reveal more voltage dynamics than using the conventional load allocation method. (PDF) A Two-Step Load Disaggregation Algorithm for Quasi-static Time-series Analysis on Actual Distribution Feeders.

load disaggregation, load shape, quasi-static, tim↗

DOE OSTI2013

HELIOSEISMOLOGY OF PRE-EMERGING ACTIVE REGIONS. I. OVERVIEW, DATA, AND TARGET SELECTION CRITERIA

This first paper in a series describes the design of a study testing whether pre-appearance signatures of solar magnetic active regions were detectable using various tools of local helioseismology. The ultimate goal is to understand flux-emergence mechanisms by setting observational constraints on pre-appearance subsurface changes, for comparison with results from simulation efforts. This first paper provides details of the data selection and preparation of the samples, each containing over 100 members, of two populations: regions on the Sun that produced a numbered NOAA active region, and a 'control' sample of areas that did not. The seismology is performed on data from the GONG network; accompanying magnetic data from SOHO/MDI are used for co-temporal analysis of the surface magnetic field. Samples are drawn from 2001-2007, and each target is analyzed for 27.7 hr prior to an objectively determined time of emergence. The results of two analysis approaches are published separately: one based on averages of the seismology- and magnetic-derived signals over the samples, another based on Discriminant Analysis of these signals, for a statistical test of detectable differences between the two populations. We include here descriptions of a new potential-field calculation approach and the algorithm for matching sample distributions over multiple variables. We describe known sources of bias and the approaches used to mitigate them. We also describe unexpected bias sources uncovered during the course of the study and include a discussion of refinements that should be included in future work on this topic.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2020

Moment preserving constrained resampling with applications to particle-in-cell methods

The Moment Preserving Constrained Resampling (MPCR) algorithm for particle resampling is introduced and applied to particle-in-cell (PIC) methods to increase simulation accuracy, reduce compute cost, and/or avoid numerical instabilities. The general algorithm partitions the system space into smaller subsets and resamples the distribution within each subset. Further, the algorithm is designed to conserve any number of particle and grid moments with a high degree of accuracy (i.e. machine accuracy). The effectiveness of MPCR is demonstrated with several numerical tests, including a use-case study in gyrokinetic fusion plasma simulations. Finally, the computational cost of MPCR is negligible compared to the cost of particle evolution in PIC methods, and the tests demonstrate that periodic particle resampling yields a significant improvement in the accuracy and stability of the results.

63 RADIATION, THERMAL, AND OTHER ENVIRON. POLLUTAN↗