Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Stochastic 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

Release a public version of HERON (HERON 2.0) with improved algorithms for the treatment of energy storage

Integrated energy systems (IESs) are essential for decarbonizing electricity and industrial sectors and fully exploiting these systems requires sophisticated planning, scheduling, and dispatching tools to maximize their socio-economic benefits. The Holistic Energy Resource Optimization Network (HERON) is a generic software plugin for the Risk Analysis Virtual Environment (RAVEN) to perform stochastic technoeconomic analysis of IES with economic drivers. This report summarizes the updates made to HERON 2.0. Particularly, we demonstrate one of the added features, Function-based Control Mechanics, by comparing a price-based dispatch strategy with the original perfect foresight baselines. Our case studies successfully demonstrate that the model is capable to incorporate artificial control algorithm into the dispatch of IES components. In addition, our results from the price-based strategy indicate that the control strategies of IES components are key to the economic and temporal performance of our model; therefore, more sophisticated dispatch strategies are required to improve the model performance.

25 ENERGY STORAGE↗

Contextual Active Online Model Selection with Expert Advice

How can we collect the most useful labels to learn a model selection policy, when presented with arbitrary heterogeneous data streams? In this paper, we formulate this task as a contextual active model selection problem, where at each round the learner receives an unlabeled data point along with a context. The goal is to output the best model for any given context without obtaining an excessive amount of labels. In particular, we focus on the task of selecting pre-trained classifiers, and propose a contextual active model selection algorithm (CAMS), which relies on a novel uncertainty sampling query criterion defined on a given policy class for adaptive model selection. In comparison to prior art, our algorithm does not assume a globally optimal model. We provide rigorous theoretical analysis for the regret and query complexity under both adversarial and stochastic settings. Our experiments on several benchmark classification datasets demonstrate the algorithm’s effectiveness in terms of both regret and query complexity. Notably, to achieve the same accuracy, CAMS incurs less than 10% of the label cost when compared to the best online model selection baselines on CIFAR10.

Liu, Xuefeng↗

Risk-Averse Bi-Level Stochastic Network Interdiction Model for Cyber-Security Risk Management

Security of cyber networks is crucial; recent severe cyber-attacks have had a devastating effect on many large organizations. The attack graph, which maps the potential attack paths of a cyber network, is a popular tool for analyzing cyber system vulnerability. In this study, we propose a bi-level stochastic network interdiction model on an attack graph to enable a risk-averse, resource constrained cyber network defender to optimally deploy security countermeasures that protect against attackers with an uncertain budget. This risk- averse conditional-value-at-risk (CVaR) model minimizes a weighted sum of the expected maximum loss over all scenarios and the expected maximum loss from the most damaging attack scenarios. We develop a customized constraint and column generation algorithm to solve our model as well as several acceleration techniques to improve the computational efficiency. Numerical experiments demonstrate that the acceleration techniques enable the solution of relatively large problems within a reasonable amount of time: applying all the acceleration techniques also reduces the average computation time of the basic algorithm by 71% for 100-node graphs. Using metrics called mean-risk value of stochastic solution and value of risk-aversion, computational results suggest that our stochastic risk-averse model significantly outperforms deterministic and risk-neutral models when 1) the distribution of attacker budget is heavy-right-tailed and 2) the defender is highly risk-averse.

Bhuiyan, Tanveer H.↗

Evaluating the Effects of Missing Values and Mixed Data Types on Social Sequence Clustering Using t-SNE Visualization

© 2019 Association for Computing Machinery. The goal of this work is to investigate the impact of missing values in clustering joint categorical social sequences. Identifying patterns in sociodemographic longitudinal data is important in a number of social science settings. However, performing analytical operations, such as clustering on life course trajectories, is challenging due to the categorical and multidimensional nature of the data, their mixed data types, and corruption by missing and inconsistent values. Data quality issues were investigated previously on single variable sequences. To understand their effects on multivariate sequence analysis, we employ a dataset of mixed data types and missing values, a dissimilarity measure designed for joint categorical sequence data, together with dimensionality reduction methodologies in a systematic design of sequence clustering experiments. Given the categorical nature of our data, we employ an “edit” distance using optimal matching. Because each data record has multiple variables of different types, we investigate the impact of mixing these variables in a single dissimilarity measure. Between variables with binary values and those with multiple nominal values, we find that the ability to overcome missing data problems is more difficult in the nominal domain than in the binary domain. Additionally, alignment of leading missing values can result in systematic biases in dissimilarity matrices and subsequently introduce both artificial clusters and unrealistic interpretations of associated data domains. We demonstrate the usage of t-distributed stochastic neighborhood embedding to visually guide mitigation of such biases by tuning the missing value substitution cost parameter or determining an optimal sequence span.

Lazar, Alina↗

Some Issues in Uncertainty Quantification and Parameter Tuning: A Case Study of Convective Parameterization Scheme in the WRF Regional Climate Model

The current tuning process of parameters in global climate models is often performed subjectively, or treated as an optimization procedure to minimize the difference between model fields and observations. The later approach may be generating a set of tunable parameters that approximate the observed climate but via an unrealistic balance of physical processes and/or compensating errors over different regions in the globe. In this study, we run the Weather Research and Forecasting (WRF) regional model constrained by the reanalysis data over the Southern Great Plains (SGP) where abundant observational data from various resources are available for calibration of the input parameters and validation of the model results. Our goal is to quantify the uncertainty ranges and identify the optimal values of five key input parameters in a new Kain-Frisch (KF) convective parameterization scheme incorporated in the WRF model. A stochastic sampling algorithm, Multiple Very Fast Simulated Annealing (MVFSA), is employed to efficiently sample the input parameters in KF scheme based on the skill score so that the algorithm progressively moves toward regions of the parameter space that minimize model errors. The results based on the WRF simulations with 25-km grid spacing over the SGP show that the model bias for precipitation can be significantly reduced by using five optimal parameters identified by the MVFSA algorithm. The model performance is very sensitive to downdraft and entrainment related parameters and consumption time of Convective Available Potential Energy (CAPE). Simulated convective precipitation decreases as the ratio of downdraft to updraft flux increases. Larger CAPE consumption time results in less convective but more stratiform precipitation. The simulation using optimal parameters obtained by only constraining precipitation generates positive impact on the other output variables, such as temperature and wind. By using the optimal parameters obtained at 25 km simulation, both the magnitude and spatial pattern of simulated precipitation are improved at 12-km spatial resolution. The optimal parameters identified from the SGP region have also improved the simulation of precipitation when moving model domain to another region with a different climate regime (i.e. North America monsoon region). These results suggest the improvement of precipitation simulation by using the optimal parameters remains when the model domain or spatial resolution is changed.

54 ENVIRONMENTAL SCIENCES↗

Shape Stability of Truncated Octahedral fcc Metal Nanocrystals

Metallic nanocrystals (NCs) can be synthesized with tailored nonequilibrium shapes to enhance desired properties, e.g., octahedral fcc metal NCs optimize catalytic activity associated with {111} facets. However, maintenance of optimized properties requires stability against thermal reshaping. Thus, we analyze the reshaping of truncated fcc metal octahedra mediated by surface diffusion using a stochastic atomistic-level model with energetic input parameters for Pd. Furthermore, the model describes NC thermodynamics by an effective nearest-neighbor interaction and includes a realistic treatment of diffusive hopping for undercoordinated surface atoms. Kinetic Monte Carlo simulation reveals that the effective barrier, E eff , for the initial stage of reshaping is strongly tied to the degree of truncation of the vertices in the synthesized initial octahedral shapes. This feature is elucidated via exact analytic determination of the energy variation along the optimal reshaping pathway at low-temperature (T), which involves transfer of atoms from truncated {100} vertex facets to form new layers on {111} side facets. Deviations from predictions of the low-T analysis due to entropic effects are more prominent for higher T and larger NC sizes.

36 MATERIALS SCIENCE↗

Residuals-based distributionally robust optimization with covariate information

We consider data-driven approaches that integrate a machine learning prediction model within distributionally robust optimization (DRO) given limited joint observations of uncertain parameters and covariates. Our framework is flexible in the sense that it can accommodate a variety of regression setups and DRO ambiguity sets. We investigate asymptotic and finite sample properties of solutions obtained using Wasserstein, sample robust optimization, and phi-divergence-based ambiguity sets within our DRO formulations, and explore cross-validation approaches for sizing these ambiguity sets. Through numerical experiments, we validate our theoretical results, study the effectiveness of our approaches for sizing ambiguity sets, and illustrate the benefits of our DRO formulations in the limited data regime even when the prediction model is misspecified.

97 MATHEMATICS AND COMPUTING↗

Stochastic Pricing Game for Aggregated Demand Response Considering Comfort Level

In recent years, demand response (DR) has been explored as a fundamental strategy for demand-side management due to its advantages in mediating intermittency of renewable energy generation, load shifting, etc. To engage customers in DR programs, several deterministic price-based DR strategies have been developed and implemented. However, the stochastic weather conditions and occupants' consumption behaviors often make the deterministic solution less robust to uncertainties. In this paper, with the consideration of the uncertainties, a stochastic Stackelberg game is proposed to model the price-demand negotiation between a distributed system operator and load aggregators, where the virtual battery constraints are extracted from the building thermostatically controlled loads (TCLs)‘ characteristics to guarantee comfortable TCLs' levels. Following the negotiation, a priority-based control method is used to allocate the optimal aggregated power DR profile at the building level and track the power signal. Several groups of experiments have demonstrated the effectiveness and robustness of the stochastic solutions.

Chen, Yang↗

A robust bi-orthogonal/dynamically-orthogonal method using the covariance pseudo-inverse with application to stochastic flow problems

We develop a new robust methodology for the stochastic Navier–Stokes equations based on the dynamically-orthogonal (DO) and bi-orthogonal (BO) methods . Both approaches are variants of a generalized Karhunen–Loève (KL) expansion in which both the stochastic coefficients and the spatial basis evolve according to system dynamics, hence, capturing the low-dimensional structure of the solution. The DO and BO formulations are mathematically equivalent , but they exhibit computationally complimentary properties. Specifically, the BO formulation may fail due to crossing of the eigenvalues of the covariance matrix, while both BO and DO become unstable when there is a high condition number of the covariance matrix or zero eigenvalues. To this end, we combine the two methods into a robust hybrid framework and in addition we employ a pseudo-inverse technique to invert the covariance matrix. The robustness of the proposed method stems from addressing the following issues in the DO/BO formulation: (i) eigenvalue crossing: we resolve the issue of eigenvalue crossing in the BO formulation by switching to the DO near eigenvalue crossing using the equivalence theorem and switching back to BO when the distance between eigenvalues is larger than a threshold value; (ii) ill-conditioned covariance matrix: we utilize a pseudo-inverse strategy to invert the covariance matrix; (iii) adaptivity: we utilize an adaptive strategy to add/remove modes to resolve the covariance matrix up to a threshold value. In particular, we introduce a soft-threshold criterion to allow the system to adapt to the newly added/removed mode and therefore avoid repetitive and unnecessary mode addition/removal. When the total variance approaches zero, we show that the DO/BO formulation becomes equivalent to the evolution equation of the Optimally Time-Dependent modes . We demonstrate the capability of the proposed methodology with several numerical examples, namely (i) stochastic Burgers equation: we analyze the performance of the method in the presence of eigenvalue crossing and zero eigenvalues; (ii) stochastic Kovasznay flow: we examine the method in the presence of a singular covariance matrix; and (iii) we examine the adaptivity of the method for an incompressible flow over a cylinder where for large stochastic forcing thirteen DO/BO modes are active.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Data-Driven Unit Commitment Refinement - a Scalable Approach for Complex Modern Power Grids

Integration of renewable generation, which is often intermittent and decentralized, substantially increases the stochasticity and complexity of power grid operations. Future power systems planning will require significant computational capability to evaluate balance between demand and supply under varying conditions, both temporally and spatially. The standard approach for generation unit commitment is to use mixed-integer linear programming to find the optimal generation schedule considering ramping and generator constraints. In the future grid this poses computational scalability challenges because generation and demand are not known with certainty due to stochasticity in weather and complexity of the grid. To address this challenge, we present a data-driven unit commitment approach that can efficiently include stochastic weather impacts and contingency considerations to improve unit commitment. Our approach uses graph-based data analytics techniques on solutions to the security constrained (and possibly stochastic) economic dispatch problem to identify potential improvements to a given unit commitment. Recent breakthroughs in fully-parallel stochastic economic dispatch software allow this approach to be scalably deployed. Simulations on synthetic South Carolina and Texas grids show this method can improve grid reliability with security constraints over a set of contingencies, while also meaningfully lowering total generation cost.

Holt, Timothy↗

Selection of polynomial chaos bases via Bayesian model uncertainty methods with applications to sparse approximation of PDEs with stochastic inputs

Generalized polynomial chaos (gPC) expansions allow us to represent the solution of a stochastic system using a series of polynomial chaos basis functions. The number of gPC terms increases dramatically as the dimension of the random input variables increases. When the number of the gPC terms is larger than that of the available samples, a scenario that often occurs when the corresponding deterministic solver is computationally expensive, evaluation of the gPC expansion can be inaccurate due to over-fitting. We propose a fully Bayesian approach that allows for global recovery of the stochastic solutions, in both spatial and random domains, by coupling Bayesian model uncertainty and regularization regression methods. It allows the evaluation of the PC coefficients on a grid of spatial points, via (1) the Bayesian model average (BMA) or (2) the median probability model, and their construction as spatial functions on the spatial domain via spline interpolation. The former accounts for the model uncertainty and provides Bayes-optimal predictions; while the latter provides a sparse representation of the stochastic solutions by evaluating the expansion on a subset of dominating gPC bases. Moreover, the proposed methods quantify the importance of the gPC bases in the probabilistic sense through inclusion probabilities. We design a Markov chain Monte Carlo (MCMC) sampler that evaluates all the unknown quantities without the need of ad-hoc techniques. The proposed methods are suitable for, but not restricted to, problems whose stochastic solutions are sparse in the stochastic space with respect to the gPC bases while the deterministic solver involved is expensive. We demonstrate the accuracy and performance of the proposed methods and make comparisons with other approaches on solving elliptic SPDEs with 1-, 14- and 40-random dimensions.

97 MATHEMATICS AND COMPUTING↗

Probing the anisotropies of a stochastic gravitational-wave background using a network of ground-based laser interferometers

We present a maximum-likelihood analysis for estimating the angular distribution of power in an anisotropic stochastic gravitational-wave background using ground-based laser interferometers. The standard isotropic and gravitational-wave radiometer searches (optimal for point sources) are recovered as special limiting cases. The angular distribution can be decomposed with respect to any set of basis functions on the sky, and the single-baseline, cross-correlation analysis is easily extended to a network of three or more detectors--that is, to multiple baselines. A spherical-harmonic decomposition, which provides maximum-likelihood estimates of the multipole moments of the gravitational-wave sky, is described in detail. We also discuss (i) the covariance matrix of the estimators and its relationship to the detector response of a network of interferometers, (ii) a singular-value decomposition method for regularizing the deconvolution of the detector response from the measured sky map, (iii) the expected increase in sensitivity obtained by including multiple baselines, and (iv) the numerical results of this method when applied to simulated data consisting of both pointlike and diffuse sources. Comparisons between this general method and the standard isotropic and radiometer searches are given throughout, to make contact with the existing literature on stochastic background searches.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

An adjoint method for determining the sensitivity of island size to magnetic field variations

An adjoint method to calculate the gradient of island width in stellarators is presented and applied to a set of magnetic field configurations. The underlying method for calculation of the island width is that of Cary & Hanson ( Phys. Fluids B, vol. 3, issue 4, 1991, pp. 1006–1014) (with a minor modification), and requires that the residue of the island centre be small. Therefore, the gradient of the residue is calculated in addition. Both the island width and the gradient calculations are verified using an analytical magnetic field configuration introduced by Reiman & Greenside ( Comput. Phys. Commun. , vol. 43, issue 1, 1986, pp. 157–167). The method is also applied to the calculation of the shape gradient of the width of a magnetic island in a National Compact Stellarator Experiment (NCSX) vacuum configuration with respect to positions on a coil. A gradient-based optimization is applied to a magnetic field configuration studied by Hanson & Cary ( Phys. Fluids , vol. 27, issue 4, 1984, pp. 767–769) to minimize stochasticity by adding perturbations to a pair of helical coils. Although only vacuum magnetic fields and an analytical magnetic field model are considered in this work, the adjoint calculation of the island width gradient could also be applied to a magnetohydrodynamic (MHD) equilibrium if the derivative of the magnetic field, with respect to the equilibrium parameters, is known. Using the island width gradient calculation presented here, more general gradient-based optimization methods can be applied to design stellarators with small magnetic islands. Moreover, the sensitivity of the island size may itself be optimized to ensure that coil tolerances, with respect to island size, are kept as high as possible.

Physics↗

Mean-Variance Hedging on Uncertain Time Horizon in a Market with a Jump

In this work, we study the problem of mean-variance hedging with a random horizon T∧τ, where T is a deterministic constant and τ is a jump time of the underlying asset price process. We first formulate this problem as a stochastic control problem and relate it to a system of BSDEs with a jump. We then provide a verification theorem which gives the optimal strategy for the mean-variance hedging using the solution of the previous system of BSDEs. Finally, we prove that this system of BSDEs admits a solution via a decomposition approach coming from filtration enlargement theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stochastic Predictions of Cell Kill During Stereotactic Ablative Radiation Therapy: Do Hypoxia and Reoxygenation Really Matter?

Purpose: To simulate stereotactic ablative radiation therapy on hypoxic and well-oxygenated in silico tumors, incorporating probabilistic parameter distributions and linear-quadratic versus linear-quadratic-cubic methodology and the evaluation of optimal fractionation schemes using biological effective dose (BED{sub α/β=10} {sub or} {sub 3}) comparisons. Methods and Materials: A temporal tumor growth and radiation therapy algorithm simulated high-dose external beam radiation therapy using stochastic methods. Realistic biological proliferative cellular hierarchy and pO{sub 2} histograms were incorporated into the 10{sup 8}-cell tumor model, with randomized radiation therapy applied during continual cell proliferation and volume-based gradual tumor reoxygenation. Dose fractions ranged from 6-35 Gy, with predictive outcomes presented in terms of the total doses (converted to BED) required to eliminate all cells that could potentially regenerate the tumor. Results: Well-oxygenated tumor control BED{sub 10} outcomes were not significantly different for high-dose versus conventional radiation therapy (BED{sub 10}: 79-84 Gy; Equivalent Dose in 2 Gy fractions with α/β of 10: 66-70 Gy); however, total treatment times decreased from 7 down to 1-3 weeks. For hypoxic tumors, an additional 28 Gy (51 Gy BED{sub 10}) was required, with BED{sub 10} increasing with dose per fraction due to wasted dose in the final fraction. Fractions of 9 Gy compromised well for total treatment time and BED, with BED{sub 10}:BED{sub 3} of 84:176 Gy for oxic and 132:278 Gy for non-reoxygenating hypoxic tumors. Initial doses of 12 Gy followed by 6 Gy further increased the therapeutic ratio. When delivering ≥9 Gy per fraction, applying reoxygenation and/or linear-quadratic-cubic cell survival both affected tumor control doses by a significant 1-2 fractions. Conclusions: The complex temporal dynamics of tumor oxygenation combined with probabilistic cell kinetics in the modeling of radiation therapy requires sophisticated stochastic modeling to predict tumor cell kill. For stereotactic ablative radiation therapy, high doses in the first week followed by doses that are more moderate may be beneficial because a high percentage of hypoxic cells could be eradicated early while keeping the required BED{sub 10} relatively low and BED{sub 3} toxicity to tolerable levels.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

L{sup 2}-approximating Pricing under Restricted Information

We consider the mean-variance hedging problem under partial information in the case where the flow of observable events does not contain the full information on the underlying asset price process. We introduce a certain type martingale equation and characterize the optimal strategy in terms of the solution of this equation. We give relations between this equation and backward stochastic differential equations for the value process of the problem.

97 MATHEMATICS AND COMPUTING↗

AlignOT: An Optimal Transport Based Algorithm for Fast 3D Alignment With Applications to Cryogenic Electron Microscopy Density Maps

Aligning electron density maps from Cryogenic electron microscopy (cryo-EM) is a first key step for studying multiple conformations of a biomolecule. As this step remains costly and challenging, with standard alignment tools being potentially stuck in local minima, we propose here a new procedure, called AlignOT, which relies on the use of computational optimal transport (OT) to align EM maps in 3D space. By embedding a fast estimation of OT maps within a stochastic gradient descent algorithm, our method searches for a rotation that minimizes the Wasserstein distance between two maps, represented as point clouds. Here, we quantify the impact of various parameters on the precision and accuracy of the alignment, and show that AlignOT can outperform the standard local alignment methods, with an increased range of rotation angles leading to proper alignment. We further benchmark AlignOT on various pairs of experimental maps, which account for different types of conformational heterogeneities and geometric properties. As our experiments show good performance, we anticipate that our method can be broadly applied to align 3D EM maps.

3D alignment↗

Interpretation of borehole strain measurements using surrogate modeling-based optimization

Interpreting strain data measured during well testing requires inverting poroelastic forward models set up to represent an aquifer or reservoir. One approach is to use stochastic methods to conduct the inversion. Subsurface parameters such as elastic modulus, permeability, and geometry of heterogeneities are estimated by searching the parameter space. This is feasible, but cumbersome, requiring more than a week of computation using many hundreds of computer nodes in one of our earlier analyses. This motivated us to consider alternative methods, including an artificial neural network (ANN) as a surrogate model.

Roudini, Soheil↗