SEARCH · Search NASA

Results for “deterministic”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 541 records · Page 30

All sources NASA NTRS DOE OSTI

DOE OSTI2013

AUTOMATIC MESH ADAPTIVITY FOR CADIS AND FW-CADIS NEUTRONICS MODELING OF DIFFICULT SHIELDING PROBLEMS

The hybrid Monte Carlo/deterministic techniques CADIS and FW-CADIS dramatically increase the efficiency of neutronics modeling, but their use in the accurate design analysis of very large and geometrically complex nuclear systems has been restricted by the availability of computing resources for their preliminary deterministic calculations and the large computer memory requirements of their final Monte Carlo calculations. Three automatic mesh adaptivity algorithms were developed to reduce the memory requirements of CADIS and FW-CADIS without sacrificing their efficiency improvement. First, a macromaterial approach enhances the fidelity of the deterministic models without changing the mesh. Second, a deterministic mesh refinement algorithm generates meshes that capture as much geometric detail as possible without exceeding some maximum number of mesh elements. Finally, a weight window coarsening algorithm decouples the weight window mesh from the mesh of the deterministic calculations to remove the memory constraint of the weight window map from the deterministic mesh resolution. The three algorithms were used to calculate the prompt dose rate throughout the entire ITER experimental facility. Compared to a FW-CADIS calculation with the same weight window map memory requirement, using the three algorithms resulted in a 23.3% increase in the regions where the dose rates were calculated in a 10-day Monte Carlo calculation and, additionally, increased the efficiency of the Monte Carlo simulation by a factor of at least 3.4. The three algorithms enabled the accurate performance of this difficult global Monte Carlo calculation, which traditionally needed high performance computing, using a FW-CADIS simulation on a regular computer cluster.

CADIS and FW-CADIS↗

DOE OSTI2013

Automatic mesh adaptivity for CADIS and FW-CADIS neutronics modeling of difficult shielding problems

The CADIS and FW-CADIS hybrid Monte Carlo/deterministic techniques dramatically increase the efficiency of neutronics modeling, but their use in the accurate design analysis of very large and geometrically complex nuclear systems has been limited by the large number of processors and memory requirements for their preliminary deterministic calculations and final Monte Carlo calculation. Three mesh adaptivity algorithms were developed to reduce the memory requirements of CADIS and FW-CADIS without sacrificing their efficiency improvement. First, a macro-material approach enhances the fidelity of the deterministic models without changing the mesh. Second, a deterministic mesh refinement algorithm generates meshes that capture as much geometric detail as possible without exceeding a specified maximum number of mesh elements. Finally, a weight window coarsening algorithm de-couples the weight window mesh and energy bins from the mesh and energy group structure of the deterministic calculations in order to remove the memory constraint of the weight window map from the deterministic mesh resolution. The three algorithms were used to enhance an FW-CADIS calculation of the prompt dose rate throughout the ITER experimental facility. Using these algorithms resulted in a 23.3% increase in the number of mesh tally elements in which the dose rates were calculated in a 10-day Monte Carlo calculation and, additionally, increased the efficiency of the Monte Carlo simulation by a factor of at least 3.4. The three algorithms enabled this difficult calculation to be accurately solved using an FW-CADIS simulation on a regular computer cluster, obviating the need for a world-class super computer. (authors)

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2022

Particle Swarm Optimisation for group structure optimization for radiotherapy shielding

Neutron transport simulations are ubiquitous in nuclear engineering because they allow one to model experimental systems and render a model platform for easy perturbation of experimental designs. In addition, simulations allow one to gain experimental insight without actually having to go through the trouble of building a physical experiment. Neutron transport simulations can be stochastic or deterministic based. Stochastic neutron transport simulations are typically simulated using the Monte Carlo method and yield very accurate solutions but are computationally expensive, while deterministic methods are typically faster but can be less accurate. Here we focus on optimizing the accuracy of deterministic neutron transport simulations for radiotherapy simulations. Deterministic neutron transport requires discretization of angle, energy, and space to appropriately analyze the system one is trying to model. Discretization of energy is challenging because of the highly variable neutron flux at certain neutron energies. Improper discretization of energy in the transport model can lead to erroneous results and therefore inaccurate interpretations of the solution. In this study, we evaluate Particle Swarm Optimization (PSO) as a mechanism for selecting optimal group structures for radiotherapy shielding. We tested the particle swarm optimization algorithm on radiotherapy shielding problems using Los Alamos National Laboratory's (LANL) main deterministic transport code PARTISN. Results show that the optimized energy group structures generated from the optimization algorithm outperformed LANL's standard energy group structures, and therefore demonstrate utility in using PSO to expedite computation times due to the increased accuracy obtained with a smaller but optimized group structure. (authors)

43 PARTICLE ACCELERATORS↗

DOE OSTI2018

Nitrogen enrichment suppresses other environmental drivers and homogenizes salt marsh leaf microbiome

Microbial community assembly is affected by a combination of forces that act simultaneously, but the mechanisms underpinning their relative influences remain elusive. This gap strongly limits our ability to predict human impacts on microbial communities and the processes they regulate. Here, we experimentally demonstrate that increased salinity stress, food web alteration and nutrient loading interact to drive outcomes in salt marsh fungal leaf communities. Both salinity stress and food web alterations drove communities to deterministically diverge, resulting in distinct fungal communities. Increased nutrient loads, nevertheless, partially suppressed the influence of other factors as determinants of fungal assembly. Using a null model approach, we found that increased nutrient loads enhanced the relative importance of stochastic over deterministic divergent processes; without increased nutrient loads, samples from different treatments showed a relatively (deterministic) divergent community assembly whereas increased nutrient loads drove the system to more stochastic assemblies, suppressing the effect of other treatments. These results demonstrate that common anthropogenic modifications can interact to control fungal community assembly. As a result, our results suggest that when the environmental conditions are spatially heterogeneous (as in our case, caused by specific combinations of experimental treatments), increased stochasticity caused by greater nutrient inputs can reduce the importance of deterministic filters that otherwise caused divergence, thus driving to microbial community homogenization.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2022

An adaptive stochastic sequential quadratic programming with differentiable exact augmented lagrangians

In this study, we consider solving nonlinear optimization problems with a stochastic objective and deterministic equality constraints. We assume for the objective that its evaluation, gradient, and Hessian are inaccessible, while one can compute their stochastic estimates by, for example, subsampling. We propose a stochastic algorithm based on sequential quadratic programming (SQP) that uses a differentiable exact augmented Lagrangian as the merit function. To motivate our algorithm design, we first revisit and simplify an old SQP method Lucidi developed for solving deterministic problems, which serves as the skeleton of our stochastic algorithm. Based on the simplified deterministic algorithm, we then propose a non-adaptive SQP for dealing with stochastic objective, where the gradient and Hessian are replaced by stochastic estimates but the stepsizes are deterministic and prespecified. Finally, we incorporate a recent stochastic line search procedure Paquette and Scheinberg into the non-adaptive stochastic SQP to adaptively select the random stepsizes, which leads to an adaptive stochastic SQP. The global "almost sure" convergence for both non-adaptive and adaptive SQP methods is established. Numerical experiments on nonlinear problems in CUTEst test set demonstrate the superiority of the adaptive algorithm.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

A two-step short-term probabilistic wind forecasting methodology based on predictive distribution optimization

With increasing wind penetrations into electric power systems, probabilistic wind forecasting becomes more critical to power system operations because of its capability of quantifying wind uncertainties. In this paper, a two-step probabilistic wind forecasting approach based on pinball loss optimization is developed. First, a multimodel machine learning-based ensemble deterministic forecasting framework is adopted to generate deterministic forecasts. The deterministic forecast is assumed to be the mean value of the predictive distribution at each forecasting time stamp. Then, the optimal unknown parameter (i.e., standard deviation) of the predictive distribution is estimated by a support vector regression surrogate model based on the deterministic forecasts. Lastly, probabilistic forecasts are generated from the predictive distribution. Numerical results of case studies at eight locations show that the developed two-step probabilistic forecasting methodology has improved the pinball loss metric score by up to 35% compared to a baseline quantile regression forecasting model.

17 WIND ENERGY↗

DOE OSTI2023

Dynamics of coupled thermoacoustic modes: Noise and frequency spacing effects

Practical combustion systems consist of multiple thermoacoustic modes that are linearly stable or unstable at a wide range of frequencies. When coupled, the modal interactions are a strong function of the frequency spacing between them – having very significant implications on interpretation of linear stability or instability of modes from experimental data. Frequency spacing between the modes particularly influences the stability and existence of potential limit cycle solutions. In this paper, we extend earlier deterministic studies to include the effects of noise, studying how deterministic dynamics change with the addition of noise and the simultaneous impact of frequency spacing (i.e., closely, or widely spaced). Specifically, this paper characterizes three key effects of noise, which are (1) distribution of limit cycle amplitudes (“diffusion”), (2) shift in the average limit cycle amplitudes (“noise induced drift”), and (3) introduction of new bifurcations that are not present in the deterministic system. Key conclusions from this work are that in highly noisy practical environments, a deterministic/ low noise analysis will not be sufficient to explain even critical qualitative features of the system – such as existence of stable limit cycles or their amplitudes. Furthermore, the nature of noise-induced effects on nonlinear modal interactions can be fundamentally different for degenerate, closely spaced, and widely spaced modes.

42 ENGINEERING↗

DOE OSTI2015

DNS and LES of turbulent flow in a closed channel featuring a pattern of hemispherical roughness elements

Three mesh adaptivity algorithms were developed to facilitate and expedite the use of the CADIS and FW-CADIS hybrid Monte Carlo/deterministic techniques in accurate full-scale neutronics simulations of fusion energy systems with immense sizes and complicated geometries. First, a macromaterial approach enhances the fidelity of the deterministic models without changing the mesh. Second, a deterministic mesh refinement algorithm generates meshes that capture as much geometric detail as possible without exceeding a specified maximum number of mesh elements. Finally, a weight window coarsening algorithm decouples the weight window mesh and energy bins from the mesh and energy group structure of the deterministic calculations in order to remove the memory constraint of the weight window map from the deterministic mesh resolution. The three algorithms were used to enhance an FW-CADIS calculation of the prompt dose rate throughout the ITER experimental facility and resulted in a 23.3% increase in the number of mesh tally elements in which the dose rates were calculated in a 10-day Monte Carlo calculation. Additionally, because of the significant increase in the efficiency of FW-CADIS simulations, the three algorithms enabled this difficult calculation to be accurately solved on a regular computer cluster, eliminating the need for a world-class super computer.

Nuclear Science & Technology↗

DOE OSTI2017

Robust planning of dynamic wireless charging infrastructure for battery electric buses

Battery electric buses with zero tailpipe emissions have great potential in improving environmental sustainability and livability of urban areas. However, the problems of high cost and limited range associated with on-board batteries have substantially limited the popularity of battery electric buses. The technology of dynamic wireless power transfer (DWPT), which provides bus operators with the ability to charge buses while in motion, may be able to effectively alleviate the drawbacks of electric buses. In this paper, we address the problem of simultaneously selecting the optimal location of the DWPT facilities and designing the optimal battery sizes of electric buses for a DWPT electric bus system. The problem is first constructed as a deterministic model in which the uncertainty of energy consumption and travel time of electric buses is neglected. The methodology of robust optimization (RO) is then adopted to address the uncertainty of energy consumption and travel time. The affinely adjustable robust counterpart (AARC) of the deterministic model is developed, and its equivalent tractable mathematical programming is derived. Both the deterministic model and the robust model are demonstrated with a real-world bus system. The results of our study demonstrate that the proposed deterministic model can effectively determine the allocation of DWPT facilities and the battery sizes of electric buses for a DWPT electric bus system; and the robust model can further provide optimal designs that are robust against the uncertainty of energy consumption and travel time for electric buses.

25 ENERGY STORAGE↗

DOE OSTI2020

Learning and meta-learning of stochastic advection–diffusion–reaction systems from sparse measurements

Physics-informed neural networks (PINNs) were recently proposed in [18] as an alternative way to solve partial differential equations (PDEs). A neural network (NN) represents the solution, while a PDE-induced NN is coupled to the solution NN, and all differential operators are treated using automatic differentiation. Here, we first employ the standard PINN and a stochastic version, sPINN, to solve forward and inverse problems governed by a non-linear advection–diffusion–reaction (ADR) equation, assuming we have some sparse measurements of the concentration field at random or pre-selected locations. Subsequently, we attempt to optimise the hyper-parameters of sPINN by using the Bayesian optimisation method (meta-learning) and compare the results with the empirically selected hyper-parameters of sPINN. In particular, for the first part in solving the inverse deterministic ADR, we assume that we only have a few high-fidelity measurements, whereas the rest of the data is of lower fidelity. Hence, the PINN is trained using a composite multi-fidelity network, first introduced in [12], that learns the correlations between the multi-fidelity data and predicts the unknown values of diffusivity, transport velocity and two reaction constants as well as the concentration field. For the stochastic ADR, we employ a Karhunen–Loève (KL) expansion to represent the stochastic diffusivity, and arbitrary polynomial chaos (aPC) to represent the stochastic solution. Correspondingly, we design multiple NNs to represent the mean of the solution and learn each aPC mode separately, whereas we employ a separate NN to represent the mean of diffusivity and another NN to learn all modes of the KL expansion. For the inverse problem, in addition to stochastic diffusivity and concentration fields, we also aim to obtain the (unknown) deterministic values of transport velocity and reaction constants. The available data correspond to 7spatial points for the diffusivity and 20 space–time points for the solution, both sampled 2000 times. We obtain good accuracy for the deterministic parameters of the order of 1–2% and excellent accuracy for the mean and variance of the stochastic fields, better than three digits of accuracy. In the second part, we consider the previous stochastic inverse problem, and we use Bayesian optimisation to find five hyper-parameters of sPINN, namely the width, depth and learning rate of two NNs for learning the modes. Here, we obtain much deeper and wider optimal NNs compared to the manual tuning, leading to even better accuracy, i.e., errors less than 1% for the deterministic values, and about an order of magnitude less for the stochastic fields.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Microbial and Environmental Processes Shape the Link between Organic Matter Functional Traits and Composition

Dissolved organic matter (DOM) is a large and complex mixture of molecules that fuels biogeochemical reaction in virtually all ecosystems on Earth. However, the relative importance of deterministic and stochastic processes in structuring DOM composition remains poorly characterized. Here we develop a framework for partitioning molecular composition based on key molecular traits, including lability vs. recalcitrance and activity vs. inactivity. Within this framework, we examine the ecological processes governing the assembly of DOM fractions by deploying aquatic microcosms on mountainsides that span gradients of temperature and nutrient loading in subtropical and subarctic ecosystems. Across study regions, deterministic and stochastic processes primarily structure active and inactive fractions, respectively. However, recalcitrant molecules are more deterministically assembled than labile molecules in the inactive fraction. Deterministic processes leading to variable selection generally exhibit more variation across the energy supply gradient for inactive fractions, and their importance increases with energy supply for recalcitrant molecules in both active and inactive fractions. Together, our results indicate that active and inactive fractions of DOM assemblages are structured by contrasting ecological processes, and their recalcitrant components are sensitive to global change. In conclusion, our framework opens new avenues to understand the assembly and turnover of DOM in a changing world, which can be used to predict carbon cycling at local to global scales.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2014

Stochasticity, succession, and environmental perturbations in a fluidic ecosystem

Unraveling the drivers of community structure and succession in response to environmental change is a central goal in ecology. Although the mechanisms shaping community structure have been intensively examined, those controlling ecological succession remain elusive. To understand the relative importance of stochastic and deterministic processes in mediating microbial community succession, a unique framework composed of four different cases was developed for fluidic and nonfluidic ecosystems. The framework was then tested for one fluidic ecosystem: a groundwater system perturbed by adding emulsified vegetable oil (EVO) for uranium immobilization. Our results revealed that groundwater microbial community diverged substantially away from the initial community after EVO amendment and eventually converged to a new community state, which was closely clustered with its initial state. However, their composition and structure were significantly different from each other. Null model analysis indicated that both deterministic and stochastic processes played important roles in controlling the assembly and succession of the groundwater microbial community, but their relative importance was time dependent. Additionally, consistent with the proposed conceptual framework but contradictory to conventional wisdom, the community succession responding to EVO amendment was primarily controlled by stochastic rather than deterministic processes. During the middle phase of the succession, the roles of stochastic processes in controlling community composition increased substantially, ranging from 81.3% to 92.0%. Finally, there are limited successional studies available to support different cases in the conceptual framework, but further well-replicated explicit time-series experiments are needed to understand the relative importance of deterministic and stochastic processes in controlling community succession.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2026

Faster Randomized Dynamical Decoupling

We present a randomized dynamical decoupling (DD) protocol that can substantially improve the performance of any given deterministic DD scheme for suppressing coherent noise by using no more than two additional pulses. Our construction is implemented by probabilistically applying sequences of pulses, which, when combined, effectively eliminate the error terms that scale linearly with the system-environment coupling strength. As a result, we show that a randomized protocol using a few pulses can outperform deterministic DD protocols that require considerably more pulses. Furthermore, we prove that the randomized protocol provides an improvement compared to deterministic DD sequences that aim to reduce the error in the system’s Hilbert space, such as Uhrig DD, which had been previously regarded to be optimal. To rigorously evaluate the performance, we introduce new analytical methods suitable for analyzing higher-order DD protocols that might be of independent interest. Here, we also present numerical simulations confirming the significant advantage of using randomized protocols compared to widely used deterministic protocols.

Quantum algorithms & computation↗

DOE OSTI2010

Universal resources for approximate and stochastic measurement-based quantum computation

We investigate which quantum states can serve as universal resources for approximate and stochastic measurement-based quantum computation in the sense that any quantum state can be generated from a given resource by means of single-qubit (local) operations assisted by classical communication. More precisely, we consider the approximate and stochastic generation of states, resulting, for example, from a restriction to finite measurement settings or from possible imperfections in the resources or local operations. We show that entanglement-based criteria for universality obtained in M. Van den Nest et al. [New J. Phys. 9, 204 (2007)] for the exact, deterministic case can be lifted to the much more general approximate, stochastic case. This allows us to move from the idealized situation (exact, deterministic universality) considered in previous works to the practically relevant context of nonperfect state preparation. We find that any entanglement measure fulfilling some basic requirements needs to reach its maximum value on some element of an approximate, stochastic universal family of resource states, as the resource size grows. This allows us to rule out various families of states as being approximate, stochastic universal. We prove that approximate, stochastic universality is in general a weaker requirement than deterministic, exact universality and provide resources that are efficient approximate universal, but not exact deterministic universal. We also study the robustness of universal resources for measurement-based quantum computation under realistic assumptions about the (imperfect) generation and manipulation of entangled states, giving an explicit expression for the impact that errors made in the preparation of the resource have on the possibility to use it for universal approximate and stochastic state preparation. Finally, we discuss the relation between our entanglement-based criteria and recent results regarding the uselessness of states with a high degree of geometric entanglement as universal resources [D. Gross et al., Phys. Rev. Lett. 102, 190501 (2009); M. J. Bremner et al., Phys. Rev. Lett 102, 190502 (2009)].

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2024

Recovery of Oxpure 612C-50 Coconut Carbon Particles Using Bump Arrays

Cyanide is used to leach gold from crushed ore (solid matrix) into a gold cyanide solution. The gold is extracted from the cyanide solution by adsorption onto activated carbon. The gold extraction process occurs when the activated coconut carbon is placed into tanks that contain the gold cyanide solution either in a batch process or into a continuous flow circuit. The coconut carbon is then removed from the solution for gold recovery. The use of the mesofluidic separation system (a deterministic lateral displacement system) can significantly reduce costs and waste generated from the process of removing the coconut carbon from the solution. In the coconut carbon recovery process used at many gold mines in Nevada, the gold is attached to carbon particles that are still in the cyanide liquor. The mesofluidic system can rapidly remove the gold bearing carbon particles from the cyanide liquor quickly and with no operating costs. The benefits include: • Reduce operational costs related to filtration and hydro-cyclones • Reduced acid usage for the elution gold stripping phase as only 25% of the fluids will follow the carbon particles to the final express lane when two mesofluidic systems are used in series This alternative particle removal techniques would be advantageous. A promising technique for removing larger particles from slurries is mesofluidic separation, similar to deterministic lateral displacement arrays or “bump” arrays [1] but operates at much larger flow rates. As described by Pease, et al. [2], “Bump arrays in deterministic lateral displacement devices separate large particles from small particles using arrays of staggered posts. Large particles, defined as those with radii larger than the distance between the edge of a post and the stagnation streamline from the next downstream post, must bump toward one side of the device, whereas particles smaller than this distance slalom from entrance to exit without net lateral displacement.” Unlike filters or sieves, the posts in the arrays that cause separation do not block or occlude particle flow but work because particles go around the posts. Unlike hydrocyclones separation, separation is not driven by particle density, because gravitational forces are unimportant to mesofluidic separation. Burns, et al., and Pease, et al., have shown that particles may be separated from complex suspensions, under turbulent flow conditions, and at industrially important flow rates [3-5]. They have also recently shown that mesofluidic devices may be arranged in series to increase separation performance [6]. In this paper, we evaluate the mesofluidic system for the separation of commercial OxPure GR 612 Charred Coconut shell particles as a proof of principle test for the rapid separation using the 1500 micron cut mesofluidic separator. We first describe the experimental system and conditions. We then present the experimental results. [1] Huang, L.R., E.C. Cox, R.H. Austin, J.C. Sturm. 2004. Continuous particle separation through deterministic lateral displacement. Science, 304, 987–990. https://doi.org/10.1126/science.1094567. [2] Pease L.F., J.A. Bamberger, C.A. Burns, and M.J. Minette. 2021. Large Particle Separation from Non-Newtonian Slurries using Bump Arrays. In Proceedings of the ASME 2021 Fluids Engineering Division Summer Meeting FEDSM2021-65904, V003T08A023. New York, New York: ASME. doi:10.1115/FEDSM2021-65904 [3] Burns C.A., T.G. Veldman, J. Serkowski, R.C. Daniel, X.-Y. Yu, M.J. Minette, L.F. Pease. 2021. Mesofluidic separation versus dead-end filtration. Separation and Purification Technology, 254, 117256. https://doi.org/10.1016/j.seppur.2020.117256. [4] Pease L.F., J.E. Serkowski, T.G. Veldman, J. Williams, X.-Y. Yu, M.J. Minette, J.A. Bamberger, C.A. Burns. 2021. Can Bump Arrays Separate Particles from Turbulent Flows?. In Proceedings of the ASME 2021 Fluids Engineering Division Summer Meeting FEDSM2021-67696, V003T08A024. New York, New York: ASME. doi:10.11

mesofluidic separation, slurry, bump array↗

DOE OSTI2022

Online peak-aware energy scheduling with untrusted advice

This paper studies the online energy scheduling problem in a hybrid model where the cost of energy is proportional to both the volume and peak usage, and where energy can be either locally generated or drawn from the grid. Inspired by recent advances in online algorithms with Machine Learned (ML) advice, we develop parameterized deterministic and randomized algorithms for this problem such that the level of reliance on the advice can be adjusted by a trust parameter. We then analyze the performance of the proposed algorithms using two performance metrics: robustness that measures the competitive ratio as a function of the trust parameter when the advice is inaccurate, and consistency for competitive ratio when the advice is accurate. Since the competitive ratio is analyzed in two different regimes, we further investigate the Pareto optimality of the proposed algorithms. Our results show that the proposed deterministic algorithm is Pareto-optimal, in the sense that no other online deterministic algorithms can dominate the robustness and consistency of our algorithm. Furthermore, we show that the proposed randomized algorithm dominates the Pareto-optimal deterministic algorithm. Our large-scale empirical evaluations using real traces of energy demand, energy prices, and renewable energy generations highlight that the proposed algorithms outperform worst-case optimized algorithms and fully data-driven algorithms.

Lee, Russell↗

DOE OSTI2022

Data for Responsiveness of Miscanthus and Switchgrass Yields to Stand Age and Nitrogen Fertilization: A Meta-regression Analysis

The compiled datasets include plot level observations of energy crops (miscanthus and switchgrass) from recent experimental field trials in the US including dry biomass yield, location, state, region, harvest year, growing season degree days (GDD), winter season heating degree days (HDD), growing season cumulative precipitation, annual nitrogen application rate, age of the pant when harvested, National Commodity Crop Productivity Index (NCCPI) values, and cultivar type (switchgrass) from various published and unpublished sources. The stata codes include estimation procedures for four different specifications, i.e., Model A includes deterministic effect without interaction terms; Model B includes deterministic effect with interaction terms (N2, age2, N × age, GDD2, precip2, N × NCCPI); Model C includes deterministic effect with interaction terms, study, and location random effect; Model D includes deterministic effect with interaction terms, harvest year augmented study, and location random effect.

Age↗

DOE OSTI2015

(U) Feynman-Y calculations using PARTISN

A prescription for computing the Feynman Y as a function of coincidence gate width using a deterministic multigroup neutron transport code has been published and the results compared favorably with measurements of the BeRP ball. In this paper, we report on our project to implement the method and reproduce the results. There are several clarifications and corrections of the published prescription. We show results using two multigroup cross section libraries compared with measurements and with Monte Carlo results. Deterministic simulations of the mean count rates compare very favorably with previously published Monte Carlo results, and deterministic simulations of the Feynman Y asymptote compare somewhat favorably. In Feynman beta plots, the deterministic simulations reached the asymptotic value much sooner than did a fit to the measured data.

42 ENGINEERING↗