Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “ABSTRACT”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

Accurate ab initio potential energy surface, thermochemistry, and dynamics of the F{sup −} + CH{sub 3}F S{sub N}2 and proton-abstraction reactions

We develop a full-dimensional global analytical potential energy surface (PES) for the F{sup −} + CH{sub 3}F reaction by fitting about 50 000 energy points obtained by an explicitly correlated composite method based on the second-order Møller–Plesset perturbation-F12 and coupled-cluster singles, doubles, and perturbative triples-F12a methods and the cc-pVnZ-F12 [n = D, T] basis sets. The PES accurately describes the (a) back-side attack Walden inversion mechanism involving the pre- and post-reaction (b) ion-dipole and (c) hydrogen-bonded complexes, the configuration-retaining (d) front-side attack and (e) double-inversion substitution pathways, as well as (f) the proton-abstraction channel. The benchmark quality relative energies of all the important stationary points are computed using the focal-point analysis (FPA) approach considering electron correlation up to coupled-cluster singles, doubles, triples, and perturbative quadruples method, extrapolation to the complete basis set limit, core-valence correlation, and scalar relativistic effects. The FPA classical(adiabatic) barrier heights of (a), (d), and (e) are −0.45(−0.61), 46.07(45.16), and 29.18(26.07) kcal mol{sup −1}, respectively, the dissociation energies of (b) and (c) are 13.81(13.56) and 13.73(13.52) kcal mol{sup −1}, respectively, and the endothermicity of (f) is 42.54(38.11) kcal mol{sup −1}. Quasiclassical trajectory computations of cross sections, scattering (θ) and initial attack (α) angle distributions, as well as translational and internal energy distributions are performed for the F{sup −} + CH{sub 3}F(v = 0) reaction using the new PES. Apart from low collision energies (E{sub coll}), the S{sub N}2 excitation function is nearly constant, the abstraction cross sections rapidly increase with E{sub coll} from a threshold of ∼40 kcal mol{sup −1}, and retention trajectories via double inversion are found above E{sub coll} = ∼ 30 kcal mol{sup −1}, and at E{sub coll} = ∼ 50 kcal mol{sup −1}, the front-side attack cross sections start to increase very rapidly. At low E{sub coll}, the indirect mechanism dominates (mainly isotropic backward-forward symmetric θ distribution and translationally cold products) and significant long-range orientation effects (isotropic α distribution) and barrier recrossings are found. At higher E{sub coll}, the S{sub N}2 reaction mainly proceeds with direct rebound mechanism (backward scattering and hot product translation)

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2019

Rate coefficients and branching ratio for multi-channel hydrogen abstractions from CH 3 OH by F

The hydrogen abstraction reaction F+CH 3 OH has two possible reaction pathways: HF+CH 3 O and HF+CH 2 OH. Despite the absence of intrinsic barriers for both channels, the former has a branching ratio comparable to the latter, which is far from the statistical limit of 0.25 (one out of four available H atoms). Furthermore, the measured branching ratio of the two abstraction channels spans a large range and is not quantitatively reproduced by previous theoretical predictions based on the transition-state theory with the stationary point information calculated at the levels of Møller-Plesset perturbation theory and G2. This work reports a theoretical investigation on the kinetics and the associated branching ratio of the two competing channels of the title reaction using a quasi-classical trajectory approach on an accurate full-dimensional potential energy surface (PES) fitted by the permutation invariant polynomial-neural network approach to ca. 1.21x10 5 points calculated at the explicitly correlated (F12a) version of coupled cluster singles doubles and perturbative triples (CCSD(T)) level with the aug-cc-pVDZ basis set. The calculated room temperature rate coefficient and branching ratio of the HF+CH 3 O channel are in good agreement with the available experimental data. Furthermore, our theory predicts that rate coefficients have a slightly negative temperature dependence, consistent with barrierless nature of the reaction.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2018

Device Access Abstractions for Resilient Information Architecture Platform for Smart Grid

An open application platform distributes the intelligence and control capability to local endpoints (or nodes) reducing total network traffic, improving speed of local actions by avoiding latency, and improving reliability by reducing dependencies on numerous devices and communication interfaces. The platform must be multi-tasking and able to host multiple applications running simultaneously. Given such a system, the core functions of power grid control systems include grid state determination, low level control, fault intelligence and reconfiguration, outage intelligence, power quality measurement, remote asset monitoring, configuration management, power and energy management (including local distributed energy resources, such as wind, solar and energy storage) can be eventually distributed. However, making this move requires extensive regression testing of systems to prove out new technologies, such as phasor measurement units (PMU). Additionally, as the complexity of the systems increase with the inclusion of new functionality (especially at the distribution and consumer levels), hidden coupling issues becomes a challenge with possible N-way interactions known and not known by device and application developers. Therefore, it is very important to provide core abstractions that ensure uniform operational semantics across such interactions. Here in this paper, we describe the pattern for abstracting device interactions we have developed for the RIAPS platform in the context of a microgrid control application we have developed.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2018

Abstractions and Directives for Adapting Wavefront Algorithms to Future Architectures

Architectures are rapidly evolving, and exascale machines are expected to offer billion-way concurrency. We need to rethink algorithms, languages and programming models among other components in order to migrate large scale applications and explore parallelism on these machines. Although directive-based programming models allow programmers to worry less about programming and more about science, expressing complex parallel patterns in these models can be a daunting task especially when the goal is to match the performance that the hardware platforms can offer. One such pattern is wavefront. This paper extensively studies a wavefront-based miniapplication for Denovo, a production code for nuclear reactor modeling. We parallelize the Koch-Baker-Alcouffe (KBA) parallel-wavefront sweep algorithm in the main kernel of Minisweep (the miniapplication) using CUDA, OpenMP and OpenACC. Our OpenACC implementation running on NVIDIA's next-generation Volta GPU boasts an 85.06x speedup over serial code, which is larger than CUDA's 83.72x speedup over the same serial implementation. Our experimental platform includes SummitDev, an ORNL representative architecture of the upcoming Summit supercomputer. Our parallelization effort across platforms also motivated us to define an abstract parallelism model that is architecture independent, with a goal of creating software abstractions that can be used by applications employing the wavefront sweep motif.

Searles, Robert↗
DOE OSTI2023

MatRIS: Multi-level Math Library Abstraction for Heterogeneity and Performance Portability using IRIS Runtime

Vendor libraries are tuned for a specific architecture and are not portable to others. Moreover, they lack support for heterogeneity and multi-device orchestration, which is required for efficient use of contemporary HPC and cloud resources. To address these challenges, we introduce MatRIS—a multilevel math library abstraction for scalable and performance-portable sparse/dense BLAS/LAPACK operations using IRIS runtime. The MatRIS-IRIS co-design introduces three levels of abstraction to make the implementation completely architecture agnostic and provide highly productive programming. We demonstrate that MatRIS is portable without any change in source code and can fully utilize multi-device heterogeneous systems by achieving high performance and scalability on Summit, Frontier, and a CADES cloud node equipped with four NVIDIA A100 GPUs and four AMD MI100 GPUs. A detailed performance study is presented in which MatRIS demonstrates multi-device scalability. When compared, MatRIS provides competitive and even better performance than libraries from vendors and other third parties.

Monil, M. A. H.↗
DOE OSTI2021

AGU/AMS Abstract Search and Display Software

The AGU/AMS Abstract Search and Display Software is a standalone web application which enables the searching, storing, and displaying of abstracts featured at the annual American Geophysical Union (AGU) and American Meteorological Society (AMS) meetings. This application is designed for those who wish to host a standalone web application and feature a select subset of posters and talks scheduled for the AGU/AMS meetings. Please read the entirety of this README.md file before attempting to download and use the application. There are three views available via the UI: Lookup - enables searching and submitting posters for displaying on the summary view Manual Submission - allows individual manual submission of posters given a poster ID Summary - displays all posters submitted by users from the lookup view

Darnell, Wade↗
DOE OSTI2026

Fortran mimetic abstraction language (Formal) v0.1.

The Fortran mimetic abstraction language ("Formal") is a domain-specific language (DSL) embedded in Fortran 202Y [1]. Formal provides novel software abstractions for simulating phenomena governed by the partial differential equations (PDEs) of vector and tensor calculus. Such equations model an extremely broad set of physical phenomena, ranging from atmospheric winds to light propagation. Formal's data structures and algorithms mimic in form and behavior continuous functions and operators. Formal supports these mathematical constructs using mimetic discretizations that define a discrete calculus satisfying various tensor calculus theorems, thereby ensuring high-fidelity representations of the physics being modeled. [2] Formal 0.1.0 also lays a foundation for the future use of Fortran 202Y type-safe templates to facilitate the formal verification of tensor contractions in computational physics and artificial intelligence [3]. [1] "Fortran 202Y" is Fortran standard committee's informal designation for the next Fortran revision, which will likely be "Fortran 2028". [2] Corbino, J. and Castillo, J. (2020) Journal of Computational and Applied Mathematics, https://doi.org/10.1016/j.cam.2019.06.042. [3] Haveraaen, M., Järvi, J., & Rouson, D. (2019). Reflecting on Generics for Fortran. https://j3-fortran.org/doc/year/19/19-188.pdf.

Rouson, Damian [Lawrence Berkeley National Laborat↗
DOE OSTI2018

Abstract Algebra Basics

To understand the mathematics behind Uncertainty Quantification (UQ), one first needs to become familiar with orthogonal polynomials, which in turn requires a grasp of abstract algebra. This note covers some of the basics of abstract algebra.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Initial CRADA Abstract

CRADA Abstract for publication on OSTI as required by DOE O 483.1B. Abstract does not contain protected CRADA information.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2021

Demonstrating UPC++/Kokkos Interoperability in a Heat Conduction Simulation (Extended Abstract)

We describe the replacement of MPI with UPC++ in an existing Kokkos code that simulates heat conduction within a rectangular 3D object, as well as an analysis of the new code’s performance on CUDA accelerators. The key challenges were packing the halos in Kokkos data structures in a way that allowed for UPC++ remote memory access, and streamlining synchronization costs. Additional UPC++ abstractions used included global pointers, distributed objects, remote procedure calls, and futures. We also make use of the device allocator concept to facilitate data management in memory with unique properties, such as GPUs. Our results demonstrate that despite the algorithm’s good semantic match to message passing abstractions, straightforward modifications to use UPC++ communication deliver vastly improved performance and scalability in the common case. We find the one-sided UPC++ version written in a natural way exhibits good performance, whereas the message-passing version written in a straightforward way exhibits performance anomalies. We argue this represents a productivity benefit for one-sided communication models.

Waters, Daniel↗
DOE OSTI2014

Automatic identification of abstract online groups

Online abstract groups, in which members aren't explicitly connected, can be automatically identified by computer-implemented methods. The methods involve harvesting records from social media and extracting content-based and structure-based features from each record. Each record includes a social-media posting and is associated with one or more entities. Each feature is stored on a data storage device and includes a computer-readable representation of an attribute of one or more records. The methods further involve grouping records into record groups according to the features of each record. Further still the methods involve calculating an n-dimensional surface representing each record group and defining an outlier as a record having feature-based distances measured from every n-dimensional surface that exceed a threshold value. Each of the n-dimensional surfaces is described by a footprint that characterizes the respective record group as an online abstract group.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

System and method for identifying and comparing code by semantic abstractions

Certain embodiments of the present invention are configured to facilitate analyzing computer code more efficiently. For example, by conducting a first level abstraction (e.g., symbolic interpretation and algebraic simplification) and a second level abstraction (e.g., generalization) of the computer code, the analysis may more accurately account for variations in the code that may occur as a result of register renaming, instruction reordering, choice of instructions, etc. while minimizing the cost of computations required to perform the analysis.

Lakhotia, Arun↗
DOE OSTI2025

2024-03U-JWS01 - Initial Abstract

Abstract for recently approved CRADA joint work statement 2024-03U-JWS01 with University of Nevada Reno. Publication of abstract at time of approval satisfies requirements of DOE O 483.1B.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2016

Hydrogen-Abstraction/Acetylene-Addition Exposed

Polycyclic aromatic hydrocarbons (PAHs) are omnipresent in the interstellar medium (ISM) and also in carbonaceous meteorites (CM) such as Murchison. However, the basic reaction routes leading to the formation of even the simplest PAH—naphthalene (C 10 H 8 )—via the hydrogen-abstraction/acetylene-addition (HACA) mechanism still remain ambiguous. By revealing the uncharted fundamental chemistry of the styrenyl (C 8 H 7 ) and the ortho-vinylphenyl radicals (C 8 H 7 )—key transient species of the HACA mechanism—with acetylene (C 2 H 2 ), we provide the first solid experimental evidence on the facile formation of naphthalene in a simulated combustion environment validating the previously postulated HACA mechanism for these two radicals. This study highlights, at the molecular level spanning combustion and astrochemistry, the importance of the HACA mechanism to the formation of the prototype PAH naphthalene.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2019

A Scale-Dynamic Network Abstraction Approach for Traffic Analysis

The necessary trade-off between accuracy and efficiency of various traffic simulation tools depends on the resolution of the roadway network. While a detailed high-resolution road network could better represent connectivity of real-world road network and ensure an accurate simulation result, a low-resolution network omitting trivial details could reduce computational burden and improve the computational efficiency of traffic simulation. This study focuses on dynamically adjusting the roadway network resolution during the process of simulation-based dynamic traffic assignment (SBDTA) with the objective to expedite both the simulation and the assignment within SBDTA. We propose to divide the whole time horizon into several periods dynamically and to Abstract the network for each period separately. The result showed that half of the CPU time for both the simulation and the assignment is saved, while the network performance remains consistent or near consistent compared with the scenario using the most detailed network.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2018

GPU code optimization using abstract kernel emulation and sensitivity analysis

In this paper, we develop a novel approach to GPU kernel optimization by focusing on identification of bottleneck resources and determining optimization parameters that can alleviate the bottleneck. Performance modeling for GPUs is done by abstract kernel emulation along with latency/gap modeling of resources. Sensitivity analysis with respect to resource latency/gap parameters is used to predict the bottleneck resource for a given kernel's execution. Here, the utility of the bottleneck analysis is demonstrated in two contexts: 1) Enhancing the OpenTuner auto-tuner with the new bottleneck-driven optimization strategy. Experimental results on all kernels from the Rodinia suite and GPU tensor contraction kernels from the NWChem computational chemistry suite demonstrate effectiveness. 2) Manual code optimization: two case studies illustrate the use of the bottleneck analysis to iteratively improve performance of code from state-of-the-art DSL code generators.

97 MATHEMATICS AND COMPUTING↗