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 1,189 records · Page 66

Learning Forecasts of Rare Stratospheric Transitions from Short Simulations

Abstract Rare events arising in nonlinear atmospheric dynamics remain hard to predict and attribute. We address the problem of forecasting rare events in a prototypical example, sudden stratospheric warmings (SSWs). Approximately once every other winter, the boreal stratospheric polar vortex rapidly breaks down, shifting midlatitude surface weather patterns for months. We focus on two key quantities of interest: the probability of an SSW occurring, and the expected lead time if it does occur, as functions of initial condition. These optimal forecasts concretely measure the event’s progress. Direct numerical simulation can estimate them in principle but is prohibitively expensive in practice: each rare event requires a long integration to observe, and the cost of each integration grows with model complexity. We describe an alternative approach using integrations that are short compared to the time scale of the warming event. We compute the probability and lead time efficiently by solving equations involving the transition operator, which encodes all information about the dynamics. We relate these optimal forecasts to a small number of interpretable physical variables, suggesting optimal measurements for forecasting. We illustrate the methodology on a prototype SSW model developed by Holton and Mass and modified by stochastic forcing. While highly idealized, this model captures the essential nonlinear dynamics of SSWs and exhibits the key forecasting challenge: the dramatic separation in time scales between a single event and the return time between successive events. Our methodology is designed to fully exploit high-dimensional data from models and observations, and has the potential to identify detailed predictors of many complex rare events in meteorology.

Finkel, Justin↗

Two-stage Stochastic Generalized Disjunctive Programming (GDP) Model for Proactive Planning and Reactive Operations of Resilient Power Systems under Disruptions

In this work, we propose a Generalized Disjunctive Programming (GDP) model that optimizes both long-term capacity planning (such as the number and size of dispatchable/renewable generators, batteries, and transmission lines) and hourly operation (such as on/off schedules of dispatchable generators, power output from each generator, and power flow) to maximize power system reliability while minimizing total cost and CO2 emissions.

Cho, Seolhee↗

Exit Presentation -- Maintaining Balance

This slide presentation reviews the projects which the author engaged in during an internship at Johnson Space Center. Project 1 was involved with Stochastic Resonance (SR). Stochastic resonance is a phenomenon in which the response of a non-linear system to a weak input signal is optimized by the presence of a particular non-zero level of noise. The goal of this project was to develop a countermeasure for sensorimotor disturbances that are experienced after long duration space flight. The second project was a pilot study that was to examine how adaptation to a novel functional task was affected by postural disturbance.

Heap, Erin↗

pyomo.dae: a modeling and automatic discretization framework for optimization with differential and algebraic equations

We describe pyomo.dae, an open source Python-based modeling framework that enables high-level abstract specification of optimization problems with differential and algebraic equations. The pyomo.dae framework is integrated with the Pyomo open source algebraic modeling language, and is available at http://www.pyomo.org. One key feature of pyomo.dae is that it does not restrict users to standard, predefined forms of differential equations, providing a high degree of modeling flexibility and the ability to express constraints that cannot be easily specified in other modeling frameworks. Other key features of pyomo.dae are the ability to specify optimization problems with high-order differential equations and partial differential equations, defined on restricted domain types, and the ability to automatically transform high-level abstract models into finite-dimensional algebraic problems that can be solved with off-the-shelf solvers. Moreover, pyomo.dae users can leverage existing capabilities of Pyomo to embed differential equation models within stochastic and integer programming models and mathematical programs with equilibrium constraint formulations. Collectively, these features enable the exploration of new modeling concepts, discretization schemes, and the benchmarking of state-of-the-art optimization solvers.

97 MATHEMATICS AND COMPUTING↗

Galerkin finite element method for time-fractional stochastic diffusion equations

In this paper, Galerkin finite element method for solving the time-fractional stochastic diffusion equations with multiplicative noise is proposed and investigated. The pathwise regularity properties of solutions to the semidiscrete Galerkin approximations are demonstrated and the convergence of optimal rates are derived. And also we construct the fully discrete scheme which is based on the approximations of the Mittag–Leffler function and analyze the error estimates of convergence in L{sub 2}-norm space. Finally, numerical results are conducted to confirm our theoretical findings.

97 MATHEMATICS AND COMPUTING↗

Extending The Realm of Optimization for Complex Systems: Uncertainty, Competition, And Dynamics

Research reported addressed these topics: the development of analytical and algorithmic tools for distributed computation of Nash equilibria; synchronization in mean-field oscillator games, with an emphasis on learning and efficiency analysis; questions that combine learning and computation; questions including stochastic and mean-field games; modeling and control in the context of power markets.

97 MATHEMATICS AND COMPUTING↗

PlumeSeeker{sup TM}: A Model-Based Least-Cost Monitoring Network Design Technology for 3-D Contaminant Plume Boundary Delineation - 19582

Delineating the extent of contamination in an aquifer is a pre-requisite for designing remediation schemes as well as for satisfying regulators and stakeholders. Contaminant plumes are typically delineated using either monitoring well locations with observed concentrations below remedial goals or with computer-drawn contour maps based on available concentration measurements in the groundwater. Computer-generated plume information lacks ground truth resulting in uncertainty about the true limits of contamination. The location of groundwater delineation wells is usually chosen solely based on professional judgement and experience. Both approaches can be inefficient, risky and often unnecessarily expensive. PlumeSeeker{sup TM} is a software-based technology well-suited for the optimal delineation of radiological or emerging contaminant plumes with single or multiple source locations. The software is an enhancement of a university research code for plume delineation using geostatistical and stochastic modeling tools integrated with the widely used groundwater flow and transport modeling software MODFLOW-SURFACT{sup TM}. PlumeSeeker{sup TM} increases the overall confidence in the location and geometry of the plume boundary through the sequential (i.e. a rank-ordered listing) or batch (i.e. a suite of multiple wells) selection of existing or new monitoring wells based on the criteria of maximizing plume boundary uncertainty reduction and on new field information. Using PlumeSeeker{sup TM}, remediation managers can optimally locate new wells at sites where well installation costs are high or hydrogeology is complex. Applicable at sites with or without existing monitoring wells, PlumeSeeker{sup TM} is particularly powerful for optimally allocating project resources (labor, well installation, and laboratory costs) between existing wells and sampling at new locations. An application of PlumeSeeker{sup TM} at a DoD installation demonstrates how the cost of delineating a plume can be minimized. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

SU-E-T-191: First Principle Calculation of Quantum Yield in Photodynamic Therapy

Purpose: We present a first-principle method to calculate the spin transfer efficiency in oxygen induced by any photon fields especially in MeV energy range. The optical pumping is mediated through photosensitizers, e.g., porphyrin and/or ensemble of quantum dots. Methods: Under normal conditions, oxygen molecules are in the relatively non-reactive triplet state. In the presence of certain photosensitizer compounds such as porphyrins, electromagnetic radiation of specific wavelengths can excite oxygen to highly reactive singlet state. With selective uptake of photosensitizers by certain malignant cells, photon irradiation of phosensitized tumors can lead to selective killing of cancer cells. This is the basis of photodynamic therapy (PDT). Despite several attempts, PDT has not been clinically successful except in limited superficial cancers. Many parameters such as photon energy, conjugation with quantum dots etc. can be potentially combined with PDT in order to extend the role of PDT in cancer management. The key quantity for this optimization is the spin transfer efficiency in oxygen by any photon field. The first principle calculation model presented here, is an attempt to fill this need. We employ stochastic density matrix description of the quantum jumps and the rate equation methods in quantum optics based on Markov/Poisson processes and calculate time evolution of the population of the optically pumped singlet oxygen. Results: The results demonstrate the feasibility of our model in showing the dependence of the optical yield in generating spin-singlet oxygen on the experimental conditions. The adjustable variables can be tuned to maximize the population of the singlet oxygen hence the efficacy of the photodynamic therapy. Conclusion: The present model can be employed to fit and analyze the experimental data and possibly to assist researchers in optimizing the experimental conditions in photodynamic therapy.

60 APPLIED LIFE SCIENCES↗

Block-oriented modeling of superstructure optimization problems

We present a novel software framework for modeling large-scale engineered systems as mathematical optimization problems. A key motivating feature in such systems is their hierarchical, highly structured topology. Existing mathematical optimization modeling environments do not facilitate the natural expression and manipulation of hierarchically structured systems. Rather, the modeler is forced to "flatten" the system description, hiding structure that may be exploited by solvers, and obfuscating the system that the modeling environment is attempting to represent. To correct this deficiency, we propose a Python-based "block-oriented" modeling approach for representing the discrete components within the system. Our approach is an extension of the Pyomo library for specifying mathematical optimization problems. Through the use of a modeling components library, the block-oriented approach facilitates a clean separation of system superstructure from the details of individual components. This approach also naturally lends itself to expressing design and operational decisions as disjunctive expressions over the component blocks. By expressing a mathematical optimization problem in a block-oriented manner, inherent structure (e.g., multiple scenarios) is preserved for potential exploitation by solvers. In particular, we show that block-structured mathematical optimization problems can be straightforwardly manipulated by decomposition-based multi-scenario algorithmic strategies, specifically in the context of the PySP stochastic programming library. We illustrate our block-oriented modeling approach using a case study drawn from the electricity grid operations domain: unit commitment with transmission switching and N - 1 reliability constraints. Finally, we demonstrate that the overhead associated with block-oriented modeling only minimally increases model instantiation times, and need not adversely impact solver behavior. (C) 2013 Elsevier Ltd. All rights reserved.

Friedman, Z↗

High-charge energetic ions generated by intersecting laser pulses

Ion acceleration from the interaction of two intersecting intense laser pulses with an overdense plasma is investigated using a three-dimensional particle-in-cell simulation. It is found that, comparing with the single-pulse case, the charge of the resulting energetic ion bunch can be increased by more than an order of magnitude without much loss of quality. Dependence of the ion charge on the interaction parameters, including separation distance and incidence angles of the lasers, is considered. It is shown that the charge of the accelerated ion bunch can be optimized by controlling the degree of laser overlapping. The improved performance can be attributed to the enhanced laser intensity as well as stochastic heating of the accelerated electrons. Since at present the intensity of readily available lasers is limited, the two pulse scheme should be useful for realizing higher laser intensity in order to achieve higher-energy target normal sheath acceleration ions.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Utah FORGE 5-2428: Fracture Permeability Impact on Reservoir Stress and Seismic Slip Behavior - Workshop Presentation

This is a presentation on the Fracture Permeability Impact on Seismic Slip Behavior project by Lawrence Livermore National Laboratory, presented by Dr. Kayla A. Kroll. The project's objective is to develop, apply and validate a holistic thermal, hydrologic, mechanical, and chemical (THMC) workflow that includes evaluation of induced seismic slip in EGS reservoirs. This presentation was featured in the Utah FORGE R&D Annual Workshop on September 8, 2023. The workshop provided a valuable opportunity to explore the progress made in each of the 17 Research and Development projects funded under Solicitation 2020-1 which aim to enhance our understanding of the crucial factors influencing the development of Enhanced Geothermal Systems (EGS) reservoirs and resources.

15 GEOTHERMAL ENERGY↗

Estimation of spectral emissivity in the thermal infrared

A number of algorithms are available in the literature that attempt to remove most of the effects of temperature from thermal multispectral data where the final goal is to extract emissivity differences. Early approaches include adjacent spectral band ratioing, broad band radiance normalization and the use of one band where emissivities are generally high (e.g., 11 to 12 micrometers) to determine the temperature. More recent work has produced two techniques that use data averaging to extract temperature to leave a quantity related to emissivity changes. These two techniques have been investigated and compared and appear to provide reasonable results. The analysis presented in this paper develops a thermal IR multispectral temperature/emissivity estimation procedure based on formal estimation theory, Gaussian statistics, and a stochastic radiance signal model including the effects of both temperature and emissivity. The importance of this work is that this is an optimal estimation procedure which will provide minimum variance estimates of temperature and emissivity changes directly. Section 2 discusses optimal linear spectral emissivity estimation and Section 3 is a summary.

Kryskowski, David↗

Modeling and Correcting the Time-Dependent ACS PSF

The ability to accurately measure the shapes of faint objects in images taken with the Advanced Camera for Surveys (ACS) on the Hubble Space Telescope (HST) depends upon detailed knowledge of the Point Spread Function (PSF). We show that thermal fluctuations cause the PSF of the ACS Wide Field Camera (WFC) to vary over time. We describe a modified version of the TinyTim PSF modeling software to create artificial grids of stars across the ACS field of view at a range of telescope focus values. These models closely resemble the stars in real ACS images. Using 10 bright stars in a real image, we have been able to measure HST s apparent focus at the time of the exposure. TinyTim can then be used to model the PSF at any position on the ACS field of view. This obviates the need for images of dense stellar fields at different focus values, or interpolation between the few observed stars. We show that residual differences between our TinyTim models and real data are likely due to the effects of Charge Transfer Efficiency (CTE) degradation. Furthermore, we discuss stochastic noise that is added to the shape of point sources when distortion is removed, and we present MultiDrizzle parameters that are optimal for weak lensing science. Specifically, we find that reducing the MultiDrizzle output pixel scale and choosing a Gaussian kernel significantly stabilizes the resulting PSF after image combination, while still eliminating cosmic rays/bad pixels, and correcting the large geometric distortion in the ACS. We discuss future plans, which include more detailed study of the effects of CTE degradation on object shapes and releasing our TinyTim models to the astronomical community.

Rhodes, Jason↗

Nonlinear Matrix Approximation with Radial Basis Function Components

We introduce and investigate matrix approximation by decomposition into a sum of radial basis function (RBF) components. An RBF component is a generalization of the outer product between a pair of vectors, where an RBF function replaces the scalar multiplication between individual vector elements. Even though the RBF functions are positive definite, the summation across components is not restricted to convex combinations and allows us to compute the decomposition for any real matrix that is not necessarily symmetric or positive definite. We formulate the problem of seeking such a decomposition as an optimization problem with a nonlinear and non-convex loss function. Several modern versions of the gradient descent method, including their scalable stochastic counterparts, are used to solve this problem. We provide extensive empirical evidence of the effectiveness of the RBF decomposition and that of the gradient-based fitting algorithm. While being conceptually motivated by singular value decomposition (SVD), our proposed nonlinear counterpart outperforms SVD by drastically reducing the memory required to approximate a data matrix with the same L2 error for a wide range of matrix types. For example, it leads to 2 to 6 times memory save for Gaussian noise, graph adjacency matrices, and kernel matrices. Moreover, this proximity-based decomposition can offer additional interpretability in applications that involve, e.g., capturing the inner low-dimensional structure of the data, retaining graph connectivity structure, and preserving the acutance of images.

Rebrova, Elizaveta↗

Optimal Zeno Dragging for Quantum Control: A Shortcut to Zeno with Action-Based Scheduling Optimization

The quantum Zeno effect asserts that quantum measurements inhibit simultaneous unitary dynamics when the “collapse” events are sufficiently strong and frequent. This applies in the limit of strong continuous measurement or dissipation. It is possible to implement a dissipative control that is known as “Zeno dragging” by dynamically varying the monitored observable, and hence also the eigenstates, which are attractors under Zeno dynamics. This is similar to adiabatic processes, in that the Zeno-dragging fidelity is highest when the rate of eigenstate change is slow compared to the measurement rate. We demonstrate here two theoretical methods for using such dynamics to achieve control of quantum systems. The first, which we shall refer to as “shortcut to Zeno,” is analogous to the shortcuts to adiabaticity (counterdiabatic driving) that are frequently used to accelerate unitary adiabatic evolution. In the second approach, we apply the Chantasri-Dressel-Jordan stochastic action [PRA 88, 042110 (2013)], and demonstrate that the extremal-probability readout paths derived from this are well suited to setting up a Pontryagin-style optimization of the Zeno-dragging schedule. A fundamental contribution of the latter approach is to show that an action suitable for measurement-driven control optimization can be derived quite generally from statistical arguments. Implementing these methods on the Zeno dragging of a qubit, we find that both approaches yield the same solution, namely, that the optimal control is a unitary that matches the motion of the Zeno-monitored eigenstate. We then show that such a solution can be more robust than a unitary-only operation and we comment on solvable generalizations of our qubit example embedded in larger systems. These methods open up new pathways toward systematically developing dynamic control of Zeno subspaces to realize dissipatively stabilized quantum operations. Published by the American Physical Society 2024

Physics↗

Optimal Proactive Vehicle Relocation for On-Demand Mobility Service with Deep Convolution-LSTM Network

This study develops an innovative model for inferring optimal proactive relocation strategy for empty vehicles of on-demand mobility service (OMS) directly from past observations of passenger demand. The output of our model is a row stochastic relocation matrix which gives the probability that an empty vehicle should be relocated from location i to location j at any given time. The matrix itself is high-dimensional and therefore challenging to obtain accurate estimation with traditional machine learning approach. Our model proposes the low-rank approximation of the relocation matrix, and introduces the deep convolution-LSTM network which extracts low-level spatial and temporal features from past demand observations for best restoration of the actual low rank approximation vector. The model is trained by deriving the optimal matching strategies from one year of real-world trip data. The results show that our model is able to predict the low-rank approximation of the relocation matrix with 4% of mean absolute error, may reduce the relocation cost by 20%-45% as compared to the real-world observations and is 50% optimal as compared to the global optimal matching with perfect information.

Lei, Zengxiang↗

Operation of a High Renewable Penetrated Power System With CSP Plants: A Look-Ahead Stochastic Unit Commitment Model

The integration of variable renewable energy (VRE) generation, i.e., wind power and solar photovoltaic, brings significant uncertainty for the power system operation. Different with VRE techniques, concentrating solar power (CSP) is an appealing renewable generation technology due to its dispatch ability through the use of thermal energy storage and is thus expected to play a significant role in high renewable energy penetrated power systems. In this paper, we propose a look-ahead stochastic unit commitment model to operate power systems with CSP under high renewable energy penetration. It has a three-stage structure. The first stage optimizes the operational decisions in a day-ahead framework based on forecasts; the second stage minimizes the expected generation cost for possible realizations in the real time; and the third stage accounts for look-ahead operation in future operating days. This paper has a dual purpose: first, exploring how CSP plants operate in high renewable penetrated power systems; and second, analyzing the benefits of CSP in accommodating VRE generation. A case study on a modified IEEE RTS-79 system with actual solar and wind power data is provided to validate the proposed method.

14 SOLAR ENERGY↗