Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distributed algorithm”

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 793 records · Page 44

Aerosol Vertical Turbulent Mass Flux Retrievals Through Novel Remote Sensing Algorithm

Abstract Integrated measurements of aerosol, radiation, cloud, and turbulent transport in the planetary boundary layer (PBL) are essential for understanding and modeling climate and air quality. Here, we developed a new technique for the identification of convective turbulent regions and deriving the vertical distribution of aerosol turbulent mass fluxes within PBL. The algorithm uses retrievals from coherent Doppler lidars and a high spectral resolution lidar. The technique was applied to study particle mass fluxes over 2 months (November–December 2020) during the campaign conducted at the DOE Atmospheric Radiation Measurement Southern Great Plains (SGP) site in Lamont, Oklahoma. The algorithm developed here is capable of continuously deriving vertically resolved (curtains) aerosol mass fluxes. Our data analysis shows that at the site, the 30‐min averaged fluxes at 135 m above the surface were mainly positive (upward) at ∼1 μg m −2 s −1 , suggesting that the surface is the primary source of the particle mass supplied to the boundary layer at the SGP site. Analyses of the individual case studies have revealed that not all the derived fluxes can be linked to surface emissions. Both positive and negative values in a range of ±5 μg m −2 s −1 can be caused by convective thermals interacting between the residual layer and the mixed layer and by rotation of the horizontal wind with the height. Large erroneous negative fluxes can also be caused by drizzling/precipitating clouds. We anticipate that the application of the current technique will lead to a more realistic representation of aerosol mass budgets and bidirectional mixing rates.

54 ENVIRONMENTAL SCIENCES↗

Experimental Investigation of Pool Boiling Heat Transfer Enhancement in Microgravity in the Presence of Electric Fields

In boiling high heat fluxes are possible driven by relatively small temperature differences, which make its use increasingly attractive in aerospace applications. The objective of the research is to develop ways to overcome specific problems associated with boiling in the low gravity environment by substituting the buoyancy force with the electric force to enhance bubble removal from the heated surface. Previous studies indicate that in terrestrial applications nucleate boiling heat transfer can be increased by a factor of 50, as compared to values obtained for the same system without electric fields. The goal of our research is to experimentally explore the mechanisms responsible for EHD heat transfer enhancement in boiling in low gravity conditions, by visualizing the temperature distributions in the vicinity of the heated surface and around the bubble during boiling using real-time holographic interferometry (HI) combined with high-speed cinematography. In the first phase of the project the influence of the electric field on a single bubble is investigated. Pool boiling is simulated by injecting a single bubble through a nozzle into the subcooled liquid or into the thermal boundary layer developed along the flat heater surface. Since the exact location of bubble formation is known, the optical equipment can be aligned and focused accurately, which is an essential requirement for precision measurements of bubble shape, size and deformation, as well as the visualization of temperature fields by HI. The size of the bubble and the frequency of bubble departure can be controlled by suitable selection of nozzle diameter and mass flow rate of vapor. In this approach effects due to the presence of the electric field can be separated from effects caused by the temperature gradients in the thermal boundary layer. The influence of the thermal boundary layer can be investigated after activating the heater at a later stage of the research. For the visualization experiments a test cell was developed. All four vertical walls of the test cell are transparent, and they allow transillumination with laser light for visualization experiments by HI. The bottom electrode is a copper cylinder, which is electrically grounded. The copper block is heated with a resistive heater and it is equipped with 6 thermocouples that provide reference temperatures for the measurements with HI. The top electrode is a mesh electrode. Bubbles are injected with a syringe into the test cell through the bottom electrode. The working fluids presently used in the interferometric visualization experiments, water and PF 5052, satisfy requirements regarding thermophysical, optical and electrical properties. A 30kV power supply equipped with a voltmeter allows to apply the electric field to the electrodes during the experiments. The magnitude of the applied voltage can be adjusted either manually or through the LabVIEW data acquisition and control system connected to a PC. Temperatures of the heated block are recorded using type-T thermocouples, whose output is read by a data acquisition system. Images of the bubbles are recorded with 35mm photographic and 16mm high-speed cameras, scanned and analyzed using various software packages. Visualized temperature fields HI allows the visualization of temperature fields in the vicinity of bubbles during boiling in the form of fringes. Typical visualized temperature distributions around the air bubbles injected into the thermal boundary layer in PF5052 are shown. The temperature of the heated surface is 35 C. The temperature difference for a pair of fringes is approximately 0.05 C. The heat flux applied to the bottom surface is moderate, and the fringe patterns are regular. In the image a bubble penetrating the thermal boundary layer is visible. Because of the axial symmetry of the problem, simplified reconstruction techniques can be applied to recover the temperature field. The thermal plume developing above the heated surface for more intensive heating is shown. The temperature distribution in the liquid is clearly 3D, and tomographic techniques have to be applied to recover the temperature distribution in such a physical situation. A sequence of interferometric images showing the temperature distribution around the rising bubble, recorded with a high-speed camera is shown. Again, the temperature distribution is 3D, and a more complex approach to the evaluation, the tomographic reconstruction has to be taken. Measurement of the temperature distribution from the fringe pattern temperature distributions that yield important information regarding heat transfer are determined. Two algorithms that allow the quantitative evaluation of interferometric fringe patterns and the reconstruction of temperature fields during boiling have been developed at the Heat Transfer Laboratory of the Johns Hopkins University. In the first algorithm the bubble is assumed to be axially symmetrical, which significantly reduces the computational effort for quantifying the temperature distribution around the bubble. For this purpose the thermal boundary layer around the bubble is divided into equidistant concentric shells, and the refractive index is assumed to be constant in each of the shells. Since large temperature gradients are expected in the vicinity of the bubble during boiling, the deflection of the light beam cannot be neglected in boiling experiments. Since the exit angle of the light beam is known, this allows to account for the deflections and phase shifts outside the boundary layer (in the bulk fluid and in the windows of the test cell). Three dimensional temperature distributions in the vicinity of the bubble are reconstructed using tomographic techniques. In tomography, the measurement volume is sliced into 2D planes. In the present study these planes are parallel to the heated surface. The objective is to determine the values of the field parameter of interest in form of the field function in these 2D planes. The field parameter is the change of the refractive index of the liquid in the measurement volume caused by temperature changes. By superimposing data for many 2D planes recorded at the same time instant, the 3D temperature distribution in the measurement volume is recovered.

Herman, Cila↗

Semantic embedding for quantum algorithms

The study of classical algorithms is supported by an immense understructure, founded in logic, type, and category theory, that allows an algorithmist to reason about the sequential manipulation of data irrespective of a computation’s realizing dynamics. As quantum computing matures, a similar need has developed for an assurance of the correctness of high-level quantum algorithmic reasoning. Parallel to this need, many quantum algorithms have been unified and improved using quantum signal processing (QSP) and quantum singular value transformation (QSVT), which characterize the ability, by alternating circuit ansätze, to transform the singular values of sub-blocks of unitary matrices by polynomial functions. However, while the algebraic manipulation of polynomials is simple (e.g., compositions and products), the QSP/QSVT circuits realizing analogous manipulations of their embedded polynomials are non-obvious. This work constructs and characterizes the runtime and expressivity of QSP/QSVT protocols where circuit manipulation maps naturally to the algebraic manipulation of functional transforms (termed semantic embedding). In this way, QSP/QSVT can be treated and combined modularly, purely in terms of the functional transforms they embed, with key guarantees on the computability and modularity of the realizing circuits. We also identify existing quantum algorithms whose use of semantic embedding is implicit, spanning from distributed search to proofs of soundness in quantum cryptography. The methods used, based in category theory, establish a theory of semantically embeddable quantum algorithms, and provide a new role for QSP/QSVT in reducing sophisticated algorithmic problems to simpler algebraic ones.

Physics↗

Motion Planning Algorithms for Safety and Quantum Computing Efficiency

Motion planning remains a fundamental problem in robotics. Sampling-based algorithms use randomization to allow efficient solutions to this complex problem. As mobile robots and autonomous vehicles become more prevalent in everyday life, motion planning must be applied to increasingly challenging scenarios. Safety has become a paramount concern in motion planning for ensuring robotic applications enrich human lives. To date, many motion planning techniques to increase safety in the face of uncertain and dynamic environments have been developed. This dissertation first addresses distributional safety of Rapidly-Exploring Random Trees (RRT) through our algorithm W-Safe RRT. To acknowledge distributional uncertainty and poor modeling, W-Safe RRT uses the Wasserstein metric to provide a probabilistic bound on the distributional distance between a robot and obstacles. Human-interpretable environmental agent classification allows online safety margin adaptation. We propose and analyze an integrating region method for online classification that increases actor labeling accuracy based on behavioral feature values when compared to state of the art methods. The method performs class assignments based on local maximum likelihood in a created behavioral feature-space, allowing a notion of classification uncertainty. Model-based methods with safety guarantees can quickly become computationally in tractable, especially with multiple agents, higher dimensions, and plentiful unknowns. Sampling based algorithms have been parallelized for computation with multi-core computers and GPUs. We consider the use of quantum algorithms and computers for sampling-based motion planning for the first time. Quantum computing performs operations on superpositions of states and can solve certain problems much more efficiently than classical computers, but introduces previously unseen challenges. With Quantum-RRT, we recast the motion planning problem into a database-search structure and use Quantum Amplitude Amplification to find reachable states in the database with a quadratic performance increase over classical methods. We address two error sources with this method: quantum measurement and quantum oracle errors. We then extend this method to Parallel Quantum-RRT, which uses a manager-worker architecture with multiple parallel quantum workers to increase database search efficiency. We compare algorithm architectures and characterize probabilities of multiple workers finding solutions. Lastly, we test in simulation the quantum algorithms against classical versions in a wide variety of scenarios, concluding that a similar parallelization improvement is to be found in the quantum case as was found in the parallelization of classical RRT.

97 MATHEMATICS AND COMPUTING↗

Quantifying the impact of temporal analysis of products reactor initial state uncertainties on kinetic parameters

The temporal analysis of products (TAP) reactor, a transient kinetic tool, provides users with information as the catalyst state evolves. However, the state of the art for TAP uncertainty quantification only considers the experimental noise present in the outlet flow signal. Additional sources of uncertainty, including, but not limited to, initial surface coverages, the catalyst zone location, the inert void fraction, and the gas pulse intensity and pulse delay, are not included. For this reason, a framework for quantifying all uncertainty sources present in TAP experiments is presented and applied to a carbon monoxide oxidation case study. Herein, two methods for quantifying these sources of uncertainty are introduced. The first utilizes initial state sensitivities to approximate the parameter variances, as well as to provide insights into the structural certainty of the model. The second generates parameter confidence distributions through an ensemble-based sampling algorithm. This initial state covariance matrix can ultimately be merged with the experimental noise covariance matrix, providing a unified description of the parameter uncertainties for a single TAP experiment.

36 MATERIALS SCIENCE↗

Bayesian sparse learning with preconditioned stochastic gradient MCMC and its applications

Deep neural networks have been successfully employed in an extensive variety of research areas, including solving partial differential equations. Despite its significant success, there are some challenges in effectively training DNN, such as avoiding overfitting in over-parameterized DNNs and accelerating the optimization in DNNs with pathological curvature. Here, we propose a Bayesian type sparse deep learning algorithm. The algorithm utilizes a set of spike-and-slab priors for the parameters in the deep neural network. The hierarchical Bayesian mixture will be trained using an adaptive empirical method. That is, one will alternatively sample from the posterior using preconditioned stochastic gradient Langevin Dynamics (PSGLD), and optimize the latent variables via stochastic approximation. The sparsity of the network is achieved while optimizing the hyperparameters with adaptive searching and penalizing. A popular SG-MCMC approach is Stochastic gradient Langevin dynamics (SGLD). However, considering the complex geometry in the model parameter space in nonconvex learning, updating parameters using a universal step size in each component as in SGLD may cause slow mixing. To address this issue, we apply a computationally manageable preconditioner in the updating rule, which provides a step-size parameter to adapt to local geometric properties. Moreover, by smoothly optimizing the hyperparameter in the preconditioning matrix, our proposed algorithm ensures a decreasing bias, which is introduced by ignoring the correction term in the preconditioned SGLD. According to the existing theoretical framework, we show that the proposed algorithm can asymptotically converge to the correct distribution with a controllable bias under mild conditions. Numerical tests are performed on both synthetic regression problems and learning solutions of elliptic PDE, which demonstrate the accuracy and efficiency of the present work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An adaptive Hessian approximated stochastic gradient MCMC method

Bayesian approaches have been successfully integrated into training deep neural networks. One popular family is stochastic gradient Markov chain Monte Carlo methods (SG-MCMC), which have gained increasing interest due to their ability to handle large datasets and the potential to avoid overfitting. Although standard SG-MCMC methods have shown great performance in a variety of problems, they may be inefficient when the random variables in the target posterior densities have scale differences or are highly correlated. Here, we present an adaptive Hessian approximated stochastic gradient MCMC method to incorporate local geometric information while sampling from the posterior. The idea is to apply stochastic approximation (SA) to sequentially update a preconditioning matrix at each iteration. The preconditioner possesses second-order information and can guide the random walk of a sampler efficiently. Instead of computing and saving the full Hessian of the log posterior, we use limited memory of the samples and their stochastic gradients to approximate the inverse Hessian-vector multiplication in the updating formula. Moreover, by smoothly optimizing the preconditioning matrix via SA, our proposed algorithm can asymptotically converge to the target distribution with a controllable bias under mild conditions. To reduce the training and testing computational burden, we adopt a magnitude-based weight pruning method to enforce the sparsity of the network. Our method is user-friendly and demonstrates better learning results compared to standard SG-MCMC updating rules. The approximation of inverse Hessian alleviates storage and computational complexities for large dimensional models. Numerical experiments are performed on several problems, including sampling from 2D correlated distribution, synthetic regression problems, and learning the numerical solutions of heterogeneous elliptic PDE. The numerical results demonstrate great improvement in both the convergence rate and accuracy.

97 MATHEMATICS AND COMPUTING↗

Deep Learning for Simultaneous Inference of Hydraulic and Transport Properties

Abstract Identification of a heterogeneous conductivity field and reconstruction of a contaminant release history are key aspects of subsurface remediation. These two goals are achieved by combining model predictions with sparse and noisy hydraulic head and concentration measurements. Solution of this inverse problem is notoriously difficult due to, in part, high dimensionality of the parameter space and high computational cost of repeated forward solves. We use a convolutional adversarial autoencoder (CAAE) to parameterize a heterogeneous non‐Gaussian conductivity field via a low‐dimensional latent representation. A three‐dimensional dense convolutional encoder‐decoder (DenseED) network serves as a forward surrogate of the flow and transport model. The CAAE‐DenseED surrogate is fed into the ensemble smoother with multiple data assimilation (ESMDA) algorithm to sample from the Bayesian posterior distribution of the unknown parameters, forming a CAAE‐DenseED‐ESMDA inversion framework. The resulting CAAE‐DenseED‐ESMDA inversion strategy is used to identify a three‐dimensional contaminant source and conductivity field. A comparison of the inversion results from CAAE‐ESMDA with physical flow and transport simulator and from CAAE‐DenseED‐ESMDA shows that the latter yields accurate reconstruction results at the fraction of the computational cost of the former.

Zhou, Zitong↗

A genetic algorithm approach for reconstructing spectral content from filtered x-ray diode array spectrometers

Filtered diode array spectrometers are routinely employed to infer the temporal evolution of spectral power from x-ray sources, but uniquely extracting spectral content from a finite set of broad, spectrally overlapping channel spectral sensitivities is decidedly nontrivial in these under-determined systems. Here, we present the use of genetic algorithms to reconstruct a probabilistic spectral intensity distribution and compare to the traditional approach most commonly found in the literature. Unlike many of the previously published models, spectral reconstructions from this approach are neither limited by basis functional forms nor do they require a priori spectral knowledge. While the original intent of such measurements was to diagnose the temporal evolution of spectral power from quasi-blackbody radiation sources—where the exact details of spectral content were not thought to be crucial—we demonstrate that this new technique can greatly enhance the utility of the diagnostic by providing more physical spectra and improved robustness to hardware configuration for even strongly non-Planckian distributions.

47 OTHER INSTRUMENTATION↗

Calculation of permanent magnet arrangements for stellarators: a linear least-squares method

A problem arising in several engineering areas is to design magnets outside a volume that produce a desired magnetic field inside it. One instance of this problem is stellarator design, where it has recently been shown that permanent magnets can provide the required shaping of the magnetic field. Here we demonstrate a robust and efficient algorithm REGCOIL_PM to calculate the spatial distribution of these permanent magnets. The procedure involves a small number of fixed-point iterations, with a linear least-squares problem solved at each step. Furthermore, the method exploits the Biot–Savart Law's exact linearity in magnetization density and approximate linearity in magnet size, for magnets far from the target region. No constraint is placed on the direction of magnetization, so Halbach solutions are found naturally, and the magnitude of the magnetization can be made uniformly equal to a target value.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Planar Transformer With Asymmetric Integrated Leakage Inductance Using Horizontal Air Gap

This article presents a novel planar-based transformer winding and core structure with controllable leakage inductance generation for integrated magnetics applications. As a result of limitations in integrated magnetics from the literature, a new approach is proposed utilizing semi-interleaved windings and controllable leakage via a leakage flux core leg featuring a horizontal air gap. Here, the proposed transformer design is analyzed via detailed reluctance modeling to determine closed-form equations for the magnetizing and asymmetrically distributed leakage inductances. Next, a genetic-algorithm-based multiobjective design optimization problem is developed, seeking to minimize the core and winding losses of the proposed transformer subject to a set of parametric and geometric constraints in a dc-ac dual-active-bridge topology for microinverter applications. The optimization was extended to include other integrated magnetic structures from the literature, where it is determined that the proposed transformer is superior from the perspectives of efficiency, footprint area, and parasitic capacitance. Based on the results of the optimization analysis, two designs with theoretical transformer California Energy Commission (CEC) efficiency drops (i.e., CEC efficiency reduction specifically due to the transformer loss mechanisms) of 1.19% and 0.83% were fabricated and evaluated for electrical and thermal performance in the proposed 40 V, 400 W microinverter.

42 ENGINEERING↗

Elga v.1

SAND2021-4635 O Elga is a software system that provides distributed and elastic computation for temporal graph algorithms. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Gabert, Kasimir↗

Dynamic Transmission Line Switching Amid Wildfire-Prone Weather Under Decision-Dependent Uncertainty

During dry and windy seasons, environmental conditions significantly increase the risk of wildfires, exposing power grids to disruptions caused by transmission line failures. Wildfire propagation exacerbates grid vulnerability, potentially leading to prolonged power outages. To address this challenge, we propose a multistage optimization model that dynamically adjusts transmission grid topology in response to wildfire propagation, aiming to develop an optimal response policy. By accounting for decision-dependent uncertainty, where line survival probabilities depend on usage, we employ distributionally robust optimization to model uncertainty in line survival distributions. We adapt the stochastic nested decomposition algorithm and derive a deterministic upper bound for its finite convergence. To enhance computational efficiency, we exploit the Lagrangian dual problem structure for a faster generation of Lagrangian cuts. Using realistic data from the California transmission grid, we demonstrate the superior performance of dynamic response policies against two-stage alternatives through a comprehensive case study. In addition, after solving the multistage formulation, we construct easy-to-implement policies that significantly reduce computational burden while maintaining good performance in real-time deployment. History: Accepted by Russell Bent, Area Editor for Network Optimization: Algorithms and Applications. Funding: This work was supported by the U.S. Department of Energy, Office of Electricity [Grant DE-AC02-05CH11231]. The work of R. Jiang was supported in part by the U.S. National Science Foundation, Division of Electrical, Communications and Cyber Systems [Grant ECCS-1845980] and the U.S. Air Force Office of Scientific Research [Grant FA9550-23-1-0323]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2025.1210 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2025.1210 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

Estrada-Garcia, Juan-Alberto↗

Integrated Design of Ultradurable, Low CO 2 Alternative Binder Systems via Machine Learning

This ARPA-E project developed a machine learning tool to use in formulation design of cementitious binders for concrete having 50% less embodied CO 2 and possessing twice the durability compared to concrete based on ordinary portland cement (OPC) binders. The technical focus was on limestone/calcined clay cement (LC3), the leading replacement for OPC. Here, hierarchical machine learning (HML) was used to model the flowability, set time, strength, and durability of LC3 concrete. This methodology identifies latent variables derived from domain knowledge and empirical models that develop an accurate model for a response surface from small datasets. For the flowability metric, particle packing was a dominant factor, while strength and durability were both strongly determined by the fraction of metakaolin and the water:solids ratio. Under constraints of water:binder ratio, material performance metrics, embodied CO 2 , and cost per tonne of OPC, multi-objective optimization was used to design binders parameterized by the mineral composition replacing OPC, particle size distributions, and water:solids ratio. The trained algorithm was able to predict multiple mixes met these performance criteria, and experimental testing validated the predictions. The model demonstrated here is relevant for North America, where pure kaolin deposits are found broadly. The approach is being taken forward into commercial application by Ansatz AI, a materials informatics company founded by PI Washburn and co-PI Poczos. Through collaborations with the cement and concrete industry, and funding from SBIR programs, a commercial software will be developed in future research.

36 MATERIALS SCIENCE↗

Inverse solution of the pseudoscalar transfer equation through nonlinear matrix inversion

Nonlinear matrix inversion operators have been developed which, applied to observed radiances, infer maximal information regarding atmospheric scattering parameters and vertical distribution of radiant sources and sinks. The algorithm has the attractive feature of noise discrimination, attributing instrumental errors to extra-atmospheric sources.

King, J. I. F.↗

Ozone Uncertainties Study Algorithm (OUSA)

An algorithm to carry out sensitivities, uncertainties and overall imprecision studies to a set of input parameters for a one dimensional steady ozone photochemistry model is described. This algorithm can be used to evaluate steady state perturbations due to point source or distributed ejection of H2O, CLX, and NOx, besides, varying the incident solar flux. This algorithm is operational on IBM OS/360-91 computer at NASA/Goddard Space Flight Center's Science and Applications Computer Center (SACC).

Bahethi, O. P.↗

Inversion of data from diffraction-limited multiwavelength remote sensors. II - Nonlinear dependence of observables on the geophysical parameters

Linear shift-invariant spatial filtering is applied to inversion of radiometric measurements of the earth in both polarizations at the following frequencies: 6.6, 10.7, 18, 21, and 37 GHz. For purposes of radiative transfer calculations at these frequencies, the state of the ocean-atmosphere system is described by a seven-parameter model. The parameters are near-surface wind speed, sea surface temperature, integrated water vapor mass, scale height of water vapor in an exponential distribution, integrated liquid water mass, height of the liquid water, and characteristic drop radius in a Best (1950) drop size distribution. Also described is a spatial filtering algorithm by means of which geophysical parameters are retrieved from measurements made over the ocean by the scanning multichannel microwave radiometer on the Nimbus 7 satellite. The parameters here are near-surface wind speed, sea surface temperature, rain rate, integrated atmospheric water vapor content, and integrated liquid water content (including rain).

Rosenkranz, P. W.↗

Generating Random Number Pairs

Algorithm generates pairs drawn from bivariate normal distribution with any desired values of two means, two standard deviations, and correlation coefficient.

Campbell, C. W.↗