Search NASA⌕ Search

SEARCH · Search NASA

Results for “COMPUTER SCIENCE”

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 703 records · Page 39

Solution-Based Adaptivity as a Paradigm for Computational Fluid Dynamics

This is the final report for the DOE Early Career award. Through innovation in error estimation and solution-based adaptation methods we strive to dramatically improve the efficiency and robustness of computational science and engineering simulations. By solution-based error estimation and adaptation we refer to techniques for estimating numerical error and efficiently reducing it through targeted discretization changes. In such a setting, high-order methods play a key role, though they are just one mechanism for efficient accuracy improvement. Other mechanisms include well known mesh size and stretching optimization, as well as less-practiced mesh motion and basis optimization. With additional work on the latter, we are integrating these techniques into one adaptive suite that maximizes efficiency and robustness of Computational Fluid Dynamics (CFD) calculations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Algorithms and Abstractions for Assembly in PDE Codes: Workshop Report

The emergence of high-concurrency architectures offering unprecedented performance has brought many high-performance partial differential equation (PDE) discretization codes to the precipice of a major refactor. To help address this challenge a workshop titled "Algorithms and Abstractions for Assembly in PDE Codes" was held in the Computer Science Research Institute at Sandia National Laboratories on May 12th-14th, 2014. This document summarizes the goals of the workshop and the results of the presentations and subsequent discussions.

97 MATHEMATICS AND COMPUTING↗

Biokinetic and Dosimetric Models [Slides]

Presentation describes internal dosimetry as an intersection of disciplines involving Physiology, Anatomy, Physics, Mathematics and Computer Science, which some people call "The art of Internal Dosimetry". The basic components for internal dose calculations are: Biokinetic (metabolic) models describing the intake, distribution, retention and excretion of radionuclides in the body, Dosimetric models describing the interaction of radiation within the several body organs and tissues, and System of dose limitation.

61 RADIATION PROTECTION AND DOSIMETRY↗

Asynchronous Graphs (Final Report)

The most performant massive-scale distributed graph analytic engines were essentially unusable for anything but the analytic they were tuned to solve. The project team had previously developed HavoqGT and used this project to demonstrate it as a flexible graph framework, aiming to extend algorithmic capabilities, improve underlying data structures, and develop novel communication paradigms to enable new data analysis missions. Highlights of the technology developed include (a) a new distributed communication paradigm dubbed You’ve Got Mail (YGM), (b) a performant exact and fuzzy HPC graph pattern matching approach, and (c) a distributed biased random walk simulation capability. The project was successful on several measurable fronts, including advancing computer science (reflected by publishing 14 peer-reviewed research papers yielding 4 publication awards and over 16 conference presentations), contributing tangibly to LLNL recruiting rare talent, and obtaining follow-on funding. These technologies were transferred to several FY19-20 programmatic projects and will continue to be leveraged by new research projects for several years.

97 MATHEMATICS AND COMPUTING↗

Algorithms to Improve Training for Deep Learning with Diabetic Retinopathy Images

This is a minisymposium presentation I plan to give at the SIAM conference on Computational Science and Engineering on March 1st, 2021. The work is based on research from my SDRD this year and describes a new pooling method we've developed called variable stride. The goal of the minisymposium is to highlight some of the ground-breaking work being done across the National Nuclear Security Administration by graduate students and Postdocs.

97 MATHEMATICS AND COMPUTING↗

Advanced Visualization for Scientific Data Analysis and Insight [Slides]

This talk will explore how we have used advanced visualization technologies to support analytical reasoning and knowledge discovery. Specifically, we will present several examples detailing some recent scientific successes using state-of-the-art immersive and high-resolution visualization at the National Renewable Energy Laboratory's Computational Science Center. On multiple occasions, we have observed scientists and engineers discover features in their data using advanced visualization technologies that they had not seen in prior investigations of their data on traditional desktop displays. We have embedded more information into our analytics tools, allowing engineers to explore complex multivariate spaces. We have observed how interactions seem to catalyze understanding.

97 MATHEMATICS AND COMPUTING↗

Utilizing Gamma Signals to Find Optimal Uranium Wells

Uranium is a very important resource when using nuclear power. Only a small fraction of the uranium we use in the US is domestically sourced. Our goal is to effectively find and mine uranium in a way that is generally accurate and not difficult. Using computer science and machine learning, we want to automate a reasoning system that geologists use to analyze where the uranium ore bodies are. Presenting a general explanation of the goals and impacts of this project for the High School Intern showcase.

58 - GEOSCIENCES↗

Improving Ligand Geometry in Protein Data Bank Structures Computationally

Information about the three‐dimensional structures of complex biological molecules is an indispensable research tool for many fields of study, including biology, chemistry, pharmacology, and computer science. The Protein Data Bank (PDB) is an public digital archive providing access to structures of nucleic acids, proteins, and large macromolecular machines determined experimentally by X‐ray crystallography, nuclear magnetic resonance (NMR) spectroscopy, and 3‐dimensional electron microscopy (3DEM). PDB structures undergo validation for structural plausibility upon their deposition into the PDB using the program Mogul, which cross references each deposited structure against similar data in the Cambridge Structural Database (CSD). Ligands associated with PDB structures are a common source of structural inaccuracy. In this study, a programmatic pipeline was developed to determine if ligand geometric accuracy could be improved using known computational tools. Ligands with dubious geometry were identified through a Python mining code. A sample set of the identified structures was remodeled into minimum energy conformations using the molecular dynamics program AMBER and then fit to the original experimental density maps using the molecular modeling program Coot. The refined models were compared to the original models in the PDB as well as to similar structures in the CSD using the deposition statistical validation server. Preliminary results suggest that the pipeline effectively identifies and improves ligand structures that possess inaccurate geometry. This method can be used to evaluate and improve the accuracy of specific ligands in structures both archived and pending deposition. Support or Funding Information This work was supported by an NSF REU and the RCSB PDB [NSF (DBI‐1338415), NIH, and DOE.] This abstract is from the Experimental Biology 2019 Meeting. There is no full text article associated with this abstract published in The FASEB Journal .

Miller, Beck↗

Electronic and chemical state of aluminum from the single- (K) and double-electron excitation (KL II&III , KL I ) x-ray absorption near-edge spectra of α-alumina, sodium aluminate, aqueous Al³⁺•(H₂O)₆, and aqueous Al(OH)₄⁻

We probe, at high energy resolution, the double electron excitation (KL II&II ) x-ray absorption region that lies approximately 115 eV above the main Al K-edge (1566 eV) of α-alumina and sodium aluminate. The two solid standards, α-alumina (octahedral) and sodium aluminate (tetrahedral) are compared to aqueous species that have the same Al coordination symmetries, Al³⁺•6H₂O (octahedral) and Al(OH)₄⁻ (tetrahedral). For the octahedral species, the edge height of the KL II&III -edge is approximately 10% of the main K-edge however the edge height is much weaker (3% of K-edge height) for Al species with tetrahedral symmetry. For the α-alumina and aqueous Al³⁺•6H₂O the KL II&III spectra contain white line features and extended absorption fine structure (EXAFS) that mimics the K-edge spectra. The KL II&III -edge feature interferes with an important region of the extended-XAFS region of the spectra for the K-edge of the crystalline and aqueous standards. The K-edge spectra and K-edge positions are predicted using time-dependent density functional theory (TDDFT). The TDDFT calculations for the K-edge XANES spectra reproduce the observed transitions in the experimental spectra of the four Al species. The KL II&III and KL I onsets and their corresponding chemical shifts for the four standards are estimated using the delta self-consistent field (ΔSCF) method. Research by JLF, NG, EJB, AV, TDS was supported by U.S. Department of Energy’s (DOE), Office of Science, Office of Basic Energy Sciences, Division of Chemical Sciences, Geosciences, and Biosciences. NG thanks Amity Andersen for help with the α-Al₂O₃ and tetrahedral sodium aluminate (NaAlO₂) clusters. All the calculations were performed using the Molecular Science Computing Capability at EMSL, a national scientific user facility sponsored by the U.S. Department of Energy’s Office of Biological and Environmental Research and located at Pacific Northwest National Laboratory (PNNL). PNNL is a multi-program national laboratory operated for DOE by Battelle under Contract # AC05-76RL01830.

aluminum↗

Computer code for scattering from impedance bodies of revolution. Part 3: Surface impedance with s and phi variation. Analytical and numerical results

The third phase of the development of the computer codes for scattering by coated bodies that has been part of an ongoing effort in the Electromagnetics Laboratory of the Electrical Engineering and Computer Science Department at the University of Illinois at Chicago is described. The work reported discusses the analytical and numerical results for the scattering of an obliquely incident plane wave by impedance bodies of revolution with phi variation of the surface impedance. Integral equation formulation of the problem is considered. All three types of integral equations, electric field, magnetic field, and combined field, are considered. These equations are solved numerically via the method of moments with parametric elements. Both TE and TM polarization of the incident plane wave are considered. The surface impedance is allowed to vary along both the profile of the scatterer and in the phi direction. Computer code developed for this purpose determines the electric surface current as well as the bistatic radar cross section. The results obtained with this code were validated by comparing the results with available results for specific scatterers such as the perfectly conducting sphere. Results for the cone-sphere and cone-cylinder-sphere for the case of an axially incident plane were validated by comparing the results with the results with those obtained in the first phase of this project. Results for body of revolution scatterers with an abrupt change in the surface impedance along both the profile of the scatterer and the phi direction are presented.

Uslenghi, Piergiorgio L. E.↗

CERT TST November 2016 Visit Summary

The dozen plus presentations covered the span of the Center’s activities, including experimental progress, simulations of the experiments (both for calibration and validation), UQ analysis, nuclear data impacts, status of simulation codes, methods development, computational science progress, and plans for upcoming priorities. All three institutions comprising the Center (Texas A&M, University of Colorado Boulder, and Simon Fraser University) were represented. Center-supported students not only gave two of the oral presentations, but also highlighted their research in a number of excellent posters.

97 MATHEMATICS AND COMPUTING↗

Domain decomposition: A bridge between nature and parallel computers

Domain decomposition is an intuitive organizing principle for a partial differential equation (PDE) computation, both physically and architecturally. However, its significance extends beyond the readily apparent issues of geometry and discretization, on one hand, and of modular software and distributed hardware, on the other. Engineering and computer science aspects are bridged by an old but recently enriched mathematical theory that offers the subject not only unity, but also tools for analysis and generalization. Domain decomposition induces function-space and operator decompositions with valuable properties. Function-space bases and operator splittings that are not derived from domain decompositions generally lack one or more of these properties. The evolution of domain decomposition methods for elliptically dominated problems has linked two major algorithmic developments of the last 15 years: multilevel and Krylov methods. Domain decomposition methods may be considered descendants of both classes with an inheritance from each: they are nearly optimal and at the same time efficiently parallelizable. Many computationally driven application areas are ripe for these developments. A progression is made from a mathematically informal motivation for domain decomposition methods to a specific focus on fluid dynamics applications. To be introductory rather than comprehensive, simple examples are provided while convergence proofs and algorithmic details are left to the original references; however, an attempt is made to convey their most salient features, especially where this leads to algorithmic insight.

Keyes, David E.↗

Camellia: A Rapid Development Framework for Finite Element Solvers

We report the discontinuous Petrov–Galerkin (DPG) methodology of Demkowicz and Gopalakrishnan guarantees the optimality of the finite element solution in a user-controllable energy norm, and provides several features supporting adaptive schemes. The approach provides stability automatically; there is no need for carefully derived numerical fluxes (as in DG schemes) or for mesh-dependent stabilization terms (as in stabilized methods). In this paper, we focus on features of Camellia that facilitate implementation of new DPG formulations; chief among these is a rich set of features in support of symbolic manipulation, which allow, e.g., bilinear formulations in the code to appear much as they would on paper. Many of these features are general in the sense that they can also be used in the implementation of other finite element formulations. In fact, because DPG’s requirements are essentially a superset of those of other finite element methods, Camellia provides built-in support for most common methods. We believe, however, that the combination of an essentially “hands-free” finite element methodology as found in DPG with the rapid development features of Camellia are particularly winsome, so we focus on use cases in this class. In addition to the symbolic manipulation features mentioned above, Camellia offers support for one-irregular adaptive meshes in 1D, 2D, 3D, and space-time. It provides a geometric multigrid preconditioner particularly suited for DPG problems, and supports distributed parallel execution using MPI. For its load balancing and distributed data structures, Camellia relies on packages from the Trilinos project, which simplifies interfacing with other computational science packages. Camellia also allows loading of standard mesh formats through an interface with the MOAB package. Camellia includes support for static condensation to eliminate element-interior degrees of freedom locally, usually resulting in substantial reduction of the cost of the global problem. Finally, we include a discussion of the variational formulations built into Camellia, with references to those formulations in the literature, as well as an MPI performance study.

97 MATHEMATICS AND COMPUTING↗

Research Directions for Cyber Experimentation: Workshop Discussion Analysis.

Sandia National Laboratories hosted a workshop on August 11, 2017 entitled "Research Directions for Cyber Experimentation," which focused on identifying and addressing research gaps within the field of cyber experimentation , particularly emulation testbeds . This report mainly documents the discussion toward the end of the workshop, which included research gaps such as developing a sustainable research infrastructure, exp anding cyber experimentation, and making the field more accessible to subject matter experts who may not have a background in computer science . Other gaps include methodologies for rigorous experimentation, validation, and uncertainty quantification, which , if addressed, also have the potential to bridge the gap between cyber experimentation and cyber engineering. Workshop attendees presented various ways to overcome these research gaps, however the main conclusion for overcoming these gaps is better commun ication through increased workshops, conferences, email lists, and slack chann els, among other opportunities.

97 MATHEMATICS AND COMPUTING↗

A Summary of Advances in Document Summarization from 2023-2024

In computer science, Document Summarization is the task of condensing some quantity of text and related content through automated means. In this document, we review recent literature in text summarization. “Hybrid” extractive-abstractive approaches continue to be explored. Some of the latest efforts have also sought to enable users to adjust summaries with queries or other structure and begun to test reinforcement-learning style agentic LLM-based solutions.

97 MATHEMATICS AND COMPUTING↗

CEA/DAM - CEA/DEN - LANL - IAEA - IPHC Collaboration Meeting on Nuclear Data, Nuclear Reaction Theories, and Machine Learning (Summary Report)

Dupuis hosted our biennial CEA/NNSA collaboration meeting, and Kawano and Lovell of LANL and Tamagno of CEA/DEN (Cadarache) visited CEA/DAM to discuss current issues and further developments in nuclear reaction modeling, nuclear data evaluation, and relevant programs of modern computer science, especially the machine learning technology. The discussions included topics of our common interest such as neutron inelastic scattering, capture, and fission, with particular emphasis on the actinide nuclear data evaluations. We report briefly the summary of our discussions. We also had a half-day video meeting with Capote of IAEA and Kerveno of IPHC to discuss nuclear reactions on actinides.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Data Management as a Cluster Middleware Centerpiece

Through earth and space modeling and the ongoing launches of satellites to gather data, NASA has become one of the largest producers of data in the world. These large data sets necessitated the creation of a Data Management System (DMS) to assist both the users and the administrators of the data. Halcyon Systems Inc. was contracted by the NASA Center for Computational Sciences (NCCS) to produce a Data Management System. The prototype of the DMS was produced by Halcyon Systems Inc. (Halcyon) for the Global Modeling and Assimilation Office (GMAO). The system, which was implemented and deployed within a relatively short period of time, has proven to be highly reliable and deployable. Following the prototype deployment, Halcyon was contacted by the NCCS to produce a production DMS version for their user community. The system is composed of several existing open source or government-sponsored components such as the San Diego Supercomputer Center s (SDSC) Storage Resource Broker (SRB), the Distributed Oceanographic Data System (DODS), and other components. Since Data Management is one of the foremost problems in cluster computing, the final package not only extends its capabilities as a Data Management System, but also to a cluster management system. This Cluster/Data Management System (CDMS) can be envisioned as the integration of existing packages.

Zero, Jose↗