Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithmic Optimization”

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,639 records · Page 91

Estimating the Adequacy of a Multi-Objective Optimization

Multi-objective optimization methods can be criticized for lacking a statistically valid measure of the quality and representativeness of a solution. This stance is especially relevant to metaheuristic optimization approaches but can also apply to other methods that typically might only report a small representative subset of a Pareto frontier. Here we present a method to address this deficiency based on random sampling of a solution space to determine, with a specified level of confidence, the fraction of the solution space that is surpassed by an optimization. The Superiority of Multi-Objective Optimization to Random Sampling, or SMORS method, can evaluate quality and representativeness using dominance or other measures, e.g., a spacing measure for high-dimensional spaces. SMORS has been tested in a combinatorial optimization context using a genetic algorithm but could be useful for other optimization methods.

42 ENGINEERING↗

Optics Studies for Multipass Energy Recovery at CEBAF: ER@CEBAF

Energy recovery linacs (ERLs), focus on recycling the kinetic energy of electron beam for the purpose of accelerating a newly injected beam within the same accelerating structure. The rising developments in the super conducting radio frequency technology, ERL technology has achieved several noteworthy milestones over the past few decades. In year 2003, Jefferson Lab has successfully demonstrated a single pass energy recovery at the CEBAF accelerator. Furthermore, they conducted successful experiments with IR-FEL demo and upgrades, as well as the UV FEL driver. This multi-pass, multi-GeV range energy recovery demonstration proposed to be carried out at CEBAF accelerator at Jefferson Lab focuses on demonstrating highest energy recovery in super conducting linac in the low-current range. Continuous electron beam accelerate up to 7.5 GeV within 5-passes and decelerate in the next 5-passes recovering RF energy and dumps at a low energy dump. The beamline optics design for recirculating linacs require special attention to avoid beam instabilities due to RF wakefields. Usually, multi-pass linac beam lines require stronger focusing at lower energies as that is necessary to avoid beam breakup (BBU) instabilities, even with this small beam current. The CEBAF linac optics optimization is focused on balancing over-focusing at higher energies and beta excursions at lower energies. The race-track-shaped geometry of CEBAF accelerator allows its linacs to accommodate multiple energy beams simultaneously, while individual recirculating arcs transporting one beam energy, are shared between accelerating/decelerating beams. For the linac optics optimization process, an extended strategy is used that is originally used in 6-pass Recirculating Linac design of the LHeC, to represent the ten passes through a single linac. Using proper mathematical expressions, linac optics optimization can be achieved with evolutionary genetic algorithms, with Multi-Objective optimization. This thesis introduces a CEBAF optics redesign tailored to accommodates the ER@CEBAF multi-pass ER scheme. The isochronous arcs were retuned to match into optics solutions for optimized 10-pass linacs. Within this work, a single bunch particle tracking analysis presented here focuses on the further improvements of the beamline and beam transportation.

Neththikumara, Isurumali↗

SU-E-T-304: Dosimetric Comparison of Cavernous Sinus Tumors: Heterogeneity Corrected Pencil Beam (PB-Hete) Vs. X-Ray Voxel Monte Carlo (XVMC) Algorithms for Stereotactic Radiotherapy (SRT)

Purpose: To compare dose distributions calculated using PB-hete vs. XVMC algorithms for SRT treatments of cavernous sinus tumors. Methods: Using PB-hete SRT, five patients with cavernous sinus tumors received the prescription dose of 25 Gy in 5 fractions for planning target volume PTV(V100%)=95%. Gross tumor volume (GTV) and organs at risk (OARs) were delineated on T1/T2 MRI-CT-fused images. PTV (range 2.1–84.3cc, mean=21.7cc) was generated using a 5mm uniform-margin around GTV. PB-hete SRT plans included a combination of non-coplanar conformal arcs/static beams delivered by Novalis-TX consisting of HD-MLCs and a 6MV-SRS(1000 MU/min) beam. Plans were re-optimized using XVMC algorithm with identical beam geometry and MLC positions. Comparison of plan specific PTV(V99%), maximal, mean, isocenter doses, and total monitor units(MUs) were evaluated. Maximal dose to OARs such as brainstem, optic-pathway, spinal cord, and lenses as well as normal tissue volume receiving 12Gy(V12) were compared between two algorithms. All analysis was performed using two-tailed paired t-tests of an upper-bound p-value of <0.05. Results: Using either algorithm, no dosimetrically significant differences in PTV coverage (PTVV99%,maximal, mean, isocenter doses) and total number of MUs were observed (all p-values >0.05, mean ratios within 2%). However, maximal doses to optic-chiasm and nerves were significantly under-predicted using PB-hete (p=0.04). Maximal brainstem, spinal cord, lens dose and V12 were all comparable between two algorithms, with exception of one patient with the largest PTV who exhibited 11% higher V12 with XVMC. Conclusion: Unlike lung tumors, XVMC and PB-hete treatment plans provided similar PTV coverage for cavernous sinus tumors. Majority of OARs doses were comparable between two algorithms, except for small structures such as optic chiasm/nerves which could potentially receive higher doses when using XVMC algorithm. Special attention may need to be paid on a case-by-case basis when planning for sinus SRT based on tumor size and location to OARs particularly the optic apparatus.

60 APPLIED LIFE SCIENCES↗

Non-linear Multidimensional Optimization for use in Wire Scanner Fitting

To ensure experiment efficiency and quality from the Continuous Electron Beam Accelerator at Jefferson Lab, beam energy, size, and position must be measured. Wire scanners are devices inserted into the beamline to produce measurements which are used to obtain beam properties. Extracting physical information from the wire scanner measurements begins by fitting Gaussian curves to the data. This study focuses on optimizing and automating this curve-fitting procedure. We use a hybrid approach combining the efficiency of Newton Conjugate Gradient (NCG) method with the global convergence of three nature-inspired (NI) optimization approaches: genetic algorithm, differential evolution, and particle-swarm. In this Python-implemented approach, augmenting the locally-convergent NCG with one of the globally-convergent methods ensures the quality, robustness, and automation of curve-fitting. After comparing the methods, we establish that given an initial data-derived guess, each finds a solution with the same chi-square- a measurement of the agreement of the fit to the data. NCG is the fastest method, so it is the first to attempt data-fitting. The curve-fitting procedure escalates to one of the globally-convergent NI methods only if NCG fails, thereby ensuring a successful fit. This method allows for the most optimal signal fit and can be easily applied to similar problems.

Terzic, Balsa↗

Atmospheric Emitted Radiance Interferometer Optimal Estimation (AERIoe) Value-Added Product Report

The Atmospheric Emitted Radiance Interferometer (AERI) Optimal Estimation (AERIoe) algorithm (Turner and Löhnert 2014, Turner and Blumberg 2019) retrieves boundary-layer profiles of temperature and water vapor mixing ratio, together with cloud properties for a single-layer cloud (i.e., LWP, effective radius), from AERI-observed infrared radiance spectra and other measurements. The current AERIoe Value-Added Product (VAP) uses version 2.8 of David Turner's code, which uses additional inputs to constrain the retrieval including surface meteorology, microwave radiometer brightness temperatures at any number of frequencies (the U.S. Department of Energy Atmospheric Radiation Measurement [ARM] user facility typically used observations at 23.8 and 30.0 GHz), and Rapid Refresh numerical weather prediction model output. The method is a physical iterative retrieval that uses the optimal estimation framework (Rodgers 2000), so a full error covariance of the solution and the information content (in the form of degrees of freedom for signal) is provided for each retrieval.

54 ENVIRONMENTAL SCIENCES↗

Network-Level Optimization for Unbalanced Power Distribution System: Approximation and Relaxation

The nonlinear programming (NLP) problem to solve distribution-level optimal power flow (D-OPF) poses convergence issues and does not scale well for unbalanced distribution systems. The existing scalable D-OPF algorithms either use approximations that are not valid for an unbalanced power distribution system, or apply relaxation techniques to the nonlinear power flow equations that do not guarantee a feasible power flow solution. In this paper, we propose scalable D-OPF algorithms that simultaneously achieve optimal and feasible solutions by solving multiple iterations of approximate, or relaxed, D-OPF subproblems of low complexity. The first algorithm is based on a successive linear approximation of the nonlinear power flow equations around the current operating point, where the D-OPF solution is obtained by solving multiple iterations of a linear programming (LP) problem. The second algorithm is based on the relaxation of the nonlinear power flow equations as conic constraints together with directional constraints, which achieves optimal and feasible solutions over multiple iterations of a second-order cone programming (SOCP) problem. Finally, it is demonstrated that the proposed algorithms are able to reach an optimal and feasible solution while significantly reducing the computation time as compared to an equivalent NLPD-OPF model for the same distribution system.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Application of a new hybrid particle swarm optimization-mixed kernels function-based support vector machine model for reservoir porosity prediction: A case study in Jacksonburg-Stringtown oil field, West Virginia, USA

Porosity is a fundamental property that characterizes the storage capability of fluid and gas-bearing formations in a reservoir. An accurate porosity value can be measured from core samples in the laboratory; however, core analysis is expensive and time consuming. Well-log data can be used to calculate porosity, but the availability of log suites is often limited in mature fields. Therefore, robust porosity prediction requires integration of core-measured porosity with available well-log suites to control for changes in lithology and fluid content. A support vector machine (SVM) model with mixed kernel function (MKF) is used to construct the relationship between limited conventional well-log suites and sparse core data. Porosity is the desired output, and two conventional well-log responses (gamma ray [GR] and bulk density) and three well-log-derived parameters (the slope of GR, the slope of density, and [Formula: see text]) are input parameters. A global stochastic searching algorithm, particle swarm optimization (PSO), is applied to improve the efficiency of locating the appropriate values of five control parameters in MKF-SVM model. The results of SVM with different traditional kernel functions were compared, and the MKF-SVM model provided an improvement over the traditional SVM model. To confirm the advantage of the hybrid PSO-MKF-SVM model, the results from three models: (1) radial basis function (RBF)-based least-squares SVM, (2) multilayer perceptron artificial neural network (ANN), and (3) RBF ANN, are compared with the result of the hybrid PSO-MKF-SVM model. The results indicate that the hybrid PSO-MKF-SVM model improves porosity prediction with the highest correlation coefficient ([Formula: see text] of 0.9560), the highest coefficient of determination ([Formula: see text] of 0.9140), the lowest root-mean-square error (1.6505), average absolute error value (1.4050), and maximum absolute error (2.717).

Geochemistry & Geophysics↗

Demonstration of the Plant Fuel Reload Process Optimization for an Operating PWR

The United States (U.S.) nuclear industry is facing a strong challenge to maintain regulatory-required levels of safety while ensuring economic competitiveness to stay in business. Safety remains a key parameter for all aspects related to the operation of light water reactor (LWR) nuclear power plants (NPPs) and can be achieved more economically by using a risk-informed ecosystem such as that being developed by the Risk-Informed Systems Analysis (RISA) Pathway under the U.S. Department of Energy (DOE) Light Water Reactor Sustainability (LWRS) Program. The LWRS Program is promoting a wide range of research and development (R&D) activities with the goal to maximize both the safety and economically efficient performance of NPPs through improved scientific understanding, especially given that many plants are considering second license renewal. The RISA Pathway has two main goals: (1) the deployment of methodologies and technologies that enable better representation of safety margins and the factors that contribute to cost and safety; and (2) the development of advanced applications that enable cost-effective plant operation. This report summarizes the research outcomes in FY-2021, which the project progressed from the planning and methodology development phase to the early demonstration phase. The highlights of these activities are: (1) the development of a multi-objective optimization process using Genetic Algorithms (GAs); (2) the development and test of an approach for optimization process acceleration using artificial intelligence (AI) that significantly reduces the computational burden; (3) the demonstration of the fuel reload optimization framework for a generic pressurized water reactor (PWR); and (4) the demonstration of limiting design basis accident (DBA) scenarios for evaluation of the transition from deterministic to risk-informed approach for fuel reload optimization.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Combining prior day contours to improve automated prostate segmentation

Purpose: To improve the accuracy of automatically segmented prostate, rectum, and bladder contours required for online adaptive therapy. The contouring accuracy on the current image guidance [image guided radiation therapy (IGRT)] scan is improved by combining contours from earlier IGRT scans via the simultaneous truth and performance level estimation (STAPLE) algorithm. Methods: Six IGRT prostate patients treated with daily kilo-voltage (kV) cone-beam CT (CBCT) had their original plan CT and nine CBCTs contoured by the same physician. Three types of automated contours were produced for analysis. (1) Plan: By deformably registering the plan CT to each CBCT and then using the resulting deformation field to morph the plan contours to match the CBCT anatomy. (2) Previous: The contour set drawn by the physician on the previous day CBCT is similarly deformed to match the current CBCT anatomy. (3) STAPLE: The contours drawn by the physician, on each prior CBCT and the plan CT, are deformed to match the CBCT anatomy to produce multiple contour sets. These sets are combined using the STAPLE algorithm into one optimal set. Results: Compared to plan and previous, STAPLE improved the average Dice's coefficient (DC) with the original physician drawn CBCT contours to a DC as follows: Bladder: 0.81 {+-} 0.13, 0.91 {+-} 0.06, and 0.92 {+-} 0.06; Prostate: 0.75 {+-} 0.08, 0.82 {+-} 0.05, and 0.84 {+-} 0.05; and Rectum: 0.79 {+-} 0.06, 0.81 {+-} 0.06, and 0.85 {+-} 0.04, respectively. The STAPLE results are within intraobserver consistency, determined by the physician blindly recontouring a subset of CBCTs. Comparing plans recalculated using the physician and STAPLE contours showed an average disagreement less than 1% for prostate D98 and mean dose, and 5% and 3% for bladder and rectum mean dose, respectively. One scan takes an average of 19 s to contour. Using five scans plus STAPLE takes less than 110 s on a 288 core graphics processor unit. Conclusions: Combining the plan and all prior days via the STAPLE algorithm to produce treatment day contours is superior to the current standard of deforming only the plan contours to the daily CBCT. STAPLE also improves the precision, with a substantial decrease in standard deviation, a key for adaptive therapy. Geometrically and dosimetrically accurate contours can be automatically generated with STAPLE on prostate region kV CBCT in a time scale suitable for online adaptive therapy.

60 APPLIED LIFE SCIENCES↗

Using Receiver Operating Characteristic Curves to Optimize Discovery-Based Software with Comprehensive Two-Dimensional Gas Chromatography with Time-of-Flight Mass Spectrometry

We report a quantitative approach to optimize implementation of discovery-based software for comprehensive two-dimensional gas chromatography coupled with time-of-flight mass spectrometry (GC × GC – TOFMS). The software performs a tile-based Fisher ratio (F-ratio) analysis, and facilitates a supervised non-targeted analysis based upon the experimental design to aid in the discovery of analytes whose variances are statistically different between sample classes. The quantitative approach for software optimization uses receiver operating characteristic (ROC) curves. The area under the curve (AUC) of each ROC curve serves as a quantitative metric to optimize two key algorithm parameters: the signal-to-noise ratio (S/N) threshold of the baseline corrected and normalized data prior to calculating F-ratios at each m/z mass channel, and the number of these F-ratios per m/z to include in the calculation of the average F-ratio of a tile. A total of 25 combinations of S/N threshold by number of m/z were studied. Fifty analytes were spiked into a diesel fuel at two concentration spike levels to produce two sample classes that should in principle produce 50 positive instances in the ROC curves (30 native/20 non-native compounds, at spike levels of 200/20 and100/10 ppm native/non-native, respectively). The “sweet spot” for F-ratio analysis was determined to be a S/N threshold of 10 coupled with a maximum of the 10 most chemically selective m/z (requiring a minimum of 3 m/z), corresponding to a ~ 21% improvement in the discovery rate of true positives relative to prior studies. Furthermore, it was observed that optimization of these software parameters did not depend upon a priori determination of the statistically correct number of positive instances in the sample classes. The AUC metric appears to be suitable for the evaluation of all data analysis methods that utilize the proper experimental design.

3D-GS/TOFMS, Data discovery, ROC curves, Fisher ra↗

Active Learning for Metamaterial Optimization on HPC and QC Integrated Systems

Active learning algorithms, integrating machine learning, quantum computing and optics simulation in an iterative loop, offer a promising approach to optimizing metamaterials. However, these algorithms can face difficulties in optimizing highly complex structures due to computational limitations. High-performance computing (HPC) and quantum computing (QC) integrated systems can address these issues by enabling parallel computing. In this study, we develop an active learning algorithm working on HPC-QC integrated systems. We evaluate the performance of optimization processes within active learning (i.e., training a machine learning model, problem-solving with quantum computing, and evaluating optical properties through wave-optics simulation) for highly complex metamaterial cases. Our results showcase that utilizing multiple cores on the integrated system can significantly reduce computational time, thereby enhancing the efficiency of optimization processes. Therefore, we expect that leveraging HPC-QC integrated systems helps effectively tackle large-scale optimization challenges in general.

Kim, Seongmin↗

Systematically tracking the hourly progression of large wildfires using GOES satellite observations

Abstract. In the western United States, prolonged drought, a warming climate, and historical fuel buildup have contributed to larger and more intense wildfires as well as to longer fire seasons. As these costly wildfires become more common, new tools and methods are essential for improving our understanding of the evolution of fires and how extreme weather conditions, including heat waves, windstorms, droughts, and varying levels of active-fire suppression, influence fire spread. Here, we develop the Geostationary Operational Environmental Satellites (GOES)-Observed Fire Event Representation (GOFER) algorithm to derive the hourly fire progression of large wildfires and create a product of hourly fire perimeters, active-fire lines, and fire spread rates. Using GOES-East and GOES-West geostationary satellite detections of active fires, we test the GOFER algorithm on 28 large wildfires in California from 2019 to 2021. The GOFER algorithm includes parameter optimizations for defining the burned-to-unburned boundary and correcting for the parallax effect from elevated terrain. We evaluate GOFER perimeters using 12 h data from the Visible Infrared Imaging Radiometer Suite (VIIRS)-derived Fire Event Data Suite (FEDS) and final fire perimeters from the California's Fire and Resource Assessment Program (FRAP). Although the GOES imagery used to derive GOFER has a coarser resolution (2 km at the Equator), the final fire perimeters from GOFER correspond reasonably well to those obtained from FRAP, with a mean Intersection-over-Union (IoU) of 0.77, in comparison to 0.83 between FEDS and FRAP; the IoU indicates the area of overlap over the area of the union relative to the reference perimeters, in which 0 is no agreement and 1 is perfect agreement. GOFER fills a key temporal gap present in other fire tracking products that rely on low-Earth-orbit imagery, where perimeters are available at intervals of 12 h or longer or at ad hoc intervals from aircraft overflights. This is particularly relevant when a fire spreads rapidly, such as at maximum hourly spread rates of over 5 km h−1. Our GOFER algorithm for deriving the hourly fire progression using GOES can be applied to large wildfires across North and South America and reveals considerable variability in the rates of fire spread on diurnal timescales. The resulting GOFER product has a broad set of potential applications, including the development of predictive models for fire spread and the improvement of atmospheric transport models for surface smoke estimates. The resulting GOFER product has a broad set of potential applications, including the development of predictive models for fire spread and the improvement of atmospheric transport models for surface smoke estimates (https://doi.org/10.5281/zenodo.8327264, Liu et al., 2023).

Geology↗

Optimal Operation and Impact Assessment of Distributed Wind for Improving Efficiency and Resilience of Rural Electricity Systems

This project aims to empower rural utilities by developing advanced optimization models and algorithms for effectively integrating distributed wind energy alongside battery storage and other distributed energy resources (DERs). The primary objectives are to reduce peak demand, ensure reliable emergency power supply, and regulate voltage and frequency. To address operational challenges, the project introduces innovative mitigation strategies and ultrafast assessment frameworks to evaluate the impacts of distributed wind and DERs on rural grids, offering actionable solutions to potential issues. Economic viability is assessed through cost-benefit analysis using real rural utility data, ensuring the practical application of the project outcomes.

17 WIND ENERGY↗

Thermodynamic analysis and optimization of supercritical carbon dioxide Brayton cycles for use with low-grade geothermal heat sources

The transcritical carbon dioxide Rankine cycle has emerged as an alternative for power generation in low-grade heat applications. However, the low heat rejection temperatures required for condensing the carbon dioxide is almost prohibitive for many locations. A simple solution is the adoption of a supercritical carbon dioxide Brayton cycle which does not need such low temperature heat sinks. This power cycle has been poorly studied previously in low-grade heat applications. Therefore, with the aim of determining the performance and feasibility of the supercritical carbon dioxide Brayton cycle from thermodynamic viewpoint, using a low-grade geothermal heat source, this paper presents a comparative thermodynamic analysis between four different supercritical carbon dioxide Brayton cycles. For this purpose, detailed models were developed and solved by coupling the thermodynamic model with the thermal-hydraulic model of a Printed Circuit Heat Exchanger. Subsequently, simulations of a base case, a parametric analysis, and an optimization using Genetic Algorithms, were carried out. Results show that there is a combination of operating conditions that maximizes the electrical output of the system. Besides, some values of the minimum pressure of the cycles can increase substantially the precooler cooling water pumping power. At the optimum design point, using a 20 kg/s geothermal brine stream at 150 °C as heat source with a minimum allowable reinjection temperature of 70 °C, the Intercooled Recuperated Brayton Cycle achieved the highest electric power output, energy and exergy efficiencies, obtaining values of 779.99 kW, 11.51%, and 52.49%, respectively. The other feasible alternatives were the Recuperated Brayton Cycle, the Simple Brayton Cycle and the Intercooled Brayton Cycle, ranked, in that order.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Rapid generation of optimal generalized Monkhorst-Pack grids

In this report computational modeling of the properties of crystalline materials has become an increasingly important aspect of materials research, consuming hundreds of millions of CPU-hours at scientific computing centers around the world each year, if not more. A routine operation in such calculations is the evaluation of integrals over the Brillouin zone. We have previously demonstrated that performing such integrals using generalized Monkhorst-Pack k-point grids can roughly double the speed of these calculations relative to the widely-used traditional Monkhorst-Pack grids. However the generation of optimal generalized Monkhorst-Pack grids is not implemented in most software packages due to the computational cost and difficulty of identifying the best grids. To address this problem, we present new algorithms that allow rapid generation of optimal generalized Monkhorst-Pack grids on the fly. We demonstrate that the grids generated by these algorithms are on average significantly more efficient than those generated using existing algorithms across a range of grid densities. For grids that correspond to a real-space supercell with at least 50 Å between lattice points, which is sufficient to converge density functional theory calculations within 1 meV/atom for nearly all materials, our algorithm finds optimized grids in an average of 0.19 s on a single processing core. To facilitate the widespread adoption of this approach, we present new open-source tools including a library designed for integration with third-party software packages.

36 MATERIALS SCIENCE↗

SU-G-BRC-10: Feasibility of a Web-Based Monte Carlo Simulation Tool for Dynamic Electron Arc Radiotherapy (DEAR)

Purpose: DEAR is a radiation therapy technique utilizing synchronized motion of gantry and couch during delivery to optimize dose distribution homogeneity and penumbra for treatment of superficial disease. Dose calculation for DEAR is not yet supported by commercial TPSs. The purpose of this study is to demonstrate the feasibility of using a web-based Monte Carlo (MC) simulation tool (VirtuaLinac) to calculate dose distributions for a DEAR delivery. Methods: MC simulations were run through VirtuaLinac, which is based on the GEANT4 platform. VirtuaLinac utilizes detailed linac head geometry and material models, validated phase space files, and a voxelized phantom. The input was expanded to include an XML file for simulation of varying mechanical axes as a function of MU. A DEAR XML plan was generated and used in the MC simulation and delivered on a TrueBeam in Developer Mode. Radiographic film wrapped on a cylindrical phantom (12.5 cm radius) measured dose at a depth of 1.5 cm and compared to the simulation results. Results: A DEAR plan was simulated using an energy of 6 MeV and a 3×10 cm{sup 2} cut-out in a 15×15 cm{sup 2} applicator for a delivery of a 90° arc. The resulting data were found to provide qualitative and quantitative evidence that the simulation platform could be used as the basis for DEAR dose calculations. The resulting unwrapped 2D dose distributions agreed well in the cross-plane direction along the arc, with field sizes of 18.4 and 18.2 cm and penumbrae of 1.9 and 2.0 cm for measurements and simulations, respectively. Conclusion: Preliminary feasibility of a DEAR delivery using a web-based MC simulation platform has been demonstrated. This tool will benefit treatment planning for DEAR as a benchmark for developing other model based algorithms, allowing efficient optimization of trajectories, and quality assurance of plans without the need for extensive measurements.

60 APPLIED LIFE SCIENCES↗

Robust wind farm layout optimization

Wake interactions in wind farms cause losses in annual energy production (AEP) on the order of 10%. Wind farm designers optimize the layout of the farm to mitigate wake losses, especially in the dominant site-specific wind directions. As wind turbines and wind farms grow in scale, optimization becomes more complex. Offshore wind farms regularly comprise more than 100 wind turbines and are characterized by complex boundaries due to shipping lanes, neighboring wind farms, and other constraints. Layout optimization methods are broadly split between gradient-based and gradient-free approaches. Gradient-based approaches can converge quickly and perform well for smaller, academic problems but are often sensitive to initial conditions and tuning parameters and require expert knowledge to use. On the other hand, gradient-free approaches can be more robust to problem complexities. We present a robust layout optimization approach based on a random search algorithm. The algorithm is intended for those who are not optimization experts and has few tuning parameters that need specification to achieve satisfactory results. Unlike off-the-shelf methods, which use generally available, non-domain-specific optimization routines that accept as inputs an optimization function and constraint definitions, this approach takes advantage of the relative computational costs of the different evaluations by evaluating cheaper computations first (boundary and minimum distance constraints) and running expensive AEP evaluations only if all other checks pass. Moreover, an outer genetic algorithm allows multiple solutions to evolve in parallel, enabling rapid solution development on high-performance computers. We discuss the relative ease of selecting necessary tuning parameters and demonstrate the efficacy of the genetic random search on a complex layout problem consisting of placing 70 turbines in a nonconvex and unconnected boundary region.

17 WIND ENERGY↗

Performance optimization, modeling and analysis of sparse matrix-matrix products on multi-core and many-core processors

Sparse matrix-matrix multiplication (SpGEMM) is a computational primitive that is widely used in areas ranging from traditional numerical applications to recent big data analysis and machine learning. Although many SpGEMM algorithms have been proposed, hardware specific optimizations for multi- and many-core processors are lacking and a detailed analysis of their performance under various use cases and matrices is not available. In this work, we firstly identify and mitigate multiple bottlenecks with memory management and thread scheduling on Intel Xeon Phi (Knights Landing or KNL). Specifically targeting many-core processors, we develop a hash-table-based algorithm and optimize a heap-based shared-memory SpGEMM algorithm. We examine their performance together with other publicly available codes. Different from the literature, our evaluation also includes use cases that are representative of real graph algorithms, such as multi-source breadth-first search or triangle counting. Our hash-table and heap-based algorithms are showing significant speedups from libraries in the majority of the cases while different algorithms dominate the other scenarios with different matrix size, sparsity, compression factor and operation type. We wrap up in-depth evaluation results and make a recipe to give the best SpGEMM algorithm for target scenario. We build the performance model for hash-table and heap-based algorithms, which supports the recipe. A critical finding is that hash-table-based SpGEMM gets a significant performance boost if the nonzeros are not required to be sorted within each row of the output matrix. Finally, we integrate our implementations into a large-scale protein clustering code named HipMCL, accelerating its SpGEMM kernel by up to 10X and achieving an overall performance boost for the whole HipMCL application by 2.6X.

97 MATHEMATICS AND COMPUTING↗