Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “least square approximations”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

A mixed, unified forward/inverse framework for earthquake problems: fault implementation and coseismic slip estimate

SUMMARY We introduce a new finite-element (FE) based computational framework to solve forward and inverse elastic deformation problems for earthquake faulting via the adjoint method. Based on two advanced computational libraries, FEniCS and hIPPYlib for the forward and inverse problems, respectively, this framework is flexible, transparent and easily extensible. We represent a fault discontinuity through a mixed FE elasticity formulation, which approximates the stress with higher order accuracy and exposes the prescribed slip explicitly in the variational form without using conventional split node and decomposition discrete approaches. This also allows the first order optimality condition, that is the vanishing of the gradient, to be expressed in continuous form, which leads to consistent discretizations of all field variables, including the slip. We show comparisons with the standard, pure displacement formulation and a model containing an in-plane mode II crack, whose slip is prescribed via the split node technique. We demonstrate the potential of this new computational framework by performing a linear coseismic slip inversion through adjoint-based optimization methods, without requiring computation of elastic Green’s functions. Specifically, we consider a penalized least squares formulation, which in a Bayesian setting—under the assumption of Gaussian noise and prior—reflects the negative log of the posterior distribution. The comparison of the inversion results with a standard, linear inverse theory approach based on Okada’s solutions shows analogous results. Preliminary uncertainties are estimated via eigenvalue analysis of the Hessian of the penalized least squares objective function. Our implementation is fully open-source and Jupyter notebooks to reproduce our results are provided. The extension to a fully Bayesian framework for detailed uncertainty quantification and non-linear inversions, including for heterogeneous media earthquake problems, will be analysed in a forthcoming paper.

58 GEOSCIENCES↗
DOE OSTI2021

An accurate, non-empirical method for incorporating decoherence into Ehrenfest dynamics

In mixed quantum-classical nonadiabatic molecular dynamics methods, the anchoring of the electronic wave function to a single nuclear geometry results in both quantitative and qualitative errors in the dynamics. In the context of both Ehrenfest and trajectory surface hopping methods, methods for incorporating decoherence are widely used to eliminate these errors. However, the accuracy of these methods often depends strongly on the parameterization of the decoherence time and/or other related quantities. Here, we present a refinement of the recently introduced collapse to a block (TAB) scheme for incorporating decoherence into Ehrenfest dynamics. The proposed approach incorporates an approximation to the history of the population dynamics and treats the coherence decay as Gaussian, rather than exponential. This method uses parameters that can be obtained from first principles, rather than empirical fitting. Application to one-dimensional models indicates excellent agreement with numerically exact simulations. We also introduce a second refinement to the TAB method: a robust linear least-squares algorithm for determining collapse probabilities.

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

An analysis of the spatio-temporal resolution of the immersed boundary method with direct forcing

The immersed boundary method (IBM) with direct forcing is very popular in the simulation of rigid particulate flows. In the IBM, an interaction force is introduced at the interface between fluid and particle in order to approximate the no-slip boundary condition. The interaction force is calculated through dividing the velocity difference (or error) between fluid and particle at the interface by the time step. Here, a dynamic equation for the velocity difference is derived. Additionally, analyses on the dynamic equation provide a few new findings: (i) The interaction force is the solution of a least-squares error problem, with the direct implication that the Lagrangian marker distribution has no effect on the large scale flow structure once the distribution of Lagrangian markers become saturated along the interface (i.e., each marker remains properly correlated with all its neighbors); (ii) The Lagrangian volume-weight is a relaxation factor to control how fast the velocity error decays to the ideal value of zero; (iii) The optimal choice of the Lagrangian volume-weight is the largest value permissible by a stability condition. A comprehensive convergence analysis with regard to the spatial and temporal resolution is presented for the velocity error and also for the shear-stress and surface pressure. In three simple canonical problems, it is analytically and numerically shown that the IBM results converge to the theoretical solutions obtained with precise imposition of no-slip and no-penetration boundary conditions. It is observed that it is not necessary to match the Lagrangian marker volume-weight to that of the local Eulerian cell volume and in fact this matching leads to lower than optimal computational efficiency. However, it is found that extremely high Eulerian grid resolution and small time step have to be used to obtain high precision simulation results. Especially, the time step should be inversely proportional to the particle Reynolds number for low Reynolds number flows. For high frequency oscillation problems, the grid size needs to be reduced by a factor of the square root of the frequency, and the time step to be reduced by a factor of the frequency. The theoretical findings here can be used to alleviate the technical difficulties in simulating non-spherical particles by not requiring the Lagrangian marker distribution to match the Eulerian grids and also in the implementation of IBM on non-uniform Eulerian grids. The present work also provides simple practical guidance on the choice of temporal and spatial resolution so as to control the simulation error a priori.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Robust Tensor Hypercontraction of the Particle–Particle Ladder Term in Equation-of-Motion Coupled Cluster Theory

One method of representing a high-rank tensor as a (hyper-)product of lower-rank tensors is the tensor hypercontraction (THC) method of Hohenstein et al. This strategy has been found to be useful for reducing the polynomial scaling of coupled-cluster methods by representation of a four-dimensional tensor of electron-repulsion integrals in terms of five two-dimensional matrices. Pierce et al. have already shown that the application of a robust form of THC to the particle–particle ladder (PPL) term reduces the cost of this term in couple-cluster singles and doubles (CCSD) from O(N 6 ) to O(N 5 ) with negligible errors in energy with respect to the density-fitted variant. In this work, we have implemented the least-squares variant of THC (LS-THC) which does not require a nonlinear tensor factorization, including the robust form (R-LS-THC), for the calculation of the excitation and electron attachment energies using equation-of-motion coupled cluster methods EOMEE-CCSD and EOMEA-CCSD, respectively. We have benchmarked the effect of the R-LS-THC-PPL approximation on excitation energies using the comprehensive QUEST database and the accuracy of electron attachment energies using the NAB22 database. Here, we find that errors on the order of 1 meV are achievable with a reduction in total calculation time of approximately 5x.

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

Elastic constants in monocrystalline tungsten under quasi-hydrostatic pressures to 11.3 GPa

Compressional (P) and shear (S) wave velocities of tungsten single crystals along the [100] and [110] directions were measured using ultrasonic interferometry at room temperature up to 11.3 GPa. Least-squares fitting of $V$$^{[100]}_{P}$, $V$$^{[100]}_{S}$, $V$$^{[110]}_{P}$, and pressure to finite strain (FS) equations yields the elastic constants: C 11 = 523.5(5) GPa, C 12 = 205.1(32) GPa, and C 44 = 160.8(4) GPa, along with their respective pressure derivatives: $C$$^{′}_{11}$ = 6.20(2), $C$$^{′}_{12}$ = 3.35(1), and $C$$^{′}_{44}$ = 1.65(6). Using the Voigt–Reuss–Hill approximation, the elastic moduli were derived as K S0 = 311.2(22) GPa and G 0 = 160.2(7)GPa, along with their respective pressure derivatives: $K$$^{′}_{S0}$ = 4.30(4) and $G$$^{′}_{0}$ = 1.56(1). The Debye temperature of tungsten was determined to be 380.7(8) K, showing good agreement with previous calorimetric measurements. The elastic anisotropy increases slightly from 1.01(1) at ambient pressure to 1.03(1) at 11.3 GPa, suggesting that tungsten remains nearly isotropic under compression. Poisson's ratio slightly increased from 0.281(3) to 0.288(3) with pressure. Additionally, Pugh's ratio decreased from 0.512(4) to 0.494(4), while Pettifor's ratio increased from 0.148(10) to 0.175(10) as pressure reached 11.3 GPa. These results suggest that tungsten is weakly ductile compared to the critical thresholds for ductile behavior (i.e., Pugh's ratio <0.6 and Pettifor's ratio >0, indicating ductile behavior), but that its ductility increases marginally under pressure.

Wang, Ran [Stony Brook University, NY (United Stat↗
DOE OSTI2022

High-throughput characterization, correlation, and mapping of leaf photosynthetic and functional traits in the soybean ( Glycine max ) nested association mapping population

We report photosynthesis is a key target to improve crop production in many species including soybean [Glycine max (L.) Merr.]. A challenge is that phenotyping photosynthetic traits by traditional approaches is slow and destructive. There is proof-of-concept for leaf hyperspectral reflectance as a rapid method to model photosynthetic traits. However, the crucial step of demonstrating that hyperspectral approaches can be used to advance understanding of the genetic architecture of photosynthetic traits is untested. To address this challenge, we used full-range (500–2,400 nm) leaf reflectance spectroscopy to build partial least squares regression models to estimate leaf traits, including the rate-limiting processes of photosynthesis, maximum Rubisco carboxylation rate, and maximum electron transport. In total, 11 models were produced from a diverse population of soybean sampled over multiple field seasons to estimate photosynthetic parameters, chlorophyll content, leaf carbon and leaf nitrogen percentage, and specific leaf area (with R 2 from 0.56 to 0.96 and root mean square error approximately <10% of the range of calibration data). We explore the utility of these models by applying them to the soybean nested association mapping population, which showed variability in photosynthetic and leaf traits. Genetic mapping provided insights into the underlying genetic architecture of photosynthetic traits and potential improvement in soybean. Notably, the maximum Rubisco carboxylation rate mapped to a region of chromosome 19 containing genes encoding multiple small subunits of Rubisco. We also mapped the maximum electron transport rate to a region of chromosome 10 containing a fructose 1,6-bisphosphatase gene, encoding an important enzyme in the regeneration of ribulose 1,5-bisphosphate and the sucrose biosynthetic pathway. The estimated rate-limiting steps of photosynthesis were low or negatively correlated with yield suggesting that these traits are not influenced by the same genetic mechanisms and are not limiting yield in the soybean NAM population. Leaf carbon percentage, leaf nitrogen percentage, and specific leaf area showed strong correlations with yield and may be of interest in breeding programs as a proxy for yield. This work is among the first to use hyperspectral reflectance to model and map the genetic architecture of the rate-limiting steps of photosynthesis.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Ion energy distribution in an electron beam ion trap inferred from simulations of the trapped ion cloud

For this work, we have inferred the energy distribution of trapped ions in an electron beam ion trap (EBIT) from simulations of the spatial distribution of Fe 13+ ions and a comparison with measured visible light images of the ion cloud. We simulated the cloud of Fe 13+ ions by computing ion trajectories in the EBIT for different ion energy distributions used to initialize the trajectories. We then performed a least-squares fit to infer the ion energy distribution that best reproduced the measured ion cloud. These best-fit distributions were typically non-Maxwellian. For electron beam energies of 395–475 eV and electron beam currents of 1–9 mA, we find that the average ion energy is in the range of 10–300 eV. We also find that the average ion energy increases with increasing beam current approximately as $\langle$E$\rangle$ ≈ 25 I e eV, where I e is the electron beam current in mA. We have also compared our results to Maxwell-Boltzmann-distribution ion clouds. We find that our best-fit non-thermal distributions have an $\langle$E$\rangle$ that is less than half that of the T from the best-fit Maxwell-Boltzmann distributions ($\langle$E$\rangle$/q)/T=0.41 ± 0.05.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2023

CP decomposition for tensors via alternating least squares with QR decomposition

The CP tensor decomposition is used in applications such as machine learning and signal processing to discover latent low-rank structure in multidimensional data. Computing a CP decomposition via an alternating least squares (ALS) method reduces the problem to several linear least squares problems. The standard way to solve these linear least squares subproblems is to use the normal equations, which inherit special tensor structure that can be exploited for computational efficiency. However, the normal equations are sensitive to numerical ill-conditioning, which can compromise the results of the decomposition. In this paper, we develop versions of the CP-ALS algorithm using the QR decomposition and the singular value decomposition, which are more numerically stable than the normal equations, to solve the linear least squares problems. Our algorithms utilize the tensor structure of the CP-ALS subproblems efficiently, have the same complexity as the standard CP-ALS algorithm when the input is dense and the rank is small, and are shown via examples to produce more stable results when ill-conditioning is present. Our MATLAB implementation achieves the same running time as the standard algorithm for small ranks, and we show that the new methods can obtain lower approximation error.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Algorithms in Diffraction Profile Analysis

This chapter introduces several approaches to crystallographic structure refinement from diffraction profile data including the Rietveld method, global optimization methods, and Bayesian modeling. First, the Rietveld method and related nonlinear least squares approaches to analyzing diffraction profiles are briefly discussed. We then review the most common algorithms within global optimization as alternative methods of structure solution: grid search, simulated annealing, and genetic algorithms. As the Rietveld method is the standard tool for analyzing diffraction profile data, we catalogue its challenges and limitations. A Bayesian approach to diffraction profile analysis is presented as an alternative, along with several sampling algorithms including Gibbs sampling, variants of Metropolis sampling, Hamiltonian Monte Carlo, and approximate Bayesian computing. These sampling algorithms are applied to the fitting of a neutron diffraction profile from a National Institute of Standards and Technology silicon standard reference material, and their results are compared.

Singh, Susheela↗
DOE OSTI2023

Probabilistic partition of unity networks for high–dimensional regression problems

We explore the probabilistic partition of unity network (PPOU-Net) model in the context of high-dimensional regression problems and propose a general framework focusing on adaptive dimensionality reduction. With the proposed framework, the target function is approximated by a mixture of experts model on a low-dimensional manifold, where each cluster is associated with a fixed-degree polynomial. We present a training strategy that leverages the expectation maximization (EM) algorithm. During the training, we alternate between (i) applying gradient descent to update the DNN coefficients; and (ii) using closed-form formulae derived from the EM algorithm to update the mixture of experts model parameters. Under the probabilistic formulation, step (ii) admits the form of embarrassingly paralleliazable weighted least-squares solves. The PPOU-Nets consistently outperform the baseline fully-connected neural networks of comparable sizes in numerical experiments of various data dimensions. Here, we also explore the proposed model in applications of quantum computing, where the PPOU-Nets act as surrogate models for cost landscapes associated with variational quantum circuits.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Validation and Verification of Python based Neutron Spectrum Unfolding Software

To validate and verify the python-based code (PySL), designed to replicate the programs used by STAYSL for Beam Correction Factor (BCF) and Self-Shielding Factor (SHIELD), a series of tests were performed. To test BCF a python script was written to generate a random flux history file and both versions of the code processed the data. The test verified matching values up to at least one decimal place, approximately 10,000 tests where run and each one passed. Isotopes began to fail the tests once neutron saturation was reached. To verify this the total time of exposure was varied the isotopes that failed were compared to a list of their half-lives. The test process for SHIELD was very similar but, in this case, the code began by producing an input file with varying thickness and device type/environment for the SHIELD input. The failure condition for this test was if any of the data points for an isotope had a difference above 3%. Approximately 40 of these tests were run and there were only 3 isotopes that had reoccurring failures but only 2% of their points were above the 3% difference. A visual comparison was conducted by plotting the results from both programs. Although the test failed, the differences between their values were minuscule, and the self-shielding factor’s shape was preserved when plotted. Next steps for this project will be validating and verifying the python-based SigPhi code and then reproducing and testing the least squares unfolding performed by STAYSL.

73 - NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Network-Wide Traffic Signal Control Using Bilinear System Modeling and Adaptive Optimization

This study proposes a new multi-input multi-output optimal bilinear signal control method in which a bilinear dynamic model approximation is used to capture the nonlinear dynamics of the urban traffic networks. With signal green time splits as the control input and traffic delay changes as the output for each intersections in the network, a bilinear system model was developed, which, on the basis of linear system modeling, takes interactions among traffic delays and signal timing splits into consideration. Based on the bilinear system modeling framework, we conducted two steps in each time interval to derive traffic control strategies: (1) we used the normalized least-squared algorithm to estimate system parameters; and (2) we solved an online optimization problem to obtain the updated traffic control inputs for the signal timing that minimizes future traffic delays. We evaluated the proposed method in a microscopic traffic simulation environment (VISSIM) with a 35-intersection network of Bellevue city in Washington. Two different traffic demand patterns: (1) normal traffic demands; and (2) time-varying traffic demands were simulated to compare the performance of different control strategies. Experimental results show that (1) the proposed bilinear system model can better describe traffic system dynamics than linear-model based methods, such as our previously developed linear-quadratic regulator control; and (2) the proposed method outperforms the state-of-the-art signal control strategies, namely the max-pressure and the self-organizing traffic light control methods. We have also shown that the proposed method is applicable to all other possible network layouts and signal controller phasing structures.

42 ENGINEERING↗
DOE OSTI2024

A quasi-meshfree method for constructing boundary-aware reproducing bases on geometrically complex domains using manifold geodesics

In many applications, physical domains are geometrically complex making it challenging to perform coarse-scale approximation. A defeaturing process is often used to simplify the domain in preparation for approximation and analysis at the coarse scale. In this paper, a methodology is presented for constructing a coarse-scale reproducing basis on geometrically complex domains given an initial fine-scale mesh of the fully featured domain. The initial fine-scale mesh can be of poor quality and extremely refined. The construction of the basis functions begins with a coarse-scale covering of the domain and generation of weighting functions with local support. Manifold geodesics are used to define distances within the local support for general applicability to non-convex domains. Conventional moving least squares is used to construct the coarse-scale reproducing basis. Applications in quasi-interpolation and linear elasticity are presented.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Deterministic and Monte Carlo Nuclear Data Adjustment Methods [Slides]

For the Bayesian Monte Carlo methodology, a need to understand convergence of the posterior moments as a function of the number of parameter realizations is required. In high-dimensional systems, it can be very costly to sample entire parameter space and perform functional evaluation for every realization. Bayesian Monte Carlo allows one to relax the GLLS approximations of model linearity and prior/posterior PDF shape. The Bayesian Stochastic Collocation Method is a deterministic approach to “sample” the parameter space. It allows one to relax the GLLS approximations of model linearity and posterior PDF shape. Higher-order posterior moments (i.e., skewness, kurtosis, etc.) can be studied through polynomial expansion. Tensor product quadrature scales poorly and can use sparse grid quadrature methods.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Optimized Auxiliary Functions for Robust Mitigation of Finite-Size Errors in Periodic Hybrid Density Functional Theory

When calculating properties of periodic systems at the thermodynamic limit (TDL), the dominant source of finite size error (FSE) arises from the long-range Coulomb interaction, and can manifest as a slowly converging quadrature error when approximating an integral in the reciprocal space by a finite sum. The singularity subtraction (SS) method offers a systematic approach for reducing this quadrature error and thus the FSE. Here, in this work, we first investigate the performance of the SS method in the simplest setting, aiming at reducing the FSE in exact exchange calculations by subtracting the Coulomb contribution with a single, adjustable Gaussian auxiliary function. We demonstrate that a simple fitting method can robustly estimate the optimal Gaussian width and leads to rapid convergence toward the TDL. Furthermore, we suggest new forms of the auxiliary function, whose optimal parameters could also be determined through least-squares fitting. For a range of semiconductors and insulators, the proposed auxiliary functions achieve robust, millihartree-level accuracy in hybrid density functional theory calculations, including cases with sparse k-meshes and large basis sets.

Quiton, Stephen Jon [University of California, Ber↗
DOE OSTI2022

Deep learning to estimate permeability using geophysical data

Time-lapse electrical resistivity tomography (ERT) is a popular geophysical method to estimate three-dimensional (3D) permeability fields from electrical potential difference measurements. Traditional inversion and data assimilation methods are used to ingest this ERT data into hydrogeophysical models to estimate permeability. Due to ill-posedness and the curse of dimensionality, existing inversion strategies provide poor estimates and low resolution of the 3D permeability field. Recent advances in deep learning provide us with powerful algorithms to overcome this challenge. This paper presents a deep learning (DL) framework to estimate the 3D subsurface permeability from time-lapse ERT data. To test the feasibility of the proposed framework, we train DL-enabled inverse models on simulation data. Each measurement in both synthetic and field data is standardized by removing the mean and scaling the time-series to unit variance. This pre-processing step is necessary to bring simulation data closer to field observations. Subsurface process models based on hydrogeophysics are used to generate this synthetic data. Training performed on limited simulation data resulted in the DL model over-fitting. An advanced data augmentation based on mixup is implemented to generate additional training samples to overcome this issue. This mixup technique creates weakly labeled (low-fidelity) samples from strongly labeled (high-fidelity) data. The weakly labeled training data is then used to develop DL-enabled inverse models and reduce over-fitting. As both time-lapse ERT (1133048 features/realization) and 3D permeability (585453 features/realization) data samples are from a high-dimensional space, principal component analysis (PCA) is employed to reduce dimensionality. Encoded ERT and encoded permeability are generated using the trained PCA estimators. A deep neural network is then trained to map the encoded ERT to encoded permeability. This mixup training and unsupervised learning allowed us to build a fast and reasonably accurate DL-based inverse model under limited simulation data. Results show that proposed weak supervised learning can capture salient spatial features in the 3D permeability field. Quantitatively, the average mean squared error (in terms of the natural log) on the strongly labeled training, validation, and test datasets is less than 0.5. The R 2 -score (global metric) is greater than 0.75, and the percent error in each cell (local metric) is less than 10%. Finally, an added benefit in terms of computational cost is that the proposed DL-based inverse model is at least O(10 4 ) times faster than running a forward model once it is trained. Data generation, DL model training, and hyperparameter tuning to identify optimal neural network architectures utilized high-performance computing resources while the DL inference is performed on a standard laptop. Approximately, O(10 5 ) processor hours are used for generating data and DL tuning and training. We acknowledge that the data generation and DL model development are expensive. But once a DL model is trained, it can be re-used for inversion rapidly for the given system, with set physics and domain. Note that traditional inversion may require multiple forward model simulations (e.g., in the order of 10 to 1000), which are very expensive. This computational savings ≈ O(10 5 ) – O(10 7 )) makes the proposed DL-based inverse model attractive for subsurface imaging and real-time ERT monitoring applications due to fast and yet reasonably accurate estimations of permeability field.

58 GEOSCIENCES↗
DOE OSTI2025

Neutron Identification Capabilities in MicroBooNE Through the Application of Machine Learning with Blips

Neutrinos (ν) are subatomic particles first observed in 1956 by LANL physicists Clyde Cowan and Frederick Reines but first theorized by Wolfgang Pauli in 1930. Neutrinos are the least massive known particle and are classified as leptons with 3 flavors corresponding to their leptonic counterparts (electron, muon, and tau). We know that they are abundant, 65 billion neutrinos travel through your fingertip every second, and elusive, a single neutrino could fly through a lightyear of lead without interacting at all. Though, there is much still unknown and a better characterization of these “ghostly” particles can give us clues as to the matter/anti-matter asymmetry in the early universe and possible glimpses into new physics. To measure a particle that is extremely light and rarely interacting, physicists have developed an extremely sensitive detector known as a Liquid Argon Time Projection Chamber (LArTPC). The fiducial volume (or TPC) is bombarded with neutrinos, some of which interact with argon (Ar) atoms to produce particles that in turn excite and ionize the Ar. The products of these are free electrons which then drift through the TPC’s applied magnetic field towards a multi-plane wire readout system. The electrons’ charge is collected at this anode and the light from the initial interactions is collected by photomultiplier tubes (PMTs). In conjunction, these mechanisms allow LArTPCs to achieve millimeter spatial resolution and sub-MeV energy thresholds. The detector of interest in this study is the MicroBooNE Experiment at Fermilab. MicroBooNE is an above ground LArTPC with dimensions of approximately 10m × 2.5m × 2.3m, about the size of a school bus. Its purpose is to study neutrinos, so to improve rates of measured ν interactions, the detector is squarely in the path of the Booster Neutrino Beam (BNB) at Fermilab. A major challenge in neutrino studies is energy reconstruction, much of the neutrino’s original energy is lost in interactions that the detector is not sensitive to, often due to low-energy products. The initial goal of this analysis was to better identify neutrons, the main source of poor energy reconstruction in neutrino events. Because neutrons are neutral particles, like neutrinos, we can only directly measure the products of their interactions in LArTPCs. Most of these products are low-energy signals and while each one contributes a negligible amount of energy, collectively these signals make up most of the lost energy in each neutrino event. We define these signals as blips; point-like, isolated depositions of charge in the detector. Blips have MeV-scale energies and are the size of a single hit (charge deposition) or a cluster of a few hits on at least two wire planes. Blips are the principal detector features used to study low-energy physics; thus, they are the key to unlocking information not only about neutrons but gamma photons, supernova and solar neutrinos as well as helping us better identify certain particles. Therefore, this analysis strives to use blips for improved neutron identification (ID) and characterization.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Retrospective Analysis of Backwater Habitat Availability Using Remote Sensing

Low-velocity channel-margin habitats serve as important nursery habitats for the endangered Colorado pikeminnow (Ptychocheilus lucius) in the middle Green River between Jensen and Ouray, Utah. These habitats, known as backwaters, are associated with emergent sandbars, and are shaped and reformed annually by peak flows. Our recent knowledge about backwater characteristics and dynamics that is summarized in the synthesis report (Grippo et al. 2015) was based on detailed annual survey data from a relatively small sample of backwaters that were collected from 2003 to 2014 and reach-wide evaluations of backwater surface area based on manual interpretation of aerial and satellite imagery. Methods that bridge the gap between the detailed surveys from a small number of backwaters and the reach-wide assessment of their surface area would enable an assessment of the availability of backwater habitats that meet the minimum depth requirements for suitable habitat for Colorado pikeminnow. In 2015 Argonne National Laboratory (Argonne) tested three regression models—linear, multiple, and partial least square (PLS) regression models—for estimating backwater depth using National Agriculture Imagery Program (NAIP) imagery collected in July 2006 that covered the Jensen-Ouray reach of the Green River (Hamada and LaGory 2016). The results suggested that a PLS regression model showed high correlation with the reference depth (R 2 = 0.69) and had the most unbiased and consistent estimate of backwater depth. The results also indicated that the PLS model would provide reasonable estimates of the amount of habitat providing a minimum suitable depth of 30 cm for young-of-the-year Colorado pikeminnow, even though absolute depth estimates may be uncertain for backwater areas deeper than approximately 40 cm. The study also provided insights regarding the amount and the selection of calibration and validation (cal-val) data needed for improving the accuracy of depth prediction.

54 ENVIRONMENTAL SCIENCES↗