Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Iterative refinement”

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

Discovery of hydrogen storage molecules using large language models and machine learning

Accelerating the discovery of new molecules with targeted properties is a central challenge in molecular design. In this contribution, we present an AI-driven molecular discovery framework that integrates Large Language Models (LLMs) for generative molecular design with Machine Learning (ML)-based screening to identify novel Liquid Organic Hydrogen Carrier (LOHC) candidates. Using the developed framework, LOHC molecules were systematically generated, evaluated, and refined iteratively, combining LLM-guided molecular generation and ML-predicted hydrogenation enthalpies (Δ H ), under physicochemical property constraints such as optimal melting points (MP), desired hydrogen storage capacity (wt% H 2 ), and synthetic accessibility (SA) scores. This approach enabled the discovery of 42 new LOHC candidates in two distinct campaigns, one seeded with experimentally known and another with previously computationally identified LOHCs, respectively. Although we began with different numbers of starting molecules (31 vs . 7 seed molecules), both runs yielded a comparable number of viable candidates, suggesting an influence of chemically intuitive seed molecule selection for success. Selected LOHC molecules, such as 3-methyl pyridine, 1-ethylnapthalene, 1,1-diphenylethane, and benzofuran, were experimentally tested and compared with benchmark LOHCs (toluene and 9-ethylcarbazole) for hydrogenation using a series of commercial supported metal catalysts. The order of conversion into fully hydrogenated products at 200 °C was 3-methyl pyridine (100%) > 9-ethyl carbazole (86.4%) > 2,3-benzofuran (74%) > 1,1-diphenylethane (66.9%) > 1-ethylnapthalene (66.7%) > toluene (57%), further validating the AI-guided molecular design. This study demonstrates promise of LLM-driven molecular design in conjunction with ML-based screening for accelerated discovery and design of molecules.

Harb, Hassan [Argonne National Laboratory (ANL), A↗

Automated segmentation of soft X-ray tomography: Native cellular structure with submicron resolution at high-throughput for whole-cell quantitative imaging in yeast

Soft X-ray tomography (SXT) is an invaluable tool for quantitatively analyzing cellular structures at suboptical isotropic resolution. However, it has traditionally depended on manual segmentation, limiting its scalability for large datasets. Here, we leverage a deep learning-based autosegmentation pipeline to segment and label cellular structures in hundreds of cells across three Saccharomyces cerevisiae strains. This task-based pipeline uses manual iterative refinement to improve segmentation accuracy for key structures, including the cell body, nucleus, vacuole, and lipid droplets, enabling high-throughput and precise phenotypic analysis. Using this approach, we quantitatively compared the three-dimensional (3D) whole-cell morphometric characteristics of wild-type, VPH1-GFP, and vac14 strains, uncovering detailed strain-specific cell and organelle size and shape variations. We show the utility of SXT data for precise 3D curvature analysis of entire organelles and cells and detection of fine morphological features using surface meshes. Our approach facilitates comparative analyses with high spatial precision and statistical throughput, uncovering subtle morphological features at the single-cell and population level. This workflow significantly enhances our ability to characterize cell anatomy and supports scalable studies on the mesoscale, with applications in investigating cellular architecture, organelle biology, and genetic research across diverse biological contexts.

Chen, Jianhua [Lawrence Berkeley National Laborato↗

SODAs: sparse optimization for the discovery of differential and algebraic equations

Differential-algebraic equations (DAEs) integrate ordinary differential equations (ODEs) with algebraic constraints, providing a fundamental framework for developing models of dynamical systems characterized by time-scale separation, conservation laws and physical constraints. While sparse optimization has revolutionized model development by allowing data-driven discovery of parsimonious models from a library of possible equations, existing approaches for dynamical systems assume DAEs can be reduced to ODEs by eliminating variables before model discovery. This assumption limits the applicability of such methods for DAE systems with unknown constraints and time scales. We introduce sparse optimization for differential-algebraic systems (SODAs), a data-driven method for the identification of DAEs in their explicit form. By discovering the algebraic and dynamic components sequentially without prior identification of the algebraic variables, this approach leads to a sequence of convex optimization problems. It has the advantage of discovering interpretable models that preserve the structure of the underlying physical system. To this end, SODAs improves since SODAs is singular numerical stability when handling high correlations between library terms, caused by near-perfect algebraic relationships, by iteratively refining the conditioning of the candidate library. We demonstrate the performance of our method on biological, mechanical and electrical systems, showcasing its robustness to noise in both simulated time series and real-time experimental data.

DAE↗

Unwarping GISAXS data

Explore the source record for details and available documents.

99 GENERAL AND MISCELLANEOUS↗

Iterative Linearization for Phasor-Defined Optimal Power Dispatch

Optimal power flow (OPF) problems, which dispatch power targets to controllable generating units across a network, must generally account for non-convex constraints on power flow. Furthermore, adapting those problems so as to make them solvable with convex optimization techniques is an area of much academic and operational interest. In this paper, we present a method for solving OPF as a quadratic program by iteratively refining and re-initializing a linearized model of power flow based on the outputs of an associated nonlinear solver. The linear model on which we demonstrate this method is an adapted version of an approximation designed for use with unbalanced distribution networks. As an important benefit, the model allows for the explicit inclusion of nodal voltage phasor values in both the OPF problem's objective and its constraints, which opens the door to the idea of phasor-based control (PBC) design. We show in simulations on the IEEE 13-node test feeder that our method quickly converges to a set of phasor targets that are sufficiently precise for use in operations at the distribution level.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Numerical Simulations of Noisy Variational Quantum Eigensolver Ansatz Circuits

This is a case study of the variational quantum eigensolver (VQE) method using numerical simulations to test the influence of noise on the accuracy of the underlying circuit ansatz. We investigate a computational chemistry application of VQE to calculate the electronic ground state and its energy for Sodium Hydride (NaH), a prototypical two-electron problem. Using a one-parameter ansatz derived from unitary coupled cluster (UCC) theory, we simulate the effects of noise on the energy expectation value and variance with respect to the ansatz parameter. These numerical simulations provide insights into the accuracy of the prepared quantum state and the efficiency of the classical optimizer that iteratively refines the ansatz. We conduct a comparative study between analytical results derived for the UCC ansatz in the absence of noise and the noisy numerical simulation results obtained using an isotropic depolarizing noise model for each gate. We also compare the relative increase in noise on logically equivalent UCC ansatz circuits generated by randomized compiling. Notably, we observe that the intrinsic variance in the energy due to the simplicity of the ansatz itself compares with the noise induced by the bare circuit.

Gowrishankar, Meenambika↗

A Typology of Decision-Making Tasks for Visualization

Despite decision-making being a vital goal of data visualization, little work has been done to differentiate decision-making tasks within the field. While visualization task taxonomies and typologies exist, they often focus on more granular analytical tasks that are too low-level to describe large complex decisions, which can make it difficult to reason about and design decision-support tools. In this paper, we contribute a typology of decision-making tasks that were iteratively refined from a list of design goals distilled from a literature review. Our typology is concise and consists of only three tasks: CHOOSE, ACTIVATE, and CREATE. Although decision types originating in other disciplines exist, we provide definitions for these tasks that are suitable for the visualization community. Our proposed typology offers two benefits. First, the ability to compose and hierarchically organize the tasks enables flexible and clear descriptions of decisions with varying levels of complexities. Second, the typology encourages productive discourse between visualization designers and domain experts by abstracting the intricacies of data, thereby promoting clarity and rigorous analysis of decision-making processes. We demonstrate the benefits of our typology through four case studies, and present an evaluation of the typology from semi-structured interviews with experienced members of the visualization community who have contributed to developing or publishing decision support systems for domain experts. Our interviewees used our typology to delineate the decision-making processes supported by their systems, demonstrating its descriptive capacity and effectiveness. Finally, we present preliminary findings on the usefulness of our typology for visualization design.

97 MATHEMATICS AND COMPUTING↗

Combining registration and active shape models for the automatic segmentation of the lymph node regions in head and neck CT images

Purpose: Intensity-modulated radiation therapy (IMRT) is the state of the art technique for head and neck cancer treatment. It requires precise delineation of the target to be treated and structures to be spared, which is currently done manually. The process is a time-consuming task of which the delineation of lymph node regions is often the longest step. Atlas-based delineation has been proposed as an alternative, but, in the authors' experience, this approach is not accurate enough for routine clinical use. Here, the authors improve atlas-based segmentation results obtained for level II-IV lymph node regions using an active shape model (ASM) approach. Methods: An average image volume was first created from a set of head and neck patient images with minimally enlarged nodes. The average image volume was then registered using affine, global, and local nonrigid transformations to the other volumes to establish a correspondence between surface points in the atlas and surface points in each of the other volumes. Once the correspondence was established, the ASMs were created for each node level. The models were then used to first constrain the results obtained with an atlas-based approach and then to iteratively refine the solution. Results: The method was evaluated through a leave-one-out experiment. The ASM- and atlas-based segmentations were compared to manual delineations via the Dice similarity coefficient (DSC) for volume overlap and the Euclidean distance between manual and automatic 3D surfaces. The mean DSC value obtained with the ASM-based approach is 10.7% higher than with the atlas-based approach; the mean and median surface errors were decreased by 13.6% and 12.0%, respectively. Conclusions: The ASM approach is effective in reducing segmentation errors in areas of low CT contrast where purely atlas-based methods are challenged. Statistical analysis shows that the improvements brought by this approach are significant.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Newly Released Capabilities in the Distributed-Memory SuperLU Sparse Direct Solver

We present the new features available in the recent release of SuperLU_DIST, Version 8.1.1. SuperLU_DIST is a distributed-memory parallel sparse direct solver. The new features include (1) a 3D communication-avoiding algorithm framework that trades off inter-process communication for selective memory duplication, (2) multi-GPU support for both NVIDIA GPUs and AMD GPUs, and (3) mixed-precision routines that perform single-precision LU factorization and double-precision iterative refinement. Apart from the algorithm improvements, we also modernized the software build system to use CMake and Spack package installation tools to simplify the installation procedure. Throughout the article, we describe in detail the pertinent performance-sensitive parameters associated with each new algorithmic feature, show how they are exposed to the users, and give general guidance of how to set these parameters. We illustrate that the solver’s performance both in time and memory can be greatly improved after systematic tuning of the parameters, depending on the input sparse matrix and underlying hardware.

97 MATHEMATICS AND COMPUTING↗

Quantum Fast Approximate Synthesis Tool (QFAST) v1.0.0

We present QFAST, a quantum synthesis tool designed to produce short circuits and to scale well in practice. Our contributions are: 1) a novel representation of circuits able to encode placement and topology; 2) a hierarchical approach with an iterative refinement formulation that combines "coarse-grained" fast optimization during circuit structure search with a good, but slower, optimization stage only in the final circuit instantiation stage. When compared against state-of-the-art techniques, although not optimal, QFAST can generate much shorter circuits for "time dependent evolution" algorithms used by domain scientists. We also show the composability and tunability of our formulation in terms of circuit depth and running time. For example, we show how to generate shorter circuits by plugging in the best available third party synthesis algorithm at a given hierarchy level. Composability enables portability across chip architectures, which is missing from the available approaches.

Younis, Ed↗

OpenMxP-Opensource Mixed Precision Computing

This is an opensource library for benchmarking the system's GPU mixed precision capabilities. The software calculates solution of the system of linear equation in 64bit accuracy using mixed precision techniques and iterative refinement. Original benchmark designed is done by ICL, and it is name HPL-MxP (HPL-AI)

Lu, Hao↗

Chemical classification program synthesis using generative artificial intelligence

Accurately classifying chemical structures is essential for cheminformatics and bioinformatics, including tasks such as identifying bioactive compounds of interest, screening molecules for toxicity to humans, finding non-organic compounds with desirable material properties, or organizing large chemical libraries for drug discovery or environmental monitoring. However, manual classification is labor-intensive and difficult to scale to large chemical databases. Existing automated approaches either rely on manually constructed classification rules, or are deep learning methods that lack explainability. This work presents an approach that uses generative artificial intelligence to automatically write chemical classifier programs for classes in the Chemical Entities of Biological Interest (ChEBI) database. These programs can be used for efficient deterministic run-time classification of SMILES structures, with natural language explanations. The programs themselves constitute an explainable computable ontological model of chemical class nomenclature, which we call the ChEBI Chemical Class Program Ontology (C3PO). We validated our approach against the ChEBI database, and compared our results against deep learning models and a naive SMARTS pattern based classifier. C3PO outperforms the naive classifier, but does not reach the performance of state of the art deep learning methods. However, C3PO has a number of strengths that complement deep learning methods, including explainability and reduced data dependence. C3PO can be used alongside deep learning classifiers to provide an explanation of the classification, where both methods agree. The programs can be used as part of the ontology development process, and iteratively refined by expert human curators.

Artificial Intelligence↗

Historical review and proof-of-concept future method demonstration of adaptive mesh refinement in nuclear engineering for increased fidelity and computational efficiency

As the nuclear industry's use of computational tool increases, the need for increased fidelity and computational efficiency is well known. While most approaches to increased fidelity rely on applying a fine mesh over the problem domain, a more efficient method is to apply an adaptive mesh refinement (AMR) algorithm to the mesh definition. In the field of nuclear engineering, AMR has previously been used in conjunction with deterministic methods, including: S{sub N} transport methods, Lattice Boltzmann Methods, and COMSOL. The future of AMR in nuclear engineering is to couple it to a Monte Carlo code with the goal of reducing calculation time. A proof-of-concept example yielded positive results for using the gradient of the flux as a refinement criteria. The refinement criteria was varied from 0.01 to 0.10, which yielded a recommended range of 0.01 to 0.04, and the number of refinement iterations was varied from 0 to 7, with diminishing returns seen after 5 iterations. After the success of the proof-of-concept exercise, work began on creating a full program coupling MCNP6.2 and the AMR algorithm in the deal.II library. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Universal dwell time optimization for deterministic optics fabrication

Computer-Controlled Optical Surfacing (CCOS) has been greatly developed and widely used for precision optical fabrication in the past three decades. It relies on robust dwell time solutions to determine how long the polishing tools must dwell at certain points over the surfaces to achieve the expected forms. However, as dwell time calculations are modeled as ill-posed deconvolution, it is always non-trivial to reach a reliable solution that 1) is non-negative, since CCOS systems are not capable of adding materials, 2) minimizes the residual in the clear aperture 3) minimizes the total dwell time to guarantee the stability and efficiency of CCOS processes, 4) can be flexibly adapted to different tool paths, 5) the parameter tuning of the algorithm is simple, and 6) the computational cost is reasonable. In this study, we propose a novel Universal Dwell time Optimization (UDO) model that universally satisfies these criteria. First, the matrix-based discretization of the convolutional polishing model is employed so that dwell time can be flexibly calculated for arbitrary dwell points. Second, UDO simplifies the inverse deconvolution as a forward scalar optimization for the first time, which drastically increases the solution stability and the computational efficiency. Finally, the dwell time solution is improved by a robust iterative refinement and a total dwell time reduction scheme. The superiority and general applicability of the proposed algorithm are verified on the simulations of different CCOS processes. A real application of UDO in improving a synchrotron X-ray mirror using Ion Beam Figuring (IBF) is then demonstrated. The simulation indicates that the estimated residual in the 92.3 mm × 15.7 mm CA can be reduced from 6.32 nm Root Mean Square (RMS) to 0.20 nm RMS in 3.37 min. After one IBF process, the measured residual in the CA converges to 0.19 nm RMS, which coincides with the simulation.

36 MATERIALS SCIENCE↗

IPET and FETR: Experimental Approach for Studying Molecular Structure Dynamics by Cryo-Electron Tomography of a Single-Molecule Structure

The dynamic personalities and structural heterogeneity of proteins are essential for proper functioning. Structural determination of dynamic/heterogeneous proteins is limited by conventional approaches of X-ray and electron microscopy (EM) of single-particle reconstruction that require an average from thousands to millions different molecules. Cryo-electron tomography (cryoET) is an approach to determine three-dimensional (3D) reconstruction of a single and unique biological object such as bacteria and cells, by imaging the object from a series of tilting angles. However, cconventional reconstruction methods use large-size whole-micrographs that are limited by reconstruction resolution (lower than 20 Å), especially for small and low-symmetric molecule (,400 kDa). In this study, we demonstrated the adverse effects from image distortion and the measuring tilt-errors (including tilt-axis and tilt-angle errors) both play a major role in limiting the reconstruction resolution. Therefore, we developed a ‘‘focused electron tomography reconstruction’’ (FETR) algorithm to improve the resolution by decreasing the reconstructing image size so that it contains only a single-instance protein. FETR can tolerate certain levels of image-distortion and measuring tilt-errors, and can also precisely determine the translational parameters via an iterative refinement process that contains a series of automatically generated dynamic filters and masks. To describe this method, a set of simulated cryoET images was employed; to validate this approach, the real experimental images from negative-staining and cryoET were used. Since this approach can obtain the structure of a single-instance molecule/particle, we named it individual-particle electron tomography (IPET) as a new robust strategy/approach that does not require a pre-given initial model, class averaging of multiple molecules or an extended ordered lattice, but can tolerate small tilt-errors for high-resolution single ‘‘snapshot’’ molecule structure determination. Thus, FETR/IPET provides a completely new opportunity for a single-molecule structure determination, and could be used to study the dynamic character and equilibrium fluctuation of macromolecules.

59 BASIC BIOLOGICAL SCIENCES↗

Micro-architected material design for mechanical response

Rapid advances in additive manufacturing (AM) have enabled the creation of micro-architected materials—also known as mechanical metamaterials—with unprecedented control over fine-scale geometries and arrangements of multiple material constituents. These “materials” can achieve unique and extraordinary effective mechanical properties through their complex architectures rather than composition alone. A key challenge is to design for these bespoke effective mechanical responses within the constraints of available AM techniques (i.e., given a set of desired effective properties), identify a (often nonunique) micro-architecture and selection of material constituents that achieves them. Two main strategies have emerged. Gradient-based methods use sensitivity analysis to iteratively refine candidate designs, while data-driven methods learn micro-architecture-constituent relationships from existing examples to propose new designs. This article reviews these design approaches for micro-architected materials with tailored mechanical responses that can be fabricated by AM as well as their applications.

Spadaccini, Christopher M [Lawrence Livermore Nati↗

Tractable Experiment Design via Mathematical Surrogates

This presentation summarizes the development and implementation of quantitative design criteria motivated by targeted inference objectives for identifying new, potentially expensive computational or physical experiments. The first application is concerned with estimating features of quantities of interest arising from complex computational models, such as quantiles or failure probabilities. A sequential strategy is proposed for iterative refinement of the importance distributions used to efficiently sample the uncertain inputs to the computational model. In the second application, effective use of mathematical surrogates is investigated to help alleviate the analytical and numerical intractability often associated with Bayesian experiment design. This approach allows for the incorporation of prior information into the design process without the need for gross simplification of the design criterion. Illustrative examples of both design problems will be presented as an argument for the relevance of these research problems.

97 MATHEMATICS AND COMPUTING↗

3-D Semantic Information Inference from Airborne Video. Final Report

We developed a full 3D modeling pipeline focusing on an important application scenario: city-scale 3D reconstruction from aerial imagery. We propose an approach to solve camera pose estimation and dense reconstruction from Wide Area Aerial Surveillance (WAAS) videos captured by an airborne platform. Our approach solves them in an online fashion: it incrementally updates a sparse 3D map and estimates the camera pose as each new frame arrives; depth maps of selected key frames are computed using a variational method and integrated to produce a full 3D model via volumetric reconstruction. In practice, aerial imagery is usually captured using a multicamera system. We propose an approach for camera pose estimation of multi-camera aerial imagery which is parallelized on multiple GPUs for efficiency. The approach is also extended for progressive 3D model acquisition with a hand-held camera. We also developed an offline approach since online approach is not a necessity and accuracy has higher priority over efficiency in many scenarios. We presented MeshRecon, a mesh-based offline system composed of three modules: a dense point cloud is generated using multi-resolution plane sweep method; an initial mesh model is extracted from the point cloud via global optimization considering visibility information of all images; the mesh model is then iteratively refined to capture structural details by optimizing the photometric consistency and spatial regularization. The major processes are parallelized on GPU for efficiency. For the aerial imagery case, we evaluate our system on several real-world multicamera aerial imagery datasets, each covering an urban scenario of several square kilometers. Quantitative result shows that the reconstructed geometric 3D model is highly accurate with error smaller than 1 meter over the entire city. Besides aerial imagery, we also evaluate its performance on general geometric 3D model acquisition of real-world objects. Result shows that the system is robust and flexible for various types of objects at different scales in both indoor and outdoor environments. Based on city 3D models reconstructed at different times, we present a system for city-scale geometry change detection by performing comparisons at the 3D geometry level. Our system is able to detect geometry changes at different scales, ranging from a building cluster to small-scale vegetation changes, with high accuracy.

97 MATHEMATICS AND COMPUTING↗