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 451 records · Page 25
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Winners are not keepers: Characterizing household engagement, gains, and energy patterns in demand response using machine learning in the United States

Demand-response programs can help utilities manage rapidly evolving electric grids, but these programs are subject to the complexities of human behavior. This paper explores a novel method for uncovering heterogeneity in households. In this work, we use a machine-learning method known as a Conditional Inference Tree (c-tree) algorithm to categorize households based on their energy behavior characteristics collected via smart meters, and explore how this translates through into heterogeneity in their real-world response to a DR program. Using data from randomized controlled trial, we generate estimates of the changes in energy use caused by the program within each household group. Our results show that the c-tree approach differentiates households by their energy-use characteristics in a way that increases the spread in enrollment rates and critical peak reduction among household groups, compared with the spreads achieved via several conventional segmentation methods. Thus, the c-tree analysis enables the most tailored targeting of major potential energy savers and could provide the greatest increase in cost-effectiveness of household recruitment into DR programs. Our results also offer fresh insights into the relationships between household energy behavior characteristics – such as peak energy use and “structural winningness” (the ability to save money under a DR program without changing energy-use behaviors) – and household decisions about enrolling in DR programs and reducing energy use. Our research also demonstrates the potential of smart meter data, combined with machine learning and econometric methods, to provide significant value to utilities, program implementers, researchers, and other stakeholders.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2026

Identification of drug repurposing candidates for amyotrophic lateral sclerosis using electronic health records: a retrospective cohort study

Amyotrophic lateral sclerosis (ALS) is a progressive neurodegenerative disease with a life expectancy of only 3–5 years and few approved treatments. To identify drug repurposing candidates for the treatment of ALS, we analysed the electronic health records (EHRs) of a large cohort of military veterans with ALS. We analysed the EHRs of individuals in the US Veterans Health Administration (VHA) database who were diagnosed with ALS between Jan 1, 2009 and Dec 31, 2019 to assess medication effects. Individuals without recorded prescriptions after the date of diagnosis were excluded. Two sets of criteria were applied to ascertain exposure. Exposure criteria A were met if the dispense date or the end date of the medication was within 12 months of ALS diagnosis and the end date was at least 6 months after the dispense date. Exposure criteria B were met if there were at least two dispenses within 6 months before diagnosis and 12 months after diagnosis. Propensity score-matched control groups were generated on the basis of confounders included in the EHR, with methodology of potential outcomes used to infer treatment effects. The primary outcome was death. A standard Cox proportional hazards analysis was done to assess association with survival. Survival was defined as the time from diagnosis date recorded in the EHR to death reported in the Department for Veterans Affairs Vital Status File. Follow-up survival time was censored on Dec 31, 2020, for those alive on this date. Downstream protein targets of drugs with clinically significant effects were analysed using the protein–protein interaction networks-based algorithm PathFX. The EHRs of 11 003 individuals with ALS in the VHA database were appropriate for analysis. 162 medications with treatment groups of 30 or more individuals were identified. Among these 162 medications, 27 were associated with statistically significant changes (≥0·1) in the hazard ratio (HR) for death. 18 of the medications were associated with a reduced HR for death (prolonged survival), and nine were associated with an increased HR for death (reduced survival). Drugs associated with reduced HR included HMG-CoA reductase inhibitors (simvastatin, pravastatin, lovastatin, and atorvastatin), PDE5 inhibitors (vardenafil and sildenafil), and α-adrenergic antagonists (tamsulosin and terazosin). The medications associated with an increased HR were drugs used either in the management of clinical features of ALS associated with poor outcomes or in end-of-life care. PathFx analysis identified a complex of proteins interacting with several of the identified drugs. To our knowledge, this analysis is the largest EHR-based study for identifying drug repurposing candidates for ALS. We identified several drugs that warrant further assessment as therapeutic options in ALS, as well as a protein network complex that might serve as a therapeutic target for ALS.

Reimer, Richard J. [Stanford Univ., CA (United Sta↗
DOE OSTI2018

Evaluation and Comparison of Machine Learning Techniques for Rapid QSTS Simulations

Rapid and accurate quasi-static time series (QSTS) analysis is becoming increasingly important for distribution system analysis as the complexity of the distribution system intensifies with the addition of new types, and quantities, of distributed energy resources (DER). The expanding need for hosting capacity analysis, control systems analysis, photovoltaic (PV) and DER impact analysis, and maintenance cost estimations are just a few reasons that QSTS is necessary. Historically, QSTS analysis has been prohibitively slow due to the number of computations required for a full-year analysis. Therefore, new techniques are required that allow QSTS analysis to rapidly be performed for many different use cases. This research demonstrates a novel approach to doing rapid QSTS analysis for analyzing the number of voltage regulator tap changes in a distribution system with PV components. A representative portion of a yearlong dataset is selected and QSTS analysis is performed to determine the number of tap changes, and this is used as training data for a machine learning algorithm. The machine learning algorithm is then used to predict the number of tap changes in the remaining portion of the year not analyzed directly with QSTS. The predictions from the machine learning algorithms are combined with the results of the partial year simulation for a final prediction for the entire year, with the goal of maintaining an error <10% on the full-year prediction. Five different machine learning techniques were evaluated and compared with each other; a neural network ensemble, a random forest decision tree ensemble, a boosted decision tree ensemble, support vector machines, and a convolutional neural network deep learning technique. A combination of the neural network ensemble together with the random forest produced the best results. Using 20% of the year as training data, analyzed with QSTS, the average performance of the technique resulted in ~2.5% error in the yearly tap changes, while maintaining a <10% 99.9 th percentile error bound on the results. This is a 5x speedup compared to a standard, full-length QSTS simulation. These results demonstrate the potential for applying machine learning techniques to facilitate modern distribution system analysis and further integration of distributed energy resources into the power grid.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2019

Nearly Optimal Lattice Simulation by Product Formulas

We consider simulating an n-qubit Hamiltonian with nearest-neighbor interactions evolving for time t on a quantum computer. We show that this simulation has gate complexity (nt)1+o(1) using product formulas, a straightforward approach that has been demonstrated by several experimental groups. While it is reasonable to expect this complexity—in particular, this was claimed without rigorous justification by Jordan, Lee, and Preskill—we are not aware of a straightforward proof. Furthermore, our approach is based on an analysis of the local error structure of product formulas, as introduced by Descombes and Thalhammer and significantly simplified here. We prove error bounds for canonical product formulas, which include well-known constructions such as the Lie-Trotter-Suzuki formulas. We also develop a local error representation for time-dependent Hamiltonian simulation, and we discuss generalizations to periodic boundary conditions, constant-range interactions, and higher dimensions. Combined with a previous lower bound, our result implies that product formulas can simulate lattice Hamiltonians with nearly optimal gate complexity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

Optimal net-load balancing in smart grids with high PV penetration

Mitigating mismatches in supply demand curve is critical for smooth power grid operation. Traditionally, load curtailment techniques such as Demand Response (DR) have been used for this purpose. However, smart grids with high PV penetration sometimes exhibit supply surplus causing over-voltages. Thus, load curtailment techniques cannot be the only component of a net-load balancing framework. Supply curtailment techniques such as Volt-Var Optimizations are complex and computationally expensive. This increases the complexity of net-load balancing systems used by the grid operator and limits their scalability. Recently, new technologies have been developed that enable the rapid and selective connection of PV modules of an installation to the grid. Taking advantage of these advancements, we develop a unified optimal net-load balancing framework which performs both load and solar curtailment. We show that when the available curtailment values are discrete, this problem is NP-hard and develop bounded approximation algorithms for minimizing the curtailment cost. Our algorithms produce fast solutions, given the tight timing constraints required for grid operation. We also incorporate the notion of fairness to ensure that curtailment is evenly distributed among all the nodes. Finally, we develop an online algorithm which performs net-load balancing using only data available for the current interval. Using both theoretical analysis and practical evaluations, we show that our net-load balancing algorithms provide solutions which are close to optimal in a small amount of time.

14 SOLAR ENERGY↗
DOE OSTI2018

Algorithmic Patterns for $$\mathcal {H}$$-Matrices on Many-Core Processors

In this work, we consider the reformulation of hierarchical ( \(\mathcal {H}\) ) matrix algorithms for many-core processors with a model implementation on graphics processing units (GPUs). \(\mathcal {H}\) matrices approximate specific dense matrices, e.g., from discretized integral equations or kernel ridge regression, leading to log-linear time complexity in dense matrix–vector products. The parallelization of \(\mathcal {H}\) matrix operations on many-core processors is difficult due to the complex nature of the underlying algorithms. While previous algorithmic advances for many-core hardware focused on accelerating existing \(\mathcal {H}\) matrix CPU implementations by many-core processors, we here aim at totally relying on that processor type. As main contribution, we introduce the necessary parallel algorithmic patterns allowing to map the full \(\mathcal {H}\) matrix construction and the fast matrix–vector product to many-core hardware. In this work, crucial ingredients are space filling curves, parallel tree traversal and batching of linear algebra operations. The resulting model GPU implementation hmglib is the, to the best of the authors knowledge, first entirely GPU-based Open Source \(\mathcal {H}\) matrix library of this kind. We investigate application examples as present in kernel ridge regression, Gaussian Process Regression and kernel-based interpolation. In this context, an in-depth performance analysis and a comparative performance study against a standard multi-core CPU \(\mathcal {H}\) matrix library highlights profound speedups of our many-core parallel approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

From 2D to 4D: a containerized workflow and browser to explore dynamic chromatin architecture

Background Characterizing the physical organization of the genome is essential for understanding long-range gene regulation, chromatin compartmentalization, and epigenetic accessibility. Hi-C experiments generate two-dimensional (2D) genome-wide contact maps of chromatin interactions by capturing the spatial proximity between genomic loci, which reveal interaction frequencies but lack the spatial resolution needed to interpret the three-dimensional (3D) genome structure(s). Emerging evidence suggests that epigenetic regulation is closely linked to 3D genome architecture, and that structural changes over time (4D) drive key biological processes in development, disease, and environmental response. Thus, integrating 3D structure with functional data is critical for a more complete understanding of genome regulation. Previous work, most notably the 4DHiC chromosome modeling framework, has shown that physical multi-dimensional modeling approaches rooted in polymer physics and molecular dynamics can resolve these structures at biologically meaningful resolutions by integrating temporal Hi-C data with physical constraints to uncover dynamic chromosome reorganization. Thus, molecular dynamics simulations, constrained by Hi-C contact matrices, can resolve fine-scale structural changes and reveal functionally significant transitions in chromatin conformation. Results Herein, we present the 4D Genome Browser Workflow (4DGBWorkflow) and the 4D Genome Browser (4DGB). The algorithm is based on the 4DHiC method, and the containerized tool is an end-to-end workflow that can transform, filter, and view 4D epigenomics and chromatin datasets, allowing non-specialists to apply three-dimensional modeling principles to diverse datasets and experimental conditions. The software executes on a laptop running macOS, Linux or Windows. From input Hi-C files (.hic), the 4DGBWorkflow produces 3D reconstructions of chromosomes, integrates the reconstruction with track data (e.g., epigenetic marks, transcriptome profiles), and provides comparative visualization of the results in a single workflow. Conclusions The 4DGBWorkflow and 4D Genome Browser are open-source tools for comparative analysis and visualization of 4D chromosome datasets, including chromatin architecture and epigenomic signals. Automatic integration of Hi-C data with molecular dynamics democratizes the construction of time resolved 3D genome structures, simplifying complex simulations and data integration schemes.

3D Genome Browser↗
DOE OSTI2022

SPARC: Structural properties associated with residue constraints

SPARC facilitates the generation of plausible hypotheses regarding underlying biochemical mechanisms by structurally characterizing protein sequence constraints. Such constraints appear as residues co-conserved in functionally related subgroups, as subtle pairwise correlations (i.e., direct couplings), and as correlations among these sequence features or with structural features. SPARC performs three types of analyses. First, based on pairwise sequence correlations, it estimates the biological relevance of alternative conformations and of homomeric contacts, as illustrated here for death domains. Second, it estimates the statistical significance of the correspondence between directly coupled residue pairs and interactions at heterodimeric interfaces. Third, given molecular dynamics simulated structures, it characterizes interactions among constrained residues or between such residues and ligands that: (a) are stably maintained during the simulation; (b) undergo correlated formation and/or disruption of interactions with other constrained residues; or (c) switch between alternative interactions. We illustrate this for two homohexameric complexes: the bacterial enhancer binding protein (bEBP) NtrC1, which activates transcription by remodeling RNA polymerase (RNAP) containing σ 54 , and for DnaB helicase, which opens DNA at the bacterial replication fork. Based on the NtrC1 analysis, we hypothesize possible mechanisms for inhibiting ATP hydrolysis until ADP is released from an adjacent subunit and for coupling ATP hydrolysis to restructuring of σ 54 binding loops. Based on the DnaB analysis, we hypothesize that DnaB ‘grabs’ ssDNA by flipping every fourth base and inserting it into cavities between subunits and that flipping of a DnaB-specific glutamine residue triggers ATP hydrolysis.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Parallel sorting algorithm classification: is manual instrumentation necessary?

Understanding parallel algorithms is crucial for accelerating scientific simulations on complex, distributed memory, high-performance computers. Modern algorithm classification approaches learn semantics directly from source code to differentiate between algorithms, however, accessing source code is not always possible. We can learn about parallel algorithms from observing their performance, as programs running the same algorithms and using the same hardware should exhibit similar performance characteristics. We present an approach to learn algorithm classes from parallel performance data directly in order to classify algorithms without access to the source code. We extend previous work to enable classifying parallel sorting algorithms using automatic instrumentation instead of requiring manual region annotations in the source code. In this work, we design and demonstrate a study for classification of parallel sorting algorithms using parallel performance data collected from automatic instrumentation, and evaluate the performance of our new methodology on classification. We leverage Caliper to collect the performance data, Thicket for our exploratory data analysis (EDA), and PyTorch and Scikit-learn to evaluate the effectiveness of random forests, support vector machines (SVMs), decision trees, neural networks, and logistic regressions on parallel performance data. Additionally, we study noise in parallel performance data, whether the removal of noise and pre-processing of the data is necessary to accurately classify parallel sorting algorithms, and determine the effectiveness of features created from performance data. In conclusion, we demonstrate classification accuracy for these five different models of up to 97.7% across four different parallel algorithm classes.

Algorithm Classification↗
DOE OSTI2018

Case Study: Nuclear-Renewable-Water Integration in Arizona

This document reports the application of the N-R HES software framework to a case study for Arizona Public Service (APS); the manager and part owner of the Palo Verde (PV) nuclear power plant. The case study is a work in progress of which this report presents a detailed description of the current model input data, assumptions and the corresponding results produced by the developed software framework. The goal of the report is, that with this information APS (together with INL) should be able to identify where more detailed data and more accurate model assumptions are necessary to reproduce all driving physical and economic phenomena in order to capture enough complexity of the reality to allow APS to use the results for their strategic decisions. The N-R HES software framework started being developed at INL two years ago [ref]. The framework has reached some level of maturity so that it can be applied to more than simple demonstration cases, e.g. real industry problems. Nevertheless, more capabilities are constantly added to accommodate the special needs of these challenging real life problems. The N-R HES framework is built on top of the RAVEN code [ref] and uses it as driver and workflow manager for all calculations. The framework has specifically been developed for the economic assessment of N-R HES systems. There are four main cornerstones of the N-R HES simulation framework: 1) generation of stochastic time series, 2) a probabilistic analysis and optimization set of algorithms available in RAVEN, 3) a set of models for representation of the physical behavior of N-R HES, and 4) a RAVEN plug-in that maps physical performance into economic performance called CashFlow. Within this framework, a broad spectrum of questions related to N-R HES can be addressed. One of the challenges currently of high interest is that the increasing penetration of variable renewables is altering the profile of the net demand (demand after removing all non curtailable renewable energy sources), with which the other generators on the grid have to cope. The N-R HES software framework is capable to analyze the potential feasibility of mitigating the resultant volatility in the net electricity demand. One possible solution to that problem currently intensively studied by the energy industry is adding stabilizing loads to the grid. These loads can be external industrial processes that are able to ramp production up and down quickly or adding variable internal loads that will lift the base load of the power plant. The latter is a possible solution currently studied by APS. APS if currently anticipating several challenges that will likely arise in the near future. One of them is, as mentioned, coping with the rapid growth of variable renewable energy (VRE) sources put on the grid. Although APS can sell its electricity for a fixed retail price to cover the local demand first, it also sells electricity in excess of the local demand at the Palo Verde energy hub. Due to the growing VRE penetration, the Palo Verde hub electricity spot price is negative more and more frequently. To mitigate this price volatility, APS is seeking to add more base load, so that the quantity of excess energy to be sold for prices potentially less than the internal retail price or even negative prices at the hub is reduced. A second challenge APS is facing is that their cooling water acquisition contract with the Sub Regional Operating Group (SROG) will expire soon and a renewal can only be done for a significantly higher price of the water. Therefore, APS is also seeking for alternative sources for their cooling water. An opportunity currently under investigation is to pump a limited quantity of brackish water from the regional ground water. Although much cheaper than the water from the new SROG contract, the salinity of the brackish water is so high that a blend of brackish and SROG water would need additional treatment to improve its quality for use in the cooling towers. An on-site reverse osmosis (RO) desalination plant is envisaged to reduce the salinity to an acceptable level. This report investigates the economic impact of such an RO plant. As one can see, the RO plant would help with both problems APS is facing: First, it would rise the APS base load helping to mitigate VRE induced hub price volatility. From this perspective, the RO plant can be seen as a stabilizing load on the grid as would be any other industrial process. Second, the RO’s goods, e.g. the clean water produced can be used by APS itself for a (hopefully) lower cost than 100% SROG water would be. The report will first describe the APS water procurement strategy in detail and lay out the possible alternative scenarios studied in this document. This is covered in Chapter 2. Next, in Chapter 3, the APS case model developed within the N-R HES software framework is described. This chapter includes also a description of the needed framework developments to accommodate the APS study.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Generating Synthetic Time Series Photovoltaic Data with Real-World Physical Challenges and Noise for Use in Algorithm Test and Validation

The PV Fleet Data Initiative and other projects seek the develop algorithms for automated analysis of PV time series data for extraction of statistical information and other parameters of the data such as degradation rates, soiling loss information, tracker performance, clipping or curtailment, system availability and other valuable information. While there is a vast body of PV data available for application of said extraction algorithms it is difficult to validate these algorithms because the true parameters to be extracted are not known. There has been a wide use of synthetic data in the literature for algorithm validation but this synthetic data is typically very bounded by the problem or topic at hand. The PV Fleet Data Initiative project has demonstrated that real time series PV data almost always includes a host of data quality and physical problems that, in reality, any automated PV abstraction algorithm must handle appropriately. For this reason, this work describes the development of a complex synthetic PV times series data set that includes data quality and physical problems that have been experienced in real world PV data. The various quality and physical problems are documented in the synthetic data so that users can test the validity of various PV extraction algorithms as well as develop new algorithms to solve problems this data set can support.

14 SOLAR ENERGY↗
DOE OSTI2026

Promise of Graph Sparsification and Decomposition for Noise Reduction in QAOA: Analysis for Trapped-Ion Compilations

We develop new approximate compilation schemes that significantly reduce the expense of compiling the Quantum Approximate Optimization Algorithm (QAOA) for solving the Max-Cut problem. Our main focus is on compilation with trapped-ion simulators using Pauli-X operations and all-to-all Ising Hamiltonian HIsing evolution generated by Molmer-Sorensen or optical dipole force interactions, though some of our results also apply to standard gate-based compilations. Our results are based on principles of graph sparsification and decomposition; the former reduces the number of edges in a graph while maintaining its cut structure, while the latter breaks a weighted graph into a small number of unweighted graphs. Though these techniques have been used as heuristics in various hybrid quantum algorithms, there have been no guarantees on their performance, to the best of our knowledge. This work provides the first provable guarantees using sparsification and decomposition to improve quantum noise resilience and reduce quantum circuit complexity. For quantum hardware that uses edge-by-edge QAOA compilations, sparsification leads to a direct reduction in circuit complexity. For trapped-ion quantum simulators implementing all-to-all HIsing pulses, we show that for a (1−ϵ) factor loss in the Max-Cut approximation (ϵ>0), our compilations improve the (worst-case) number of HIsing pulses from O(n2) to O(nlog(n/ϵ)) and the (worst-case) number of Pauli-X bit flips from O(n2) to O(nlog(n/ϵ)ϵ2) for n-node graphs. This is an asymptotic improvement for any constant ϵ>0. We demonstrate that significant improvements to the approximation ratio are obtained using decomposition in simulated trapped-ion experiments with dephasing noise. We further present a generic argument showing that sparsification results in an exponentially improved circuit fidelity lower bound in digital computing schemes based on one- and two-qubit gates, which are relevant to a wide variety of hardwares such as superconducting qubits and certain neutral atom or trapped ion setups, and more sophisticated noise models. We anticipate these approximate compilation techniques will be useful tools in a variety of future quantum computing experiments.

Moondra, Jai [Georgia Institute of Technology]↗
DOE OSTI2020

TeraChem Cloud: A High-Performance Computing Service for Scalable Distributed GPU-Accelerated Electronic Structure Calculations

The encapsulation and commoditization of electronic structure arise naturally as interoperability, and the use of nontraditional compute resources (e.g., new hardware accelerators, cloud computing) remains important for the computational chemistry community. Here, we present TERACHEM CLOUD, a high-performance computing service (HPCS) that offers on-demand electronic structure calculations on both traditional HPC clusters and cloud-based hardware. The framework is designed using off-the-shelf web technologies and containerization to be extremely scalable and portable. Within the HPCS model, users can quickly develop new methods and algorithms in an interactive environment on their laptop while allowing TERACHEM CLOUD to distribute ab initio calculations across all available resources. This approach greatly increases the accessibility of hardware accelerators such as graphics processing units (GPUs) and flexibility for the development of new methods as additional electronic structure packages are integrated into the framework as alternative backends. Cost-performance analysis indicates that traditional nodes are the most cost-effective long-term solution, but commercial cloud providers offer cutting-edge hardware with competitive rates for short-term large-scale calculations. We demonstrate the power of the TERACHEM CLOUD framework by carrying out several showcase calculations, including the generation of 300,000 density functional theory energy and gradient evaluations on medium-sized organic molecules and reproducing 300 fs of nonadiabatic dynamics on the B800-B850 antenna complex in LH2, with the latter demonstration using over 50 Tesla V100 GPUs in a commercial cloud environment in 8 h for approximately $1250.

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

Exhaustive Product Analysis of Three Benzene Discharges by Microwave Spectroscopy

Using chirped and cavity microwave spectroscopies, automated double resonance, new high-speed fitting and deep learning algorithms, and large databases of computed structures, the discharge products of benzene alone, or in combination with molecular oxygen or nitrogen, have been exhaustively characterized between 6.5 and 26 GHz. In total, more than 3300 spectral features were observed; 89% of these, accounting for 97% of the total intensity, have now been assigned to 152 distinct chemical species and 60 of their variants (i.e., isotopic species and vibrationally excited states). Roughly 50 of the products are entirely new or poorly characterized at high resolution, including many heavier by mass than the precursor benzene. These findings provide direct evidence for a rich architecture of two- and three-dimensional carbon and indicate that benzene growth, particularly the formation of ring–chain molecules, occurs facilely under our experimental conditions. The present analysis also illustrates the utility of microwave spectroscopy as a precision tool for complex mixture analysis, irrespective of whether the rotational spectrum of a product species is known a priori or not. From this large quantity of data, for example, it is possible to determine with confidence the relative abundances of different product masses, but more importantly the relative abundances of different isomers with the same mass. We review the complementary nature of this type of analysis to traditional mass spectrometry.

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

Automation of Laser Plasma Focused Ion Beam Microscopy for Next-Gen Energy Materials

Automation can revolutionize the use of ultrafast laser ablation and plasma-focused ion beam (PFIB) techniques for high-throughput, reproducible cross-sectioning and various sample preparation in materials characterization. As these methods become essential for analyzing complex energy materials and next-generation devices, efficient, standardized workflows are needed to minimize variability and enhance precision. This work highlights our advancements in developing automated processes for sample preparation that integrates machine learning, workflow optimization, and large-scale data acquisition to improve efficiency and scalability in applications such as electrolyzers, photovoltaic cells, and microelectronics. To streamline cross-sectioning and lamella fabrication, we have implemented fully automated workflows that standardize laser ablation and PFIB milling sequences. These workflows incorporate pre-programmed protocols for material removal, alignment, and thinning, reducing user intervention and ensuring consistency across different sample types. Machine learning algorithms further enhance automation by predicting optimal milling strategies and adapting parameters based on material properties and sectioning requirements. This approach significantly improves throughput while maintaining the structural integrity of prepared samples for high-resolution imaging and analysis, including transmission electron microscopy. Beyond sample preparation, our automation platform enables the acquisition of large, high-resolution datasets through serial sectioning, image alignment, and 3D reconstruction. These automated routines facilitate multi-scale characterization, capturing structural and compositional details from the nanoscale to the device level. By reducing variability and increasing efficiency, our automated approach enhances defect analysis, failure diagnostics, and process optimization, accelerating advancements in materials research and device engineering.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Machine-learning based approach to examine ecological processes influencing the diversity of riverine dissolved organic matter composition

Dissolved organic matter (DOM) assemblages in freshwater rivers are formed from mixtures of simple to complex compounds that are highly variable across time and space. These mixtures largely form due to the environmental heterogeneity of river networks and the contribution of diverse allochthonous and autochthonous DOM sources. Most studies are, however, confined to local and regional scales, which precludes an understanding of how these mixtures arise at large, e.g., continental, spatial scales. The processes contributing to these mixtures are also difficult to study because of the complex interactions between various environmental factors and DOM. Here we propose the use of machine learning (ML) approaches to identify ecological processes contributing toward mixtures of DOM at a continental-scale. We related a dataset that characterized the molecular composition of DOM from river water and sediment with Fourier-transform ion cyclotron resonance mass spectrometry to explanatory physicochemical variables such as nutrient concentrations and stable water isotopes ( 2 H and 18 O). Using unsupervised ML, distinctive clusters for sediment and water samples were identified, with unique molecular compositions influenced by environmental factors like terrestrial input and microbial activity. Sediment clusters showed a higher proportion of protein-like and unclassified compounds than water clusters, while water clusters exhibited a more diversified chemical composition. We then applied a supervised ML approach, involving a two-stage use of SHapley Additive exPlanations (SHAP) values. In the first stage, SHAP values were obtained and used to identify key physicochemical variables. These parameters were employed to train models using both the default and subsequently tuned hyperparameters of the Histogram-based Gradient Boosting (HGB) algorithm. The supervised ML approach, using HGB and SHAP values, highlighted complex relationships between environmental factors and DOM diversity, in particular the existence of dams upstream, precipitation events, and other watershed characteristics were important in predicting higher chemical diversity in DOM. Our data-driven approach can now be used more generally to reveal the interplay between physical, chemical, and biological factors in determining the diversity of DOM in other ecosystems.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2018

Problem of Identification of Phase Transformation Models Used in Simulations of Steels Processing

Accuracy of phase transformation models depends on the correctness of coefficients evaluation, adequate to the investigated material. Dilatometric tests combined with the inverse analysis are used to perform identification. Since the problem is nonlinear, analytical approach is not possible and the inverse solution is transferred into the optimization task. It leads to difficulties typical for optimization of multivariable function such as local minima and lack of proof of the uniqueness. The problem of the effectiveness and uniqueness of the inverse algorithms used for identification of phase transformation models for steels was investigated for two models. The first was a modified JMAK (Johnson–Mehl–Avrami–Kolmogorov) equation. The second was an upgrade of the Leblond equation, in which second-order derivative of the volume fraction with respect to time was introduced. In classical identification, the result for one transformation depends on the coefficients for the remaining transformations and optimization has to be performed several times until the compatibility between transformations is reached. To avoid encountered problems, complex optimization simultaneously for all coefficients in the models was performed. This approach was based on nature-inspired optimization techniques. Models with identified coefficients for various steels were validated in simulations of industrial processes of laminar cooling and continuous annealing of strips.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Assessing MP2 frozen natural orbitals in relativistic correlated electronic structure calculations

The high computational scaling with the basis set size and the number of correlated electrons is a bottleneck limiting applications of coupled cluster algorithms, in particular for calculations based on two- or four-component relativistic Hamiltonians, which often employ uncontracted basis sets. This problem may be alleviated by replacing canonical Hartree–Fock virtual orbitals by natural orbitals (NOs). Here, in this paper, we describe the implementation of a module for generating NOs for correlated wavefunctions and, in particular, second order Møller–Plesset perturbation frozen natural orbitals (MP2FNOs) as a component of our novel implementation of relativistic coupled cluster theory for massively parallel architectures [Pototschnig et al. J. Chem. Theory Comput. 17, 5509, (2021)]. Our implementation can manipulate complex or quaternion density matrices, thus allowing for the generation of both Kramers-restricted and Kramers-unrestricted MP2FNOs. Furthermore, NOs are re-expressed in the parent atomic orbital (AO) basis, allowing for generating coupled cluster singles and doubles NOs in the AO basis for further analysis. By investigating the truncation errors of MP2FNOs for both the correlation energy and molecular properties—electric field gradients at the nuclei, electric dipole and quadrupole moments for hydrogen halides HX (X = F–Ts), and parity-violating energy differences for H 2 Z 2 (Z = O–Se)—we find MP2FNOs accelerate the convergence of the correlation energy in a roughly uniform manner across the Periodic Table. It is possible to obtain reliable estimates for both energies and the molecular properties considered with virtual molecular orbital spaces truncated to about half the size of the full spaces.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗