Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Science Applications”

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 919 records · Page 51

TXM-Sandbox : an open-source software for transmission X-ray microscopy data analysis

A transmission X-ray microscope (TXM) can investigate morphological and chemical information of a tens to hundred micrometre-thick specimen on a length scale of tens to hundreds of nanometres. It has broad applications in material sciences and battery research. TXM data processing is composed of multiple steps. A workflow software has been developed that integrates all the tools required for general TXM data processing and visualization. The software is written in Python and has a graphic user interface in Jupyter Notebook . Users have access to the intermediate analysis results within Jupyter Notebook and have options to insert extra data processing steps in addition to those that are integrated in the software. The software seamlessly integrates ImageJ as its primary image viewer, providing rich image visualization and processing routines. As a guide for users, several TXM specific data analysis issues and examples are also presented.

36 MATERIALS SCIENCE↗

High-speed quantitative X-ray multi-contrast imaging with deep learning based modulated pattern analysis

The advent of X-ray multi-contrast imaging methods, providing absorption, phase, and dark-field images, holds tremendous promise for complementary and non-destructive visualization of inner structures within materials and bio-samples. However, the low efficiency in measuring and analyzing X-ray modulated patterns has hindered their application in high-resolution in situ imaging. In this work, the Enhanced Scanning Pattern-based Imaging Neural Network (ESPINNet) is introduced as a powerful tool for achieving high-speed, high-resolution quantitative imaging. ESPINNet is faster than correlation-based speckle tracking methods such as XSVT and UMPA, and provides a balanced performance in terms of resolution and speed for data collection by using fewer scanning images. In comparison with our previously developed neural network, ESPINNet introduces the capability to generate dark-field images, further enhancing its versatility. By leveraging scanning patterns, ESPINNet significantly improves resolution and measurement precision. Furthermore, its adaptability to various modulation patterns, including those produced by sandpaper, coded masks, or gratings, ensures broad applicability. These features enable real-time 2D and 3D multi-contrast imaging, positioning ESPINNet as a transformative solution for applications in materials science and biomedical research, particularly for high-speed and in situ measurements.

X-ray at-wavelength metrology↗

A Code Generator for High-Performance Tensor Contractions on GPUs

Tensor contractions are higher dimensional generalizations of matrix-matrix multiplication. They form the compute-intensive core for many applications in computational science and data science. Although high-performance library implementations are widely available for dense matrix-matrix multiplication on GPUs, the same is not true for contraction of dense tensors. In this paper, we describe a high- performance GPU code generator for arbitrary tensor contractions. It exploits domain-specific properties about data reuse in tensor contractions to devise an effective code generation schema, coupled with an effective model-driven search to determine parameters for mapping of computation to threads and staging of data through the GPU memory hierarchy. Experimental evaluation using a set of tensor contraction benchmarks demonstrates performance improvement and/or significantly reduced code generation time over other state-of-the-art tensor contraction libraries and code generators.

Kim, Jinsung↗

Distributed-memory Parallel Algorithms for Matching and Coloring

Graph matching and coloring constitute two fundamental classes of combinatorial problems having numerous established as well as emerging applications in computational science and engineering, high-performance computing, and informatics. We provide a snapshot of an on-going work on the design and implementation of new highly-scalable distributed-memory parallel algorithms for two prototypical problems from these classes, edge-weighted matching and distance-1 vertex coloring. Graph algorithms in general have low concurrency and poor data locality, making it challenging to achieve scalability on massively parallel machines. We overcome this challenge by employing a variety of techniques, including approximation, speculation and iteration, optimized communication, and randomization, in concert. We present preliminary results on weak and strong scalability studies conducted on an IBM Blue Gene/P machine employing up to tens of thousands of processors. The results show that the algorithms hold strong potential for computing at petascale.

Combinatorial scientific computing↗

Thermo Field Dynamics on a Quantum Computer

In this project we develop a quantum algorithm to realize finite temperature simulation on a quantum computer. As quantum computers use real-time evolution we did not use the imaginary time methods popular on classical algorithms. Instead, we implemented a real-time therom field dynamics formalism, which has the added benefit of being able to compute quantities that are both time-and temperature-dependent. To implement thermo field dynamics we apply a unitary transformation [1] to discrete quantum mechanical operators to make new Hamiltoni-ans with encoded temperature dependence. The method works normally for fermions, which have a finite representation, but needs some modification to work with bosons. These Hamilto-nians are then processed into a Pauli matrix representation in order to be used as input for IBM's Qiskit package [2]. We then use IBM's quantum simulator to calculate an approximation to the Hamiltonaian's ground state energy via the variational quantum eigensolver (VQE) algorithm [3]. This approximation is then compared to a classically calculated value for the exact energy. The thermo field dynamics quantum algorithm has general applications to material science, high-energy physics and nuclear physics, particularly in those situations involving realtime evolution at high temperature.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Growth and opportunities in networked synthesis through AmeriFlux

Since its inception in 1996 with just 15 sites, the AmeriFlux network has grown to include over 300 sites, representing every major ecosystem type across the Americas. This grassroots coalition of the willing has for the past two decades continuously measured the exchange of carbon, water and energy between ecosystems and the atmosphere. Recent years in particular have seen remarkable growth in both the degree of coordination of activities within the AmeriFlux network, and the number of researchers involved. Through the AmeriFlux Management Project, the network has made public over 1500 site-years of observations. This project now represents over 5000 registered members, a quarter of whom have signed up in the past year, who use the observations for a range of applications, including ecosystem science, modeling, and remote sensing, but also education and outreach.

photosynthesis↗

Beyond hard x-ray photoelectron spectroscopy: Simultaneous combination with x-ray diffraction

Hard x-ray photoelectron spectroscopy (HAXPES) is a powerful and novel emerging technique for the nondestructive determination of electronic properties and chemical composition of bulk, buried interfaces and surfaces. It benefits from the exceptionally large escape depth of high kinetic energy photoelectrons, increasing the information depth up to several tens of nanometers. Complementing HAXPES with an atomic structure sensitive technique (such as x-ray diffraction) opens a new research field with major applications for materials science. At SpLine, the Spanish CRG beamline at the European Synchrotron Radiation Facility, we have developed a novel experimental set-up that combines HAXPES and x-ray diffraction (x-ray reflectivity, surface x-ray diffraction, grazing incidence x-ray diffraction, and reciprocal space maps). Both techniques can be operated simultaneously on the same sample and using the same excitation source. The set-up includes a robust 2S + 3D diffractometer hosting a ultrahigh vacuum chamber equipped with a unique photoelectron spectrometer (few eV < electron kinetic energy < 15 keV), x-ray tube (Mg/Ti), 15 keV electron gun, and auxiliary standard surface facilities (molecular beam epitaxy evaporator, ion gun, low energy electron diffraction, sample heating/cooling system, leak valves, load-lock sample transfer, etc.). This end-station offers the unique possibility of performing simultaneous HAXPES + x-ray diffraction studies. In the present work, we describe the experimental set-up together with two experimental examples that emphasize its outstanding capabilities: (i) nondestructive characterization of the Si/Ge and HfO{sub 2}/SiO{sub 2} interfaces on Ge-based CMOS devices, and (ii) strain study on La{sub 0.7}Ca{sub 0.3}MnO{sub 3} ultrathin films grown on SrTiO{sub 3}(001) substrate.

36 MATERIALS SCIENCE↗

Toward interactive search in remote sensing imagery

To move from data to information in almost all science and defense applications requires a human-in-the-loop to validate information products, resolve inconsistencies, and account for incomplete and potentially deceptive sources of information. This is a key motivation for visual analytics which aims to develop techniques that complement and empower human users. By contrast, the vast majority of algorithms developed in machine learning aim to replace human users in data exploitation. In this paper we describe a recently introduced machine learning problem, called rare category detection, which may be a better match to visual analytic environments. We describe a new design criteria for this problem, and present comparisons to existing techniques with both synthetic and real-world datasets. We conclude by describing an application in broad-area search of remote sensing imagery.

99 GENERAL AND MISCELLANEOUS↗

Generation of Low-Energy High-Current Electron Beams in Plasma-Anode Electron Guns

This paper is a review of studies on the generation of low-energy high-current electron beams in electron guns with a plasma anode and an explosive-emission cathode. The problems related to the initiation of explosive electron emission under plasma and the formation and transport of high-current electron beams in plasma-filled systems are discussed consecutively. Considerable attention is given to the nonstationary effects that occur in the space charge layers of plasma. Emphasis is also placed on the problem of providing a uniform energy density distribution over the beam cross section, which is of critical importance in using electron beams of this type for surface treatment of materials. Examples of facilities based on low-energy high-current electron beam sources are presented and their applications in materials science and practice are discussed.

43 PARTICLE ACCELERATORS↗

Reducing the bulk of the bulk synchronous parallel model

For over two decades the dominant means for enabling portable performance of computational science and engineering applications on parallel processing architectures has been the bulk-synchronous parallel programming (BSP) model. Code developers, motivated by performance considerations to minimize the number of messages transmitted, have typically pursued a strategy of aggregating message data into fewer, larger messages. Emerging and future high-performance architectures, especially those seen as targeting Exascale capabilities, provide motivation and capabilities for revisiting this approach. In this paper we explore alternative configurations within the context of a large-scale complex multi-physics application and a proxy that represents its behavior, presenting results that demonstrate some important advantages as the number of processors increases in scale.

97 MATHEMATICS AND COMPUTING↗

Significant DBSCAN+: Statistically Robust Density-based Clustering

Cluster detection is important and widely used in a variety of applications, including public health, public safety, transportation, and so on. Given a collection of data points, we aim to detect density-connected spatial clusters with varying geometric shapes and densities, under the constraint that the clusters are statistically significant. The problem is challenging, because many societal applications and domain science studies have low tolerance for spurious results, and clusters may have arbitrary shapes and varying densities. As a classical topic in data mining and learning, a myriad of techniques have been developed to detect clusters with both varying shapes and densities (e.g., density-based, hierarchical, spectral, or deep clustering methods). However, the vast majority of these techniques do not consider statistical rigor and are susceptible to detecting spurious clusters formed as a result of natural randomness. On the other hand, scan statistic approaches explicitly control the rate of spurious results, but they typically assume a single “hotspot” of over-density and many rely on further assumptions such as a tessellated input space. To unite the strengths of both lines of work, we propose a statistically robust formulation of a multi-scale DBSCAN, namely Significant DBSCAN+, to identify significant clusters that are density connected. As we will show, incorporation of statistical rigor is a powerful mechanism that allows the new Significant DBSCAN+ to outperform state-of-the-art clustering techniques in various scenarios. We also propose computational enhancements to speed-up the proposed approach. Experiment results show that Significant DBSCAN+ can simultaneously improve the success rate of true cluster detection (e.g., 10–20% increases in absolute F1 scores) and substantially reduce the rate of spurious results (e.g., from thousands/hundreds of spurious detections to none or just a few across 100 datasets), and the acceleration methods can improve the efficiency for both clustered and non-clustered data.

Computer Science↗

Region-adaptive, Error-controlled Scientific Data Compression using Multilevel Decomposition

The increase of computer processing speed is significantly outpacing improvements in network and storage bandwidth, leading to the big data challenge in modern science, where scientific applications can quickly generate much more data than that can be transferred and stored. As a result, big scientific data must be reduced by a few orders of magnitude while the accuracy of the reduced data needs to be guaranteed for further scientific explorations. Moreover, scientists are often interested in some specific spatial/temporal regions in their data, where higher accuracy is required. The locations of the regions requiring high accuracy can sometimes be prescribed based on application knowledge, while other times they must be estimated based on general spatial/temporal variation. In this paper, we develop a novel multilevel approach which allows users to impose region-wise compression error bounds. Our method utilizes the byproduct of a multilevel compressor to detect regions where details are rich and we provide the theoretical underpinning for region-wise error control. With spatially varying precision preservation, our approach can achieve significantly higher compression ratios than single-error bounded compression approaches and control errors in the regions of interest.We conduct the evaluations on two climate use cases – one targeting small-scale, node features and the other focusing on long, areal features. For both use cases, the locations of the features were unknown ahead of the compression. By selecting approximately 16% of the data based on multi-scale spatial variations and compressing those regions with smaller error tolerances than the rest, our approach improves the accuracy of post-analysis by approximately 2 × compared to single-error-bounded compression at the same compression ratio. Using the same error bound for the region of interest, our approach can achieve an increase of more than 50% in overall compression ratio.

Gong, Qian↗

A New Overview of The Trilinos Project

Since An Overview of the Trilinos Project [ACM Trans. Math. Softw. 31(3) (2005), 397–423] was published in 2005, Trilinos has grown significantly. It now supports the development of a broad collection of libraries for scalable computational science and engineering applications, and a full-featured software infrastructure for rigorous lean/agile software engineering. This growth has created significant opportunities and challenges. This paper focuses on some of the most notable changes to the Trilinos project in the last few years. At the time of the writing of this article, the current release version of Trilinos was 10.12.2.

Heroux, Michael A.↗

Progress Version 1.0

Software library for parallel rapid order N and graph-based recursive electronic structure solvers with applications to material science, chemistry, and molecular biology.

Niklasson, AndersM.↗

ENDF/B-VIII.1

The ENDF/B-VIII.1 release is the newest evaluated nuclear data library produced, distributed, and recommended by CSEWG for use in nuclear science and technology applications. Among the many key advances, relative to the previous version ENDF/B-VIII.0, are: re-evaluation of 239Pu file by a joint international effort; updated 16,18O, 19F, 28-30Si, 50-54Cr, 55Mn, 54,56,57Fe, 63,65Cu, 139La, 233,235,238U, and 240,241Pu neutron nuclear data by the IAEA-coordinated INDEN collaboration; significant changes for 3He, 6Li, 9Be, 51V, 88Sr, 103Rh, 140,142Ce, Dy, 181Ta, Pt, 206-208Pb, and 234,236U neutron data; new nuclear data for the photo-nuclear, being 196 adopted from the IAEA2019 Photonuclear Data Library and one new file from JENDL-5; and new evaluations for the charged-particle and atomic sublibraries. Numerous thermal neutron scattering kernels were re-evaluated or provided for the very first time. Additionally, new covariance testing was implemented. ENDF/B-VIII.1 reduced bias in the simulations of many integral experiments with particular progress noted for fluorine, copper and stainless steel containing benchmarks. Data issues which had hindered the deployment of ENDF/B-VIII.0 for commercial nuclear power applications in high burn-up situations, were addressed. ENDF/B-VIII.1 data are distributed in both ENDF-6 and GNDS formats.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

EvoDiffMol: evolutionary diffusion framework for 3D molecular design with optimized properties

Designing molecules with specific target properties remains a fundamental challenge in computational chemistry. While existing approaches show promise, most rely on simplified representations like SMILES strings or 2D graphs that lack essential three-dimensional geometric information. We present EvoDiffMol, a computational framework that integrates evolutionary algorithms with three-dimensional diffusion models for property-driven molecular generation. The method operates through adaptive evolutionary optimization, where population-based selection guides the generation process toward desired property landscapes. EvoDiffMol supports both unconstrained molecular design and scaffold-constrained generation that preserves fixed substructures while optimizing complementary regions. Comprehensive evaluation demonstrates exceptional performance, achieving the highest drug-likeness score (0.94) among all compared state-of-the-art methods while maintaining excellent validity, uniqueness, and novelty. Beyond single property optimization, the framework demonstrates flexible multi-property optimization capabilities, simultaneously controlling multiple molecular descriptors including synthetic accessibility, lipophilicity, topological polar surface area, and clinically relevant ADMET properties such as cardiotoxicity (hERG) and intestinal permeability (Caco-2). This adaptability spans from simple descriptors to practical pharmaceutical endpoints without requiring complete model retraining. The framework achieves precise control over target property values, generating molecules with properties closely matching specified targets for both single and multiple descriptors. Scaffold-constrained experiments preserve fixed molecular cores while maintaining effective property optimization. The three-dimensional representation offers advantages in maintaining structural validity during iterative optimization, with potential for geometry-aware applications in materials science and drug discovery.

3D molecular generation↗

Group structure selection with random forests

Choosing an appropriate group structure for multigroup transport is far from an exact science. For some applications, one blindly uses a group structure developed years ago by forgotten methods. Furthermore, one sometimes uses the same group structure for a variety of problems, even if the group structure was originally developed with a certain application in mind. In this work, we create optimized group structures with simulated annealing for critical assembly test problems and apply a random forest regressor with bagging to choose the best group structure based on parameters of the different test problems. The optimized group structures were generated using a simulated annealing optimizer for several simple, spherical, and unreflected problems. The optimization was performed to minimize a cost function that included fission rate, absorption rate, leakage, and k{sub eff}. A random forest regressor was then trained on a set of International Criticality Safety Benchmark Evaluation Project inputs and used to select one of these six group structures. The trained machine learning model chose the best group structure 65% of the time, and one of the three best 89% of the time. Furthermore, it decreased the L2 error over all test problems by a factor of 25 when compared to the standard Los Alamos 70-group structure. In other words, the model chose group structure that were far more appropriate for the test problems than the traditional LANL group structure. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Using Generative AI to implement the discrepancy checker for a Nearly Autonomous Management and Control System for Advanced Reactors

Developments related to generative artificial intelligence (AI) have brought a major breakthrough in AI. These developments are rapidly accelerating developments in different science and engineering applications. Nearly Autonomous Management and Control (NAMAC) system provides recommendations to the operator for maintaining the safety and performance of the reactor. The discrepancy checker (DC) is an important component of the NAMAC) system, whose goal is to determine if the plant is moving towards the expected system state after the control actions are injected. In this work, we explore generative AI methods, particularly, a generative pretrained transformer (GPT) for implementing the DC function in NAMAC. The GPT-based DC aims to alert the operator in situations outside NAMAC’s scope and act as a chatbot the operator can use to retrieve relevant information. This study involves two versions of GPT developed by OpenAI: GPT-3.5 and GPT-4. These GPTs are trained on huge amounts of undisclosed general domain datasets. We explored two methods to adapt GPTs for DC implementation in NAMAC: fine-tuning and retrieval augmented generation. A small knowledge base (information file) that encompasses rules for DC implementation and some general information related to NAMAC has been created to support DC implementation using GPT. In this work, the GPT-based DC implementations have been tested for their reasoning abilities, comprehension, information retrieval, and extraction abilities. It should be noted that this paper only presents a preliminary study to test the feasibility of DC implementation using generative AI technology. Given the potential risks and severe consequences associated with nuclear reactor applications, combined with the black-box nature of AI, extensive offline and online testing and reliability analyses of GPT-based DCs are needed for further developing such capabilities.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗