Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computer 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,189 records · Page 66

Proactive Operations and Investment Planning via Stochastic Optimization to Enhance Power Systems’ Extreme Weather Resilience

We present scalable stochastic optimization approaches for improving power systems’ resilience to extreme weather events. We consider both proactive redispatch and transmission line hardening as alternatives for mitigating expected load shed due to extreme weather, resulting in large-scale stochastic linear programs (LPs) and mixed-integer linear programs (MILPs). We solve these stochastic optimization problems with progressive hedging (PH), a parallel, scenario-based decomposition algorithm. Our computational experiments indicate that our proposed method for enhancing power system resilience can provide high-quality solutions efficiently. With up to 128 scenarios on a 2,000-bus network, the operations (redispatch) and investment (hardening) resilience problems can be solved in approximately 6 min and 2 h of wall-clock time, respectively. Additionally, we solve the investment problems with up to 512 scenarios, demonstrating that the approach scales very well with the number of scenarios. Moreover, the method produces high quality solutions that result in statistically significant reductions in expected load shed. Our proposed approach can be augmented to incorporate a variety of other operational and investment resilience strategies, or a combination of such strategies.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Computer Vision-Enabled Smart Traffic Monitoring for Sustainable Transportation Management

Transportation accounts for a significant portion of total global energy consumption. Excessive energy consumption usually occurs in urban traffic environments with congestion and travel delays. With the advancement of remote sensing and computer vision technologies, real-time traffic conditions can be monitored. Therefore, sustainable transportation management strategies can be developed to optimize the overall energy and environment performance and reduce congestion and emissions. This work presents a smart traffic monitoring system based on remote camera sensors. Real-time and historical traffic conditions at the US Department of Energy’s Oak Ridge National Laboratory (ORNL) were monitored and analyzed to develop optimal transportation management strategies for sustainability. Computer vision algorithms were developed and applied to process the real-time camera data to obtain complete traffic information across the ORNL campus. Weeks of historical data were collected and processed to analyze the traffic and identify bottlenecks. The proposed traffic monitoring and management approach can be applied and extended to benefit other campuses or urban areas.

Shao, Yunli↗

AI-enabled high-resolution scanning coherent diffraction imaging

Ptychographic imaging is a powerful means of imaging beyond the resolution limits of typical x-ray optics. Capturing recovered images from raw ptychographic data, however, requires the solution of an inverse problem, namely, phase retrieval. Phase retrieval algorithms are computationally expensive, which precludes real-time imaging. In this work, we propose PtychoNN, an approach to solve the ptychography data inversion problem based on a deep convolutional neural network. We demonstrate how the proposed method can be used to predict real-space structure and phase at each scan point solely from the corresponding far-field diffraction data. Our results demonstrate the practical application of machine learning to recover high fidelity amplitude and phase contrast images of a real sample hundreds of times faster than current ptychography reconstruction packages. Furthermore, by overcoming the constraints of iterative model-based methods, we can significantly relax sampling constraints on data acquisition while still producing an excellent image of the sample. Besides drastically accelerating acquisition and analysis, this capability has profound implications for the imaging of dose sensitive, dynamic, and extremely voluminous samples.

47 OTHER INSTRUMENTATION↗

Finite-temperature many-body perturbation theory for anharmonic vibrations: Recursions, algebraic reduction, second-quantized reduction, diagrammatic rules, linked-diagram theorem, finite-temperature self-consistent field, and general-order algorithm

A unified theory is presented for finite-temperature many-body perturbation expansions of the anharmonic vibrational contributions to thermodynamic functions, i.e., the free energy, internal energy, and entropy. The theory is diagrammatically size-consistent at any order, as ensured by the linked-diagram theorem proved in this study, and, thus, applicable to molecular gases and solids on an equal footing. It is also a basis-set-free formalism, just like its underlying Bose–Einstein theory, capable of summing anharmonic effects over an infinite number of states analytically. It is formulated by the Rayleigh–Schrödinger-style recursions, generating sum-over-states formulas for the perturbation series, which unambiguously converges at the finite-temperature vibrational full-configuration-interaction limits. Two strategies are introduced to reduce these sum-over-states formulas into compact sum-over-modes analytical formulas. One is a purely algebraic method that factorizes each many-mode thermal average into a product of one-mode thermal averages, which are then evaluated by the thermal Born–Huang rules. Canonical forms of these rules are proposed, dramatically expediting the reduction process. The other is finite-temperature normal-ordered second quantization, which is fully developed in this study, including a proof of thermal Wick’s theorem and the derivation of a normal-ordered vibrational Hamiltonian at finite temperature. The latter naturally defines a finite-temperature extension of size-extensive vibrational self-consistent field theory. These reduced formulas can be represented graphically as Feynman diagrams with resolvent lines, which include anomalous and renormalization diagrams. Two order-by-order and one general-order algorithms of computing these perturbation corrections are implemented and applied up to the eighth order. The results show no signs of Kohn–Luttinger-type nonconvergence.

74 ATOMIC AND MOLECULAR PHYSICS↗

Quantitative x ray phase contrast imaging of oblique shock wave–interface interactions

Oblique shock wave–interface interactions of gases and liquids have been extensively studied in shock tubes using optical methods to measure equation-of-state (EOS) parameters. However, this is difficult with solids due to their opaqueness to visible light. X ray phase contrast imaging (XPCI) has the penetrative strength to probe solids while still being sensitive to mass density and enhancing the visibility of material boundaries. We investigate the accuracy and repeatability of measuring the mean value of the average mass density (areal density divided by thickness) over region S (B S ) and flow deflection angle (θ) from XPCI images of a sample. To that end, a Hough transform-based method for measuring θ is developed. To measure B S , the XPCI image intensity probability density function (PDF) is modeled accounting for the spatial distribution of x ray energy, scintillator response, and pulse-to-pulse variation in the x ray intensity. In addition, a Monte Carlo-based algorithm for computing the B S PDF is developed. Both methods are validated on an impact-generated oblique shock wave interacting at a solid polymer-to-polymer interface. Furthermore this is accomplished through a comparison to hydrodynamic simulations using well-established EOS. Under the modeling framework for the XPCI image intensity, B S is computed with an accuracy of < 0.1% and precision of 3%–5%, while θ has an uncertainty of 0.2°, respectively. This shows that the XPCI-based model that is developed here could be an invaluable tool for high-fidelity testing of hydrodynamic models in shock polar configurations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Adaptive tau-leaping methods for microscopic-lattice kinetic Monte Carlo simulations

Traditional Kinetic Monte Carlo (KMC) approaches, rooted in Gillespie’s stochastic simulation algorithm, become computationally demanding in systems with a large range of timescales. The goal of this work is to propose and study new adaptive lattice-KMC time integration strategies for spatially non-uniform systems. To that end, two novel adaptive tau-leaping methods and their corresponding time integration strategies are developed based on the idea of the “n-fold” direct KMC method. These strategies allow for the simultaneous execution of multiple reactions, advancing time by adaptively selected coarse increments. We present numerical experiments comparing the proposed methods with existing approaches in a catalytic surface kinetics application involving ammonia decomposition.

Bimolecular reactions↗

Automated tabletop exfoliation and identification of monolayer graphene flakes

Over the past two decades, graphene has been intensively studied because of its remarkable mechanical, optical, and electronic properties. Initial studies were enabled by manual “Scotch Tape” exfoliation; nearly two decades later, this method is still widely used to obtain chemically pristine flakes of graphene and other 2D van der Waals materials. Unfortunately, the yield of large, pristine flakes with uniform thickness is inconsistent. Thus, significant time and effort are required to exfoliate and locate flakes suitable for fabricating multilayer van der Waals heterostructures. Here, we describe a relatively affordable tabletop device (the “eXfoliator”) that can reproducibly control key parameters and largely automate the exfoliation process. In a typical exfoliation run, the eXfoliator produces 3 or more large (≥ 400 μm 2 ) high-quality graphene monolayer flakes, allowing new users to produce such flakes at a rate comparable to manual exfoliation by an experienced user. Furthermore, we use an automated mapping system and a computer vision algorithm to locate candidate flakes. Our results provide a starting point for future research efforts to identify more precisely which parameters matter for the success of exfoliation and to optimize them.

47 OTHER INSTRUMENTATION↗

Shadow molecular dynamics for flexible multipole models

Shadow molecular dynamics provide an efficient and stable atomistic simulation framework for flexible charge models with long-range electrostatic interactions. Shadow molecular dynamics simulations are driven by approximate “shadow” Born–Oppenheimer potentials for which the exact charges and forces are directly accessible without relying on costly (and approximate) iterative solvers. While previous implementations have been limited to atomic monopole charge distributions, we extend this approach to flexible multipole models. We derive detailed expressions for the shadow energy functions, potentials, and force terms, explicitly incorporating monopole–monopole, dipole–monopole, and dipole–dipole interactions. In our formulation, both atomic monopoles and atomic dipoles are treated as extended dynamical variables alongside the propagation of the nuclear degrees of freedom. We demonstrate that introducing the additional dipole degrees of freedom preserves the stability and accuracy previously seen in monopole-only shadow molecular dynamics simulations. In addition, we present a shadow molecular dynamics scheme where the monopole charges are held fixed while the dipoles remain flexible. Our extended shadow dynamics provide a framework for stable, computationally efficient, and versatile molecular dynamics simulations involving long-range interactions between flexible multipoles. This is of particular current interest in combination with machine-learned interatomic potentials, including long-range electrostatic interactions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Calibration of energy density functionals with deformed nuclei

Nuclear density functional theory is the prevalent theoretical framework for accurately describing nuclear properties at the scale of the entire chart of nuclides. Given an energy functional and a many-body scheme (e.g., single- or multireference level), the predictive power of the theory depends strongly on how the parameters of the energy functionals have been calibrated with experimental data. Expanded algorithms and computing power have enabled recent optimization protocols to include data in deformed nuclei in order to optimize the coupling constants of the energy functional. The primary motivation of this work is to test the robustness of such protocols with respect to some of the technical and numerical details of the underlying calculations, especially when the calibration explores a large parameter space. To this end, we quantify the effect of these uncertainties on both the optimization and statistical emulation of composite objective functions. We also emphasize that Bayesian calibration can provide better estimates of the theoretical errors used to define objective functions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A semblance measure for model comparison

Algorithmic and computational advances have made it possible that geophysical survey and earth model design can be aided by many systematic trial inverse-modelling runs with synthetic data. Such may, for example, come up in machine-learning approaches. Automated image appraisal pertaining to such applications will involve common statistical tests for goodness-of-data fit as a primary evaluation method. However, solution non-uniqueness may render multiple images equivalent in terms of their data fit, requiring secondary categorizers. A logical choice for classifying synthetic-imaging results quantifies the goodness of model fit where a known reference model replaces the observational input. The task of model intercomparison in terms of measuring the resemblance to the reference model poses challenges to common distance-based metrics like root mean square error and mean absolute error. First, distance-based metrics can introduce spurious contributions when smooth models with fuzzy target contours are to be compared against a sharp reference. Second, large differences due to parameter-estimation overshoots can dominate distance metrics. Here, we propose a remedy that is referred to as semblance and is based on the idea of logistic functions, where a binary-dependent variable adds non-zero or zero accumulation terms for the, respectively, passing or failing of preset target thresholds. This classifying approach is amenable to an objective where model feature recognition is primary. Numerical comparisons to distance-based metrics provide evidence for the advantages of the semblance in view of this objective. Geophysical imaging in conjunction with machine-learning is seen as a benefitting upcoming application area.

58 GEOSCIENCES↗

Analysis and optimization of seismic monitoring networks with Bayesian optimal experimental design

SUMMARY Monitoring networks increasingly aim to assimilate data from a large number of diverse sensors covering many sensing modalities. Bayesian optimal experimental design (OED) seeks to identify data, sensor configurations or experiments which can optimally reduce uncertainty and hence increase the performance of a monitoring network. Information theory guides OED by formulating the choice of experiment or sensor placement as an optimization problem that maximizes the expected information gain (EIG) about quantities of interest given prior knowledge and models of expected observation data. Therefore, within the context of seismo-acoustic monitoring, we can use Bayesian OED to configure sensor networks by choosing sensor locations, types and fidelity in order to improve our ability to identify and locate seismic sources. In this work, we develop the framework necessary to use Bayesian OED to optimize a sensor network’s ability to locate seismic events from arrival time data of detected seismic phases at the regional-scale. This framework requires five elements: (i) A likelihood function that describes the distribution of detection and traveltime data from the sensor network, (ii) A prior distribution that describes a priori belief about seismic events, (iii) A Bayesian solver that uses a prior and likelihood to identify the posterior distribution of seismic events given the data, (iv) An algorithm to compute EIG about seismic events over a data set of hypothetical prior events, (v) An optimizer that finds a sensor network which maximizes EIG. Once we have developed this framework, we explore many relevant questions to monitoring such as: how to trade off sensor fidelity and earth model uncertainty; how sensor types, number and locations influence uncertainty; and how prior models and constraints influence sensor placement.

58 GEOSCIENCES↗

Centralized Interactive Phenomics Resource: an integrated online phenomics knowledgebase for health data users

Development of clinical phenotypes from electronic health records (EHRs) can be resource intensive. Several phenotype libraries have been created to facilitate reuse of definitions. However, these platforms vary in target audience and utility. Here, we describe the development of the Centralized Interactive Phenomics Resource (CIPHER) knowledgebase, a comprehensive public-facing phenotype library, which aims to facilitate clinical and health services research. The platform was designed to collect and catalog EHR-based computable phenotype algorithms from any healthcare system, scale metadata management, facilitate phenotype discovery, and allow for integration of tools and user workflows. Phenomics experts were engaged in the development and testing of the site. The knowledgebase stores phenotype metadata using the CIPHER standard, and definitions are accessible through complex searching. Phenotypes are contributed to the knowledgebase via webform, allowing metadata validation. Data visualization tools linking to the knowledgebase enhance user interaction with content and accelerate phenotype development. The CIPHER knowledgebase was developed in the largest healthcare system in the United States and piloted with external partners. The design of the CIPHER website supports a variety of front-end tools and features to facilitate phenotype development and reuse. Health data users are encouraged to contribute their algorithms to the knowledgebase for wider dissemination to the research community, and to use the platform as a springboard for phenotyping. CIPHER is a public resource for all health data users available at https://phenomics.va.ornl.gov/ which facilitates phenotype reuse, development, and dissemination of phenotyping knowledge.

60 APPLIED LIFE SCIENCES↗

Electron tomography imaging methods with diffraction contrast for materials research

Transmission electron microscopy (TEM) and scanning transmission electron microscopy (STEM) enable the visualization of three-dimensional (3D) microstructures ranging from atomic to micrometer scales using 3D reconstruction techniques based on computed tomography algorithms. This 3D microscopy method is called electron tomography (ET) and has been utilized in the fields of materials science and engineering for more than two decades. Although atomic resolution is one of the current topics in ET research, the development and deployment of intermediate-resolution (non-atomic-resolution) ET imaging methods have garnered considerable attention from researchers. This research trend is probably not irrelevant due to the fact that the spatial resolution and functionality of 3D imaging methods of scanning electron microscopy (SEM) and X-ray microscopy have come to overlap with those of ET. In other words, there may be multiple ways to carry out 3D visualization using different microscopy methods for nanometer-scale objects in materials. From the above standpoint, this review paper aims to (i) describe the current status and issues of intermediate-resolution ET with regard to enhancing the effectiveness of TEM/STEM imaging and (ii) discuss promising applications of state-of-the-art intermediate-resolution ET for materials research with a particular focus on diffraction contrast ET for crystalline microstructures (superlattice domains and dislocations) including a demonstration of in situ dislocation tomography.

36 MATERIALS SCIENCE↗

Copacabana: a probabilistic membership assignment method for galaxy clusters

Cosmological analyses using galaxy clusters in optical/near-infrared photometric surveys require robust characterization of their galaxy content. Precisely determining which galaxies belong to a cluster is crucial. In this paper, we present the COlor Probabilistic Assignment of Clusters And BAyesiaN Analysis (Copacabana) algorithm. Copacabana computes membership probabilities for all galaxies within an aperture centred on the cluster using photometric redshifts, colours, and projected radial probability density functions. We use simulations to validate Copacabana and we show that it achieves up to 89 per cent membership accuracy with a mild dependence on photometric redshift uncertainties and choice of aperture size. We find that the precision of the photometric redshifts has the largest impact on the determination of the membership probabilities followed by the choice of the cluster aperture size. We also quantify how much these uncertainties in the membership probabilities affect the stellar mass–cluster mass scaling relation, a relation that directly impacts cosmology. Using the sum of the stellar masses weighted by membership probabilities (⁠μ * ⁠) as the observable, we find that Copacabana can reach an accuracy of 0.06 dex in the measurement of the scaling relation at low redshift for a Legacy Survey of Space and Time type survey. These results indicate the potential of Copacabana and μ * to be used in cosmological analyses of optically selected clusters in the future.

79 ASTRONOMY AND ASTROPHYSICS↗

End-to-end protocol for high-quality quantum approximate optimization algorithm parameters with few shots

The quantum approximate optimization algorithm (QAOA) is a quantum heuristic for combinatorial optimization that has been demonstrated to scale better than state-of-the-art classical solvers for some problems. For a given problem instance, QAOA performance depends crucially on the choice of the parameters. While average-case optimal parameters are available in many cases, meaningful performance gains can be obtained by fine-tuning these parameters for a given instance. This task is especially challenging, however, when the number of circuit executions (shots) is limited. In this work, we develop an end-to-end protocol that combines multiple parameter settings and fine-tuning techniques. We use large-scale numerical experiments to optimize the protocol for the shot-limited setting and observe that optimizers with the simplest internal model (linear) perform best. We implement the optimized pipeline on a trapped-ion processor using up to 32 qubits and 5 QAOA layers, and we demonstrate that the pipeline is robust to small amounts of hardware noise. To the best of our knowledge, these are the largest demonstrations of QAOA parameter fine-tuning on a trapped-ion processor in terms of two-qubit gate count.

quantum algorithms & computation↗

Faster Randomized Dynamical Decoupling

We present a randomized dynamical decoupling (DD) protocol that can substantially improve the performance of any given deterministic DD scheme for suppressing coherent noise by using no more than two additional pulses. Our construction is implemented by probabilistically applying sequences of pulses, which, when combined, effectively eliminate the error terms that scale linearly with the system-environment coupling strength. As a result, we show that a randomized protocol using a few pulses can outperform deterministic DD protocols that require considerably more pulses. Furthermore, we prove that the randomized protocol provides an improvement compared to deterministic DD sequences that aim to reduce the error in the system’s Hilbert space, such as Uhrig DD, which had been previously regarded to be optimal. To rigorously evaluate the performance, we introduce new analytical methods suitable for analyzing higher-order DD protocols that might be of independent interest. Here, we also present numerical simulations confirming the significant advantage of using randomized protocols compared to widely used deterministic protocols.

Quantum algorithms & computation↗

Ansatz-Free Hamiltonian Learning with Heisenberg-Limited Scaling

Learning the unknown interactions that govern a quantum system is crucial for quantum information processing, device benchmarking, and quantum sensing. The problem, known as Hamiltonian learning, is well understood under the assumption that interactions are local, but this assumption may not hold for arbitrary Hamiltonians. Previous methods all require high-order inverse polynomial dependency with precision, unable to surpass the standard quantum limit and reach the gold-standard Heisenberg-limited scaling. Whether Heisenberg-limited Hamiltonian learning is possible without prior assumptions about the interaction structures, a challenge we term ansatz-free Hamiltonian learning , remains an open question. In this work, we present a quantum algorithm to learn arbitrary sparse Hamiltonians without any structure constraints using only black-box queries of the system’s real-time evolution and minimal digital controls to attain Heisenberg-limited scaling in estimation error. Our method is also resilient to state-preparation-and-measurement errors, enhancing its practical feasibility. We numerically demonstrate our ansatz-free protocol for learning physical Hamiltonians and validating analog quantum simulations, benchmarking our performance against the state-of-the-art Heisenberg-limited learning approach. Moreover, we establish a fundamental trade-off between total evolution time and quantum control on learning arbitrary interactions, revealing the intrinsic interplay between controllability and total evolution-time complexity for any learning algorithm. These results pave the way for further exploration into Heisenberg-limited Hamiltonian learning in complex quantum systems under minimal assumptions, potentially enabling new benchmarking and verification protocols.

machine learning↗

Optimizing stochastic algorithms for hadron correlation function computations in lattice QCD using a localized distillation basis

Distillation is a quark-smearing method for the construction of a broad class of hadron operators useful in lattice QCD computations and defined via a projection operator into a vector space of smooth gauge-covariant fields. A new orthonormal basis for this space is constructed which builds in locality. This basis is useful for the construction of stochastic methods to estimate the correlation functions computed in Monte Carlo calculations relevant for hadronic physics.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗