Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithm complexity analysis”

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 595 records · Page 33
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Anomaly Detection and Identification Using a Leave-One-Variable-Out Method

At nuclear power plants (NPPs), anomaly detection and identification (i.e., determining the causes of anomalies) are important tasks for ensuring the safe and efficient operation of NPPs. These tasks are currently labor-intensive and costly, and are made more difficult by the size and complexity of NPP systems. An alternative approach to conducting these tasks is to automate them, such as via the reconstruction-based contribution method, which is a well-researched unsupervised machine learning method that uses a data-driven model of anomaly-free behavior to detect events and then identify each variable’s contributions to those events. The present effort developed a novel contribution approach that utilized a leave-one-variable-out (LOVO) model, with which each variable is predicted using all the other variables. The novelty lay in transforming this model into a reconstruction model and modifying the identification algorithm to work with the new reconstruction model. To evaluate this method in a controlled environment, a synthetic dataset based on spring-mass-damper (SMD) systems (commonly found in mechanical engineering references) was used, with known anomalies introduced into the system. The proposed method successfully detected the anomalies and afforded insights into their causes, thus enabling the appropriate identifications to be made.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2024

Improving the five-point bootstrap

We present a new algorithm for the numerical evaluation of five-point conformal blocks in d-dimensions, greatly improving the efficiency of their computation. To do this we use an appropriate ansatz for the blocks as a series expansion in radial coordinates, derive a set of recursion relations for the unknown coefficients in the ansatz, and evaluate the series using a Padé approximant to accelerate its convergence. We then study the 〈σσϵσσ〉 correlator in the 3d critical Ising model by truncating the operator product expansion (OPE) and only including operators with conformal dimension below a cutoff ∆ ⩽ ∆cutoff. We approximate the contributions of the operators above the cutoff by the corresponding contributions in a suitable disconnected five-point correlator. Using this approach, we compute a number of OPE coefficients with greater accuracy than previous methods.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Considerations for using Privacy Preserving Machine Learning Techniques for Safeguards

In international nuclear safeguards, the International Atomic Energy Agency (IAEA) is tasked with inspecting and verifying nuclear facilities and their activities. Data analytics and machine learning to support inspections require large amounts of data that nuclear facility operators may consider proprietary or sensitive, so the IAEA may not have full access. Allowing computation over private data without compromising its security therefore has value for safeguards inspections and analysis. Privacy-preserving machine learning (PPML) consists of security-focused techniques that allow data analytics and machine learning algorithms to run on sensitive data without revealing it. This includes ideas like homomorphic encryption (HE), secure multiparty computation (SMPC), and secure enclaves. HE allows algorithms and mathematical operations to be conducted directly on the encrypted data instead of first decrypting it. With SMPC, multiple entities collaboratively compute over distributed data such that no party is able to directly view any others’ original data. Secure enclaves allow computation to take place in a separate and heavily blocked-off section of a CPU. Techniques like these allow for several potential use cases in which the security of data is essential. With SMPC, machine learning models can be trained over the input data from multiple entities, resulting in a model that all users can benefit from without leaking the input data from any particular entity. With SMPC or a zero-knowledge proof (ZKP), an algorithm returning some single answer or truth value can be run on someone else’s data without ever needing to see that data, potentially allowing for verification or proof of some underlying question. HE can allow for outsourcing computation on data to a hostile or untrusted environment. Although most of the research in this field resides within the health and financial domains, tools from PPML may have similar applications in nuclear safeguards. Allowing the IAEA to compute over proprietary information, such as process models and raw sensor data using PPML techniques, provides the baseline for running complex analytics without needing direct unencrypted access to the underlying data, maintaining its privacy. Important limitations to consider for these techniques include the efficiency and level of security required. The security of HE and SMPC come at the cost of speed—the significant amount of overhead means that algorithms implemented in these protocols and encryption schemes are slower than when run on plaintext. Additionally, several important parameters determine what techniques or protocols are used based on the security requirements. SMPC protocols may need to be selected for resistance against a party that attempts to deviate from the protocol to distort the result or gain access to additional information, and a protocol secure against these attacks may further increase the overhead of the algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A network approach for multiscale catchment classification using traits

Abstract. The classification of river catchments into groups with similar biophysical characteristics is useful to understand and predict their hydrological behavior. The increasing availability of remote sensing and other large-scale geospatial datasets has enabled the use of advanced data-driven approaches to classify catchments using traits such as topography, geology, climate, land cover, land use, and human influence. Unsupervised clustering algorithms based on the Euclidean distance are commonly used for trait-based classification but are not suitable for highly dimensional data. In this study we present a new network-based method for multi-scale catchment classification, which can be applied to large datasets and used to determine the traits associated with different catchment groups. In this framework, two networks are analyzed in parallel: the first being where the nodes are traits and the second being where the nodes are catchments. In both cases, edges represent pairwise similarity, and a network cluster detection algorithm is used for the classification. The trait network is used to investigate redundancy in the trait data and to condense this information into a small number of interpretable categories. The catchments network is used to classify the catchments into clusters and to identify representative catchments for the different groups using the degree centrality metric. We apply this method to classify 9067 river catchments across the contiguous United States at both regional and continental scales using 274 non-categorical traits. At the continental scale, we identify 25 interpretable trait categories and 34 catchment clusters of sizes greater than 50. We find that catchments with similar trait categories are typically located in the same region, with different spatial patterns emerging among clusters dominated by natural and anthropogenic traits. We also find that the catchment clusters exhibit distinct hydrological behavior based on an analysis of streamflow indices. This network approach provides several advantages over traditional means of classification, including better separation of clusters, the use of alternate similarity metrics that are more suitable for highly dimensional data, and reducing redundancy in the trait information. The paired catchment–trait networks enable analysis of hydrological behavior using the dominant trait categories for each catchment cluster. The approach can be used at multiple spatial scales since the network topologies adjust automatically to reflect the trait patterns at the scale of investigation. Finally, the representative catchments identified as hub nodes in the network can be used to guide transferable observational and modeling strategies. The method is broadly applicable beyond hydrology for classification of other complex systems that utilize different types of trait datasets.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2018

Characterization of Pulmonary Nodules Based on Features of Margin Sharpness and Texture

Lung cancer is the leading cause of cancer-related deaths in the world, and one of its manifestations occurs with the appearance of pulmonary nodules. The classification of pulmonary nodules may be a complex task to specialists due to temporal, subjective, and qualitative aspects. Therefore, it is important to integrate computational tools to the early pulmonary nodule classification process, since they have the potential to characterize objectively and quantitatively the lesions. In this context, the goal of this work is to perform the classification of pulmonary nodules based on image features of texture and margin sharpness. Computed tomography scans were obtained from a publicly available image database. Texture attributes were extracted from a co-occurrence matrix obtained from the nodule volume. Margin sharpness attributes were extracted from perpendicular lines drawn over the borders on all nodule slices. Feature selection was performed by different algorithms. Classification was performed by several machine learning classifiers and assessed by the area under the receiver operating characteristic curve, sensitivity, specificity, and accuracy. Highest classification performance was obtained by a random forest algorithm with all 48 extracted features. However, a decision tree using only two selected features obtained statistically equivalent performance on sensitivity and specificity.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2025

Validating sequential Monte Carlo for gravitational-wave inference

Nested sampling (NS) is the preferred stochastic sampling algorithm for gravitational-wave inference for compact binary coalescences. It can handle the complex nature of the gravitational-wave likelihood surface and provides an estimate of the Bayesian model evidence. However, there is another class of algorithms that meets the same requirements, but has not been used for gravitational-wave analyses: sequential Monte Carlo (SMC), an extension of importance sampling that maps samples from an initial density to a target density via a series of intermediate densities. In this work, we validate a type of SMC algorithm, called persistent sampling (PS), for gravitational-wave inference. We consider a range of different scenarios including binary black holes and binary neutron stars and real and simulated data and show that PS produces results that are consistent with NS whilst being, on average, 2 times more efficient and 2.74 times faster. This demonstrates that PS is a viable alternative to NS that should be considered for future gravitational-wave analyses.

black hole mergers↗
DOE OSTI2019

Evaluation of Acoustic Channel Capacity for Complex Piping Topology

Transmission of information using elastic waves on existing metallic pipes provides an alternative communication option for a nuclear facility. The advantages of this approach consist of transmitting information through physical barriers, such as the containment building wall. In addition, this approach provides physical cybersecurity since the pipe becomes an analog communication channel which is difficult to eavesdrop on and difficult to sever. In prior work, a laboratory bench-scale system consisting of a six foot-long straight section of nuclear grade stainless steel pipe and high-temperature ultrasonic LiNbO 3 transducers was assembled. The lab systems was used for communication protocol development and preliminary data transmission demonstration. Next phase of project development involves deployment of the ultrasonic communication system in a representative environment. Mechanisms Engineering Test Loop (METL) facility at ANL was chosen as a viable candidate for communication system demonstration. Analysis of piping manifolds at METL has shown that in a typical scenario, ultrasonic signals have to be transmitted over straight and bent piping sections. This report describes preliminary studies on transmission of information with ultrasonic shear waves across bent piping sections. A test article consisting of a stainless steel pipe bent at 90° was developed for laboratory analysis of ultrasonic signal transmission. The bent piping test article developed by welding two straight pipes to an elbow. For consistency, the diameter and wall thickness of the bent pipe is the same as that of the straight pipe utilized in prior studies. COMSOL computer simulations were performed to study ultrasonic refracted shear wave coupling and transmission across bent piping. Preliminary evaluations of ultrasonic shear wave transmission were conducted with piezoelectric (PZT) and LiNbO 3 transducers, with the signals recorded with previously developed LabView interface. Preliminary results have shown significant dispersion of transmitted signals, most likely due to reflections and scattering by piping welds. Signal distortion compensation algorithm based on time reversal modulation (TRM) was initially investigated for transmission through solids, and demonstrated for signals transmitted over the bent pipe. Using TRM, it was shown that communication bitrates of 100Kbps were achievable, in principle.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2023

Deep learning uncertainty quantification for clinical text classification

Machine learning algorithms are expected to work side-by-side with humans in decision-making pipelines. Thus, the ability of classifiers to make reliable decisions is of paramount importance. Deep neural networks (DNNs) represent the state-of-the-art models to address real-world classification. Although the strength of activation in DNNs is often correlated with the network’s confidence, in-depth analyses are needed to establish whether they are well calibrated. In this paper, we demonstrate the use of DNN-based classification tools to benefit cancer registries by automating information extraction of disease at diagnosis and at surgery from electronic text pathology reports from the US National Cancer Institute (NCI) Surveillance, Epidemiology, and End Results (SEER) population-based cancer registries. In particular, we introduce multiple methods for selective classification to achieve a target level of accuracy on multiple classification tasks while minimizing the rejection amount—that is, the number of electronic pathology reports for which the model’s predictions are unreliable. We evaluate the proposed methods by comparing our approach with the current in-house deep learning-based abstaining classifier. Overall, all the proposed selective classification methods effectively allow for achieving the targeted level of accuracy or higher in a trade-off analysis aimed to minimize the rejection rate. On in-distribution validation and holdout test data, with all the proposed methods, we achieve on all tasks the required target level of accuracy with a lower rejection rate than the deep abstaining classifier (DAC). Interpreting the results for the out-of-distribution test data is more complex; nevertheless, in this case as well, the rejection rate from the best among the proposed methods achieving 97% accuracy or higher is lower than the rejection rate based on the DAC. We show that although both approaches can flag those samples that should be manually reviewed and labeled by human annotators, the newly proposed methods retain a larger fraction and do so without retraining—thus offering a reduced computational cost compared with the in-house deep learning-based abstaining classifier.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2019

A unified pseudo- C ℓ framework

The pseudo- C ℓ is an algorithm for estimating the angular power and cross-power spectra that is very fast and in realistic cases also nearly optimal. The algorithm can be extended to deal with contaminant deprojection and E/B purification, and can therefore be applied in a wide variety of scenarios of interest for current and future cosmological observations. This paper presents NAMASTER, a public, validated, accurate and easy-to-use software package that, for the first time, provides a unified framework to compute angular cross-power spectra of any pair of spin-0 or spin-2 fields, contaminated by an arbitrary number of linear systematics and requiring B- or E-mode purification, both on the sphere or in the flat-sky approximation. We describe the mathematical background of the estimator, including all the features above, and its software implementation in NAMASTER. We construct a validation suite that aims to resemble the types of observations that next-generation large-scale structure and ground-based CMB experiments will face, and use it to show that the code is able to recover the input power spectra in the most complex scenarios with no detectable bias. NAMASTER can be found at https://github.com/LSSTDESC/NaMaster, and is provided with comprehensive documentation and a number of code examples.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Structural motifs and bonding in two families of boron structures predicted at megabar pressures

The complex crystal chemistry of elemental boron has led to numerous proposed structures with distinctive motifs as well as contradictory findings. Herein, evolutionary structure searches performed at 100 GPa have uncovered a series of metastable phases of boron, and bonding analyses were carried out to elucidate their electronic structure. These polymorphs, dynamically stable at 100 GPa, were grouped into two families. Here, the first was derived from the thermodynamic minimum at these conditions, α-Ga, whereas channels comprised the second. Two additional intergrowth structures were uncovered, and it was shown they could be constructed by stacking layers of α-Ga-like and channel-like allotropes on top of each other. A detailed bonding analysis revealed networks of four-center σ-bonding functions linked by two-center B-B bonds in the α-Ga based structures, and networks that were largely composed of three-center σ-bonding functions in the channel-based structures. Seven of these high-pressure phases were found to be metastable at atmospheric conditions, and their Vickers hardnesses were estimated to ≈ 36 GPa.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2018

Numerical Methodology for Optimization of Compression-Ignited Engines Considering Combustion Noise Control

It is challenging to develop highly efficient and clean engines while meeting user expectations in terms of performance, comfort, and drivability. One of the critical aspects in this regard is combustion noise control. Combustion noise accounts for about 40 percent of the overall engine noise in typical turbocharged diesel engines. The experimental investigation of noise generation is difficult due to its inherent complexity and measurement limitations. Therefore, it is important to develop efficient numerical strategies in order to gain a better understanding of the combustion noise mechanisms. In this work, a novel methodology was developed, combining computational fluid dynamics (CFD) modeling and genetic algorithm (GA) technique to optimize the combustion system hardware design of a high-speed direct injection (HSDI) diesel engine, with respect to various emissions and performance targets including combustion noise. The CFD model was specifically set up to reproduce the unsteady pressure field inside the combustion chamber, thereby allowing an accurate prediction of the acoustic response of the combustion phenomena. The model was validated by simulating several steady operating conditions and comparing the numerical results against experimental data, in both temporal and frequency domains. Thereafter, a GA optimization was performed with the goal of minimizing indicated specific fuel consumption (ISFC) and combustion noise, while restricting pollutant (soot and NOx) emissions to their respective baseline values. Eight design variables were selected pertaining to piston bowl geometry, nozzle inclusion angle, number of injector nozzle holes, and in-cylinder swirl. An objective merit function (MF) based on the emissions, ISFC, and combustion noise was constructed to quantify the strength of the engine designs and was determined using the CFD model as the function evaluator. The in-cylinder noise level was characterized by the total resonance energy of local pressure oscillations. The optimum engine configuration thus obtained showed a significant improvement in terms of efficiency and combustion noise compared to the baseline system, along with both soot and NOx emissions within their respective constraints. This optimum configuration included a deeper and tighter bowl geometry with higher swirl and larger number of nozzle holes. Subsequently, a more detailed acoustics analysis based on proper orthogonal decomposition (POD) technique was carried out to further explore the combustion noise benefits achieved by the GA optimum. In conclusion, this computational study is a first of its kind (to the best of the authors’ knowledge), which demonstrates a comprehensive framework to incorporate combustion noise into a numerical optimization strategy for engine design.

42 ENGINEERING↗
DOE OSTI2022

Advanced modeling and simulation of research reactors using dynamic mode decomposition

Full text of publication follows. Due to the ever-increasing safety requirements, the current trend of nuclear reactor analysis is shifting towards high-fidelity multi-physics models, which have a very high computational cost and modelling complexity. As the cost of even a single model run makes it impossible to analyse the behaviour and performance of these models on large-scale commercial plants, it has become even more significant to provide suitable benchmarks to validate and test them extensively. In this sense, research reactors offer a promising solution for the initial validation of high-fidelity models, as they are significantly smaller than commercial reactors and their characteristics are well known. In particular, the reactors of the TRIGA family have been used to assess and validate models and methods for Generation-IV designs, as they have some similar features (such as the dominance of natural convection as cooling mechanism and the difficulties in performing sub-channel analysis using standard codes). Still, the computational requirements of high-fidelity models make them unsuitable for real-time analysis, even following their assessment on research reactors. In this sense, Model Order Reduction (MOR) techniques give an additional strategy to reduce the computational cost of high-fidelity models (whilst preserving sufficient accuracy). In particular, this work focuses on Dynamic Mode Decomposition (DMD), a non-intrusive MOR technique that aims at representing models with explicit temporal dynamics by extracting the time-varying characteristics and the governing structures based only on a set of available data, thus without needing any underlying knowledge of the governing equations. In addition, DMD also computes a low-dimensional surrogate of the dynamic matrix of the system, making it suited for stability analysis and real-time evaluations. This work focuses on the application and validation of the DMD method on the Computational Fluid-Dynamics (CFD) model TRIGA Mark II reactor, also discussing in detail the potentiality of this algorithm as an advanced modelling tool for nuclear reactor analysis. (author)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2019

Characterizing and Improving the Data Reduction Pipeline for the Keck OSIRIS Integral Field Spectrograph

OSIRIS is a near-infrared (1.0–2.4 μm) integral field spectrograph operating behind the adaptive optics system at Keck Observatory and one of the first lenslet-based integral field spectrographs. Since its commissioning in 2005, it has been a productive instrument, producing nearly half the laser guide star adaptive optics papers on Keck. The complexity of its raw data format necessitated a custom data reduction pipeline (DRP) delivered with the instrument in order to iteratively assign flux in overlapping spectra to the proper spatial and spectral locations in a data cube. Other than bug fixes and updates required for hardware upgrades, the bulk of the DRP has not been updated since initial instrument commissioning. We report on the first major comprehensive characterization of the DRP using on-sky and calibration data. We also detail improvements to the DRP, including characterization of the flux assignment algorithm, exploration of spatial rippling in the reduced data cubes, and improvements to several calibration files, including the rectification matrix, bad-pixel mask, and wavelength solution. We present lessons learned from over a decade of OSIRIS data reduction that are relevant to the next generation of integral field spectrograph hardware and data reduction software design.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2026

The Art of Automation: Translating Electron Microscopy Workflows Into Automated Processes

Acquiring data using a scanning transmission electron microscope (STEM) is a complex, multi-step process. The intricacy of the process depends on the type of sample, composition of the material, desired results of the experiment, resolution requirement and other experimental factors. Each experiment presents unique complications, such as sample drift and contamination, that the microscopist must consider when acquiring data. All these challenges are handled fluidly and expertly by experienced microscopists, but to reach new levels of innovation in material development, including greater reproducibility, throughput, and precision, the automation of these workflows is essential. The initial phase of this work involved translating intuition-based workflows into discrete, programmable steps. Some common key stages in STEM workflows are the initial tuning, scanning the sample for areas of interest, and then acquiring the data. Each stage can be broken further into specific parameter adjustments, such as aberration correction and dwell time optimization, depending on the experiment. When deconstructing various experiments each step was assessed for automation feasibility based on the amount of real time operator decisions. There are steps that lend themselves to automation more readily than others, such as course focusing and sample screening, but there is potential for full automation of all stages with time. As an initial step, an automated montage routine was developed, allowing for the efficient acquisition of large portions of the sample without requiring continuous intervention from the operator. The automation of this small process of the procedure demonstrates the value of this capability. A major challenge in automation arises from discrepancies between commanded, reported and actual stage movements. Using systematic tests, stage movement was quantified. This error can be corrected algorithmically for more accurate workflows in the future. Expanding automation capabilities would result in larger, more efficient data acquisition which allows for more robust statistical analysis. Additionally, this work lays the groundwork for a closed loop system where machine learning algorithms would intake automatically acquired data and make real time decisions. By progressively automating this instrument, this work establishes the foundation for fully automated experimentation in transmission electron microscopy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Artificial Intelligence for Event Reconstruction and Higgs Physics at CMS and Future Colliders

This dissertation charts a trajectory in which advances in artificial intelligence (AI) play a central role in pushing the high-energy physics frontier, complementing progress driven by higher collision energies and larger colliders. The discovery potential of the LHC and future colliders relies on accurate reconstruction of increasingly complex particle collision events. In the CMS experiment, this task is performed by the particle-flow (PF) algorithm. This dissertation presents the first implementation of a machine-learning-based particle-flow (MLPF) reconstruction in the CMS detector based on transformer architectures. In simulated top quark--antiquark pair (ttbar) events under LHC Run~3 (2023--2024) conditions, MLPF improves jet energy resolution by 10--20\% compared to standard PF for jets with transverse momentum between 30--100\GeV. Runtime performance is evaluated using simulated multijet events, with a median inference time of 20\unit{ms} per event on an NVIDIA L4 GPU, compa red to approximately 110\unit{ms} for standard PF. The MLPF algorithm is also validated on Run~3 collision data, representing the first data-validated ML-based reconstruction pipeline at any LHC experiment. We then extend MLPF toward future electron--positron colliders and introduce the first full-simulation cross-detector transfer learning workflow for PF reconstruction. The model is pre-trained on simulated events from the Compact Linear Collider detector (CLICdet) and fine-tuned on the CLIC-like detector (CLD) proposed for the Future Circular Collider (FCC). This approach achieves up to a 40\% improvement in jet energy resolution over rule-based reconstruction while reducing the required training dataset size by an order of magnitude, demonstrating the potential of AI to accelerate detector development and optimization. This dissertation also demonstrates how modern AI techniques enhance the sensitivity of LHC physics analyses. A CMS search for highly Lorentz-boosted Higgs bosons decaying to \textrm{W} boson pairs is presented, focusing on the single-lepton final state. A dedicated fine-tuning strategy for \ParT yields an approximately 70\% increase in expected sensitivity relative to the baseline model. The analysis uses proton--proton collision data at a center-of-mass energy of \ensuremath{\sqrt{s}=13\TeV} collected by CMS between 2016 and 2018, corresponding to an integrated luminosity of 138\ensuremath{\ \mathrm{fb}^{-1}}. The expected significance of the search is $1.86\sigma$, with an observed signal strength of $-0.19^{+0.48}_{-0.46}$. Finally, explainable AI techniques are applied to the MLPF and \ParticleNet algorithms using layerwise relevance propagation, showing that both models base their predictions on physically meaningful features consistent with our physics intuition. Together, these results demonstrate how advanced AI methods can enhance reconstruction, analysis sensitivity, and interpretability, shaping the next era of experimental parti cle physics.

Mokhtar, Farouk [UC, San Diego]↗
DOE OSTI2026

Identification of Solid-Electrolyte Interphase Species by Joint Characterization of Li-Ion Battery Chemistry by Mass Spectrometry and Electrochemical Reaction Networks

The formation and stability of the solid-electrolyte interphase (SEI) play central roles in determining the long-term performance and safety of modern electrochemical energy storage systems. Despite decades of research, the SEI’s heterogeneous, dynamic, and multiphase nature has defied comprehensive molecular-level characterization, creating a critical knowledge gap that limits rational battery design. In this work, we introduce a computational−experimental framework that integrates high-throughput quantum chemistry calculations, data-driven electrochemical reaction networks (eCRNs), stochastic algorithms, and laser desorption/ionization Fourier transform ion cyclotron resonance mass spectrometry (LDI-FTICR-MS) to unravel SEI formation in carbonatebased electrolytes without imposing predefined mechanisms. We constructed the most comprehensive eCRN to date, spanning over 10,000 species and 209 million reactions. Through stochastic network analysis, we successfully recovered 27 species that were previously reported in the literature and predicted 28 novel SEI species nearly doubling our scientific knowledge in this area. Each new species was rigorously confirmed through advanced mass spectral analysis of its distinct molecular and isotopic signatures. We kinetically refined the formation pathways for a select set of both previously reported and novel SEI products, revealing kinetically feasible elementary reaction mechanisms with activation barriers below 1 eV. This computational−experimental approach deepens our molecular-level understanding of SEI chemistry by resolving which species form and through which decomposition mechanisms they emerge. Such knowledge provides the foundation necessary to connect electrolyte composition to the resulting SEI components, a critical step toward a more informed electrolyte development in next-generation lithium-based batteries.

25 ENERGY STORAGE↗
DOE OSTI2020

Fast and Universal Kohn-Sham Density Functional Theory Algorithm for Warm Dense Matter to Hot Dense Plasma

Understanding many processes, e.g., fusion experiments, planetary interiors, and dwarf stars, depends strongly on microscopic physics modeling of warm dense matter and hot dense plasma. This complex state of matter consists of a transient mixture of degenerate and nearly free electrons, molecules, and ions. This regime challenges both experiment and analytical modeling, necessitating predictive ab initio atomistic computation, typically based on quantum mechanical Kohn-Sham density functional theory (KS-DFT). However, cubic computational scaling with temperature and system size prohibits the use of DFT through much of the warm dense matter regime. A recently developed stochastic approach to KS-DFT can be used at high temperatures, with the exact same accuracy as the deterministic approach, but the stochastic error can converge slowly and it remains expensive for intermediate temperatures (< 50 eV). Here we have developed a universal mixed stochastic-deterministic algorithm for DFT at any temperature. This approach leverages the physics of KS-DFT to seamlessly integrate the best aspects of these different approaches. We demonstrate that this method significantly accelerated self-consistent field calculations for temperatures from 3 to 50 eV, while producing stable molecular dynamics and accurate diffusion coefficients.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Image feature extraction and galaxy classification: a novel and efficient approach with automated machine learning

ABSTRACT In this work, we explore the possibility of applying machine learning methods designed for 1D problems to the task of galaxy image classification. The algorithms used for image classification typically rely on multiple costly steps, such as the point spread function deconvolution and the training and application of complex Convolutional Neural Networks of thousands or even millions of parameters. In our approach, we extract features from the galaxy images by analysing the elliptical isophotes in their light distribution and collect the information in a sequence. The sequences obtained with this method present definite features allowing a direct distinction between galaxy types. Then, we train and classify the sequences with machine learning algorithms, designed through the platform Modulos AutoML. As a demonstration of this method, we use the second public release of the Dark Energy Survey (DES DR2). We show that we are able to successfully distinguish between early-type and late-type galaxies, for images with signal-to-noise ratio greater than 300. This yields an accuracy of $86{{\ \rm per\ cent}}$ for the early-type galaxies and $93{{\ \rm per\ cent}}$ for the late-type galaxies, which is on par with most contemporary automated image classification approaches. The data dimensionality reduction of our novel method implies a significant lowering in computational cost of classification. In the perspective of future data sets obtained with e.g. Euclid and the Vera Rubin Observatory, this work represents a path towards using a well-tested and widely used platform from industry in efficiently tackling galaxy classification problems at the peta-byte scale.

79 ASTRONOMY AND ASTROPHYSICS↗