Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “program optimizations”

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 361 records · Page 20

Scenario Creation and Power-Conditioning Strategies for Operating Power Grids with Two-Stage Stochastic Economic Dispatch: Preprint

A significant difficultly associated with the use of stochastic programming to solve optimal power flow problems on a 5-minute timescale is the quality of renewable energy scenarios input by the user. This is especially true when considering power systems with high penetrations of renewable energy, e.g. wind power. This paper introduces the use of stochastic programming to solve the DCOPF problem with scenarios drawn directly from high-fidelity data sets. Hence, the proposed method avoids the problem of lost physics by finding high-fidelity analogs that can describe future states of the system. Furthermore, this method can be simply extended to output multi-period scenarios to the stochastic program. We demonstrate the effectiveness of this technique on simulated dispatch operations of the RTS-GMLC over a week.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Finite-volume pionless effective field theory for few-nucleon systems with differentiable programming

Finite-volume pionless effective field theory provides an efficient framework for the extrapolation of nuclear spectra and matrix elements calculated at finite volume in lattice QCD to infinite volume, and to nuclei with larger atomic number. In this work, it is demonstrated how this framework may be implemented via a set of correlated Gaussian wave functions optimized using differentiable programming and via solution of a generalized eigenvalue problem. This approach is shown to be significantly more efficient than a stochastic implementation of the variational method based on the same form of correlated Gaussian wave functions, yielding comparably accurate representations of the ground-state wave functions with an order of magnitude fewer terms. The efficiency of representation allows such calculations to be extended to larger systems than in previous work. Further, the method is demonstrated through calculations of the binding energies of nuclei with atomic number A ϵ {2,3,4} in finite volume, matched to lattice QCD calculations at quark masses corresponding to m π = 806 MeV, and infinite-volume effective field theory calculations of A ϵ {2,3,4,5,6} systems based on this matching.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Optimized Quantum Compilation for Near-Term Algorithms with OpenPulse

Quantum computers are traditionally operated by programmers at the granularity of a gate-based instruction set. However, the actual device-level control of a quantum computer is performed via analog pulses. Here, we introduce a compiler that exploits direct control at this microarchitectural level to achieve significant improvements for quantum programs. Unlike quantum optimal control, our approach is bootstrapped from existing gate calibrations and the resulting pulses are simple. Our techniques are applicable to any quantum computer and realizable on current devices. We validate our techniques with millions of experimental shots on IBM quantum computers, controlled via the OpenPulse control interface. For representative benchmarks, our pulse control techniques achieve both 1.6x lower error rates and 2x faster execution time, relative to standard gate-based compilation. These improvements are critical in the near-term era of quantum computing, which is bottlenecked by error rates and qubit lifetimes.

Gokhale, Pranav↗

SU-E-T-256: Optimizing the Combination of Targeted Radionuclide Therapy Agents Using a Multi-Scale Patient-Specific Monte Carlo Dosimetry Platform

Purpose: Combination targeted radionuclide therapy (TRT) is appealing because it can potentially exploit different mechanisms of action from multiple radionuclides as well as the variable dose rates due to the different radionuclide half-lives. The work describes the development of a multiobjective optimization algorithm to calculate the optimal ratio of radionuclide injection activities for delivery of combination TRT. Methods: The ‘diapeutic’ (diagnostic and therapeutic) agent, CLR1404, was used as a proof-of-principle compound in this work. Isosteric iodine substitution in CLR1404 creates a molecular imaging agent when labeled with I-124 or a targeted radiotherapeutic agent when labeled with I-125 or I-131. PET/CT images of high grade glioma patients were acquired at 4.5, 24, and 48 hours post injection of 124I-CLR1404. The therapeutic 131I-CLR1404 and 125ICLR1404 absorbed dose (AD) and biological effective dose (BED) were calculated for each patient using a patient-specific Monte Carlo dosimetry platform. The optimal ratio of injection activities for each radionuclide was calculated with a multi-objective optimization algorithm using the weighted sum method. Objective functions such as the tumor dose heterogeneity and the ratio of the normal tissue to tumor doses were minimized and the relative importance weights of each optimization function were varied. Results: For each optimization function, the program outputs a Pareto surface map representing all possible combinations of radionuclide injection activities so that values that minimize the objective function can be visualized. A Pareto surface map of the weighted sum given a set of user-specified importance weights is also displayed. Additionally, the ratio of optimal injection activities as a function of the all possible importance weights is generated so that the user can select the optimal ratio based on the desired weights. Conclusion: Multi-objective optimization of radionuclide injection activities can provide an invaluable tool for maximizing the dosimetric benefits in multi-radionuclide combination TRT. BT, JG, and JW are affiliated with Cellectar Biosciences which owns the licensing rights to CLR1404 and related compounds.

60 APPLIED LIFE SCIENCES↗

Meter-Based Assessment of the Time and Locational Benefits of a Large Utility’s DSM Portfolio

As decarbonization goals drive increasing levels of renewable generation, there is a need to understand the time- and location-based savings benefits of demand-side management (DSM) programs. The challenges of the 'duck curve' are driving the utility industry to consider how programs can be optimized to match demand profiles with low carbon generation resources. From an infrastructure standpoint, time- and location-targeted DSM could serve as a ‘non-wires alternative’ (NWA) to defer equipment upgrades. Additional DSM value streams are motivating innovation in savings evaluation, providing more resolved insights beyond the total annual program impact. Methods grounded in the principles of billing analysis, leveraging hourly metering at the distribution grid, can provide new visibility into the spatial and temporal savings achieved through DSM. A large body of work has investigated related topics including interval meter-based savings analysis, the time- varying nature of efficiency measures, and NWA. A less studied topic concerns the impact of DSM on the grid, based on metered consumption. This paper presents an analysis of interval data across more than 25,000 customers and twelve substations, from the Sacramento Municipal Utility District. The results show for different locations on the grid: achieved savings and the impact on grid consumption; hourly savings shapes for DSM program participants and non-participants, and how those shapes vary with season; and the impact of the programs on peak demand. These findings show the current impact of DSM, with implications for future, more intentional targeting as the utility continues to pursue aggressive electrification, efficiency, load flexibility, and reliable NWA.

Granderson, Jessica↗

TH-EF-BRB-04: 4π Dynamic Conformal Arc Therapy Dynamic Conformal Arc Therapy (DCAT) for SBRT

Purpose: To develop an efficient and effective trajectory optimization methodology for 4π dynamic conformal arc treatment (4π DCAT) with synchronized gantry and couch motion; and to investigate potential clinical benefits for stereotactic body radiation therapy (SBRT) to breast, lung, liver and spine tumors. Methods: The entire optimization framework for 4π DCAT inverse planning consists of two parts: 1) integer programming algorithm and 2) particle swarm optimization (PSO) algorithm. The integer programming is designed to find an optimal solution for arc delivery trajectory with both couch and gantry rotation, while PSO minimize a non-convex objective function based on the selected trajectory and dose-volume constraints. In this study, control point interaction is explicitly taken into account. Beam trajectory was modeled as a series of control points connected together to form a deliverable path. With linear treatment planning objectives, a mixed-integer program (MIP) was formulated. Under mild assumptions, the MIP is tractable. Assigning monitor units to control points along the path can be integrated into the model and done by PSO. The developed 4π DCAT inverse planning strategy is evaluated on SBRT cases and compared to clinically treated plans. Results: The resultant dose distribution of this technique was evaluated between 3D conformal treatment plan generated by Pinnacle treatment planning system and 4π DCAT on a lung SBRT patient case. Both plans share the same scale of MU, 3038 and 2822 correspondingly to 3D conformal plan and 4π DCAT. The mean doses for most of OARs were greatly reduced at 32% (cord), 70% (esophagus), 2.8% (lung) and 42.4% (stomach). Conclusion: Initial results in this study show the proposed 4π DCAT treatment technique can achieve better OAR sparing and lower MUs, which indicates that the developed technique is promising for high dose SBRT to reduce the risk of secondary cancer.

60 APPLIED LIFE SCIENCES↗

Plant Engineers Solar Energy Handbook: Southern California Region

Discussed in order after the introduction are solar components and systems (collectors, storage, service hot water systems, space heating with liquid and air systems, space cooling, heat pumps and controls); computer programs for system optimization; local solar and weather data; a description of buildings and plants in Southern California applying solar technology; current Federal and California solar legislation; standards, codes and performance testing information; a listing of manufacturers, distributors, and professional services available in Southern California region; and information access. Finally, solar design check lists for those engineers who wish to design their own systems. The program for the Solar Workshop for the Plant Engineer, March 30, 1978, Los Angeles, California is included.

14 SOLAR ENERGY↗

Performance Exploration Through Optimistic Static Program Annotations

Compilers are limited by the static information directly or indirectly encoded in the program. Low-level languages, such as C/C++, are considered problematic as their weak type system and relaxed memory semantic allows for various, sometimes non-obvious, behaviors. Since compilers have to preserve the program semantics for all program executions, the existence of exceptional behavior can prevent optimizations that the developer would consider valid and might expect. Analyses to guarantee the absence of disruptive and unlikely situations are consequently an indispensable part of an optimizing compiler. However, such analyses have to be approximative and limited in scope as global and exact solutions are infeasible for any non-trivial program. In this paper, we present an automated tool to measure the effectmissing static information has on the optimizations applied to a given program. The approach generates an optimistically optimized program version which, compared to the original, defines a performance gap that can be closed by better compiler analyses and selective static program annotations. Our evaluation on six already tuned proxy applications for high-performance codes shows speedups of up to 20.6%. This clearly indicates that static uncertainty limits performance. At the same time, we observed that compilers are often unable to utilize additional static information. Thus, manual annotation of all correct static information is therefore not only error prone but also mostly redundant.

Auto Tuning↗

Scalable Preconditioning of Block-Structured Linear Algebra Systems using ADMM

In this paper, we study the solution of block-structured linear algebra systems arising in optimization by using iterative solution techniques. These systems are the core computational bottleneck of many problems of interest such as parameter estimation, optimal control, network optimization, and stochastic programming. Our approach uses a Krylov solver (GMRES) that is preconditioned with an alternating method of multipliers (ADMM). We show that this ADMM-GMRES approach overcomes well-known scalability issues of Schur complement decomposition in problems that exhibit a high degree of coupling. The effectiveness of the approach is demonstrated using linear systems that arise in stochastic optimal power flow problems and that contain up to 2 million total variables and 4,000 coupling variables. We find that ADMM-GMRES is nearly an order of magnitude faster than Schur complement decomposition. Moreover, we demonstrate that the approach is robust to the selection of the augmented Lagrangian penalty parameter, which is a key advantage over the direct use of ADMM.

97 MATHEMATICS AND COMPUTING↗

Scenario Decomposition for 0-1 Stochastic Programs: Improvements and Asynchronous Implementation

We recently proposed scenario decomposition algorithm for stochastic 0-1 programs finds an optimal solution by evaluating and removing individual solutions that are discovered by solving scenario subproblems. In our work, we develop an asynchronous, distributed implementation of the algorithm which has computational advantages over existing synchronous implementations of the algorithm. Improvements to both the synchronous and asynchronous algorithm are proposed. We also test the results on well known stochastic 0-1 programs from the SIPLIB test library and is able to solve one previously unsolved instance from the test set.

97 MATHEMATICS AND COMPUTING↗

Optimal planning of the joint placement of photovoltaic panels and green roofs under climate change uncertainty

Photovoltaic (PV) panels directly convert sunlight into electricity; but, sunlight also heats the panels, negatively impacting their efficiency. Green roofs are vegetative layers grown on rooftops, mainly to provide added insulation on the roof to save energy. Green roofs also cool near-surface air temperature. Hence, the joint installation of PV panels and green roofs may potentially lead to higher efficiency of PV panels in certain climates. We develop a two-stage stochastic programming model to optimally place PV panels and green roofs under climate change uncertainty to maximize the overall profit from energy generated and saved. We calibrate the model using the literature, industry reports, and the data from different, at times conflicting, climate projections. We then conduct a case study for a mid-size city in the U.S., perform extensive sensitivity and robustness analyses and provide insights.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Near-optimal routing of noisy quantum states

Placement, routing, and scheduling are essential tasks for near-optimal performance of programs for noisy quantum processors. Reliable execution of an arbitrary quantum circuit on current devices requires routing methods that overcome connectivity limitations while meeting data locality requirements. However, current devices also express highly variable noise levels in both the quantum gates and quantum registers. This requires any routing algorithm to be adaptive to both the circuit and the operating conditions. We demonstrate near-optimal routing methods of noisy quantum states that minimize the overall error of data movement while also limiting the computational complexity of routing decisions. We evaluate our methods against the noise characteristics of a 20-qubit superconducting quantum processor.

Sadlier III, Ronald↗

Modeling Road Vulnerability to Snow Using Mixed Integer Optimization

As the number and severity of snowfall events continue to grow, the need to intelligently direct road maintenance during these snowfall events will also grow. In several locations, local governments lack the resources to completely treat all roadways during snow events. Furthermore, some governments utilize only traffic data to determine which roads should be treated. As a result, many schools, businesses, and government offices must be unnecessarily closed, which directly impacts the social, educational, and economic well-being of citizens and institutions. In this work, we propose a mixed integer programming formulation to optimally allocate resources to manage snowfall on roads using meteorological, geographical, and environmental parameters. Additionally, we evaluate the impacts of an increase in budget for winter road maintenance on snow control resources.

Mixed integer optimization↗

Maximizing dynamic range and performance of anatase TiO 2 ECRAM through structure and programming

Here, in this study, we investigate the structure-dependent modulation characteristics of all-solid-state three-terminal electrochemical random-access memory (ECRAM) based on an anatase Li x TiO 2 channel. By directly comparing “asymmetric” and “symmetric” ECRAM device architectures, we reveal significant insight into the impact of a non-zero gate-drain open-circuit voltage and its influence on voltage vs. current-controlled gating. We also explore the impact of potentiation/depression write parameters on the symmetry, linearity, and dynamic range of the device response. Together, initial results from optimizing structure and programming approaches yielded unprecedented G max /G min ratios of >1,000 for ECRAM and hundreds of tunable memory states with excellent linearity and symmetry. Simulations based on these ECRAM devices further illustrate the promise of this analog memory technology, achieving near 2% classification error in the MNIST digit recognition benchmark for a range of training parameters compared to a theoretical best of 1.66% and outperforming other device models extracted from the literature.

AIHWKit↗

Controlling risk and demand ambiguity in newsvendor models

We use distributionally robust optimization (DRO) to model a general class of newsvendor problems with unknown demand distribution. The goal is to find an order quantity that minimizes the worst-case expected cost among an ambiguity set of distributions. The ambiguity set consists of those distributions that are not far—in the sense of the total variation distance—from a nominal distribution. The maximum distance allowed in the ambiguity set (called level of robustness) places the DRO between the risk-neutral stochastic programming and robust optimization models. An important problem a decision maker faces is how to determine the level of robustness—or, equivalently, how to find an appropriate level of risk-aversion. We answer this question in two ways. Our first approach relates the level of robustness and risk to the regions of demand that are critical (in a precise sense we introduce) to the optimal cost. Our second approach establishes new quantitative relationships between the DRO model and the corresponding risk-neutral and classical robust optimization models. To achieve these goals, we first focus on a single-product setting and derive explicit formulas and properties of the optimal solution as a function of the level of robustness. Then, we demonstrate the practical and managerial relevance of our results by applying our findings to a healthcare problem to reserve operating room time for cardiovascular surgeries. Finally, we extend some of our results to the multi-product setting and illustrate them numerically.

99 GENERAL AND MISCELLANEOUS↗

Automated property optimization via ab initio O(N) elongation method: Application to (hyper-)polarizability in DNA

An automated property optimization method was developed based on the ab initio O(N) elongation (ELG) method and applied to the optimization of nonlinear optical (NLO) properties in DNA as a first test. The ELG method mimics a polymerization reaction on a computer, and the reaction terminal of a starting cluster is attacked by monomers sequentially to elongate the electronic structure of the system by solving in each step a limited space including the terminal (localized molecular orbitals at the terminal) and monomer. The ELG-finite field (ELG-FF) method for calculating (hyper-)polarizabilities was used as the engine program of the optimization method, and it was found to show linear scaling efficiency while maintaining high computational accuracy for a random sequenced DNA model. Furthermore, the self-consistent field convergence was significantly improved by using the ELG-FF method compared with a conventional method, and it can lead to more feasible NLO property values in the FF treatment. The automated optimization method successfully chose an appropriate base pair from four base pairs (A, T, G, and C) for each elongation step according to an evaluation function. From test optimizations for the first order hyper-polarizability (β) in DNA, a substantial difference was observed depending on optimization conditions between “choose-maximum” (choose a base pair giving the maximum β for each step) and “choose-minimum” (choose a base pair giving the minimum β). In contrast, there was an ambiguous difference between these conditions for optimizing the second order hyper-polarizability (γ) because of the small absolute value of γ and the limitation of numerical differential calculations in the FF method. It can be concluded that the ab initio level property optimization method introduced here can be an effective step towards an advanced computer aided material design method as long as the numerical limitation of the FF method is taken into account.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗