Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “technique”

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 865 records · Page 48
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Exploring quantum statistics for massive Dirac and Majorana neutrinos using spinor-helicity techniques

Recently, there has been interest in the applicability of quantum statistics to distinguish Dirac from Majorana neutrinos in multineutrino final states. In particular, debate has arisen over the validity of the Dirac-Majorana confusion theorem in these processes, i.e., that any distinction between the Dirac and Majorana processes goes to zero as the neutrino mass goes to zero. Here we approach this problem equipped with spinor-helicity methods generalized for massive Dirac and Majorana fermions. We explicitly calculate all helicity amplitudes, and their squares, for the decay of a light scalar particle to two neutrinos and two oppositely charged leptons. This allows us to pinpoint the crucial steps which could lead to claims of a violation of the confusion theorem. We show that, if the correct antisymmetrization of Dirac to Majorana amplitudes is used, identification of which is clear in this framework, and all relevant contributions are appropriately summed, a scalar decay into two charged leptons and two neutrinos satisfies the Dirac-Majorana confusion theorem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Photon calibration techniques for high resolution cryogenic detectors

Monoenergetic photons from a pulsed laser diode or LED are commonly used to calibrate the detector response of high-resolution calorimetric detectors. However, when the detector’s resolution is larger than the energy of a single photon, a calibration is normally derived using Poisson statistics. In this paper, we clarify the assumptions implicit in this calibration method, before considering how a more realistic model of a detector’s performance will violate these assumptions, biasing the calibration. Lastly, we judge the individual impact of specific detector parameters on our calibration, and conclude with discussion of both the limits of our calculations and the implications for state-of-the art detectors.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Optimization of the generator coordinate method with machine-learning techniques for nuclear spectra and neutrinoless double- β decay: Ridge regression for nuclei with axial deformation

The generator coordinate method (GCM) is an important tool of choice for modeling large-amplitude collective motion in atomic nuclei. The computational complexity of the GCM increases rapidly with the number of collective coordinates. It imposes a strong restriction on the applicability of the method. In this work, we propose a subspace-reduction algorithm that employs optimal statistical ML models as surrogates for exact quantum-number projection calculations for norm and Hamiltonian kernels. The model space of the original GCM is reduced to a subspace relevant for nuclear low energy spectra and the NME of ground state to ground state 0νββ decay based on the orthogonality condition (OC) and the energy-transition-orthogonality procedure (ENTROP), respectively. For simplicity, the polynomial ridge regression (RR) algorithm is used to learn the norm and Hamiltonian kernels of axially deformed configurations. The efficiency and accuracy of this algorithm are illustrated for 76 Ge and 76 Se by comparing results obtained using the optimal RR models to direct GCM calculations. The low-lying energy spectra of 76 Ge and 76 Se, as well as the 0νββ-decay NME between their ground states, are computed. Furthermore, the results show that the performance of the GCM+OC/ENTROP+RR is more robust than that of the GCM+RR alone, and the former can reproduce the results of the original GCM calculation accurately with a significantly reduced computational cost.

59 ≤ A ≤ 89↗
DOE OSTI2021

Postprocessing techniques for gradient percolation predictions on the square lattice

In this work, we revisit the classic problem of site percolation on a regular square lattice. In particular, we investigate the effect of quantization bias errors on percolation threshold predictions for large probability gradients and propose a mitigation strategy. We demonstrate through extensive computational experiments that the assumption of a linear relationship between probability gradient and percolation threshold used in previous investigations is invalid. Moreover, we demonstrate that, due to skewness in the distribution of occupation probabilities visited the average does not converge monotonically to the true percolation threshold. Furthermore, we identify several alternative metrics which do exhibit monotonic (albeit not linear) convergence and document their observed convergence rates.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Integrability technique for fluid flow induced deformation of a boundary hair

The deformation of a dense carpet of hair due to Stokes flow in a channel can be described by a nonlinear integrodifferential equation for the shape of a single hair, which possesses several solutions for a given choice of parameters. Although it was posed in a previous study and it bears a resemblance to the pendulum problem from mechanics, this equation has not been analytically solved until now. Despite the presence on an integral with a nonlinear functional dependence on the dependent variable, the system is integrable. We compare the analytically obtained solution to a finite-difference numerical approach, identify the physically realizable solution branch, and briefly study the solution structure through a conserved energylike quantity. Time-dependent fluid-structure interactions are a rich and complex subject to investigate, and we argue that the solution discussed herein can be used as a basis for understanding these systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Machine learning assisted unfolding for neutrino cross-section measurements with the OmniFold technique

The choice of unfolding method for a cross-section measurement is tightly coupled to the model dependence of the efficiency correction and the overall impact of cross-section modeling uncertainties in the analysis. A key issue is the dimensionality used in unfolding, as the kinematics of all outgoing particles in an event typically affect the reconstruction performance in a neutrino detector. OmniFold is an unfolding method that iteratively reweights a simulated dataset, using machine learning to utilize arbitrarily high-dimensional information, that has previously been applied to proton-proton and proton-electron datasets. This paper demonstrates OmniFold’s application to a neutrino cross-section measurement for the first time using a public T2K near detector simulated dataset, comparing its performance with traditional approaches using a mock data study.

Machine learning↗
DOE OSTI2025

Techniques for improved statistical convergence in quantification of eddy diffusivity moments

While recent approaches, such as the macroscopic forcing method (MFM) or Green's function-based approaches, can be used to compute Reynolds-averaged Navier-Stokes closure operators using forced direct numerical simulations, MFM can also be used to directly compute moments of the effective nonlocal and anisotropic eddy diffusivities. The low-order spatial and temporal moments contain limited information about the eddy diffusivity but are often sufficient for quantification and modeling of nonlocal and anisotropic effects. However, when using MFM to compute eddy diffusivity moments, the statistical convergence can be slow for higher-order moments. In this work, we demonstrate that using the same direct numerical simulation (DNS) for all forced MFM simulations improves statistical convergence of the eddy diffusivity moments. We present its implementation in conjunction with a decomposition method that handles the MFM forcing semianalytically and allows for consistent boundary condition treatment, which we develop for both scalar and momentum transport. We demonstrate that for a two-dimensional Rayleigh-Taylor instability case study, using the same DNS for all forced MFM simulations results in convergence with 𝒪⁡(100) simulations rather than 𝒪⁡(1000) simulations. In conclusion, we then demonstrate the impacts of improved convergence on the quantification of the eddy diffusivity.

general physics↗
DOE OSTI2020

Classifying and analyzing small-angle scattering data using weighted k nearest neighbors machine learning techniques

A consistent challenge for both new and expert practitioners of small-angle scattering (SAS) lies in determining how to analyze the data, given the limited information content of said data and the large number of models that can be employed. Machine learning (ML) methods are powerful tools for classifying data that have found diverse applications in many fields of science. Here, ML methods are applied to the problem of classifying SAS data for the most appropriate model to use for data analysis. The approach employed is built around the method of weighted k nearest neighbors (wKNN), and utilizes a subset of the models implemented in the SasView package (https://www.sasview.org/) for generating a well defined set of training and testing data. The prediction rate of the wKNN method implemented here using a subset of SasView models is reasonably good for many of the models, but has difficulty with others, notably those based on spherical structures. A novel expansion of the wKNN method was also developed, which uses Gaussian processes to produce local surrogate models for the classification, and this significantly improves the classification accuracy. Further, by integrating a stochastic gradient descent method during post-processing, it is possible to leverage the local surrogate model both to classify the SAS data with high accuracy and to predict the structural parameters that best describe the data. The linking of data classification and model fitting has the potential to facilitate the translation of measured data into results for both novice and expert practitioners of SAS.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A simple technique to classify diffraction data from dynamic proteins according to individual polymorphs

One often observes small but measurable differences in the diffraction data measured from different crystals of a single protein. These differences might reflect structural differences in the protein and may reveal the natural dynamism of the molecule in solution. Partitioning these mixed-state data into single-state clusters is a critical step that could extract information about the dynamic behavior of proteins from hundreds or thousands of single-crystal data sets. Mixed-state data can be obtained deliberately (through intentional perturbation) or inadvertently (while attempting to measure highly redundant single-crystal data). To the extent that different states adopt different molecular structures, one expects to observe differences in the crystals; each of the polystates will create a polymorph of the crystals. After mixed-state diffraction data have been measured, deliberately or inadvertently, the challenge is to sort the data into clusters that may represent relevant biological polystates. Here, this problem is addressed using a simple multi-factor clustering approach that classifies each data set using independent observables, thereby assigning each data set to the correct location in conformational space. This procedure is illustrated using two independent observables, unit-cell parameters and intensities, to cluster mixed-state data from chymotrypsinogen (ChTg) crystals. It is observed that the data populate an arc of the reaction trajectory as ChTg is converted into chymotrypsin.

36 MATERIALS SCIENCE↗
DOE OSTI2026

A Survey on the Expanding Scope and Interdisciplinary Opportunities for Processing-in-Memory Techniques

Processing-in-Memory (PIM) is emerging as a practical path to overcome the limitations of traditional von Neumann architectures. At its core, PIM systems implement computing primitives such as logic operations and multiply-accumulate acceleration through compute-in-memory, near-memory processing, or hybrid designs. The role of memory cells varies widely across technologies, acting as inputs, outputs, or analog accumulators through bit-lines and sense amplifiers. This diversity creates trade-offs in precision, bandwidth, latency, and programmability, making it difficult to build a unified understanding on the progress of the field. In this survey, we organize recent advances of PIM into three areas. First, we discuss the progress on the architectural optimizations of PIM and its integration with both DRAM and emerging non-volatile memories. Second, we examine how PIM is being used to accelerate key computing domains, including generative AI workloads and high-performance kernels, along with new approaches. Third, we highlight the growing adoption of PIM in computational sciences, where it is being applied to solve interdisciplinary problems such as genome analysis, mRNA quantification, mass spectrometry, quantum circuit simulation, wave modeling, and secure computation. Finally, we synthesize the major challenges that continue to slow PIM adoption, including manufacturing constraints, power delivery, thermal reliability, data consistency, runtime and memory-management coordination, and the difficulty of building portable software abstractions without sacrificing commercial viability. This work provides an updated, structured perspective on PIM’s potential across computing and computational sciences and the barriers that must be solved for it to reach its full impact.

Asifuzzaman, Kazi [Oak Ridge National Laboratory (↗