Search NASA⌕ Search

SEARCH · Search NASA

Results for “partitioned algorithm”

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 145 records · Page 8

Calculating the Symmetry Number of Flexible Sphere Clusters

We present a theoretical and computational framework to compute the symmetry number of a flexible sphere cluster in R 3 , using a definition of symmetry that arises naturally when calculating the equilibrium probability of a cluster of spheres in the sticky-sphere limit. We define the sticky symmetry group of the cluster as the set of permutations and inversions of the spheres which preserve adjacency and can be realized by continuous deformations of the cluster that do not change the set of contacts or cause particles to overlap. The symmetry number is the size of the sticky symmetry group. We introduce a numerical algorithm to compute the sticky symmetry group and symmetry number, and show it works well on several test cases. Furthermore, we show that once the sticky symmetry group has been calculated for indistinguishable spheres, the symmetry group for partially distinguishable spheres (those with nonidentical interactions) can be efficiently obtained without repeating the laborious parts of the computations. Finally, we use our algorithm to calculate the partition functions of every possible connected cluster of six identical sticky spheres, generating data that may be used to design interactions between spheres so they self-assemble into a desired structure.

97 MATHEMATICS AND COMPUTING↗

Optimization of Error-Bounded Lossy Compression for Hard-to-Compress HPC Data

Since today’s scientific applications are producing vast amounts of data, compressing them before storage/transmission is critical. Results of existing compressors show two types of HPC data sets: highly compressible and hard to compress. In this work, we carefully design and optimize the error-bounded lossy compression for hard-tocompress scientific data. We propose an optimized algorithm that can adaptively partition the HPC data into best-fit consecutive segments each having mutually close data values, such that the compression condition can be optimized. Another significant contribution is the optimization of shifting offset such that the XOR-leading-zero length between two consecutive unpredictable data points can be maximized. We finally devise an adaptive method to select the best-fit compressor at runtime for maximizing the compression factor. We evaluate our solution using 13 benchmarks based on real-world scientific problems, and we compare it with 9 other state-of-the-art compressors. Experiments show that our compressor can always guarantee the compression errors within the user-specified error bounds. Most importantly, our optimization can improve the compression factor effectively, by up to 49% for hard-tocompress data sets with similar compression/decompression time cost.

97 MATHEMATICS AND COMPUTING↗

UPS: Unified PMU-Data Storage System to Enhance T+D PMU Data Usability

The emerging distribution-level phasor measurement unit (D-PMU) is expected to play an important role in enhancing distribution system observability and situational-awareness. It is a demanding yet challenging task to develop advanced D-PMU data management and analytics tools to improve D-PMU data usability and further promote D-PMU projects deployment. This paper focuses on D-PMU data processing and storage. It presents a brief review of existing D-PMU data storage systems and points out their limitations on high-performance, flexibility, and scalability. To overcome the limitations, a unified PMU-data storage system (UPS) is proposed. Specifically, a unified I/O interface between storage servers and computing jobs is developed to effectively reduce the overhead of managing various computing jobs and data analytics over multiple storage infrastructures; and PMUCache with PMUCache partitioning and PMUCache replacement algorithms are designed to support in-situ data processing and shared distributed data storage and further serve the computing jobs/queries with different Quality of Service (QoS) requirements. Through a series of experiments, it is demonstrated that UPS achieves high performance on fast and big data processing and storage, and efficiently increases the flexibility and scalability of PMU data management systems.

42 ENGINEERING↗

SU-E-J-182: A Feasibility Study Evaluating Automatic Identification of Gross Tumor Volume for Breast Cancer Radiotherapy Using Dynamic Contrast-Enhanced MR Imaging

Purpose: To develop a computerized pharmacokinetic model-free Gross Tumor Volume (GTV) segmentation method based on dynamic contrastenhanced MRI (DCE-MRI) data that can improve physician GTV contouring efficiency. Methods: 12 patients with biopsy-proven early stage breast cancer with post-contrast enhanced DCE-MRI images were analyzed in this study. A fuzzy c-means (FCM) clustering-based method was applied to segment 3D GTV from pre-operative DCE-MRI data. A region of interest (ROI) is selected by a clinician/physicist, and the normalized signal evolution curves were calculated by dividing the signal intensity enhancement value at each voxel by the pre-contrast signal intensity value at the corresponding voxel. Three semi-quantitative metrics were analyzed based on normalized signal evolution curves: initial Area Under signal evolution Curve (iAUC), Immediate Enhancement Ratio (IER), and Variance of Enhancement Slope (VES). The FCM algorithm wass applied to partition ROI voxels into GTV voxels and non-GTV voxels by using three analyzed metrics. The partition map for the smaller cluster is then generated and binarized with an automatically calculated threshold. To reduce spurious structures resulting from background, a labeling operation was performed to keep the largest three-dimensional connected component as the identified target. Basic morphological operations including hole-filling and spur removal were useutilized to improve the target smoothness. Each segmented GTV was compared to that drawn by experienced radiation oncologists. An agreement index was proposed to quantify the overlap between the GTVs identified using two approaches and a thershold value of 0.4 is regarded as acceptable. Results: The GTVs identified by the proposed method were overlapped with the ones drawn by radiation oncologists in all cases, and in 10 out of 12 cases, the agreement indices were above the threshold of 0.4. Conclusion: The proposed automatic segmentation method was shown to be promising and might be used to improve physician contouring efficiency. J Horton receives grant from NIH and Varian Medical Systems; F-F Yin receives grant from Varian Medical Systems.

60 APPLIED LIFE SCIENCES↗

Aerosol Retrievals from ARM SGP MFRSR Data

The Multi-Filter Rotating Shadowband Radiometer (MFRSR) makes precise simultaneous measurements of the solar direct normal and diffuse horizontal irradiances at six wavelengths (nominally 415, 500, 615, 673, 870, and 940 nm) at short intervals (20 sec for ARM instruments) throughout the day. Time series of spectral optical depth are derived from these measurements. Besides water vapor at 940 nm, the other gaseous absorbers within the MFRSR channels are NO2 (at 415, 500, and 615 nm) and ozone (at 500, 615, and 670 nm). Aerosols and Rayleigh scattering contribute atmospheric extinction in all MFRSR channels. Our recently updated MFRSR data analysis algorithm allows us to partition the spectral aerosol optical depth into fine and coarse modes and to retrieve the fine mode effective radius. In this approach we rely on climatological amounts of NO2 from SCIAMACHY satellite retrievals and use daily ozone columns from TOMS.

54 ENVIRONMENTAL SCIENCES↗

Optimized replica gas estimation of absolute integrals and partition functions.

In contrast with most Monte Carlo integration algorithms, which are used to estimate ratios, the replica gas identities recently introduced by Adib enable the estimation of absolute integrals and partition functions using multiple copies of a system and normalized transition functions. Here, an optimized form is presented. After generalizing a replica gas identity with an arbitrary weighting function, we obtain a functional form that has the minimal asymptotic variance for samples from two replicas and is provably good for a larger number. This equation is demonstrated to improve the convergence of partition function estimates in a two-dimensional Ising model.

36 MATERIALS SCIENCE↗

Distributed memory parallel Markov random fields using graph partitioning

Markov random fields (MRF) based algorithms have attracted a large amount of interest in image analysis due to their ability to exploit contextual information about data. Image data generated by experimental facilities, though, continues to grow larger and more complex, making it more difficult to analyze in a reasonable amount of time. Applying image processing algorithms to large datasets requires alternative approaches to circumvent performance problems. Aiming to provide scientists with a new tool to recover valuable information from such datasets, we developed a general purpose distributed memory parallel MRF-based image analysis framework (MPI-PMRF). MPI-PMRF overcomes performance and memory limitations by distributing data and computations across processors. The proposed approach was successfully tested with synthetic and experimental datasets. Additionally, the performance of the MPI-PMRF framework is analyzed through a detailed scalability study. We show that a performance increase is obtained while maintaining an accuracy of the segmentation results higher than 98%. The contributions of this paper are: (a) development of a distributed memory MRF framework; (b) measurement of the performance increase of the proposed approach; (c) verification of segmentation accuracy in both synthetic and experimental, real-world datasets

97 MATHEMATICS AND COMPUTING↗

Spatial assignment of symmetry adapted perturbation theory interaction energy components: The atomic SAPT partition

We develop a physically-motivated assignment of symmetry adapted perturbation theory for intermolecular interactions (SAPT) into atom-pairwise contributions (the A-SAPT partition). The basic precept of A-SAPT is that the many-body interaction energy components are computed normally under the formalism of SAPT, following which a spatially-localized two-body quasiparticle interaction is extracted from the many-body interaction terms. For electrostatics and induction source terms, the relevant quasiparticles are atoms, which are obtained in this work through the iterative stockholder analysis (ISA) procedure. For the exchange, induction response, and dispersion terms, the relevant quasiparticles are local occupied orbitals, which are obtained in this work through the Pipek-Mezey procedure. The local orbital atomic charges obtained from ISA additionally allow the terms involving local orbitals to be assigned in an atom-pairwise manner. Further summation over the atoms of one or the other monomer allows for a chemically intuitive visualization of the contribution of each atom and interaction component to the overall noncovalent interaction strength. Herein, we present the intuitive development and mathematical form for A-SAPT applied in the SAPT0 approximation (the A-SAPT0 partition). We also provide an efficient series of algorithms for the computation of the A-SAPT0 partition with essentially the same computational cost as the corresponding SAPT0 decomposition. We probe the sensitivity of the A-SAPT0 partition to the ISA grid and convergence parameter, orbital localization metric, and induction coupling treatment, and recommend a set of practical choices which closes the definition of the A-SAPT0 partition. We demonstrate the utility and computational tractability of the A-SAPT0 partition in the context of side-on cation-π interactions and the intercalation of DNA by proflavine. A-SAPT0 clearly shows the key processes in these complicated noncovalent interactions, in systems with up to 220 atoms and 2845 basis functions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations

In this article, we focus on the communication costs of three symmetric matrix computations: (i) multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK) (ii) adding the result of the multiplication of a matrix with the transpose of another matrix and the transpose of that result, known as a symmetric rank-2k update (SYR2K) (iii) performing matrix multiplication with a symmetric input matrix (SYMM). All three computations appear in the Level 3 Basic Linear Algebra Subroutines (BLAS) and have wide use in applications involving symmetric matrices. We establish communication lower bounds for these kernels using sequential and distributed-memory parallel computational models, and we show that our bounds are tight by presenting communication-optimal algorithms for each setting. Our lower bound proofs rely on applying a geometric inequality for symmetric computations and analytically solving constrained nonlinear optimization problems. As a result, the symmetric matrix and its corresponding computations are accessed and performed according to a triangular block partitioning scheme in the optimal algorithms.

Al Daas, Hussam [Rutherford Appleton Laboratory, D↗

A biomimetic approach to fast selection of optimal controlled variables using multiagent algorithms and a decomposition approach

Selection of primary controlled variables (CVs) with due consideration of economic loss and ease of control is an important step for achieving optimal plant operation under design and off-design conditions. However, the computational expense of the combinatorial optimization step that is undertaken for CV selection renders the existing approaches unaffordable for fast selection of optimal CVs. Two approaches are proposed in this paper for improving the computational efficiency of the optimization step. Typically, the CV selection process is typically executed by considering the entire plant together. Opposed to that, the first approach proposed here seeks to decompose the process plant into multiple partitions based on the connectivity strength. Then the CV selection algorithm can be executed on each partition independently. The decomposition algorithm is biomimetic and has been developed, in analogy to neuroscience, mimicking how the information about the connectivity information is extracted using a dynamic casual model. This approach can significantly decrease the number of combinatorial optimization problems that needs to be solved and facilitates parallelization of the solution. In the second approach, a multiagent optimization framework is proposed that utilizes metaheuristic optimization strategies such as the efficient ant colony algorithm, simulated annealing and the genetic algorithm. These two approaches can be used by themselves or in combination. This framework enables cooperative search by a group of algorithmic agents facilitated through an information sharing protocol. These two approaches are applied to a toy problem and an acid gas removal unit as part of an integrated gasification combined cycle. This study shows how the computational time and economic and control performance of the optimal CV sets vary as the number of partitions are changed.

42 ENGINEERING↗

A massively parallel semi-Lagrangian algorithm for solving the transport equation

The scalar transport equation underpins many models employed in science, engineering, technology and business. Application areas include, but are not restricted to, pollution transport, weather forecasting, video analysis and encoding (the optical flow equation), options and stock pricing (the Black-Scholes equation) and spatially explicit ecological models. Unfortunately finding numerical solutions to this equation which are fast and accurate is not trivial. Moreover, finding such numerical algorithms that can be implemented on high performance computer architectures efficiently is challenging. In this paper the authors describe a massively parallel algorithm for solving the advection portion of the transport equation. We present an approach here which is different to that used in most transport models and which we have tried and tested for various scenarios. The approach employs an intelligent domain decomposition based on the vector field of the system equations and thus automatically partitions the computational domain into algorithmically autonomous regions. The solution of a classic pure advection transport problem is shown to be conservative, monotonic and highly accurate at large time steps. Additionally we demonstrate that the algorithm is highly efficient for high performance computer architectures and thus offers a route towards massively parallel application.

54 ENVIRONMENTAL SCIENCES↗

Graph Algorithms in PGAS: Chapel and UPC++

The Partitioned Global Address Space (PGAS) programming model can be implemented «««< HEAD either with programming language features or with runtime library APIs, each implementation favoring different aspects (e.g., productivity, abstraction, flexibility, or performance). Certain language and runtime features, such as collectives, explicit and asynchronous communication primitives, and constructs facilitating overlap of communication and computation (such as futures and conjoined futures) can enable better performance and scaling for irregular applications, in particular for distributed graph analytics. We compare graph algorithms in one of each of these environments: the Chapel PGAS programming language and the UPC++ PGAS runtime library. We implement algorithms for breadth-first search and triangle counting graph kernels in both environments. We discuss the code in each of the environments, and compile performance data on a Cray Aries and an Infiniband platform. Our results show that the library-based approach of UPC++ currently provides strong performance while Chapel provides a high-level abstraction that, harder to optimize, still provides comparable performance. We argue that various language primitives and runtime library features should be considered in conjunction with each other to design future graph analytics libraries so as to incorporate the best of both worlds.

Distributed Algorithms, Graph algorithms, HPC↗

OpenRBC: A Fast Simulator of Red Blood Cells at Protein Resolution

We present OpenRBC, a coarse-grained molecular dynamics code, which is capable of performing an unprecedented in silico experiment—simulating an entire mammal red blood cell lipid bilayer and cytoskeleton as modeled by multiple millions of mesoscopic particles—using a single shared memory commodity workstation. To achieve this, we invented an adaptive spatial-searching algorithm to accelerate the computation of short-range pairwise interactions in an extremely sparse three-dimensional space. The algorithm is based on a Voronoi partitioning of the point cloud of coarse-grained particles, and is continuously updated over the course of the simulation. The algorithm enables the construction of the key spatial searching data structure in our code, i.e., a lattice-free cell list, with a time and space cost linearly proportional to the number of particles in the system. The position and the shape of the cells also adapt automatically to the local density and curvature. The code implements OpenMP parallelization and scales to hundreds of hardware threads. It outperforms a legacy simulator by almost an order of magnitude in time-to-solution and >40 times in problem size, thus providing, to our knowledge, a new platform for probing the biomechanics of red blood cells.

Biophysics↗

Extraction of Hydrological Proximity Measures from DEMs using Parallel Processing

Land surface topography is one of the most important terrain properties which impact hydrological, geomorphological, and ecological processes active on a landscape. In our previous efforts to develop a soil depth model based upon topographic and land cover variables, we extracted a set of hydrological proximity measures (HPMs) from a Digital Elevation Model (DEM) as potential explanatory variables for soil depth. These HPMs may also have other, more general modeling applicability in hydrology, geomorphology and ecology, and so are described here from a general perspective. The HPMs we derived are variations of the distance up to ridge points (cells with no incoming flow) and variations of the distance down to stream points (cells with a contributing area greater than a threshold), following the flow path. These HPMs were computed using the D-infinity flow model that apportions flow between adjacent neighbors based on the direction of steepest downward slope on the eight triangular facets constructed in a 3 x 3 grid cell window using the center cell and each pair of adjacent neighboring grid cells in turn. The D-infinity model typically results in multiple flow paths between 2 points on the topography, with the result that distances may be computed as the minimum, maximum or average of the individual flow paths. In addition, each of the HPMs, are calculated vertically, horizontally, and along the land surface. Previously, these HPMs were calculated using recursive serial algorithms which suffered from stack overflow problems when used to process large datasets, limiting the size of DEMs that could be analyzed using that method to approximately 7000 x 7000 cells. To overcome this limitation, we developed a message passing interface (MPI) parallel approach for calculating these HPMs. The parallel algorithms of the HPMs spatially partition the input grid into stripes which are each assigned to separate processes for computation. Each of those processes then uses a queue data structure to order the processing of cells so that each cell is visited only once and the cross-process communications that are a standard part of MPI are handled in an efficient manner. This parallel approach allows analysis of much larger DEMs as compared to the serial recursive algorithms. In this paper, we present the definitions of the HPMs, the serial and parallel algorithms used in their extraction and their potential applications in hydrology, geomorphology and ecology.

54 ENVIRONMENTAL SCIENCES↗

Evaluating cloud retrieval algorithms with the ARM BBHRP framework

Climate and weather prediction models require accurate calculations of vertical profiles of radiative heating. Although heating rate calculations cannot be directly validated due to the lack of corresponding observations, surface and top-of-atmosphere measurements can indirectly establish the quality of computed heating rates through validation of the calculated irradiances at the atmospheric boundaries. The ARM Broadband Heating Rate Profile (BBHRP) project, a collaboration of all the working groups in the program, was designed with these heating rate validations as a key objective. Given the large dependence of radiative heating rates on cloud properties, a critical component of BBHRP radiative closure analyses has been the evaluation of cloud microphysical retrieval algorithms. This evaluation is an important step in establishing the necessary confidence in the continuous profiles of computed radiative heating rates produced by BBHRP at the ARM Climate Research Facility (ACRF) sites that are needed for modeling studies. This poster details the continued effort to evaluate cloud property retrieval algorithms within the BBHRP framework, a key focus of the project this year. A requirement for the computation of accurate heating rate profiles is a robust cloud microphysical product that captures the occurrence, height, and phase of clouds above each ACRF site. Various approaches to retrieve the microphysical properties of liquid, ice, and mixed-phase clouds have been processed in BBHRP for the ACRF Southern Great Plains (SGP) and the North Slope of Alaska (NSA) sites. These retrieval methods span a range of assumptions concerning the parameterization of cloud location, particle density, size, shape, and involve different measurement sources. We will present the radiative closure results from several different retrieval approaches for the SGP site, including those from Microbase, the current 'reference' retrieval approach in BBHRP. At the NSA, mixed-phase clouds and cloud with a low optical depth are prevalent; the radiative closure studies using Microbase demonstrated significant residuals. As an alternative to Microbase at NSA, the Shupe-Turner cloud property retrieval algorithm, aimed at improving the partitioning of cloud phase and incorporating more constrained, conditional microphysics retrievals, also has been evaluated using the BBHRP data set.

54 ENVIRONMENTAL SCIENCES↗

A numerical approach for simulating fluid structure interaction of flexible thin shells undergoing arbitrarily large deformations in complex domains

We present a new numerical methodology for simulating fluid–structure interaction (FSI) problems involving thin flexible bodies in an incompressible fluid. The FSI algorithm uses the Dirichlet–Neumann partitioning technique. The curvilinear immersed boundary method (CURVIB) is coupled with a rotation-free finite element (FE) model for thin shells enabling the efficient simulation of FSI problems with arbitrarily large deformation. Turbulent flow problems are handled using large-eddy simulation with the dynamic Smagorinsky model in conjunction with a wall model to reconstruct boundary conditions near immersed boundaries. The CURVIB and FE solvers are coupled together on the flexible solid–fluid interfaces where the structural nodal positions, displacements, velocities and loads are calculated and exchanged between the two solvers. Loose and strong coupling FSI schemes are employed enhanced by the Aitken acceleration technique to ensure robust coupling and fast convergence especially for low mass ratio problems. The coupled CURVIB-FE-FSI method is validated by applying it to simulate two FSI problems involving thin flexible structures: 1) vortex-induced vibrations of a cantilever mounted in the wake of a square cylinder at different mass ratios and at low Reynolds number; and 2) the more challenging high Reynolds number problem involving the oscillation of an inverted elastic flag. For both cases the computed results are in excellent agreement with previous numerical simulations and/or experiential measurements. Grid convergence tests/studies are carried out for both the cantilever and inverted flag problems, which show that the CURVIB-FE-FSI method provides their convergence. Finally, the capability of the new methodology in simulations of complex cardiovascular flows is demonstrated by applying it to simulate the FSI of a tri-leaflet, prosthetic heart valve in an anatomic aorta and under physiologic pulsatile conditions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The surface-atmosphere exchange of carbon dioxide in tropical rainforests: Sensitivity to environmental drivers and flux measurement methodology

Tropical rainforests play a central role in the Earth system by regulating climate, maintaining biodiversity, and sequestering carbon. They are under threat by direct anthropogenic impacts like deforestation and the indirect anthropogenic impacts of climate change. A synthesis of the factors that determine the net ecosystem exchange of carbon dioxide (NEE) at the site scale across different forests in the tropical rainforest biome has not been undertaken to date. Here, we study NEE and its components, gross ecosystem productivity (GEP) and ecosystem respiration (RE), across thirteen natural and managed forests within the tropical rainforest biome with 63 total site-years of eddy covariance data. Our results reveal that the five ecosystems with the largest annual gross carbon uptake by photosynthesis (i.e. GEP > 3000 g C m -2 y -1 ) have the lowest net carbon uptake – or even carbon losses – versus other study ecosystems because RE is of a similar magnitude. Sites that provided subcanopy CO 2 storage observations had higher average magnitudes of GEP and RE and lower average magnitudes of NEE, highlighting the importance of measurement methodology for understanding carbon dynamics in ecosystems with characteristically tall and dense vegetation. A path analysis revealed that vapor pressure deficit (VPD) played a greater role than soil moisture or air temperature in constraining GEP under light saturated conditions across most study sites, but to differing degrees from -0.31 to -0.87 μmol CO 2 m -2 s -1 hPa -1 . Climate projections from 13 general circulation models (CMIP5) under the representative concentration pathway that generates 8.5 W m -2 of radiative forcing suggest that many current tropical rainforest sites on the lower end of the current temperature range are likely to reach a climate space similar to present-day warmer sites by the year 2050, warmer sites will reach a climate not currently experienced, and all forests are likely to experience higher VPD. Results demonstrate the need to quantify if and how mature tropical trees acclimate to heat and water stress, and to further develop flux-partitioning and gap-filling algorithms for defensible estimates of carbon exchange in tropical rainforests.

54 ENVIRONMENTAL SCIENCES↗

Model for Simulating Aerosol Interactions and Chemistry (MOSAIC)

This paper describes the development and evaluation of a new Model for Simulating Aerosol Interactions and Chemistry (MOSAIC), with a special focus on addressing the long-standing issues associated with solving the dynamic partitioning of semi-volatile inorganic gases (HNO3, HCl, and NH3) to size-distributed atmospheric aerosol particles. The coupled ordinary differential equations (ODE) for dynamic gas-particle mass transfer are extremely stiff, and the available numerical techniques are either too expensive or produce oscillatory and/or inaccurate steady-state solutions. These limitations are overcome in MOSAIC, which couples an accurate and computationally efficient thermodynamic module [Zaveri et al., 2005a,b] with a new dynamic gas-particle partitioning module described here. The algorithm involves time-split integrations of non-volatile and semi-volatile species, and a new concept of “dynamic pH” and an adaptive time-stepping scheme hold the key to smooth, accurate, and efficient solutions over the entire relative humidity range. MOSAIC is found to be in excellent agreement with a benchmark version of the model that uses LSODES (a Gear solver) for rigorously integrating the stiff ODEs. The steady-state MOSAIC results for monodisperse aerosol test cases are also in excellent agreement with those obtained with the benchmark equilibrium model AIM. MOSAIC is also evaluated within a 3-D model, and the average CPU speed is estimated to be over 100 times faster than the dynamic aerosol model MADM [Pilinis et al., 2000]. These results suggest that MOSAIC is highly attractive for use in 3-D aerosol and air quality models in which both accuracy and efficiency are critically important.

54 ENVIRONMENTAL SCIENCES↗