Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithms”

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,027 records · Page 57
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Identifying a regional aerosol baseline in the eastern North Atlantic using collocated measurements and a mathematical algorithm to mask high-submicron-number-concentration aerosol events

Abstract. High-time-resolution measurements of in situ aerosol and cloud properties provide the ability to study regional atmospheric processes that occur on timescales of minutes to hours. However, one limitation to this approach is that continuous measurements often include periods when the data collected are not representative of the regional aerosol. Even at remote locations, submicron aerosols are pervasive in the ambient atmosphere with many sources. Therefore, periods dominated by local aerosol should be identified before conducting subsequent analyses to understand aerosol regional processes and aerosol–cloud interactions. Here, we present a novel method to validate the identification of regional baseline aerosol data by applying a mathematical algorithm to the data collected at the U.S. Department of Energy's (DOE) Atmospheric Radiation Measurement (ARM) user facility in the eastern North Atlantic (ENA). The ENA central facility (C1) includes an aerosol observing system (AOS) for the measurement of aerosol physical, optical, and chemical properties at time resolutions from seconds to minutes. A second temporary supplementary facility (S1), located ∼0.75 km from C1, was deployed for ∼1 year during the Aerosol and Cloud Experiments (ACE-ENA) campaign in 2017. First, we investigate the local aerosol at both locations. We associate periods of high submicron number concentration (Ntot) in the fine-mode condensation particle counter (CPC) and size distributions from the Ultra-High Sensitivity Aerosol Spectrometer (UHSAS) as a function of wind direction using a meteorology sensor with local sources. Elevated concentrations of Aitken-mode (< 100 nm diameter) particles were observed in correspondence with the wind directions associated with airport operations. At ENA, the Graciosa Airport and its associated activities were found to be the main sources of high-concentration aerosol events at ENA, causing peaks in 1 min Ntot that exceeded 8000 and 10 000 cm−3 at C1, in summer and winter, respectively, and 5000 cm−3 at S1 in summer. Periods with high Ntot not associated with these wind directions were also observed. As a result, the diverse local sources at ENA yielded a poor relationship between Ntot measurements collected at C1 and S1 (R2=0.03 with a slope =0.05±0.001). As a first approach to mask these events, the time periods when the wind direction was associated with the airport operations (west to northwest and southeast to south at C1 and east to south at S1) were applied. The meteorological masks removed 38.9 % of the data at C1 and 43.4 % at S1, and they did not significantly improve the relationship between the two sites (R2=0.18 with a slope =0.06±0.001). Due to the complexity of high-Ntot events observed at ENA, we develop and validate a mathematical ENA Aerosol Mask (ENA-AM) to identify high-Ntot events using 1 min resolution data from the AOS CPC at C1 and S1. After its parameterization and application, ENA-AM generated a high correlation between Ntot in the summer at C1 and S1 (R2=0.87 with a slope =0.84±0.001). We identified the regional baseline at ENA to be 428±228 cm−3 in the summer and 346±223 cm−3 in the winter. Lastly, we compared masked measurements from the AOS with the ARM Aerial Facility (AAF) during flights over C1 in the summer to understand submicron aerosol vertical mixing over C1. The high correlation (R2=0.71 with a slope of 1.04±0.01) observed between C1 and the AAF Ntot collected within an area of 10 km surrounding ENA and at altitudes < 500 m indicated that the submicron aerosol at ENA was well mixed within the first 500 m of the marine boundary layer during the month of July during ACE-ENA. Our novel method for determining a regional aerosol baseline at ENA can be applied to other time periods and at other locations with validation by a secondary site or additional collocated measurements.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

SICOPOLIS-AD v1: an open-source adjoint modeling framework for ice sheet simulation enabled by the algorithmic differentiation tool OpenAD

We present a new capability of the ice sheet model SICOPOLIS that enables flexible adjoint code generation via source transformation using the open-source algorithmic differentiation (AD) tool OpenAD.The adjoint code enables efficient calculation of the sensitivities of a scalar-valued objective function or quantity of interest (QoI) to a range of important, often spatially varying and uncertain model input variables, including initial and boundary conditions, as well as model parameters.Compared to earlier work on the adjoint code generation of SICOPOLIS, our work makes several important advances:(i) it is embedded within the up-to-date trunk of the SICOPOLIS repository – accounting for 1.5 decades of code development and improvements – and is readily available to the wider community;(ii) the AD tool used, OpenAD, is an open-source tool;(iii) the adjoint code developed is applicable to both Greenland and Antarctica, including grounded ice as well as floating ice shelves, with an extended choice of thermodynamical representations.A number of code refactorization steps were required. They are discussed in detail in an Appendix as they hold lessons for the application of AD to legacy codes at large.As an example application, we examine the sensitivity of the total Antarctic Ice Sheet volume to changes in initial ice thickness, austral summer precipitation, and basal and surface temperatures across the ice sheet.Simulations of Antarctica with floating ice shelves show that over 100 years of simulation the sensitivity of total ice sheet volume to the initial ice thickness and precipitation is almost uniformly positive, while the sensitivities to surface and basal temperature are almost uniformly negative. Sensitivity to austral summer precipitation is largest on floating ice shelves from Queen Maud to Queen Mary Land. The largest sensitivity to initial ice thickness is at outlet glaciers around Antarctica. Comparison between total ice sheet volume sensitivities to surface and basal temperature shows that surface temperature sensitivities are higher broadly across the floating ice shelves, while basal temperature sensitivities are highest at the grounding lines of floating ice shelves and outlet glaciers. A uniformly perturbed region of East Antarctica reveals that, among the four control variables tested here, total ice sheet volume is the most sensitive to variations in austral summer precipitation as formulated in SICOPOLIS.Comparison between adjoint- and finite-difference-derived sensitivities shows good agreement, lending confidence that the AD tool is producing correct adjoint code.The new modeling infrastructure is freely available at http://www.sicopolis.net (last access: 2 April 2020) under the development trunk.

58 GEOSCIENCES↗
DOE OSTI2024

Algorithmically detected rain-on-snow flood events in different climate datasets: a case study of the Susquehanna River basin

Abstract. Rain-on-snow (RoS) events in regions of ephemeral snowpack – such as the northeastern United States – can be key drivers of cool-season flooding. We describe an automated algorithm for detecting basin-scale RoS events in gridded climate data by generating an area-averaged time series and then searching for periods of concurrent precipitation, surface runoff, and snowmelt exceeding predefined thresholds. When evaluated using historical data over the Susquehanna River basin (SRB), the technique credibly finds RoS events in published literature and flags events that are followed by anomalously high streamflow as measured by gauge data along the river. When comparing four different datasets representing the same 21-year period, we find large differences in RoS event magnitude and frequency, primarily driven by differences in estimated surface runoff and snowmelt. Using dataset-specific thresholds improves agreement between datasets but does not account for all discrepancies. We show that factors such as meteorological forcing and coupling frequency, as well as choice of land surface model, play roles in how data products capture these compound extremes and suggest care is to be taken when climate datasets are used by stakeholders for operational decision-making.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2026

Classical-Quantum Algorithm for Solving Stochastic Programs

Stochastic programming provides a rigorous mathematical framework for making decisions under uncertainty in a risk-aware manner. Two-stage stochastic programming is, perhaps, the simplest form of this framework. Here the first-stage variables represent decisions that must be made "here and now" in the face of uncertainty, while the second-stage variables are decisions made after uncertain events. However, the broad adoption of stochastic programming has been hindered by computational challenges caused by the two-stage stochastic programming formulation which requires solving an ensemble of optimization problems. Using quantum amplitude estimation (QAE), quantum computers have shown the theoretic ability to compute expectations with Monte-Carlo methods with quadratically fewer samples than classical methods. In this work, we present a quantum algorithm for computing the expectation term using QAE for given first-stage decisions. Further, we detail methods of computing gradient information from the quantum calculation enabling the application of classical gradient-based optimization techniques. The result is a classical-quantum hybrid method of solving two-stage stochastic programs. These techniques are demonstrated with computational experiments based an engineering optimization problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

One and Two Dimensional Quantum Lattice Algorithms for Maxwell Equations in Inhomogeneous Scalar Dielectric Media. II: Simulations

Long time quantum lattice algorithm (QLA) simulations are performed for the mul- tiple reflection-transmission of an initial electromagnetic pulse propagating normally to a boundary layer region joining two media of different refractive index. For these one dimensional (1D) sim- ulations, there is excellent agreement between x-, y- and z- representations, as well as very good agreement with nearly all the standard plane wave boundary condition results for reflection and transmission off a dielectric discontinuity. In the QLA simulation, no boundary conditions are im- posed at the continuous, but sharply increasing, dielectic boundary layers. Two dimensional (2D) QLA scattering simulations in the x-z plane are performed for an electromagnetic pulse interacting with a conical dielectric obstacle for the 8-16 qubit model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

One and Two Dimensional Quantum Lattice Algorithms for Maxwell Equations in Inhomogeneous Scalar Dielectric Media I: Theory

A quantum lattice algorithm (QLA) is developed for Maxwell equations in scalar dielectric media using the Riemann-Silberstein representation on a Cartesian grid. For x-dependent and y-dependent dielectric inhomogeneities, the corresponding QLA requires a minimum of 8 qubits/spatial lattice site. This is because the corresponding Pauli spin matrices have off-diagonal components which permit the local collisional entanglement of these qubits. However, z-dependent inhomogeneities require a QLA with a minimum of 16 qubits/lattice site since the Pauli spin matrix σz is diagonal. For 2 dimensional inhomogeneities, one can readily couple the 8-8 qubit schemes for x-y variations. z-x and y-z variations can be treated by either a 16-8 qubit scheme or a 16-16 qubit representation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

The Locus Algorithm III: A Grid Computing system to generate catalogues of optimised pointings for Differential Photometry

This paper discusses the hardware and software components of the Grid Computing system used to implement the Locus Algorithm to identify optimum pointings for differential photometry of 61,662,376 stars and 23,799 quasars. The scale of the data, together with initial operational assessments demanded a High Performance Computing (HPC) system to complete the data analysis. Grid computing was chosen as the HPC solution as the optimum choice available within this project. The physical and logical structure of the National Grid computing Infrastructure informed the approach that was taken. That approach was one of layered separation of the different project components to enable maximum flexibility and extensibility.

Creaner, Oisń↗
DOE OSTI2020

Genetic algorithm for demand response: a stackelberg game approach

Demand response (DR) has gained a significant recent interest due to its potential for mitigating many power system problems. Game theory is a very effective tool to be utilized in DR management. In this paper, the DR between a distribution system operator (DSO) and load aggregators (LAs) is designed as a Stackelberg game, where the DSO acts as the leader and LAs are regarded as the followers. Due to the limitations of the centralized solution approaches, a genetic algorithm-based decentralized approach is proposed. To demonstrate the proposed approach, a case study concerning a day-ahead optimization for a real-time pricing market with a single DSO and three LAs is designed and optimized. The proposed approach is able to shift the demand peaks and prove that it has a great potential to be used for the Stackelberg game between a DSO and multiple LAs to fully exploit the potential of DR.

Amasyali, Kadir↗
DOE OSTI2020

An Improved Transmission Switching Algorithm for Managing Post-(N-1) Contingencies in Electricity Networks

In this presentation, we detail the shortcomings of existing transmission switching (TS) methodologies for preventing post-contingency loss of load in wide area electric power networks. Following that, we present a bi-level algorithm as an improvement to the state of the art. We show proof-of-concept level results that indicate computational viability, fast solutions, and the ability to pick the same best candidate as non computationally viable methods. Further, our method also minimizes load shedding after the contingency, thus enhancing the reliability and security of electricity supply. We also include a futuristic scenario of increased renewables and decreased natural gas sourced generators to show promising results. We grant permission for our presentation to be recorded and uploaded by the conference organizers.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Forewarning of Bridge Failure Without Algorithm Training

Forewarning of bridge failure without algorithm training uses Griffith's criterion for failure with crack growth induced by structural defamations under load in combination with a statistical criterion for forewarning under cyclic loading.

Abercrombie, Robert↗
DOE OSTI2021

Enhanced Integer Permutation based Genetic Algorithm for Optimization of Tube-Fin Heat Exchanger Circuitry with Splits and Merges

Tube-fin heat exchangers (HXs) are widely used in air-conditioning and heat pump applications. The performance of these heat exchangers is strongly influenced by the refrigerant circuitry. Studies have proved that by optimizing the refrigerant circuitry, the performance of HXs can be significantly improved. In our previous research, an Integer Permutation based Genetic Algorithm (IPGA) was developed to obtain the optimal circuitry designs. Our previous research showed that IPGA demonstrates superior capability to obtain better refrigerant circuitries with lower computational cost than the other methods in literature. And the optimal circuitry designs obtained from IPGA are manufacturable with the available tooling. However, the IPGA developed previously cannot generate designs with splitting and merging of circuits. To remedy this limitation, a new chromosome which can represent circuitry with splitting and merging of circuits is developed. In addition to the six genetic operators implemented previously, two new genetic operators are developed to generate splits and merges. As a result, the enhanced IPGA can explore the solution space more thoroughly than the previous IPGA. A case study using an evaporator from an A-type indoor unit shows that, given the similar capacity improvements obtained from the enhanced IPGA compared with the previous IPGA, the refrigerant pressure drop reduction obtained from the enhanced IPGA is 26.5% compared against 1.0% pressure drop reduction from the previous IPGA. The benchmark of the enhanced IPGA with other methods in literature demonstrates that the enhanced IPGA can generate circuitry designs with performance superior to those obtained from other methods.

LI, Zhenning↗
DOE OSTI2021

A reproducibility study of "Augmenting Genetic Algorithms with Deep Neural Networks for Exploring the Chemical Space"

Nigam et al. reported a genetic algorithm (GA) utilizing the SELFIES representation and also propose an adaptive, neural network-based penalty that is supposed to improve the diversity of the generated molecules. The main claims of the paper are that this GA outperforms other generative techniques (as measured by the penalized logP) and that a neural network-based adaptive penalty increases the diversity of the generated molecules. In this work, we investigated the reproducibility of their claims. Overall, we were able to reproduce comparable results using the SELFIES-based GA, but mostly by exploiting deficiencies of the (easily optimizable) fitness function (i.e., generating long, sulfur containing chains). In addition, we reproduce results showing that the discriminator can be used to bias the generation of molecules to ones that are similar to the reference set. Lastly, we attempted to quantify the evolution of the diversity, understand the influence of some hyperparameters, and propose improvements to the adaptive penalty.

Jablonka, Kevin Maik↗
DOE OSTI2021

Rubik’s Cube Topology Based Particle Swarm Algorithm for Bilevel Building Energy Transaction

Following the rapid growth of distributed energy resources (e.g. renewables, battery), localized peer-to-peer energy transactions are receiving more attention for multiple benefits, such as, reducing power loss, stabilizing the main power grid, etc. To promote distributed renewables locally, the local trading price is usually set to be within the external energy purchasing and selling price range. Consequently, building prosumers are motivated to trade energy through a local transaction center. This local energy transaction is modeled in bilevel optimization game. A selfish upper level agent is assumed with the privilege to set the internal energy transaction price with an objective of maximizing its arbitrage profit. Meanwhile, the building prosumers at the lower level will response to this transaction price and make decisions on electricity transaction amount. Therefore, this non-cooperative leader-follower trading game is seeking for equilibrium solutions on the energy transaction amount and prices. In addition, a uniform local transaction price structure (purchase price equals selling price) is considered here. Aiming at reducing the computational burden from classical Karush-Kuhn-Tucker (KKT) transformation and protecting the private information of each stakeholder (e.g., building), swarm intelligence based solution approach is employed for upper level agent to generate trading price and coordinate the transactive operations. On one hand, to decrease the chance of premature convergence in global-best topology, Rubiks Cube topology is proposed in this study based on further improvement of a two-dimensional square lattice model (i.e., one local-best topology-Von Neumann topology). Rotating operation of the cube is introduced to dynamically changing the neighborhood and enhancing information flow at the later searching state. Several groups of experiments are designed to evaluate the performance of proposed Rubiks Cube topology based particle swarm algorithm. The results have validated the effectiveness of proposed topology and operators comparing with global-best version PSO and Von Neumann topology based PSO and its scalability on larger scale applications.

Feng, Xiaochun↗
DOE OSTI2021

June 2021 SAPHIRE 8 Algorithm Enhancements Status Report

This letter report documents the accomplishments and recommendations for the two subtasks that are part of this contract, SAPHIRE Algorithm Enhancements, as set forth in the NRC IAA NRC-HQ-60-17-T-0007 for the period of June 2020 through June 2021.

97 MATHEMATICS AND COMPUTING↗