Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization problems”

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,189 records · Page 66

Voltage Stability Constrained Moving Target Defense Against Net Load Redistribution Attacks

Moving target defense (MTD) using distributed flexible AC transmission system (D-FACTS) devices is a promising defense strategy to detect stealthy false data injection (FDI) attacks against the power system state estimation. However, all existing studies myopically perturb the reactance of D-FACTS lines without considering the system voltage stability. In this paper, we first illustrate voltage instability induced by MTDs in a three-bus system. To address this issue, we further propose a novel MTD framework that explicitly considers system voltage stability by using continuation power flow and voltage stability indices. We mathematically derive the sensitivity matrix of voltage stability index to line impedance, on which an optimization problem for maximizing voltage stability index is formulated. This framework is tested on the IEEE 14-bus and the IEEE 118-bus transmission systems, in which net load redistribution attacks are launched by sophisticated attackers. Here, the simulation results show the effectiveness of the proposed framework in circumventing the voltage instability while maintaining the detection effectiveness of MTD. We conduct case studies with and without the proposed framework under different MTD planning and operational methods. The impacts of the proposed two methods on attack detection effectiveness and system economic metrics are also revealed.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Data-Driven Affinely Adjustable Robust Volt/VAr Control

Recent years have seen the increasing proliferation of distributed energy resources with intermittent power outputs, posing new challenges to the voltage management in distribution networks. To this end, this paper proposes a data-driven affinely adjustable robust Volt/VAr control (AARVVC) scheme, which modulates the smart inverter’s reactive power in an affine function of its active power, based on the voltage sensitivities with respect to real/reactive power injections. To achieve a fast and accurate estimation of voltage sensitivities, we propose a data-driven method based on deep neural network (DNN), together with a rule-based bus-selection process using the bidirectional search method. Our method only uses the operating statuses of selected buses as inputs to DNN, thus significantly improving the training efficiency and reducing information redundancy. Finally, a distributed consensus-based solution, based on the alternating direction method of multipliers (ADMM), for the AARVVC is applied to decide the inverter’s reactive power adjustment rule with respect to its active power. Only limited information exchange is required between each local agent and the central agent to obtain the slope of the reactive power adjustment rule, and there is no need for the central agent to solve any (sub)optimization problems. Finally, numerical results on the modified IEEE-123 bus system validate the effectiveness and superiority of the proposed data-driven AARVVC method.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Learning Distribution Grid Topologies: A Tutorial

Unveiling feeder topologies from data is of paramount importance to advance situational awareness and proper utilization of smart resources in power distribution grids. This tutorial summarizes, contrasts, and establishes useful links between recent works on topology identification and detection schemes that have been proposed for power distribution grids. The primary focus is to highlight methods that overcome the limited availability of measurement devices in distribution grids, while enhancing topology estimates using conservation laws of power-flow physics and structural properties of feeders. Grid data from phasor measurement units or smart meters can be collected either passively in the traditional way, or actively, upon actuating grid resources and measuring the feeder's voltage response. Analytical claims on feeder identifiability and detectability are reviewed under disparate meter placement scenarios. Such topology learning claims can be attained exactly or approximately so via algorithmic solutions with various levels of computational complexity, ranging from least-squares fits to convex optimization problems, and from polynomial-time searches over graphs to mixed-integer programs. Although the emphasis is on radial single-phase feeders, extensions to meshed and/or multiphase circuits are sometimes possible and discussed. Here this tutorial aspires to provide researchers and engineers with knowledge of the current state-of-the-art in tractable distribution grid learning and insights into future directions of work.

24 POWER TRANSMISSION AND DISTRIBUTION↗

On Distributed PV Hosting Capacity Estimation, Sensitivity Study, and Improvement

This paper first studies the estimated distributed PV hosting capacities of seventeen utility distribution feeders using the Monte Carlo simulation based stochastic analysis, and then analyzes the sensitivity of PV hosting capacity to both feeder and photovoltaic system characteristics. Furthermore, an active distribution network management approach is proposed to maximize PV hosting capacity by optimally switching capacitors, adjusting voltage regulator taps, managing controllable branch switches and controlling smart PV inverters. The approach is formulated as a mixed-integer nonlinear optimization problem and a genetic algorithm is developed to obtain the solution. Multiple simulation cases are studied and the effectiveness of the proposed approach on increasing PV hosting capacity is demonstrated.

14 SOLAR ENERGY↗

High fidelity ultrasound imaging of concrete structures

As plans are made to extend licenses for the aging fleet of commercial nuclear power plants for periods of sixty years and beyond, research into the long-term integrity of their concrete structures has increased. Ultrasound tomography is a useful tool for nondestructive evaluation of these concrete structures. Typically, pulse-echo measurements are made over a large surface and are processed using a reconstruction algorithm, producing a 3D image of the structure that highlights embedded defects. These measurements are processed using a delay-and-sum algorithm such as the synthetic aperture focusing technique (SAFT). Oak Ridge National Laboratory is developing novel ultrasound model-based image reconstruction (U-MBIR) algorithms to improve the imaging capability of pulse-echo ultrasound array imagers. U-MBIR is an inversion technique that reconstructs the sample under test from the ultrasound measurements by formulating and solving a mathematical optimization problem using two sets of terms: one set ensures that the reconstruction matches measured data based on a model for the physics of beam propagation with the noise in the detector, and another set ensures that the reconstruction has certain properties based on a model for the object being scanned. This paper compares three techniques: SAFT, frequency-banded SAFT (FB-SAFT), and U-MBIR. The U-MBIR method produces higher quality images of the underlying concrete structures compared to the images produced using SAFT and FB-SAFT from the same set of measurements. This paper also illustrates the detection of various defects with higher confidence due to the lower noise and artifact-free U-MBIR images.

Ezell, N Dianne↗

A constrained, total-variation minimization algorithm for low-intensity x-ray CT

Purpose: The authors developed an iterative image-reconstruction algorithm for application to low-intensity computed tomography projection data, which is based on constrained, total-variation (TV) minimization. The algorithm design focuses on recovering structure on length scales comparable to a detector bin width. Methods: Recovering the resolution on the scale of a detector bin requires that pixel size be much smaller than the bin width. The resulting image array contains many more pixels than data, and this undersampling is overcome with a combination of Fourier upsampling of each projection and the use of constrained, TV minimization, as suggested by compressive sensing. The presented pseudocode for solving constrained, TV minimization is designed to yield an accurate solution to this optimization problem within 100 iterations. Results: The proposed image-reconstruction algorithm is applied to a low-intensity scan of a rabbit with a thin wire to test the resolution. The proposed algorithm is compared to filtered backprojection (FBP). Conclusions: The algorithm may have some advantage over FBP in that the resulting noise level is lowered at equivalent contrast levels of the wire.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

The feasibility of a piecewise-linear dynamic bowtie filter

Purpose: The prepatient attenuator (or 'bowtie filter') in CT is used to modulate the flux as a function of fan angle of the x-ray beam incident on the patient. Traditional, static bowtie filters are tailored only for very generic scans and for the average patient. The authors propose a design for a dynamic bowtie that can produce a time-dependent piecewise-linear attenuation profile. This dynamic bowtie may reduce dynamic range, dose or scatter, but in this work they focus on its ability to reduce dynamic range, which may be particularly important for systems employing photon-counting detectors. Methods: The dynamic bowtie is composed of a set of triangular wedges. Each wedge is independently moved in order to produce a time-dependent piecewise-linear attenuation profile. Simulations of the bowtie are conducted to estimate the dynamic range reduction in six clinical datasets. The control of the dynamic bowtie is determined by solving a convex optimization problem, and the dose is estimated using Monte Carlo techniques. Beam hardening artifacts are also simulated. Results: The dynamic range is reduced by factors ranging from 2.4 to 27 depending on the part of the body studied. With a dynamic range minimization objective, the dose to the patient can be reduced from 6% to 33% while maintaining peak image noise. Further reduction in dose may be possible with a specific dose reduction objective. Beam hardening artifacts are suppressed with a two-pass algorithm. Conclusions: A dynamic bowtie producing a time-dependent, piecewise-linear attenuation profile is possible and can be used to modulate the flux of the scanner to the imaging task. Initial simulations show a large reduction in dynamic range. Several other applications are possible.

60 APPLIED LIFE SCIENCES↗

Tumor response parameters for head and neck cancer derived from tumor-volume variation during radiation therapy

Purpose: The main goal of this paper is to reconstruct a distribution of cell survival fractions from tumor-volume variation for a heterogeneous group of head and neck cancer patients and compare this distribution to the data from predictive assays. Methods: To characterize the tumor-volume variation during radiation therapy treatment, the authors use a two-level tumor-volume model of cell population that separates the entire tumor cell population into two subpopulations of viable cells and lethally damaged cells. This parameterized radiobiological model is integrated with a least squares objective function and a simulated annealing optimization algorithm to describe time-dependent tumor-volume variation rates in individual patients. Several constraints have been used in the optimization problem because tumor-volume variation during radiotherapy is described by a sum of exponentials; therefore, the problem of accurately fitting a model to measured data is ill-posed. The model was applied to measured tumor-volume variation curves from a clinical study on tumor-volume variation during radiotherapy for 14 head and neck cancer patients in which an integrated CT/linear particle accelerator (LINAC) system was used for tumor-volume measurements. Results: The two-level cell population tumor-volume modeling is capable of describing tumor-volume variation throughout the entire treatment for 11 of the 14 patients. For three patients, the tumor-volume variation was described only during the initial part of treatment, a fact that may be related to the neglected hypoxia in the two-level approximation. The predicted probability density distribution for the survival fractions agrees with the data obtained using in vitro studies with predictive assays. The mean value 0.35 of survival fraction obtained in this study is larger than the value 0.32 from in vitro studies, which could be expected because of greater repair in vivo. The mean half-life obtained in this study for the head-and-neck squamous cell carcinoma (SCC) is equal to 3.8 mean potential doubling times, which agrees with 4.0 mean potential doubling times obtained previously for lung SCC. Conclusions: The distribution of cell survival fractions obtained in this study support the hypothesis that the tumor-volume variation during radiotherapy treatment for head and neck cancer can be described by the two-level cell population tumor-volume model. This model can be used for in vivo evaluation of patient-specific radiobiological parameters that are needed for tumor-control probability evaluation.

60 APPLIED LIFE SCIENCES↗

Control algorithms for dynamic attenuators

Purpose: The authors describe algorithms to control dynamic attenuators in CT and compare their performance using simulated scans. Dynamic attenuators are prepatient beam shaping filters that modulate the distribution of x-ray fluence incident on the patient on a view-by-view basis. These attenuators can reduce dose while improving key image quality metrics such as peak or mean variance. In each view, the attenuator presents several degrees of freedom which may be individually adjusted. The total number of degrees of freedom across all views is very large, making many optimization techniques impractical. The authors develop a theory for optimally controlling these attenuators. Special attention is paid to a theoretically perfect attenuator which controls the fluence for each ray individually, but the authors also investigate and compare three other, practical attenuator designs which have been previously proposed: the piecewise-linear attenuator, the translating attenuator, and the double wedge attenuator. Methods: The authors pose and solve the optimization problems of minimizing the mean and peak variance subject to a fixed dose limit. For a perfect attenuator and mean variance minimization, this problem can be solved in simple, closed form. For other attenuator designs, the problem can be decomposed into separate problems for each view to greatly reduce the computational complexity. Peak variance minimization can be approximately solved using iterated, weighted mean variance (WMV) minimization. Also, the authors develop heuristics for the perfect and piecewise-linear attenuators which do not requirea priori knowledge of the patient anatomy. The authors compare these control algorithms on different types of dynamic attenuators using simulated raw data from forward projected DICOM files of a thorax and an abdomen. Results: The translating and double wedge attenuators reduce dose by an average of 30% relative to current techniques (bowtie filter with tube current modulation) without increasing peak variance. The 15-element piecewise-linear dynamic attenuator reduces dose by an average of 42%, and the perfect attenuator reduces dose by an average of 50%. Improvements in peak variance are several times larger than improvements in mean variance. Heuristic control eliminates the need for a prescan. For the piecewise-linear attenuator, the cost of heuristic control is an increase in dose of 9%. The proposed iterated WMV minimization produces results that are within a few percent of the true solution. Conclusions: Dynamic attenuators show potential for significant dose reduction. A wide class of dynamic attenuators can be accurately controlled using the described methods.

61 RADIATION PROTECTION AND DOSIMETRY↗

A hybrid reconstruction algorithm for fast and accurate 4D cone-beam CT imaging

Purpose: 4D cone beam CT (4D-CBCT) has been utilized in radiation therapy to provide 4D image guidance in lung and upper abdomen area. However, clinical application of 4D-CBCT is currently limited due to the long scan time and low image quality. The purpose of this paper is to develop a new 4D-CBCT reconstruction method that restores volumetric images based on the 1-min scan data acquired with a standard 3D-CBCT protocol. Methods: The model optimizes a deformation vector field that deforms a patient-specific planning CT (p-CT), so that the calculated 4D-CBCT projections match measurements. A forward-backward splitting (FBS) method is invented to solve the optimization problem. It splits the original problem into two well-studied subproblems, i.e., image reconstruction and deformable image registration. By iteratively solving the two subproblems, FBS gradually yields correct deformation information, while maintaining high image quality. The whole workflow is implemented on a graphic-processing-unit to improve efficiency. Comprehensive evaluations have been conducted on a moving phantom and three real patient cases regarding the accuracy and quality of the reconstructed images, as well as the algorithm robustness and efficiency. Results: The proposed algorithm reconstructs 4D-CBCT images from highly under-sampled projection data acquired with 1-min scans. Regarding the anatomical structure location accuracy, 0.204 mm average differences and 0.484 mm maximum difference are found for the phantom case, and the maximum differences of 0.3–0.5 mm for patients 1–3 are observed. As for the image quality, intensity errors below 5 and 20 HU compared to the planning CT are achieved for the phantom and the patient cases, respectively. Signal-noise-ratio values are improved by 12.74 and 5.12 times compared to results from FDK algorithm using the 1-min data and 4-min data, respectively. The computation time of the algorithm on a NVIDIA GTX590 card is 1–1.5 min per phase. Conclusions: High-quality 4D-CBCT imaging based on the clinically standard 1-min 3D CBCT scanning protocol is feasible via the proposed hybrid reconstruction algorithm.

60 APPLIED LIFE SCIENCES↗

SU-E-T-253: Development of a GDPM Monte Carlo Based Quality Assurance Tool for Cyberknife

Purpose: To develop a 3D quality assurance (QA) tool for Cyberknife plans using a GPU-based Monte Carlo dose calculation package, gDPM. The developed QA tool will be used as a secondary check for Cyberknife treatment planning software (TPS) reported dose distributions. Methods: Phase space files of the 5, 7.5, 10, 15, and 60 mm iris cones were downloaded from IAEA phase-space database. From the 60mm iris cone phase space file, we were able to generate raw phase space files for all other cones using a particle rejection method. The particles in the raw phase space files were binned with respect to the radial position and energy for commissioning. During the commissioning process, gDPM calculated percent depth dose and off-center ratios which were compared to those measured in the Blue Phantom. The off-axis data was measured with an SAD setup at depths of 15, 50, 100, 200, and 300 mm. At the commissioning stage, an optimization problem was solved to adjust the binned particles weights to minimize the difference between the calculated and measured ones. Commissioning validations will be performed by measuring point dose data of patient specific plans delivered to water phantoms. With commissioned phase space files, 3D patient-specific dose distributions will be calculated and compared against TPS reported dose. Results: Beyond the initial buildup region, the root mean square difference between the calculated and measured percent depth dose differences was less than 0.5%. The full-width half-max data from the off-axis ratio calculations was found to be within 0.1 mm of the measured data. Conclusion: Our current work showed excellent agreement between the gDPM calculated dose and the measured data for all cone sizes and types for the Cyberknife system. Implementation of a fast and accurate QA tool for patient specific plans will be feasible with this tool.

60 APPLIED LIFE SCIENCES↗

MO-DE-207A-02: A Feature-Preserving Image Reconstruction Method for Improved Pancreaticlesion Classification in Diagnostic CT Imaging

Purpose: To develop a feature-preserving model based image reconstruction (MBIR) method that improves performance in pancreatic lesion classification at equal or reduced radiation dose. Methods: A set of pancreatic lesion models was created with both benign and premalignant lesion types. These two classes of lesions are distinguished by their fine internal structures; their delineation is therefore crucial to the task of pancreatic lesion classification. To reduce image noise while preserving the features of the lesions, we developed a MBIR method with curvature-based regularization. The novel regularization encourages formation of smooth surfaces that model both the exterior shape and the internal features of pancreatic lesions. Given that the curvature depends on the unknown image, image reconstruction or denoising becomes a non-convex optimization problem; to address this issue an iterative-reweighting scheme was used to calculate and update the curvature using the image from the previous iteration. Evaluation was carried out with insertion of the lesion models into the pancreas of a patient CT image. Results: Visual inspection was used to compare conventional TV regularization with our curvature-based regularization. Several penalty-strengths were considered for TV regularization, all of which resulted in erasing portions of the septation (thin partition) in a premalignant lesion. At matched noise variance (50% noise reduction in the patient stomach region), the connectivity of the septation was well preserved using the proposed curvature-based method. Conclusion: The curvature-based regularization is able to reduce image noise while simultaneously preserving the lesion features. This method could potentially improve task performance for pancreatic lesion classification at equal or reduced radiation dose. The result is of high significance for longitudinal surveillance studies of patients with pancreatic cysts, which may develop into pancreatic cancer. The Senior Author receives financial support from Siemens GmbH Healthcare.

60 APPLIED LIFE SCIENCES↗

Design of continuously graded elastic acoustic cloaks

Here, this letter demonstrates the design of continuously graded elastic cylinders to achieve passive cloaking from harmonic acoustic excitation, both at single frequencies and over extended bandwidths. The constitutive parameters in a multilayered, constant-density cylinder are selected in a partial differential equation-constrained optimization problem, such that the residual between the pressure field from an unobstructed spreading wave in a fluid and the pressure field produced by the cylindrical inclusion is minimized. The radial variation in bulk modulus appears fundamental to the cloaking behavior, while the shear modulus distribution plays a secondary role. Such structures could be realized with functionally-graded elastic materials.

42 ENGINEERING↗

Three dimensions, two microscopes, one code: Automatic differentiation for x-ray nanotomography beyond the depth of focus limit

Conventional tomographic reconstruction algorithms assume that one has obtained pure projection images, involving no within-specimen diffraction effects nor multiple scattering. Advances in x-ray nanotomography are leading toward the violation of these assumptions, by combining the high penetration power of x-rays, which enables thick specimens to be imaged, with improved spatial resolution that decreases the depth of focus of the imaging system. We describe a reconstruction method where multiple scattering and diffraction effects in thick samples are modeled by multislice propagation and the 3D object function is retrieved through iterative optimization. We show that the same proposed method works for both full-field microscopy and for coherent scanning techniques like ptychography. Our implementation uses the optimization toolbox and the automatic differentiation capability of the open-source deep learning package TensorFlow, demonstrating a straightforward way to solve optimization problems in computational imaging with flexibility and portability.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Positive $P_N$ Closures

We introduce a modification to the standard spherical harmonic closure used with linear kinetic equations of particle transport. While the standard closure is known to produce negative particle concentrations, the modification corrects this defect by requiring that the ansatz used to close the equations itself be a nonnegative function. We impose this requirement via explicit constraints in a quadratic optimization problem.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A Limited-Memory Multiple Shooting Method for Weakly Constrained Variational Data Assimilation

Maximum-likelihood-based state estimation for dynamical systems with model error raises computational challenges in memory usage due to the much larger number of free variables when compared to the perfect model case. To address this challenge, we present a limited-memory method for maximum-likelihood-based estimation of state space models. We reduce the memory storage requirements by expressing the optimal states as a function of checkpoints bounding a shooting interval. All states can then be recomputed as needed from a recursion stemming from the optimality conditions. The matching of states at checkpoints is imposed, in a multiple shooting fashion, as constraints on the optimization problem, which is solved with an augmented Lagrangian method. We prove that for nonlinear systems under certain assumptions the condition number of the Hessian matrix of the augmented Lagrangian function is bounded above with respect to the number of shooting intervals. Hence the method is stable for increasing time horizon. The assumptions include satisfying the observability conditions of the linearized system on a shooting interval. We also propose a recursion-based gradient evaluation algorithm for computing the gradient, which in turn allows the algorithm to proceed by storing at any time only the checkpoints and the states on a shooting interval. We demonstrate our findings with simulations in different regimes for Burgers' equation.

Xu, Wanting↗

Avoiding Communication in Primal and Dual Block Coordinate Descent Methods

Primal and dual block coordinate descent methods are iterative methods for solving regularized and unregularized optimization problems. Distributed-memory parallel implementations of these methods have become popular in analyzing large machine learning datasets. However, existing implementations communicate at every iteration, which, on modern data center and supercomputing architectures, often dominates the cost of floating-point computation. Recent results on communication-avoiding Krylov subspace methods suggest that large speedups are possible by re-organizing iterative algorithms to avoid communication. We show how applying similar algorithmic transformations can lead to primal and dual block coordinate descent methods that only communicate every $s$ iterations---where $s$ is a tuning parameter---instead of every iteration for the regularized least-squares problem. We show that the communication-avoiding variants reduce the number of synchronizations by a factor of $s$ on distributed-memory parallel machines without altering the convergence rate and attain strong scaling speedups of up to $6.1\times$ over the “standard algorithm" on a Cray XC30 supercomputer.

97 MATHEMATICS AND COMPUTING↗

On the Training and Generalization of Deep Operator Networks

Here, we present a novel training method for deep operator networks (DeepONets), one of the most popular neural network models for operators. DeepONets are constructed by two subnetworks, namely the branch and trunk networks. Typically, the two subnetworks are trained simultaneously, which amounts to solving a complex optimization problem in a high dimensional space. In addition, the nonconvex and nonlinear nature makes training very challenging. To tackle such a challenge, we propose a two-step training method that trains the trunk network first and then sequentially trains the branch network. The core mechanism is motivated by the divide-and-conquer paradigm and is the decomposition of the entire complex training task into two subtasks with reduced complexity. Therein the Gram–Schmidt orthonormalization process is introduced which significantly improves stability and generalization ability. On the theoretical side, we establish a generalization error estimate in terms of the number of training data, the width of DeepONets, and the number of input and output sensors. Numerical examples are presented to demonstrate the effectiveness of the two-step training method, including Darcy flow in heterogeneous porous media.

deep operator networks↗