Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithmic efficiency”

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,315 records · Page 73

An Easy Algorithm to Generate Colored Noise Sequences

The need for accurate and efficient simulation of the noise background arises in statistical significance tests for periodic signals buried in colored noise. This paper discusses techniques for generating colored-noise sequences which simulate processes with a given spectral density. Matlab routines based on the fast fractional difference algorithm are presented. These routines can create various stochastic models (e.g., first-order autoregressive (AR(1)), power law (PL), autoregressive fractionally integrated moving average ((1, d, 0)), and generalized Gauss Markov (GGM)) that serve as possible candidate null hypotheses to test against in various scenarios. Allan variance and power spectral density (PSD) show that our algorithms are accurate and efficient, and can be easily implemented for stationary noise models and non-stationary PLs with spectral indices up to 2. Our algorithms can also be extended to produce a non-stationary PL with a range-limited steeper PSD (spectral indices up to about 4) using a GGM approximation with a proper break frequency. The red-noise leakage effect on the periodogram is further discussed. The result shows that our GGM approximation has a potential for alleviating the red-noise leakage in the PSD estimates. The Timmer and Koenig procedure is also included for comparison.

79 ASTRONOMY AND ASTROPHYSICS↗

Comprehensive Efficiency Analysis of Current Source Inverter Based on CSI-Type Double Pulse Test and Genetic Algorithm

A current-source inverter (CSI) has a natural output voltage boost feature that can be advantageous for traction applications. Switching frequency is one of the easily-controlled variables that can be adjusted to improve the CSI efficiency at different operating points when the boost function is used. This paper investigates a CSI-based double-pulse test (DPT) measurement that mimics normal operation of the CSI. A loss model of the CSI is developed based on the CSI-type DPT experimental results. The impacts of the switching frequency and voltage boost ratio on the CSI efficiency and output voltage ripple are investigated. Based on the loss model, a genetic algorithm has been introduced that makes it possible to optimize the CSI's switching frequency and modulation index to maximize its efficiency under any desired operating condition.

current-source inverter, genetic algorithm, SPM ma↗

Application of stochastic weighted algorithms to a multidimensional silica particle model

Highlights: •Stochastic weighted algorithms (SWAs) are developed for a detailed silica model. •An implementation of SWAs with the transition kernel is presented. •The SWAs’ solutions converge to the direct simulation algorithm’s (DSA) solution. •The efficiency of SWAs is evaluated for this multidimensional particle model. •It is shown that SWAs can be used for coagulation problems in industrial systems. -- Abstract: This paper presents a detailed study of the numerical behaviour of stochastic weighted algorithms (SWAs) using the transition regime coagulation kernel and a multidimensional silica particle model. The implementation in the SWAs of the transition regime coagulation kernel and associated majorant rates is described. The silica particle model of Shekar et al. [S. Shekar, A.J. Smith, W.J. Menz, M. Sander, M. Kraft, A multidimensional population balance model to describe the aerosol synthesis of silica nanoparticles, Journal of Aerosol Science 44 (2012) 83–98] was used in conjunction with this coagulation kernel to study the convergence properties of SWAs with a multidimensional particle model. High precision solutions were calculated with two SWAs and also with the established direct simulation algorithm. These solutions, which were generated using large number of computational particles, showed close agreement. It was thus demonstrated that SWAs can be successfully used with complex coagulation kernels and high dimensional particle models to simulate real-world systems.

97 MATHEMATICS AND COMPUTING↗

User-Assisted Store Recycling for Dynamic Task Graph Schedulers

The emergence of the multi-core era has led to increased interest in designing effective yet practical parallel programming models. Models based on task graphs that operate on single-assignment data are attractive in several ways: they can support dynamic applications and precisely represent the available concurrency. However, they also require nuanced algorithms for scheduling and memory management for efficient execution. In this paper, we consider memory-efficient dynamic scheduling of task graphs. Specifically, we present a novel approach for dynamically recycling the memory locations assigned to data items as they are produced by tasks. We develop algorithms to identify memory-efficient store recycling functions by systematically evaluating the validity of a set of (user-provided or automatically generated) alternatives. Because recycling function can be input data-dependent, we have also developed support for continued correct execution of a task graph in the presence of a potentially incorrect store recycling function. Experimental evaluation demonstrates that our approach to automatic store recycling incurs little to no overheads, achieves memory usage comparable to the best manually derived solutions, often produces recycling functions valid across problem sizes and input parameters, and efficiently recovers from an incorrect choice of store recycling functions.

97 MATHEMATICS AND COMPUTING↗

Tunable thermal conductivity via domain structure engineering in ferroelectric thin films: A phase-field simulation

Effective thermal conductivity as a function of domain structure is studied by solving the heat conduction equation using a spectral iterative perturbation algorithm in materials with inhomogeneous thermal conductivity distribution. Using this proposed algorithm, the experimentally measured effective thermal conductivities of domain-engineered {001} p- BiFeO 3 thin films are quantitatively reproduced. In conjunction with two other testing examples, this proposed algorithm is proven to be an efficient tool for interpreting the relationship between the effective thermal conductivity and micro-/domain-structures. By combining this algorithm with the phase-field model of ferroelectric thin films, the effective thermal conductivity for PbZr 1-x Ti x O 3 films under different composition, thickness, strain, and working conditions is predicted. It is shown that the chemical composition, misfit strain, film thickness, film orientation, and a Piezoresponse Force Microscopy tip can be used to engineer the domain structures and tune the effective thermal conductivity. Furthermore, we expect our findings will stimulate future theoretical, experimental and engineering efforts on developing devices based on the tunable effective thermal conductivity in ferroelectric nanostructures.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

OptML

OptML is an open-source Python package that provides modeling and solution capabilities for optimization problems with embedded machine learning models. OptML is a collaborative open-source project that includes advanced algorithms from the academic community for efficient solution of these problems. Sandia contributions to this package include the development of interfaces between these algorithms and Pyomo. 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. SAND2021-10861 O

Jalving, Jordan↗

Artificial Intelligence Application to D and D - 20492

As aging facilities across the DOE complex await decommissioning, there is an ongoing need to understand any changes in the structural conditions. Many of these facilities were built over 50 years ago and, in some cases, these facilities have gone beyond the expected operational lifetime. Many facilities have been placed in a state of 'cold and dark,' sitting unused and awaiting decommissioning. Especially challenging are the aging facilities that provide unique operational/production capabilities to support critical DOE missions and cannot be shut down. In any of these scenarios, the structural integrity of these facilities may become compromised as time passes. It is critical that adequate inspections be performed on a continual basis and that the data collected undergoes sufficient analysis to support timely identification of any new or worsening structural issues as well as prompt needed maintenance and repairs to maintain the facilities in a safe condition. In recent days, Artificial Intelligence (AI) [1] and its application to various domains are growing at fast speed. FIU is performing research in this area and exploring the associated technologies to solve nuclear decommissioning problems. Artificial intelligence refers to the capability of a program to autonomously act, react and adapt to the working environment. AI enables the machine to behave like humans and perform the cognitive functions such as 'learning' and 'problem solving'. AI systems gradually moving from traditional approaches (algorithms and expert systems) towards more efficient and advanced technologies (machine learning [1] and deep learning [2] [3]). AI is the study of algorithms and statistical models that is being used by computers to perform specific tasks without using explicit instructions. FIU is working to develop a pilot-scale infrastructure to implement structural health monitoring using AI technologies with focus on machine learning, deep learning. This research is focused on Computer Vision/Image Classification area of AI applications. This can also be expanded to other areas of AI related to Object Recognition and Character Recognition in images. In addition to utilizing existing data sets, FIU will collect and investigate image and video data using FIU test-bed mockups to monitor structural health of the facility. Resulting data will be processed and analyzed using machine learning/deep learning technologies. The proposed pilot system is intended to serve as a starting point to engage the DOE field sites on related data sets and their decision making needs. It is anticipated that proposed machine learning/deep learning technologies can be effectively employed using anomaly detection to solve EM challenges in surveillance and maintenance of the D and D facilities. FIU will work with research stakeholders to identify applications at various sites and other DOE facilities. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Sampling two-dimensional isometric tensor network states

Sampling a quantum system’s underlying probability distributions is an important computational task, e.g., for quantum advantage experiments and quantum Monte Carlo algorithms. Tensor networks are an invaluable tool for efficiently representing states of large quantum systems with limited entanglement. Algorithms for sampling one-dimensional (1D) tensor networks are well-established and utilized in several 1D tensor network methods. In this paper we introduce two novel sampling algorithms for two-dimensional (2D) isometric tensor network states (isoTNS) that generalize existing 1D tensor network sampling algorithms. Our first proposed algorithm performs independent sampling and yields a single configuration together with its associated probability. The second algorithm employs a greedy search strategy to identify high-probability configurations and their corresponding probabilities. Numerical results demonstrate the effectiveness of these algorithms across quantum states with varying entanglement and system size.

Dumitrescu, Eugene [ORNL] (ORCID:0000000158519567)↗

TRANSITING PLANETS WITH LSST. II. PERIOD DETECTION OF PLANETS ORBITING 1 M{sub ⊙} HOSTS

The Large Synoptic Survey Telescope (LSST) will photometrically monitor ∼10{sup 9} stars for 10 years. The resulting light curves can be used to detect transiting exoplanets. In particular, as demonstrated by Lund et al., LSST will probe stellar populations currently undersampled in most exoplanet transit surveys, including out to extragalactic distances. In this paper we test the efficiency of the box-fitting least-squares (BLS) algorithm for accurately recovering the periods of transiting exoplanets using simulated LSST data. We model planets with a range of radii orbiting a solar-mass star at a distance of 7 kpc, with orbital periods ranging from 0.5 to 20 days. We find that standard-cadence LSST observations will be able to reliably recover the periods of Hot Jupiters with periods shorter than ∼3 days; however, it will remain a challenge to confidently distinguish these transiting planets from false positives. At the same time, we find that the LSST deep-drilling cadence is extremely powerful: the BLS algorithm successfully recovers at least 30% of sub-Saturn-size exoplanets with orbital periods as long as 20 days, and a simple BLS power criterion robustly distinguishes ∼98% of these from photometric (i.e., statistical) false positives.

79 ASTRONOMY AND ASTROPHYSICS↗

Open Energy Information System version 2.0

OpenEIS was created to provide standard methods for authoring, sharing, testing, using, and improving algorithms for operational building energy efficiency with building managers and building owners. OpenEIS is designed as a no-cost/low-cost solution that will propagate the fault detection and diagnostic (FDD) solutions into the marketplace by providing state- of- the-art analytical and diagnostic algorithms. As OpenEIS penetrates the market, demand by control system manufacturers and integrators serving small and medium commercial customers will help push these types of commercial software tool offerings into the broader marketplace.

Source record↗

Open Energy Information System version 2.0

OpenEIS was created to provide standard methods for authoring, sharing, testing, using, and improving algorithms for operational building energy efficiency with building managers and building owners. OpenEIS is designed as a no-cost/low-cost solution that will propagate the fault detection and diagnostic (FDD) solutions into the marketplace by providing state- of- the-art analytical and diagnostic algorithms. As OpenEIS penetrates the market, demand by control system manufacturers and integrators serving small and medium commercial customers will help push these types of commercial software tool offerings into the broader marketplace.

Source record↗

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↗

Cyber risk assessment and investment optimization using game theory and ML-based anomaly detection and mitigation for wide-area control in smart grids

The electric power grid is increasingly becoming susceptible to cyber attacks that exploit vulnerabilities in the smart grid control, information, and physical layers. Successful cyber attacks can have catastrophic impacts on the social and economic well-being of any nation all over the globe. It has, thus, become imperative to secure the smart grid against such adversarial actions to ensure stable, secure, and reliable operation of the grid. The existing research and industry practices prove to be inadequate in terms of providing pragmatic and effective defense methodologies and measures for long-term cybersecurity planning and real-time cybersecurity for grid operation. For example, existing works lack models that incorporate uncertain behavior of cyber-attackers and pragmatic defense measures for cyber risk assessment and cybersecurity investment optimization which often provide unreliable and strictly qualitative solutions to these problems. At the same time, with the growing number of cyber incidents in the grid, there still exists a need to develop attack-resilient algorithms for wide-area monitoring, protection, and control (WAMPAC) applications like the wide-area voltage control systems (WAVCS) for Flexible AC Transmissions Systems (FACTS) that lack in scalable and feasible solutions from the cybersecurity perspective. This dissertation proposes novel models and methodologies for: (1) Cybersecurity planning, and (2) Cybersecurity for system operation. The cybersecurity planning is achieved through cyber risk assessment and cybersecurity resource investment optimization for long-term cybersecurity of the grid using game theory and attack-defense trees. Cybersecurity for system operation consists of development of cyber anomaly detection and mitigation algorithms for flexible AC transmission system (FACTS) controller-based wide-area voltage control systems (WAVCS) using machine learning (ML), and software defined networking-based moving target defense network routing for achieving real-time cyber-physical security for grid operations. This is followed by hardware-in-the-loop (HIL) implementation and evaluation of these attack prevention, detection, and mitigation algorithms and methodologies showcasing their feasibility in a close to real-world environment. For cybersecurity planning, a novel approach involving a combination of game theory and attack defense trees (ADT) for optimal cybersecurity resource allocation in the smart grid is proposed. This methodology involves modeling of the cyber-physical smart grid substations as ADTs, defining attacker costs, defense costs, and attack probabilities for attack access points. Using game theoretical formulation, optimal defense strategies for the defender of the system to invest cybersecurity resources in the grid are obtained. Additionally, a game-theoretic framework is developed for quantitative cyber-physical risk assessment of the grid under a dynamically changing cyber threat space and uncertain behavior of cyber attackers which is further used to optimize investments in the smart grid's cybersecurity resources. The attacker, defender, and the smart grid system are modeled while incorporating attacker-stochasticity and federal guidelines for smart grid cybersecurity. This allows quantification of threat, vulnerabilities, and attack impact of the grid for quantitative risk assessment. The defender's budget to invest in the security resources in the grid is optimized based on the strategies leading to minimum system risk. The evaluation of the proposed solutions highlight the feasibility for practical implementation of these methodologies and algorithms in the smart grid, while taking the federal requirements and guidelines for smart grid security into consideration. For achieving cybersecurity for system operation, attack prevention, detection, and mitigation algorithms and methodologies are developed specifically for FACTS-based WAVCS. Anomaly detection and mitigation in the WAVCS are achieved using algorithms based on machine learning which involves offline training and testing of ML models with CPS datasets incorporating physics-based features that allow accurate distinction between system faults and cyber attacks. For attack prevention, a methodology based on software defined network (SDN)-based moving target defense (MTD) network routing is proposed that enables prevention of Denial of Service (DoS) type attacks on the smart grid communication system. Subsequently, these methodologies and algorithms are implemented and evaluated on an HIL testbed that allows for real-time attack prevention, detection, and mitigation of emulated cyber attacks on the WAVCS in a close to real-world environment. The results show highly accurate and efficient performance of the implemented algorithms and methodologies with the smart grid system operating within the NERC's system operation limits even in the presence of DoS and data integrity cyber attacks. This work opens up future research opportunities in other directions such as (1) Expanding cybersecurity planning methodologies to real-time cyber contingency analysis with different game formulations; and (2) Applying the cybersecurity for system operation algorithms to broader categories of wide-area control applications.

24 POWER TRANSMISSION AND DISTRIBUTION↗

BitGNN: Unlocking the Performance Potential of Binary Graph Neural Networks on GPUs

Graph Neural Networks (GNNs) have shown compelling results in many graph-based learning tasks. They are, however, time-consuming. Recent work has shown a promising direction in improving GNN speed and shrinking the size — network binarization, which binarizes network values and operations. Prior work, however, mainly focused on algorithm designs, leaving it open on how to fully materialize the performance potential. This work fills the gap by proposing techniques to best map binary GNNs and their computations to fit the nature of bit manipulations, optimizations and algorithms to maximize BSpMM kernel efficiency, and solutions to other factors influencing the end-to-end time on GPUs. Results on real-world graphs show that the proposed techniques outperform state of-the-art binary GNN implementations by 21-67× with little accuracy loss.

Chen, Jou-An↗

Measuring the Loschmidt Amplitude for Finite-Energy Properties of the Fermi-Hubbard Model on an Ion-Trap Quantum Computer

Calculating the equilibrium properties of condensed-matter systems is one of the promising applications of near-term quantum computing. Recently, hybrid quantum-classical time-series algorithms have been proposed to efficiently extract these properties from a measurement of the Loschmidt amplitude ⟨ ψ | e − i H ^ t | ψ ⟩ from initial states | ψ ⟩ and a time evolution under the Hamiltonian H ^ up to short times t . In this work, we study the operation of this algorithm on a present-day quantum computer. Specifically, we measure the Loschmidt amplitude for the Fermi-Hubbard model on a 16 -site ladder geometry (32 orbitals) on the Quantinuum H2-1 trapped-ion device. We assess the effect of noise on the Loschmidt amplitude and implement algorithm-specific error-mitigation techniques. By using a thus-motivated error model, we numerically analyze the influence of noise on the full operation of the quantum-classical algorithm by measuring expectation values of local observables at finite energies. Finally, we estimate the resources needed for scaling up the algorithm. Published by the American Physical Society 2024

Physics↗

Application of NEM-based Pin-by-Pin HCMFD Algorithm to 3-D Core Analysis

A pin-wise reactor analysis is expected to provide a more accurate solution than the conventional nodal methods. However, a pin-wise approach is still computationally very costly though the computational performances have been enormously improved for decades. To overcome such limitation of a pin-by-pin core analysis, the HCMFD (Hybrid Course-Mesh Finite Difference) algorithm has been recently introduced. By adopting the HCMFD algorithm, a parallel computing can be applied very effectively. In the HCMFD algorithm, an iterative local-global strategy is adopted with a combination of two CMFD acceleration methods for the pin-wise core analysis. The global eigenvalue problem is solved by one-node CMFD, while the local fixed-source problems are solved by two-node CMFD based on the NEM (nodal expansion method). In the HCMFD computational scheme, a parallel computing can effectively be applied since most of the computational efforts are consumed to solve the local problems, and they can be solved in parallel. Previously, only a 2-D HCMFD algorithm was developed and its numerical efficiency was evaluated. In this paper, a 3D HCMFD scheme is introduced and some 3-D problems were analyzed to verify its applicability to 3D pin-wise core analysis. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Nonadiabatic Molecular Dynamics Simulations Based on Time-Dependent Density Functional Tight-Binding Method

Nonadiabatic excited-state molecular dynamics underpin many photophysical and photochemical phenomena, such as exciton dynamics, charge separation and transport. In this work, we present an efficient nonadiabatic molecular dynamic (NAMD) simulation method based on time-dependent density functional tight-binding (TDDFTB) theory. Specifically, the adiabatic electronic structure, an essential NAMD input, is described at the TDDFTB level. Here, the nonadiabatic effects originating from the coupled motions of electrons and nuclei are treated by the trajectory surface hopping algorithm. To improve the computational efficiency, nonadiabatic couplings between excited states within the TDDFTB method are derived and implemented using an analytical approach. Further, the time-dependent nonadiabatic coupling scalars are calculated based on the overlap between molecular orbitals rather than the Slater determinants to speed up the simulations. In addition, the electronic decoherence scheme and a state reassigned unavoided crossings algorithm, which has been implemented in the NEXMD software, are used to improve the accuracy of the simulated dynamics and handle trivial unavoided crossings. Finally, the photoinduced nonadiabatic dynamics of a benzene molecule are simulated to demonstrate our implementation. The results for excited state NAMD simulations of benzene molecule based on TDDFTB method compare well that obtained with numerically expensive time-dependent density functional theory. The proposed methodology provides an attractive theoretical simulation tool for predicting the photophysical and photochemical properties of complex materials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Fast methods for multisite charge transfer processes. I. Constrained, state averaged CASSCF(1,n) and CASSCF(2n − 1,n) simulations

We design a dynamically weighted state-averaged constrained complete active space self-consistent field (DW-SA-cCASSCF) algorithm to treat electrons or holes moving between n molecular fragments (where n can be larger than 2). Within such a so-called eDSCn/hDSCn approach, we consider configurations that are mutually single excitations of each other, and we apply a generalized set of constraints to tailor the method for studying charge transfer problems. The constrained optimization problem is efficiently solved using a DIIS-SQP algorithm, thus maintaining computational efficiency. We demonstrate the method for a finite Su–Schrieffer–Heeger chain, successfully reproducing the expected exponential decay of diabatic couplings with distance. When combined with a gradient, the current extension immediately enables efficient nonadiabatic dynamics simulations of complex multi-state charge transfer processes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗