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 1,513 records · Page 84

Thermal Overloading Risk Mitigation With a Semi-Analytical Probabilistic Model on Branch Current

A semi-analytical formulation is presented in this paper for the probability computation of branch current in multiphase systems. The developed formula is derived based on the linear power flow model in rectangular coordinates. The system uncertainty injections can be renewable energy resources or loads and are modeled using a Gaussian mixture model (GMM). The developed formula can be used to compute the line current violation probability as well as integrate into optimal power flow problem as chance-constraint relaxation. Here, the proposed formula is first compared with the Matlab embedded numerical integration function to show its performance. Besides, the semi-analytical formula is validated and compared with the Monte Carlo simulation method using the IEEE 123-bus system, EPRI Ckt5, and Ckt7 systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Black-box optimization of CT acquisition and reconstruction parameters: a reinforcement learning approach

Protocol optimization is critical in Computed Tomography (CT) for achieving desired diagnostic image quality while minimizing radiation dose. Due to the inter-effect of influencing CT parameters, traditional optimization methods rely on the testing of exhaustive combinations of these parameters. This poses a notable limitation due to the impracticality of exhaustive parameter testing. This study introduces a novel methodology leveraging Virtual Imaging Trials (VITs) and reinforcement learning to more efficiently optimize CT protocols. Computational phantoms with liver lesions were imaged using a validated CT simulator and reconstructed with a novel CT reconstruction Toolkit. The optimization parameter space included tube voltage, tube current, reconstruction kernel, slice thickness, and pixel size. The optimization process was done using a Proximal Policy Optimization (PPO) agent which was trained to maximize the Detectability Index (d’) of the liver lesion for each reconstructed image. Results showed that our reinforcement learning approach found the absolute maximum d’ across the test cases while requiring 79.7% fewer steps compared to an exhaustive search, demonstrating both accuracy and computational efficiency, offering a efficient and robust framework for CT protocol optimization. The flexibility of the proposed technique allows for use of varying image quality metrics as the objective metric to maximize for. Our findings highlight the advantages of combining VIT and reinforcement learning for CT protocol management.

Fenwick, David [Duke University Medical Center]↗

TU-CD-BRB-02: BEST IN PHYSICS (JOINT IMAGING-THERAPY): Identification of Molecular Phenotypes by Integrating Radiomics and Genomics

Purpose: To uncover the mechanistic connections between radiomic features, molecular pathways, and clinical outcomes, to develop radiomic based predictors of pathway activation states in individual patients, and to assess whether combining radiomic with clinical and genomic data improves prognostication. Methods: We analyzed two independent lung cancer cohorts totaling 351 patients, for whom diagnostic computed tomography (CT) scans, gene-expression profiles, and clinical outcomes were available. The tumor phenotype was characterized based on 636 radiomic features describing tumor intensity, texture, shape and size. We performed an integrative analysis by developing and independently validating association modules of coherently expressed radiomic features and molecular pathways. These modules were statistically tested for significant associations to overall survival (OS), TNM stage, and pathologic histology. Results: We identified thirteen radiomic-pathway association modules (p < 0.05), the most prominent of which were associated with the immune system, p53 pathway, and other pathways involved in cell cycle regulation. Eleven modules were significantly associated with clinical outcomes (p < 0.05). Strong predictive power for pathway activation states in individual patients was observed using radiomics; the strongest per module predictions ranged from an intra-tumor heterogeneity feature predicting RNA III polymerase transcription (AUC 0.62, p = 0.03), to a tumor intensity dispersion feature predicting pyruvate metabolism and citric acid TCA cycle (AUC 0.72, p < 10−{sup 6}). Stepwise combinations of radiomic data with clinical outcomes and gene expression profiles resulted in consistent increases of prognostic power to predict OS (concordance index max = 0.73, p < 10−{sup 9}). Conclusion: This study demonstrates that radiomic approaches permit a non-invasive assessment of molecular and clinical characteristics of tumors, and therefore have the unprecedented potential to cost-effectively advance clinical decision-making using routinely acquired, standard-of-care imaging data. We show that prognostic value complementary to clinical and genomic information can be obtained by radiomic strategies.

60 APPLIED LIFE SCIENCES↗

First principles materials design of novel functional oxides

We review our efforts to develop and implement robust computational approaches for exploring phase stability to facilitate the prediction-to-synthesis process of novel functional oxides. These efforts focus on a synergy between (i) electronic structure calculations for properties predictions, (ii) phenomenological/empirical methods for examining phase stability as related to both phase segregation and temperature-dependent transitions and (iii) experimental validation through synthesis and characterization. We illustrate this philosophy by examining an inaugural study that seeks to discover novel functional oxides with high piezoelectric responses. Lastly, our results show progress towards developing a framework through which solid solutions can be studied to predict materials with enhanced properties that can be synthesized and remain active under device relevant conditions.

36 MATERIALS SCIENCE↗

An Approach for Validating Actinide and Fission Product Burnup Credit Criticality Safety Analyses: Criticality (k eff ) Predictions

One of the most important remaining challenges associated with expanded implementation of burnup credit in the United States is the validation of depletion and criticality calculations used in the safety evaluation—in particular, the availability and use of applicable measured data to support validation, especially for fission products (FPs). Applicants and regulatory reviewers have been constrained by both a scarcity of data and a lack of clear technical basis or approach for use of the data. In this study, this paper describes a validation approach for commercial spent nuclear fuel (SNF) criticality safety (k eff ) evaluations based on best-available data and methods and applies the approach for representative SNF storage and transport configurations/conditions to demonstrate its usage and applicability, as well as to provide reference bias results. The criticality validation approach utilizes not only available laboratory critical experiment (LCE) data from the International Handbook of Evaluated Criticality Safety Benchmark Experiments and the French Haut Taux de Combustion program to support validation of the principal actinides but also calculated sensitivities, nuclear data uncertainties, and limited available FP LCE data to predict and verify individual biases for relevant minor actinides and FPs. The results demonstrate that (a) sufficient critical experiment data exist to adequately validate k eff calculations via conventional validation approaches for the primary actinides, (b) sensitivity-based critical experiment selection is more appropriate for generating accurate application model bias and uncertainty, and (c) calculated sensitivities and nuclear data uncertainties can be used for generating conservative estimates of bias for minor actinides and FPs. Results based on the SCALE 6.1 and the ENDF/B-VII.0 cross-section libraries indicate that a conservative estimate of the bias for the minor actinides and FPs is 1.5% of their worth within the application model. Finally, this paper provides a detailed description of the approach and its technical bases, describes the application of the approach for representative pressurized water reactor and boiling water reactor safety analysis models, and provides reference bias results based on the prerelease SCALE 6.1 code package and ENDF/B-VII nuclear cross-section data.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

A backward SDE method for uncertainty quantification in deep learning

Here, we develop a backward stochastic differential equation based probabilistic machine learning method, which formulates a class of stochastic neural networks as a stochastic optimal control problem. An efficient stochastic gradient descent algorithm is introduced with the gradient computed through a backward stochastic differential equation. Convergence analysis for stochastic gradient descent optimization and numerical experiments for applications of stochastic neural networks are carried out to validate our methodology in both theory and performance.

97 MATHEMATICS AND COMPUTING↗

LQS_INVERSION v. 1.0

FORTRAN90 codes for inversion of electrostatic geophysical data in terms of three subsurface parameters in a single-well, oilfield environment: the linear charge density of the steel well casing (L), the point charge associated with an induced fracture filled with a conductive contrast agent (Q) and the location of said fracture (s). Theory is described in detail in Weiss et al. (Geophysics, 2016). Inversion strategy is to loop over candidate fracture locations, and at each one minimize the squared Cartesian norm of the data misfit to arrive at L and Q. Solution method is to construct the 2x2 linear system of normal equations and compute L and Q algebraically. Practical Application: Oilfield environments where observed electrostatic geophysical data can reasonably be assumed by a simple L-Q-s model. This may include hydrofracking operations, as postulated in Weiss et al. (2016), but no field validation examples have so far been provided.

Weiss, Chester J↗

On-board Radiation Sensor and Low-Altitude Contour Mapping of Radiation Fields using UAS Swarm - 18239

This paper addresses the design of light weight radiation sensors for the small-scale unmanned aerial system (UAS), and its implementation for low-altitude radiation source localization and contour mapping. The compact, high-resolution gamma-ray CZT sensors were integrated to UAS platforms as plug-and-play components using Robot Operation System (ROS). In this work, the UAS swarm consists of three platforms positioned in circular formation. The onboard data analysis provides time and position stamped intensities of gamma-ray peaks for each UAS-based sensor that are used as the input data for the swarm flight control algorithm. Each UAS measures radiation simultaneously for estimating gradient of radiation to compute a bulk heading angle of the swarm for contour mapping, which can provide relatively precise boundary of the safe area for potential human exploration. The UAS radiation sensors allow measurements from just few meters up to hundreds of meters thus filling the gap between land- and helicopter- based platforms. The swarm of UAS has advantages over a single agent based approach in detecting radiative sources and effectively mapping the area. The proposed method can locate sources of radiation as well as mapping the contaminated area for enhancing situation awareness capabilities for first responders. Computer simulation is presented for UAS swarm based source localization and contour mapping in the simulated radiation fields created by the MCNP code. Selected key gradient estimation and contour mapping algorithms are validated experimentally with small scale multicopter UAS in the indoor flight test bed. (authors)

42 ENGINEERING↗

Study the thermal radiation effects in gas-solid flows with gray and non-gray P1 models implemented in MFiX

Thermal radiation is a dominant mode of heat transfer in combustion/gasification, packed/circulating bed reactors, and energy storage/conversion devices. In hydrocarbon fuel combustion, the high absorption and emission of product gases like CO 2 and H 2 O significantly affect the heat transfer characteristics. It is essential to understand the radiative energy propagation in such applications. In the present study, we developed a framework to implement the P-1 radiation model in MFiX for Eulerian-Eulerian (Two fluid-TFM) and Eulerian-Lagrangian (Discrete element-DEM and Particle in cell-PIC) models. The P-1 is a simplification of the spherical harmonics method. The framework has been verified on various flue gas conditions. The verified solver results are validated against the benchmark results available in the literature. The verified and validated gray and non-gray weighted sum of gray gas models is evaluated for dry and wet flue gas conditions. Further, they are also used to study gas-solid flows in a fluidized bed/riser.

20 FOSSIL-FUELED POWER PLANTS↗

GOTTCHA, Version2

One major challenge in the field of shotgun metagenomics is the accurate identification of the organisms present within the community, based on classification of short sequence reads. Though microbial community profiling methods have emerged to attempt to rapidly classify the millions of reads output from contemporary sequencers, the combination of incomplete databases, similarity among otherwise divergent genomes, and the large volumes of sequencing data required for metagenome sequencing has led to unacceptably high false discovery rates (FDR). Here we present the application of a novel, gene-independent and signature-based metagenomic taxonomic profiling tool with significantly smaller FDR, which is also capable of classifying never-before seen genomes into the appropriate parent taxa.The algorithm is based upon three primary computational phases: (I) genomic decomposition into bit vectors, (II) bit vector intersections to identify shared regions, and (III) bit vector subtractions to remove shared regions and reveal unique, signature regions. In the Decomposition phase, genomic data is first masked to highlight only the valid (non-ambiguous) regions and then decomposed into overlapping 24-mers. The k-mers are sorted along with their start positions, de-replicated, and then prefixed, to minimize data duplication. The prefixes are indexed and an identical data structure is created for the start positions to mimic that of the k-mer data structure. During the Intersection phase -- which is the most computationally intensive phase -- as an all-vs-all comparison is made, the number of comparisons is first reduced by four methods: (a) Prefix restriction, (b) Overlap detection, (c) Overlap restriction, and (d) Result recording. In Prefix restriction, only k-mers of the same prefix are compared. Within that group, potential overlap of k-mer suffixes that would result in a non-empty set intersection are screened for. If such an overlap exists, the region which intersects is first reduced by performing a binary search of the boundary suffixes of the smaller set into the larger set, which defines the limits of the zipper-based intersection process. Rather than recording the actual k-mers of the intersection, another data structure of identical "shape" is created which consists of only bit vectors so that only a 1 or 0 will be stored in the location of the k-mer suffix that was found in the intersection. This reduces the amount of data generated and stored considerably. During the Subtraction phase, relevant intersection bitmasks are first unionized together to form a single bitmask which is then applied over the original genome to reveal only those regions of the genome that are unique. These regions are then exported to disk in FASTA format and used in the application of determining the constituents of an unknown metagenomic community.

Freitas, Tracey↗

GOTTCHA, Version 1

One major challenge in the field of shotgun metagenomics is the accurate identification of the organisms present within the community, based on classification of short sequence reads. Though microbial community profiling methods have emerged to attempt to rapidly classify the millions of reads output from contemporary sequencers, the combination of incomplete databases, similarity among otherwise divergent genomes, and the large volumes of sequencing data required for metagenome sequencing has led to unacceptably high false discovery rates (FDR). Here we present the application of a novel, gene-independent and signature-based metagenomic taxonomic profiling tool with significantly smaller FDR, which is also capable of classifying never-before seen genomes into the appropriate parent taxa.The algorithm is based upon three primary computational phases: (I) genomic decomposition into bit vectors, (II) bit vector intersections to identify shared regions, and (III) bit vector subtractions to remove shared regions and reveal unique, signature regions. In the Decomposition phase, genomic data is first masked to highlight only the valid (non-ambiguous) regions and then decomposed into overlapping 24-mers. The k-mers are sorted along with their start positions, de-replicated, and then prefixed, to minimize data duplication. The prefixes are indexed and an identical data structure is created for the start positions to mimic that of the k-mer data structure. During the Intersection phase -- which is the most computationally intensive phase -- as an all-vs-all comparison is made, the number of comparisons is first reduced by four methods: (a) Prefix restriction, (b) Overlap detection, (c) Overlap restriction, and (d) Result recording. In Prefix restriction, only k-mers of the same prefix are compared. Within that group, potential overlap of k-mer suffixes that would result in a non-empty set intersection are screened for. If such an overlap exists, the region which intersects is first reduced by performing a binary search of the boundary suffixes of the smaller set into the larger set, which defines the limits of the zipper-based intersection process. Rather than recording the actual k-mers of the intersection, another data structure of identical "shape" is created which consists of only bit vectors so that only a 1 or 0 will be stored in the location of the k-mer suffix that was found in the intersection. This reduces the amount of data generated and stored considerably. During the Subtraction phase, relevant intersection bitmasks are first unionized together to form a single bitmask which is then applied over the original genome to reveal only those regions of the genome that are unique. These regions are then exported to disk in FASTA format and used in the application of determining the constituents of an unknown metagenomic community.

Freitas, Tracey↗

Efficiently improving the performance of noisy quantum computers

Using near-term quantum computers to achieve a quantum advantage requires efficient strategies to improve the performance of the noisy quantum devices presently available. We develop and experimentally validate two efficient error mitigation protocols named "Noiseless Output Extrapolation" and "Pauli Error Cancellation" that can drastically enhance the performance of quantum circuits composed of noisy cycles of gates. By combining popular mitigation strategies such as probabilistic error cancellation and noise amplification with efficient noise reconstruction methods, our protocols can mitigate a wide range of noise processes that do not satisfy the assumptions underlying existing mitigation protocols, including non-local and gate-dependent processes. We test our protocols on a four-qubit superconducting processor at the Advanced Quantum Testbed. We observe significant improvements in the performance of both structured and random circuits, with up to 86 &#x0025; improvement in variation distance over the unmitigated outputs. Our experiments demonstrate the effectiveness of our protocols, as well as their practicality for current hardware platforms.

97 MATHEMATICS AND COMPUTING↗

A fully-integrated lattice Boltzmann method for fluid–structure interaction

Here we present a fully-integrated lattice Boltzmann (LB) method for fluid–structure interaction (FSI) simulations that efficiently models deformable solids in complex suspensions and active systems. Our Eulerian method (LBRMT) couples finite-strain solids to the LB fluid on the same fixed computational grid with the reference map technique (RMT). An integral part of the LBRMT is a new LB boundary condition for moving deformable interfaces across different densities. With this fully Eulerian solid–fluid coupling, the LBRMT is well-suited for parallelization and simulating multi-body contact without remeshing or extra meshes. We validate its accuracy via a benchmark of a deformable solid in a lid-driven cavity, then showcase its versatility through examples of soft solids rotating and settling. The LBRMT achieves a spatial convergence rate between first-order and second-order for FSI simulations and is designed for low to intermediate Reynolds number flows with finite inertia at small Mach numbers. With simulations of complex suspensions mixing, we highlight the potential of the LBRMT for studying collective behavior in soft matter and biofluid dynamics.

97 MATHEMATICS AND COMPUTING↗

Monte Carlo simulations of the dose from imaging with GE eXplore 120 micro-CT using GATE

Purpose: Small animals are increasingly used as translational models in preclinical imaging studies involving microCT, during which the subjects can be exposed to large amounts of radiation. While the radiation levels are generally sublethal, studies have shown that low-level radiation can change physiological parameters in mice. In order to rule out any influence of radiation on the outcome of such experiments, or resulting deterministic effects in the subjects, the levels of radiation involved need to be addressed. The aim of this study was to investigate the radiation dose delivered by the GE eXplore 120 microCT non-invasively using Monte Carlo simulations in GATE and to compare results to previously obtained experimental values. Methods: Tungsten X-ray spectra were simulated at 70, 80, and 97 kVp using an analytical tool and their half-value layers were simulated for spectra validation against experimentally measured values of the physical X-ray tube. A Monte Carlo model of the microCT system was set up and four protocols that are regularly applied to live animal scanning were implemented. The computed tomography dose index (CTDI) inside a PMMA phantom was derived and multiple field of view acquisitions were simulated using the PMMA phantom, a representative mouse and rat. Results: Simulated half-value layers agreed with experimentally obtained results within a 7% error window. The CTDI ranged from 20 to 56 mGy and closely matched experimental values. Derived organ doses in mice reached 459 mGy in bones and up to 200 mGy in soft tissue organs using the highest energy protocol. Dose levels in rats were lower due to the increased mass of the animal compared to mice. The uncertainty of all dose simulations was below 14%. Conclusions: Monte Carlo simulations proved a valuable tool to investigate the 3D dose distribution in animals from microCT. Small animals, especially mice (due to their small volume), receive large amounts of radiation from the GE eXplore 120 microCT, which might alter physiological parameters in a longitudinal study setup.

60 APPLIED LIFE SCIENCES↗

WE-A-17A-04: Development of An Ultra-Fast Monte Carlo Dose Engine for High Dose Rate Brachytherapy

Purpose: Current clinical brachytherapy dose calculations are based on AAPM TG43 guidelines, which approximate the patient geometry as a large water phantom. This ignores heterogeneities and tends to overestimate skin dose. Although Monte Carlo (MC) dose calculations have been recognized as the most accurate method, its associated long computational time is a major bottleneck for routine clinical applications. This work aims to develop a GPU-based ultra-fast MC dose engine (gBMC) for HDR brachytherapy to provide clinical users with accurate sub-minute dose calculations. Methods: Standard photon transport with discrete events including: Compton scattering, Rayleigh scattering and Photoelectric effect, was implemented. Secondary electrons were transported under the continuous slowing down approximation. To reduce the GPU thread divergence, photons and electrons were separately transported. Transport of photons was grouped according to energy. The source model in gBMC can be either a phase-space file generated using Geant4 or a parameterized source model. This dose engine was validated against TG43 in a water phantom and against Geant4 calculations in heterogeneous patient geometries. Results: A phase space file was generated for the Varian VS2000 Ir-192 source. In a water phantom, the calculated radial dose function was within 0.6% of the TG43 calculations for radial distances from 1 cm to 20 cm. The anisotropy functions were within 1% for radial distances from 1 cm to 20 cm except for polar angles larger than 173°. Local point-dose differences were within 2%. In a Mammosite breast cancer case with 22 dwell locations, gBMC and Geant4 isodose lines compared well. The computation time was about 28 seconds using the phase-space file source and 20 seconds using the parameterized source to simulate 1 billion particles, yielding less than 1% statistical uncertainty. Conclusion: The gBMC dose engine makes it possible to use fast and accurate MC dose calculations for clinical work.

60 APPLIED LIFE SCIENCES↗

Quantum computing for energy correlators

In recent years, energy correlators have emerged as powerful observables for probing the fragmentation dynamics of high-energy collisions. We introduce the first numerical strategy for calculating energy correlators using the Hamiltonian lattice approach, providing access to the intriguing nonperturbative dynamics of these observables. Furthermore, motivated by rapid advances in quantum computing hardware and algorithms, we propose a quantum algorithm for calculating energy correlators in quantum field theories. This algorithm includes ground state preparation, the application of source, sink, energy flux and real-time evolution operators, and the Hadamard test. We validate our approach by applying it to the SU(2) pure gauge theory in 2 + 1 dimensions on 3 × 3 and 5 × 5 honeycomb lattices with 𝑗 max = $\frac{1}{2}$ at various couplings, utilizing both classical methods and the quantum algorithm, the latter tested using the IBM emulator for specific configurations. The results are consistent with the expected behavior of the strong coupling regime and motivate a more comprehensive study to probe the confinement dynamics across the weak and strong coupling regimes.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

New approach based on group technology for the consolidation problem in cloud computing-mathematical model and genetic algorithm

Resource management is a hotspot issue in distributed systems like cloud computing (CC). It means how to prepare the computational resources, i.e., servers and virtual machines (VMS), to execute the tasks. This paper offers a new approach based on Group Technology (GT)—known as a powerful philosophy for the resource management in cellular manufacturing systems—to deal with the resource management problem in CC. We develop a mathematical model to optimally consolidate the VMs, servers and tasks simultaneously to control several important factors such as task migrations and server load variation, as well as the number of VMs. To test the validity of our proposed model, several small problems are generated randomly and solved by LINGO 9 software. Furthermore, to cope with larger problems, which cannot be solved optimally, a genetic algorithm is proposed. We, finally, compare our methods with the most well-known algorithms in this context, round robin (RR) and first-come, first-served (FCFS) algorithms.

97 MATHEMATICS AND COMPUTING↗