Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “sampling 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 775 records · Page 43

RECONSTRUCTING THE ACCRETION HISTORY OF THE GALACTIC STELLAR HALO FROM CHEMICAL ABUNDANCE RATIO DISTRIBUTIONS

Observational studies of halo stars during the past two decades have placed some limits on the quantity and nature of accreted dwarf galaxy contributions to the Milky Way (MW) stellar halo by typically utilizing stellar phase-space information to identify the most recent halo accretion events. In this study we tested the prospects of using 2D chemical abundance ratio distributions (CARDs) found in stars of the stellar halo to determine its formation history. First, we used simulated data from 11 “MW-like” halos to generate satellite template sets (STSs) of 2D CARDs of accreted dwarf satellites, which are composed of accreted dwarfs from various mass regimes and epochs of accretion. Next, we randomly drew samples of ∼10{sup 3–4} mock observations of stellar chemical abundance ratios ([α/Fe], [Fe/H]) from those 11 halos to generate samples of the underlying densities for our CARDs to be compared to our templates in our analysis. Finally, we used the expectation-maximization algorithm to derive accretion histories in relation to the STS used and the sample size. For certain STSs used we typically can identify the relative mass contributions of all accreted satellites to within a factor of two. We also find that this method is particularly sensitive to older accretion events involving low-luminosity dwarfs, e.g., ultra-faint dwarfs—precisely those events that are too ancient to be seen by phase-space studies of stars and too faint to be seen by high-z studies of the early universe. Since our results only exploit two chemical dimensions and near-future surveys promise to provide ∼6–9 dimensions, we conclude that these new high-resolution spectroscopic surveys of the stellar halo will allow us to recover its accretion history—and the luminosity function of infalling dwarf galaxies—across cosmic time.

79 ASTRONOMY AND ASTROPHYSICS↗

Ultra-small-angle neutron scattering with azimuthal asymmetry

Small-angle neutron scattering (SANS) measurements from thin sections of rock samples such as shales demand as great a scattering vector range as possible because the pores cover a wide range of sizes. The limitation of the scattering vector range for pinhole SANS requires slit-smeared ultra-SANS (USANS) measurements that need to be converted to pinhole geometry. The desmearing algorithm is only successful for azimuthally symmetric data. Scattering from samples cut parallel to the plane of bedding is symmetric, exhibiting circular contours on a two-dimensional detector. Samples cut perpendicular to the bedding show elliptically dependent contours with the long axis corresponding to the normal to the bedding plane. A method is given for converting such asymmetric data collected on a double-crystal diffractometer for concatenation with the usual pinhole-geometry SANS data. Furthermore, the aspect ratio from the SANS data is used to modify the slit-smeared USANS data to produce quasi-symmetric contours. Rotation of the sample about the incident beam may result in symmetric data but cannot extract the same information as obtained from pinhole geometry.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Random On-Board Pixel Sampling (ROPS) X-Ray Camera

Recent advances in compressed sensing theory and algorithms offer new possibilities for high-speed X-ray camera design. In many CMOS cameras, each pixel has an independent on-board circuit that includes an amplifier, noise rejection, signal shaper, an analog-to-digital converter (ADC), and optional in-pixel storage. When X-ray images are sparse, i.e., when one of the following cases is true: (a.) The number of pixels with true X-ray hits is much smaller than the total number of pixels; (b.) The X-ray information is redundant; or (c.) Some prior knowledge about the X-ray images exists, sparse sampling may be allowed. Here we first illustrate the feasibility of random on-board pixel sampling (ROPS) using an existing set of X-ray images, followed by a discussion about signal to noise as a function of pixel size. Next, we describe a possible circuit architecture to achieve random pixel access and in-pixel storage. The combination of a multilayer architecture, sparse on-chip sampling, and computational image techniques, is expected to facilitate the development and applications of high-speed X-ray camera technology.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Implementation and Comparison of Different Algorithms for on the fly Doppler Broadening in RMC Code

Accurate cross sections are of great importance to Monte Carlo particle transport calculation codes which use pointwise cross sections. It is well known that cross sections have much dependence on temperature on account of Doppler effect which is particularly vital for resonance absorption cross sections. In general, pre-prepared continuous-energy libraries are used in Monte Carlo codes, which is feasible in many applications. However, in multi-physics calculations where neutronics and thermal hydraulics are coupled, cross sections at a fine interval of temperatures are desired, which brings a great challenge to computer memory. Consequently, different methods about on the fly Doppler broadening for cross sections are proposed, which can generate cross sections at the specific temperature points during neutron simulations. These methods can be roughly classified into two categories: one is to calculate the required cross sections by different algorithms, such as interpolation using a high order function expansion, multipole representation, and different integration algorithms based on Doppler broadening equation. The other, for instance, target motion sampling (TMS), does not calculate the Doppler broadening cross sections but takes into account Doppler effect by rejection technique. In this paper, several on the fly Doppler broadening algorithms based on Doppler broadening equation are implemented in the Reactor Monte Carlo code RMC, and then the accuracy and efficiency are discussed and compared. In this paper, several algorithms for on the fly Doppler broadening based on Doppler broadening equation have been implemented in RMC and the focus falls on the comparison of the Gauss Legendre quadrature and Gauss Hermite quadrature. Gauss Legendre quadrature is more accurate than Gauss Hermite quadrature but also more time consuming. Base temperature has a significant impact on Gauss Hermite quadrature while increasing base temperature to room temperature (300 K) can give satisfactory results. In addition, the proportion of overhead of Doppler broadening treatment in total computational time tends to decrease with an increase number of nuclides in fuel. For depletion calculation, both algorithms are in good agreement with reference and the relative errors of K{sub inf} are within 5 times of standard deviation. As for total computational time, the ratio between Gauss Legendre quadrature or Gauss Hermite quadrature and reference decreases and reaches 9.6 or 3.4 at last, respectively. Four important isotopes are chosen to compare the atom density and all relative errors are within 0.25%. After comparisons of different algorithms and different base temperatures, it can be found that Gauss Hermite quadrature broadening from 300 K can perform on the fly cross section Doppler broadening with least total computational time and acceptable precision. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Using compressive sensing to recover images from PET scanners with partial detector rings

Purpose: Most positron emission tomography/computed tomography (PET/CT) scanners consist of tightly packed discrete detector rings to improve scanner efficiency. The authors’ aim was to use compressive sensing (CS) techniques in PET imaging to investigate the possibility of decreasing the number of detector elements per ring (introducing gaps) while maintaining image quality. Methods: A CS model based on a combination of gradient magnitude and wavelet domains (wavelet-TV) was developed to recover missing observations in PET data acquisition. The model was designed to minimize the total variation (TV) and L1-norm of wavelet coefficients while constrained by the partially observed data. The CS model also incorporated a Poisson noise term that modeled the observed noise while suppressing its contribution by penalizing the Poisson log likelihood function. Three experiments were performed to evaluate the proposed CS recovery algorithm: a simulation study, a phantom study, and six patient studies. The simulation dataset comprised six disks of various sizes in a uniform background with an activity concentration of 5:1. The simulated image was multiplied by the system matrix to obtain the corresponding sinogram and then Poisson noise was added. The resultant sinogram was masked to create the effect of partial detector removal and then the proposed CS algorithm was applied to recover the missing PET data. In addition, different levels of noise were simulated to assess the performance of the proposed algorithm. For the phantom study, an IEC phantom with six internal spheres each filled with F-18 at an activity-to-background ratio of 10:1 was used. The phantom was imaged twice on a RX PET/CT scanner: once with all detectors operational (baseline) and once with four detector blocks (11%) turned off at each of 0 °, 90 °, 180 °, and 270° (partially sampled). The partially acquired sinograms were then recovered using the proposed algorithm. For the third test, PET images from six patient studies were investigated using the same strategy of the phantom study. The recovered images using WTV and TV as well as the partially sampled images from all three experiments were then compared with the fully sampled images (the baseline). Comparisons were done by calculating the mean error (%bias), root mean square error (RMSE), contrast recovery (CR), and SNR of activity concentration in regions of interest drawn in the background as well as the disks, spheres, and lesions. Results: For the simulation study, the mean error, RMSE, and CR for the WTV (TV) recovered images were 0.26% (0.48%), 2.6% (2.9%), 97% (96%), respectively, when compared to baseline. For the partially sampled images, these results were 22.5%, 45.9%, and 64%, respectively. For the simulation study, the average SNR for the baseline was 41.7 while for WTV (TV), recovered image was 44.2 (44.0). The phantom study showed similar trends with 5.4% (18.2%), 15.6% (18.8%), and 78% (60%), respectively, for the WTV (TV) images and 33%, 34.3%, and 69% for the partially sampled images. For the phantom study, the average SNR for the baseline was 14.7 while for WTV (TV) recovered image was 13.7 (11.9). Finally, the average of these values for the six patient studies for the WTV-recovered, TV, and partially sampled images was 1%, 7.2%, 92% and 1.3%, 15.1%, 87%, and 27%, 25.8%, 45%, respectively. Conclusions: CS with WTV is capable of recovering PET images with good quantitative accuracy from partially sampled data. Such an approach can be used to potentially reduce the cost of scanners while maintaining good image quality.

60 APPLIED LIFE SCIENCES↗

Particle filtering with path sampling and an application to a bimodal ocean current model

This paper introduces a recursive particle filtering algorithm designed to filter high dimensional systems with complicated non-linear and non-Gaussian effects. The method incorporates a parallel marginalization (PMMC) step in conjunction with the hybrid Monte Carlo (HMC) scheme to improve samples generated by standard particle filters. Parallel marginalization is an efficient Markov chain Monte Carlo (MCMC) strategy that uses lower dimensional approximate marginal distributions of the target distribution to accelerate equilibration. As a validation the algorithm is tested on a 2516 dimensional, bimodal, stochastic model motivated by the Kuroshio current that runs along the Japanese coast. The results of this test indicate that the method is an attractive alternative for problems that require the generality of a particle filter but have been inaccessible due to the limitations of standard particle filtering strategies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Laser-Induced Spectrochemical Assay for Uranium Enrichment (LISA-UE)

Uranium hexafluoride (UF6) is the uranium compound typically involved in uranium enrichment process. As the first line of defense against nuclear proliferation, accurate determinations of the uranium enrichment ratio in UF6 are critical for materials verification, accounting and safeguards. Shipping gaseous UF6 samples off-site for analysis with mass spectrometry is cumbersome and costly, and results are not available for some time (months). In-field UF6 enrichment assay has the potential to substantially reduce the time, logistics and expense of sample handling. At present, COMPUCEA is the only accepted method for UF6 enrichment assay in the field. Laser-Induced Spectrochemical Assay for Uranium Enrichment (LISA-UE) is an all-optical (based on laser induced plasma emission) analytical technique intended for fieldable, accurate, precise and rapid UF6 enrichment assay. In its operation, laser induced plasma is created directly in the gaseous UF6 sample. Because different U isotopes emit at slightly different wavelengths, the isotopic information of the UF6 sample is inherently encoded in the atomic emission from the plasma. Isotopic emissions from 235U and 238U are measured simultaneously, which eliminate correlated noise from the laser induced plasma. Isotopic information of the UF6 sample can be extracted from the acquired spectrum with theoretical multi-variable non-linear spectral fitting. To date, advances made by the LISA-UE research team include optimization of the spectral window for direct gaseous UF6 enrichment assay with laser induced plasma, development of data reduction algorithms, and demonstrations of the LISA-UE technique with gaseous UF6 samples. In this presentation, the technical aspect of LISA-UE will be overviewed, the data reduction algorithm will be described, and performance of the technique will be discussed.

Chan, George↗

Fast algorithms for nonconvex compression sensing: MRI reconstruction from very few data

Compressive sensing is the reconstruction of sparse images or signals from very few samples, by means of solving a tractable optimization problem. In the context of MRI, this can allow reconstruction from many fewer k-space samples, thereby reducing scanning time. Previous work has shown that nonconvex optimization reduces still further the number of samples required for reconstruction, while still being tractable. In this work, we extend recent Fourier-based algorithms for convex optimization to the nonconvex setting, and obtain methods that combine the reconstruction abilities of previous nonconvex approaches with the computational speed of state-of-the-art convex methods.

99 GENERAL AND MISCELLANEOUS↗

Expectation-maximization algorithms for learning a finite mixture of univariate survival time distributions from partially specified class values

Heterogeneity exists on a data set when samples from di erent classes are merged into the data set. Finite mixture models can be used to represent a survival time distribution on heterogeneous patient group by the proportions of each class and by the survival time distribution within each class as well. The heterogeneous data set cannot be explicitly decomposed to homogeneous subgroups unless all the samples are precisely labeled by their origin classes; such impossibility of decomposition is a barrier to overcome for estimating nite mixture models. The expectation-maximization (EM) algorithm has been used to obtain maximum likelihood estimates of nite mixture models by soft-decomposition of heterogeneous samples without labels for a subset or the entire set of data. In medical surveillance databases we can find partially labeled data, that is, while not completely unlabeled there is only imprecise information about class values. In this study we propose new EM algorithms that take advantages of using such partial labels, and thus incorporate more information than traditional EM algorithms. We particularly propose four variants of the EM algorithm named EM-OCML, EM-PCML, EM-HCML and EM-CPCML, each of which assumes a specific mechanism of missing class values. We conducted a simulation study on exponential survival trees with five classes and showed that the advantages of incorporating substantial amount of partially labeled data can be highly signi cant. We also showed model selection based on AIC values fairly works to select the best proposed algorithm on each specific data set. A case study on a real-world data set of gastric cancer provided by Surveillance, Epidemiology and End Results (SEER) program showed a superiority of EM-CPCML to not only the other proposed EM algorithms but also conventional supervised, unsupervised and semi-supervised learning algorithms.

97 MATHEMATICS AND COMPUTING↗

Detailed modeling of fission with F R E Y A

For many years, the state of the art for treating fission in radiation transport codes has involved sampling from average distributions. However, such “average” fission models have limited interaction-by-interaction capabilities. Energy is not explicitly conserved and no correlations are available because all particles are emitted isotropically and independently. However, in a true fission event, the energies, momenta and multiplicities of emitted particles are correlated. Such correlations are interesting for many modern applications, including detector development and detection of small amounts of special material. Recently, several Monte Carlo codes have become available that calculate complete fission events. Event-by-event techniques are particularly useful because it is possible to obtain the fission products as well as the prompt neutrons and photons emitted during an individual fission process, all with complete kinematic information. It is therefore possible to extract any desired correlation observables. Such codes, when included in broader Monte Carlo transport codes, such as MCNP, can be made broadly available to the community. One such code, FREYA (Fission Reaction Event Yield Algorithm), is particularly fast and can readily generate large samples of complete fission events. We briefly describe here the physics in FREYA and compare our results with relevant available data on prompt neutron and photon emission. We discuss correlated measurements in particular for validation.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

An improved phase shift reconstruction algorithm of fringe scanning technique for X-ray microscopy

The X-ray phase imaging method has been applied to observe soft biological tissues, and it is possible to image the soft tissues by using the benefit of the so-called “Talbot effect” by an X-ray grating. One type of the X-ray phase imaging method was reported by combining an X-ray imaging microscope equipped by a Fresnel zone plate with a phase grating. Using the fringe scanning technique, a high-precision phase shift image could be obtained by displacing the grating step by step and measuring dozens of sample images. The number of the images was selected to reduce the error caused by the non-sinusoidal component of the Talbot self-image at the imaging plane. A larger number suppressed the error more but increased radiation exposure and required higher mechanical stability of equipment. In this paper, we analyze the approximation error of fringe scanning technique for the X-ray microscopy which uses just one grating and proposes an improved algorithm. We compute the approximation error by iteration and substitute that into the process of reconstruction of phase shift. This procedure will suppress the error even with few sample images. The results of simulation experiments show that the precision of phase shift image reconstructed by the proposed algorithm with 4 sample images is almost the same as that reconstructed by the conventional algorithm with 40 sample images. We also have succeeded in the experiment with real data.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Coherent x-ray diffraction imaging of paint pigmentparticles by scanning a phase plate modulator

We have implemented a coherent x-ray diffraction imaging technique that scans a phase plate to modulate wave-fronts of the x-ray beam transmitted by samples. The method was applied to measure a decorative alkyd paint containing iron oxide red pigment particles. By employing an iterative algorithm for wave-front modulation phase retrieval, we obtained an image of the paint sample that shows the distribution of the pigment particles and is consistent with the result obtained from a transmission x-ray microscope. The technique has been experimentally proven to be a feasible coherent x-ray imaging method with about 120 nm spatial resolution and was shown to work well with industrially relevant specimens.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

TH-CD-206-01: Expectation-Maximization Algorithm-Based Tissue Mixture Quantification for Perfusion MRI

Purpose: To investigate the feasibility of estimating the tissue mixture perfusions and quantifying cerebral blood flow change in arterial spin labeled (ASL) perfusion MR images. Methods: The proposed perfusion MR image analysis framework consists of 5 steps: (1) Inhomogeneity correction was performed on the T1- and T2-weighted images, which are available for each studied perfusion MR dataset. (2) We used the publicly available FSL toolbox to strip off the non-brain structures from the T1- and T2-weighted MR images. (3) We applied a multi-spectral tissue-mixture segmentation algorithm on both T1- and T2-structural MR images to roughly estimate the fraction of each tissue type - white matter, grey matter and cerebral spinal fluid inside each image voxel. (4) The distributions of the three tissue types or tissue mixture across the structural image array are down-sampled and mapped onto the ASL voxel array via a co-registration operation. (5) The presented 4-dimensional expectation-maximization (4D-EM) algorithm takes the down-sampled three tissue type distributions on perfusion image data to generate the perfusion mean, variance and percentage images for each tissue type of interest. Results: Experimental results on three volunteer datasets demonstrated that the multi-spectral tissue-mixture segmentation algorithm was effective to initialize tissue mixtures from T1- and T2-weighted MR images. Compared with the conventional ASL image processing toolbox, the proposed 4D-EM algorithm not only generated comparable perfusion mean images, but also produced perfusion variance and percentage images, which the ASL toolbox cannot obtain. It is observed that the perfusion contribution percentages may not be the same as the corresponding tissue mixture volume fractions estimated in the structural images. Conclusion: A specific application to brain ASL images showed that the presented perfusion image analysis method is promising for detecting subtle changes in tissue perfusions, which is valuable for the early diagnosis of certain brain diseases, e.g. multiple sclerosis.

60 APPLIED LIFE SCIENCES↗

Adaptive local learning in sampling based motion planning for protein folding

Background: Simulating protein folding motions is an important problem in computational biology. Motion planning algorithms, such as Probabilistic Roadmap Methods, have been successful in modeling the folding landscape. Probabilistic Roadmap Methods and variants contain several phases (i.e., sampling, connection, and path extraction). Most of the time is spent in the connection phase and selecting which variant to employ is a difficult task. Global machine learning has been applied to the connection phase but is inefficient in situations with varying topology, such as those typical of folding landscapes. Results: We develop a local learning algorithm that exploits the past performance of methods within the neighborhood of the current connection attempts as a basis for learning. It is sensitive not only to different types of landscapes but also to differing regions in the landscape itself, removing the need to explicitly partition the landscape. We perform experiments on 23 proteins of varying secondary structure makeup with 52–114 residues. We compare the success rate when using our methods and other methods. We demonstrate a clear need for learning (i.e., only learning methods were able to validate against all available experimental data) and show that local learning is superior to global learning producing, in many cases, significantly higher quality results than the other methods. Conclusions: We present an algorithm that uses local learning to select appropriate connection methods in the context of roadmap construction for protein folding. Our method removes the burden of deciding which method to use, leverages the strengths of the individual input methods, and it is extendable to include other future connection methods.

Mathematical & Computational Biology↗

Field validation of data-driven BSDF and peak extraction models for light-scattering fabric shades

Shading and daylighting systems affect cooling, heating, and lighting energy use by modulating solar radiation through the building façade. Characterizing shading systems holistically and accurately helps designers and engineers evaluate shading systems to achieve energy and non-energy performance goals. These complex fenestration systems can be modeled using Bidirectional Scattering Distribution Functions (BSDF), which map incident radiation to hemispherical distributions of outgoing radiation. Data-driven, tabulated BSDFs are derived from interpolated goniophotometer measured data, then sampled during the raytracing calculation. A peak extraction (PE) algorithm was developed to circumvent limits in BSDF angular resolution, where the specular peak is extracted during simulation by evaluating the BSDF in the through direction and surrounding region. The objective of this study was to validate this measurement and modeling workflow using field monitored data from a full scale testbed with eleven installed fabrics of different weaves, openness factors, and colors and assess the accuracy of the workflow under different adaptation and contrast conditions. Test conditions were limited to clear sky conditions with the sun in the field of view. Results showed that, for tensor tree datasets, vertical illuminance, solar luminance (2.5° apex), and daylight glare probability (DGP) were predicted to within a mean bias error (MBE) error of -456 lx (-12.3%), -3.46e5 (-38.4%), and -0.042 (-7.8%) when full PE occurred. With a binary classification of glare/ no glare, DGP was predicted accurately with a true positive rate of 0.98 and true negative rate of 1.0 using tensor tree data and less accurately with Klems BSDF data, particularly for cases of no glare. The workflow may be of insufficient accuracy to distinguish borderline performance between fabrics using the four-point glare scale, particularly under low adaptation, high contrast daylit conditions. Errors were due to reductions in peak shape and intensity across the BSDF interpolation and data reduction workflow. Future work is needed to better preserve measurement fidelity during interpolation and sampling, which in turn will improve PE performance.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Bayesian inverse modeling of the atmospheric transport and emissions of a controlled tracer release from a nuclear power plant

Probability distribution functions (PDFs) of model inputs that affect the transport and dispersion of a trace gas released from a coastal California nuclear power plant are quantified using ensemble simulations, machine-learning algorithms, and Bayesian inversion. The PDFs are constrained by observations of tracer concentrations and account for uncertainty in meteorology, transport, diffusion, and emissions. Meteorological uncertainty is calculated using an ensemble of simulations of the Weather Research and Forecasting (WRF) model that samples five categories of model inputs (initialization time, boundary layer physics, land surface model, nudging options, and reanalysis data). The WRF output is used to drive tens of thousands of FLEXPART dispersion simulations that sample a uniform distribution of six emissions inputs. Machine-learning algorithms are trained on the ensemble data and used to quantify the sources of ensemble variability and to infer, via inverse modeling, the values of the 11 model inputs most consistent with tracer measurements. We find a substantial ensemble spread in tracer concentrations (factors of 10 to 10 3 ), most of which is due to changing emissions inputs (about 80%), though the cumulative effects of meteorological variations are not negligible. The performance of the inverse method is verified using synthetic observations generated from arbitrarily selected simulations. When applied to measurements from a controlled tracer release experiment, the inverse method satisfactorily determines the location, start time, duration and amount. In a 2 km × 2 km area of possible locations, the actual location is determined to within 200m. The start time is determined to within 5min out of 2h, and the duration to within 50min out of 4h. Over a range of release amounts of 10 to 1000kg, the estimated amount exceeds the actual amount of 146kg by only 32kg. The inversion also estimates probabilities of different WRF configurations. In conclusion, to best match the tracer observations, the highest-probability cases in WRF are associated with using a late initialization time and specific reanalysis data products.

54 ENVIRONMENTAL SCIENCES↗

Transportation Modeling and Global Health

A patient in the United States has been diagnosed with Ebola. Fear and panic kicks in across the country, and hospitals are inundated with hundreds of people, some infected with the highly contagious disease and others not. Blood tests are needed for positive diagnoses, but the diagnostic labs are overwhelmed with blood samples to test, and staff are overworked and stressed. Infected people need to be quarantined and treated, but it's hard to find rooms to quarantine so many patients. Sick people who need triage and regular care for other emergencies are afraid to go to hospitals for fear of Ebola, which has a 50% fatality rate. And since hospitals are so overwhelmed, sick people often stay home, infecting heathy people around them; the U.S. is now in the grips a full-blown Ebola outbreak. Sandia's high-performance computers simulated such a nightmare scenario recently, and with good reason. An Ebola outbreak in the United States could be devastating if hospitals are not prepared. When an Ebola outbreak in West Africa became a global concern in 2014, health advisers were alarmed at the length of time it took to properly diagnose infected people. In rural areas in Liberia, for example, blood samples from ailing people would be sent to a laboratory for testing, but the closest lab was hundreds of miles away through difficult and sometimes impassable roads. In more urban areas, blood samples would be sent to nearby labs, but those labs were often already overburdened by the sheer volume of samples to test. Staff at some treatment centers were unaware that a lab a little farther away might have the capacity to take in more samples. Meanwhile, undiagnosed infected people were unknowingly spreading the disease to many others around them, worsening the outbreak. The U.S. Defense Threat Reduction Agency (DTRA) and Centers for Disease Control and Prevention (CDC) posed a serious question: how do we improve blood-sample transportation routes in Liberia to ensure that samples taken from ill people are tested as quickly as possible, ensuring a proper diagnosis and faster treatment? Sandia scientists, already experts in transportation modeling for nuclear materials, quickly swarmed on this problem. The Sandia Ebola response team immediately set out to collect data from the region using available maps and local information, and transformed the raw data to GIS maps. Then, applying Sandia transportation routing algorithms, the team identified the optimal routes to get blood samples to the best laboratory for testing, even if that lab was not geographically the closest. The models also showed the best possible locations for mobile diagnostic laboratories that would better support the very rural regions that were most affected by the Ebola outbreak.

59 BASIC BIOLOGICAL SCIENCES↗

A NUMERICAL ALGORITHM FOR MODELING MULTIGROUP NEUTRINO-RADIATION HYDRODYNAMICS IN TWO SPATIAL DIMENSIONS

It is now generally agreed that multidimensional, multigroup, neutrino-radiation hydrodynamics (RHD) is an indispensable element of any realistic model of stellar-core collapse, core-collapse supernovae, and proto-neutron star instabilities. We have developed a new, two-dimensional, multigroup algorithm that can model neutrino-RHD flows in core-collapse supernovae. Our algorithm uses an approach similar to the ZEUS family of algorithms, originally developed by Stone and Norman. However, this completely new implementation extends that previous work in three significant ways: first, we incorporate multispecies, multigroup RHD in a flux-limited-diffusion approximation. Our approach is capable of modeling pair-coupled neutrino-RHD, and includes effects of Pauli blocking in the collision integrals. Blocking gives rise to nonlinearities in the discretized radiation-transport equations, which we evolve implicitly in time. We employ parallelized Newton-Krylov methods to obtain a solution of these nonlinear, implicit equations. Our second major extension to the ZEUS algorithm is the inclusion of an electron conservation equation that describes the evolution of electron-number density in the hydrodynamic flow. This permits calculating deleptonization of a stellar core. Our third extension modifies the hydrodynamics algorithm to accommodate realistic, complex equations of state, including those having nonconvex behavior. In this paper, we present a description of our complete algorithm, giving sufficient details to allow others to implement, reproduce, and extend our work. Finite-differencing details are presented in appendices. We also discuss implementation of this algorithm on state-of-the-art, parallel-computing architectures. Finally, we present results of verification tests that demonstrate the numerical accuracy of this algorithm on diverse hydrodynamic, gravitational, radiation-transport, and RHD sample problems. We believe our methods to be of general use in a variety of model settings where radiation transport or RHD is important. Extension of this work to three spatial dimensions is straightforward.

79 ASTRONOMY AND ASTROPHYSICS↗