Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithmic efficiency”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 1,495 records · Page 83

Curvilinear Aperture Monopulse

By a symmetry argument, a synthetic aperture radar collection along a linear path does not collect three-dimensional information about the scene. However, it is known that vertical curvature can be used to derive some vertical position information. This paper approaches the problem from a monopulse perspective, resulting in a non-iterative computation that commutes with efficient image formation algorithms.

Story, Mark↗

A Reference Model for Virtual Machine Launching Overhead

Cloud bursting is one of the key research topics in the cloud computing communities. A well designed cloud bursting module enables private clouds to automatically launch virtual machines (VMs) to public clouds when more resources are needed. One of the main challenges in developing a cloud bursting module is to decide when and where to launch a VM so that all resources are most effectively and efficiently utilized and the system performance is optimized. However, based on system operational data obtained from FermiCloud, a private cloud developed by the Fermi National Accelerator Laboratory for scientific workflows, the VM launching overhead is not a constant. It varies with physical resource utilization, such as CPU and I/O device utilizations, at the time when a VM is launched. Hence, to make judicious decisions as to when and where a VM should be launched, a VM launching overhead reference model is needed. In this paper, we first develop a VM launching overhead reference model based on operational data we have obtained on FermiCloud. Second, we apply the developed reference model on FermiCloud and compare calculated VM launching overhead values based on the model with measured overhead values on FermiCloud. Our empirical results on FermiCloud indicate that the developed reference model is accurate. We believe, with the guidance of the developed reference model, efficient resource allocation algorithms can be developed for cloud bursting process to minimize the operational cost and resource waste.

Wu, Hao↗

Resilience Enhancement of Distribution Grids Against Extreme Weather Events

This paper proposes a resilience-oriented design (ROD) technique to protect distribution grids against high-impact but low-probability extreme weather events. The problem is formulated as a two-stage stochastic mixed integer problem. The first stage is to make ROD decisions, i.e., hardening existing distribution lines and deploying ROD resources such as back-up distributed generators and automatic switches. The second stage evaluates the system operation cost during a realized extreme weather event and repair cost after the event. A novel modeling strategy is proposed to deal with the decision-dependent uncertainty of distribution line damage status, which is affected by the first-stage hardening decisions. As both stages have binary variables, a modified and computationally efficient progressive hedging algorithm with scenario bundling is introduced. The algorithm performance is evaluated by calculating lower bounds of solutions. In conclusion, the proposed model and algorithms are demonstrated on 34-bus and 123-bus test feeders.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A New LMP-Sensitivity-Based Heterogeneous Decomposition for Transmission and Distribution Coordinated Economic Dispatch

Transmission and distribution coordinated economic dispatch (TDCED) will be necessary to settle the problems caused by high penetrations of distributed generators in future grids. An efficient heterogeneous decomposition algorithm (HGD) was proposed to solve the TDCED, but it may diverge occasionally. To overcome this shortcoming, a new HGD (N-HGD) with enhanced convergency is proposed and studied in this paper. Compared with the previous HGD, the N-HGD similarly decomposes the TDCED into transmission ED and distribution ED subproblems, but it considers the sensitivity of the boundary locational marginal price to load injections to enhance convergency and avoid divergence. Two kinds of sensitivity computing methods, M-c and M-p, are studied. M-c is based on a centralized sensitivity equation, executed on the transmission side. M-p is based on a probing mechanism and can be executed distributedly on the distribution side. The reason for the N-HGD's improved convergency is theoretically analyzed, and the optimality is proven. Numerical tests show that N-HGD performs better than the original HGD, as well as a penalty-based modified HGD that needs a careful parametertuning process. Furthermore, compared with M-c, an M-p-based N-HGD is preferable because it has a much lower computational cost and no additional communicational cost.

distribution↗

A Two-Stage Kalman Filter Approach for Robust and Real-Time Power System State Estimation

As electricity demand continues to grow and renewable energy increases its penetration in the power grid, realtime state estimation becomes essential for system monitoring and control. Recent development in phasor technology makes it possible with high-speed time-synchronized data provided by Phasor Measurement Units (PMU). In this paper we present a two-stage Kalman filter approach to estimate the static state of voltage magnitudes and phase angles, as well as the dynamic state of generator rotor angles and speeds. Kalman filters achieve optimal performance only when the system noise characteristics have known statistical properties (zero-mean, Gaussian, and spectrally white). However in practice the process and measurement noise models are usually difficult to obtain. Thus we have developed the Adaptive Kalman Filter with Inflatable Noise Variances (AKF with InNoVa), an algorithm that can efficiently identify and reduce the impact of incorrect system modeling and/or erroneous measurements. In stage one, we estimate the static state from raw PMU measurements using the AKF with InNoVa; then in stage two, the estimated static state is fed into an extended Kalman filter to estimate the dynamic state. Simulations demonstrate its robustness to sudden changes of system dynamics and erroneous measurements.

Zhang, Jinghe↗

A Non-Cooperative Game-Based Distributed Beam Scheduling Framework for 5G Millimeter-Wave Cellular Networks

Here, this paper studies the problem of distributed beam scheduling for 5G millimeter-Wave (mm-Wave) cellular networks where base stations (BSs) belonging to different operators share the same spectrum without centralized coordination among them. Our goal is to design efficient distributed scheduling algorithms to maximize the network utility, which is a function of the achieved throughput by the user equipment (UEs), subject to the average and instantaneous power consumption constraints of the BSs. We propose a Media Access Control (MAC) and a power allocation/adaptation mechanism utilizing the Lyapunov stochastic optimization framework and non-cooperative games. In particular, we first decompose the original utility maximization problem into two sub-optimization problems for each time frame, which are a convex optimization problem and a non-convex optimization problem, respectively. By formulating the distributed scheduling problem as a non-cooperative game where each BS is a player attempting to optimize its own utility, we provide a distributed solution to the non-convex sub-optimization problem via finding the Nash Equilibrium (NE) of the game whose weights are determined optimally by the Lyapunov optimization framework. Finally, we conduct simulation under various network settings to show the effectiveness of the proposed game-based beam scheduling algorithm in comparison to that of several reference schemes.

42 ENGINEERING↗

WE-EF-303-07: Imaging of Prompt Gamma Rays Emitted During Delivery of Clinical Proton Beams with a Compton Camera: Feasibility Studies for Range Verification

Purpose: Evaluation of a prototype Compton camera (CC) for imaging prompt gamma rays (PG) emitted during clinical proton beam irradiation for in vivo beam range verification. Methods: We irradiated a water phantom with 114 MeV and 150 MeV proton pencil beams at clinical beam currents ranging from 1 nA up to 5 nA. The CC was placed 15 cm from the beam central axis and PGs from 0.2 MeV up to 6.5 MeV were measured during irradiation. From the measured data, 2-dimensional (2D) PG images were reconstructed. One-dimensional (1D) profiles from the PG images were compared to measured depth dose curves. Results: The CC was able to measure PG emission during delivery of both a single 150 MeV pencil beam and a 5 cm x 5 cm mono-energetic layer of 114 MeV pencil beams. From the 2D images, a strong correlation was seen between the depth of the distal falloff of PG emission and the Bragg peak (BP). 1D profiles extracted from the PG images show that the distal 60% falloff of the PG emission lined up well with the distal 90% of the BP. Shifts as small as 3 mm in the beam range could be detected on both the 2D PG images and 1D profiles with an uncertainty of 1.5 mm. With the current CC prototype, a minimum dose delivery of 400 cGy was required to produce usable PG images. Conclusions: It was possible to measure and image PG emission with our prototype CC during proton beam delivery and to detect shifts in the BP range in the images. Therefore prompt gamma imaging with a CC for the purpose of in vivo range verification is feasible. However, for the studied system improvements in detector efficiency and reconstruction algorithms are necessary to make it clinically viable.

60 APPLIED LIFE SCIENCES↗

A New Class of AMG Interpolation Methods Based on Matrix-Matrix Multiplications

A new class of distance-two interpolation methods for algebraic multigrid (AMG) that can be formulated in terms of sparse matrix-matrix multiplications is presented and analyzed. Compared with similar distance-two prolongation operators, the proposed algorithms exhibit improved efficiency and portability to various computing platforms, since they allow one to easily exploit existing high-performance sparse matrix kernels. The new interpolation methods have been implemented in hypre, a widely used parallel multigrid solver library. With the proposed interpolations, the overall time of hypre's BoomerAMG setup can be considerably reduced, while sustaining equivalent, sometimes improved, convergence rates. Numerical results for a variety of test problems on parallel machines are presented that support the superiority of the proposed interpolation operators over the existing ones in hypre.

97 MATHEMATICS AND COMPUTING↗

Monolithic Multigrid for a Reduced-Quadrature Discretization of Poroelasticity

Advanced finite-element discretizations and preconditioners for models of poroelasticity have attracted significant attention in recent years. The equations of poroelasticity offer significant challenges in both areas, due to the potentially strong coupling between unknowns in the system, saddle-point structure, and the need to account for wide ranges of parameter values, including limiting behavior such as incompressible elasticity. This paper was motivated by an attempt to develop monolithic multigrid preconditioners for the discretization developed in [C. Rodrigo et al., Comput. Methods App. Mech. Engrg, 341 (2018), pp. 467--484]; we show here why this is a difficult task and, as a result, we modify the discretization in [Rodrigo et al.] through the use of a reduced-quadrature approximation, yielding a more “solver-friendly” discretization. Local Fourier analysis is used to optimize parameters in the resulting monolithic multigrid method, allowing a fair comparison between the performance and costs of methods based on Vanka and Braess--Sarazin relaxation. Further, numerical results are presented to validate the local Fourier analysis predictions and demonstrate efficiency of the algorithms. Finally, a comparison to existing block-factorization preconditioners is also given.

97 MATHEMATICS AND COMPUTING↗

Covariance-Free Bifidelity Control Variates Importance Sampling for Rare Event Reliability Analysis

Multifidelity modeling has been steadily gaining attention as a tool to address the problem of exorbitant model evaluation costs that makes the estimation of failure probabilities a significant computational challenge for complex real-world problems, particularly when failure is a rare event. To implement multifidelity modeling, estimators that efficiently combine information from multiple models/sources are necessary. In past works, the variance reduction techniques of control variates (CV) and importance sampling (IS) have been leveraged for this task. In this paper, we present the CVIS framework—a creative take on a coupled CV and IS estimator for bifidelity reliability analysis. The framework addresses some of the practical challenges of the CV method by using an estimator for the control variate mean and sidestepping the need to estimate the covariance between the original estimator and the control variate through a clever choice for the tuning constant. Furthermore, the task of selecting an efficient IS distribution is also considered, with a view towards maximally leveraging the bifidelity structure and maintaining expressivity. Additionally, a diagnostic is provided that indicates both the efficiency of the algorithm as well as the relative predictive quality of the models utilized. Finally, the behavior and performance of the framework is explored through analytical and numerical examples.

Markov chain Monte Carlo↗

Power System Frequency Dynamics Modeling, State Estimation, and Control using Neural Ordinary Differential Equations (NODEs) and Soft Actor-Critic (SAC) Machine Learning Approaches

With the global energy transition of the electric power system, grid control, supervision, and protection is becoming more challenging. With the increasing integration of renewable energy sources (RES), the system dynamics are changing, causing traditional power system dynamic modeling with swing equation-based modeling approaches to fail. Additionally, the converter-dominated power grid is decreasing the system inertia, making the power system more fragile to the frequency swings. This paper first investigates and compares the application of a model-based Kalman filter state estimation approach with (i) a model-free machine learning approach --- neural ordinary differential equations (NODEs) --- and (ii) a data-driven system identification (SysId) approach to model and infer critical state values of the power system frequency dynamics. Then a model predictive control (MPC) framework is compared to a model-free Soft Actor-Critic (SAC) reinforcement learning (RL) control algorithm in providing efficient fast frequency response (FFR) to the power system frequency dynamics. The approaches are compared in terms of their performance goals as well as their per-timestep computational efficiency. Furthermore, the comparative study for state estimation shows that for the model-free requirement, both NODEs and SysId can provide accurate state estimates; however, with increasing model complexity, NODEs can be a better choice for model identification. Similarly, the results from the FFR comparative study show that the SAC RL-based FFR, once trained, outperforms MPC with better control signals and faster computation time, making the SAC RL-based FFR better option for providing FFR to the power system.

97 MATHEMATICS AND COMPUTING↗

Stochastic Vector Techniques in Ground-State Electronic Structure

Herein we review a suite of stochastic vector computational approaches for studying the electronic structure of extended condensed matter systems. These techniques help reduce algorithmic complexity, facilitate efficient parallelization, simplify computational tasks, accelerate calculations, and diminish memory requirements. While their scope is vast, we limit our study to ground-state and finite temperature density functional theory (DFT) and second-order many-body perturbation theory. More advanced topics, such as quasiparticle (charge) and optical (neutral) excitations and higher-order processes, are covered elsewhere. We start by explaining how to use stochastic vectors in computations, characterizing the associated statistical errors. Next, we show how to estimate the electron density in DFT and discuss effective techniques to reduce statistical errors. Finally, we review the use of stochastic vectors for calculating correlation energies within the second-order Møller-Plesset perturbation theory and its finite temperature variational form. Example calculation results are presented and used to demonstrate the efficacy of the methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Real-time Nonlinear Model Predictive Control (NMPC) Strategies using Physics-Based Models for Advanced Lithium-ion Battery Management System (BMS)

Optimal operation of lithium-ion batteries requires robust battery models for advanced battery management systems (ABMS). A nonlinear model predictive control strategy is proposed that directly employs the pseudo-two-dimensional (P2D) model for making predictions. Using robust and efficient model simulation algorithms developed previously, the computational time of the nonlinear model predictive control algorithm is quantified, and the ability to use such models for nonlinear model predictive control for ABMS is established.

25 ENERGY STORAGE↗

shiftNMFk 1.1: Robust Nonnegative matrix factorization with kmeans clustering and signal shift, for allocation of unknown physical sources, toy version for open sourcing with publications

This code is a toy (short) version of CODE-2016-83. From a general perspective, the code represents an unsupervised adaptive machine learning algorithm that allows efficient and high performance de-mixing and feature extraction of a multitude of non-negative signals mixed and recorded by a network of uncorrelated sensor arrays. The code identifies the number of the mixed original signals and their locations. Further, the code also allows deciphering of signals that have been delayed in regards to the mixing process in each sensor. This code is high customizable and it can be efficiently used for a fast macro-analyses of data. The code is applicable to a plethora of distinct problems: chemical decomposition, pressure transient decomposition, unknown sources/signal allocation, EM signal decomposition. An additional procedure for allocation of the unknown sources is incorporated in the code.

Alexandrov, BoianS.↗

Blazing Signature Filter

BSF is a highly efficient pairwise similarity algorithm enabling extensive data mining.

Source record↗

Dimensionality Reduction Library v 0.2

Dimensionality Reduction Library is a C++ library for dimensionality reduction. In the context of this library, dimensionality reduction is considered to consist of 1)estimation of the intrinsic dimensionality using sampled data, 2) Finding maps that reduce the dimensionality of data (forward map) or increase the dimensionality of data (reverse map) and 3) mapping arbitray coordinates to high and low dimensionalities. The library is intended to provide a consistent interface to multiple dimensionality reduction algorithms with an efficient C++ interface that runs efficiently on multicore architectures. A few routines have been optimized with an option for GPU acceleration or distributed computation. Currently the library offers intrinsic dimensionality estimation using point-PCA reconstruction error and/ residual variance. The following dimensionality reduction methods have been implemented: Principal Component Analysis Multidimensional Scaling Locally Linear Embedding IsoMap Autoencoder Neutral Networks An executable is also supplied that can be built to allow for command-line access to the library routines. A description for an application of the library for molecular structure analysis has been published.

BROWN, WILLIAM↗

bsf-py

Python wrapper for Blazing Signature Filter; The Blazing Signature Filter (BSF) is a highly efficient pairwise similarity algorithm which enables extensive data mining within a reasonable amount of time.

Lee, Joon-Yong↗

Finite-element analysis of top-casing electric source method for imaging hydraulically active fracture zones

Imaging hydraulically active fracture zones (HAFZ) is of paramount importance to subsurface resource extraction, geologic storage, and hazardous waste disposal. We have developed advanced 3D finite-element (FE) electrical imaging algorithms for HAFZ in the presence of a steel-cased well. The algorithms use tetrahedral FE meshes in the simulation domain and coarse rectangular finite-difference meshes in the imaging domain. This heterogeneous dual-mesh approach is well suited to modeling the multiscale earth model due to steel-cased wells. We find that the algorithms accurately and efficiently simulate surface electric field measurements over a 3D HAFZ at depth when one end point of a surface electric source is connected to a wellhead. For brevity, this configuration is called the top-casing electric source method. By replacing a hollow cased well with a solid prism, we improve our computational efficiency without affecting the solution accuracy. The sensitivity of the top-casing source method to HAFZ highly depends on the continuity of a steel-cased well because it makes currents preferentially flow to HAFZ. The sensitivity also depends on conductivity structures around the well because they control current leaking from the steel-cased well. We find that the method can image a localized HAFZ and detect changes in its width and height. Here, the imaging results are improved when a volume of the imaging domain is constrained from geomechanical perspectives. A primary advantage of the method is the fact that the sources and receivers are placed on the surface, thus not interrupting the well operation.

3D↗