Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithms and data structure”

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

Decision-Making Under Uncertainty for a Digital Thread-Enabled Design Process

Abstract Digital thread is a data-driven architecture that links together information from all stages of the product lifecycle. Despite increasing application in manufacturing, maintenance/operations, and design related tasks, a principled formulation of analyzing the decision-making problem under uncertainty for the digital thread remains absent. The contribution of this article is to present a formulation using Bayesian statistics and decision theory. First, we address how uncertainty propagates in the product lifecycle and how the digital thread evolves based on the decisions we make and the data we collect. By using these mechanics, we explore designing over multiple product generations or iterations and provide an algorithm to solve the underlying multistage decision problem. We illustrate our method on an example structural design problem where our method can quantify and optimize different types and sequences of decisions, ranging from experimentation, manufacturing, and sensor placement/selection, to minimize total accrued costs.

Engineering↗

NucMesh: nuclear reactor geometry creation and mesh generation module in NEMoSys

NucMesh is a parameterized geometry and mesh generator for nuclear reactors developed within the Nuclear Energy Modeling System NEMoSys at Illinois Rocstar. NEMoSys is a platform developed for mesh generation, adaptive refinement, and solution verification. NucMesh is implemented to be generalized and extensible with a robust computer aided design engine and multiple mesh generation algorithms for unstructured triangular, quad-dominant, and structured quadrilateral meshing. In this paper, we present the geometric and meshing features of NucMesh. Geometrically objects are constructed bottom-to-top and overlaps are addressed automatically. A sophisticated object tracking algorithm prevents data from being lost for segmented objects. We discuss the primitive objects of circle and polygons that constitute the module and show how they are used with example inputs. Arrays of primitives and arrays of arrays are utilized to build large assemblies of objects. The concept of saved objects is discussed to demonstrate how repetitive objects can be reused easily and augmented in place. Three dimensional meshes can be obtained through mesh extrusion where all materials and side sets are extended to three dimensions. We show that side sets can be defined nearly anywhere within the geometry and can then be applied to the mesh. Finally, example reactor meshes are demonstrated for the Idaho National Laboratory Advanced Test Reactor and Los Alamos National Lab Empire reactor, both of which use control drums that NucMesh handles easily. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Chance-Constrained Optimization for Critical Infrastructure Protection

Stochastic optimization deals with making highly reliable decisions under uncertainty. Chance constraints are a crucial tool of stochastic optimization to develop mathematical optimization models; they form the backbone of many important national security data science applications. These include critical infrastructure resiliency, cyber security, power system operations, and disaster relief management. However, existing algorithms to solve chance-constrained optimization models are severely limited by problem size and structure. In this investigative study, we (i) develop new algorithms to approximate chance-constrained optimization models, (ii) demonstrate the application of chance-constraints to a national security problem, and (iii) investigate related stochastic optimization problems. We believe our work will pave way for new research is stochastic optimization as well as secure national infrastructures against unforeseen attacks.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

A Machine Learning–Based Approach to Time-series Wave Identification in the Solar Wind

The Wind spacecraft has yielded several decades of high-resolution magnetic field data, a large fraction of which displays small-scale structures. In particular, the solar wind is full of wavelike fluctuations that appear in both the field magnitude and its components. The nature of these fluctuations can be tied to the properties of other structures in the solar wind, such as shocks, that have implications for the time evolution of the solar wind. As such, having a large collection of wave events would facilitate further study of the effects that these fluctuations have on solar wind evolution. Given the large volume of magnetic field data available, machine learning is the most practical approach to classifying the myriad small-scale structures observed. To this end, a subset of Wind data is labeled and used as a training set for a multibranch 1D convolutional neural network aimed at classifying circularly polarized wave modes. Using this algorithm, a preliminary statistical study of 1 yr of data is performed, yielding about 300,000 wave intervals out of about 5,000,000 solar wind intervals. The wave intervals come about more often in the fast solar wind and at higher temperatures, and the number of waves per day is highly periodic. This machine learning–based approach to wave detection has the potential to be a powerful, inexpensive way to catalog waves throughout decades of spacecraft data.

79 ASTRONOMY AND ASTROPHYSICS↗

Data-driven estimation of energy consumption for electric bus under real-world driving conditions

Reliable and accurate estimation of an electric bus’s instantaneous energy consumption is critical in evaluating energy impacts of planning and control of electric bus operations. In this study, we developed machine learning-based long short-term memory (LSTM) and artificial neural network (ANN) models to estimate 1 Hz energy consumption of electric buses based on continuous monitoring data of electric buses in Chattanooga, Tennessee, in 2019 and 2020. We propose a data-partitioning algorithm to separate energy charging and discharging modes before applying data-driven estimation models. Here, a K-fold cross-validation-based model selection process was conducted to identify the optimal model structure and input variables in terms of prediction accuracy. The estimation results show the predicted mean absolute percentage error rates of LSTM and ANN models were 3% and 5%, respectively. We compared the proposed models with existing models in the literature based on the same testing data to demonstrate the predictability of our models.

Artificial neural network↗

Strong Upper-Plate Heterogeneity at the Hikurangi Subduction Margin (North Island, New Zealand) Imaged by Adjoint Tomography

We use earthquake-based adjoint tomography to invert for three-dimensional structure of the North Island, New Zealand, and the adjacent Hikurangi subduction zone. The study area, having a shallow depth to the plate interface below the North Island, offers a rare opportunity for imaging material properties at an active subduction zone using land-based measurements. Starting from an initial model derived using ray tomography, we perform iterative model updates using spectral element and adjoint simulations to fit waveforms with periods ranging from 4–30 s. We perform 28 model updates using an L-BFGS optimization algorithm, improving data fit and introducing P- and S-wave velocity changes of up to ±30%. Resolution analysis using point spread functions show that our measurements are most sensitive to heterogeneities in the upper 30 km. The most striking velocity changes coincide with areas related to the active Hikurangi subduction zone. Lateral velocity structures in the upper 5 km correlate well with New Zealand geology. Here, the inversion reveals increased along-strike heterogeneity on the margin. In Cook Strait we observe a low-velocity zone interpreted as deep sedimentary basins. In the central North Island, low-velocity anomalies are linked to surface geology, and we relate velocity structures at depth to crustal magmatic activity below the Taupō Volcanic Zone.

58 GEOSCIENCES↗

Generalized representative structures for atomistic systems

A new method is presented to generate atomic structures that reproduce the essential characteristics of arbitrary material systems, phases, or ensembles. Previous methods allow one to reproduce the essential characteristics (e.g. the chemical disorder) of a large random alloy within a small crystal structure. The ability to generate small representations of random alloys, along with the restriction to crystal systems, results from using the fixed-lattice cluster correlations to describe structural characteristics. A more general description of the structural characteristics of atomic systems is obtained using complete sets of atomic environment descriptors. These are used within for generating representative atomic structures without restriction to fixed lattices. A general data-driven approach is provided here utilizing the atomic cluster expansion (ACE) basis. The N-body ACE descriptors are a complete set of atomic environment descriptors that span both chemical and spatial degrees of freedom and are used within for describing atomic structures. The generalized representative structure (GRS) method presented within generates small atomic structures that reproduce ACE descriptor distributions corresponding to arbitrary structural and chemical complexity. It is shown that systematically improvable representations of crystalline systems on fixed parent lattices, amorphous materials, liquids, and ensembles of atomic structures may be produced efficiently through optimization algorithms. With the GRS method, we highlight reduced representations of atomistic machine-learning training datasets that contain similar amounts of information and small 40–72 atom representations of liquid phases. The ability to use GRS methodology as a driver for informed novel structure generation is also demonstrated. The advantages over other data-driven methods and state-of-the-art methods restricted to high-symmetry systems are highlighted.

atomic cluster expansion↗

Adaptive Generation of Multimaterial Grids from imaging data for Biomedical Lagrangian Fluid-Structure Simulations

Spatial discretization of complex imaging-derived fluid-solid geometries, such as the cardiac environment, is a critical but often overlooked challenge in biomechanical computations. This is particularly true in problems with Lagrangian interfaces, where, the fluid and solid phases must match geometrically. For simplicity and better accuracy, it is also highly desirable for the two phases to share the same surface mesh at the interface between them. We outline a method for solving this problem, and illustrate the approach with a 3D fluid-solid mesh of the mouse heart. An MRI perfusion-fixed dataset of a mouse heart with 50μm isotropic resolution was semi-automatically segmented using a customized multimaterial connected-threshold approach that divided the volume into non-overlapping regions of blood, tissue and background. Subsequently, a multimaterial marching cubes algorithm was applied to the segmented data to produce two detailed, compatible isosurfaces, one for blood and one for tissue. Both isosurfaces were simultaneously smoothed with a multimaterial smoothing algorithm that exactly conserves the volume for each phase. Using these two isosurfaces, we developed and applied novel automated meshing algorithms to generate anisotropic hybrid meshes on arbitrary biological geometries with the number of layers and the desired element anisotropy for each phase as the only input parameters. Since our meshes adapt to the local feature sizes and include boundary layer prisms, they are more efficient and accurate than non-adaptive, isotropic meshes, and the fluid-structure interaction computations will tend to have relative error equilibrated over the whole mesh.

59 BASIC BIOLOGICAL SCIENCES↗

A comparative analysis of clustering algorithms: O{sub 2} migration in truncated hemoglobin I from transition networks

The ligand migration network for O{sub 2}–diffusion in truncated Hemoglobin N is analyzed based on three different clustering schemes. For coordinate-based clustering, the conventional k–means and the kinetics-based Markov Clustering (MCL) methods are employed, whereas the locally scaled diffusion map (LSDMap) method is a collective-variable-based approach. It is found that all three methods agree well in their geometrical definition of the most important docking site, and all experimentally known docking sites are recovered by all three methods. Also, for most of the states, their population coincides quite favourably, whereas the kinetics of and between the states differs. One of the major differences between k–means and MCL clustering on the one hand and LSDMap on the other is that the latter finds one large primary cluster containing the Xe1a, IS1, and ENT states. This is related to the fact that the motion within the state occurs on similar time scales, whereas structurally the state is found to be quite diverse. In agreement with previous explicit atomistic simulations, the Xe3 pocket is found to be a highly dynamical site which points to its potential role as a hub in the network. This is also highlighted in the fact that LSDMap cannot identify this state. First passage time distributions from MCL clusterings using a one- (ligand-position) and two-dimensional (ligand-position and protein-structure) descriptor suggest that ligand- and protein-motions are coupled. The benefits and drawbacks of the three methods are discussed in a comparative fashion and highlight that depending on the questions at hand the best-performing method for a particular data set may differ.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Computational Framework to design 3D stiffness gradient acoustic metamaterials for impedance matching

Acoustic waves play a crucial role in various applications, including medical imaging, non-destructive testing, and sonar systems. One of the significant challenges in these applications is impedance matching, which is essential for minimizing reflections and maximizing the transfer of acoustic energy between different media. Acoustic metamaterials offer a promising solution to this challenge. In addition to impedance control, gradient stiffness can enhance structural efficiency and enable spatial control of wave propagation, making it a valuable feature in acoustic metamaterial design. In this pa- per, we present our developed computational method to design 3D stiffness gradient acoustic metamaterials for impedance matching. The key steps in our approach include generating initial designs using a periodic covariance function to provide unit cells that are both periodic on the boundaries and randomly formed inside the unit cell. Furthermore, we integrated manufacturing constraints into the design process, ensuring that the structures are interconnected for fabrication. We propose two computational optimization algorithms: GenUnit, based on a non-dominated sorting genetic algorithm (NSGA-II), and MLMatch, which leverages differentiable machine learning. The two approaches are not separate contributions but complementary com- ponents of a unified framework. GenUnit requires no training data and directly interfaces with physics-based simulations, making it highly accurate but slower for large-scale exploration. In contrast, MLMatch is data-hungry during training but, once trained, enables near-instantaneous inference and broad design-space coverage. Together, they form a hybrid strategy: ML- Match rapidly explores the global design space, and GenUnit provides local refinement with high-fidelity accuracy. This balance between training cost, inference time, and precision is the motivation for including both methods in the same study. We applied this dual-algorithm framework to generate two metallic-based metamaterial designs that match the acoustic impedance of water while exhibiting a controlled gradient in stiffness (from stiff to soft). The stiffness gradient is particularly advantageous in applications where one side of the structure must interface with soft or sensitive surfaces, such as human tissue or delicate components. Here, this work paves the way for improved materials in various acoustic applications, particularly in ultrasound devices, by providing better impedance.

Metamaterial↗

Tolerating Correlated Failures for Generalized Cartesian Distributions via Bipartite Matching

Faults are expected to play an increasingly important role in how algorithms and applications are designed to run on future extreme-scale systems. A key ingredient of any approach to fault tolerance is effective support for fault tolerant data storage. A typical application execution consists of phases in which certain data structures are modified while others are read-only. Often, read-only data structures constitute a large fraction of total memory consumed. Fault tolerance for read-only data can be ensured through the use of checksums or parities, without resorting to expensive in-memory duplication or checkpointing to secondary storage. In this paper, we present a graph-matching approach to compute and store parity data for read-only matrices that are compatible with fault tolerant linear algebra (FTLA). Typical approaches only support blocked data distributions with each process holding one block with the parity located on additional processes. The matrices are assumed to be blocked by a cartesian grid with each block assigned to a process. We consider a generalized distribution in which each process can be assigned arbitrary blocks. We also account for the fact that multiple processes might be part of the same failure unit, say an SMP node. The flexibility enabled by our novel application of graph matching extends fault tolerance support to data distributions beyond those supported by prior work. We evaluate the matching implementations and cost to compute the parity and recover lost data, demonstrating the low overhead incurred by our approach.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Integrating Natural Language Processing and Machine Learning Algorithms to Categorize Oncologic Response in Radiology Reports

A significant volume of medical data remains unstructured. Natural language processing (NLP) and machine learning (ML) techniques have shown to successfully extract insights from radiology reports. However, the codependent effects of NLP and ML in this context have not been well-studied. Between April 1, 2015 and November 1, 2016, 9418 cross-sectional abdomen/pelvis CT and MR examinations containing our internal structured reporting element for cancer were separated into four categories: Progression, Stable Disease, Improvement, or No Cancer. We combined each of three NLP techniques with five ML algorithms to predict the assigned label using the unstructured report text and compared the performance of each combination. The three NLP algorithms included term frequency-inverse document frequency (TF-IDF), term frequency weighting (TF), and 16-bit feature hashing. The ML algorithms included logistic regression (LR), random decision forest (RDF), one-vs-all support vector machine (SVM), one-vs-all Bayes point machine (BPM), and fully connected neural network (NN). The best-performing NLP model consisted of tokenized unigrams and bigrams with TF-IDF. Increasing N-gram length yielded little to no added benefit for most ML algorithms. With all parameters optimized, SVM had the best performance on the test dataset, with 90.6 average accuracy and F score of 0.813. The interplay between ML and NLP algorithms and their effect on interpretation accuracy is complex. The best accuracy is achieved when both algorithms are optimized concurrently.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Bayesian analysis of the dynamic cosmic web in the SDSS galaxy survey

Recent application of the Bayesian algorithm \textsc(borg) to the Sloan Digital Sky Survey (SDSS) main sample galaxies resulted in the physical inference of the formation history of the observed large-scale structure from its origin to the present epoch. In this work, we use these inferences as inputs for a detailed probabilistic cosmic web-type analysis. To do so, we generate a large set of data-constrained realizations of the large-scale structure using a fast, fully non-linear gravitational model. We then perform a dynamic classification of the cosmic web into four distinct components (voids, sheets, filaments, and clusters) on the basis of the tidal field. Our inference framework automatically and self-consistently propagates typical observational uncertainties to web-type classification. As a result, this study produces accurate cosmographic classification of large-scale structure elements in the SDSS volume. By also providing the history of these structure maps, the approach allows an analysis of the origin and growth of the early traces of the cosmic web present in the initial density field and of the evolution of global quantities such as the volume and mass filling fractions of different structures. For the problem of web-type classification, the results described in this work constitute the first connection between theory and observations at non-linear scales including a physical model of structure formation and the demonstrated capability of uncertainty quantification. A connection between cosmology and information theory using real data also naturally emerges from our probabilistic approach. Our results constitute quantitative chrono-cosmography of the complex web-like patterns underlying the observed galaxy distribution.

79 ASTRONOMY AND ASTROPHYSICS↗

guppy i : a code for reducing the storage requirements of cosmological simulations

ABSTRACT As cosmological simulations have grown in size, the permanent storage requirements of their particle data have also grown. Even modest simulations present a major logistical challenge for the groups which run these boxes and researchers without access to high performance computing facilities often need to restrict their analysis to lower quality data. In this paper, we present guppy, a compression algorithm and code base tailored to reduce the sizes of dark matter-only cosmological simulations by approximately an order of magnitude. guppy is a ‘lossy’ algorithm, meaning that it injects a small amount of controlled and uncorrelated noise into particle properties. We perform extensive tests on the impact that this noise has on the internal structure of dark matter haloes, and identify conservative accuracy limits which ensure that compression has no practical impact on single-snapshot halo properties, profiles, and abundances. We also release functional prototype libraries in C, Python, and Go for reading and creating guppy data.

79 ASTRONOMY AND ASTROPHYSICS↗

Materials Learning Algorithms (MALA): Scalable machine learning for electronic structure calculations in large-scale atomistic simulations

We present the Materials Learning Algorithms (MALA) package, a scalable machine learning framework designed to accelerate density functional theory (DFT) calculations suitable for large-scale atomistic simulations. Using local descriptors of the atomic environment, MALA models efficiently predict key electronic observables, including local density of states, electronic density, density of states, and total energy. The package integrates data sampling, model training and scalable inference into a unified library, while ensuring compatibility with standard DFT and molecular dynamics codes. We demonstrate MALA's capabilities with examples including boron clusters, aluminum across its solid-liquid phase boundary, and predicting the electronic structure of a stacking fault in a large beryllium slab. Scaling analyses reveal MALA's computational efficiency and identify bottlenecks for future optimization. With its ability to model electronic structures at scales far beyond standard DFT, MALA is well suited for modeling complex material systems, making it a versatile tool for advanced materials research.

Density functional theory↗

Computed Tomography of Dry Cask Storage for Used Fuel

The demand for dry cask storage for used nuclear fuel is on the rise due to the continuous operation of currently existing nuclear plants which are reaching or have reached the capacity of their used fuel pools. Dry cask storage allows used fuel that has already been cooled in the used fuel pool for at least five years to be surrounded by an inert gas inside a specially designed and licensed cask. Currently, 75 of the 78 U.S.A reactor sites either have or are pursuing an independent spent fuel storage installation (ISFSI) for dry cask fuel storage with over 2,000 casks already loaded. Cask loading will only continue to increase until a final repository solution is operational or the U.S. begins to recycle fuel. The challenge of monitoring the condition of the used fuel inside the cask without exposing the used fuel has been apparent since the 1980's. The objective of the University of Florida (UF) project is ultimately to investigate the feasibility of imaging the used fuel assemblies' location and evaluating the inner structural condition using emission source computed tomography (CT). A combination of radiation transport models will be used to simulate gamma-rays and neutrons traversing through the used fuel, structure, and cask body materials. In the simulations, multiple linear detector arrays will record the radiation outside the cask wall and will be placed at various angles in order to model rotating a linear detector array around the entire cask. The combination of data from all the detectors will give the planar radiation projection onto the detectors, more commonly called the Radon transform, of the structure of used fuel assemblies. This project can be processed with filtered back projection or other more advanced reconstructive imaging algorithms to recreate the fuel structures. A majority of the historical work done for used fuel has been on verification, diversion detection, and burnup credit validation in order to meet regulatory guidelines. One of the more commonly used systems for single assembly verification is the Fork Detector developed at Los Alamos National Laboratory in 1988. A group at the Idaho National Laboratory developed a Compton Dry-Cask Imaging Scanner that has the ability to detect empty vs full storage positions but it suffered a setback when transported to the Doel Nuclear Power Plant near Antwerp, Belgium; the system was unable to detect full energy peaks because of the additional scattering caused by a thick ballistic steel shield. As detectors, computational power, and modeling improves, a few groups have leveraged these advancements and started to investigate CT hoping, that despite the difficulties, the technique can give information on fuel condition. So far the groups have mostly limited the tomographic work to a per assembly basis , rather than the full dry cask as the University of Florida plans to investigate. The downsides of CT versus simpler verification and validation are the amount of data required and the time it takes to acquire that data. Given that dry casks are intended to sit undistributed for up to 60 years, a scanning time of several weeks to several months is not unreasonable if such systems do not require human operators beyond the initial setup. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Processing Neutron Cross Section Covariances using NJOY-99 and PUFF-IV

With the growing demand for multigroup covariances, the National Nuclear Data Center (NNDC) has been experiencing an upsurge in its covariance data processing activities using the two US codes NJOY-99 (LANL) and PUFF-IV (ORNL). The code NJOY-99 was upgraded by incorporating the new module ERRORJ-2.3, while the NNDC served as the active user and provided feedback. The NNDC has been primarily processing neutron cross section covariances on its 64-bit Linux cluster in support of two DOE programs, the Global Nuclear Energy Partnership (GNEP) and the Nuclear Criticality Safety Program (NCSP). For GNEP, the NNDC used NJOY-99.259 to generate multigroup covariance matrices of {sup 56}Fe, {sup 23}Na, {sup 239}Pu, {sup 235}U and {sup 238}U from the JENDL-3.3 library using the 15-, 33-, and 230-energy group structures. These covariance matrices will be used to test a new collapsing algorithm which will subsequently be employed to calculate uncertainties on integral parameters in different fast neutron-based systems. For NCSP, we used PUFF-IV 1.0.4 to verify the processability of new evaluated covariance data of {sup 55}Mn, {sup 239}Pu, {sup 233}U, {sup 235}U and {sup 238}U generated by a collaboration of ORNL and LANL. For the data end-users at large, the NNDC has made available a Web site which provides a static visualization interface for all materials with covariance data in the four major data libraries: ENDF/B-VI.8 (47 materials), ENDF/B-VII.0 (26 materials), JEFF-3.1 (37 materials) and JENDL-3.3 (20 materials)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Computed Tomography of Dry Cask Storage for Used Fuel

The demand for dry cask storage for used nuclear fuel is on the rise due to the continuous operation of currently existing nuclear plants which are reaching or have reached the capacity of their used fuel pools. Dry cask storage allows used fuel that has already been cooled in the used fuel pool for at least five years to be surrounded by an inert gas inside a specially designed and licensed cask. Currently, 75 of the 78 U.S.A reactor sites either have or are pursuing an independent spent fuel storage installation (ISFSI) for dry cask fuel storage [1] with over 2,000 casks already loaded [2]. Cask loading will only continue to increase until a final repository solution is operational or the U.S. begins to recycle fuel. The challenge of monitoring the condition of the used fuel inside the cask without exposing the used fuel has been apparent since the 1980s. The objective of the University of Florida (UF) project is ultimately to investigate the feasibility of imaging the used fuel assemblies’ location and evaluating the inner structural condition using emission source computed tomography (CT). A combination of radiation transport models will be used to simulate gamma-rays and neutrons traversing through the used fuel, structure, and cask body materials. In the simulations, multiple linear detector arrays will record the radiation outside the cask wall and will be placed at various angles in order to model rotating a linear detector array around the entire cask. The combination of data from all the detectors will give the planar radiation projection onto the detectors, more commonly called the Radon transform, of the structure of used fuel assemblies. This project can be processed with filtered back projection or other more advanced reconstructive imaging algorithms to recreate the fuel structures. A majority of the historical work done for used fuel has been on verification, diversion detection, and burnup credit validation in order to meet regulatory guidelines. One of the more commonly used systems for single assembly verification is the Fork Detector developed at Los Alamos National Laboratory in 1988 [3]. A group at the Idaho National Laboratory developed a Compton Dry-Cask Imaging Scanner that has the ability to detect empty vs full storage positions but it suffered a setback when transported to the Doel Nuclear Power Plant near Antwerp, Belgium; the system was unable to detect full energy peaks because of the additional scattering caused by a thick ballistic steel shield [4]. As detectors, computational power, and modeling improves, a few groups have leveraged these advancements and started to investigate CT hoping, that despite the difficulties, the technique can give information on fuel condition. So far the groups have mostly limited the tomographic work to a per assembly basis [5] [6] [7], rather than the full dry cask as the University of Florida plans to investigate. The downsides of CT versus simpler verification and validation are the amount of data required and the time it takes to acquire that data. Given that dry casks are intended to sit undistributed for up to 60 years, a scanning time of several weeks to several months is not unreasonable if such systems do not require human operators beyond the initial setup.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗