Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “error performance”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 487 records · Page 27

Catalytic resonance theory for parametric uncertainty of programmable catalysis

Microkinetic models are useful tools for screening catalytic materials; however, errors in their input parameters can lead to significant uncertainty in model predictions of catalyst performance. Here, in this work, we investigate the impact of linear scaling and Brønsted-Evans-Polanyi relation parametric uncertainty on microkinetic predictions of programmable-catalyst performance. Two case studies are considered: a generic A-to-B prototype reaction and the oxygen evolution reaction (OER). The results show that error-unaware models can accurately predict trends and, for the prototype reaction, values of optimal waveform parameters. The specific model parameters driving output uncertainty are identified via variance-based global sensitivity analysis. However, predictions of dynamic rate enhancement can decrease when uncertainty is propagated into the models. In both cases, we identify operating conditions where the programmable catalyst achieves a rate enhancement of at least one order of magnitude despite parametric uncertainty in the model, supporting programmable catalysis as a viable strategy for exceeding the Sabatier limit.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimal Client Sampling in Federated Learning with Client-level Heterogeneous Differential Privacy

Federated Learning with client-level differential privacy (DP) provides a promising framework for collaboratively training models while rigorously protecting clients’ privacy. However, classic approaches like DP-FedAvg struggle when clients have heterogeneous privacy requirements, as they must uniformly enforce the strictest privacy level across all clients, leading to excessive DP noise and significant degradation in model utility. Existing methods to improve the model utility in such heterogeneous privacy settings often assume a trusted server and are largely heuristic, resulting in suboptimal performance and lacking strong theoretical foundations. Here, in this work, we address these challenges under a practical attack model where both clients and the server are honest-but-curious. We propose GDPFed, which partitions clients into groups based on their privacy budgets and achieves client-level DP within each group to reduce the privacy budget waste and hence improve the model utility. Based on the privacy and convergence analysis of GDPFed, we find that the magnitude of DP noise depends on both model dimensionality and the per-group client sampling ratios. To further improve the performance of GDPFed, we introduce GDPFed+, which integrates model sparsification to eliminate unnecessary noise and optimizes per-group client sampling ratios to minimize convergence error. Extensive empirical evaluations on multiple benchmark datasets demonstrate the effectiveness of GDPFed+, showing substantial performance gains compared with state-of-the-art methods.

Xu, Jiahao [Univ. of Nevada, Reno, NV (United Stat↗

EPIsembleVis: A geo-visual analysis and comparison of the prediction ensembles of multiple COVID-19 models

In this work, we present EPIsembleVis, a web-based comparative visual analysis tool for evaluating the consistency of multiple COVID-19 prediction models. Our approach analyzes a collection of COVID-19 predictions from different epidemiological models as an ensemble and utilizes two metrics to quantify model performance. These metrics include (a) prediction uncertainty (represented as the dispersion of predictions in each ensemble) and (b) prediction error (calculated by comparing individual model predictions with the recorded data). Through an interactive visual interface, our approach provides a data-driven workflow for (a) selecting and constructing the COVID-19 model prediction ensemble based on the spatiotemporal overlap of available predictions of multiple epidemiological models, (b) quantifying the model performance using both the uncertainty of each model prediction ensemble, and the error of each ensemble member that represents individual model predictions, and (c) visualizing the spatiotemporal variability in the projection performance of individual models using a suite of novel ensemble visualization techniques, such as the data availability map, a spatiotemporal textured-tile calendar, multivariate rose chart, and time-series leaflet glyph. We demonstrate the capability of our ensemble visual interface through a case study that investigates the performance of weekly COVID-19 predictions, which are provided through the COVID-19 Forecast Hub UMass-Amherst Influenza Forecasting Center of Excellence [47] for the United States and United States Territories. The EPIsembleVis tool is implemented using open-source web technologies and adaptive system design, rendering it interoperable with Elasticsearch and Kibana for automatically ingesting COVID-19 predictions from online repositories, and it is generalizable for analyzing worldwide projections from more epidemiological models.

60 APPLIED LIFE SCIENCES↗

Scalable, In-situ Data Clustering Data Analysis for Extreme Scale Scientific Computing (Final Report)

The objective of this project is to address challenges in the design and development of scalable in-situ data clustering and analytics algorithms and software. Our goal is to develop parallel software consisting of a set of spatio-temporal data clustering and anomaly detection functions, both of which are very important for large-scale analysis and have wide applicability for in-situ runs as well as post-processing analysis. Our design principles for in-situ analysis consider the following: (1) identify parts of the computation can be done close to the data within the nodes, while it is still in memory; (2) extract analysis components can (and should) be performed in remote staging and analysis nodes; (3) develop error-bound approximation methods for applications tolerable for small errors; (4) identify the type of derived distributions and statistics, for spatio-temporal data, that can be kept locally in order to both accelerate computations and meet energy constraints in subsequent iterations and phases; (5) use a self-describing data format so that data can be consistent and understood among local storage (memory and SSDs) and at staging and analysis nodes, thereby providing portability and flexibility; (6) develop service-oriented functions that can schedule in-situ and post-hoc analysis tasks based on the dynamic requirements of applications. Our development focus is to produce the parallel data analysis software/library that will be scalable, reusable, extensible, and generic for applications in different disciplines. The software will be able to run in-situ with the simulations as well as post-hoc analysis. This approach will satisfy many synergistic requirements for data intensive applications executed on data coming from instruments and experiments. In particular, the proposed multilevel approach is directly applicable to perform design tradeoffs for running part of the algorithms near the instruments and the rest on remote (analysis) systems.

97 MATHEMATICS AND COMPUTING↗

AIIO: Using Artificial Intelligence for Job-Level and Automatic I/O Performance Bottleneck Diagnosis

Manually diagnosing the I/O performance bottleneck for a single application (hereinafter referred to as the "job level'') is a tedious and error-prone procedure requiring domain scientists to have deep knowledge of complex storage systems. However, existing automatic methods for I/O performance bottleneck diagnosis have one major issue: the granularity of the analysis is at the platform or group level and the diagnosis results cannot be applied to the individual application. To address this issue, we designed and developed a method named "Artificial Intelligence for I/O"(AIIO), which uses AI and its interpretation technology to diagnose I/O performance bottlenecks at the job level automatically. By considering the sparsity of I/O log files, employing multiple AI models for performance prediction, merging diagnosis results across multiple models, and generalizing its performance prediction and diagnosis functions, AIIO can accurately and robustly identify the bottleneck of an even unseen application. Experimental results show that real and unseen applications can use the diagnosis results from AIIO to improve their I/O performance by at most 146 times.

Dong, Bin↗

Baseflow Identification via Explainable AI With Kolmogorov‐Arnold Networks

Abstract Hydrological models often involve constitutive laws that may not be optimal in every application. We propose to replace such laws with the Kolmogorov‐Arnold networks (KANs), a class of neural networks designed to identify symbolic expressions. We demonstrate KAN's potential on the problem of baseflow identification, a notoriously challenging task plagued by significant uncertainty. KAN‐derived functional dependencies of the baseflow components on the aridity index outperform their original counterparts; they demonstrate that water availability, rather than potential evapotranspiration, drives baseflow by constraining actual evapotranspiration under arid conditions. On a test set, they increase the Nash‐Sutcliffe efficiency (NSE) by 65%, decrease the root mean squared error by 29%, and increase the Kling‐Gupta efficiency by 34%. This superior performance is achieved while reducing the number of fitting parameters from three to two. Next, we use data from 378 catchments across the continental United States to refine the water‐balance equation at the mean‐annual scale. The KAN‐derived equations based on the refined water balance outperform both the current aridity index model, with up to a 105% increase in NSE, and the KAN‐derived equations based on the original water balance. While the performance of our model and tree‐based machine learning methods is similar, KANs offer the advantage of simplicity and transparency and require no specific software or computational tools. This case study focuses on the aridity index formulation, but the approach is flexible and transferable to other hydrological processes. Plain Language Summary Equations used in hydrologic model are often suboptimal, resulting in reduced prediction accuracy and efficiency. We implemented Kolmogorov‐Arnold networks (KAN), a machine learning algorithm for deriving symbolic formulations, to estimate groundwater recharge and showed that it outperforms an existing state‐of‐the‐art semi‐empirical formulation. In hydrology, Nash‐Sutcliffe efficiency (NSE), root mean squared error (RMSE), and Kling‐Gupta efficiency (KGE) are commonly used to evaluate model performance. Higher NSE and KGE values indicate better performance, while lower RMSE values are preferable. Our results show that NSE increased by 71%, RMSE decreased by 32%, and KGE improved by 25%. In addition, KAN identifies an optimal functional form and can be used to derive new analytical formulas using the prior knowledge. The KAN‐inspired equation outperformed the original formulation and reduced the fitting parameters. Furthermore, we refined the water‐balance equation at the mean‐annual scale and showed that, based on the new water‐balance equation, KAN can derive new formulations that are superior to the original aridity index formulations (up to 105% increase in NSE) and KAN‐derived equations based on the original water balance. These findings highlight the significant potential of KAN to advance the scientific understanding of a wide range of hydrologic processes. Key Points Kolmogorov‐Arnold networks (KANs) enhance interpretability of machine‐learned hydrological models KAN‐derived symbolic formulations outperform state‐of‐the‐art semi‐empirical aridity indices KAN‐identified functional form yields an analytical index with fewer fitting parameters and improved performance

baseflow↗

Gravitational waves from binary neutron star mergers with a spectral equation of state

In numerical simulations of binary neutron star systems, the equation of state of the dense neutron star matter is an important factor in determining both the physical realism and the numerical accuracy of the simulations. Some equations of state used in simulations are C 2 or smoother in the pressure/density relationship function, such as a polytropic equation of state, but may not have the flexibility to model stars or remnants of different masses while keeping their radii within known astrophysical constraints. Other equations of state, such as tabular or piece-wise polytropic, may be flexible enough to model additional physics and multiple stars' masses and radii within known constraints, but are not as smooth, resulting in additional numerical error. We will study in this paper a recently developed family of equation of state, using a spectral expansion with sufficient free parameters to allow for a larger flexibility than current polytropic equations of state, and with sufficient smoothness to reduce numerical errors compared to tabulated or piece-wise polytropic equations of state. We perform simulations at three mass ratios with a common chirp mass, using two distinct spectral equations of state, and at multiple numerical resolutions. We evaluate the gravitational waves produced from these simulations, comparing the phase error between resolutions and equations of state, as well as with respect to analytical models. From our simulations we estimate that the phase difference at merger for binaries with a dimensionless weighted tidal deformability difference greater than Δ$\tilde{Λ}$=55 can be captured by the SpEC code for these equations of state.

79 ASTRONOMY AND ASTROPHYSICS↗

Benchmarking machine learning strategies for phase-field problems

Abstract We present a comprehensive benchmarking framework for evaluating machine-learning approaches applied to phase-field problems. This framework focuses on four key analysis areas crucial for assessing the performance of such approaches in a systematic and structured way. Firstly, interpolation tasks are examined to identify trends in prediction accuracy and accumulation of error over simulation time. Secondly, extrapolation tasks are also evaluated according to the same metrics. Thirdly, the relationship between model performance and data requirements is investigated to understand the impact on predictions and robustness of these approaches. Finally, systematic errors are analyzed to identify specific events or inadvertent rare events triggering high errors. Quantitative metrics evaluating the local and global description of the microstructure evolution, along with other scalar metrics representative of phase-field problems, are used across these four analysis areas. This benchmarking framework provides a path to evaluate the effectiveness and limitations of machine-learning strategies applied to phase-field problems, ultimately facilitating their practical application.

36 MATERIALS SCIENCE↗

Assessing the WRF-Solar Model Performance Using Satellite-Derived Irradiance from the National Solar Radiation Database

Abstract WRF-Solar is a numerical weather prediction model specifically designed to meet the increasing demand for accurate solar irradiance forecasting. The model provides flexibility in the representation of the aerosol–cloud–radiation processes. This flexibility can be argued to make it more difficult to improve the model’s performance because of the necessity of inspecting different configurations. To alleviate this situation, WRF-Solar has a reference configuration to use as a benchmark in sensitivity experiments. However, the scarcity of high-quality ground observations is a handicap to accurately quantify the model performance. An alternative to ground observations are satellite irradiance retrievals. Herein we analyze the adequacy of the National Solar Radiation Database (NSRDB) to validate the WRF-Solar performance using high-quality global horizontal irradiance (GHI) observations across the contiguous United States (CONUS). Based on the sufficient performance of NSRDB, we further analyze the WRF-Solar forecast errors across the CONUS, the growth of the forecasting errors as a function of the lead time, and sensitivities to the grid spacing and the representation of the radiative effects of unresolved clouds. Our results based on WRF-Solar forecasts spanning 2018 reveal a 7% median degradation of the mean absolute error (MAE) from the first to the second daytime period. Reducing the grid spacing from 9 to 3 km leads to a 4% improvement in the MAE, whereas activating the radiative effects of unresolved clouds is desirable over most of the CONUS even at 3 km of grid spacing. A systematic overestimation of the GHI is found. These results illustrate the potential of GHI retrievals to contribute to increasing the WRF-Solar performance.

14 SOLAR ENERGY↗

Impact of the Transformer Magnetizing Inductance on the Performance of the Dual-Active Bridge Converter

The magnetizing inductance of the high-frequency transformer in the dual-active bridge (DAB) converter is usually assumed to be much larger than its leakage inductance, thereby the magnetizing current can be negligible. However, ignoring the magnetizing current will lead to an error in the DAB converter design process. This paper analyzes the operation and performance of the DAB converter for a general case in which the transformer magnetizing inductance is taken into consideration. The analysis shows that the magnetizing inductance impacts the soft-switching region, the power transfer capability, and the leakage inductor current. A simulation case study is provided to verify the analysis. A DAB converter prototype is built to experimentally validate the analysis as well.

Yin, Shiyuan↗

Exploring Hilbert space on a budget: Novel benchmark set and performance metric for testing electronic structure methods in the regime of strong correlation

This work explores the ability of classical electronic structure methods to efficiently represent (compress) the information content of full configuration interaction (FCI) wave functions. We introduce a benchmark set of four hydrogen model systems of different dimensionalities and distinctive electronic structures: a 1D chain, a 1D ring, a 2D triangular lattice, and a 3D close-packed pyramid. To assess the ability of a computational method to produce accurate and compact wave functions, we introduce the accuracy volume, a metric that measures the number of variational parameters necessary to achieve a target energy error. Using this metric and the hydrogen models, we examine the performance of three classical deterministic methods: (i) selected configuration interaction (sCI) realized both via an a posteriori (ap-sCI) and variational selection of the most important determinants, (ii) an a posteriori singular value decomposition (SVD) of the FCI tensor (SVD-FCI), and (iii) the matrix product state representation obtained via the density matrix renormalization group (DMRG). We find that the DMRG generally gives the most efficient wave function representation for all systems, particularly in the 1D chain with a localized basis. For the 2D and 3D systems, all methods (except DMRG) perform best with a delocalized basis, and the efficiency of sCI and SVD-FCI is closer to that of DMRG. For larger analogs of the models, the DMRG consistently requires the fewest parameters but still scales exponentially in 2D and 3D systems, and the performance of SVD-FCI is essentially equivalent to that of ap-sCI.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

On the convergence of statistics in simulations of stationary incompressible turbulent flows

When reporting statistics from simulations of statistically stationary chaotic phenomenon, it is important to verify that the simulations are time-converged. This condition is connected with the statistical error or number of digits with which statistics can be reliably reported. In this work we consider numerical experiments of low Reynolds number incompressible homogeneous and isotropic turbulence as a model problem to investigate statistical convergence over finite simulation times. Specifically, we investigate the time integration requirements that allow meaningful reporting of the statistical error associated with finiteness of the temporal domain. We address two key questions: (1) How long should a simulation be performed in terms of large eddy time, and (2) How should the simulation time be divided among temporal windows over which a quantity of interest is estimated so that its statistical error could be reliably reported? We find that reliable reporting of statistical errors requires simulations on the order of 10 4 large eddy times, which is orders of magnitude longer than typically performed. Additionally, data post-processing should employ windows of at least ten times the large eddy time scale, with the most robust computation of statistical error of the mean requiring window sizes of an additional factor of ten. For practical simulations, we demonstrate that it is possible to estimate the statistical error within a factor of two under a less stringent condition in which a minimum of four windows with size at least ten large eddy times are used. In conclusion, our observations for homogeneous isotropic turbulence are also shown to hold in turbulent channel flow.

42 ENGINEERING↗

A Coupled Deep Learning Model for Estimating Surface NO 2 Levels from Remote Sensing Data: 15-Year Study Over the Contiguous United States

This study proposes a novel two-step deep learning (DL) model for estimating surface NO 2 concentrations using satellite data over the contiguous United States (CONUS) from 2005 to 2019. The first phase of the model uses partial convolutional neural network (PCNN), an advanced DL model that accurately imputes gaps between surface NO 2 stations and creates 5,478 daily-mean NO 2 grids (PCNN-NO 2 ) of the 2005-2019 period over the study area. We then feed the PCNN-NO 2 , along with other predictor variables, into a deep neural network (DNN) to estimate surface NO 2 levels, achieving exceptional performance with a correlation coefficient of 0.975 to 0.978, a mean absolute bias of 0.99 ppb to 1.38 ppb, and a root mean square error of 1.47 ppb to 1.97 ppb. Spatial cross-validation results also indicate strong spatial performance of PCNN-DNN surface NO 2 estimates. In addition to its accurate estimates, the PCNN-DNN model consistently generates estimated NO 2 grids without any missing values, improving the quality of various applications such as emission reduction strategies and public health studies. Between 2005 and 2019, the 5,478 daily estimated NO 2 grids over the CONUS reveal significant reductions in NO 2 levels in fourteen major urban environments: Washington D.C. (-43%), New York (-45%), Los Angeles (-38%), Chicago (-25%), Boston (-43%), Houston (-34%), Dallas (-40%), Philadelphia (-41%), Phoenix (-38%), Detroit (-20%), Denver (-23%), Atlanta (-0.7%), Cincinnati (-38%), and Pittsburgh (-56%). Furthermore, the study shows that the denser urban regions that in-situ stations are installed in, the higher the difference between in-situ observations and regional-mean NO 2 levels.

54 ENVIRONMENTAL SCIENCES↗

Preliminary Sensitivity Analysis for Sensors Impacts on Building Control Performance

This report describes the preliminary sensitivity analysis for sensor impacts on building control performance through the US Department of Energy’s Oak Ridge National Laboratory’s Flexible Research Platform (FRP-2) building. The rooftop unit system provides cooling and heating to the building. The main heating coil is a gas heating coil. Each zone is served by a variable air volume box with an electricity reheat coil. The rooftop unit and variable air volume box controls adopted the practical control sequences from ASHRAE Guideline 36-2018: High-Performance Sequences of Operation. For sensors, the incipient (time-changing) sensor errors, including bias sensor error and precision sensor error, are the inputs of interest. The outputs are energy consumption and thermal comfort (e.g., the predicted percentage of dissatisfied occupants). The large-scale simulation (3,600 cases) was conducted on a cloud platform by integrating sensor errors and ASHRAE Guideline 36 control sequences into an emulator based on the EnergyPlus simulation program with Python energy management system feature. The surrogate models were developed based on cloud simulation results. The uncertainty analysis showed that the sensor errors substantially affect building energy consumption and thermal comfort. The sensitivity analysis shows a ranking of sensor error impacts for each interested output item (e.g., cooling energy, reheat coil heating energy, predicted percentage of dissatisfied occupants). In FY 2022, sensor locations, types, and costs will be evaluated. The field test in Oak Ridge National Laboratory’s Flexible Research Platform building regarding sensor impacts will also be performed. Finally, a comparative analysis will be conducted based on the field test results and emulator results.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Quantum algorithms for geologic fracture networks

Abstract Solving large systems of equations is a challenge for modeling natural phenomena, such as simulating subsurface flow. To avoid systems that are intractable on current computers, it is often necessary to neglect information at small scales, an approach known as coarse-graining. For many practical applications, such as flow in porous, homogenous materials, coarse-graining offers a sufficiently-accurate approximation of the solution. Unfortunately, fractured systems cannot be accurately coarse-grained, as critical network topology exists at the smallest scales, including topology that can push the network across a percolation threshold. Therefore, new techniques are necessary to accurately model important fracture systems. Quantum algorithms for solving linear systems offer a theoretically-exponential improvement over their classical counterparts, and in this work we introduce two quantum algorithms for fractured flow. The first algorithm, designed for future quantum computers which operate without error, has enormous potential, but we demonstrate that current hardware is too noisy for adequate performance. The second algorithm, designed to be noise resilient, already performs well for problems of small to medium size (order 10–1000 nodes), which we demonstrate experimentally and explain theoretically. We expect further improvements by leveraging quantum error mitigation and preconditioning.

58 GEOSCIENCES↗

Performance Evaluations of Noisy Approximate Quantum Fourier Arithmetic

The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers, and offers a potential route towards a numerical quantum-computational paradigm. In this paper, we utilize efficient techniques to implement QFT-based integer addition and multiplications. These operations are fundamental to various quantum applications including Shor’s algorithm, weighted sum optimization problems in data processing and machine learning and quantum algorithms requiring inner products. We carry out performance evaluations of these implementations based on IBM’s superconducting qubit architecture using different compatible noise models. We isolate the sensitivity of the component quantum circuits on both one-/two-qubit gate error rates, and the number of the arithmetic operands’ superposed integer states. We analyze performance, and identify the most effective approximation depths for quantum add and quantum multiply within the given context. We observe significant dependency of the optimal approximation depth on the degree of machine noise and the number of superposed states in certain performance regimes. Finally, we elaborate on the algorithmic challenges - relevant to signed, unsigned, modular and non-modular versions - that could also be applied to current implementations of QFT-based subtraction, division, exponentiation, and their potential tensor extensions. Here, we analyze performance trends in our results and speculate on possible future development within this computational paradigm.

97 MATHEMATICS AND COMPUTING↗

Effects of machine learning errors on human decision-making: manipulations of model accuracy, error types, and error importance

Abstract This study addressed the cognitive impacts of providing correct and incorrect machine learning (ML) outputs in support of an object detection task. The study consisted of five experiments that manipulated the accuracy and importance of mock ML outputs. In each of the experiments, participants were given the T and L task with T-shaped targets and L-shaped distractors. They were tasked with categorizing each image as target present or target absent. In Experiment 1, they performed this task without the aid of ML outputs. In Experiments 2–5, they were shown images with bounding boxes, representing the output of an ML model. The outputs could be correct (hits and correct rejections), or they could be erroneous (false alarms and misses). Experiment 2 manipulated the overall accuracy of these mock ML outputs. Experiment 3 manipulated the proportion of different types of errors. Experiments 4 and 5 manipulated the importance of specific types of stimuli or model errors, as well as the framing of the task in terms of human or model performance. These experiments showed that model misses were consistently harder for participants to detect than model false alarms. In general, as the model’s performance increased, human performance increased as well, but in many cases the participants were more likely to overlook model errors when the model had high accuracy overall. Warning participants to be on the lookout for specific types of model errors had very little impact on their performance. Overall, our results emphasize the importance of considering human cognition when determining what level of model performance and types of model errors are acceptable for a given task.

97 MATHEMATICS AND COMPUTING↗

Classroom aerosol dispersion modeling: experimental assessment of a low-cost flow simulation tool

The purpose of this study was to assess the utility of a low-cost flow simulation tool for an indoor air modeling application by comparing its outputs with the results of a physical experiment, as well as those from a more advanced computational fluid dynamics (CFD) software package. In this study, five aerosol dispersion tests were performed in two different classrooms by releasing a CO 2 tracer gas from six student locations. Resultant steady-state concentrations were monitored at 13 locations around the periphery of the room. Subsequently, the experiments were modeled using both a low-cost tool (SolidWorks Flow Simulation) and a more sophisticated tool (STAR-CCM+). Models were evaluated based on their ability to predict the experimentally measured concentrations at the 13 monitoring locations by calculating four performance parameters commonly used in the evaluation of dispersion models: fractional mean bias (FB), normalized mean-square error (NMSE), fraction of predicted value within a factor of two (FAC2), and normalized absolute difference (NAD). The more sophisticated model performed better in 15 of the 20 possible cases (five tests at four parameters each), with parameters meeting acceptance criteria in 19 of 20 cases. However, the lower-cost tool was only slightly worse, with parameters meeting acceptance criteria in 18 of 20 cases, and it performed better than the other tool in 3 of 20 cases. Because it provides useful results at a fraction of the monetary and training cost and is already widely accessible to many institutions, such a tool may be worthwhile for many indoor aerosol dispersion applications, especially for students or researchers just beginning CFD modeling.

54 ENVIRONMENTAL SCIENCES↗