Quantum Optimization and Learning and Simulation (QOALAS): Project Overview.
Abstract not provided.
Parekh, Ojas↗
SEARCH · Search NASA
Results for “Simulation 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.
A Simulation Modeling Approach to Optimizing Nuclear Waste Dispositioning
The dispositioning of nuclear waste generated at facilities across the country is an ongoing battle that affects us all. National laboratories and research centers dealing in medical research, clean energy, and other nuclear activities such as the Department of Energy (DOE) facilities face the need to properly manage and dispose of nuclear waste. A dynamic modeling solution would enable the DOE and others to make decisions on waste disposal and technological options. In doing so, this research explores modeling techniques using available data to address these situations. The focus being on developing an initial robust and adaptable discrete event model using the ExtendSim tool. This modeling effort will target the dispositioning of transuranic waste at the Savannah River National Laboratory (SRNL) which can be expanded to represent the current state of disposition process for waste generated at other DOE facilities. The model aims to assess resource allocation and waste processing options to stabilize productivity and cut the backlog of nuclear waste. By assessing the results of different scenarios, this research aims to provide actionable insights for the DOE. This approach has the potential to significantly improve the management of radioactive waste, offering the capability of evaluating options for optimizing the process for nuclear waste disposal. The findings of this study can serve as a valuable resource for decision-makers and other national laboratories, or research entities engaged in nuclear operations by enabling them to make more informed choices.
Andaverde, Alexis↗
Computational Antigen Optimization through Symbolic Optimization and Affinity Maturation Simulation
Explore the source record for details and available documents.
Biological and medical sciences, Mathematics and C↗
Dark Energy Survey Year 3 results: optimized $w$CDM simulation-based inference with weak lensing map-level hybrid statistics
We present cosmological constraints from the Dark Energy Survey Year 3 (DES Y3) weak lensing data using hierarchical hybrid statistics within a Bayesian simulation-based inference framework that is based on the Gower Street simulations. To maximize the precision of the inference, we have developed a new, information-theory based, data compression of the weak lensing maps to just seven highly informative summary statistics. The hybrid scheme exploits the high information content of the power spectrum, compressing both the power spectrum and neural-based summaries that are designed to extract further information. Our simulation-based approach enables principled forward modelling of all major sources of systematic uncertainty and survey properties into realistic mock observations, including the survey mask, photometric redshift uncertainties, intrinsic galaxy alignments, multiplicative shear calibration bias, source galaxy clustering, non-Gaussian shape noise, and non-linear structure formation. The summary statistics are then used in a Bayesian simulation-based inference pipeline. The inference is validated through coverage tests and checks for robustness against baryonic feedback. Assuming a $w$CDM cosmology, our analysis yields $S_8 = 0.808 \pm 0.017$, $Ω_{\rm m} = 0.325 \pm 0.024$, and $w < -0.766$ (marginalized posterior 68 per cent credible intervals). This rigorous combination of information theory, physics- and neural network-based extreme data compression, and principled Bayesian analysis improves the figure of merit for $(Ω_{\rm m}, S_8, w)$ by 60 per cent over the previous state-of-the-art, and by almost a factor of 3 over two-point analyses of the same data. They are the most precise joint constraints on $(Ω_{\rm m}, S_8, w)$ from weak gravitational lensing data alone of any survey to date. We intend to apply this analysis to the more recent DES Y6 data.
Williamson, J. [University Coll. London]↗
Hybrid-computer optimization of systems with random parameters
Hybrid computer Monte Carlo technique for simulation and optimization of system with random parameters
White, R. C., Jr.↗
Space tug geosynchronous mission simulation
Near-optimal three dimensional trajectories from a low earth park orbit inclined at 28.5 deg to a synchronous-equatorial mission orbit were developed for both the storable (thrust = 28,912 N (6,500 lbs), I sub sp = 339 sec) and cryogenic (thrust = 44,480 N (10,000 lbs), I sub sp = 470 sec) space tug using the iterative cost function minimization technique contained within the modularized vehicle simulation (MVS) program. The finite burn times, due to low thrust-to-weight ratios, and the associated gravity losses are accounted for in the trajectory simulation and optimization. The use of an ascent phasing orbit to achieve burnout in synchronous orbit at any longitude is investigated. The ascent phasing orbit is found to offer the additional advantage of significantly reducing the overall delta velocity by splitting the low altitude burn into two parts and thereby reducing gravity losses.
Lang, T. J.↗
Optimal digital real-time simulation
Issues affecting the fidelity of real-time digital simulation are discussed and a scalar measure of fidelity is derived which reflects the end-to-end dynamics of a given simulator. A class of explicit linear multistep discrete integration formulae are developed which are optimal with respect to the fidelity measure for a given simulation configuration. A computational algorithm is given for calculating the parameters associated with the optimal formulae.
Moerder, D. D.↗
Performance limitations in parallel processor simulations
A jet-engine model is partitioned and simulated on a parallel processor system consisting of five 8086/8087 floating-point computers. The simulation uses Heun's integration method. A near-optimal parallel simulation (in the sense of minimum execution time) achieves speedup of only 2.13 and efficiency of 42.6 percent, in effect wasting 57.4 percent of the available processing power. A detailed analysis identifies and graphically demonstrates why the system fails to achieve ideal performance (viz., speedup of 5 and efficiency of 100 percent). Inherent characteristics of the problem equations and solution algorithm account for the loss of nearly half of the available processing power. Overheads associated with interprocessor communication and processor synchronization account for only a small fraction of the lost processing power. The effects of these and other factors which limit parallel processor performance are illustrated through real-time timing-analyzer tracers describing the run/idle status of the parallel processors during the simulation.
O'Grady, E. Pearse↗
Efficient Simulation Budget Allocation for Selecting an Optimal Subset
We consider a class of the subset selection problem in ranking and selection. The objective is to identify the top m out of k designs based on simulated output. Traditional procedures are conservative and inefficient. Using the optimal computing budget allocation framework, we formulate the problem as that of maximizing the probability of correc tly selecting all of the top-m designs subject to a constraint on the total number of samples available. For an approximation of this corre ct selection probability, we derive an asymptotically optimal allocat ion and propose an easy-to-implement heuristic sequential allocation procedure. Numerical experiments indicate that the resulting allocatio ns are superior to other methods in the literature that we tested, and the relative efficiency increases for larger problems. In addition, preliminary numerical results indicate that the proposed new procedur e has the potential to enhance computational efficiency for simulation optimization.
Chen, Chun-Hung↗
Application of an automated machine learning-genetic algorithm (AutoML-GA) coupled with computational fluid dynamics simulations for rapid engine design optimization
In recent years, the use of machine learning-based surrogate models for computational fluid dynamics (CFD) simulations has emerged as a promising technique for reducing the computational cost associated with engine design optimization. However, such methods still suffer from drawbacks. One main disadvantage is that the default machine learning (ML) hyperparameters are often severely suboptimal for a given problem. This has often been addressed by manually trying out different hyperparameter settings, but this solution is ineffective in case of a high-dimensional hyperparameter space. Besides this problem, the amount of data needed for training is also not known a priori. In response to these issues that need to be addressed, the present work describes and validates an automated active learning approach, AutoML-GA, for surrogate-based optimization of internal combustion engines. In this approach, a Bayesian optimization technique is used to find the best machine learning hyperparameters based on an initial dataset obtained from a small number of CFD simulations. Subsequently, a genetic algorithm is employed to locate the design optimum on the ML surrogate surface. In the vicinity of the design optimum, the solution is refined by repeatedly running CFD simulations at the projected optima and adding the newly obtained data to the training dataset. It is demonstrated that AutoML-GA leads to a better optimum with a lower number of CFD simulations, compared to the use of default hyperparameters. The proposed framework offers the advantage of being a more hands-off approach that can be readily utilized by researchers and engineers in industry who do not have extensive machine learning expertise.
Owoyele, Opeoluwa↗
DRILLING OPTIMIZATION OF A CANEY SHALE WELL USING OFFSET WELL DRILLING DATA
Cost reduction can be achieved by utilizing drilling simulators to efficiently optimize new wells to be drilled using available adjacent or offset well drilling data. Different approaches involving simulators that use inverted rate of penetration (ROP) models have been implemented to help improve the drilling performance of wells primarily within the Caney shale. A complete simulation and optimization technique is presented herein which utilizes drilling data from a nearby or offset well (Garrett well) to create an optimized drilling program for a new well to be drilled (Gallaway well).
02 PETROLEUM↗
Hybrid computer optimization of systems with random parameters
A hybrid computer Monte Carlo technique for the simulation and optimization of systems with random parameters is presented. The method is applied to the simultaneous optimization of the means and variances of two parameters in the radar-homing missile problem treated by McGhee and Levine.
White, R. C., Jr.↗
Change-point Detection and Image Segmentation for Time Series of Astrophysical Images
Many astrophysical phenomena are time-varying, in the sense that their intensity, energy spectrum, and/or the spatial distribution of the emission suddenly change. This paper develops a method for modeling a time series of images. Under the assumption that the arrival times of the photons follow a Poisson process, the data are binned into 4D grids of voxels (time, energy band, and x-y coordinates), and viewed as a time series of non-homogeneous Poisson images. The method assumes that at each time point, the corresponding multiband image stack is an unknown 3D piecewise constant function including Poisson noise. It also assumes that all image stacks between any two adjacent change points (in time domain) share the same unknown piecewise constant function. The proposed method is designed to estimate the number and the locations of all of the change points (in time domain), as well as all of the unknown piecewise constant functions between any pairs of the change points. The method applies the minimum description length principle to perform this task. A practical algorithm is also developed to solve the corresponding complicated optimization problem. Simulation experiments and applications to real data sets show that the proposed method enjoys very promising empirical properties. Applications to two real data sets, the XMM observation of a flaring star and an emerging solar coronal loop, illustrate the usage of the proposed method and the scientific insight gained from it.
79 ASTRONOMY AND ASTROPHYSICS↗
Development of free-piston Stirling engine performance and optimization codes based on Martini simulation technique
A FORTRAN computer code is described that could be used to design and optimize a free-displacer, free-piston Stirling engine similar to the RE-1000 engine made by Sunpower. The code contains options for specifying displacer and power piston motion or for allowing these motions to be calculated by a force balance. The engine load may be a dashpot, inertial compressor, hydraulic pump or linear alternator. Cycle analysis may be done by isothermal analysis or adiabatic analysis. Adiabatic analysis may be done using the Martini moving gas node analysis or the Rios second-order Runge-Kutta analysis. Flow loss and heat loss equations are included. Graphical display of engine motions and pressures and temperatures are included. Programming for optimizing up to 15 independent dimensions is included. Sample performance results are shown for both specified and unconstrained piston motions; these results are shown as generated by each of the two Martini analyses. Two sample optimization searches are shown using specified piston motion isothermal analysis. One is for three adjustable input and one is for four. Also, two optimization searches for calculated piston motion are presented for three and for four adjustable inputs. The effect of leakage is evaluated. Suggestions for further work are given.
Martini, William R.↗
Fixed-frequency and Frequency-agile (au, HTS) Microstrip Bandstop Filters for L-band Applications
In this work, we report on the performance of a highly selective, compact 1.83 x 2.08 cm(exp 2) (approx. 0.72 x 0.82 in(exp 2) microstrip line bandstop filter of YBa2CU3O(7-delta) (YBCO) on LaAlO3 (LAO) substrate. The filter is designed for a center frequency of 1.623 GHz for a bandwidth at 3 dB from reference baseline of less than 5.15 MHz, and a bandstop rejection of 30 dB or better. The design and optimization of the filter was performed using Zeland's IE3D circuit simulator. The optimized design was used to fabricate gold (Au) and High-Temperature Superconductor (HTS) versions of the filter. We have also studied an electronically tunable version of the same filter. Tunability of the bandstop characteristics is achieved by the integration of a thin film conductor (Au or HTS) and the nonlinear dielectric ferroelectric SrTiO3 in a conductor/ferroelectric/dielectric modified microstrip configuration. The performance of these filters and comparison with the simulated data will be presented.
Saenz, Eileen M.↗
Integration of Linear Dynamic Emission and Climate Models with Air Traffic Simulations
Future air traffic management systems are required to balance the conflicting objectives of maximizing safety and efficiency of traffic flows while minimizing the climate impact of aviation emissions and contrails. Integrating emission and climate models together with air traffic simulations improve the understanding of the complex interaction between the physical climate system, carbon and other greenhouse gas emissions and aviation activity. This paper integrates a national-level air traffic simulation and optimization capability with simple climate models and carbon cycle models, and climate metrics to assess the impact of aviation on climate. The capability can be used to make trade-offs between extra fuel cost and reduction in global surface temperature change. The parameters in the simulation can be used to evaluate the effect of various uncertainties in emission models and contrails and the impact of different decision horizons. Alternatively, the optimization results from the simulation can be used as inputs to other tools that monetize global climate impacts like the FAA s Aviation Environmental Portfolio Management Tool for Impacts.
Sridhar, Banavar↗
Applying Biomimetic Algorithms for Extra-Terrestrial Habitat Generation
The objective is to simulate and optimize distributed cooperation among a network of robots tasked with cooperative excavation on an extra-terrestrial surface. Additionally to examine the concept of directed Emergence among a group of limited artificially intelligent agents. Emergence is the concept of achieving complex results from very simple rules or interactions. For example, in a termite mound each individual termite does not carry a blueprint of how to make their home in a global sense, but their interactions based strictly on local desires create a complex superstructure. Leveraging this Emergence concept applied to a simulation of cooperative agents (robots) will allow an examination of the success of non-directed group strategy achieving specific results. Specifically the simulation will be a testbed to evaluate population based robotic exploration and cooperative strategies while leveraging the evolutionary teamwork approach in the face of uncertainty about the environment and partial loss of sensors. Checking against a cost function and 'social' constraints will optimize cooperation when excavating a simulated tunnel. Agents will act locally with non-local results. The rules by which the simulated robots interact will be optimized to the simplest possible for the desired result, leveraging Emergence. Sensor malfunction and line of sight issues will be incorporated into the simulation. This approach falls under Swarm Robotics, a subset of robot control concerned with finding ways to control large groups of robots. Swarm Robotics often contains biologically inspired approaches, research comes from social insect observation but also data from among groups of herding, schooling, and flocking animals. Biomimetic algorithms applied to manned space exploration is the method under consideration for further study.
Birge, Brian↗
Optimizing the Resolution of Hydrodynamic Simulations for MCRaT Radiative Transfer Calculations
Despite their discovery about half a century ago, the Gamma-ray burst (GRB) prompt emission mechanism is still not well understood. Theoretical modeling of the prompt emission has advanced considerably due to new computational tools and techniques. One such tool is the PLUTO hydro dynamics code, which is used to numerically simulate GRB outflows. PLUTO uses Adaptive Mesh Refinement to focus computational efforts on the portion of the grid that contains the simulated jet. Another tool is the Monte Carlo Radiation Transfer (MCRaT) code, which predicts electromagnetic signatures of GRBs by conducting photon scatterings within a jet using PLUTO. The effects of the underlying resolution of a PLUTO simulation with respect to MCRaT post-processing radiative transfer results have not yet been quantified. We analyze an analytic spherical outflow and a hydrodynamically simulated GRB jet with MCRaT at varying spatial and temporal resolutions and quantify how decreasing both resolutions affect the resulting mock observations. We find that changing the spatial resolution changes the hydrodynamic properties of the jet, which directly affect the MCRaT mock observable peak energies. We also find that decreasing the temporal resolution artificially decreases the high energy slope of the mock observed spectrum, which increases both the spectral peak energy and the luminosity. We show that the effects are additive when both spatial and temporal resolutions are modified. Our results allow us to understand how decreased hydrodynamic temporal and spatial resolutions affect the results of post-processing radiative transfer calculations, allowing for the optimization of hydrodynamic simulations for radiative transfer codes.
Jose Arita-Escalante↗