Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “experimental algorithms”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 775 records · Page 43

Graph Identification of Proteins in Tomograms (GRIP-Tomo) 2.0: Topologically aware classification for proteins

Cryo-electron tomography (cryo-ET) enables structural characterization of biomolecules under near-native conditions. Existing approaches for interpreting the resulting three-dimensional volumes are computationally expensive and have difficulty interpreting density associated with small proteins/complexes. To explore alternate approaches for identifying proteins in cryo-ET data we pursued a Graph Network and topologically invariant approach. Here, we report on a fast algorithm that classifies particles by searching for nuances of evolutionarily conversed motifs and the geometrical characteristics of protein structure. GRIP-Tomo 2.0 is a machine-learning pipeline that extracts interpretable topological features of protein structures within noisy experimental backgrounds. Compared to version 1.0, the new pipeline includes three upgrades that significantly improve performance including synthetic tomogram generation simulating realistic noise, graph-based persistent feature extraction as protein fingerprints, and high-performance computing acceleration. GRIP-Tomo 2.0 achieves over 90% accuracy in classifying between proteins and noise using both real and synthetic datasets which represents a foundational step toward advancing cryo-ET workflows and empowering automated visual proteomics.

Li, Chengxuan↗

PhaseT3M: 3D imaging at 1.6 Å resolution via electron cryo-tomography with nonlinear phase retrieval

Electron cryo-tomography (cryo-ET) enables 3D imaging of complex, radiation-sensitive structures with molecular detail. However, image contrast from the interference of scattered electrons is nonlinear with atomic density and multiple scattering further complicates interpretation. These effects degrade resolution, particularly in conventional reconstruction algorithms, which assume linearity. Particle averaging can reduce such issues but is unsuitable for heterogeneous or dynamic samples ubiquitous in biology, chemistry, and materials sciences. Here, we develop a phase retrieval-based cryo-ET method, PhaseT3M. We experimentally demonstrate its application to an approximately 7 nm Co3O4 nanoparticle on an approximately 30 nm carbon substrate, achieving a maximum resolution of 1.6 Å, surpassing conventional limits using standard cryo-TEM equipment. PhaseT3M uses a multislice model for multiple scattering and Bayesian optimization for alignment and computational aberration correction, with a positivity constraint to recover ‘missing wedge’ information. Applied directly to biological particles, it enhances reconstruction quality and reduces artifacts, establishing a standard for routine 3D imaging with phase contrast.

Biophysics↗

Transfer learning driven design optimization for inertial confinement fusion

Transfer learning is a promising approach to create predictive models that incorporate simulation and experimental data into a common framework. In this technique, a neural network is first trained on a large database of simulations and then partially retrained on sparse sets of experimental data to adjust predictions to be more consistent with reality. Previously, this technique has been used to create predictive models of Omega [Humbird et al., IEEE Trans. Plasma Sci. 48, 61–70 (2019)] and NIF [Humbird et al., Phys. Plasmas 28, 042709 (2021); Kustowski et al., Mach. Learn. 3, 015035 (2022)] inertial confinement fusion (ICF) experiments that are more accurate than simulations alone. Here, in this work, we conduct a transfer learning driven hypothetical ICF campaign in which the goal is to maximize experimental neutron yield via Bayesian optimization. The transfer learning model achieves yields within 5% of the maximum achievable yield in a modest-sized design space in fewer than 20 experiments. Furthermore, we demonstrate that this method is more efficient at optimizing designs than traditional model calibration techniques commonly employed in ICF design. Such an approach to ICF design could enable robust optimization of experimental performance under uncertainty.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

FNCL Enhancements Implementation (FY25 Annual Report)

The FNCL investigations team at Lawrence Livermore National Laboratory (LLNL) has completed research and development of hardware, signal processing, and analysis tools to enhance the measurement capabilities of both the current CAEN SyS VeryFuel Fast Neutron Collar (FNCL) instrument and a next-generation FNCL prototype. The team successfully built and commissioned the LLNL Demonstrator System: a fully integrated, three-panel detector system featuring higher segmentation, plastic scintillators (EJ-276D), Silicon Photomultipliers (SiPMs), no high-voltage requirement, a reduced electronic footprint, and the LLNL-developed Gaussian Mixture Model Pulse Shape Discrimination (GMM-PSD) signal processing. An extensive experimental campaign was conducted at LLNL’s Inherently Safe Subcritical Assembly (ISSA) facility using both the baseline FNCL and the LLNL Demonstrator. The campaign results validated system performance, calibration stability, and the effectiveness of advanced signal processing and analysis algorithms in a relevant environment.

and physical protection↗

Machine-learning-based, online estimation of ceramic’s microstructure upon the laser spot brightness during laser sintering

The ceramic microstructure strongly influences its properties. During manufacturing, the online monitoring of microstructure is critical to ensure the desired material properties. So far, the microstructure on the relevant scale is usually characterized offline using scanning electron microscopy (SEM), which is time and cost-consuming. In this work, we demonstrate a cost-effective, machine learning (ML)-based approach to simulate the SEM micrographs in real-time from the laser spot brightness. We experimentally observed a strong correlation between the laser spot brightness and the corresponding microstructure at the exact locations. The brightness values obtained from thermal emission images and the corresponding SEM micrographs were used in the training datasets. The ML algorithm was a style-based conditional generative adversarial network (CGAN). After training, the ML model could generate high-fidelity microstructure images within 0.1 seconds based on in-situ captured brightness at the laser sintering spot. We used the average grain sizes as the metric to evaluate the accuracy of the ML-predicted micrographs. Here, the ML-predicted microstructures were in good agreement, with less than 5% in difference from the real SEM images. In conclusion, we demonstrate the cost-effective, online microstructure estimation during laser sintering with a simple setup (a camera, a regular computer, and the ML model).

08 HYDROGEN↗

Experimental Neutrino Physics Research with Liquid Argon TPCs (Final Technical Report)

In this report, we present the accomplishments, products, impact, and outcomes of the project funded by the DOE award DE-SC0024095. The research accomplishments are making important contributions to achieving the physics goals, demonstrating the robustness and potential of software-level event reconstruction algorithms, and ensuring high-quality detector operation for relevant US accelerator neutrino experiments using liquid argon time projection chamber technology.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Piecewise linear approximation with minimum number of linear segments and minimum error: A fast approach to tighten and warm start the hierarchical mixed integer formulation

In several areas of economics and engineering, it is often necessary to fit discrete data points or approximate nonlinear functions with continuous functions. Piecewise linear (PWL) functions are a convenient way to achieve this. PWL functions can be modeled in mathematical problems using only linear and integer variables. Moreover, there is a computational benefit in using PWL functions that have the least possible number of segments. This work proposes a novel hierarchical mixed integer linear programming (MILP) formulation that identifies a continuous PWL approximation with minimum number of linear segments for a given target maximum error. The proposed MILP formulation also identifies the solution with the least maximum error among the solutions with minimum number of segments. Then, this work proposes a fast iterative algorithm that identifies non necessarily continuous PWL approximations by solving O(S log N) linear programming (LP) problems, where N is the number of data points and S is the minimum number of segments in the non necessarily continuous case. This work demonstrates that tight bounds for the MILP problem can be derived from these approximations. Next, a fast algorithm is introduced to transform a non necessarily continuous PWL approximation into a continuous one. Finally, the tight bounds and the continuous PWL approximations are used to tighten and warm start the MILP problem. The tightened formulation is shown in experimental results to be more efficient, especially for large data sets, with a solution time that is up to two orders of magnitude less than the existing literature.

97 MATHEMATICS AND COMPUTING↗

Performance of the spin-component-scaled methods for energy bands

The performance of various spin-component-scaled parameterisations is examined for the second-order many-body Green's-function [MBGF(2)] calculations of valence energy bands, taking three of the experimentally well-characterised polymers as examples: polyethylene, polytetrafluoroethylene, and polyacetylene. The parameterisations considered are Grimme's original SCS parameter set, Jung et al.'s original SOS set (retaining the opposite-spin component only), Śmiga et al.'s SCS(IP) set (calibrated specifically for ionization energies), and Śmiga et al.'s SOS(IP) set (calibrated for ionization energies with the opposite-spin component only; implicit in the os-D2 model of Opoku et al.). The SCS(IP) and SOS(IP) parameterisations are found to shift both outer and inner valence bands by up to a few electronvolts away from the experimental data. The original SCS and SOS parameter sets do not improve upon, but largely maintain the accuracy of the unscaled MBGF(2) methods. Given that the SOS-MBGF(2) method can be implemented in a quartic-scaling algorithm (for all roots), it is most promising for solid-state applications. Furthermore this observation is consistent with the success of the quartic-scaling GW methods without the vertex correction based on a density-functional theory reference.

Green’s-function theory↗

Flexible visualization of a 3rd party Intrusion Prevention (Security) tool: A use case with the ELK stack

A difficult aspect of cyber security is the ability to achieve automated real time intrusion prevention across various sets of systems. To this extent, several companies are offering comprehensive solutions that leverage an "accuracy of scale" and moving much of the intelligence and detection on the Cloud, relying on an ever-growing set of data and analytics to increase decision accuracy. Often, they provide tools to visualize the decision workflows in attack prevention (as well as tune the algorithm) but those solutions are not always practical as companies see the problem as "global" that is, from a unified Cyber-security standpoint. However, a key to a successful Cyber-security program is transparency and trust: from an experimental team viewpoint, this specifically means having the ability to immediately see what and from where, who has been blocked and being able to inform the community in case of a revoked access without the need for filing a "ticket" (that may eventually be answered) – in other words, rapid response to their user-base is essential but solutions targeting "sub-groups" in an organization are not often available. We have come up with a versatile solution leveraging the ELK stack (Elasticsearch, Logstash, & Kibana) and an IPS (Intrusion Prevention System) based WAF (Web Application Firewall) from Signal Sciences. Signal Science allows the streaming of detailed logs in a Logstash format suitable for custom solutions for visualization. By combining these two tools, we have strengthened our security posture and enabled individual experiments to monitor their own traffic. Specifically, the IPS WAF provides unique data such as country of origin, protocol, response code, source IP, and paths accessed. In this contribution, we will show how we engineered a visualization solution so experiment groups could access a dashboard with predefined graphs but also, where they can create individual customizable dashboards used to display blocked traffic and troubleshoot latency issues. We will discuss the details and procedures for developing and configuring these tools and how it benefits cyber security postures across our scientific based environment.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

FAIR AI models in high energy physics

Abstract The findable, accessible, interoperable, and reusable (FAIR) data principles provide a framework for examining, evaluating, and improving how data is shared to facilitate scientific discovery. Generalizing these principles to research software and other digital products is an active area of research. Machine learning models—algorithms that have been trained on data without being explicitly programmed—and more generally, artificial intelligence (AI) models, are an important target for this because of the ever-increasing pace with which AI is transforming scientific domains, such as experimental high energy physics (HEP). In this paper, we propose a practical definition of FAIR principles for AI models in HEP and describe a template for the application of these principles. We demonstrate the template’s use with an example AI model applied to HEP, in which a graph neural network is used to identify Higgs bosons decaying to two bottom quarks. We report on the robustness of this FAIR AI model, its portability across hardware architectures and software frameworks, and its interpretability.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Universal Compiling and (No-)Free-Lunch Theorems for Continuous-Variable Quantum Learning

Quantum compiling, where a parameterized quantum circuit is trained to learn a target unitary, is an important primitive for quantum computing that can be used as a subroutine to obtain optimal circuits or as a tomographic tool to study the dynamics of an experimental system. While much attention has been paid to quantum compiling on discrete-variable hardware, less has been paid to compiling in the continuous-variable paradigm. Here we motivate several, closely related, short-depth continuous-variable algorithms for quantum compilation. We analyze the trainability of our proposed cost functions and numerically demonstrate our algorithms by learning arbitrary Gaussian operations and Kerr nonlinearities. We further make connections between this framework and quantum learning theory in the continuous-variable setting by deriving no-free-lunch theorems. These generalization bounds demonstrate a linear resource reduction for learning Gaussian unitaries using entangled coherent-Fock states and an exponential resource reduction for learning arbitrary unitaries using two-mode-squeezed states.

97 MATHEMATICS AND COMPUTING↗

A low-latency graph computer to identify metastable particles at the Large Hadron Collider for real-time analysis of potential dark matter signatures

Abstract Image recognition is a pervasive task in many information-processing environments. We present a solution to a difficult pattern recognition problem that lies at the heart of experimental particle physics. Future experiments with very high-intensity beams will produce a spray of thousands of particles in each beam-target or beam-beam collision. Recognizing the trajectories of these particles as they traverse layers of electronic sensors is a massive image recognition task that has never been accomplished in real time. We present a real-time processing solution that is implemented in a commercial field-programmable gate array using high-level synthesis. It is an unsupervised learning algorithm that uses techniques of graph computing. A prime application is the low-latency analysis of dark-matter signatures involving metastable charged particles that manifest as disappearing tracks.

47 OTHER INSTRUMENTATION↗

Adaptive simulations enable computational design of electron beam processing of nanomaterials with supersonic micro-jet precursor

Focused Electron Beam Induced Processing (FEBIP) is a powerful tool for the “direct-write” of nanomaterials with the possibility of atomistic control on suspended 2D material substrates. FEBIP capabilities have been significantly expanded by using a localized jet-based delivery of precursors, and especially when a thermally energized supersonic micro-jet enhances the delivery of mass flux along with controlling the far-from-equilibrium thermodynamic state of adsorbed adatoms. The possibilities of growing nanomaterials with “dialed-in” composition with ultra-high growth rates and aspect ratios up to 100:1 have been demonstrated using the supersonic micro-jet-FEBIP. Bringing this scientific discovery to the level of maturity required for practical applications in additive nanomanufacturing requires simulation tools that are capable of capturing the complex flow physics of micro-jet-substrate interactions that bridge a wide range of flow regimes from the high-density gas micro-jet expanding into the vacuum environment of FEBIP. To address this significant computational challenge, a new approach has been developed and described in this work for a multiscale adaptive DSMC (Direct Simulation Monte Carlo) algorithm to predict the micro-jet gas dynamics in an FEBIP environment, spanning the full range of flow regimes from low Knudsen (Kn) number O(0.01) continuum flow to high Kn of O(10) for the molecular flow within a unified computational framework. Here, the fundamental principles of the adaptive DSMC algorithm are described, its viability as a DSMC technique is demonstrated, and computational improvements for the benchmark cases are discussed in the context of advancing 3D nanofabrication with FEBIP. Ultimately, combining the first principle simulations via adaptive DSMC with the complementary experimental data will enable the creation of the powerful CAD tools for in silico design and optimal operation of micro-jet-FEBIP.

36 MATERIALS SCIENCE↗

Towards improved speed and accuracy of laser powder bed fusion simulations via multiscale spatial representations

Due to the growing popularity of laser powder bed fusion (LPBF) as a metal additive manufacturing technique, there is a strong need to be able to accurately predict build outcomes. Full fidelity simulations of this process are not feasible due to the vast range of length and time scales inherent to it. While part-scale codes for simulating residual stress and distortion have shown reasonable predictive capability, they often neglect many aspects of the process occurring over smaller length/time scales, and thus are unable to capture effects of process parameter adjustments or the behavior of fine features. One way of capturing aspects at more refined length scales is through the use of adaptive mesh refinement (AMR). AMR allows for the process to be simulated at scales approaching the physical spatial dimensions without drastically increasing the total degrees of freedom in the simulation. This manuscript describes the implementation of an AMR algorithm within a multiphysics, parallelized finite element code, and its application to the LPBF problem. In this work, part-scale examples are provided where the use of AMR has allowed for higher fidelity thermal and thermomechanical simulations, as compared to experimental measurements. Results from these higher resolution simulations show that while AMR is a necessary component for increased accuracy in a computationally efficient manner, other improvements are also necessary, including handling of the multiple time scales inherent to the problem and the need for improved AM-specific material models.

42 ENGINEERING↗

Alternative mixed integer linear programming optimization for joint job scheduling and data allocation in grid computing

This paper presents a novel approach to the joint optimization of job scheduling and data allocation in grid computing environments. We formulate this joint optimization problem as a mixed integer quadratically constrained program. To tackle the nonlinearity in the constraint, we alternatively fix a subset of decision variables and optimize the remaining ones via Mixed Integer Linear Programming (MILP). We solve the MILP problem at each iteration via an off-the-shelf MILP solver. Our experimental results show that our method significantly outperforms existing heuristic methods, employing either independent optimization or joint optimization strategies. We have also verified the generalization ability of our method over grid environments with various sizes and its high robustness to the algorithm setting.

97 MATHEMATICS AND COMPUTING↗

An ion specific continuum model on ionic surfactant's binary phase diagram in aqueous solution

Here, a continuum aggregation model is proposed to account for specific ion effects, enabling accurate phase diagrams calculations for the micellar, cylindrical and lamellar aggregates of sodium/potassium carboxylate surfactants in aqueous solution across a range of temperatures. Three groups of concentrations at distinctive temperatures are fitted to build empirical temperature dependence given the limited availability of relevant experimental measurements. The specific ion effects are manifested in the aggregates' surface tension as well as in the distributions of counter-ions' concentrations in the vicinity of the aggregates. The aggregates' geometric sizes are well-reproduced. The differential evolution algorithm is applied to address boundary conditions of the electrostatic potential, aggregate size optimization as well as the equilibrium of monomers transferring between the aggregate and aqueous region.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Advances and perspectives in discovery and functional analysis of small secreted proteins in plants

Small secreted proteins (SSPs) are less than 250 amino acids in length and are actively transported out of cells through conventional protein secretion pathways or unconventional protein secretion pathways. In plants, SSPs have been found to play important roles in various processes, including plant growth and development, plant response to abiotic and biotic stresses, and beneficial plant–microbe interactions. Over the past 10 years, substantial progress has been made in the identification and functional characterization of SSPs in several plant species relevant to agriculture, bioenergy, and horticulture. Yet, there are potentially a lot of SSPs that have not been discovered in plant genomes, which is largely due to limitations of existing computational algorithms. Recent advances in genomics, transcriptomics, and proteomics research, as well as the development of new computational algorithms based on machine learning, provide unprecedented capabilities for genome-wide discovery of novel SSPs in plants. In this review, we summarize known SSPs and their functions in various plant species. Then we provide an update on the computational and experimental approaches that can be used to discover new SSPs. Finally, we discuss strategies for elucidating the biological functions of SSPs in plants.

59 BASIC BIOLOGICAL SCIENCES↗

Computational evolution of high-performing unfused non-fullerene acceptors for organic solar cells

Materials optimization for organic solar cells (OSCs) is a highly active field, with many approaches using empirical experimental synthesis, computational brute force to screen a subset of chemical space, or generative machine learning methods that often require significant training sets. While these methods may find high-performing materials, they can be inefficient and time-consuming. Genetic algorithms (GAs) are an alternative approach, allowing for the “virtual synthesis” of molecules and a prediction of their “fitness” for some property, with new candidates suggested based on good characteristics of previously generated molecules. In this work, a GA is used to discover high-performing unfused non-fullerene acceptors (NFAs) based on an empirical prediction of power conversion efficiency (PCE) and provides design rules for future work. The electron-withdrawing/donating strength, as well as the sequence and symmetry, of those units are examined. The utilization of a GA over a brute-force approach resulted in speedups up to 1.8 × 10 12 . New types of units, not frequently seen in OSCs, are suggested, and in total 5426 NFAs are discovered with the GA. Of these, 1087 NFAs are predicted to have a PCE greater than 18%, which is roughly the current record efficiency. While the symmetry of the sequence showed no correlation with PCE, analysis of the sequence arrangement revealed that higher performance can be achieved with a donor core and acceptor end groups. Future NFA designs should consider this strategy as an alternative to the current A-D-A'-D-A architecture.

14 SOLAR ENERGY↗