Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithms and data structure”

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 343 records · Page 19

Materials Learning Algorithms (MALA): Scalable machine learning for electronic structure calculations in large-scale atomistic simulations

We present the Materials Learning Algorithms (MALA) package, a scalable machine learning framework designed to accelerate density functional theory (DFT) calculations suitable for large-scale atomistic simulations. Using local descriptors of the atomic environment, MALA models efficiently predict key electronic observables, including local density of states, electronic density, density of states, and total energy. The package integrates data sampling, model training and scalable inference into a unified library, while ensuring compatibility with standard DFT and molecular dynamics codes. We demonstrate MALA's capabilities with examples including boron clusters, aluminum across its solid-liquid phase boundary, and predicting the electronic structure of a stacking fault in a large beryllium slab. Scaling analyses reveal MALA's computational efficiency and identify bottlenecks for future optimization. With its ability to model electronic structures at scales far beyond standard DFT, MALA is well suited for modeling complex material systems, making it a versatile tool for advanced materials research.

Density functional theory↗

Adaptive anomaly detection for identifying attacks in cyber-physical systems: A systematic literature review

Modern cyberattacks in cyber-physical systems (CPS) rapidly evolve and cannot be deterred effectively with most current methods, which focus on characterizing past threats. Adaptive anomaly detection (AAD) is among the most promising techniques to detect evolving cyberattacks, with an emphasis on fast data processing and model adaptation. AAD has been researched extensively; however, to the best of our knowledge, our work is the first systematic literature review (SLR) on current research in this field. We present a comprehensive SLR, gathering 397 relevant papers and systematically analyzing 65 of them (47 research and 18 survey papers) on AAD in CPS from 2013 to November 2023. We introduce a novel taxonomy considering attack types, CPS application, learning paradigm, data management, and algorithms. Our findings show that most studies addressed either model adaptation or data processing, but rarely both simultaneously. This indicates a research gap in fully adaptive solutions. We also categorize algorithms, datasets, and attack characteristics, and summarize strengths and weaknesses across the literature. Our review provides a structured and accessible reference for researchers and practitioners, offering insights into key trends and highlighting limitations in current approaches. Finally, we outline several future research directions, including the need for integrated real-time processing and adaptive learning, explainability, and uncertainty quantification in AAD for CPS.

Adaptation↗

Neural chaos: A spectral stochastic neural operator

Building surrogate models for operators with uncertainty quantification capabilities is essential for many engineering applications where randomness–such as variability in material properties, boundary conditions, and initial conditions–is unavoidable. Polynomial Chaos Expansion (PCE) is widely recognized as a go-to method for constructing stochastic surrogates in both intrusive and non-intrusive ways, and it has recently been used in the context of operator learning. However, its application becomes challenging for complex or high-dimensional processes, as achieving accuracy requires higher-order polynomials, which can increase computational demand and/or the risk of overfitting. Furthermore, PCE requires specialized treatments to manage random variables that are not independent, and these treatments may be problem-dependent or may fail with increasing complexity. Here, in this work, we adopt the same formalism as the spectral expansion used in PCE; however, we replace the classical polynomial basis functions with neural network (NN) basis functions to leverage their expressivity. To achieve this, we propose an algorithm that identifies NN-parameterized basis functions in a purely data-driven manner, without any prior assumptions about the joint distribution of the random variables involved, whether independent or dependent, or about their marginal distributions. The proposed algorithm identifies each NN-parameterized basis function sequentially, ensuring they are orthogonal with respect to the data distribution. The basis functions are constructed directly on the joint stochastic variables without requiring a tensor product structure or assuming independence of the random variables. This approach may offer greater flexibility for complex stochastic models, while simplifying implementation compared to the tensor product structures typically used in PCE to handle random vectors. This is particularly advantageous given the current state of open-source packages, where building and training neural networks can be done with just a few lines of code and extensive community support. We demonstrate the effectiveness of the proposed scheme through several numerical examples of varying complexity and provide comparisons with classical PCE.

Polynomial chaos expansion↗

The AXEAP2 program for K β X-ray emission spectra analysis using artificial intelligence

The processing and analysis of synchrotron data can be a complex task, requiring specialized expertise and knowledge. Our previous work addressed the challenge of X-ray emission spectrum (XES) data processing by developing a standalone application using unsupervised machine learning. However, the task of analyzing the processed spectra remains another challenge. Although the non-resonant K β XES of 3 d transition metals are known to provide electronic structure information such as oxidation and spin state, finding appropriate parameters to match experimental data is a time-consuming and labor-intensive process. Here, a new XES data analysis method based on the genetic algorithm is demonstrated, applying it to Mn, Co and Ni oxides. This approach is also implemented as a standalone application, Argonne X-ray Emission Analysis 2 ( AXEAP2 ), which finds a set of parameters that result in a high-quality fit of the experimental spectrum with minimal intervention. AXEAP2 is able to find a set of parameters that reproduce the experimental spectrum, and provide insights into the 3 d electron spin state, 3 d –3 p electron exchange force and K β emission core-hole lifetime.

36 MATERIALS SCIENCE↗

Improving Property Graph Layouts by Leveraging Attribute Similarity for Structurally Equivalent Nodes

Many real-world networks contain structurally-equivalent nodes. These are defined as vertices that share the same set of neighboring nodes, making them interchangeable with a traditional graph layout approach. However, many real-world graphs also have properties associated with nodes, adding additional meaning to them. We present an approach for swapping locations of structurally-equivalent nodes in graph layout so that those with more similar properties have closer proximity to each other. This improves the usefulness of the visualization from an attribute perspective without negatively impacting the visualization from a structural perspective. We include an algorithm for finding these sets of nodes in linear time, as well as methodologies for ordering nodes based on their attribute similarity, which works for scalar, ordinal, multidimensional, and categorical data.

graph drawing, network visualization, property gra↗

Data from: 'Abiotic influences on continuous conifer forest structure across a subalpine watershed'

This package archives the core data used for analysis and inference in 'Abiotic influences on continuous conifer forest structure across a subalpine watershed' (Worsham et al., 2025). All data were collected in the East River, Washington Gulch, Slate River, and Coal Creek watersheds of Colorado. In the paper, we quantified the relative influence of climate, topographic, edaphic, and geologic factors on conifer stand structure and composition, and their functional relationships, at the watershed scale. We used waveform LiDAR data to derive spatially continuous stand structure metrics. We fused these with a species-level classification map to estimate tree species abundance. We applied generalized additive and generalized boosted models to evaluate the covariability of structural and compositional metrics with abiotic variables. The package contains the essential products required for reproducing our analysis and the tables and figures reported in the publication. The products comprise four classes: (1) geospatial data, (2) tabular data used for inferential analysis, (3) tabular data describing analytical results and performance statistics, and (4) a data user guide. (1) includes discretized waveform LiDAR data, locations and attributes of individual tree crowns, sampling locations and domain boundaries, a canopy height model, and raster files of estimated forest structural and compositional metrics at 100 m grid scale. (2) includes all response and explanatory variable values applied in inferential models. Response variables include conifer forest stand density, basal area, 95th percentile height, quadratic mean diameter, and others. Explanatory variables include climatic water deficit, actual evapotranspiration, elevation, heat load, soil available water content, and others. (3) includes results of training and testing several individual tree detection (ITD) algorithms, as well as inferential modeling results. (4) is a PDF user guide for this data package, including detailed descriptions and data dictionaries for all files. The data package root contains 17 assets: 8 compressed tape archive (.tar.gz) files, 5 comma-separated values (.csv) files, 3 Geographic Tagged Image File Format (GeoTIFF) (.tif) files, and 1 Portable Document Format (.pdf) file. The compressed .tar.gz archives contain ESRI shapefiles (.shp) .tif, compressed LASer (.laz), and .csv files. The archives must first be decompressed using the widely distributed command-line software utility TAR. All other files, including constituent files within the .tar.gz archives, can be opened in the open-source R statistical computing environment. Alternatively, .csv files may also be read in any simple text editor software or Microsoft Excel. Geospatial files including .shp and .tif files can also be opened in GIS software, such as QGIS (open-source) or ESRI ArcGIS (proprietary). The .pdf Data User Guide can be read with Adobe Acrobat Reader or other compatible readers.

2018 NEON and 2025 CHESS Campaigns↗

A Bayesian desmearing algorithm for Bonse–Hart USANS with anisotropic scattering

Ultra-small-angle neutron scattering (USANS) using Bonse–Hart optics provides micrometer-scale structural insights but suffers from severe slit-geometry smearing. While well-established for isotropic systems, quantitative desmearing of anisotropic data remains a challenge because conventional corrections break down for non-radial scattering. In this work, we address this by developing a resolution-aware Bayesian framework that explicitly incorporates anisotropy via an affine deformation to the scattering pattern, guided by the principle of parsimony. This results in orientation-resolved point-spread functions that enable a self-consistent determination of both the resolution and deformation parameters. Using Gaussian process regression with uncertainty quantification and a probabilistic correction for multiple scattering, we demonstrate the framework’s effectiveness through numerical benchmarks and experimental studies of a stretched polymer melt. Our approach enables the seamless integration of SANS and USANS data, facilitating quantitative structural analysis of deformed materials at nanometer to micrometer scales.

36 MATERIALS SCIENCE↗

via machinae : Searching for stellar streams using unsupervised machine learning

ABSTRACT We develop a new machine learning algorithm, via machinae, to identify cold stellar streams in data from the Gaia telescope. via machinae is based on ANODE, a general method that uses conditional density estimation and sideband interpolation to detect local overdensities in the data in a model agnostic way. By applying ANODE to the positions, proper motions, and photometry of stars observed by Gaia, via machinae obtains a collection of those stars deemed most likely to belong to a stellar stream. We further apply an automated line-finding method based on the Hough transform to search for line-like features in patches of the sky. In this paper, we describe the via machinae algorithm in detail and demonstrate our approach on the prominent stream GD-1. Though some parts of the algorithm are tuned to increase sensitivity to cold streams, the via machinae technique itself does not rely on astrophysical assumptions, such as the potential of the Milky Way or stellar isochrones. This flexibility suggests that it may have further applications in identifying other anomalous structures within the Gaia data set, for example debris flow and globular clusters.

79 ASTRONOMY AND ASTROPHYSICS↗

Event Definition for the Automated Detection of Nuclear Proliferation Activities

In FY2020, Savannah River National Laboratory (SRNL) in collaboration with the Discovery Analytics Center (DAC) at Virginia Polytechnic Institute and State University (VT) began developing a demonstration prototype system that uses multiple machine learning and data analytic methods on largescale open data sources to identify new, developing, or undeclared nuclear programs. One of the most challenging aspects of applying machine learning techniques to such a problem is the high likelihood of extremely sparse data from disparate sources. To overcome this challenge, the current work will use a strategic combination of supervised, semi-supervised, and unsupervised learning techniques to ingest and fuse data streams to make a forecast of nuclear activities in a targeted geospatial location. Identifying potential data sources and training supervised learning algorithms is dependent upon the development of a robust foundation of targeted event domains that fundamentally define the nuclear activities of interest. This report documents the definition of a hierarchical structure for both nuclear activity and event domains that will be used to guide the research team in development or use of existing semantic dictionaries that are instrumental to searching, parsing, and categorizing events for the forecasting system’s use.

97 MATHEMATICS AND COMPUTING↗

A Comparison between Invariant and Equivariant Classical and Quantum Graph Neural Networks

Machine learning algorithms are heavily relied on to understand the vast amounts of data from high-energy particle collisions at the CERN Large Hadron Collider (LHC). The data from such collision events can naturally be represented with graph structures. Therefore, deep geometric methods, such as graph neural networks (GNNs), have been leveraged for various data analysis tasks in high-energy physics. One typical task is jet tagging, where jets are viewed as point clouds with distinct features and edge connections between their constituent particles. The increasing size and complexity of the LHC particle datasets, as well as the computational models used for their analysis, have greatly motivated the development of alternative fast and efficient computational paradigms such as quantum computation. In addition, to enhance the validity and robustness of deep networks, we can leverage the fundamental symmetries present in the data through the use of invariant inputs and equivariant layers. In this paper, we provide a fair and comprehensive comparison of classical graph neural networks (GNNs) and equivariant graph neural networks (EGNNs) and their quantum counterparts: quantum graph neural networks (QGNNs) and equivariant quantum graph neural networks (EQGNN). The four architectures were benchmarked on a binary classification task to classify the parton-level particle initiating the jet. Based on their area under the curve (AUC) scores, the quantum networks were found to outperform the classical networks. However, seeing the computational advantage of quantum networks in practice may have to wait for the further development of quantum technology and its associated application programming interfaces (APIs).

Forestano, Roy T. (ORCID:0000000203552076)↗

Joint iterative reconstruction and 3D rigid alignment for X-ray tomography

X-ray tomography is widely used for three-dimensional structure determination in many areas of science, from the millimeter to the nanometer scale. The resolution and quality of the 3D reconstruction is limited by the availability of alignment parameters that correct for the mechanical shifts of the sample or sample stage for the images that constitute a scan. In this paper we describe an algorithm for marker-free, fully automated and accurately aligned and reconstructed X-ray tomography data. Our approach solves the tomographic reconstruction jointly with projection data alignment based on a rigid-body deformation model. We demonstrate the robustness of our method on both synthetic phantom and experimental data and show that our method is highly efficient in recovering relatively large alignment errors without prior knowledge of a low resolution approximation of the 3D structure or a reasonable estimate of alignment parameters.

36 MATERIALS SCIENCE↗

Predicting potential adverse events using safety data from marketed drugs

Abstract Background While clinical trials are considered the gold standard for detecting adverse events, often these trials are not sufficiently powered to detect difficult to observe adverse events. We developed a preliminary approach to predict 135 adverse events using post-market safety data from marketed drugs. Adverse event information available from FDA product labels and scientific literature for drugs that have the same activity at one or more of the same targets, structural and target similarities, and the duration of post market experience were used as features for a classifier algorithm. The proposed method was studied using 54 drugs and a probabilistic approach of performance evaluation using bootstrapping with 10,000 iterations. Results Out of 135 adverse events, 53 had high probability of having high positive predictive value. Cross validation showed that 32% of the model-predicted safety label changes occurred within four to nine years of approval (median: six years). Conclusions This approach predicts 53 serious adverse events with high positive predictive values where well-characterized target-event relationships exist. Adverse events with well-defined target-event associations were better predicted compared to adverse events that may be idiosyncratic or related to secondary target effects that were poorly captured. Further enhancement of this model with additional features, such as target prediction and drug binding data, may increase accuracy.

Daluwatte, Chathuri↗

Machine learning study of magnetism in uranium-based compounds

Actinide and lanthanide-based materials display exotic properties that originate from the presence of itinerant or localized f electrons and include unconventional superconductivity and magnetism, hidden order, and heavy-fermion behavior. Due to the strongly correlated nature of the 5f electrons, magnetic properties of these compounds depend sensitively on applied magnetic field and pressure, as well as on chemical doping. However, precise connection between the structure and magnetism in actinide-based materials is currently unclear. In this investigation, we established such structure-property links by assembling and mining two datasets that aggregate, respectively, the results of high-throughput density functional theory simulations and experimental measurements for the families of uranium- and neptunium-based binary compounds. Various regression algorithms were utilized to identify correlations among accessible attributes (features or descriptors) of the material systems and predict their cation magnetic moments and general forms of magnetic ordering. Descriptors representing compound structural parameters and cation f-subshell occupation numbers were identified as most important for accurate predictions. The best machine learning model developed employs the random forest regression algorithm. It can predict both spin and orbit moment size with root-mean-square error of 0.17 μ B and 0.19 μ B , respectively. Lastly, the random forest classification algorithm is used to predict the ordering (paramagnetic, ferromagnetic, and antiferromagnetic) of such systems with 76% accuracy.

36 MATERIALS SCIENCE↗

Fossil group origins

Aims: We analyse the large-scale structure out to 100 Mpc around a sample of 16 confirmed fossil systems using spectroscopic information from the Sloan Digital Sky Survey Data Release 16. Methods: We computed the distance between our fossil groups (FGs) and the centres of filaments and nodes from the literature. We also studied the density of bright galaxies, since this parameter is thought to be a good mass tracers, as well as the projected over-densities of galaxies. Finally, we applied a friends-of-friends (FoF) algorithm to detect virialised structures around our FGs and obtain an estimate of the mass available in their surroundings. Results: We find that FGs are mainly located close to filaments, with a mean distance of 3.7 ± 1.1 R 200 and a minimum distance of 0.05 R 200 . On the other hand, none of our FGs were found close to intersections, with a mean and minimum distance of 19.3 ± 3.6 and 6.1 R 200 , respectively. There is a correlation that indicates FGs at higher redshifts are found in denser regions, when we use bright galaxies as tracers of the mass. At the same time, FGs with the largest magnitude gaps (Δm 12 > 2.5) are found in less dense environments and tend to host (on average) smaller central galaxies. Conclusions: Our results suggest that FGs formed in a peculiar position within the cosmic web, close to filaments and far from nodes, whereby their interaction with the cosmic web itself may be limited. We deduce that FGs with brightest central galaxies (BCGs) that are relatively faint, high values of Δm 12 , and low redshifts could, in fact, be systems that are at the very last stage of their evolution. Moreover, we confirm theoretical predictions that systems with the largest magnitude gap are not massive.

79 ASTRONOMY AND ASTROPHYSICS↗

Austenitic parent grain reconstruction in martensitic steel using deep learning

In this work we develop a deep convolutional architecture to estimate the prior austenite structure from observed martensite electron backscatter diffraction micrographs. A novel data augmentation strategy randomizes the global reference coordinate system which makes it possible to train our model from only four micrographs. The model is much faster than algorithmic approaches and generalizes well when applied to micrographs of a different material. Empirical evidence suggests the efficacy of the model depends on the scale of the microstructure and receptive field of the vision model. Furthermore, this work demonstrates that modern computer vision approaches are well suited for capturing complex spatial-orientation patterns present in orientation imaging micrographs.

36 MATERIALS SCIENCE↗

Structure-guided design of a broadly cross-reactive multivalent group a streptococcal vaccine

The M protein of group A streptococci (Strep A) is a major virulence determinant and protective antigen. The N-terminal region of the M protein is variable in sequence, defines the M/emm type, and contains epitopes that elicit opsonic antibodies that protect animals from challenge infections. Although there are >200 M types of Strep A, there is now evidence that structurally related M proteins can be grouped into clusters and that immunity may be cluster-specific in addition to M type-specific. This observation has led to recent studies of structure-based design of multivalent M peptide vaccines to select peptides predicted to cross-react with heterologous M types to improve vaccine coverage. In the current study, we have applied a refined series of peptide structural algorithms to predict immunological cross-reactivity among 117N-terminal M peptides representing the most prevalent M types of Strep A. Based on the results of the structural analyses, in combination with global M type prevalence data, we constructed a 32-valent vaccine containing 19 cross-reactive vaccine candidates predicted to cross-react with 37 heterologous M peptides to which were added 13 type-specific M peptides. Further, the 4-protein recombinant vaccine was immunogenic in rabbits and elicited significant levels of antibodies against 31/32 (97%) vaccine peptides and 28/37 (76%) peptides predicted to cross-react. The vaccine antisera also promoted opsonophagocytic killing of vaccine and cross-reactive M types of Strep A. Based on a recent analysis of M type prevalence of Strep A, the potential global coverage of the 32-valent vaccine is ~90%, ranging from 68% in Africa to 95% in North America. Our results indicate the utility of structure-based design that may be applied to future studies of broadly protective M peptide vaccines.

60 APPLIED LIFE SCIENCES↗

DENSS-Multiple

It takes multiple data sets from small-angle neutron scattering experiment at different contrast conditions to synthetically use DENSS algorithm (https://www.nature.com/articles/nmeth.4581) to combine all the information from each data set. As the multiple data set contains more information than a single data, all information in the multiple data set are collectively contribute to the final single synthetic structure that represents a molecular particle structure.

Qian, Shuo (000000024842828X)↗

Micropulse Lidar Cloud Mask (MPLCMASK) Value-Added Product for the Fast-Switching Polarized Micropulse Lidar Technical Report

Lidar backscattered signal is a useful tool for identifying vertical cloud structure in the atmosphere in optically thin clouds. Cloud boundaries derived from lidar signals are a necessary input for popular ARM data products, such as the Active Remote Sensing of Clouds (ARSCL) product. An operational cloud boundary algorithm (Wang and Sassen 2001) has been implemented for use with the ARM Micropulse Lidar (MPL) systems. In addition to retrieving cloud boundaries above 500 m, the value-added product (VAP) named Micropulse Lidar Cloud Mask (MPLCMASK) applies lidar-specific corrections (i.e., range-square, background, deadtime, and overlap) as described in Campbell et al. (2002) to the measured backscattered lidar. Depolarization ratio is computed using the methodology developed by Flynn et al. (2007) for polarization-capable MPL systems. The cloud boundaries output from MPLCMASK will be the primary lidar cloud mask for input to the ARSCL product and will be applied to all MPL systems, including historical data sets.

54 ENVIRONMENTAL SCIENCES↗