Engineering Papers⌕ Search

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.

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

At least 1,153 records · Page 64

Blockchain based Communication Architectures with Applications to Private Security Networks

Existing communication protocols in high consequence security networks are highly centralized. While this naively makes the controls easier to physically secure, external actors require fewer resources to disrupt the system because there are fewer points in the system can be destroyed or interrupted without the entire system failing. We present a solution to this problem using a proof-of-work-based blockchain implementation built on MultiChain. We construct a test-bed network containing two types of data input: visual imagers and microwave sensor information. These data types are ubiquitous in perimeter intrusion detection security systems and allow a realistic representation of a real-world network architecture. The cameras in this system use an object detection algorithm to nd important targets in the scene. The raw data from the camera and the outputs from the detection algorithm are then placed in a transaction on the distributed ledger. Similarly, microwave data is used to detect relevant events and are placed in a transaction. These transactions are then bundled into blocks and broadcast to the rest of the network using the Bitcoin-based MultiChain protocol. We develop five tests to examine the security metrics of our network. We performed the five security metric test using different sized networks from 7 to 39 nodes to determine how the metrics scale with respect to size. We nd that when compared to a centralized architecture our implementation provides a resiliency increase that is expected from a blockchain-based protocol without slowing the system so much that a human operator would notice. Furthermore, our approach is able to detect tampering in real time. Based on these results, we theorize that security networks in general could use a blockchain-based approach in a meaningful way.

97 MATHEMATICS AND COMPUTING↗

Introduction to Special Section: Machine Learning for Image-based Geologic Interpretation

Image-based geological interpretation has been a labor-intensive and time-consuming process because it requires well-trained geoscientists to identify geological structures, features, and textures from various types of images. These images include scanning electron microscopic images, optical microscopic images, optical photos, resistivity images, seismic volumes, remote-sensing images, etc. With fast-evolving machine learning (ML) technology and computing power in recent decades, computers can achieve nearhuman-level to super-human-level performance with scalable high efficiency in the computer vision field. These technological revolutions facilitated image-based geological interpretation in petroleum exploration and production. For example, a fault picking method applied to 3-D seismic volume data using deep learning can achieve superior performance in comparison to conventional auto-picking methods. In addition, under the new normal of low oil prices, the petroleum industry seeks cost-effective strategies such as automating traditionally labor-intensive processes. Nevertheless, the potential of applying ML to geological image interpretation is still facing a few key challenges including data scarcity, data distribution, poor data and/or label quality, data leakage, learning algorithms, model architecture, training methodologies, testing and evaluation metrics, hyper-parameters optimization, model drift, production deployment, and the like.

58 GEOSCIENCES↗

Tensor Decompositions for Count Data that Leverage Stochastic and Deterministic Optimization

There is growing interest to extend low-rank matrix decompositions to multi-way arrays, or tensors. One fundamental low-rank tensor decomposition is the canonical polyadic decomposition (CPD). The challenge of fitting a low-rank, nonnegative CPD model to Poisson-distributed count data is of particular interest. Several popular algorithms use local search methods to approximate the global maximum likelihood estimator from local minima. Simultaneously, a recent trend in theoretical computer science and numerical linear algebra leverages randomization to solve very large, hard problems. The typical approach is to use randomization for a fast approximation and determinism for refinement to yield effective algorithms with theoretical guarantees. Two popular algorithms for Poisson CPD reflect that emergent dichotomy: CP Alternating Poisson Regression is a deterministic algorithm and Generalized Canonical Polyadic decomposition makes use of stochastic algorithms in several variants. This work extends recent work to develop two new methods that leverage randomized and deterministic algorithms for improved accuracy and performance.

97 MATHEMATICS AND COMPUTING↗

Superresolution Full-polarimetric Imaging for Radio Interferometry with Sparse Modeling

We propose a new technique for radio interferometry to obtain superresolution full-polarization images in all four Stokes parameters using sparse modeling. The proposed technique reconstructs the image in each Stokes parameter from the corresponding full-complex Stokes visibilities by utilizing two regularization functions: the ℓ {sub 1} norm and the total variation (TV) of the brightness distribution. As an application of this technique, we present simulated linear polarization observations of two physically motivated models of M87 with the Event Horizon Telescope. We confirm that ℓ {sub 1}+TV regularization can achieve an optimal resolution of ~25%–30% of the diffraction limit λ/D{sub max}, which is the nominal spatial resolution of a radio interferometer for both the total intensity (i.e., Stokes I) and linear polarizations (i.e., Stokes Q and U). This optimal resolution is better than that obtained from the widely used Cotton–Schwab CLEAN algorithm or from using ℓ {sub 1} or TV regularizations alone. Furthermore, we find that ℓ {sub 1}+TV regularization can achieve much better image fidelity in linear polarization than other techniques over a wide range of spatial scales, not only in the superresolution regime, but also on scales larger than the diffraction limit. Our results clearly demonstrate that sparse reconstruction is a useful choice for high-fidelity full-polarimetric interferometric imaging.

79 ASTRONOMY AND ASTROPHYSICS↗

EVIDENCE FOR REDUCED SPECIFIC STAR FORMATION RATES IN THE CENTERS OF MASSIVE GALAXIES AT z = 4

We perform the first spatially resolved stellar population study of galaxies in the early universe ( z = 3.5–6.5), utilizing the Hubble Space Telescope Cosmic Assembly Near-infrared Deep Extragalactic Legacy Survey imaging data set over the GOODS-S field. We select a sample of 418 bright and extended galaxies at z = 3.5–6.5 from a parent sample of ∼8000 photometric-redshift-selected galaxies from Finkelstein et al. We first examine galaxies at 3.5 ≲ z ≲ 4.0 using additional deep K -band survey data from the HAWK-I UDS and GOODS Survey which covers the 4000 Å break at these redshifts. We measure the stellar mass, star formation rate, and dust extinction for galaxy inner and outer regions via spatially resolved spectral energy distribution fitting based on a Markov Chain Monte Carlo algorithm. By comparing specific star formation rates (sSFRs) between inner and outer parts of the galaxies we find that the majority of galaxies with high central mass densities show evidence for a preferentially lower sSFR in their centers than in their outer regions, indicative of reduced sSFRs in their central regions. We also study galaxies at z ∼ 5 and 6 (here limited to high spatial resolution in the rest-frame ultraviolet only), finding that they show sSFRs which are generally independent of radial distance from the center of the galaxies. This indicates that stars are formed uniformly at all radii in massive galaxies at z ∼ 5–6, contrary to massive galaxies at z ≲ 4.

79 ASTRONOMY AND ASTROPHYSICS↗

A single-column particle-resolved model for simulating the vertical distribution of aerosol mixing state: WRF-PartMC-MOSAIC-SCM v1.0

Abstract. The PartMC-MOSAIC particle-resolved aerosol model was previously developed to predict the aerosol mixing state as it evolves in the atmosphere. However, the modeling framework was limited to a zero-dimensional box model approach without resolving spatial gradients in aerosol concentrations. This paper presents the development of stochastic particle methods to simulate turbulent diffusion and dry deposition of aerosol particles in a vertical column within the planetary boundary layer. The new model, WRF-PartMC-MOSAIC-SCM, resolves the vertical distribution of aerosol mixing state. We verified the new algorithms with analytical solutions for idealized test cases and illustrate the capabilities with results from a 2-day urban scenario that shows the evolution of black carbon mixing state in a vertical column.

54 ENVIRONMENTAL SCIENCES↗

SIERRA Toolkit v. 2.0

The SIERRA Toolkit is a collection of libraries to facilitate the development of parallel engineering analysis applications. These libraries supply basic core services that an engineering application may need such as a parallel distributed and dynamic mesh database (for unstructured meshes), mechanics algorithm support (parallel infrastructure only), interfaces to parallel solvers, parallel mesh and data I/O, and various utilities (timers, diagnostic tools, etc.)

Coffey, Todd↗

Photovoltaic Hosting Capacity of Feeders with Reactive Power Control and Tap Changers

This paper proposes an algorithm to determine photovoltaic (PV) hosting capacity of power distribution networks as a function of number of PV injection nodes, reactive power support from the PVs, and the sub-station load tap changers (LTCs). In the proposed method, several minute by minute simulations are run based on randomly chosen PV injection nodes, daily PV output profiles, and daily load profiles from a pool of high-resolution realistic data set. The simulation setup is built using OpenDSS and MATLAB. The performance of the proposed method is investigated in the IEEE 123-node distribution feeder for multiple scenarios. The case studies are performed particularly for one, two, five and ten PV injection nodes, and looking at the maximum voltage deviations. Case studies show that the PV hosting capacity of the 123-node feeder greatly differs with the number of PV injection nodes. We have also observed that the PV hosting capacity increases with reactive power support and higher tap position of sub-station LTC.

14 SOLAR ENERGY↗

An Orthogonal Recursive Bisection (ORB) Based Time Advancement Algorithm for CFD-DEM Solvers

The time integration of the granular phase in coupled computational fluid dynamics (CFD) – discrete element method (DEM) simulations presents a unique computational challenge brought about by the large variations in particle collisional time scales. Particles in the dilute regions of the computational domain can be advanced with large time steps while dense regions require much smaller time increments. However, the time step size in most solvers is globally set as the limit for accuracy and stability imposed by the collisions and is typically orders of magnitude less than that required away from collisions. This work addresses this precise issue and provides a strategy to avoid the use of a global conservative small time step size for the entire set of particles.A novel time stepping algorithm for CFD-DEM solvers using a partitioning approach using orthogonal recursive bisection (ORB) that allows for variable time steps among particles is described and its computational performance is compared against baseline explicit methods, typically used in several CFD-DEM solvers. ORB has advantages of being relatively quick and easy to update incrementally and has the required heuristic behavior (i.e., it will split the region in half with a cluster on each side) when groups of particles are well separated (clustered). The algorithm presented in this work uses a local time stepping approach to resolve collisional time scales for subsets of particles that are present at the leaves of the ORB, thereby resulting in substantial reduction of computational cost. The parallel implementation of this method where a ``knapsack” algorithm is used in tandem with ORB for effective load-balancing is also presented, where a best possible partitioning is obtained based on number of particles and local time-stepping costs. The algorithm is tested against benchmark problems with varying particle distributions that include fluidized bed and riser flow scenarios. Preliminary results indicate that the approach is 2-3X faster than traditional explicit methods for problems that involve both dense and dilute regions, while maintaining the same level of accuracy.

adaptive timestepping↗

System and method for focal-plane illuminator/detector (FASID) design for improved graded index lenses

The present disclosure relates to a detector system for imaging an optical signal received by a graded index (GRIN) optical element to account for known variations in a graded index distribution of the GRIN optical element. The detector system incorporates a plurality of optical detector elements configured to receive optical rays received by the GRIN optical element at specific locations on a plane of the GRIN optical element. Ray tracing software is configured to receive and map the optical rays to a plurality of additional specific locations on the plane based on the known variations in the graded index distribution of the GRIN optical element. A processor uses algorithms for diagonalization of a linear system matrix to determine information on both an intensity and an angle of the received optical rays at each one of the plurality of specific locations on the plane.

Bude, Jeffrey Devin↗

HHL algorithm with mapping function and enhanced sampling for model predictive control in microgrids

Here, this paper presents a refined quantum Harrow Hassidim Lloyd (HHL) algorithm for microgrid control. The first novelty of the developed method is that a mapping shift function enables the original HHL algorithm to handle general linear equations with non-singular and indefinite matrix. Second, a method of Matrix Extension for Amplifying Sampling Probabilities of Intended Solution (ME-ASPI) is proposed to design the reformulated linear algebraic equations, allowing for improved sampling efficiency of the quantum tomography in the refined HHL algorithm. Then, we applied the method to solve the model predictive control (MPC) problem in nonlinear dynamical microgrids. Specifically, with the ME-ASPI method, the refined HHL algorithm can effectively obtain the intended partial optimal control inputs for MPC. The optimization of quadratic programming problem in each time step of MPC is transformed into a linear system problem, which is addressed by the proposed quantum solver through using only partial information, with the time complexity improved from $\mathscr{O}(\mathscr{N}^{2.37286})$ classically to $\mathscr{O}(\mathscr{N}^{2} log \mathscr{N}$ x $p$ log $p)$ in quantum. Numerical examples have validated the effectiveness of the refined HHL algorithm with the proposed mapping function and the ME-ASPI method. By leveraging quantum properties, the proposed method provides a hybrid quantum–classical framework for microgrid control. This generic method can also potentially tackle many other challenges in analyzing and controlling general complex engineered systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Noise spatial nonuniformity and the impact of statistical image reconstruction in CT myocardial perfusion imaging

Purpose: To achieve high temporal resolution in CT myocardial perfusion imaging (MPI), images are often reconstructed using filtered backprojection (FBP) algorithms from data acquired within a short-scan angular range. However, the variation in the central angle from one time frame to the next in gated short scans has been shown to create detrimental partial scan artifacts when performing quantitative MPI measurements. This study has two main purposes. (1) To demonstrate the existence of a distinct detrimental effect in short-scan FBP, i.e., the introduction of a nonuniform spatial image noise distribution; this nonuniformity can lead to unexpectedly high image noise and streaking artifacts, which may affect CT MPI quantification. (2) To demonstrate that statistical image reconstruction (SIR) algorithms can be a potential solution to address the nonuniform spatial noise distribution problem and can also lead to radiation dose reduction in the context of CT MPI. Methods: Projection datasets from a numerically simulated perfusion phantom and an in vivo animal myocardial perfusion CT scan were used in this study. In the numerical phantom, multiple realizations of Poisson noise were added to projection data at each time frame to investigate the spatial distribution of noise. Images from all datasets were reconstructed using both FBP and SIR reconstruction algorithms. To quantify the spatial distribution of noise, the mean and standard deviation were measured in several regions of interest (ROIs) and analyzed across time frames. In the in vivo study, two low-dose scans at tube currents of 25 and 50 mA were reconstructed using FBP and SIR. Quantitative perfusion metrics, namely, the normalized upslope (NUS), myocardial blood volume (MBV), and first moment transit time (FMT), were measured for two ROIs and compared to reference values obtained from a high-dose scan performed at 500 mA. Results: Images reconstructed using FBP showed a highly nonuniform spatial distribution of noise. This spatial nonuniformity led to large fluctuations in the temporal direction. In the numerical phantom study, the level of noise was shown to vary by as much as 87% within a given image, and as much as 110% between different time frames for a ROI far from isocenter. The spatially nonuniform noise pattern was shown to correlate with the source trajectory and the object structure. In contrast, images reconstructed using SIR showed a highly uniform spatial distribution of noise, leading to smaller unexpected noise fluctuations in the temporal direction when a short scan angular range was used. In the numerical phantom study, the noise varied by less than 37% within a given image, and by less than 20% between different time frames. Also, the noise standard deviation in SIR images was on average half of that of FBP images. In the in vivo studies, the deviation observed between quantitative perfusion metrics measured from low-dose scans and high-dose scans was mitigated when SIR was used instead of FBP to reconstruct images. Conclusions: (1) Images reconstructed using FBP suffered from nonuniform spatial noise levels. This nonuniformity is another manifestation of the detrimental effects caused by short-scan reconstruction in CT MPI. (2) Images reconstructed using SIR had a much lower and more uniform noise level and thus can be used as a potential solution to address the FBP nonuniformity. (3) Given the improvement in the accuracy of the perfusion metrics when using SIR, it may be desirable to use a statistical reconstruction framework to perform low-dose dynamic CT MPI.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Evaluation of a new commercial Monte Carlo dose calculation algorithm for electron beams

Purpose: In this report the authors present the validation of a Monte Carlo dose calculation algorithm (XiO EMC from Elekta Software) for electron beams. Methods: Calculated and measured dose distributions were compared for homogeneous water phantoms and for a 3D heterogeneous phantom meant to approximate the geometry of a trachea and spine. Comparisons of measurements and calculated data were performed using 2D and 3D gamma index dose comparison metrics. Results: Measured outputs agree with calculated values within estimated uncertainties for standard and extended SSDs for open applicators, and for cutouts, with the exception of the 17 MeV electron beam at extended SSD for cutout sizes smaller than 5 × 5 cm{sup 2}. Good agreement was obtained between calculated and experimental depth dose curves and dose profiles (minimum number of measurements that pass a 2%/2 mm agreement 2D gamma index criteria for any applicator or energy was 97%). Dose calculations in a heterogeneous phantom agree with radiochromic film measurements (>98% of pixels pass a 3 dimensional 3%/2 mm γ-criteria) provided that the steep dose gradient in the depth direction is considered. Conclusions: Clinically acceptable agreement (at the 2%/2 mm level) between the measurements and calculated data for measurements in water are obtained for this dose calculation algorithm. Radiochromic film is a useful tool to evaluate the accuracy of electron MC treatment planning systems in heterogeneous media.

61 RADIATION PROTECTION AND DOSIMETRY↗

Longitudinal Phase Space Tomography for the Booster Synchrotron

Efforts in the study of the longitudinal behavior of charged particles in the Fermilab Booster can be catalyzed with an image of the two-dimensional phase space distribution. In the past, tomography had been employed in the reconstruction of the phase space in accelerators such as the Recycler at Fermilab and the Proton Synchrotron Booster at CERN. However, such a capability had yet to realize for the Fermilab Booster synchrotron. In this work, the first successful tomographic phase space reconstruction of a low-energy Booster bunch is presented along with validation metrics. A numerical turn-by-turn model of the longitudinal particle dynamics in the Booster has been implemented, which utilizes a fast, map-based particle transport algorithm. Using a sinogram generated from the Wall Current Monitor signal, the iterative reconstruction algorithm recovers a discretized image of the original phase space distribution at variable resolution. The reconstruction result shows low root-mean-square error and a rapid convergence toward the solution, providing strong evidence of accuracy. Future and ongoing work includes modeling high-energy bunches above transition and using tomography to infer certain machine parameters such as synchronous phase, peak gap voltage, and synchronous energy in addition to the phase space distribution.

Ebeid, Safi [Unlisted; Fermilab]↗

Longitudinal Phase Space Tomography for the Booster Synchrotron

Efforts in the study of the longitudinal behavior of charged particles in the Fermilab Booster can be catalyzed with an image of the two-dimensional phase space distribution. In the past, tomography has been extensively employed in the reconstruction of the phase space in accelerators such as the Recycler at Fermilab and the Proton Synchrotron Booster at CERN. However, such a capability had yet to realize for the Fermilab Booster synchrotron. In this work, the first successful tomographic phase space reconstruction of a low-energy Booster bunch is presented along with validation metrics. A numerical turn-by-turn model of the longitudinal particle dynamics in the Booster has been implemented, which utilizes a fast, map-based particle transport algorithm. Using a sinogram generated from the Wall Current Monitor, the iterative reconstruction algorithm recovers a discretized image of the original phase space distribution at variable resolution. The reconstruction result shows low root-mean-square error and a rapid convergence toward the solution, providing strong evidence of accuracy. Future and ongoing work includes modeling high-energy bunches above transition and using tomography to infer certain machine parameters such as synchronous phase, peak gap voltage, and synchronous energy in addition to the phase space distribution.

Ebeid, Safi [Unlisted]↗

Longitudinal Phase Space Tomography for the Booster Synchrotron (Abstract Only)

Efforts in the study of the longitudinal behavior of charged particles in the Fermilab Booster can be catalyzed with an image of the two-dimensional phase space distribution. In the past, tomography has been extensively employed in the reconstruction of the phase space in accelerators such as the Recycler at Fermilab and the Proton Synchrotron Booster at CERN. However, such a capability had yet to realize for the Fermilab Booster synchrotron. In this work, the first successful tomographic phase space reconstruction of a low-energy Booster bunch is presented along with validation metrics. A numerical turn-by-turn model of the longitudinal particle dynamics in the Booster has been implemented, which utilizes a fast, map-based particle transport algorithm. Using a sinogram generated from the Wall Current Monitor, the iterative reconstruction algorithm recovers a discretized image of the original phase space distribution at variable resolution. The reconstruction result shows low root-mean-square error and a rapid convergence toward the solution, providing strong evidence of accuracy. Future and ongoing work includes modeling high-energy bunches above transition and using tomography to infer certain machine parameters such as synchronous phase, peak gap voltage, and synchronous energy in addition to the phase space distribution.

Ebeid, Safi [Unlisted, US]↗

Multi-Agent Reinforcement Learning for Distribution System Critical Load Restoration

Grid resilience has become a critical topic recently because of the increasing occurrence of extreme events and the growing integration of intermittent renewable energy sources. To build a resilient distribution system, this paper develops a multiagent reinforcement learning-based (MARL) method to coordinate distribution energy resources (DERs) dispatch, load pickup, and network reconfiguration for load restoration after a system outage. With the help of two types of control agents, namely critical load restoration (CLR) and coordination (COR) agents, system loads can be restored efficiently, given available resources. The effectiveness and superiority of the proposed algorithm are demonstrated through simulations and comparative studies on a real distribution feeder in Western Colorado.

distribution system↗

Multi-Agent Reinforcement Learning for Distribution System Critical Load Restoration: Preprint

Grid resilience has become a critical topic recently because of the increasing occurrence of extreme events and the growing integration of intermittent renewable energy sources. To build a resilient distribution system, this paper develops a multi-agent reinforcement learning-based (MARL) method to coordinate distribution energy resources (DERs) dispatch, load pickup, and network reconfiguration for load restoration after a system outage. With the help of two types of control agents, namely critical load restoration (CLR) and coordination (COR) agents, system loads can be restored efficiently, given available resources. The effectiveness and superiority of the proposed algorithm are demonstrated through simulations and comparative studies on a real distribution feeder in Western Colorado.

distribution system↗