Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Binary 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 145 records · Page 8

Global Positioning System (GPS) Precipitable Water in Forecasting Lightning at Spaceport Canaveral

This paper evaluates the use of precipitable water (PW) from Global Positioning System (GPS) in lightning prediction. Additional independent verification of an earlier model is performed. This earlier model used binary logistic regression with the following four predictor variables optimally selected from a candidate list of 23 candidate predictors: the current precipitable water value for a given time of the day, the change in GPS-PW over the past 9 hours, the KIndex, and the electric field mill value. This earlier model was not optimized for any specific forecast interval, but showed promise for 6 hour and 1.5 hour forecasts. Two new models were developed and verified. These new models were optimized for two operationally significant forecast intervals. The first model was optimized for the 0.5 hour lightning advisories issued by the 45th Weather Squadron. An additional 1.5 hours was allowed for sensor dwell, communication, calculation, analysis, and advisory decision by the forecaster. Therefore the 0.5 hour advisory model became a 2 hour forecast model for lightning within the 45th Weather Squadron advisory areas. The second model was optimized for major ground processing operations supported by the 45th Weather Squadron, which can require lightning forecasts with a lead-time of up to 7.5 hours. Using the same 1.5 lag as in the other new model, this became a 9 hour forecast model for lightning within 37 km (20 NM)) of the 45th Weather Squadron advisory areas. The two new models were built using binary logistic regression from a list of 26 candidate predictor variables: the current GPS-PW value, the change of GPS-PW over 0.5 hour increments from 0.5 to 12 hours, and the K-index. The new 2 hour model found the following for predictors to be statistically significant, listed in decreasing order of contribution to the forecast: the 0.5 hour change in GPS-PW, the 7.5 hour change in GPS-PW, the current GPS-PW value, and the KIndex. The new 9 hour forecast model found the following five independent variables to be statistically significant, listed in decreasing order of contribution to the forecast: the current GPSPW value, the 8.5 hour change in GPS-PW, the 3.5 hour change in GPS-PW, the 12 hour change in GPS-PW, and the K-Index. In both models, the GPS-PW parameters had better correlation to the lightning forecast than the K-Index, a widely used thunderstorm index. Possible future improvements to this study are discussed.

Kehrer, Kristen C.↗

Open-air spray deposition of PCBM/BCP electron transport layer for inverted perovskite solar cells

A [6,6]-phenyl C61 butyric acid methyl ester (PCBM) and bathocuproine (BCP) electron transport layer (ETL) is spray deposited in open air directly on top of a perovskite at linear speeds of 9 m/min. The PCBM precursor ink contains a binary mixture of 1:1 chlorobenzene:chloroform, which optimizes spray wettability on the perovskite surface and allows quick solvent evaporation. A near-infrared heating module additionally provides a flash cure (<5 s) for the formation of smooth, large-area PCBM films (∼20 cm 2 ). A BCP solution in isopropanol is subsequently sprayed to form an ultrathin (<5 nm) film and characterized with a suite of high-resolution metrologies. The spray-deposition processing and near-infrared treatment do not damage the underlying perovskite. Inverted architecture devices containing the sprayed ETL achieve a champion efficiency of 20.3% and demonstrate stable performance without additional interlayers or surface treatments. Here, the technoeconomic cost of the open-air spray process is compared against traditional vacuum-based evaporation, resulting in a decrease in manufacturing costs by 26%.

14 SOLAR ENERGY↗

Algorithmic problems of nontransitive (SSB) utilities

The standard utility theory is based on several natural axioms including transitivity of preference; however, real preference is often not transitive. To describe such preferences, Fishburn (1988) introduced a new formalism (SSB-utilities), in which preference is described by a skew-symmetric function F:M x M - R, where M is the set of all alternatives. He also showed that it is in principle possible to reconstruct this function F by asking the person to compare different alternatives and lotteries. In the present paper we propose a new algorithm for reconstructing F that is asymptotically optimal in the sense that the number of binary (yes-no) questions that one has to ask to determine the values of F with given precision is of minimal possible order.

Kosheleva, O. M.↗

Searches for millisecond pulsations in low-mass X-ray binaries

High-sensitivity search techniques for millisecond periods are presented and applied to data from the Japanese satellite Ginga and HEAO 1. The search is optimized for pulsed signals whose period, drift rate, and amplitude conform with what is expected for low-class X-ray binary (LMXB) sources. Consideration is given to how the current understanding of LMXBs guides the search strategy and sets these parameter limits. An optimized one-parameter coherence recovery technique (CRT) developed for recovery of phase coherence is presented. This technique provides a large increase in sensitivity over the method of incoherent summation of Fourier power spectra. The range of spin periods expected from LMXB phenomenology is discussed, the necessary constraints on the application of CRT are described in terms of integration time and orbital parameters, and the residual power unrecovered by the quadratic approximation for realistic cases is estimated.

Wood, K. S.↗

Bell-Curve Based Evolutionary Strategies for Structural Optimization

Evolutionary methods are exceedingly popular with practitioners of many fields; more so than perhaps any optimization tool in existence. Historically Genetic Algorithms (GAs) led the way in practitioner popularity. However, in the last ten years Evolutionary Strategies (ESs) and Evolutionary Programs (EPS) have gained a significant foothold. One partial explanation for this shift is the interest in using GAs to solve continuous optimization problems. The typical GA relies upon a cumbersome binary representation of the design variables. An ES or EP, however, works directly with the real-valued design variables. For detailed references on evolutionary methods in general and ES or EP in specific see Back and Dasgupta and Michalesicz. We call our evolutionary algorithm BCB (bell curve based) since it is based upon two normal distributions.

Kincaid, Rex K.↗

Optimizing a continuously variable filter in a hybrid optical correlator

In contrast to binary filters, continuously variable optical filters offer an ability to conpensate for certain imperfections in the optics of a hybrid correlator. Arbitrary static phase errors are introduced into a model of a phase-only filtering hybrid correlator, and a method of discovering a correction for them simulated. By a recursive technique a first approximation to the impulse's matched filter is adjusted (allowed to relax) so as to produce successively more localized distribution of the output in the correlation plane. The method is motivated by the development of continuously-variable phase-only spatial light modulators, but it is applicable to amplitude modulators and -with appropriate modification -- to binary modulators as well. The technique is robust against the form of the system's departure from ideal behavior.

Juday, Richard D.↗

BitGNN: Unlocking the Performance Potential of Binary Graph Neural Networks on GPUs

Graph Neural Networks (GNNs) have shown compelling results in many graph-based learning tasks. They are, however, time-consuming. Recent work has shown a promising direction in improving GNN speed and shrinking the size — network binarization, which binarizes network values and operations. Prior work, however, mainly focused on algorithm designs, leaving it open on how to fully materialize the performance potential. This work fills the gap by proposing techniques to best map binary GNNs and their computations to fit the nature of bit manipulations, optimizations and algorithms to maximize BSpMM kernel efficiency, and solutions to other factors influencing the end-to-end time on GPUs. Results on real-world graphs show that the proposed techniques outperform state of-the-art binary GNN implementations by 21-67× with little accuracy loss.

Chen, Jou-An↗

Greedy permanent magnet optimization

Abstract A number of scientific fields rely on placing permanent magnets in order to produce a desired magnetic field. We have shown in recent work that the placement process can be formulated as sparse regression. However, binary, grid-aligned solutions are desired for realistic engineering designs. We now show that the binary permanent magnet problem can be formulated as a quadratic program with quadratic equality constraints, the binary, grid-aligned problem is equivalent to the quadratic knapsack problem with multiple knapsack constraints, and the single-orientation-only problem is equivalent to the unconstrained quadratic binary problem. We then provide a set of simple greedy algorithms for solving variants of permanent magnet optimization, and demonstrate their capabilities by designing magnets for stellarator plasmas. The algorithms can a-priori produce sparse, grid-aligned, binary solutions. Despite its simple design and greedy nature, we provide an algorithm that compares with or even outperforms the state-of-the-art algorithms while being substantially faster, more flexible, and easier to use.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Ligand Many-Body Expansion as a General Approach for Accelerating Transition Metal Complex Discovery

Methods that accelerate the evaluation of molecular properties are essential for chemical discovery. While some degree of ligand additivity has been established for transition metal complexes, it is underutilized in asymmetric complexes, such as the square pyramidal coordination geometries highly relevant to catalysis. To develop predictive methods beyond simple additivity, we apply a many-body expansion to octahedral and square pyramidal complexes and introduce a correction based on adjacent ligands (i.e., the cis interaction model). We first test the cis interaction model on adiabatic spin-splitting energies of octahedral Fe(II) complexes, predicting DFT-calculated values of unseen binary complexes to within an average of 1.4 kcal/mol. Uncertainty analysis reveals the optimal basis, comprising the homoleptic and mer symmetric complexes. We next show that the cis model (i.e., the cis interaction model solved for the optimal basis) infers both DFT- and CCSD(T)-calculated model catalytic reaction energies to within 1 kcal/mol on average. The cis model predicts low-symmetry complexes with reaction energies outside the range of binary complex reaction energies. We observe that trans interactions are unnecessary for most monodentate systems but can be important for some combinations of ligands, such as complexes containing a mixture of bidentate and monodentate ligands. Lastly, we demonstrate that the cis model may be combined with Δ-learning to predict CCSD(T) reaction energies from exhaustively calculated DFT reaction energies and the same fraction of CCSD(T) reaction energies needed for the cis model, achieving around 30% of the error from using the CCSD(T) reaction energies in the cis model alone.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A comparative analysis of static and dynamic load balancing strategies

The problem of uniformly distributing the load of a parallel program over a multiprocessor system was considered. A program was analyzed whose structure permits the computation of the optimal static solution. Then four strategies for load balancing were described and their performance compared. The strategies are: (1) the optimal static assignment algorithm which is guaranteed to yield the best static solution, (2) the static binary dissection method which is very fast but suboptimal, (3) the greedy algorithm, a static fully polynomial time approximation scheme, which estimates the optimal solution to arbitrary accuracy, and (4) the predictive dynamic load balancing heuristic which uses information on the precedence relationships within the program and outperforms any of the static methods. It is also shown that the overhead incurred by the dynamic heuristic is reduced considerably if it is started off with a static assignment provided by either of the three strategies.

Iqbal, M. Ashraf↗

Optimization Framework to Assess the Demand Response Capacity of a Water Distribution System

As large electricity consumers, water distribution system (WDS) pumping stations have the potential to become meaningful participants in demand response (DR) programs. The authors propose an optimization framework for assessing the DR capacity of a WDS and identifying the optimal bidding strategy for maximizing WDS revenue in the DR spot market. The proposed mixed integer linear programming (MILP) model overcomes computational constraints of previous DR optimization models by adopting a preprocessing procedure to minimize the number of binary variables and implementing a convex relaxation technique to linearize the hydraulic equations. The proposed MILP model also explicitly accounts for varying levels of risk tolerance of WDS operators by varying the recovery period over which pumping returns to business-as-usual operation. The optimization framework is implemented on a skeletonized 48-node WDS model that includes 7 pumps, 6 tanks, and 39 pipes. Using a simulated DR event and water consumption profile, the authors derive the optimal DR supply curves (i.e., compensation price versus load curtailment quantity) and revenue potential of the WDS under six scenarios for DR participation.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Modeling the AC Power Flow Equations with Optimally Compact Neural Networks: Application to Unit Commitment

Nonlinear power flow constraints render a variety of power system optimization problems computationally intractable. Emerging research shows, however, that the nonlinear AC power flow equations can be successfully modeled using neural networks. These neural networks can be exactly transformed into mixed integer linear programs and embedded inside challenging optimization problems, thus replacing nonlinearities that are intractable for many applications with tractable piecewise linear approximations. Such approaches, though, suffer from an explosion of the number of binary variables needed to represent the neural network. Accordingly, this paper develops a technique for training an "optimally compact'' neural network, i.e., one that can represent the power flow equations with a sufficiently high degree of accuracy while still maintaining a tractable number of binary variables. We demonstrate the use of this neural network as an approximator of the nonlinear power flow equations by embedding it in the AC unit commitment problem, transforming the problem from a mixed integer nonlinear program into a more manageable mixed integer linear program. We use the 14-, 57-, and 89-bus networks as test cases and compare the AC-feasibility of commitment decisions resulting from the neural network, DC, and linearized power flow approximations. Our results show that the neural network model outperforms both the DC and linearized power flow approximations when embedded in the unit commitment problem. The neural network formulation most often selects a feasible unit commitment schedule, and furthermore, it only s

AC power flow↗

Efficient machine-learning model for fast assessment of elastic properties of high-entropy alloys

We combined descriptor-based analytical models for stiffness-matrix and elastic-moduli with mean-field methods to accelerate assessment of technologically useful properties of high-entropy alloys, such as strength and ductility. Model training for elastic properties uses Sure-Independence Screening (SIS) and Sparsifying Operator (SO) method yielding an optimal analytical model, constructed with meaningful atomic features to predict target properties. Computationally inexpensive analytical descriptors were trained using a database of elastic properties determined from density functional theory for binary and ternary subsets of Nb-Mo-Ta-W-V refractory alloys. The optimal Elastic-SISSO models, extracted from an exponentially large feature space, give an extremely accurate prediction of target properties, similar to or better than other models, with some verified from existing experiments. Here we also show that electronegativity variance and elastic-moduli can directly predict trends in ductility and yield strength of refractory HEAs, and reveals promising alloy concentration regions.

36 MATERIALS SCIENCE↗

Halogenated Dibenzo[ f , h ]quinoxaline Units Constructed 2D‐Conjugated Guest Acceptors for 19% Efficiency Organic Solar Cells

Abstract Halogenation of Y‐series small‐molecule acceptors (Y‐SMAs) is identified as an effective strategy to optimize photoelectric properties for achieving improved power‐conversion‐efficiencies (PCEs) in binary organic solar cells (OSCs). However, the effect of different halogenation in the 2D‐structured large π‐fused core of guest Y‐SMAs on ternary OSCs has not yet been systematically studied. Herein, four 2D‐conjugated Y‐SMAs (X‐QTP‐4F, including halogen‐free H‐QTP‐4F, chlorinated Cl‐QTP‐4F, brominated Br‐QTP‐4F, and iodinated I‐QTP‐4F) by attaching different halogens into 2D‐conjugation extended dibenzo[ f , h ]quinoxaline core are developed. Among these X‐QTP‐4F, Cl‐QTP‐4F has a higher absorption coefficient, optimized molecular crystallinity and packing, suitable cascade energy levels, and complementary absorption with PM6:L8‐BO host. Moreover, among ternary PM6:L8‐BO:X‐QTP‐4F blends, PM6:L8‐BO:Cl‐QTP‐4F obtains a more uniform and size‐suitable fibrillary network morphology, improved molecular crystallinity and packing, as well as optimized vertical phase distribution, thus boosting charge generation, transport, extraction, and suppressing energy loss of OSCs. Consequently, the PM6:L8‐BO:Cl‐QTP‐4F‐based OSCs achieve a 19.0% efficiency, which is among the state‐of‐the‐art OSCs based on 2D‐conjugated Y‐SMAs and superior to these devices based on PM6:L8‐BO host (17.70%) and with guests of H‐QTP‐4F (18.23%), Br‐QTP‐4F (18.39%), and I‐QTP‐4F (17.62%). The work indicates that halogenation in 2D‐structured dibenzo[ f , h ]quinoxaline core of Y‐SMAs guests is a promising strategy to gain efficient ternary OSCs.

14 SOLAR ENERGY↗

A Difluoro‐Methoxylated Ending‐Group Asymmetric Small Molecule Acceptor Lead Efficient Binary Organic Photovoltaic Blend

Abstract Developing a new end group for synthesizing asymmetric small molecule acceptors (SMAs) is crucial for achieving high‐performance organic photovoltaics (OPVs). Herein, an asymmetric small molecule acceptor, BTP‐BO‐4FO, featuring a new difluoro‐methoxylated end‐group is reported. Compared to its symmetric counterpart L8‐BO, BTP‐BO‐4FO exhibits an upshifted energy level, larger dipole moment, and more sequential crystallinity. By adopting two representative and widely available solvent additives (1‐chloronaphthalene (CN) and 1,8‐diiodooctane (DIO)), the device based on PM6:BTP‐BO‐4FO (CN) photovoltaic blend demonstrates a power conversion efficiency (PCE) of 18.62% with an excellent open‐circuit voltage (V OC ) of 0.933 V, which surpasses the optimal result of L8‐BO. The PCE of 18.62% realizes the best efficiencies for binary OPVs based on SMAs with asymmetric end groups. A series of investigations reveal that optimized PM6:BTP‐BO‐4FO film demonstrates similar molecular packing motif and fibrillar phase distribution as PM6:L8‐BO (DIO) does, resulting in comparable recombination dynamics, thus, similar fill factor. Besides, it is found PM6:BTP‐BO‐4FO possesses more efficient charge generation, which yields betterV OC –J SC balance. This study provides a new ending group that enables a cutting‐edge efficiency in asymmetric SMA‐based OPVs, enriching the material library and shed light on further design ideas.

Chemistry↗

Screening binary alloys for electrochemical CO 2 reduction towards multi-carbon products

Electrochemical reduction of CO 2 (eCO 2 R) to high-value chemicals presents an attractive approach for utilizing CO 2 . Copper (Cu) is presently the only electrocatalyst that fulfills this purpose with notable activity, but selectivity remains a problem. To identify catalysts for eCO 2 R with high selectivity towards multicarbon (C 2(+) ) products, we explore binary systems composed of strongly and weakly CO binding metals alloyed with Cu, Fe, Co, Ni, and Pd. A total number of 142 alloys with two commonly studied configurations, L1 2 and L1 0 , are simulated with density functional theory (DFT). We leverage recent progress in the atomistic understanding of the eCO 2 R mechanism and use the binding energies of CO* and C* as descriptors when screening for C 2(+) selectivity. We evaluate the stability of the binary alloys by analyzing the formation energy of the clean alloy surfaces. Our theoretical screening identifies about 16 Cu-based alloys and 18 non-Cu based alloys with optimal C 2(+) selective properties for eCO 2 R. For the non-Cu based binary alloys, the p-block elements play an important role in tuning the C* and CO* adsorption energies. In terms of stability, most of the Cu-based systems alloyed with metals that exhibit strong CO* binding are unstable. Ni-based alloys are more stable than the Co-based alloys followed by the Fe-based alloys, and all the Pd-based alloys are stable. In general, the L1 0 structural Fe, Co, Ni, and Pd-based alloys are more stable than the corresponding L1 2 alloys. Our approach identifies materials known to have good C 2(+) selectivity, but it also proposes several other promising materials that have not previously been tested for eCO 2 R.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Fast decay of classification error in variational quantum circuits

Variational quantum circuits (VQCs) have shown great potential in near-term applications. However, the discriminative power of a VQC, in connection to its circuit architecture and depth, is not understood. To unleash the genuine discriminative power of a VQC, we propose a VQC system with the optimal classical post-processing—maximum-likelihood estimation on measuring all VQC output qubits. Via extensive numerical simulations, we find that the error of VQC quantum data classification typically decays exponentially with the circuit depth, when the VQC architecture is extensive—the number of gates does not shrink with the circuit depth. This fast error suppression ends at the saturation towards the ultimate Helstrom limit of quantum state discrimination. On the other hand, non-extensive VQCs such as quantum convolutional neural networks are sub-optimal and fail to achieve the Helstrom limit, demonstrating a trade-off between ansatz complexity and classification performance in general. To achieve the best performance for a given VQC, the optimal classical post-processing is crucial even for a binary classification problem. To simplify VQCs for near-term implementations, we find that utilizing the symmetry of the input properly can improve the performance, while oversimplification can lead to degradation.

Zhang, Bingzhi↗

Building Load Control Using Distributionally Robust Chance-Constrained Programs with Right-Hand Side Uncertainty and the Risk-Adjustable Variants

Aggregation of heating, ventilation, and air conditioning (HVAC) loads can provide reserves to absorb volatile renewable energy, especially solar photo-voltaic (PV) generation. In this paper, we decide HVAC control schedules under uncertain PV generation, using a distributionally robust chance-constrained (DRCC) building load control model under two typical ambiguity sets: the moment-based and Wasserstein ambiguity sets. We derive mixed integer linear programming (MILP) reformulations for DRCC problems under both sets. Especially, for the Wasserstein ambiguity set, we use the right-hand side (RHS) uncertainty to derive a more compact MILP reformulation than the commonly known MILP reformulations with big-M constants. All the results also apply to general individual chance constraints with RHS uncertainty. Furthermore, we propose an adjustable chance-constrained variant to achieve tradeoff between the operational risk and costs. We derive MILP reformulations under the Wasserstein ambiguity set and second-order conic programming (SOCP) reformulations under the moment-based set. Using real-world data, we conduct computational studies to demonstrate the efficiency of the solution approaches and the effectiveness of the solutions. Summary of Contribution: The problem studied in this paper is motivated by a building load control problem that uses the aggregation of heating, ventilation, and air conditioning (HVAC) loads as flexible reserves to absorb uncertain solar photovoltaic (PV) generation. The problem is formulated as distributionally robust chance-constrained (DRCC) programs with right-hand side (RHS) uncertainty. In addition, we propose a risk-adjustable variant of the DRCC programs, where the risk level, instead of being predetermined, is treated as a decision variable. The paper aims to provide tractable reformulations and solution algorithms for both the (general) DRCC and the (general) adjustable DRCC models with RHS uncertainty.

97 MATHEMATICS AND COMPUTING↗