Search NASA⌕ Search

SEARCH · Search NASA

Results for “Point 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 955 records · Page 53

Nonlinear optimal recovery in Hilbert spaces

Here, this paper investigates solution strategies for nonlinear problems in Hilbert spaces, such as nonlinear partial differential equations (PDEs) in Sobolev spaces, when only finite measurements are available. We formulate this as a nonlinear optimal recovery problem, establishing its well-posedness and proving its convergence to the true solution as the number of measurements increases. However, the resulting formulation might not have a finite-dimensional solution in general. We thus present a sufficient condition for the finite dimensionality of the solution, applicable to problems with well-defined point evaluation measurements. To address the broader setting, we introduce a relaxed nonlinear optimal recovery and provide a detailed convergence analysis. An illustrative example is given to demonstrate that our formulations and theoretical findings offer a comprehensive framework for solving nonlinear problems in infinite-dimensional spaces with limited data.

convergence↗

Data Locality Enhancement of Dynamic Simulations for Exascale Computing (Final Report)

The development of modern processors exhibits two trends that complicate the optimizations of modern software. The first is the increasing sensitivity of processors' throughput to irregularities in computation. With more processors produced through a massive integration of simple cores, future systems will increasingly favor regular data-level parallel computations, but deviate from the needs of applications with complex patterns. Some evidences are already shown on Graphic Processing Units (GPU): Irregular data accesses (e.g., indirect references A[D[i]]) and conditional branches are limiting many GPU applications' performance at a level an order of magnitude lower than the peak of GPU. The second hardware trend is the growing gap between memory bandwidth and the aggregate speed—that is, the sum of all cores' computing power—of a Chip Multiprocessor (CMP). Despite the capped growth of the peak CPU speed, the aggregate speed of a CMP keeps increasing as more cores get into a single chip. It is expected that by 2018, node concurrency in an exascale system will increase by hundreds of times, whereas, memory bandwidth will expand by only 10 to 20 times. Consequently, data movement and storage is expected to consume more than 70% of the total system power. Bridging this gap is difficult; the complexities of modern CMP memory hierarchy make it even harder: Data cache becomes shared among computing units, and the sharing is often non-uniform—whether two computing units share a cache depends on their proximity and the level of the cache. On the recent IBM Power7 architecture, for instance, four hardware contexts (or SMT threads) in a core share the entire memory hierarchy, all cores in one chip share an on-chip L3 cache, and cores across chips share L3 and main memory through off-chip connections. These two trends complicate the translation of computing power into performance, especially for a program with either intensive data accesses or complex patterns in data accesses or control flow paths. Unfortunately, both attributes present and will persist in a class of important applications. For instance, many scientific simulations deal with a large volume of data. And meanwhile, as most real-world processes are non-uniform and evolving (e.g., the evolution of a galaxy or the process of a drug injection), both the computations and data accesses of these programs tend to be irregular and dynamically changing. Currently, the lack of support to these applications on modern CMP severely limits their performance. On GPU, as our recent study shows and other studies echo, performance enhancement of a factor of integers is possible when memory accesses or control flows are streamlined for a set of GPU applications. On multicore CPU, our studies show that traditional locality enhancement, for being oblivious to the new features of multicore memory hierarchy, may even cause large slowdown to data-intensive dynamic applications. The severity of the issues is expected to worsen as the two hardware trends continue. Some recent studies try to match software with the trends, but in a limited scope or manner. For irregularities on GPU, most studies focus on irregularities analyzable through static analysis (e.g., data accesses in regular loops). Dynamic irregularities are harder to address because the needed analysis and transformations typically have to happen at run time. Some other research resorts to hardware extensions, an actual adoption of which is unclear for the entailed space cost and complexity. For data locality, recent years have seen some exploitations of the new memory hierarchy on multicore for performance, but most of them are on process or thread scheduling, rather than program transformations. Our recent study reveals that program-level transformations may magnify the scheduling benefits by a factor of seven, concluding that program-level transformation should play a central role for data locality enhancement on modern CMP. But research in this direction has been sparse, and most have focused on data layout or cache performance modeling, rather than program transformations to match with the new memory hierarchy features. Overall, it is still an open question how to bridge the gap between dynamic computations and the two prominent properties of modern processors. The goal of this project is to develop a set of techniques and software tools to enhance the matching between memory accesses in dynamic simulations and the prominent features of modern and future CMP, alleviating the memory performance issues for petascale and exascale computing. This report summarizes the discoveries and products produced throughout this project. It includes free launch, a new software approach to overcoming the shortcomings of both methods; coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution; algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Supporting dynamic parallelism is important for GPU to benefit a broad range of applications. There are currently two fundamental ways for programs to exploit dynamic parallelism on GPU: a software-based approach with software-managed worklists, and a hardware-based approach through dynamic subkernel launches. Neither is satisfactory. The former is complicated to program and is often subject to some load imbalance; the latter suffers large runtime overhead. In this work, we propose free launch, a new software approach to overcoming the shortcomings of both methods. It allows programmers to use subkernel launches to express dynamic parallelism. It employs a novel compiler-based code transformation named subkernel launch removal to replace the subkernel launches with the reuse of parent threads. Coupled with an adaptive task assignment mechanism, the transformation reassigns the tasks in the subkernels to the parent threads with a good load balance. The technique requires no hardware extensions, immediately deployable on existing GPUs. It keeps the programming convenience of the subkernel launch-based approach while avoiding its large runtime overhead. Meanwhile, its superior load balancing makes it outperform manual worklist-based techniques by 3X on average. The work was published at the 48th Annual IEEE/ACM International Symposium on Microarchitecture (Micro'2015). A Graphic Processing Unit (GPU) system is typically equipped with many types of memory (e.g., global, constant, texture, shared, cache). Data placement determines what data are placed on which type of memory, essential for GPU memory performance. Prior optimizations of data placement always require a single view of a data object on memory, which limits the optimization effectiveness. In this work, we propose coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution. We demonstrate that under certain conditions, the multiple views can remain incoherent while facilitating enhanced data placement. We present a theorem and some compiler support to ensure the soundness of the usage of coherence-free multiview. We further develop reference-discerning data placement, a new way to enhance data placements on GPU. It enables more flexible data placements by using coherence-free multiview to leverage the slack in coherence requirement of some GPU programs. Experiments on three types of GPU systems show that, with less than 200KB space cost, the new data placement technique can provide a 1.6X average (up to 4.27X) speedup. In addition, we have examined algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Computing distances among data points is an essential part of many important algorithms in data analytics, graph analysis, and other domains. In each of these domains, developers have spent significant manual effort optimizing algorithms, often through novel applications of the triangle equality, in order to minimize the number of distance computations in the algorithms. In this work, we observe that many algorithms across these domains can be generalized as an instance of a generic distance-related abstraction. Based on this abstraction, we derive seven principles for correctly applying the triangular inequality to optimize distance-related algorithms. Guided by the findings, we develop Triangular OPtimizer (TOP), the first software framework that is able to automatically produce optimized algorithms that either matches or outperforms manually designed algorithms for solving distance-related problems. TOP achieves up to 237x speedups and 2.5X on average. The work has been published at the 32nd International Conference on Machine Learning (ICML'15) and the 41st International Conference on Very Large Data Bases (VLDB'15).

42 ENGINEERING↗

Multi-Objective Cycle Optimization of an Integrally Geared Waste Heat Recovery Unit for a Combined Cycle Power System

This paper has presented the cycle design and optimization details for a sCO2-based WHRS targeting the Solar Turbines Titan 130. The PreheatSR cycle layout was chosen to effectively address the issue of acid dew point corrosion and ensure high system performance is not significantly impacted by use of alternative fuels. The optimization process discussed uses a multi-objective optimization to discover a series of optimal cycle configurations given ambient temperature variability for a chosen site location while considering the initial capital cost of the cycle components. Cycle models built that incorporated off-design methods for the heat exchangers and turbomachinery allowed for the investigation of cycle operation that maximizes power output for individual cycle conditions. The resulting Pareto front serves as a guide for how to configure the WHRS cycle for the highest yearly energy extracted for a given investment.

20 FOSSIL-FUELED POWER PLANTS↗

Effective detective quantum efficiency for two mammography systems: Measurement and comparison against established metrics

Purpose: The aim of this paper was to illustrate the value of the new metric effective detective quantum efficiency (eDQE) in relation to more established measures in the optimization process of two digital mammography systems. The following metrics were included for comparison against eDQE: detective quantum efficiency (DQE) of the detector, signal difference to noise ratio (SdNR), and detectability index (d′) calculated using a standard nonprewhitened observer with eye filter.Methods: The two systems investigated were the Siemens MAMMOMAT Inspiration and the Hologic Selenia Dimensions. The presampling modulation transfer function (MTF) required for the eDQE was measured using two geometries: a geometry containing scattered radiation and a low scatter geometry. The eDQE, SdNR, and d′ were measured for poly(methyl methacrylate) (PMMA) thicknesses of 20, 40, 60, and 70 mm, with and without the antiscatter grid and for a selection of clinically relevant target/filter (T/F) combinations. Figures of merit (FOMs) were then formed from SdNR and d′ using the mean glandular dose as the factor to express detriment. Detector DQE was measured at energies covering the range of typical clinically used spectra.Results: The MTF measured in the presence of scattered radiation showed a large drop at low spatial frequency compared to the low scatter method and led to a corresponding reduction in eDQE. The eDQE for the Siemens system at 1 mm{sup −1} ranged between 0.15 and 0.27, depending on T/F and grid setting. For the Hologic system, eDQE at 1 mm{sup −1} varied from 0.15 to 0.32, again depending on T/F and grid setting. The eDQE results for both systems showed that the grid increased the system efficiency for PMMA thicknesses of 40 mm and above but showed only small sensitivity to T/F setting. While results of the SdNR and d′ based FOMs confirmed the eDQE grid position results, they were also more specific in terms of T/F selection. For the Siemens system at 20 mm PMMA, the FOMs indicated Mo/Mo (grid out) as optimal while W/Rh (grid in) was the optimal configuration at 40, 60, and 70 mm PMMA. For the Hologic, the FOMs pointed to W/Rh (grid in) at 20 and 40 mm of PMMA while W/Ag (grid in) gave the highest FOM at 60 and 70 mm PMMA. Finally, DQE at 1 mm{sup −1} averaged for the four beam qualities studied was 0.44 ± 0.02 and 0.55 ± 0.03 for the Siemens and Hologic detectors, respectively, indicating only a small influence of energy on detector DQE.Conclusions: Both the DQE and eDQE data showed only a small sensitivity to T/F setting for these two systems. The eDQE showed clear preferences in terms of scatter reduction, being highest for the grid-in geometry for PMMA thicknesses of 40 mm and above. The SdNR and d′ based figures of merit, which contain additional weighting for contrast and dose, pointed to specific T/F settings for both systems.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Constructing the Pareto front for multi-objective Markov chains handling a strong Pareto policy approach

In this paper, we present a multi-objective solution of the Pareto front for a certain class of discrete-time ergodic controllable Markov chains. For solving the problem, we transform the original multi-objective problem into an equivalent nonlinear programming problem implementing the Lagrange principle. We then propose to adopt the Tikhonov’s regularization method to ensure the convergence of the cost functions to a unique point into the Pareto front. We show that Pareto policies are characterized as optimal policies. One of the fundamental problems related to the construction of the Pareto front is the existence and characterization of both, Pareto and strong Pareto policies. By introducing the Tikhonov’s regularizator, we ensure the existence of strong Pareto policies. This paper proposes a real solution to this problem. We formulate the original problem considering several constraints: (a) we employ the c-variable method for the introduction of linear constraints over the nonlinear problem and (b) restrict the cost functions, allowing points in the Pareto front to have a small distance from one another. The constraints imposed by the c-variable method make the problem computationally tractable and the restriction imposed by the small distance change ensures the continuation of the Pareto front. The resulting equation in this nonlinear system is an optimization problem for which the necessary and efficient condition of a minimum is solved using the projected gradient method. Moreover, we also prove the convergence conditions and compute the estimate rate of convergence of variables corresponding to the Lagrange principle and the Tikhonov’s regularization, respectively. We provide all the details needed to implement the proposed method in an efficient way. The usefulness of the method is successfully demonstrated by a numerical example.

97 MATHEMATICS AND COMPUTING↗

Treatment planning for volumetric modulated arc therapy

Purpose: Volumetric modulated arc therapy (VMAT) is a specific type of intensity-modulated radiation therapy (IMRT) in which the gantry speed, multileaf collimator (MLC) leaf position, and dose rate vary continuously during delivery. A treatment planning system for VMAT is presented. Methods: Arc control points are created uniformly throughout one or more arcs. An iterative least-squares algorithm is used to generate a fluence profile at every control point. The control points are then grouped and all of the control points in a given group are used to approximate the fluence profiles. A direct-aperture optimization is then used to improve the solution, taking into account the allowed range of leaf motion of the MLC. Dose is calculated using a fast convolution algorithm and the motion between control points is approximated by 100 interpolated dose calculation points. The method has been applied to five cases, consisting of lung, rectum, prostate and seminal vesicles, prostate and pelvic lymph nodes, and head and neck. The resulting plans have been compared with segmental (step-and-shoot) IMRT and delivered and verified on an Elekta Synergy to ensure practicality. Results: For the lung, prostate and seminal vesicles, and rectum cases, VMAT provides a plan of similar quality to segmental IMRT but with faster delivery by up to a factor of 4. For the prostate and pelvic nodes and head-and-neck cases, the critical structure doses are reduced with VMAT, both of these cases having a longer delivery time than IMRT. The plans in general verify successfully, although the agreement between planned and measured doses is not very close for the more complex cases, particularly the head-and-neck case. Conclusions: Depending upon the emphasis in the treatment planning, VMAT provides treatment plans which are higher in quality and/or faster to deliver than IMRT. The scheme described has been successfully introduced into clinical use.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

ELM control optimization for various ITER scenarios based on linear and quasi-linear figures of merit

For the purpose of better understanding type-I edge localized mode (ELM) control in ITER with resonant magnetic perturbation (RMP) fields, the plasma response to RMP is computed by a resistive full magneto-hydrodynamic model in toroidal geometry. Five scenarios designed for ITER are considered, ranging from the pre-nuclear to nuclear phases. The plasma response to RMP is quantified by the plasma surface displacement near the X-point of the divertor plasma and at the outboard mid-plane. The optimal coil configurations between two high- Q deuterium-tritium (DT) scenarios (at the same plasma current of 15 MA and the same magnetic field of 5.3 T but different fusion gains, Q = 5 and 10) are predicted to be similar. For the other ITER scenarios with similar edge safety factor q 95 ~ 3 to that of the baseline scenario, the optimal coil phasing is also similar. The optimization results are different for a half-current full-field (7.5 MA/5.3 T) scenario, largely due to the difference in q 95 . The RMP coil currents are also optimized to tailor the core vs edge toroidal torques exerted by the 3D RMP fields on the plasma column. Torque optimization, with various objective functions proposed in the study, is useful for minimizing the side effects of RMP on the plasma core flow in ITER, while still maintaining the ELM control capability. Full utilization of three rows of ELM control coils in ITER is found to be essential to ensure both flexibility and robustness of ELM control, in terms of both linear and quasilinear plasma responses.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

On the extent and connectivity of conical intersection seams and the effects of three-state intersections

We discuss the connectivity of intersection spaces and the role of minimal energy points within these intersection spaces (minimal energy conical intersections or MECIs) in promoting nonadiabatic transitions. We focus on malonaldeyde as a specific example, where there is a low-lying three-state conical intersection. This three-state intersection is the global minimum on the bright excited electronic state, but it plays a limited role in population transfer in our ab initio multiple spawning (AIMS) simulations because the molecule must traverse a series of two-state conical intersections to reach the three-state intersection. Due to the differences in seam space dimensionality separating conventional (two-state) and three-state intersections, we suggest that dynamical effects arising directly from a three-state intersection may prove difficult to observe in general. We also use a newly developed method for intersection optimization with geometric constraints to demonstrate the connectivity of all the stationary points in the intersection spaces for malonaldehyde. This supports the conjecture that all intersection spaces are connected, and that three-state intersections play a key role in extending this connectivity to all pairs of states, e.g. the S{sub 1}/S{sub 0} and S{sub 2}/S{sub 1} intersection spaces.

74 ATOMIC AND MOLECULAR PHYSICS↗

Automated registration of multispectral MR vessel wall images of the carotid artery

Purpose: Atherosclerosis is the primary cause of heart disease and stroke. The detailed assessment of atherosclerosis of the carotid artery requires high resolution imaging of the vessel wall using multiple MR sequences with different contrast weightings. These images allow manual or automated classification of plaque components inside the vessel wall. Automated classification requires all sequences to be in alignment, which is hampered by patient motion. In clinical practice, correction of this motion is performed manually. Previous studies applied automated image registration to correct for motion using only nondeformable transformation models and did not perform a detailed quantitative validation. The purpose of this study is to develop an automated accurate 3D registration method, and to extensively validate this method on a large set of patient data. In addition, the authors quantified patient motion during scanning to investigate the need for correction. Methods: MR imaging studies (1.5T, dedicated carotid surface coil, Philips) from 55 TIA/stroke patients with ipsilateral <70% carotid artery stenosis were randomly selected from a larger cohort. Five MR pulse sequences were acquired around the carotid bifurcation, each containing nine transverse slices: T1-weighted turbo field echo, time of flight, T2-weighted turbo spin-echo, and pre- and postcontrast T1-weighted turbo spin-echo images (T1W TSE). The images were manually segmented by delineating the lumen contour in each vessel wall sequence and were manually aligned by applying throughplane and inplane translations to the images. To find the optimal automatic image registration method, different masks, choice of the fixed image, different types of the mutual information image similarity metric, and transformation models including 3D deformable transformation models, were evaluated. Evaluation of the automatic registration results was performed by comparing the lumen segmentations of the fixed image and moving image after registration. Results: The average required manual translation per image slice was 1.33 mm. Translations were larger as the patient was longer inside the scanner. Manual alignment took 187.5 s per patient resulting in a mean surface distance of 0.271 ± 0.127 mm. After minimal user interaction to generate the mask in the fixed image, the remaining sequences are automatically registered with a computation time of 52.0 s per patient. The optimal registration strategy used a circular mask with a diameter of 10 mm, a 3D B-spline transformation model with a control point spacing of 15 mm, mutual information as image similarity metric, and the precontrast T1W TSE as fixed image. A mean surface distance of 0.288 ± 0.128 mm was obtained with these settings, which is very close to the accuracy of the manual alignment procedure. The exact registration parameters and software were made publicly available. Conclusions: An automated registration method was developed and optimized, only needing two mouse clicks to mark the start and end point of the artery. Validation on a large group of patients showed that automated image registration has similar accuracy as the manual alignment procedure, substantially reducing the amount of user interactions needed, and is multiple times faster. In conclusion, the authors believe that the proposed automated method can replace the current manual procedure, thereby reducing the time to analyze the images.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Optimized mirror shape tuning using beam weightings based on distance, angle of incidence, reflectivity, and power

For glancing-incidence optical systems, such as short-wavelength optics used for nano-focusing, incorporating physical factors in the calculations used for shape optimization can improve performance. Wavefront metrology, including the measurement of a mirror's shape or slope, is routinely used as input for mirror figure optimization on mirrors that can be bent, actuated, positioned, or aligned. Modeling shows that when the incident power distribution, distance from focus, angle of incidence, and the spatially varying reflectivity are included in the optimization, higher Strehl ratios can be achieved. Following the works of Maréchal and Mahajan, optimization of the Strehl ratio (for peak intensity with a coherently illuminated system) occurs when the expectation value of the phase error's variance is minimized. We describe an optimization procedure based on regression analysis that incorporates these physical parameters. This approach is suitable for coherently illuminated systems of nearly diffraction-limited quality. Mathematically, this work is an enhancement of the methods commonly applied for ex situ alignment based on uniform weighting of all points on the surface (or a sub-region of the surface). It follows a similar approach to the optimization of apodized and non-uniformly illuminated optical systems. Significantly, it reaches a different conclusion than a more recent approach based on minimization of focal plane ray errors.

47 OTHER INSTRUMENTATION↗

Blade and Rim Seal Design of a First Stage High Pressure Turbine for a 300 MWe Supercritical CO2 Power Cycle

A first stage high-pressure turbine (HPT) blade is optimized for a 300 MWe supercritical CO2 (sCO2) power cycle using the surrogate-assisted genetic algorithm optimizer in Numeca FINE/Design 3D with objectives of increasing efficiency and decreasing heat load to the blade. The National Institute of Standards and Technology Reference Fluid Thermodynamic and Transport Properties Database (NIST REFPROP) [1] data for supercritical CO2 is formatted into tables of bicubic polynomial coefficients for use in condensable gas simulations in FINE/Turbo. Nearly 3000 unique shapes are evaluated via three-dimensional Reynolds Averaged Navier Stokes simulations, yielding increases in efficiency of up to 0.85 percentage points and decreases in heat load of 14%. A final blade, deemed the advanced blade, is chosen for future experimental analysis. Following this, a squealer tip optimization is performed on both the baseline and advanced blade designs. This optimization resulted in a performance gain of 1.25 points in efficiency and 15% reduction in tip heat load compared to the baseline flat tip design at the same clearance. In tandem, an optimization of the rotor-stator platform rim seal is performed using a parametrized geometry allowing for straight, meandering, and knife seal cavities. This multi-objective optimization focuses on decreasing the cooling mass flow and increasing the heat flux from the rotor and stator disk. The optimization resulted in cooling mass flow decreases of up to 26% while maintaining the average heat flux on the rim seal.

Tuite, Logan↗

Vision for cross-layer optimization to address the dual challenges of energy and reliability

We are rapidly approaching an inflection point where the conventional target of producing perfect, identical transistors that operate without upset can no longer be maintained while continuing to reduce the energy per operation. With power requirements already limiting chip performance, continuing to demand perfect, upset-free transistors would mean the end of scaling benefits. The big challenges in device variability and reliability are driven by uncommon tails in distributions, infrequent upsets, one-size-fits-all technology requirements, and a lack of information about the context of each operation. Solutions co-designed across traditional layer boundaries in our system stack can change the game, allowing architecture and software (a) to compensate for uncommon variation, environments, and events, (b) to pass down invariants and requirements for the computation, and (c) to monitor the health of collections of deVices. Cross-layer codesign provides a path to continue extracting benefits from further scaled technologies despite the fact that they may be less predictable and more variable. While some limited multi-layer mitigation strategies do exist, to move forward redefining traditional layer abstractions and developing a framework that facilitates cross-layer collaboration is necessary.

97 MATHEMATICS AND COMPUTING↗

Structure and dynamics of ion clusters in linear octupole traps: Phase diagrams, chirality, and melting mechanisms

The stable structures and melting dynamics of clusters of identical ions bound by linear octupole radiofrequency traps are theoretically investigated by global optimization methods and molecular dynamics simulations. By varying the cluster sizes in the range of 10-1000 ions and the extent of trap anisotropy by more than one order of magnitude, we find a broad variety of stable structures based on multiple rings at small sizes evolving into tubular geometries at large sizes. The binding energy of these clusters is well represented by two contributions arising from isotropic linear and octupolar traps. The structures generally exhibit strong size effects, and chiral arrangements spontaneously emerge in many crystals. Sufficiently large clusters form nested, coaxial tubes with different thermal stabilities. As in isotropic octupolar clusters, the inner tubes melt at temperatures that are lower than the overall melting point.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SU-F-T-383: Robustness for Patient Setup Error in Total Body Irradiation Using Volumetric Modulated Arc Therapy (VMAT)

Purpose: Total body irradiation (TBI) and total marrow irradiation (TMI) using Tomotherapy have been reported. A gantry-based linear accelerator uses one isocenter during one rotational irradiation. Thus, 3–5 isocenter points should be used for a whole plan of TBI-VMAT during smoothing out the junctional dose distribution. IGRT provides accurate and precise patient setup for the multiple junctions, however it is evident that some setup errors should occur and affect accuracy of dose distribution in the area. In this study, we evaluated the robustness for patient’s setup error in VMAT-TBI. Methods: VMAT-TBI Planning was performed in an adult whole-body human phantom using Eclipse. Eight full arcs with four isocenter points using 6MV-X were used to cover the entire whole body. Dose distribution was optimized using two structures of patient’s body as PTV and lung. The two arcs were shared with one isocenter and the two arcs were 5 cm-overlapped with the other two arcs. Point absolute dose using ionization-chamber and planer relative dose distribution using film in the junctional regions were performed using water-equivalent slab phantom. In the measurements, several setup errors of (+5∼−5mm) were added. Results: The result of the chamber measurement shows the deviations were within ±3% when the setup errors were within ±3 mm. In the planer evaluation, the pass ratio of gamma evaluation (3%/2mm) shows more than 90% if the errors within ±3 mm. However, there were hot/cold areas in the edge of the junction even with acceptable gamma pass ratio. 5 mm setup error caused larger hot and cold areas and the dosimetric acceptable areas were decreased in the overlapped areas. Conclusion: It can be clinically acceptable for VMAT-TBI when patient setup error is within ±3mm. Averaging effects from patient random error would be helpful to blur the hot/cold area in the junction.

60 APPLIED LIFE SCIENCES↗

Parallel interior-point solver for block-structured nonlinear programs on SIMD/GPU architectures

Here, we investigate how to port the standard interior-point method to new exascale architectures for block-structured nonlinear programs with state equations. Computationally, we decompose the interior-point algorithm into two successive operations: the evaluation of the derivatives and the solution of the associated Karush-Kuhn-Tucker (KKT) linear system. Our method accelerates both operations using two levels of parallelism. First, we distribute the computations on multiple processes using coarse parallelism. Second, each process uses SIMD/GPU accelerators locally to accelerate the operations using fine-grained parallelism. The KKT system is reduced by eliminating the inequalities and the state variables from the corresponding equations. We demonstrate our method's capability on the supercomputer Polaris, a testbed for the future exascale Aurora system. Each node is equipped with four GPUs, a setup amenable to our two-level approach. Our experiments on the stochastic optimal power flow problem show that the reduction method is 50x faster than the sparse linear solver HSL MA57 running in serial on the CPU, and 6x faster than Pardiso running in parallel on CPU on the same number of processes.

97 MATHEMATICS AND COMPUTING↗

FARM User Guidance and Instructions

The FARM (Feasible Actuator Range Modifier) module is a component of the RAVEN-based FORCE framework for the analysis of Integrated Energy Systems (IES). FARM aids HERON in the solution of the power dispatch problem by evaluating feasible set-point signals to be issued to the control systems of the different IES unit components. Set-points need to satisfy limits on both production variables (i.e., the variables to be optimized such as the electrical power, etc.) and process variables tied to the service life of equipment (e.g., steam flowrate, vessel pressure, turbine firing temperature, etc.). To enforce all these limits, a two-stage approach is adopted. First, the power dispatcher algorithm in HERON module estimates set-points that meet the constraints on the production variables, e.g., power levels and power ramp rate limits. These constraints are called explicit constraints. Then, if necessary, FARM adjusts these set-points to ensure the respect of the limits on the process variables of interest, given the knowledge of the system dynamics acquired through machine learning algorithms. These constraints are called implicit constraints. From this standpoint, FARM constitutes a bridge between the HERON power dispatcher that adopts a simplified description of the IES unit (low-resolution physics) and the HYBRID high-fidelity models (high-resolution physics). In this report, the general workflow and the software requirements of FARM module are summarized, and the detailed instructions for installing FARM software, running built-in example cases, deriving Linear Parameter-Varying (LPV) state-space models, and using FARM for user-defined power dispatch problems are provided.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

FARM supervisory capabilities for thermal energy storage

The FARM (Feasible Actuator Range Modifier) module is a component of the RAVEN-based FORCE framework for the analysis of Integrated Energy Systems (IES). FARM aids HERON in the solution of the power dispatch problem by evaluating feasible set-point signals to be issued to the control systems of the different IES unit components. Set-points need to satisfy limits on both production variables (i.e., the variables to be optimized such as the electrical power, etc.) and process variables tied to the service life of equipment (e.g., steam flowrate, vessel pressure, turbine firing temperature, etc.). To enforce all these limits, a two-stage approach is adopted. First, the power dispatcher algorithm in HERON module estimates set-points that meet the constraints on the production variables, e.g., power levels and power ramp rate limits. These constraints are called explicit constraints. Then, if necessary, FARM adjusts these set-points to ensure the respect of the limits on the process variables of interest, given the knowledge of the system dynamics acquired through machine learning algorithms. These constraints are called implicit constraints. From this standpoint, FARM constitutes a bridge between the HERON power dispatcher that adopts a simplified description of the IES unit (low-resolution physics) and the HYBRID high-fidelity models (high-resolution physics). In this report, an overview of the major capabilities of the latest release of FARM is provided, along with a summary of the tool demonstration campaign conducted at the Dynamic Energy Technology and Integration Laboratory (DETAIL) facility. These results assess the performance of the control system architecture embedding FARM both as a Validator of the HERON power dispatcher and as a real time Supervisory control scheme. Additionally, the report outlines the areas that FARM might benefit from, along with proposed solutions.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Data-Driven Modeling and Optimization of Building Energy Consumption: a Case Study

Installing sensors and Building Automation Systems (BAS) allows controlling the facility operations while generating data that can be analyzed for model development. This work focuses on data-driven modeling of the building to optimize energy consumption. The City of Orlando aims to reduce its energy consumption so, they provided us access to their BAS for data and studying the operation of its facilities. We selected a mid-size pilot building to conduct data analysis and modeling. We develop an Application Programming Interface (API) to login to the servers and scrape data. The scraped data contains features ranging from environmental conditions to equipment activity. This dataset is a time series so, it's handled in accordance and analyzed to investigate patterns and relations between data points that help choose parameters for predictive models for building and equipment. Finally, the models are optimized to reduce the energy consumption of the facility.

Grover, Divas↗