Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computing methodologies”

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,225 records · Page 68

Predicting ecosystem metaphenome from community metagenome: A grand challenge for environmental biology

Abstract Elucidating how an organism's characteristics emerge from its DNA sequence has been one of the great triumphs of biology. This triumph has cumulated in sophisticated computational models that successfully predict how an organism's detailed phenotype emerges from its specific genotype. Inspired by that effort's vision and empowered by its methodologies, a grand challenge is described here that aims to predict the biotic characteristics of an ecosystem, its metaphenome, from nucleic acid sequences of all the species in its community, its metagenome. Meeting this challenge would integrate rapidly advancing abilities of environmental nucleic acids (eDNA and eRNA) to identify organisms, their ecological interactions, and their evolutionary relationships with advances in mechanistic models of complex ecosystems. Addressing the challenge would help integrate ecology and evolutionary biology into a more unified and successfully predictive science that can better help describe and manage ecosystems and the services they provide to humanity.

59 BASIC BIOLOGICAL SCIENCES↗

Validation of Imaging With Pathology in Laryngeal Cancer: Accuracy of the Registration Methodology

Purpose: To investigate the feasibility and accuracy of an automated method to validate gross tumor volume (GTV) delineations with pathology in laryngeal and hypopharyngeal cancer. Methods and Materials: High-resolution computed tomography (CT{sub HR}), magnetic resonance imaging (MRI), and positron emission tomography (PET) scans were obtained from 10 patients before total laryngectomy. The GTV was delineated separately in each imaging modality. The laryngectomy specimen was sliced transversely in 3-mm-thick slices, and whole-mount hematoxylin-eosin stained (H and E) sections were obtained. A pathologist delineated tumor tissue in the H and E sections (GTV{sub PATH}). An automatic three-dimensional (3D) reconstruction of the specimen was performed, and the CT{sub HR}, MRI, and PET were semiautomatically and rigidly registered to the 3D specimen. The accuracy of the pathology-imaging registration and the specimen deformation and shrinkage were assessed. The tumor delineation inaccuracies were compared with the registration errors. Results: Good agreement was observed between anatomical landmarks in the 3D specimen and in the in vivo images. Limited deformations and shrinkage (3% {+-} 1%) were found inside the cartilage skeleton. The root mean squared error of the registration between the 3D specimen and the CT, MRI, and PET was on average 1.5, 3.0, and 3.3 mm, respectively, in the cartilage skeleton. The GTV{sub PATH} volume was 7.2 mL, on average. The GTVs based on CT, MRI, and PET generated a mean volume of 14.9, 18.3, and 9.8 mL and covered the GTV{sub PATH} by 85%, 88%, and 77%, respectively. The tumor delineation inaccuracies exceeded the registration error in all the imaging modalities. Conclusions: Validation of GTV delineations with pathology is feasible with an average overall accuracy below 3.5 mm inside the laryngeal skeleton. The tumor delineation inaccuracies were larger than the registration error. Therefore, an accurate histological validation of anatomical and functional imaging techniques for GTV delineation is possible in laryngeal cancer patients.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Characterizing Impacts of Storage Faults on HPC Applications: A methodology and insights

In recent years, the increasing complexity in scientific simulations and emerging demands for training heavy artificial intelligence models require massive and fast data accesses, which urges high-performance computing (HPC) platforms to equip with more advanced storage infrastructures such as solid-state disks (SSDs). While SSDs offer high-performance I/O, it remains unclear about the reliability challenges faced by the HPC applications under the SSD-related failures, in particular, failures resulting in data corruptions. The goal of this paper is to understand the impact of SSD-related data corruptions on the behaviors of complex HPC applications. To this end, we propose FFIS, a FUSE-based fault injection framework that systematically introduces storage faults into the application layer to model the errors originated from SSDs. FFIS is able to plant different I/O related faults into the data returned from underlying file systems, which also enables the investigation on the error resilience characteristics of the scientific file format for the first time. We demonstrate the use of FFIS with three representative real HPC applications, show how each application reacts to the data corruptions, and provide insights on the error resilience of the widely-adopted HDF5 file format for the HPC applications.

Fang, Bo↗

Computed Tomography Scanning and Geophysical Measurements of the Caney Shale Formation from the Tomaney #1-35-34-27 Well

Evaluation of reservoir samples can support resource estimation and determination of effective extraction methodologies. While it is common for commercial entities to perform these characterizations, the resources necessary to conduct these analyses are not always available to the broader interest base, such as state agencies, universities, and research-based consortiums. To meet the growing need for comprehensive and high-quality lithologic data for collaborative research initiatives, the U.S. Department of Energy’s (DOE) National Energy Technology Laboratory (NETL) has used available resources in conjunction with previous techniques and new, innovative methodologies to develop a systematic approach for the evaluation of cores. This report focuses on the Tomaney #1-35-34-27 well. Tomaney #1-35-34-27 was drilled in southwestern Stephens County, Oklahoma within section 35, township 2S, and range 4W. The Tomaney #1-35-34-27 was drilled in January/February of 2020 and targeted the Devonian Woodford Shale Formation and cored the Mississippian Caney Shale formation within the Ardmore Basin.

04 OIL SHALES AND TAR SANDS↗

Fast-forwarding quantum simulation with real-time quantum Krylov subspace algorithms

Quantum subspace diagonalization (QSD) algorithms have emerged as a competitive family of algorithms that avoid many of the optimization pitfalls associated with parameterized quantum circuit algorithms. While the vast majority of the QSD algorithms have focused on solving the eigenpair problem for ground, excited-state, and thermal observable estimation, there has been a lot less work in considering QSD algorithms for the problem of quantum dynamical simulation. In this work, we propose several quantum Krylov fast-forwarding (QKFF) algorithms capable of predicting long-time dynamics well beyond the coherence time of current quantum hardware. Our algorithms use real-time evolved Krylov basis states prepared on the quantum computer and a multi-reference subspace method to ensure convergence towards high-fidelity, long-time dynamics. In particular, we show that the proposed multi-reference methodology provides a systematic way of trading off circuit depth with classical post-processing complexity. Further, we also demonstrate the efficacy of our approach through numerical implementations for several quantum chemistry problems including the calculation of the auto-correlation and dipole moment correlation functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

ProDeGe: A computational protocol for fully automated decontamination of genomes

Single amplified genomes and genomes assembled from metagenomes have enabled the exploration of uncultured microorganisms at an unprecedented scale. However, both these types of products are plagued by contamination. Since these genomes are now being generated in a high-throughput manner and sequences from them are propagating into public databases to drive novel scientific discoveries, rigorous quality controls and decontamination protocols are urgently needed. Here, we present ProDeGe (Protocol for fully automated Decontamination of Genomes), the first computational protocol for fully automated decontamination of draft genomes. ProDeGe classifies sequences into two classes—clean and contaminant—using a combination of homology and feature-based methodologies. On average, 84% of sequence from the non-target organism is removed from the data set (specificity) and 84% of the sequence from the target organism is retained (sensitivity). Lastly, the procedure operates successfully at a rate of ~0.30 CPU core hours per megabase of sequence and can be applied to any type of genome sequence.

59 BASIC BIOLOGICAL SCIENCES↗

Blood Flow: Multi-scale Modeling and Visualization (July 2011)

Multi-scale modeling of arterial blood flow can shed light on the interaction between events happening at micro- and meso-scales (i.e., adhesion of red blood cells to the arterial wall, clot formation) and at macro-scales (i.e., change in flow patterns due to the clot). Coupled numerical simulations of such multi-scale flow require state-of-the-art computers and algorithms, along with techniques for multi-scale visualizations. This animation presents early results of two studies used in the development of a multi-scale visualization methodology. The first illustrates a flow of healthy (red) and diseased (blue) blood cells with a Dissipative Particle Dynamics (DPD) method. Each blood cell is represented by a mesh, small spheres show a sub-set of particles representing the blood plasma, while instantaneous streamlines and slices represent the ensemble average velocity. In the second we investigate the process of thrombus (blood clot) formation, which may be responsible for the rupture of aneurysms, by concentrating on the platelet blood cells, observing as they aggregate on the wall of an aneruysm. Simulation was performed on Kraken at the National Institute for Computational Sciences. Visualization was produced using resources of the Argonne Leadership Computing Facility at Argonne National Laboratory.

59 BASIC BIOLOGICAL SCIENCES↗

Solution verification, goal-oriented adaptive methods for stochastic advection–diffusion problems

A goal-oriented analysis of linear, stochastic advection–diffusion models is presented which provides both a method for solution verification as well as a basis for improving results through adaptation of both the mesh and the way random variables are approximated. A class of model problems with random coefficients and source terms is cast in a variational setting. Specific quantities of interest are specified which are also random variables. A stochastic adjoint problem associated with the quantities of interest is formulated and a posteriori error estimates are derived. These are used to guide an adaptive algorithm which adjusts the sparse probabilistic grid so as to control the approximation error. Numerical examples are given to demonstrate the methodology for a specific model problem.

97 MATHEMATICS AND COMPUTING↗

A simple and practical process modeling methodology for pressure swing adsorption

Although many dynamic models exist for the design and simulation of pressure swing adsorption (PSA) processes, these models involve the solution of a complex system of coupled partial differential equations. Process engineers need a simple, practical, and yet robust short-cut model that helps decide whether to implement a PSA system in a process flowsheet. This work presents a “virtual” moving bed modeling methodology that considers only mass and energy balances and adsorption isotherms to describe the cyclic steady state behavior of PSA systems. Similar to tray efficiencies in distillation calculations, adsorption efficiencies are further introduced to account for system “non-ideality.” Finally, a lab-scale air separation system is used to illustrate the application of this modeling methodology.

42 ENGINEERING↗

Mape Maker: A Scenario Creator

We describe algorithms for creating probabilistic scenarios for the situation when the underlying forecast methodology is modeled as being more (or less) accurate than it has been historically. Such scenarios can be used in studies that extend into the future and may need to consider the possibility that forecast technology will improve. Our approach can also be used to generate alternative realizations of renewable energy production that are consistent with historical forecast accuracy, in effect serving as a method for creating families of realistic alternatives — which are often critical in simulation-based analysis methodologies.

42 ENGINEERING↗

Technical and Regulatory Aspects of Integrating Safety and Security at Nuclear Power Plants

This paper provides an overview of lessons learned in applying a dynamic computational framework that links results from a commercially available FOF simulation tool, a commercially available thermal-hydraulic tool, and EMRALD to an operating commercial nuclear power plant. This process of including plant procedures and multiple analysis results is being called Modeling and Analysis for Safety Security using Dynamic EMRALD Framework. It describes how a user could integrate their plant-specific FOF models with safety mitigation actions in EMRALD, and with thermal-hydraulic tools, such as MAAP. The work performed in this paper is based on a generic EMRALD model with actual plant data used for the analysis. However, only the generic model and general results of the analysis are presented for dissemination. No plant’s sensitive information is included in this paper. The discussion shows examples of insights that can be obtained from the proposed methodology.

97 MATHEMATICS AND COMPUTING↗

EStokTP: Electronic Structure to Temperature- and Pressure-Dependent Rate Constants—A Code for Automatically Predicting the Thermal Kinetics of Reactions

A priori rate predictions for gas phase reactions have undergone a gradual but dramatic transformation, with current predictions often rivaling the accuracy of the best available experimental data. The utility of such kinetic predictions would be greatly magnified if they could more readily be implemented for large numbers of systems. Here, we report the development of a new computational environment, namely, EStokTP, that reduces the human effort involved in the rate prediction for single channel reactions essentially to the specification of the methodology to be employed. The code can also be used to obtain all the necessary master equation building blocks for more complex reactions. In general, the prediction of rate constants involves two steps, with the first consisting of a set of electronic structure calculations and the second in the application of some form of kinetic solver, such as a transition state theory (TST)-based master equation solver. EStokTP provides a fully integrated treatment of both steps through calls to external codes to perform first the electronic structure and then the master equation calculations. It focuses on generating, extracting, and organizing the necessary structural properties from a sequence of calls to electronic structure codes, with robust automatic failure recovery options to limit human intervention. The code implements one or multidimensional hindered rotor treatments of internal torsional modes (with automated projection from the Hessian and with optional vibrationally adiabatic corrections), Eckart and multidimensional tunneling models (such as small curvature theory), and variational treatments (based on intrinsic reaction coordinate following). This focus on a robust implementation of high-level TST methods allows the code to be used in high accuracy studies of large sets of reactions, as illustrated here through sample studies of a few hundred reactions. At present, the following reaction types are implemented in EStokTP: abstraction, addition, isomerization, and beta-decomposition. Finally, preliminary protocols for treating barrierless reactions and multiple-well and/or multiple-channel potential energy surfaces are also illustrated.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Grid and basis adaptive polynomial chaos techniques for sensitivity and uncertainty analysis

The demand for accurate and computationally affordable sensitivity and uncertainty techniques is constantly on the rise and has become especially pressing in the nuclear field with the shift to Best Estimate Plus Uncertainty methodologies in the licensing of nuclear installations. Besides traditional, already well developed methods – such as first order perturbation theory or Monte Carlo sampling – Polynomial Chaos Expansion (PCE) has been given a growing emphasis in recent years due to its simple application and good performance. This paper presents new developments of the research done at TU Delft on such Polynomial Chaos (PC) techniques. Our work is focused on the Non-Intrusive Spectral Projection (NISP) approach and adaptive methods for building the PCE of responses of interest. Recent efforts resulted in a new adaptive sparse grid algorithm designed for estimating the PC coefficients. The algorithm is based on Gerstner's procedure for calculating multi-dimensional integrals but proves to be computationally significantly cheaper, while at the same it retains a similar accuracy as the original method. More importantly the issue of basis adaptivity has been investigated and two techniques have been implemented for constructing the sparse PCE of quantities of interest. Not using the traditional full PC basis set leads to further reduction in computational time since the high order grids necessary for accurately estimating the near zero expansion coefficients of polynomial basis vectors not needed in the PCE can be excluded from the calculation. Moreover the sparse PC representation of the response is easier to handle when used for sensitivity analysis or uncertainty propagation due to the smaller number of basis vectors. The developed grid and basis adaptive methods have been implemented in Matlab as the Fully Adaptive Non-Intrusive Spectral Projection (FANISP) algorithm and were tested on four analytical problems. These show consistent good performance both in terms of the accuracy of the resulting PC representation of quantities and the computational costs associated with constructing the sparse PCE. Basis adaptivity also seems to make the employment of PC techniques possible for problems with a higher number of input parameters (15–20), alleviating a well known limitation of the traditional approach. The prospect of larger scale applicability and the simplicity of implementation makes such adaptive PC algorithms particularly appealing for the sensitivity and uncertainty analysis of complex systems and legacy codes.

97 MATHEMATICS AND COMPUTING↗

Exploring the Use of Novel Spatial Accelerators in Scientific Applications

Driven by the need to find alternative accelerators which can viably replace GPUs in next-generation Supercomputing systems, this paper proposes a methodology to enable agile application/hardware co-design. The application-first methodology provides the ability to come up with design of accelerators while working with real-world workloads, available accelerators, and system software. The iterative design process targets a set of kernels in a workload for performance estimates that can prune the design space for later phases of detailed architectural evaluations. To this effect, in this paper, a novel data-parallel device model is introduced that simulates the latency of performance-sensitive operations in an accelerator including data transfers and kernel computation using multi-core CPUs. The use of off-the-shelf simulators, such as pre-RTL simulator Aladdin or multiple tools available for exploring the design of deep neural network accelerators (e.g., Timeloop) is demonstrated for evaluation of various accelerator designs using applications with realistic inputs. Examples of multiple device configurations that are instantiable in a system are explored to evaluate the performance benefit of deploying novel accelerators. The proposed device is integrated with a programming model and system software to potentially explore the impacts of high-level programming languages/compilers and low-level effects such as task scheduling on multiple accelerators. We analyze our methodology for a set of applications that represent high-performance computing (HPC) and graph analytics. The applications include a computational chemistry kernel realized using tensor contractions, triangle counting, GraphSAGE and Breadth-first Search. These applications include kernels such as dense matrix-dense matrix multiplication, sparse matrix-spare matrix multiplication, and sparse matrix-dense vector multiplication. Our results indicate potential performance benefits and insights for system design by including accelerators that realize these kernels along-side general purpose accelerators.

AI, codesign, Accelerated Computing, Modeling and ↗

Massive Data, the Digitization of Science, and Reproducibility of Results

As the scientific enterprise becomes increasingly computational and data-driven, the nature of the information communicated must change. Without inclusion of the code and data with published computational results, we are engendering a credibility crisis in science. Controversies such as ClimateGate, the microarray-based drug sensitivity clinical trials under investigation at Duke University, and retractions from prominent journals due to unverified code suggest the need for greater transparency in our computational science. In this talk I argue that the scientific method be restored to (1) a focus on error control as central to scientific communication and (2) complete communication of the underlying methodology producing the results, ie. reproducibility. I outline barriers to these goals based on recent survey work (Stodden 2010), and suggest solutions such as the “Reproducible Research Standard” (Stodden 2009), giving open licensing options designed to create an intellectual property framework for scientists consonant with longstanding scientific norms.

97 MATHEMATICS AND COMPUTING↗

Use of Forward Sensitivity Analysis Method to Improve Code Scaling, Applicability, and Uncertainty (CSAU) Methodology

Code Scaling, Applicability, and Uncertainty (CSAU) methodology was developed in late 1980s by US NRC to systematically quantify reactor simulation uncertainty. Basing on CSAU methodology, Best Estimate Plus Uncertainty (BEPU) methods have been developed and widely used for new reactor designs and existing LWRs power uprate. In spite of these successes, several aspects of CSAU have been criticized for further improvement: i.e., (1) subjective judgement in PIRT process; (2) high cost due to heavily relying large experimental database, needing many experts man-years work, and very high computational overhead; (3) mixing numerical errors with other uncertainties; (4) grid dependence and same numerical grids for both scaled experiments and real plants applications; (5) user effects; Although large amount of efforts have been used to improve CSAU methodology, the above issues still exist. With the effort to develop next generation safety analysis codes, new opportunities appear to take advantage of new numerical methods, better physical models, and modern uncertainty qualification methods. Forward sensitivity analysis (FSA) directly solves the PDEs for parameter sensitivities (defined as the differential of physical solution with respective to any constant parameter). When the parameter sensitivities are available in a new advanced system analysis code, CSAU could be significantly improved: (1) Quantifying numerical errors: New codes which are totally implicit and with higher order accuracy can run much faster with numerical errors quantified by FSA. (2) Quantitative PIRT (Q-PIRT) to reduce subjective judgement and improving efficiency: treat numerical errors as special sensitivities against other physical uncertainties; only parameters having large uncertainty effects on design criterions are considered. (3) Greatly reducing computational costs for uncertainty qualification by (a) choosing optimized time steps and spatial sizes; (b) using gradient information (sensitivity result) to reduce sampling number. (4) Allowing grid independence for scaled integral effect test (IET) simulation and real plant applications: (a) eliminate numerical uncertainty on scaling; (b) reduce experimental cost by allowing smaller scaled IET; (c) eliminate user effects. This paper will review the issues related to the current CSAU, introduce FSA, discuss a potential Q-PIRT process, and show simple examples to perform FSA. Finally, the general research direction and requirements to use FSA in a system analysis code will be discussed.

99 GENERAL AND MISCELLANEOUS↗

The ISO 50001 Impact Estimator Tool (IET 50001 V1.1.4) - User Guide and Introduction to the ISO 50001 Impacts Methodology

ISO 50001-Energy management systems – Requirements with guidance for use, is an internationally developed standard that provides organizations with a flexible framework for implementing an energy management system (EnMS) with the goal of continual energy performance improvement. The ISO 50001 standard was first published in 2011 and has since seen growth in the number of certificates issued around the world, primarily in the industrial (agriculture, manufacturing, and mining) and service (commercial) sectors. Policy makers in many regions and countries are looking to or are already using ISO 50001 as a basis for energy efficiency, carbon reduction, and other energy performance improvement schemes. The Impact Estimator Tool 50001 (IET 50001 Tool) is a computational model developed to assist researchers and policy makers determine the potential impact of ISO 50001 implementation in the industrial and service (commercial) sectors for a given region or country. The IET 50001 Tool is based upon a methodology initially developed by the Lawrence Berkeley National Laboratory that has been improved upon and vetted by a group of international researchers. By using a commonly accepted and transparent methodology, users of the IET 50001 Tool can easily and clearly communicate the potential impact of ISO 50001 for a region or country.

97 MATHEMATICS AND COMPUTING↗