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 217 records · Page 12

Autonomous platform for solution processing of electronic polymers

The manipulation of electronic polymers’ solid-state properties through processing is crucial in electronics and energy research. Yet, efficiently processing electronic polymer solutions into thin films with specific properties remains a formidable challenge. We introduce Polybot, an artificial intelligence (AI) driven automated material laboratory designed to autonomously explore processing pathways for achieving high-conductivity, low-defect electronic polymers films. Leveraging importance-guided Bayesian optimization, Polybot efficiently navigates a complex 7-dimensional processing space. In particular, the automated workflow and algorithms effectively explore the search space, mitigate biases, employ statistical methods to ensure data repeatability, and concurrently optimize multiple objectives with precision. The experimental campaign yields scale-up fabrication recipes, producing transparent conductive thin films with averaged conductivity exceeding 4500 S/cm. Feature importance analysis and morphological characterizations reveal key design factors. This work signifies a significant step towards transforming the manufacturing of electronic polymers, highlighting the potential of AI-driven automation in material science.

Wang, Chengshi [Argonne National Laboratory (ANL),↗

Performance of Advanced Signal Processing and Pattern Recognition Algorithms Using Raw Data from Ultrasonic Guided Waves and Fiber Optics Transducers

The Light Water Reactor Sustainability Program was initiated to evaluate technologies that could be used to perform online monitoring of piping and other secondary system structural components in commercial nuclear power plants. These online monitoring systems have the potential to identify when a more detailed inspection is needed using real-time measurements, rather than at a pre-determined inspection interval. This transition to condition-based, risk-informed automated maintenance will contribute to a significant reduction of operations and maintenance costs that account for most nuclear power generation costs. This report describes the current state of research related to ultrasonic guided wave testing and its application to detecting defects in commercial nuclear power plants. The report analyzes the applicability of the guided wave technology to secondary piping systems, as well as studying the potential for expanding the range of guided wave technology to include bent piping and other piping components. The ultrasonic guided waves can inspect long stretches of straight piping; however, more complex geometries such as elbows, welds, and tees are causing spurious reflections and coherent noise, which significantly decreases the sensitivity of the technique. To deal with these limitations, high-definition fiber optic sensors are applied to complex piping geometries, and advanced machine learning algorithms are used to detect deviations from healthy states. This report also analyzes the performance of advanced signal processing and machine learning-based pattern recognition algorithms in detecting defects in secondary structures. It is demonstrated on guided wave data collected at nuclear power plants that the independent component analysis can separate different coherent noise components and segregate them from useful signals. It also demonstrates that advanced machine learning techniques, such as neural networks, support vector machines, and deep learning networks, can detect minor defects present in inspected structures. Recommendation about the applicability of advanced machine learning techniques to online piping monitoring are also given.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Explainable Machine Learning for Functional Data

Black-box machine learning models are recognized as useful tools for prediction applications, but the algorithmic complexity of some models causes interpretation challenges. Explainability methods have been proposed to provide insight into these models, but there is little research focused on supervised modeling with functional data inputs. We argue that, especially in applications of high consequence, it is important to explicitly model the functional dependence in a black-box analysis to not obscure or misrepresent patterns in explanations. As such, we propose the V ariable importance E xplainable E lastic S hape A nalysis (VEESA) pipeline for training supervised machine learning models with functional inputs. The pipeline is an analysis process that includes the data preprocessing, modeling, and post-hoc explanations. The preprocessing is done using elastic functional principal components analysis, which accounts for vertical and horizontal variability in functional data and, ultimately, allows for explanations in the original data space that identify the important functional variability without bias due to correlated variables. Here, we demonstrate the pipeline on two high-consequence applications: explosives classification for national security and inkjet printer identification in forensic science. The applications exhibit the VEESA pipeline’s ability to provide an understanding of the characteristics of the functional data useful for prediction. Code for implementing the pipeline is available in the veesa R package (and supplemental python code).

Elastic Shape Analysis↗

Alpha Shape Analysis (ASA) Framework for Post- Clustering Property Determination in Atom Probe Tomographic Data

While application of clustering algorithms to atom probe tomography data have enabled quantification of solute clusters in terms of number density, size, and subcomposition there exist other properties (e.g., volume, surface area, and composition) that are better determined by defining an interface between the cluster and the surrounding matrix. The limitation in composition results from an ion selection step where the expected matrix ion types are omitted from the cluster search algorithm to enhance the contrast between the matrix and cluster and to reduce the complexity of the search. Previously, composition determination within solute clusters has utilized a secondary envelopment and erosion step on top of conventional methods such as maximum separation. In this work, we present a novel stochastic method that combines the particle identification fidelity of a conventional clustering algorithm with the analytical flexibility of mesh-based approaches through the generation of alpha shapes for each identified cluster. Furthermore, the corresponding mesh accounts for concave components of the clusters and determines the volume and surface area of the clusters; additionally, the mesh boundary is utilized to update the total composition according to the internal ions.

42 ENGINEERING↗

Fidelity Analysis of Complex Large-Scale Simulation Models of PEs (MARS) in Future Power Grids

With the proliferation of power electronic (PE)-based resources in the electric grid, there have been numerous different kinds of simulation models developed and studied to understand their dynamic behavior. Study of PE-based resources using each simulation model has its own distinct advantages and disadvantages. Therefore it is very important to carefully select the appropriate model for the evaluation of the PE-based resources. In this paper, one such effort is made to analyze the different types of models in the case of a multi-port autonomous reconfigurable solar power plant (MARS). The MARS integrates a hybrid photovoltaic (PV)-energy storage system (ESS) plant to high-voltage direct current (HVdc) system and transmission alternating current (ac) grid. The dynamic models are evaluated under different test cases varying the short-circuit ratio (SCR) and control algorithms. Recommendations are provided on the equipment study needs based on the analysis completed.

Marthi, Phani Ratna Vanamali↗

Domain Adaptation for Measurements of Strong Gravitational Lenses

Upcoming surveys are predicted to discover galaxy-scale strong lenses on the magnitude of 105, making deep learning methods necessary in lensing data analysis. Currently, there is insufficient real lensing data to train deep learning algorithms, but training only on simulated data results in poor performance on real data. Domain adaptation can bridge the gap between simulated and real datasets. We adopt domain adaptation on the estimation of Einstein radius in simulated galaxy-scale gravitational lensing images. We evaluate two domain adaptation techniques - domain adversarial neural networks (DANN) and maximum mean discrepancy (MMD). We train on a source domain of simulated lenses and apply it to a target domain with emulation of DES survey conditions. We show that both domain adaptation techniques can significantly improve the model performance on the more complex target domain datasets. Our results show the potential of using domain adaptation to perform analysis on future survey data with a deep neural network trained on simulated data.

79 ASTRONOMY AND ASTROPHYSICS↗

Design and implementation of dynamic I/O control scheme for large scale distributed file systems

In this paper, we have analyzed the input/output (I/O) activities of Cori, which is a high-performance computing system at the National Energy Research Scientific Computing Center at Lawrence Berkeley National Laboratory. Our analysis results indicate that most users do not adjust storage configurations but rather use the default settings. In addition, owing to the interference from many applications running simultaneously, the performance varies based on the system status. To configure file systems autonomously in complex environments, we developed DCA-IO, a dynamic distributed file system configuration adjustment algorithm that utilizes the system log information to adjust storage configurations automatically. Our scheme aims to improve the application performance and avoid interference from other applications without user intervention. Moreover, DCA-IO uses the existing system logs and does not require code modifications, an additional library, or user intervention. To demonstrate the effectiveness of DCA-IO, we performed experiments using I/O kernels of real applications in both an isolated small-sized Lustre environment and Cori. Our experimental results shows that our scheme can improve the performance of HPC applications by up to 263% with the default Lustre configuration.

97 MATHEMATICS AND COMPUTING↗

Application of deep learning methods for beam size control during user operation at the Advanced Light Source

Past research at the Advanced Light Source (ALS) provided a proof-of-principle demonstration that deep learning methods could be effectively employed to compensate for the significant perturbations to the transverse electron beam size induced by user-controlled adjustments of the insertion devices. However, incorporating these methods into the ALS’ daily operations has faced notable challenges. The complexity of the system’s operational requirements and the significant upkeep demands has restricted their sustained application during user operation. Here, we introduce the development of a more robust neural network (NN)-based algorithm that utilizes a novel online fine-tuning approach and its systematic integration into the day-to-day machine operations. Our analysis emphasizes the process of NN model selection, demonstrates the superior performance of the NN-based method over traditional feedback methods, and examines the effectiveness and resilience of the new algorithm during user-operation scenarios. Published by the American Physical Society 2024

43 PARTICLE ACCELERATORS↗

Path Sampling for Rare Events Boosted by Machine Learning

The study by Jung et al. introduced Artificial Intelligence for Molecular Mechanism Discovery (AIMMD), a novel sampling algorithm that integrates machine learning to enhance the efficiency of transition path sampling (TPS). By enabling on-the-fly estimation of the committor probability and simultaneously deriving a human-interpretable reaction coordinate, AIMMD offers a robust framework for elucidating the mechanistic pathways of complex molecular processes. Here, this commentary provides a discussion and critical analysis of the core AIMMD framework, explores its recent extensions, and offers an assessment of the method’s potential impact and limitations.

Minh, Porhouy [Univ. of Minnesota, Minneapolis, MN↗

Absolute contrast estimation for soft X-ray photon fluctuation spectroscopy using a variational droplet model

Abstract X-ray photon fluctuation spectroscopy using a two-pulse mode at the Linac Coherent Light Source has great potential for the study of quantum fluctuations in materials as it allows for exploration of low-energy physics. However, the complexity of the data analysis and interpretation still prevent recovering real-time results during an experiment, and can even complicate post-analysis processes. This is particularly true for high-spatial resolution applications using CCDs with small pixels, which can decrease the photon mapping accuracy resulting from the large electron cloud generation at the detector. Droplet algorithms endeavor to restore accurate photon maps, but the results can be altered by their hyper-parameters. We present numerical modeling tools through extensive simulations that mimic previous x-ray photon fluctuation spectroscopy experiments. By modification of a fast droplet algorithm, our results demonstrate how to optimize the precise parameters that lift the intrinsic counting degeneracy impeding accuracy in extracting the speckle contrast. These results allow for an absolute determination of the summed contrast from multi-pulse x-ray speckle diffraction, the modus operandi by which the correlation time for spontaneous fluctuations can be measured.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Nonlinear Diffusion Acceleration of the Least-Squares Transport Equation in Geometries with Voids

In this paper we show the extension of the Nonlinear-Diffusion Acceleration (NDA) to geometries containing small voids using a weighted least-squares (WLS) high order equation. Even though the WLS equation is well defined in voids, the low-order drift diffusion equation was not defined in materials with a zero cross section. This paper derives the necessary modifications to the NDA algorithm. We show that a small change to the NDA closure term and a non-local definition of the diffusion coefficient solve the problems for voids regions. These changes do not affect the algorithm for optical thick material regions, while making the algorithm well defined in optically thin ones. We use a Fourier analysis to perform an iterative analysis to confirm that the modifications result in a stable and efficient algorithm. Numerical results of our method will be presented in the second part of the paper. We test this formulation with a small, one-dimensional test problem. Additionally we present results for a modified version of the C5G7 benchmark containing voids as a more complex, reactor like problem. We compared our results to PDT, Texas A&M’s transport code, utilizing a first order discontinuous formulation as reference and the self-adjoint angular flux equation with void treatment (SAAFτ ), a different second order form. The results indicate, that the NDA WLS performed comparably or slightly worse then the asymmetric SAAFτ , while maintaining a symmetric discretization matrix.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Hybrid Analysis of Fusion Data for Online Understanding of Complex Science on Extreme Scale Computers

The current practice for fusion scientists running first principle simulations on high performance computing plat-forms is to either run their simulations and output their data for post-hoc analysis, or to place in situ analytics into their code. In this paper we examine a complex workflow using XGC fusions simulation run on the Oak Ridge Leadership Computing Facility's supercomputer Summit, which also involve three anal-yses as part of the results necessary for scientific discovery. We discuss the challenges faced when implementing these algorithms and present an original hybrid staging technique to help enable the physicists to make discoveries during the execution of the simulation. By creating this infrastructure, we can examine complicated physics results, which may not have been possible without the infrastructure. For example, our work enables the online visualization of turbulent homoclinic tangle around the magnetic X-point, breaking the last confinement surface. This visualization could help fusion scientists to better understand and improve the turbulence spread of plasma exhaust heat, which is crucial toward realizing plasmas beyond the currently accessible physics regimes of present-day tokamak reactors. The physics of turbulent homoclinic tangle will be reported in a future physics publication, by utilizing the original online analysis/visualization framework presented in this paper.

Suchyta, Eric↗

EKF-Based Enhanced Performance Controller Design for Nonlinear Stochastic Systems

In this paper, a novel control algorithm is presented to enhance the performance of tracking property for a class of non-linear dynamic stochastic systems with unmeasurable variables. To minimize the entropy of tracking errors without changing the existing closed loop with PI controller, the enhanced performance loop is constructed based on the state estimation by extended Kalman Filter and the new controller is designed by full state feedback following this presented control algorithm. Besides, the conditions are obtained for the stability analysis in the mean square sense. In the end, the comparative simulation results are given to illustrate the effectiveness of proposed control algorithm.

Complex industrial process↗

Tetrahedral Trees: A Family of Hierarchical Spatial Indexes for Tetrahedral Meshes

In this work, we address the problem of performing efficient spatial and topological queries on large tetrahedral meshes with arbitrary topology and complex boundaries. Such meshes arise in several application domains, such as 3D Geographic Information Systems (GISs), scientific visualization, and finite element analysis. To this aim, we propose Tetrahedral trees, a family of spatial indexes based on a nested space subdivision (an octree or a kD-tree) and defined by several different subdivision criteria. We provide efficient algorithms for spatial and topological queries on Tetrahedral trees and compare to state-of-the-art approaches. Our results indicate that Tetrahedral trees are an improvement over R*-trees for querying tetrahedral meshes; they are more compact, faster in many queries, and stable at variations of construction thresholds. They also support spatial queries on more general domains than topological data structures, which explicitly encode adjacency information for efficient navigation but have difficulties with domains with a non-trivial geometric or topological shape.

97 MATHEMATICS AND COMPUTING↗

Time domain-induced polarization geophysical data collected in the Rifle Floodplain, Colorado, USA

The IP data set was collected using a time domain-induced polarization (TDIP) method along 65 profiles of various lengths over the floodplain. Surface time domain?induced polarization (TDIP) data was collected to create the 3?D images of the complex electrical resistivity, in terms of magnitude and phase, which are associated with mineral precipitation and other lithological properties. The TDIP data was then used to estimate the spatial distribution of naturally reduced zones, which are known to be biogeochemical hotspots in floodplains having increased uranium and other redox-sensitive metal concentrations as well as high carbon contents. In the TDIP method, the transient decay of voltage is measured after current shut-off, typically in the form of an integral of decay curves over a predefined time window (so-called integral chargeability). TDIP measurements at the site were collected using the Syscal Iris Pro Switch equipment with a square-wave current injection, 50% duty cycle, and a pulse length of 2 s. The integral chargeability measurements were carried out using 20 windows during voltage decay between 240 and 1840 ms after current shut-off. Tomographic measurements were collected by deploying stainless steel electrodes with an electrode separation of 1.8 m and using a dipole-dipole ‘‘skip-2’’ and ‘‘skip-3’’ measuring protocol (i.e., for a dipoles length of 5.4 and 7.2 m, respectively). The sequence of dipole-dipole measurements was carefully arranged to (1) minimize unwanted electromagnetic coupling effects in the data, avoiding potential measurements with electrodes located inside the current dipole, (2) prevent voltage measurements using electrodes, which might be polarized due to previous current injection, and (3) increase the signal-to-noise ratio for an intended exploration depth of 8 m, i.e., the bottom of the aquifer. All measurements were collected as normal and reciprocal pairs for estimation of the data error. The IP measurements were collected with symmetric arrays (i.e., the measuring equipment placed at the center of the electrode array) with a maximum of 36 electrodes, considering that longer profiles revealed a significant increase in the normal-reciprocal misfit for the measurements of the decay curve, probably due to greater impact of electromagnetic coupling on the data. The TDIP data sets were inverted in a twodimensional domain along each transect using CRTomo, which is a smoothness-constraint inversion code based on a finite element algorithm. The resistivity and phase shift values at each pixel were then assigned at the corresponding point within the 3-D floodplain domain (the black rectangle Figure 1b) and used in the 3-D estimation. The TDIP inversion results provided the distribution of the complex resistivity, expressed in terms of its magnitude and phase-shift. The analysis of the normal-reciprocal misfit was used to estimate the relative error. We removed the measurement with smallest voltage difference (<2 mV), representing about 2% variations in the data. For the inversion of TDIP measurements, chargeability values were linearly converted to frequency domain phase values (at the fundamental frequency of 0.125 Hz), by assuming a constant-phase response. This approach has been demonstrated to provide consistent results in previous studies

54 ENVIRONMENTAL SCIENCES↗

Atomic Resolution Cryogenic 4D-STEM Imaging via Robust Distortion Correction

Cryogenic four-dimensional scanning transmission electron microscopy (4D-STEM) imaging is a useful technique for studying quantum materials and their interfaces by simultaneously probing charge, lattice, spin, and chemistry on the atomic scale with the sample held at temperatures ranging from room to cryogenic. However, its applications are currently limited by the instabilities of cryo-stages and electronics. To overcome this challenge, we develop an algorithm to effectively correct the complex distortions present in atomic resolution cryogenic 4D-STEM data sets. This method uses nonrigid registration to identify localized distortions in a 4D-STEM and relate them to an undistorted experimental STEM image, followed by a series of affine transformations for distortion corrections. This method allows a minimum loss of information in both reciprocal and real spaces, enabling the reconstruction of sample information from 4D-STEM data sets. This method is computationally cheap, fast, and applicable for on-the-fly data analysis in future in situ cryogenic 4D-STEM experiments.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Exploratory analysis and performance prediction of big data transfer in High-performance Networks

Big data transfer in large-scale scientific and business applications is increasingly carried out over connections with guaranteed bandwidth provisioned in High-performance Networks (HPNs) via advance bandwidth reservation. Provisioning agents need to carefully schedule data transfer requests, compute network paths, and allocate appropriate bandwidths. Such reserved bandwidths, if not fully utilized, could be simply wasted due to the exclusive access during the approved time window, and cause extra overhead and complexity for resource management. This calls for accurate performance prediction to reserve bandwidths that match actual needs and avoid over-provisioning. We employ machine learning algorithms to predict big data transfer performance based on extensive performance measurements collected in the past several years from data transfer tests using different protocols and toolkits between various end sites on several real-life physical or emulated testbeds. We first analyze the performance patterns in response to a comprehensive list of parameters in end-host systems, network connections, and data transfer applications, which motivate the use of machine learning and also help us identify the effects of latent factors. We then propose threshold- and clustering-based methods to eliminate negative effects of latent factors in data preprocessing and build a robust performance predictor based on customized domain-oriented loss functions. The performance of the proposed methods is verified by extensive experiments using SVR and RFR as well as theoretical analysis of the general performance bound.

97 MATHEMATICS AND COMPUTING↗