Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Randomized methods”

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 487 records · Page 27
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

malbacR: A Package for Standardized Implementation of Batch Correction Methods for Omics Data

Mass spectrometry is a powerful tool for identifying and analyzing small molecules, such as metabolites and lipids, in com-plex biological samples. Liquid chromatography and gas chromatography mass spectrometry studies quite commonly in-volve large numbers of samples, which can require significant time for sample preparation and analyses. To accommodate such studies, the samples are commonly split into batches. Inevitably, variations in sample handling, temperature fluctua-tion, imprecise timing, column degradation and other factors result in systematic errors or biases of the measured abundances between the batches. Numerous methods are available via R packages to assist with batch correction for small molecule om-ics data; however, since these methods were developed by different research teams, the algorithms are available in separate R packages, each with different data input and output formats. We introduce the malbacR package which consolidates eleven common batch effect correction methods for small molecule omics data into one place so users can easily implement and compare: pareto scaling, power scaling, range scaling, ComBat, EigenMS, NOMIS, RUV-random, QC-RLSC, WaveI-CA2.0, TIGER, and SERRF. The malbacR package standardizes data input and output formats across these batch correction methods. The package works in conjunction with the pmartR package, allowing users to seamlessly include batch effect cor-rection in a pmartR workflow without needing any additional data manipulation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Out of time order correlation of the Hubbard model with random local disorder

The out-of-time-order correlator (OTOC) serves as a powerful tool for investigating quantum information spreading and chaos in complex systems. We present a method employing non-equilibrium dynamical mean-field theory and coherent potential approximation combined with diagrammatic perturbation on the Schwinger–Keldysh contour to calculate the OTOC for correlated fermionic systems subjected to both random disorder and electron interaction. Furthermore, our key finding is that random disorder enhances the OTOC decay in the Hubbard model for the metallic phase in the weakly interacting limit. However, the current limitation of our perturbative solver restricts the applicability to weak interaction regimes.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2026

scPlantAnnotate: an accurate and robust transformer-based model for plant cell type annotation

Accurate cell type annotation remains a major bottleneck in plant single-cell RNA sequencing (scRNA-seq), where existing tools are often adapted from animal studies and perform sub-optimally on plant data. The lack of plant-specific computational frameworks limits the construction of plant cell atlases and downstream biological discovery. We develop and evaluate scPlantAnnotate, a Transformer-based reference annotation framework tailored for plant scRNA-seq data, and benchmark it against state-of-the-art deep learning and conventional methods across multiple plant species. Species-specific scPlantAnnotate models were trained using curated datasets from Arabidopsis thaliana, Zea mays, Oryza sativa, and Glycine max. We compared scPlantAnnotate with leading baselines under both standard random-split evaluation and a more stringent leave-one-dataset-out setting, which tests robustness to completely unseen datasets and tissue types. scPlantAnnotate consistently outperforms existing approaches across all four species under random-split evaluation. In the leave-one-dataset-out setting for A. thaliana, where performance drops markedly for all methods due to strong batch effects and dataset heterogeneity, scPlantAnnotate nonetheless achieves the highest Accuracy, Macro-F1, Balanced Accuracy, and Macro-AUROC on average and ranks first on most held-out datasets. These results demonstrate improved robustness to dataset shifts, a critical yet underexplored challenge in plant scRNA-seq analysis. A freely accessible web server enables users to annotate their own datasets using pretrained models. scPlantAnnotate provides a plant-specific, Transformer-based framework for single-cell annotation that delivers state-of-the-art performance and enhanced robustness to unseen datasets. By addressing limitations of existing tools and enabling scalable reference-based annotation, scPlantAnnotate supports the development of comprehensive plant cell atlases and facilitates broader use of single-cell genomics in plant biology.

Bioinformatics↗
DOE OSTI2020

Methods for the robust computation of the long-period seismic spectrum of broad-band arrays

SUMMARY We describe array methods to search for low signal-to-noise ratio (SNR) signals in long-period seismic data using Fourier analysis. This is motivated by published results that find evidence of solar free oscillations in the Earth's seismic hum. Previous work used data from only one station. In this paper, we describe methods for computing spectra from array data. Arrays reduce noise level through averaging and provide redundancy that we use to distinguish coherent signal from a random background. We describe two algorithms for calculating a robust spectrum from seismic arrays, an algorithm that automatically removes impulsive transient signals from data, a jackknife method for estimating the variance of the spectrum, and a method for assessing the significance of an entire spectral band. We show examples of their application to data recorded by the Homestake Mine 3-D array in Lead, SD and the Piñon Flats PY array. These are two of the quietest small aperture arrays ever deployed in North America. The underground Homestake data has exceptionally low noise, and the borehole sensors of the PY array also have very low noise, making these arrays well suited to finding very weak signals. We find that our methods remove transient signals effectively from the data so that even low-SNR signals in the seismic background can be found and tested. Additionally, we find that the jackknife variance estimate is comparable to the noise floor, and we present initial evidence for solar g-modes in our data through the T2 test, a multivariate generalization of Student's t-test.

Caton, Ross C.↗
DOE OSTI2024

A finite difference informed random walker (FDiRW) solver for strongly inhomogeneous diffusion problems

In nature, many complex multi-physics coupling problems exhibit strong diffusivity inhomogeneity. For instance, in the context of radionuclide absorption by porous wasteform materials within a flowing waste stream, the difference of species’ diffusivity in solid and liquid phases spans by 3~8 orders of magnitude. To solve the diffusion equations with strongly inhomogeneous diffusivity, traditional discretization-based methods, such as the Finite Difference Method (FDM), require infinitesimally small time steps (<10 -10 ) as high spatial resolutions are employed in most microstructure evolution processes, leading to prohibitively high computational costs. Here, this work developed an integrated numerical approach (FDiRW: Finite Difference informed Random Walk) to tackle this challenge. The idea is that utilizing the Random Walk concept, the fast diffusion is modeled as a superposition of point source’s solution for a concentration distribution while FDM is used to obtain the point source’s solution at each node. A mesh-coarsening algorithm is developed to generate an exclusive coarse mesh for FDiRW approach to maximize its efficiency. The effectiveness of the coarse mesh-based FDiRW approach is validated by benchmarking Finite Difference solutions. Numerical results demonstrated that FDiRW achieves a remarkable 1000x computational efficiency improvement over FDM while preserving desired accuracy for a medium-sized model of 192 × 192 × 192 grids. Finally, as models scale up, a floating-point operations (PLOPs) analysis of the FDiRW algorithm reveals that its computational complexity grows quadratically in terms of the number of nodes employed in computation.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization

Here, we consider unconstrained stochastic optimization problems with no available gradient information. Such problems arise in settings from derivative-free simulation optimization to reinforcement learning. We propose an adaptive sampling quasi-Newton method where we estimate the gradients using finite differences of stochastic function evaluations within a common random number framework. We develop modified versions of a norm test and an inner product quasi-Newton test to control the sample sizes used in the stochastic approximations and provide global convergence results to the neighborhood of a locally optimal solution. We present numerical experiments on simulation optimization problems to illustrate the performance of the proposed algorithm. When compared with classical zeroth-order stochastic gradient methods, we observe that our strategies of adapting the sample sizes significantly improve performance in terms of the number of stochastic function evaluations required.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Augmenting subspace optimization methods with linear bandits

In this work, we consider the framework of methods for unconstrained minimization that are, in each iteration, restricted to a model that is only a valid approximation to the objective function on some affine subspace containing an incumbent point. These methods are of practical interest in computational settings where derivative information is either expensive or impossible to obtain. Recent attention has been paid in the literature to employing randomized matrix sketching for generating the affine subspaces within this framework. We consider a relatively straightforward, deterministic augmentation of such a generic subspace optimization method. In particular, we consider a sequential optimization framework where actions consist of one-dimensional linear subspaces and rewards consist of (approximations to) the magnitudes of directional derivatives computed in the direction of the action subspace. Reward maximization in this context is consistent with maximizing lower bounds on descent guaranteed by first-order Taylor models. This sequential optimization problem can be analysed through the lens of dynamic regret. We modify an existing linear upper confidence bound (UCB) bandit method and prove sublinear dynamic regret in the subspace optimization setting. We demonstrate the efficacy of employing this linear UCB method in a setting where forward-mode algorithmic differentiation can provide directional derivatives in arbitrary directions and in a derivative-free setting. For the derivative-free setting, we propose SS-POUNDers, an extension of the derivative-free optimization method POUNDers that employs the linear UCB mechanism to identify promising subspaces. Our numerical experiments suggest a preference, in either computational setting, for employing a linear UCB mechanism within a subspace optimization method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Evaluating the Interplay between Trajectory Segmentation and Mode Inference Error

Travel behavior changes are essential to transportation decarbonization. Travel diaries, consisting of sequences of trips between places, are typically used to instrument human travel behavior. However, these diaries are only as accurate as the underlying methods used to construct them. Travel diary algorithms have been a popular research topic since the advent of Global Positioning System tracking surveys. These algorithms have typically been validated using prompted recall of presegmented trips, thus disregarding the continuity of mode inference. Phone operating systems have adopted battery-conserving techniques, but the resulting data collection errors have not been studied extensively. We introduce a framework to evaluate the accuracy of trip length computations and mode inference by analyzing continuous mode-segmented trajectories for groups of trips. We then use the framework to identify the input data quality and the impact of postprocessing. Our primary inputs to this evaluation are MobilityNet, a public dataset containing information from three artificial timelines covering 15 different travel modes, and sample open-source travel diary creation algorithms from the OpenPATH project. Our framework concretely shows that the variance of the distance error drops from (0.217, 0.0848) to (o.011, 0.0407) (Android, iOS) after postprocessing. Similarly, the weighted F-scores for mode inference increase from (0.25, 0.29) to (0.60, 0.74) (iOS, Android) between random forest and geographic information system-based models. We hope that this standardized method will be adapted to evaluate other, potentially proprietary, travel diary algorithms. Finally, the results can be used to understand and improve the state of the art in the travel diary creation field.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2021

PARIS: Predicting application resilience using machine learning

The traditional method to study application resilience to errors in HPC applications uses fault injection (FI), a time-consuming approach. Furthermore, while analytical models have been built to overcome the inefficiencies of FI, they lack accuracy. In this paper, we present PARIS, a machine-learning method to predict application resilience that avoids the time-consuming process of random FI and provides higher prediction accuracy than analytical models. PARIS captures the implicit relationship between application characteristics and application resilience, which is difficult to capture using most analytical models. We overcome many technical challenges for feature construction, extraction, and selection to use machine learning in our prediction approach. Our evaluation on 16 HPC benchmarks shows that PARIS achieves high prediction accuracy. PARIS is up to 450x faster than random FI (49x on average). Compared to the state-of-the-art analytical model, PARIS is at least 63% better in terms of accuracy and has comparable execution time on average.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

High-Resolution Comonomer Sequencing of Blocky Brominated Syndiotactic Polystyrene Copolymers Using 13C NMR Spectroscopy and Computer Simulations

This work demonstrates the first high-resolution comonomer sequencing of Blocky brominated syndiotactic polystyrene (sPS-co-sPS-Br) copolymers based on pentad assign- ments of the quaternary carbon region of the nuclear magnetic resonance spectrum. Copolymers containing p-bromostyrene (Br-Sty) units were prepared in matched sets using postpolymerization bromination methods carried out in the heterogeneous gel state (Blocky) and homogeneous solution state (Random). Quantitative information from the quaternary carbon spectra, heteronuclear multiple bond correlation spectroscopy, electronic structure calculations, and simulated statistically random copolymers was correlated to confirm the carbon resonance assignments for all 20 possible pentad comonomer sequences. Using the experimental pentad sequence prevalences, a computer code was developed to simulate chains with microstructures typical of each sample as a means to visually represent the copolymer blockiness with quantitative precision. Based on the microstructure and distribution of run lengths in these chains, the simulations revealed that the Blocky copolymers contain a high degree of blockiness. By comparing the run lengths in the simulated chains to the average number of styrene units in a crystalline segment of sPS (found by small-angle X-ray scattering), copolymer crystallizability was predicted. For the simulated Blocky B-21% (21 mol % Br-Sty) chain, the probability of randomly selecting a styrene unit in a crystallizable block was 25.8%, while that in the simulated Random R-18% was zero, in excellent agreement with the experimental crystallization behavior measured by differential scanning calorimetry. Additionally, these predictions confirmed that the simulated chains accurately represent the ensemble of chains in their respective copolymer samples. Furthermore, each simulated Blocky chain contained one or more long sPS blocks that paralleled the measured 38-40 styrene units spanning a crystalline segment within the sPS/CCl4 gel. This finding affirmed that the long sPS segments originated from the precise lamellar structure within the heterogeneous gel morphology (i.e., block length is correlated with lamellar thickness). Overall, the ability to tailor the copolymer microstructure through control of the semicrystalline gel morphology opens the door to synthesizing ordered copolymers by postpolymerization functionalization processes with unprecedented levels of compositional control.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

A Differentiable Hydrology Approach for Modeling With Time-Varying Parameters

In the analysis of observational data with mathematical models, it is often desirable to let one or more model parameters vary with time to account for changing environmental conditions or to offer more flexibility. A standard approach for dynamic models is to allow for the number of parameters to grow as a function of time, leading to a high-dimensional inference problem for long data records. We propose using Hamiltonian Monte Carlo, a gradient-based Markov chain Monte Carlo (MCMC) method, to perform Bayesian inference for time-varying parameters (TVP) in hydrology models. As derivatives of model error functions with regard to parameters are not available in closed form, we implemented the GR4J rainfall-runoff models in Theano/PyMC3, and Jax/NumPyro, allowing for the application of automatic differentiation techniques. A simulation experiment assessing the viability of these methods for recovering underlying temporal variation in parameters indicates that a discrete Gaussian random walk-based prior appears to be best suited across a range of scenarios while the continuous-time Gaussian process compares relatively poorly. In an analysis of 20 years of daily real-world streamflow records from the Model Parameter Estimation Experiment (MOPEX) hydrology data set with increasing data sparsity and at multiple temporal resolutions, we find that TVP inference with gradient-based MCMC is a flexible and reliable approach for analyzing hydrology models with dynamic parameter sets.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Spherulite-enhanced macroscopic polarization in molecular ferroelectric films from vacuum deposition

Proton-transfer type molecular ferroelectrics hold significant promise for practical application due to their large spontaneous polarizations, high Curie temperatures, and small switching fields. However, it remains puzzling that preparation of quasi-2D films exhibiting macroscopic ferroelectric behaviors has been reported in only few molecular ferroelectrics. To address this puzzle, we studied the impact of microstructures on the macroscopic ferroelectric properties of 5,6-dichloro-2-methylbenzimidazole (DC-MBI) films grown using the low-temperature deposition followed by the restrained crystallization (LDRC) method. Our findings revealed a competition between dense spherulites and porous microstructures containing randomly oriented nanograins in the as-grown films. Post-growth annealing at moderate temperature promotes the formation of spherulites, leading to macroscopic ferroelectric polarization switching. These results underscore the critical role of microstructure density in determining macroscopic ferroelectric properties, potentially resolving the puzzle for the absence of such behavior in many molecular ferroelectric films. Here, we anticipate that the approach proposed in this study to enhance microstructure density will significantly advance the fabrication of quasi-2D molecular ferroelectric films and unlock their potential in device applications.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Development of Short-Term Forecasting Models Using Plant Asset Data and Feature Selection

Nuclear power plants collect and store large volumes of heterogeneous data from various components and systems. With recent advances in machine learning (ML) techniques, these data can be leveraged to develop diagnostic and short-term forecasting models to better predict future equipment condition. Maintenance operations can then be planned in advance whenever degraded performance is predicted, thus resulting in fewer unplanned outages and the optimization of maintenance activities. This enables lower maintenance costs and improves the overall economics of nuclear power. This paper focuses on developing a short-term forecasting process that leverages a feature selection process to distill large volumes of heterogeneous data and predict specific equipment parameters. A variety of feature selection methods, including Shapley Additive Explanations (SHAP) and variance inflation factor (VIF), were used to select the optimal features as inputs for three ML methods: long short-term memory (LSTM) networks, support vector regression (SVR), and random forest (RF). Each combination of model and input features was used to predict a pump bearing temperature both 1 and 24 hours in advance, based on actual plant system data. The optimal inputs for the LSTM and SVR were selected using the SHAP values, while the optimal input for the RF consisted solely of the response variable itself. Each model produced similar 1-hour-ahead predictions, with root mean square errors (RMSEs) of roughly 0.006. For the 24-hour-ahead predictions, differences could be seen between LSTM, SVR, and RF, as reflected by model performances of 0.036 +- 0.014, 0.0026 +- 0, and 0.063 +- 0.004 RMSE, respectively. As big data and continuous online monitoring become more widely available, the proposed feature selection process can be used for many applications beyond the prediction of process parameters within nuclear infrastructure.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2021

On the Feynman-alpha method for reflected fissile assemblies

The Feynman-alpha method is a neutron noise technique that is used to estimate the prompt neutron period of fissile assemblies. The method and quantity are of widespread interest including in applications such as nuclear criticality safety, safeguards and nonproliferation, and stockpile stewardship; the prompt neutron period may also be used to infer the k eff multiplication factor. The Feynman-alpha method is predicated on time-correlated neutron detections that deviate from a Poisson random variable due to multiplication. Traditionally, such measurements are diagnosed with one-region point kinetics, but two-region models are required when the fissile assembly is reflected. This paper presents a derivation of the two-region point kinetics Feynman-alpha equations based on a double integration of the Rossi-alpha equations, develops novel propagation of measurement uncertainty, and validates the theory. Validation is achieved with organic scintillator measurements of weapons-grade plutonium reflected by various amounts of copper to achieve k eff values of 0.83–0.94 and prompt periods of 5–75 ns. The results demonstrate that Feynman-alpha measurements should use the two-region model instead of the one-region model. The simplified one-region model deviates from the validated two-region models by as much as 10% in the estimate of the prompt neutron period, and the two-region model reduces to the one-region model for small amounts of reflector. The Feynman-alpha estimates of the prompt neutron period are compared to those of the Rossi-alpha approach. The comparative results demonstrate that the Feynman-alpha method is more precise than the Rossi-alpha method and more accurate for k eff < 0.92, whereas the Rossi-alpha method is generally more accurate for higher multiplications. Here, the uncertainty propagation developed in this work should be used for all Feynman-alpha measurements and will therein improve fitting accuracy and appropriate precision estimates.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗
DOE OSTI2024

Generalized representative structures for atomistic systems

A new method is presented to generate atomic structures that reproduce the essential characteristics of arbitrary material systems, phases, or ensembles. Previous methods allow one to reproduce the essential characteristics (e.g. the chemical disorder) of a large random alloy within a small crystal structure. The ability to generate small representations of random alloys, along with the restriction to crystal systems, results from using the fixed-lattice cluster correlations to describe structural characteristics. A more general description of the structural characteristics of atomic systems is obtained using complete sets of atomic environment descriptors. These are used within for generating representative atomic structures without restriction to fixed lattices. A general data-driven approach is provided here utilizing the atomic cluster expansion (ACE) basis. The N-body ACE descriptors are a complete set of atomic environment descriptors that span both chemical and spatial degrees of freedom and are used within for describing atomic structures. The generalized representative structure (GRS) method presented within generates small atomic structures that reproduce ACE descriptor distributions corresponding to arbitrary structural and chemical complexity. It is shown that systematically improvable representations of crystalline systems on fixed parent lattices, amorphous materials, liquids, and ensembles of atomic structures may be produced efficiently through optimization algorithms. With the GRS method, we highlight reduced representations of atomistic machine-learning training datasets that contain similar amounts of information and small 40–72 atom representations of liquid phases. The ability to use GRS methodology as a driver for informed novel structure generation is also demonstrated. The advantages over other data-driven methods and state-of-the-art methods restricted to high-symmetry systems are highlighted.

atomic cluster expansion↗
DOE OSTI2021

On the Estimation of Circumbinary Orbital Properties

We describe a fast, approximate method to characterize the orbits of satellites around a central binary in numerical simulations. A goal is to distinguish the free eccentricity—the random motion of a satellite relative to a dynamically cool orbit—from oscillatory modes driven by the central binary’s time-varying gravitational potential. We assess the performance of the method using the Kepler-16, Kepler-47, and Pluto–Charon systems. We then apply the method to a simulation of orbital damping in a circumbinary environment, resolving relative speeds between small bodies that are slow enough to promote mergers and growth. These results illustrate how dynamical cooling can set the stage for the formation of Tatooine-like planets around stellar binaries and the small moons around the Pluto–Charon binary planet.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

A Hierarchical Feature-Based Methodology to Perform Cervical Cancer Classification

Prevention of cervical cancer could be performed using Pap smear image analysis. This test screens pre-neoplastic changes in the cervical epithelial cells; accurate screening can reduce deaths caused by the disease. Pap smear test analysis is exhaustive and repetitive work performed visually by a cytopathologist. This article proposes a workload-reducing algorithm for cervical cancer detection based on analysis of cell nuclei features within Pap smear images. We investigate eight traditional machine learning methods to perform a hierarchical classification. We propose a hierarchical classification methodology for computer-aided screening of cell lesions, which can recommend fields of view from the microscopy image based on the nuclei detection of cervical cells. We evaluate the performance of several algorithms against the Herlev and CRIC databases, using a varying number of classes during image classification. Results indicate that the hierarchical classification performed best when using Random Forest as the key classifier, particularly when compared with decision trees, k-NN, and the Ridge methods.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2022

The information content of projected galaxy fields

ABSTRACT The power spectrum of the non-linearly evolved large-scale mass distribution recovers only a minority of the information available on the mass fluctuation amplitude. We investigate the recovery of this information in 2D ‘slabs’ of the mass distribution averaged over ≈100 h−1 Mpc along the line of sight, as might be obtained from photometric redshift surveys. We demonstrate a Hamiltonian Monte Carlo method to reconstruct the non-Gaussian mass distribution in slabs, under the assumption that the projected field is a point-transformed Gaussian random field, Poisson-sampled by galaxies. When applied to the Quijote N-body suite at z = 0.5 and at a transverse resolution of 2 h−1 Mpc, the method recovers ∼30 times more information than the 2D power spectrum in the well-sampled limit, recovering the Gaussian limit on information. At a more realistic galaxy sampling density of 0.01 h3 Mpc−3, shot noise reduces the information gain to a factor of 5 improvement over the power spectrum at resolutions of 4 h−1 Mpc or smaller.

79 ASTRONOMY AND ASTROPHYSICS↗