Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “generalized 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 271 records · Page 15

Extending High-Level Synthesis with AI/ML Methods

Artificial Intelligence (AI) and Machine Learning (ML) methods provide significant opportunities of improving quality of results when performing high-level synthesis (HLS). For example, they can be used to model and predict metrics of the final design (e.g., area, considering aspects such as interconnect overhead for different device technologies), facilitating exploration when searching for the best design trade-offs. They can also enable identifying hidden correlations across the various phases of the synthesis and the various optimizations performed, identifying the most effective pipelines. Finally, in more general terms, bio-inspired heuristic algorithms can improve the design space exploration for the synthesis process in terms of time and quality of the result. This paper discusses opportunities and challenges to augment HLS with AI/ML using as example flow the SODA Synthesizer, an open-source hardware generation toolchain which includes SODA-OPT, a hardware/software partitioning and pre-optimization tool developed with the MLIR framework, and PandA-Bambu, a state-of-the art HLS tool. SODA interfaces with OpenROAD to provide a complete end-to-end toolchain.

artificial intelligence↗

Measuring an ultrashort, ultraviolet pulse in a slowly responding, absorbing medium

Frequency-resolved optical gating (FROG) is a common technique for measuring ultrashort laser pulses using an instantaneous, nonlinear-optical interaction as a fast time-gate to measure the pulse intensity and phase. But at high frequencies, materials are often absorbing and it is not always possible to find a medium with a fast nonlinear-optical response. Here we show that an ultrashort, ultraviolet (UV) pulse can be measured in a strongly absorbing medium, using the absorption as the nonlinear-optical time-gate. To do this, we build on our recent implementation of FROG, known as induced-grating cross-correlation FROG (IG XFROG), where an unknown, higher-frequency pulse creates a transient grating that is probed with a lower-frequency, more easily detectable reference pulse. We demonstrate this with an 800 nm reference pulse to characterize 400 nm or 267 nm pulses using ZnS as the nonlinear-optical medium, which is absorptive at and below 400 nm. By scanning the delay between the two UV pulses which create the transient grating, we show that the phase-sensitive instantaneous four-wave-mixing contribution to the nonlinear signal field can be detected and separated from the slower, incoherent part of the response. Measuring a spectrally-resolved cross-correlation in this way and then applying a simple model for the response of the medium, we show that a modified generalized projections (GP) phase-retrieval algorithm can be used to extract the pulse amplitude and phase. We test this approach by measuring chirped UV pulses centered at 400 nm and 267 nm. Since interband absorption (or even photoionization) is not strongly wavelength-dependent, we expect IG XFROG to be applicable deeper into the UV.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

TBASS: A Robust Adaptation of Bayesian Adaptive Spline Surfaces

The R package TBASS is an extension of the BASS package created by Francom and Sansó (2019). The package is used to fit a Bayesian multivariate adaptive spline to a dataset that either follows a Student’s t-distribution or has outliers. Much of the framework for TBASS is adapted from the concepts of Bayesian Multivariate Adaptive Regression Splines (BMARS), specifically the work done by Denison, Mallick, and Smith (1998). The spline function is fit using a Reversible-Jump Markov Chain Monte Carlo algorithm,. By including this more robust generalization, a dataset with outliers can be accurately fit using the BMARS model, without the possibility of overfitting or variance inflation.

97 MATHEMATICS AND COMPUTING↗

State-of-the-Art Reactor Consequence Analysis Project: Sensitivity Analysis Using Dakota

The State-of-the-Art Reactor Consequence Analyses (SOARCA) project has focused on best estimate analyses and uncertainty analysis for postulated accidents at specific nuclear power plants. The consequences of these accidents are estimated using the simulation tools MELCOR and MACCS. To understand which uncertain input variables are important to determining these consequences, analysts have performed sensitivity analyses. The tool used to perform these sensitivity analyses in previous SOARCA work, CompModSA, is no longer supported. Therefore, the current work focuses on migrating these analyses to another tool and evaluating its performance. Dakota, which is a tool developed at Sandia National Laboratories, is used in this work. Sensitivity results are created for three analyses from the SOARCA Surry UA. Though CompModSA and Dakota vary slightly in their algorithms and implementation, their sensitivity results generally agree, which gives confidence in the Dakota approach and increases confidence in the original analyses. It is likely that this methodology is extendable to the rest of SOARCA analyses.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Quantum Algorithm for Simulating Hamiltonian Dynamics with an Off-diagonal Series Expansion

We propose an efficient quantum algorithm for simulating the dynamics of general Hamiltonian systems. Our technique is based on a power series expansion of the time-evolution operator in its off-diagonal terms. The expansion decouples the dynamics due to the diagonal component of the Hamiltonian from the dynamics generated by its off-diagonal part, which we encode using the linear combination of unitaries technique. Our method has an optimal dependence on the desired precision and, as we illustrate, generally requires considerably fewer resources than the current state-of-the-art. We provide an analysis of resource costs for several sample models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Integration of Soft Data Into Geostatistical Simulation of Categorical Variables

Uncertain or indirect “soft” data, such as geologic interpretation, driller’s logs, geophysical logs or imaging, offer potential constraints or “soft conditioning” to stochastic models of discrete categorical subsurface variables in hydrogeology such as hydrofacies. Previous bivariate geostatistical simulation algorithms have not fully addressed the impact of data uncertainty in formulation of the (co) kriging equations and the objective function in simulated annealing (or quenching). This paper introduces the geostatistical simulation code tsim-s, which accounts for categorical data uncertainty through a data “hardness” parameter. In generating geostatistical realizations with tsim-s, the uncertainty inherent to soft conditioning is factored into both 1) the data declustering and spatial correlation functions in cokriging and 2) the acceptance probability for change of category in simulated quenching. The degree or sensitivity to which soft data conditions a realization as a function of hardness can be quantified by mapping category probabilities derived from multiple realizations. In addition to point or borehole data, arrays of data (e.g., as derived from a depth-dependency function, probability map, or “prior realization”) can be used as soft conditioning. The tsim-s algorithm provides a theoretically sound and general framework for integrating datasets of variable location, resolution, and uncertainty into geostatistical simulation of categorical variables. A practical example shows how tsim-s is capable of generating a large-scale three-dimensional simulation including curvilinear features.

54 ENVIRONMENTAL SCIENCES↗

Reliable Determination of Pulses and Pulse-Shape Instability in Ultrashort Laser Pulse Trains Using Polarization-Gating and Transient-Grating Frequency-Resolved Optical Gating Using the RANA Approach

Devices that measure the presence of instability in the pulse shapes in trains of ultrashort laser pulses do not exist, so this task necessarily falls to pulse-measurement devices, like Frequency-Resolved Optical Gating (FROG) and its variations, which have proven to be a highly reliable class of techniques for measuring stable trains of ultrashort laser pulses. Fortunately, multi-shot versions of FROG have also been shown to sensitively distinguish trains of stable from those of unstable pulse shapes by displaying readily visible systematic discrepancies between the measured and retrieved traces in the presence of unstable pulse trains. However, the effects of pulse-shape instability and algorithm stagnation can be indistinguishable, so a never-stagnating algorithm—even when instability is present—is required and is generally important. In previous work, we demonstrated that our recently introduced Retrieved-Amplitude N-grid Algorithmic (RANA) approach produces highly reliable (100%) pulse-retrieval in the second-harmonic-generation (SHG) version of FROG for thousands of sample trains of pulses with stable pulse shapes. Further, it does so even for trains of unstable pulse shapes and thus both reliably distinguishes between the two cases and provides a rough measure of the degree of instability as well as a reasonable estimate of most typical pulse parameters. Here, we perform the analogous study for the polarization-gating (PG) and transient-grating (TG) versions of FROG, which are often used for higher-energy pulse trains. We conclude that PG and TG FROG, coupled with the RANA approach, also provide reliable indicators of pulse-shape instability. In addition, for PG and TG FROG, the RANA approach provides an even better estimate of a typical pulse in an unstable pulse train than SHG FROG does, even in cases of significant pulse-shape instability.

47 OTHER INSTRUMENTATION↗

Fouling modeling and prediction approach for heat exchangers using deep learning

In this article, we develop a generalized and scalable statistical model for accurate prediction of fouling resistance using commonly measured parameters of industrial heat exchangers. This prediction model is based on deep learning where a scalable algorithmic architecture learns non-linear functional relationships between a set of target and predictor variables from large number of training samples. Here, the efficacy of this modeling approach is demonstrated for predicting fouling in an analytically modeled cross-flow heat exchanger, designed for waste heat recovery from flue-gas using room temperature water. The performance results of the trained models demonstrate that the mean absolute prediction errors are under 10 –4 KW –1 for flue-gas side, water side and overall fouling resistances. The coefficients of determination (R 2 ), which characterize the goodness of fit between the predictions and observed data, are over 99%. Even under varying levels of measurement noise in the inputs, we demonstrate that predictions over an ensemble of multiple neural networks achieves better accuracy and robustness to noise. We find that the proposed deep-learning fouling prediction framework learns to follow heat exchanger flow and heat transfer physics, which we confirm using locally interpretable model agnostic explanations around randomly selected operating points. Overall, we provide a robust algorithmic framework for fouling prediction that can be generalized and scaled to various types of industrial heat exchangers.

42 ENGINEERING↗

Per-Phase and 3-Phase Optimal Coordination of Directional Overcurrent Relays Using Genetic Algorithm

Penetration of the power grid by renewable energy sources, distributed storage, and distributed generators is becoming increasingly common. Increased utilization of these distributed energy resources (DERs) has given rise to additional protection coordination concerns, particularly where they are utilized in an unbalanced manner or where loading among phases is unbalanced. Digital relays such as the SEL-751 (produced by Schweitzer Engineering Laboratories, Pullman, WA, USA) series have the capability of being set on a per-phase basis. This capability is underutilized in common practice. Additionally, in optimization algorithms for determining relay settings, the time-overcurrent characteristics (TOCs) of relays are generally not treated as variables and are assigned before running the optimization algorithm. In this paper, TOC options themselves are treated as discrete variables to be considered in the optimization algorithm. A mixed integer nonlinear programming problem (MINLP) is set up where the goal is to minimize relay operating times. A genetic algorithm (GA) approach is implemented in MATLAB where two cases are considered. In the first case, the TOC and Time dial setting (TDS) of each relay is set on a three-phase basis. In the second case, per-phase settings are considered. Relay TDSs and TOCs are both considered as simultaneous discrete control variables. Despite the stochastic nature of using per-phase settings for unbalanced systems is found to generally allow for shorter operating times. However, for relatively balanced systems, it is best to use three-phase settings if computation time is of importance.

Matthews, Ronald C.↗

U(1) fields from qubits: An approach via D-theory algebra

A new quantum link microstructure was proposed for the lattice quantum chromodynamics (QCD) Hamiltonian, replacing the Wilson gauge links with a bilinear of fermionic qubits, later generalized to D-theory. This formalism provides a general framework for building lattice field theory algorithms for quantum computing. We focus mostly on the simplest case of a quantum rotor for a single compact U(1) field. We also make some progress for non-Abelian setups, making it clear that the ideas developed in the U(1) case extend to other groups. These in turn are building blocks for 1 + 0 -dimensional ( 1 + 0 -D) matrix models, 1 + 1 -D sigma models and non-Abelian gauge theories in 2 + 1 and 3 + 1 dimensions. By introducing multiple flavors for the U(1) field, where the flavor symmetry is gauged, we can efficiently approach the infinite-dimensional Hilbert space of the quantum O(2) rotor with increasing flavors. The emphasis of the method is on preserving the symplectic algebra exchanging fermionic qubits by sigma matrices (or hard bosons) and developing a formal strategy capable of generalization to a SU ( 3 ) field for lattice QCD and other non-Abelian 1 + 1 -D sigma models or 3 + 1 -D gauge theories. For U(1), we discuss briefly the qubit algorithms for the study of the discrete 1 + 1 -D sine-Gordon equation. Published by the American Physical Society 2024

Astronomy & Astrophysics↗

Leveraging Randomized Compiling for the QITE Algorithm

The success of the current generation of Noisy Intermediate-Scale Quantum (NISQ) hardware shows that quantum hardware may be able to tackle complex problems even without error correction. One outstanding issue is that of coherent errors arising from the increased complexity of these devices. These errors can accumulate through a circuit, making their impact on algorithms hard to predict and mitigate. Iterative algorithms like Quantum Imaginary Time Evolution are susceptible to these errors. This article presents the combination of both noise tailoring using Randomized Compiling and error mitigation with a purification. We also show that Cycle Benchmarking gives an estimate of the reliability of the purification. We apply this method to the Quantum Imaginary Time Evolution of a Transverse Field Ising Model and report an energy estimation and a ground state infidelity both below 1\%. Our methodology is general and can be used for other algorithms and platforms. We show how combining noise tailoring and error mitigation will push forward the performance of NISQ devices.

Ville, Jean-Loup↗

Estimating mass-absorption cross-section of ambient black carbon aerosols: theoretical, empirical, and machine learning models

The mass-absorption cross-section of black carbon (MAC BC ) is an essential parameter to link the atmospheric concentration of black carbon (BC) with its radiative forcing. When a direct calculation of MAC BC based on observations of aerosol light absorption and BC mass concentration is impossible, we rely on modeling and simulations to estimate MAC BC , but currently, there is no consensus model that can be relied on for accurate predictions across all atmospheric environments when BC particles have different coating thicknesses. Here, we applied five MAC BC prediction models (including three light scattering theories, an empirical model based on observations of particle mass concentrations, and a machine learning model developed in our previous work) to aerosols from three Department of Energy (DOE) Atmospheric Radiation Measurement (ARM) field campaigns. While many studies have found that increasing the complexity of the models helps to constrain biases of the estimated MAC BC , our effort is to evaluate the models based on the criteria of simplicity and accuracy. We find that our machine learning model (support vector machine for regression, SVM) generally performs well across all DOE ARM field campaign data, while the accuracy of core-shell Mie theory depends on the bias correction algorithm applied to filter-based light absorption data. Generally, the empirical model for internally-mixed particles that we considered tends to over-predict MAC BC , while Mie theory for externally-mixed particles tends to under-predict MAC BC . An examination of the influence of coating material on BC cores suggests that the performance of our current SVM model is degraded when the BC is thickly-coated (e.g., it has undergone aging and mixing with other materials in the atmosphere).

54 ENVIRONMENTAL SCIENCES↗

Real space iterative reconstruction for vector tomography (RESIRE-V)

Tomography has had an important impact on the physical, biological, and medical sciences. To date, most tomographic applications have been focused on 3D scalar reconstructions. However, in some crucial applications, vector tomography is required to reconstruct 3D vector fields such as the electric and magnetic fields. Over the years, several vector tomography methods have been developed. Here, we present the mathematical foundation and algorithmic implementation of REal Space Iterative REconstruction for Vector tomography, termed RESIRE-V. RESIRE-V uses multiple tilt series of projections and iterates between the projections and a 3D reconstruction. Each iteration consists of a forward step using the Radon transform and a backward step using its transpose, then updates the object via gradient descent. Incorporating with a 3D support constraint, the algorithm iteratively minimizes an error metric, defined as the difference between the measured and calculated projections. The algorithm can also be used to refine the tilt angles and further improve the 3D reconstruction. To validate RESIRE-V, we first apply it to a simulated data set of the 3D magnetization vector field, consisting of two orthogonal tilt series, each with a missing wedge. Our quantitative analysis shows that the three components of the reconstructed magnetization vector field agree well with the ground-truth counterparts. We then use RESIRE-V to reconstruct the 3D magnetization vector field of a ferromagnetic meta-lattice consisting of three tilt series. Our 3D vector reconstruction reveals the existence of topological magnetic defects with positive and negative charges. We expect that RESIRE-V can be incorporated into different imaging modalities as a general vector tomography method. To make the algorithm accessible to a broad user community, we have made our RESIRE-V MATLAB source codes and the data freely available at https://github.com/minhpham0309/RESIRE-V.

47 OTHER INSTRUMENTATION↗

Adaptive pruning-based optimization of parameterized quantum circuits

Abstract Variational hybrid quantum–classical algorithms are powerful tools to maximize the use of noisy intermediate-scale quantum devices. While past studies have developed powerful and expressive ansatze, their near-term applications have been limited by the difficulty of optimizing in the vast parameter space. In this work, we propose a heuristic optimization strategy for such ansatze used in variational quantum algorithms, which we call ‘parameter-efficient circuit training (PECT)’. Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms, in which each iteration of the algorithm activates and optimizes a subset of the total parameter set. To update the parameter subset between iterations, we adapt the Dynamic Sparse Reparameterization scheme which was originally proposed for training deep convolutional neural networks. We demonstrate PECT for the Variational Quantum Eigensolver, in which we benchmark unitary coupled-cluster ansatze including UCCSD and k -UpCCGSD, as well as the Low-Depth Circuit Ansatz (LDCA), to estimate ground state energies of molecular systems. We additionally use a layerwise variant of PECT to optimize a hardware-efficient circuit for the Sycamore processor to estimate the ground state energy densities of the one-dimensional Fermi-Hubbard model. From our numerical data, we find that PECT can enable optimizations of certain ansatze that were previously difficult to converge and more generally can improve the performance of variational algorithms by reducing the optimization runtime and/or the depth of circuits that encode the solution candidate(s).

Physics↗

Satellite-based evaluation of AeroCom model bias in biomass burning regions

Global models are widely used to simulate biomass burning aerosol (BBA). Exhaustive evaluations on model representation of aerosol distributions and properties are fundamental to assess health and climate impacts of BBA. Here we conducted a comprehensive comparison of Aerosol Comparisons between Observations and Models (AeroCom) project model simulations with satellite observations. A total of 59 runs by 18 models from three AeroCom Phase-III experiments (i.e., biomass burning emissions, CTRL16, and CTRL19) and 14 satellite products of aerosols were used in the study. Aerosol optical depth (AOD) at 550 nm was investigated during the fire season over three key fire regions reflecting different fire dynamics (i.e., deforestation-dominated Amazon, Southern Hemisphere Africa where savannas are the key source of emissions, and boreal forest burning in boreal North America). The 14 satellite products were first evaluated against AErosol RObotic NETwork (AERONET) observations, with large uncertainties found. But these uncertainties had small impacts on the model evaluation that was dominated by modeling bias. Through a comparison with Polarization and Directionality of the Earth’s Reflectances measurements with the Generalized Retrieval of Aerosol and Surface Properties algorithm (POLDER-GRASP), we found that the modeled AOD values were biased by –93 % to 152 %, with most models showing significant underestimations even for the state-of-the-art aerosol modeling techniques (i.e., CTRL19). By scaling up BBA emissions, the negative biases in modeled AOD were significantly mitigated, although it yielded only negligible improvements in the correlation between models and observations, and the spatial and temporal variations in AOD biases did not change much. For models in CTRL16 and CTRL19, the large diversity in modeled AOD was in almost equal measures caused by diversity in emissions, lifetime, and the mass extinction coefficient (MEC). We found that in the AeroCom ensemble, BBA lifetime correlated significantly with particle deposition (as expected) and in turn correlated strongly with precipitation. Additional analysis based on Cloud-Aerosol LIdar with Orthogonal Polarization (CALIOP) aerosol profiles suggested that the altitude of the aerosol layer in the current models was generally too low, which also contributed to the bias in modeled lifetime. Modeled MECs exhibited significant correlations with the Ångström exponent (AE, an indicator of particle size). Comparisons with the POLDER-GRASP-observed AE suggested that the models tended to overestimate the AE (underestimated particle size), indicating a possible underestimation of MECs in models. The hygroscopic growth in most models generally agreed with observations and might not explain the overall underestimation of modeled AOD. Our results imply that current global models contain biases in important aerosol processes for BBA (e.g., emissions, removal, and optical properties) that remain to be addressed in future research.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Multilevel Combinatorial Optimization across Quantum Architectures

Emerging quantum processors provide an opportunity to explore new approaches for solving traditional problems in the post Moore’s law supercomputing era. However, the limited number of qubits makes it infeasible to tackle massive real-world datasets directly in the near future, leading to new challenges in utilizing these quantum processors for practical purposes. Furthermore, hybrid quantum-classical algorithms that leverage both quantum and classical types of devices are considered as one of the main strategies to apply quantum computing to large-scale problems. In this article, we advocate the use of multilevel frameworks for combinatorial optimization as a promising general paradigm for designing hybrid quantum-classical algorithms. To demonstrate this approach, we apply this method to two well-known combinatorial optimization problems, namely, the Graph Partitioning Problem, and the Community Detection Problem. We develop hybrid multilevel solvers with quantum local search on D-Wave’s quantum annealer and IBM’s gate-model based quantum processor. We carry out experiments on graphs that are orders of magnitude larger than the current quantum hardware size, and we observe results comparable to state-of-the-art solvers in terms of quality of the solution.

97 MATHEMATICS AND COMPUTING↗

Fuzzy Simplicial Networks: A Topology-Inspired Model to Improve Task Generalization in Few-shot Learning

Deep learning has shown great success in settings with massive amounts of data but has struggled when data is limited. Few-shot learning algorithms, which seek to address this limitation, are designed to generalize well to new tasks with limited data. Typically, models are evaluated on unseen classes and datasets that are defined by the same fundamental task as they are trained for (e.g. category membership). One can also ask how well a model can generalize to fundamentally different tasks within a fixed dataset (for example: moving from category membership to tasks that involve detecting object orientation or quantity). To formalize this kind of shift we define a notion of “independence of tasks” and identify three new sets of labels for established computer vision datasets that test a model's ability to generalize to tasks which draw on orthogonal attributes in the data. We use these datasets to investigate the failure modes of metric-based few-shot models. Based on our findings, we introduce a new few-shot model called Fuzzy Simplicial Networks (FSN) which leverages a construction from topology to more flexibly represent each class from limited data. In particular, FSN models can not only form multiple representations for a given class but can also begin to capture the low-dimensional structure which characterizes class manifolds in the encoded space of deep networks. We show that FSN outperforms state-of-the-art models on the challenging tasks we introduce in this paper while remaining competitive on standard few-shot benchmarks.

deep learning↗