Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computational Method Validation”

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 595 records · Page 33

Intelligent Computer Vision System for Automated Classification

In this paper we investigate an Intelligent Computer Vision System applied for recognition and classification of commercially available cork tiles. The system is capable of acquiring and processing gray images using several feature generation and analysis techniques. Its functionality includes image acquisition, feature extraction and preprocessing, and feature classification with neural networks (NN). We also discuss system test and validation results from the recognition and classification tasks. The system investigation also includes statistical feature processing (features number and dimensionality reduction techniques) and classifier design (NN architecture, target coding, learning complexity and performance, and training with our own metaheuristic optimization method). The NNs trained with our genetic low-discrepancy search method (GLPtauS) for global optimisation demonstrated very good generalisation abilities. In our view, the reported testing success rate of up to 95% is due to several factors: combination of feature generation techniques; application of Analysis of Variance (ANOVA) and Principal Component Analysis (PCA), which appeared to be very efficient for preprocessing the data; and use of suitable NN design and learning method.

97 MATHEMATICS AND COMPUTING↗

Convex Optimization of Integrated Power-Gas Energy Flow Model With Applications to Probabilistic Energy Flow

Energy flow calculation is a fundamental problem of the integrated power and gas system (IPGS) operation and planning. However, the nonlinear gas flow model introduces major challenges to the energy flow calculation. In this paper, we propose a tractably convex optimization model to solve the energy flow problem in IPGSs. It is demonstrated that the proposed optimization model has the same optimal solution as the original nonlinear steady energy flow model. Also, piecewise linearization is adopted to tightly linearize the nonlinear objective function of the model, which transforms the formulated convex optimization into a linear program one. Thus, the computation complexity of the proposed energy flow model is significantly reduced as compared with the existing methods. In addition, the proposed model can be extended to probabilistic energy flow estimation. Extensive case studies are conducted to validate the effectiveness of the proposed energy flow model using three IPGSs.

42 ENGINEERING↗

Hybrid immersed interface-immersed boundary methods for AC dielectrophoresis

Dielectrophoresis, a nonlinear electrokinetic transport mechanism, has become popular in many engineering applications including manipulation, characterization and actuation of biomaterials, particles and biological cells. In this paper, we present a hybrid immersed interface–immersed boundary method to study AC dielectrophoresis where an algorithm is developed to solve the complex Poisson equation using a real variable formulation. An immersed interface method is employed to obtain the AC electric field in a fluid media with suspended particles and an immersed boundary method is used for the fluid equations and particle transport. The convergence of the proposed algorithm as well as validation of the hybrid scheme with experimental results is presented. In this paper, the Maxwell stress tensor is used to calculate the dielectrophoretic force acting on particles by considering the physical effect of particles in the computational domain. Thus, this study eliminates the approximations used in point dipole methods for calculating dielectrophoretic force. A comparative study between Maxwell stress tensor and point dipole methods for computing dielectrophoretic forces are presented. The hybrid method is used to investigate the physics of dielectrophoresis in microfluidic devices using an AC electric field. The numerical results show that with proper design and appropriate selection of applied potential and frequency, global electric field minima can be obtained to facilitate multiple particle trapping by exploiting the mechanism of negative dielectrophoresis. Our numerical results also show that electrically neutral particles form a chain parallel to the applied electric field irrespective of their initial orientation when an AC electric field is applied. This proposed hybrid numerical scheme will help to better understand dielectrophoresis and to design and optimize microfluidic devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Blood flow imaging by optimal matching of computational fluid dynamics to 4D-flow data

Three-dimensional, time-resolved blood flow measurement (4D-flow) is a powerful research and clinical tool, but improved resolution and scan times are needed. Therefore, this study aims to (1) present a postprocessing framework for optimization-driven simulation-based flow imaging, called 4D-flow High-resolution Imaging with a priori Knowledge Incorporating the Navier-Stokes equations and the discontinuous Galerkin method (4D-flow HIKING), (2) investigate the framework in synthetic tests, (3) perform phantom validation using laser particle imaging velocimetry, and (4) demonstrate the use of the framework in vivo. An optimizing computational fluid dynamics solver including adjoint-based optimization was developed to fit computational fluid dynamics solutions to 4D-flow data. Synthetic tests were performed in 2D, and phantom validation was performed with pulsatile flow. Reference velocity data were acquired using particle imaging velocimetry, and 4D-flow data were acquired at 1.5 T. In vivo testing was performed on intracranial arteries in a healthy volunteer at 7 T, with 2D flow as the reference. Results Synthetic tests showed low error (0.4%-0.7%). Phantom validation showed improved agreement with laser particle imaging velocimetry compared with input 4D-flow in the horizontal (mean -0.05 vs -1.11 cm/s, P < .001; SD 1.86 vs 4.26 cm/s, P < .001) and vertical directions (mean 0.05 vs -0.04 cm/s, P = .29; SD 1.36 vs 3.95 cm/s, P < .001). In vivo data show a reduction in flow rate error from 14% to 3.5%. Phantom and in vivo results from 4D-flow HIKING show promise for future applications with higher resolution, shorter scan times, and accurate quantification of physiological parameters.

4D-flow MRI↗

Reference guide to WPP version 2.0

WPP is a computer program for simulating seismic wave propagation on parallel machines. WPP solves the governing equations in second order formulation using a node-based finite difference approach. The basic numerical method is described in [9]. WPP implements substantial capabilities for 3-D seismic modeling, with a free surface condition on the top boundary, non-reflecting far-field boundary conditions on the other boundaries, point force and point moment tensor source terms with many predefined time dependencies, fully 3-D heterogeneous material model specification, output of synthetic seismograms in the SAC [4] format, output of GMT [11] scripts for laying out simulation information on a map, and output of 2-D slices of (derived quantites of) the solution field as well as the material model. Version 2.0 of WPP allows the free surface boundary condition to be imposed on a curved topography. For this purpose a curvilinear mesh is used near the free surface, extending into the computational domain down to a user specified level. The elastic wave equations and the free surface boundary conditions are discretized on the curvilinear mesh using the energy conserving technique described in [2]. A curvilinear mesh generator is built into WPP and the curvilinear mesh is automatically generated from the topography. Below the curvilinear grid, the elastic wave equation is discretized on Cartesian meshes, which leads to a more computationally efficient algorithm. In version 2.0 of WPP, Cartesian local mesh refinement can be used to make the computational mesh finer near the free surface, where more resolution often is needed to resolve short wave lenghts in the solution, for example in sedimentary basins. The mesh refinement is performed in the vertical direction and each Cartesian grid is constructed from user specified refinement levels. In this approach, the grid size in all three spatial directions is doubled across each mesh refinement interface, leading to substantial savings in memory and computational effort. The energy conserving mesh refinement coupling method described in [10] is used to handle the hanging nodes along the refinement interface. The examples subdirectory of the WPP source distribution contains several examples and validation tests. Many Matlab/octave scripts are provided in the tools directory.

58 GEOSCIENCES↗

SU-E-T-157: CARMEN: A MatLab-Based Research Platform for Monte Carlo Treatment Planning (MCTP) and Customized System for Planning Evaluation

Purpose: Although there exist several radiotherapy research platforms, such as: CERR, the most widely used and referenced; SlicerRT, which allows treatment plan comparison from various sources; and MMCTP, a full MCTP system; it is still needed a full MCTP toolset that provides users complete control of calculation grids, interpolation methods and filters in order to “fairly” compare results from different TPSs, supporting verification with experimental measurements. Methods: This work presents CARMEN, a MatLab-based platform including multicore and GPGPU accelerated functions for loading RT data; designing treatment plans; and evaluating dose matrices and experimental data.CARMEN supports anatomic and functional imaging in DICOM format, as well as RTSTRUCT, RTPLAN and RTDOSE. Besides, it contains numerous tools to accomplish the MCTP process, managing egs4phant and phase space files.CARMEN planning mode assist in designing IMRT, VMAT and MERT treatments via both inverse and direct optimization. The evaluation mode contains a comprehensive toolset (e.g. 2D/3D gamma evaluation, difference matrices, profiles, DVH, etc.) to compare datasets from commercial TPS, MC simulations (i.e. 3ddose) and radiochromic film in a user-controlled manner. Results: CARMEN has been validated against commercial RTPs and well-established evaluation tools, showing coherent behavior of its multiple algorithms. Furthermore, CARMEN platform has been used to generate competitive complex treatment that has been published in comparative studies. Conclusion: A new research oriented MCTP platform with a customized validation toolset has been presented. Despite of being coded with a high-level programming language, CARMEN is agile due to the use of parallel algorithms. The wide-spread use of MatLab provides straightforward access to CARMEN’s algorithms to most researchers. Similarly, our platform can benefit from the MatLab community scientific developments as filters, registration algorithms etc. Finally, CARMEN arises the importance of grid and filtering control in treatment plan comparison.

60 APPLIED LIFE SCIENCES↗

Validation of time-dependent shift using the pulsed sphere benchmarks

The detailed behavior of neutrons in a rapidly changing time-dependent physical system is a challenging computational physics problem, particularly when using Monte Carlo methods on heterogeneous high-performance computing architectures. A small number of algorithms and code implementations have been shown to be performant for time-independent (fixed source and k-eigenvalue) Monte Carlo, and there are existing simulation tools that successfully solve the time-dependent Monte Carlo problem on smaller computing platforms. To bridge this gap, a time-dependent version of ORNL’s Shift code has been recently developed. Shift’s history-based algorithm on CPUs, and its event-based algorithm on GPUs, have both been observed to scale well to very large numbers of processors, which motivated the extension of this code to solve time-dependent problems. The validation of this new capability requires a comparison with time-dependent neutron experiments. Lawrence Livermore National Laboratory’s (LLNL) pulsed sphere benchmark experiments were simulated in Shift to validate both the time-independent as well as new time-dependent features recently incorporated into Shift. A suite of pulsed-sphere models was simulated using Shift and compared to the available experimental data and simulations with MCNP. Overall results indicate that Shift accurately simulates the pulsed sphere benchmarks, and that the new time-dependent modifications of Shift are working as intended. Validated exascale neutron transport codes are essential for a wide variety of future multiphysics applications.

Palmer, Camille J.↗

Applying Time-Parallelization to Turbulent Flows

Parallelization of the temporal domain is explored for the solution of turbulent flows. Multigrid reduction-in-time (MGRIT) is used to advance the large-scale fluid dynamics in time sequentially on the coarsest space-time grid but propagate the information in time parallel on all other levels. The goal of this process is to accurately and efficiently resolve the coarse-scale turbulence structure and use that to drive the fine-scales of the turbulent flow. The extra forcing from nonlinear multigrid facilitates the coupling and interaction between fine and coarse scales, through which the multiscale nonlinear physics is properly captured. Adaptive mesh refinement is employed to finely resolve only the regions with strong gradients, which provides further computational efficiency. The underlying computational fluid dynamics solver is a fourth-order finite-volume scheme with the standard 4-stage Runge-Kutta method. An advanced approach is devised and implemented to enable MGRIT to solve highly turbulent flows successfully. Furthermore, the method is applied to solve a Taylor-Green vortex problem and a doubleshear-layer turbulent mixing flow. Results are promising, validating that MGRIT with the filtering approach has the potential to efficiently solve general turbulent flows.

Computational Fluid Dynamics↗

Progress report on analytic and numerical studies of x-ray-induced impulse

In a variety of high-energy-density (HED) systems, x-rays of a given energy are used to generate shockwaves, bulk motion, and impulse in materials. As radiation energy is deposited within the material, the material is heated. The number of photons of a certain wavelength absorbed is determined by the spectral intensity of the radiation and the material’s opacity evaluated at that wavelength. This heating results in a pressure increase dictated by the material’s equation of state. Depending on the intensity of the absorbed radiation, it may also cause the material to change phase into a liquid, gas, or plasma. The increased pressure drives the heated surface layer to blow off, imparting impulse and sending a compressive wave into the bulk of the material. Additionally, the compression wave interacts with the solid boundary of the material, resulting in a tensile wave that may cause the material to spall. The impulse generated by the deposition of x-ray energy within the sample can be modeled using purely analytical methods, e.g. the Bethe, Bade, Averell, and Yost (BBAY) model. However, the blow-off process is rather complicated, and proper modeling efforts must account for material ejected by spallation, vaporization, jetting, and plasma ablation. For this reason, analytical models have an unclosed term describing the final energy of the blown-off material Ef(z). Prior modeling efforts have arbitrarily fixed this at some value or modeled it using a limiting set of thermodynamic assumptions. The work we are currently performing uses validated simulations using sophisticated photon transport, equation of state, and strength models/data to provide a fit for Ef(z) that is useful for predictive calculation of impulse. We will apply our methodology and show results for different materials and x-ray sources. This work is particularly useful for the design of experiments studying x-ray impulse generation. The present report is outlined as follows. Section 1.2 describes a series of HED experiments investigating x-ray-generated impulse in materials. Section 1.3 describes the computational approach we employ in this study, and presents validation results against the aforementioned experiments. Section 1.4 introduces analytical models for impulse generation, as well as our method for utilizing impulse from simulations to close the models. We discuss the concept of impulse-spectrum sensitivity, it’s application to uncertainty quantification, and derive a very useful analytical expression for it in 1.5. We then summarize recent progress in this project and discuss future work in section 1.6.

36 MATERIALS SCIENCE↗

The halo light-cone catalogues of ABACUSSUMMIT

We describe a method for generating halo catalogues on the light-cone using the AbacusSummit suite of N-body simulations. The main application of these catalogues is the construction of realistic mock galaxy catalogues and weak lensing maps on the sky. Our algorithm associates the haloes from a set of coarsely spaced snapshots with their positions at the time of light-cone crossing by matching halo particles to on-the-fly light-cone particles. It then records the halo and particle information into an easily accessible product, which we call the AbacusSummit halo light-cone catalogues. Our recommended use of this product is in the halo mass regime of M halo > 2.1 x 10 11 M ⊙ h -1 for the base resolution simulations, i.e. haloes containing at least 100 particles, where the interpolated halo properties are most reliable. To test the validity of the obtained catalogues, we perform various visual inspections and consistency checks. In particular, we construct galaxy mock catalogues of emission-line galaxies (ELGs) at z ~ 1 by adopting a modified version of the AbacusHOD script, which builds on the standard halo occupation distribution (HOD) method by including various extensions. We find that the multipoles of the autocorrelation function are consistent with the predictions from the full-box snapshot, implicitly validating our algorithm. In addition, we compute and output CMB convergence maps and find that the auto- and cross-power spectrum agrees with the theoretical prediction at the sub-per-cent level.

79 ASTRONOMY AND ASTROPHYSICS↗

TU-H-CAMPUS-IeP1-02: Validation of a CT Monte Carlo Software

Purpose: To validate the in-house developed CT Monte Carlo calculation tool GMctdospp against reference simulation sets provided by the AAPM in the new report 195. Methods: Deposited energy was calculated in four segments (test 1) and two 10 cm long cylinders (test 2) inside a CTDI phantom (following case #4 of the AAPM report 195). The x-ray point source of a given 120 kVp spectrum was collimated to a fan beam with two thicknesses (10 mm, 80 mm) for a static and a rotational setup. In addition, a given chest geometry was used to calculate deposited energy in several organs for a 0° static and a rotational beam (following case #5 of the AAPM report 195). The results of GMctdospp were compared against the particular mean value of the four quoted Monte Carlo codes (EGSnrc, Geant 4, MCNP and Penelope). Results: Calculated values showed no outliers in any of the cases. Differences between GMctdospp and the particular mean Results: Calculated values showed no outliers in any of the cases. Differences between GMctdospp and the particular mean value were always at similar magnitude compared to the quoted codes. For case #4 (CTDI phantom) the relative differences were within 1.5 %, on average 0.4 % and for case #5 (chest phantom) within 2.5 % and on average 0.85 %. Conclusion: The results confirmed an overall uncertainty of the Monte-Carlo calculation chain in GMctdospp being <2.5 %, for most cases even better. This can be considered small compared to other sources of uncertainties, e.g. virtual source and patient models. The photon transport implemented in GMctdospp inside a voxel-based patient geometry was successfully verified.

60 APPLIED LIFE SCIENCES↗

Adopting Code Verification Methodology Based on Model Form

Code verification is an essential part of credibility analysis for computational models. It assesses whether the mathematical model is implemented correctly into the code and whether the numerical methods behave consistently, and is done before solution verification and validation. Robust guidance for code verification exists in the literature. However, there is no known, concise guide for selecting the approach based on the model form that also presents an overview of the common elements. This document was written to address this gap as an accessible reference for beginning a code-verification effort.

97 MATHEMATICS AND COMPUTING↗

Adapting Code Verification Methodology to Model Form

Code verification is an essential part of credibility analysis for computational models. It assesses whether the mathematical model is implemented correctly into the code and whether the numerical methods behave consistently, and is done before solution verification and validation. Robust guidance for code verification exists in the literature. However, there is no known, concise guide for selecting the approach based on the model form that also presents an overview of the common elements. This document was written to address this gap as an accessible reference for beginning a code-verification effort.

97 MATHEMATICS AND COMPUTING↗

Numerical multi-scaling method to solve the linear stochastic partial differential equations

In this paper, we propose a multi-scaling method to solve a class of the stochastic partial differential equations (SPDEs) of Itô-type. By this method, we approximate the solution of the SPDEs with strongly elliptic operator on a finite domain. The method is based on B-spline wavelet approximations; some of these functions are reshaped to satisfy on boundary conditions exactly. We prove the consistency and stability of the method. Illustrative examples are included to demonstrate the validity and applicability of our proposed technique.

97 MATHEMATICS AND COMPUTING↗

Detecting False Data Injection Attacks in Smart Grids: A Semi-Supervised Deep Learning Approach

The dependence on advanced information and communication technology increases the vulnerability in smart grids under cyber-attacks. Recent research on unobservable false data injection attacks (FDIAs) reveals the high risk of secure system operation, since these attacks can bypass current bad data detection mechanisms. To mitigate this risk, this paper proposes a data-driven learning-based algorithm for detecting unobservable FDIAs in distribution systems. We use autoencoders for efficient dimension reduction and feature extraction of measurement datasets. Further, we integrate the autoencoders into an advanced generative adversarial network (GAN) framework, which successfully detects anomalies under FDIAs by capturing the unconformity between abnormal and secure measurements. Also, considering that the datasets collected from practical power systems are partially labeled due to expensive labeling costs and missing labels, the proposed method only requires a few labeled measurement data in addition to unlabeled data for training. Numerical simulations in three-phase unbalanced IEEE 13-bus and 123-bus distribution systems validate the detection accuracy and efficiency of this method.

97 MATHEMATICS AND COMPUTING↗

New Version of the MCNP Analytic Criticality Benchmark Suite

Analytical benchmarks provide an invaluable tool for verifying computer codes used to simulate neutron transport. Several collections of analytical benchmark problems are used routinely in the verification of production Monte Carlo codes such as MCNP{sup R}. Verification of a computer code is a necessary prerequisite to the more complex validation process. The verification process confirms that a code performs its intended functions correctly. The validation process involves determining the absolute accuracy of code results vs. nature. In typical validations, results are computed for a set of benchmark experiments using a particular methodology (code, cross-section data with uncertainties, and modeling) and compared to the measured results from the set of benchmark experiments. The validation process determines bias, bias uncertainty, and possibly additional margins. Verification is generally performed by the code developers, while validation is generally performed by code users for a particular application space. The VERIFICATION-KEFF suite of criticality problems was originally a set of 75 criticality problems found in the literature for which exact analytical solutions are available. Even though the spatial and energy detail is necessarily limited in analytical benchmarks, typically to a few regions or energy groups, the exact solutions obtained can be used to verify that the basic algorithms, mathematics, and methods used in complex production codes perform correctly. The present work has focused on revisiting this benchmark suite. A thorough review of the problems resulted in discarding some of them as not suitable for MCNP benchmarking. For the remaining problems, many of them were reformulated to permit execution in either multigroup mode or in the normal continuous-energy mode for MCNP. Execution of the benchmarks in continuous-energy mode provides a significant advance to MCNP verification methods. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Weighted greedy-optimal design of computer experiments for kernel-based and Gaussian process model emulation and calibration

This article is concerned with the approximation of high-dimensional functions by kernel-based methods. Motivated by uncertainty quantification, which often necessitates the construction of approximations that are accurate with respect to a probability density function of random variables, we aim at minimizing the approximation error with respect to a weighted $L^p$-norm. We present a greedy procedure for designing computer experiments based upon a weighted modification of the pivoted Cholesky factorization. The method successively generates nested samples with the goal of minimizing error in regions of high probability. Numerical experiments validate that this new importance sampling strategy is superior to other sampling approaches, especially when used with non-product probability density functions. We also show how to use the proposed algorithm to efficiently generate surrogates for inferring unknown model parameters from data.

97 MATHEMATICS AND COMPUTING↗

Ab Initio Computation of the Longitudinal Response Function in 40 Ca

In this work, we present a consistent ab initio computation of the longitudinal response function RL in 40 Ca using the coupled-cluster and Lorentz integral transform methods starting from chiral nucleon-nucleon and three-nucleon interactions. We validate our approach by comparing our results for R L in 4 He and the Coulomb sum rule in 40 Ca against experimental data and other calculations. For R L in 40 Ca we obtain a very good agreement with experiment in the quasielastic peak up to intermediate momentum transfers, and we find that final state interactions are essential for an accurate description of the data. This work presents a milestone towards ab initio computations of neutrino-nucleus cross sections relevant for experimental long-baseline neutrino programs.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗