Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 1,441 records · Page 80

Efficiency and accuracy of the perturbation response coefficient generation method for whole core comet calculations in BWR and CANDU configurations

The coarse mesh transport method (COMET) is a highly accurate and efficient computational tool which predicts whole-core neutronics behaviors for heterogeneous reactor cores via a pre-computed eigenvalue-dependent response coefficient (function) library. Recently, a high order perturbation method was developed to significantly improve the efficiency of the library generation method. In that work, the method's accuracy and efficiency was tested in a small PWR benchmark problem. This paper extends the application of the perturbation method to include problems typical of the other water reactor cores such as BWR and CANDU bundles. It is found that the response coefficients predicted by the perturbation method for typical BWR bundles agree very well with those directly computed by the Monte Carlo method. The average and maximum relative errors in the surface-to-surface response coefficients are 0.02%-0.05% and 0.06%-0.25%, respectively. For CANDU bundles, the corresponding quantities are 0.01%-0.05% and 0.04% -0.15%. It is concluded that the perturbation method is highly accurate and efficient with a wide range of applicability. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Comparison of two Galerkin quadrature methods

We compare two methods for generating Galerkin quadrature for problems with highly forward-peaked scattering. In Method 1, the standard Sn method is used to generate the moment-to-discrete matrix and the discrete-to-moment is generated by inverting the moment-to-discrete matrix. In Method 2, which we introduce here, the standard Sn method is used to generate the discrete-to-moment matrix and the moment-to-discrete matrix is generated by inverting the discrete-to-moment matrix. Method 1 has the advantage that it preserves both N eigenvalues and N eigenvectors (in a pointwise sense) of the scattering operator with an N-point quadrature. Method 2 has the advantage that it generates consistent angular moment equations from the corresponding S{sub N} equations while preserving N eigenvalues of the scattering operator with an N-point quadrature. Our computational results indicate that these two methods are quite comparable for the test problem considered. (authors)

97 MATHEMATICS AND COMPUTING↗

Limiting Surface Density Method Application to Large Arrays of Highly Heterogeneous Shipping Packages

This work represents the initial phase of an overall effort to reduce the analytical burdens and increase flexibility of the K-Area Complex which provides stewardship of special nuclear materials. A hand calculation method is being extended to apply to large arrays of highly heterogeneous shipping packages. This method has the potential to quickly determine the impact of perturbations on the array. The objective of the particular work reported herein is twofold. First, the analytical results upon which the Limiting Surface Density (LSD) method was originally based were reproduced using the modern computational code KENO-VI in SCALE 6.1. The second objective was to test the classic LSD method on storage of large arrays of highly heterogeneous shipping packages. Specifically, the objective is to determine if the method is adequate for existing arrays of 9975 shipping packages with fissile metal content. The classic LSD method was derived for simple packages of bare spheres of fissile material centered in an air filled cubic unit cell and placed in a cubic-pitch water-reflected array, the properties of which could then be translated to more practical array and package geometries. The classic method did not address highly heterogeneous packages which are close to neutronically decoupled from other identical packages. Therefore, the material based array constant (called c{sub 2}) as defined by the classic method is determined specifically for the packages in question. (authors)

42 ENGINEERING↗

Space-Dependent Wielandt Shift Methods for Multigroup Diffusion Eigenvalue Problems

In the calculation of neutronic eigenfunctions and eigenvalues, it is often desirable to approximate the neutron transport equation by a diffusion equation that requires significantly less computational resources to solve. Even when a full transport solution is needed, the solution of the diffusion system can be used to accelerate iterative methods for calculating the transport eigenfunction and eigenvalue. The convergence rate of the basic power iteration method for eigenvalue problems is governed by the dominance ratio; realistic reactor core problems often have high dominance ratios and the power iteration method can converge slowly as a result. A common technique for accelerating the convergence of power iteration is the Wielandt shift (WS) method, which reduces the dominance ratio by 'shifting' the eigenvalue spectrum using an estimate of the desired eigenvalue. WS provides a significant speedup over power iteration if the eigenvalue estimate is close to the true eigenvalue, but it can be difficult to obtain such an estimate. In practice, the shift in the WS method can be dynamically updated in the iteration scheme, in a way that depends on the eigenvalue estimates from the most recent iterations. We present a physically-motivated Space-Dependent Wielandt Shift (SDWS) for solving multigroup diffusion eigenvalue problems. The space-dependence of the eigenvalue shift in SDWS enables a more effective acceleration of the power iteration scheme than WS at the beginning of the iteration scheme, when the current estimate of the eigenvalue is not close to the actual eigenvalue. Several variants of SDWS are discussed here, including an SDWS method that combines the strengths of SDWS (in the early iterations) with those of standard WS (in the later iterations). Numerical results from a 1-D multigroup diffusion problem demonstrate an order of magnitude speedup over power iteration and a 41% speedup over a standard WS technique. This speedup is problem-dependent and appears to be greater for 'more difficult' problems. In this summary, the term 'speedup' refers to a reduction in the number of iterations required to converge to the correct eigenvalue and eigenfunction. Because the scattering is treated fully implicitly (i.e., it is part of the left-hand side of the diffusion system and directly inverted), the computational cost of a single iteration does not vary significantly among the methods discussed in this summary. The number of iterations is therefore representative of the total computational cost for a method. We acknowledge that certain iterative solvers for linear systems (e.g., GMRES) require more computational time to converge when the system is nearly singular (i.e., when a very aggressive Wielandt shift is applied). Nonetheless, when using SDWS in the manner described in this summary, we have seen that the reduction in computational time from reducing the number of power iterations generally outweighs the extra computational time required by iterative solvers such as GMRES. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Accelerated molecular dynamics methods: introduction and recent developments

A long-standing limitation in the use of molecular dynamics (MD) simulation is that it can only be applied directly to processes that take place on very short timescales: nanoseconds if empirical potentials are employed, or picoseconds if we rely on electronic structure methods. Many processes of interest in chemistry, biochemistry, and materials science require study over microseconds and beyond, due either to the natural timescale for the evolution or to the duration of the experiment of interest. Ignoring the case of liquids xxx, the dynamics on these time scales is typically characterized by infrequent-event transitions, from state to state, usually involving an energy barrier. There is a long and venerable tradition in chemistry of using transition state theory (TST) [10, 19, 23] to directly compute rate constants for these kinds of activated processes. If needed dynamical corrections to the TST rate, and even quantum corrections, can be computed to achieve an accuracy suitable for the problem at hand. These rate constants then allow them to understand the system behavior on longer time scales than we can directly reach with MD. For complex systems with many reaction paths, the TST rates can be fed into a stochastic simulation procedure such as kinetic Monte Carlo xxx, and a direct simulation of the advance of the system through its possible states can be obtained in a probabilistically exact way. A problem that has become more evident in recent years, however, is that for many systems of interest there is a complexity that makes it difficult, if not impossible, to determine all the relevant reaction paths to which TST should be applied. This is a serious issue, as omitted transition pathways can have uncontrollable consequences on the simulated long-time kinetics. Over the last decade or so, we have been developing a new class of methods for treating the long-time dynamics in these complex, infrequent-event systems. Rather than trying to guess in advance what reaction pathways may be important, we return instead to a molecular dynamics treatment, in which the trajectory itself finds an appropriate way to escape from each state of the system. Since a direct integration of the trajectory would be limited to nanoseconds, while we are seeking to follow the system for much longer times, we modify the dynamics in some way to cause the first escape to happen much more quickly, thereby accelerating the dynamics. The key is to design the modified dynamics in a way that does as little damage as possible to the probability for escaping along a given pathway - i.e., we try to preserve the relative rate constants for the different possible escape paths out of the state. We can then use this modified dynamics to follow the system from state to state, reaching much longer times than we could reach with direct MD. The dynamics within any one state may no longer be meaningful, but the state-to-state dynamics, in the best case, as we discuss in the paper, can be exact. We have developed three methods in this accelerated molecular dynamics (AMD) class, in each case appealing to TST, either implicitly or explicitly, to design the modified dynamics. Each of these methods has its own advantages, and we and others have applied these methods to a wide range of problems. The purpose of this article is to give the reader a brief introduction to how these methods work, and discuss some of the recent developments that have been made to improve their power and applicability. Note that this brief review does not claim to be exhaustive: various other methods aiming at similar goals have been proposed in the literature. For the sake of brevity, our focus will exclusively be on the methods developed by the group.

74 ATOMIC AND MOLECULAR PHYSICS↗

Intercomparison of methods of coupling between convection and large-scale circulation. 1. Comparison over uniform surface conditions

Here, as part of an international intercomparison project, a set of single-column models (SCMs) and cloud-resolving models (CRMs) are run under the weak-temperature gradient (WTG) method and the damped gravity wave (DGW) method. For each model, the implementation of the WTG or DGW method involves a simulated column which is coupled to a reference state defined with profiles obtained from the same model in radiative-convective equilibrium. The simulated column has the same surface conditions as the reference state and is initialized with profiles from the reference state. We performed systematic comparison of the behavior of different models under a consistent implementation of the WTG method and the DGW method and systematic comparison of the WTG and DGW methods in models with different physics and numerics. CRMs and SCMs produce a variety of behaviors under both WTG and DGW methods. Some of the models reproduce the reference state while others sustain a large-scale circulation which results in either substantially lower or higher precipitation compared to the value of the reference state. CRMs show a fairly linear relationship between precipitation and circulation strength. SCMs display a wider range of behaviors than CRMs. Some SCMs under the WTG method produce zero precipitation. Within an individual SCM, a DGW simulation and a corresponding WTG simulation can produce different signed circulation. When initialized with a dry troposphere, DGW simulations always result in a precipitating equilibrium state. The greatest sensitivities to the initial moisture conditions occur for multiple stable equilibria in some WTG simulations, corresponding to either a dry equilibrium state when initialized as dry or a precipitating equilibrium state when initialized as moist. Multiple equilibria are seen in more WTG simulations for higher SST. In some models, the existence of multiple equilibria is sensitive to some parameters in the WTG calculations.

54 ENVIRONMENTAL SCIENCES↗

A parallel p ‐adaptive discontinuous Galerkin method for the Euler equations with dynamic load‐balancing on tetrahedral grids

Abstract A novel p ‐adaptive discontinuous Galerkin (DG) method has been developed to solve the Euler equations on three‐dimensional tetrahedral grids. Hierarchical orthogonal basis functions are adopted for the DG spatial discretization while a third order TVD Runge‐Kutta method is used for the time integration. A vertex‐based limiter is applied to the numerical solution in order to eliminate oscillations in the high order method. An error indicator constructed from the solution of order and is used to adapt degrees of freedom in each computational element, which remarkably reduces the computational cost while still maintaining an accurate solution. The developed method is implemented with under the Charm++ parallel computing framework. Charm++ is a parallel computing framework that includes various load‐balancing strategies. Implementing the numerical solver under Charm++ system provides us with access to a suite of dynamic load balancing strategies. This can be efficiently used to alleviate the load imbalances created by p ‐adaptation. A number of numerical experiments are performed to demonstrate both the numerical accuracy and parallel performance of the developed p ‐adaptive DG method. It is observed that the unbalanced load distribution caused by the parallel p ‐adaptive DG method can be alleviated by the dynamic load balancing from Charm++ system. Due to this, high performance gain can be achieved. For the testcases studied in the current work, the parallel performance gain ranged from 1.5× to 3.7×. Therefore, the developed p ‐adaptive DG method can significantly reduce the total simulation time in comparison to the standard DG method without p ‐adaptation.

97 MATHEMATICS AND COMPUTING↗

Comparison of Some Representative Density Functional Theory and Wave Function Theory Methods for the Studies of Amino Acids

Energies of different conformers of 22 amino acid molecules and their protonated and deprotonated species were calculated by some density functional theory (DFT; SVWN, B3LYP, B3PW91, MPWB1K, BHandHLYP) and wave function theory (WFT; HF, MP2) methods with the 6-31111G(d,p) basis set to obtain the relative conformer energies, vertical electron detachment energies, deprotonation energies, and proton affinities. Taking the CCSD/6-31111G(d,p) results as the references, the performances of the tested DFT and WFT methods for amino acids with various intramolecular hydrogen bonds were determined. The BHandHLYP method was the best overall performer among the tested DFT methods, and its accuracy was even better than that of the more expensive MP2 method. The computational dependencies of the five DFT methods and the HF and MP2 methods on the basis sets were further examined with the 6-31G(d,p), 6-31111G(d,p), aug-cc-pVDZ, 6-31111G(2df,p), and aug-cc-pVTZ basis sets. The differences between the small and large basis set results have decreased quickly for the hybrid generalized gradient approximation (GGA) methods. The basis set convergence of the MP2 results has been, however, very slow. Considering both the cost and the accuracy, the BHandHLYP functional with the 6-31111G(d,p) basis set is the best choice for the amino acid systems that are rich in hydrogen bonds.

08 HYDROGEN↗

A comparison of preconditioned Krylov subspace methods for large‐scale nonsymmetric linear systems

Summary Preconditioned Krylov subspace (KSP) methods are widely used for solving large‐scale sparse linear systems arising from numerical solutions of partial differential equations (PDEs). These linear systems are often nonsymmetric due to the nature of the PDEs, boundary or jump conditions, or discretization methods. While implementations of preconditioned KSP methods are usually readily available, it is unclear to users which methods are the best for different classes of problems. In this work, we present a comparison of some KSP methods, including GMRES, TFQMR, BiCGSTAB, and QMRCGSTAB, coupled with three classes of preconditioners, namely, Gauss–Seidel, incomplete LU factorization (including ILUT, ILUTP, and multilevel ILU), and algebraic multigrid (including BoomerAMG and ML). Theoretically, we compare the mathematical formulations and operation counts of these methods. Empirically, we compare the convergence and serial performance for a range of benchmark problems from numerical PDEs in two and three dimensions with up to millions of unknowns and also assess the asymptotic complexity of the methods as the number of unknowns increases. Our results show that GMRES tends to deliver better performance when coupled with an effective multigrid preconditioner, but it is less competitive with an ineffective preconditioner due to restarts. BoomerAMG with a proper choice of coarsening and interpolation techniques typically converges faster than ML, but both may fail for ill‐conditioned or saddle‐point problems, whereas multilevel ILU tends to succeed. We also show that right preconditioning is more desirable. This study helps establish some practical guidelines for choosing preconditioned KSP methods and motivates the development of more effective preconditioners.

Ghai, Aditi↗

Physicochemical and Performance Characterization of Six Commercial Organic Solvent Nanofiltration Membranes

This work introduces a novel, gradient-free metamaterial design method based on Gaussian process regression to represent the density field of a unit cell. The dimension of the design space is determined by the covariance matrix dimension in the Gaussian process regression. We propose compressing this matrix using an autoencoder, enabling the decoder to generate the density field and effectively reduce the originally large design space to a lower-dimensional subspace. In this compressed space, we employ an active learning method, Bayesian Adaptive Direct Search (BADS), for efficient exploration of the design space. We demonstrate that for simple 2D designs aimed at maximizing unit cell stiffness, our method yields results comparable to those of standard topology optimization. Furthermore, we extend our approach to various mechanical problems, from linear elasticity to hyperelastic large deformation and elasto-plasticity under finite deformation, to 3D metamaterial design. This illustrates the method’s versatility and effectiveness across a range of applications.

Wu, Haoran↗

Fusion Imaging to Guide Thoracic Endovascular Aortic Repair (TEVAR): A Randomized Comparison of Two Methods, 2D/3D Versus 3D/3D Image Fusion

Purpose: To compare the accuracy of two-dimensional (2D) versus three-dimensional (3D) image fusion for thoracic endovascular aortic repair (TEVAR) image guidance. Materials and Methods: Between December 2016 and March 2018, all eligible patients who underwent TEVAR were prospectively included in a single-center study. Image fusion methods (2D/3D or 3D/3D) were randomly assigned to guide each TEVAR and compared in terms of accuracy, dose area product (DAP), volume of contrast medium injected, fluoroscopy time and procedure time. Results: Thirty-two patients were prospectively included; 18 underwent 2D/3D and 14 underwent 3D/3D TEVAR. The 3D/3D method allowed more accurate positioning of the aortic mask on top of the fluoroscopic images (proximal landing zone error vector: 1.7 ± 3.3 mm) than was achieved by the 2D/3D method (6.1 ± 6.1 mm; p = 0.03). The 3D/3D image fusion method was associated with significantly lower DAP than the 2D/3D method (50.5 ± 30.1 Gy cm{sup 2} for 3D/3D vs. 99.5 ± 79.1 Gy cm{sup 2} for 2D/3D; p = 0.03). The volume of contrast medium injected was significantly lower for the 3D/3D method than for the 2D/3D method (50.6 ± 22.9 ml vs. 98.4 ± 47.9 ml; p = 0.002). Conclusion: Higher image fusion accuracy and lower contrast volume and irradiation dose were observed for 3D/3D image fusion than for 2D/3D during TEVAR. Level of Evidence: II, Randomized trial.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Structure-aware methods for expensive derivative-free nonsmooth composite optimization

We present new methods for solving a broad class of bound-constrained nonsmooth composite minimization problems. These methods are specially designed for objectives that are some known mapping of outputs from a computationally expensive function. We provide accompanying implementations of these methods: in particular, a novel manifold sampling algorithm (MS-P) with subproblems that are in a sense primal versions of the dual problems solved by previous manifold sampling methods and a method (GOOMBAH) that employs more difficult optimization subproblems. For these two methods, we provide rigorous convergence analysis and guarantees. We demonstrate extensive testing of these methods. Open-source implementations of the methods developed in this manuscript can be found at https://github.com/POptUS/ IBCDFO/.

97 MATHEMATICS AND COMPUTING↗

Comparison and validation of the QuEChERSER mega-method for determination of per- and polyfluoroalkyl substances in foods by liquid chromatography with high-resolution and triple quadrupole mass spectrometry

Instances of food contamination with per- and polyfluoroalkyl substances (PFAS) continue to occur globally, but sample preparation and analytical methods are quite limited and often monitor for a small percentage of known PFAS. This study aimed to evaluate, validate, and compare performance of two instruments with the recently developed “quick, easy, cheap, effective, rugged, safe, efficient, and robust” (QuEChERSER) sample preparation mega-method – a method developed to monitor chemicals over a broad range of physicochemical properties. Initial evaluation of the QuEChERSER mega-method for determination of PFAS in food demonstrated recoveries, matrix interferences, and co-extractive removal comparable to (or better than) US Food and Drug Administration (FDA) and USDA Food Safety and Inspection Service (FSIS) methods. Subsequent validation of QuEChERSER in beef, catfish, chicken, pork, liquid eggs, and powdered eggs on a high-resolution mass spectrometer achieved acceptable recoveries (70–120%) and precision (RSDs ≤20%) for all 33 target analytes at the 1 and 5 ng g –1 levels and 67–88% of analytes at the 0.1 ng g –1 level, depending on the matrix. Additional validation was performed by tandem mass spectrometry on a triple quadrupole instrument. This approach provided no non-detects and better recoveries at the 0.1 ng g –1 level than the HRMS method but exhibited more variability at 1 and 5 ng g –1 spiking levels. Analysis of NIST SRMs 1946 and 1947 gave accuracies of 70–117%. Furthermore, these results demonstrate the capability of combining PFAS analysis with a mega-method previously validated for 350 analytes, while collecting non-target data for future retrospective analysis of emerging alternatives with a high-resolution mass spectrometry method.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Newton trust-region methods with primary variable switching for simulating high temperature multiphase porous media flow

Coupling multiphase flow with energy transport due to high temperature heat sources introduces significant new challenges since boiling and condensation processes can lead to dry-out conditions with subsequent re-wetting. The transition between two-phase and single-phase behavior can require changes to the primary dependent variables adding discontinuities as well as extending constitutive nonlinear relations to extreme physical conditions. Practical simulations of large-scale engineered domains lead to Jacobian systems with a very large number of unknowns that must be solved efficiently using iterative methods in parallel on high-performance computers. Performance assessment of potential nuclear repositories, carbon sequestration sites and geothermal reservoirs can require numerous Monte-Carlo simulations to explore uncertainty in material properties, boundary conditions, and failure scenarios. Due to the numerical challenges, standard NR iteration may not converge over the range of required simulations and require more sophisticated optimization method like trust-region. In this study, we use the open-source simulator PFLOTRAN for the important practical problem of the safety assessment of future nuclear waste repositories in the U.S. DOE geologic disposal safety assessment Framework. The simulator applies the PETSc parallel framework and a backward Euler, finite volume discretization. We demonstrate failure of the conventional NR method and the success of trust-region modifications to Newton’s method for a series of test problems of increasing complexity. Trust-region methods essentially modify the Newton step size and direction under some circumstances where the standard NR iteration can cause the solution to diverge or oscillate. Furthermore, we show how the Newton Trust-Region method can be adapted for Primary Variable Switching (PVS) when the multiphase state changes due to boiling or condensation. The simulations with high-temperature heat sources which led to extreme nonlinear processes with many state changes in the domain did not converge with NR, but they do complete successfully with the trust-region methods modified for PVS. This implementation effectively decreased weeks of simulation time needing manual adjustments to complete a simulation down to a day. Finally, we show the strong scalability of the methods on a single node and multiple nodes in an HPC cluster.

54 ENVIRONMENTAL SCIENCES↗

Clumping index estimation with 30°-tilted cameras in row crops: Evaluation of methods and segment size effects

The clumping index (CI) quantifies the spatial distribution of foliage elements and is essential for accurately estimating the plant area index (PAI), canopy radiative transfer, and photosynthesis. Traditionally, the finite-length averaging method (LX), the gap size distribution method (CC), and a combined approach of CC and LX (CLX) have been applied to instruments like TRAC and digital hemispherical photography to estimate CI. However, a comprehensive evaluation of these methods in row crops remains limited, especially regarding the influence of segment size on CI. Meanwhile, digital cameras offer a cost-effective and user-friendly solution for canopy measurements in row crops, yet their application in this context remains underexplored. In this study, we employed a new approach using a 30°-tilted digital camera to estimate CI in corn and soybean fields, applying the LX, CC, and CLX methods. We systematically assessed the performance of these three methods by combining field measurements in real-world fields with simulations using the LESS 3D radiative transfer model. Our results showed that CLX applied to the whole image and 45° segment offered accurate estimation of CI (bias within ±0.1, RMSE < 0.2) and PAI (bias within ±0.4, RMSE < 1) in real-world fields and LESS simulations. The accuracy of the LX method was highly sensitive to segment size, with the best performance observed at the 15° segment (PAI bias within ±0.4). In contrast, the CC method remained stable across different segment sizes, and its performance was generally comparable to that of LX, except at the 15° segment. Across view zenith angles, CI derived from CC generally showed a continuous increase, while those from LX and CLX followed a rising trend at small zenith angles but began to decline at 68°, likely due to an increasing proportion of no-gap segments. Seasonally, LX tended to show decreasing CI during early growth stages but increased as the canopy matured, whereas CC and CLX showed gradually increasing CI before plateauing at peak PAI. The 30°-tilted camera effectively captured CI variations across different angles and growth stages, making it a practical and robust instrument for row crop canopy structure analysis. Furthermore, applying these CI methods to digital cameras offers a low-cost and accessible CI estimation alternative, improving canopy structure monitoring accuracy in row crops.

30°-tilted camera↗

Verification and validation of the maximum entropy method for reconstructing neutron flux, with MCNP5, Attila-7.1.0 and the GODIVA experiment

Verification and validation of reconstructed neutron flux based on the maximum entropy method is presented in this paper. The verification is carried out by comparing the neutron flux spectrum from the maximum entropy method with Monte Carlo N Particle 5 version 1.40 (MCNP5) and Attila-7.1.0-beta (Attila). A spherical 100% 235U critical assembly is modeled as the test case to compare the three methods. The verification error range for the maximum entropy method is 15–21% where MCNP5 is taken to be the comparison standard. Attila relative error for the critical assembly is 20–35%. Validation is accomplished by comparing a neutron flux spectrum that is back calculated from foil activation measurements performed in the GODIVA experiment (GODIVA). The error range of the reconstructed flux compared to GODIVA is 0–10%. The error range of the neutron flux spectrum from MCNP5 compared to GODIVA is 0–20% and the Attila error range compared to the GODIVA is 0–35%. The maximum entropy method is shown to be a fast reliable method, compared to either Monte Carlo methods (MCNP5) or 30 multienergy group methods (Attila) and with respect to the GODIVA experiment.

99 GENERAL AND MISCELLANEOUS↗

Statistical Methods Applied to Gamma-ray Spectroscopy Algorithms in Nuclear Security Missions

In a wide range of nuclear security missions, gamma-ray spectroscopy is a critical research and development priority. One particularly relevant challenge is the interdiction of special nuclear material for which gamma-ray spectroscopy supports the goals of detecting and identifying gamma-ray sources. This manuscript examines the existing set of spectroscopy methods, attempts to categorize them by the statistical methods on which they rely, and identifies methods that have yet to be considered. Our examination shows that current methods effectively estimate the effect of counting uncertainty but in many cases do not address larger sources of decision uncertainty—ones that are significantly more complex. We thus explore the premise that significantly improving algorithm performance requires greater coupling between the problem physics that drives data acquisition and statistical methods that analyze such data. Untapped statistical methods, such as Bayes Modeling Averaging and hierarchical and empirical Bayes methods have the potential to reduce decision uncertainty by more rigorously and comprehensively incorporating all sources of uncertainty. We expect that application of such methods will demonstrate progress in meeting the needs of nuclear security missions by improving on the existing numerical infrastructure for which these analyses have not been conducted.

detection algorithm.↗

Feasibility of using thermal response methods for nonintrusive compressed air flow measurement

Robust, low-cost nonintrusive flow meters are of interest in many industries. Particularly, a reliable nonintrusive flow measurement for the diagnosis of air leaks in compressed air systems is desirable. Measurement of the air flow due to leaks in the system ensures an accurate estimation of potential cost and energy savings. This study evaluates a novel method of using thermal responses to nonintrusively measure leakage rates in compressed air lines. The method uses heat and the resulting thermal response to calculate the flow rate inside the compressed air line. Compared to the current methods for flow measurement, this method can simplify flow measurement while decreasing the sensitivity to errors when measuring flow rates. In this study, the methodology of the proposed method is explained along with the potential advantages to the design. Two approaches are evaluated: a dynamic step response and sinusoidal frequency response. Simulated tests evaluate the feasibility of the proposed methods, followed by experiments that validate the simulation results. A clear correlation between the thermal step response and the flow rate indicate viability of the proposed method in simulation. Experimental results yielded similar results, confirming the validity of the proposed method. The results of a field test in an industrial environment demonstrate the capability of the approach to other flow rate measurement techniques.

42 ENGINEERING↗