Quantum-inspired genetic algorithm for designing planar multilayer photonic structure
Not Available
36 MATERIALS SCIENCE↗
SEARCH · Engineering Papers
Results for “Algorithms”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Efficient symmetry-preserving state preparation circuits for the variational quantum eigensolver algorithm
Not Available
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
LoTToR: An Algorithm for Missing-Wedge Correction of the Low-Tilt Tomographic 3D Reconstruction of a Single-Molecule Structure
A single-molecule three-dimensional (3D) structure is essential for understanding the thermal vibrations and dynamics as well as the conformational changes during the chemical reaction of macromolecules. Individual-particle electron tomography (IPET) is an approach for obtaining a snap-shot 3D structure of an individual macromolecule particle by aligning the tilt series of electron tomographic (ET) images of a targeted particle through a focused iterative 3D reconstruction method. The method can reduce the influence on the 3D reconstruction from large-scale image distortion and deformation. Due to the mechanical tilt limitation, 3D reconstruction often contains missing-wedge artifacts, presented as elongation and an anisotropic resolution. Here, we report a post-processing method to correct the missing-wedge artifact. This low-tilt tomographic reconstruction (LoTToR) method contains a model-free iteration process under a set of constraints in real and reciprocal spaces. A proof of concept is conducted by using the LoTToR on a phantom, i.e., a simulated 3D reconstruction from a low-tilt series of images, including that within a tilt range of ±15°. The method is validated by using both negative-staining (NS) and cryo-electron tomography (cryo-ET) experimental data. A significantly reduced missing-wedge artifact verifies the capability of LoTToR, suggesting a new tool to support the future study of macromolecular dynamics, fluctuation and chemical activity from the viewpoint of single-molecule 3D structure determination.
97 MATHEMATICS AND COMPUTING↗
Complexity-calibrated benchmarks for machine learning reveal when prediction algorithms succeed and mislead
Abstract Recurrent neural networks are used to forecast time series in finance, climate, language, and from many other domains. Reservoir computers are a particularly easily trainable form of recurrent neural network. Recently, a “next-generation” reservoir computer was introduced in which the memory trace involves only a finite number of previous symbols. We explore the inherent limitations of finite-past memory traces in this intriguing proposal. A lower bound from Fano’s inequality shows that, on highly non-Markovian processes generated by large probabilistic state machines, next-generation reservoir computers with reasonably long memory traces have an error probability that is at least $$\sim 60\%$$ ∼ 60 % higher than the minimal attainable error probability in predicting the next observation. More generally, it appears that popular recurrent neural networks fall far short of optimally predicting such complex processes. These results highlight the need for a new generation of optimized recurrent neural network architectures. Alongside this finding, we present concentration-of-measure results for randomly-generated but complex processes. One conclusion is that large probabilistic state machines—specifically, large $$\epsilon$$ ϵ -machines—are key to generating challenging and structurally-unbiased stimuli for ground-truthing recurrent neural network architectures.
97 MATHEMATICS AND COMPUTING↗
Algorithm Design Based on Derived Operation Rules for a System of Reservoirs in Parallel
Not provided.
Engineering↗
Image-driven discriminative and generative machine learning algorithms for establishing microstructure–processing relationships
We investigate methods of microstructure representation for the purpose of predicting processing condition from microstructure image data. A binary alloy that is currently under development as a nuclear fuel was studied for the purpose of developing an improved machine learning approach to image recognition, characterization, and building predictive capabilities linking microstructure to processing conditions. Here, we test different microstructure representations and evaluate model performance based on classification accuracy. A classification accuracy of 95.8% was achieved fordistinguishing between micrographs corresponding to ten different thermo-mechanical material processing conditions.We find that our newly developed microstructure representation describes image data well, and the traditional approachof utilizing area fractions of different phases is insufficient for distinguishing between multiple classes using a relativelysmall, imbalanced original data set of 272 images. To explore the applicability of generative methods for supplementing such limited data sets, generative adversarial networks were trained to generate artificial microstructure images. Two different generative networks were trained and tested to assess performance. Challenges and best practices associated with applying machine learning to limited microstructure image data sets is also discussed. Our work has implications for quantitative microstructure analysis, and development of microstructure-processing relationships in limited data sets typical of metallurgical process design studies.
36 MATERIALS SCIENCE↗
Consistent coupling algorithms for coupled core-edge simulations of plasma turbulence
Two schemes for coupling gyrokinetic simulations of microturbulence in tokamaks are proposed. The first scheme is based on an additive Schwarz domain decomposition. In this work, we show that, because the goal of turbulence is long-time averages of the dynamics rather than temporal accuracy, the iteration to self-consistency across domains, which is typically required by Schwarz schemes, can be avoided, thereby accelerating the computation. Second, we propose a coupling scheme that relies entirely on the addition of source terms, leaving the boundary conditions arbitrary. The practical motivations for such a scheme are discussed, and forms of the source terms that ensure consistency and stability are derived. The schemes are tested on a nonlinear, one-dimensional model problem, and the first scheme is further tested on the Hasegawa–Wakatani model.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
Linear embedding of nonlinear dynamical systems and prospects for efficient quantum algorithms
The simulation of large nonlinear dynamical systems, including systems generated by discretization of hyperbolic partial differential equations, can be computationally demanding. Such systems are important in both fluid and kinetic computational plasma physics. This motivates exploring whether a future error-corrected quantum computer could perform these simulations more efficiently than any classical computer. In this work, we describe a method for mapping any finite nonlinear dynamical system to an infinite linear dynamical system (embedding) and detail three specific cases of this method that correspond to previously studied mappings. Then we explore an approach for approximating the resulting infinite linear system with finite linear systems (truncation). Using a number of qubits only logarithmic in the number of variables of the nonlinear system, a quantum computer could simulate truncated systems to approximate output quantities if the nonlinearity is sufficiently weak. Other aspects of the computational efficiency of the three detailed embedding strategies are also discussed.
97 MATHEMATICS AND COMPUTING↗
Dispersion and the speed-limited particle-in-cell algorithm
This paper discusses temporally continuous and discrete forms of the speed-limited particle-in-cell (SLPIC) method first treated by Werner et al. [Phys. Plasmas 25, 123512 (2018)]. The dispersion relation for a 1D1V electrostatic plasma whose fast particles are speed-limited is derived and analyzed. By examining the normal modes of this dispersion relation, we show that the imposed speed-limiting substantially reduces the frequency of fast electron plasma oscillations while preserving the correct physics of lower-frequency plasma dynamics (e.g. ion acoustic wave dispersion and damping). We then demonstrate how the timestep constraints of conventional electrostatic particle-in-cell methods are relaxed by the speed-limiting approach, thus enabling larger timesteps and faster simulations. Here, these results indicate that the SLPIC method is a fast, accurate, and powerful technique for modeling plasmas wherein electron kinetic behavior is nontrivial (such that a fluid/Boltzmann representation for electrons is inadequate) but evolution is on ion timescales.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
Accelerating and stabilizing the convergence of vibrational self-consistent field calculations via the direct inversion of the iterative subspace (vDIIS) algorithm
The vibrational self-consistent field (VSCF) method yields anharmonic states and spectra for molecular vibrations, and it serves as the starting point for more sophisticated correlated-vibration methods. Convergence of the iterative, non-linear optimization in VSCF calculations can be erratic or altogether unsuccessful, particularly for chemical systems involving low-frequency motions. In this work, a vibrational formulation of the Direct Inversion of the Iterative Subspace method of Pulay is presented and investigated. This formulation accounts for distinct attributes of the vibrational and electronic cases, including the expansion of each single-mode vibrational wavefunction in its own basis set. The resulting Direct Inversion of the Iterative Subspace method is shown to substantially accelerate VSCF convergence in all convergent cases as well as rectify many cases where Roothaan-based methods fail. Performance across systems ranging from small, rigid molecules to weakly bound molecular clusters is investigated in this analysis.
Chemistry↗
A Bayesian desmearing algorithm for Bonse–Hart USANS with anisotropic scattering
Ultra-small-angle neutron scattering (USANS) using Bonse–Hart optics provides micrometer-scale structural insights but suffers from severe slit-geometry smearing. While well-established for isotropic systems, quantitative desmearing of anisotropic data remains a challenge because conventional corrections break down for non-radial scattering. In this work, we address this by developing a resolution-aware Bayesian framework that explicitly incorporates anisotropy via an affine deformation to the scattering pattern, guided by the principle of parsimony. This results in orientation-resolved point-spread functions that enable a self-consistent determination of both the resolution and deformation parameters. Using Gaussian process regression with uncertainty quantification and a probabilistic correction for multiple scattering, we demonstrate the framework’s effectiveness through numerical benchmarks and experimental studies of a stretched polymer melt. Our approach enables the seamless integration of SANS and USANS data, facilitating quantitative structural analysis of deformed materials at nanometer to micrometer scales.
36 MATERIALS SCIENCE↗
Development of a Flow Stabilization Algorithm Enabling Measurement of Low Oxygen Concentrations in Liquid Sodium
To enhance the automated control of the plugging meter (PM) and thereby enhance detection fidelity in ultralow oxygen environments [≤1 parts per million by weight (wppm)], a novel proportional derivative controller has been implemented with conventional PM hardware. This ramp sign stabilized flow (RSSF) controller manipulates the sign (heating or cooling direction) at a fixed rate, enabling precise temperature adjustment around the saturation temperature of the bulk sodium. This adjustment helps maintain flow stability in a partially formed sodium oxide plug, thus greatly reducing the temperature amplitude in the plugging cycle and promoting simple and accurate oxygen determinations in addition to an increased sampling rate. Rather than relying on the subjective nature of indexing the time when the flow rate changes due to the plugging or unplugging onset to the PM temperature, a running average of the correlated oxygen concentration with time over multiple plugging events can provide oxygen readings ranging from an absolute uncertainty of 500 wppb in real time to less than 50 wppb for a 24-h sampling window. Finally, the RSSF controller was tested at 508 ± 7 wppb with measured oxygen of 542 ± 179 wppb, further reducing the variance between the saturation temperature and the plugging temperature.
46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
Bayesian Federated Learning with Hamiltonian Monte Carlo: Algorithm and Theory
Not provided.
Mathematics↗
Inferring safety critical events from vehicle kinematics in naturalistic driving environment: Application of deep learning Algorithms
Advances in sensing technology has enabled the collection of countless terabytes of second-by-second kinematics data. Such data provides opportunities for real-time monitoring of driving behavior and identification of safety critical events (SCEs) including crashes and near crashes. The concept of volatility is relevant in this context, which identifies instability and erratic variations in driving behavior prior to involvement in SCEs. This study utilized vehicle kinematics from a large-scale naturalistic driving data to develop a deep learning approach based on 1D convolutional neural networks (CNN) for inferring SCEs. The data are unique in the sense that such accurate pre-crash data at high fidelity are not available in traditional crash repositories. This study contributes to the literature by providing a first attempt at predicting responses to SCEs by developing deep learning-based CNN architectures using novel driving volatility based kinematic thresholds for a sample of 9553 events. The key contribution lies in developing a volatility-based CNN input layout that is acceptable to CNN schemes and represents the motion kinematics such as speed, acceleration and volatility measures. Several 1D-CNN architectures were developed using layers, numbers of convolutions, layer patterns, and kernels. Shallow and deep architectures were tested, revealing higher accuracy of shallow architectures in detecting SCEs. The optimal number of epochs were identified using an early stopping method while the CNN performance was improved by increasing the number of epochs. The ensemble CNN had the highest predictive accuracy of 95.6% for detection of crashes and near crashes, which was 2.5% higher than the optimal CNN using 20% hold out test data. The ensemble CNN also outperformed classical machine learning models and model performance reported in past studies on detection of SCEs. Finally, these results have implications for identification of safety hotspots and providing real-time alerts and warnings in connected and highly automated vehicle environment including society of automotive engineers levels 3–5.
42 ENGINEERING↗