Search NASA⌕ Search

SEARCH · Search NASA

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 1,405 records · Page 78

Reflecting on Planning Models: A Challenge for Verification and Validation of Planning Systems

We discuss the opportunities for autonomous sys- tems to perform reflection on their planners by adapting the models used to build plans. We first describe model-based planning systems, a form of automated planning system driven by declarative models of the planning domain. These models include descriptions of the conditions and effects of actions on the state of the world. When planning the activities of cyber-physical systems, the command and data representation of the system must be formally abstracted to the actions and states described in the planning system model. When the execution of a plan either fails or produces unexpected outcomes, the execution trace can be abstracted and compared to the predicted state according to the planning model, producing a list of discrepancies; these discrepancies can then be used to fix the model. This provides part of a reflection capability, namely, a set of well-formed problems with the domain model, the abstractions, or both. The challenge lies in the rest of the reflection capability, namely, a set of techniques for changing the models or the abstractions. We discuss these challenges and describe some of the options for addressing them

Mission Planning↗

Obtaining correct compile results by absorbing mismatches between data types representations

Methods and a system are provided. A method includes implementing a function, which a compiler for a first language does not have, using a compiler for a second language. The implementing step includes generating, by the compiler for the first language, a first abstract syntax tree. The implementing step further includes converting, by a converter, the first abstract syntax tree to a second abstract syntax tree of the compiler for the second language using a conversion table from data representation types in the first language to data representation types in the second language. When a compilation error occurs, the implementing step also includes generating a special node for error processing in the second abstract syntax tree and storing an error token in the special node. When unparsing, the implementing step additionally includes outputting the error token, in the form of source code written in the first language.

97 MATHEMATICS AND COMPUTING↗

Obtaining correct compile results by absorbing mismatches between data types representations

Methods and a system are provided. A method includes implementing a function, which a compiler for a first language does not have, using a compiler for a second language. The implementing step includes generating, by the compiler for the first language, a first abstract syntax tree. The implementing step further includes converting, by a converter, the first abstract syntax tree to a second abstract syntax tree of the compiler for the second language using a conversion table from data representation types in the first language to data representation types in the second language. When a compilation error occurs, the implementing step also includes generating a special node for error processing in the second abstract syntax tree and storing an error token in the special node. When unparsing, the implementing step additionally includes outputting the error token, in the form of source code written in the first language.

97 MATHEMATICS AND COMPUTING↗

Obtaining correct compile results by absorbing mismatches between data types representations

Methods and a system are provided. A method includes implementing a function, which a compiler for a first language does not have, using a compiler for a second language. The implementing step includes generating, by the compiler for the first language, a first abstract syntax tree. The implementing step further includes converting, by a converter, the first abstract syntax tree to a second abstract syntax tree of the compiler for the second language using a conversion table from data representation types in the first language to data representation types in the second language. When a compilation error occurs, the implementing step also includes generating a special node for error processing in the second abstract syntax tree and storing an error token in the special node. When unparsing, the implementing step additionally includes outputting the error token, in the form of source code written in the first language.

97 MATHEMATICS AND COMPUTING↗

SharP

The pre-exascale systems are expected to have a significant amount of hierarchical and heterogeneous on-node memory, and this trend of system architecture in extreme-scale systems is expected to continue into the exascale era. along with hierarchical-heterogeneous memory, the system typically has a high-performing network ad a compute accelerator. This system architecture is not only effective for running traditional High Performance Computing (HPC) applications (Big-Compute), but also for running data-intensive HPC applications and Big-Data applications. As a consequence, there is a growing desire to have a single system serve the needs of both Big-Compute and Big-Data applications. Though the system architecture supports the convergence of the Big-Compute and Big-Data, the programming models and software layer have yet to evolve to support either hierarchical-heterogeneous memory systems or the convergence. A programming abstraction to address this problem. The programming abstraction is implemented as a software library and runs on pre-exascale and exascale systems supporting current and emerging system architecture. Using distributed data-structures as a central concept, it provides (1) a simple, usable, and portable abstraction for hierarchical-heterogeneous memory and (2) a unified programming abstraction for Big-Compute and Big-Data applications.

Venkata, Manjunath Gorentla↗

Bay capping via acetylene addition to polycyclic aromatic hydrocarbons: Mechanism and kinetics

The bay-capping mechanism on PAH armchair edges and the kinetics of acetylene addition to 6–6–5 and 5–6–5 bays have been explored by ab initio/RRKM-ME calculations. The bays on the edges were modeled by C 21 H 11 and C 20 H 9 radicals produced by H abstractions from 7H-benzo[c]cyclopenta[e]pyrene and dicyclopenta[cf]pyrene. The C 20 H 9 + C 2 H 2 reaction is shown to have a low entrance barrier and to rapidly form the capped product, indaceno[2,1,8,7-cdefg]pyrene, along with ethynyl substituted dicyclopenta[cf]pyrene at temperatures above 1400 K. The reactivity of C 21 H 11 is shown to be governed by the location of the unpaired electron; the π radical R1 formed by H abstraction from the CH 2 group in 7H-benzo[c]cyclopenta[e]pyrene reacts with C 2 H 2 very slowly owing to a high entrance barrier, with the bay-capping rate constant approaching 10 -16 cm 3 molecule -1 s -1 only at temperatures above 2000K. Further, this result reaffirms that the growth of π aryl radicals via acetylene addition is inefficient and reflects the generally low reactivity of such radicals where the spin density is highly delocalized over the entire polyaromatic system. Alternatively, the σ C 21 H 11 radical R2 produced by H abstraction from the five-membered ring at the bay rapidly reacts with C 2 H 2 forming the bay-capped product, with the rate constant on the order of 10 -12 cm 3 molecule -1 s -1 at T≥1500K. Rate constants for the capping reactions at the 6–6–5 and 5–6–5 bays are compared with those at the 6–0–6, 6–6–6, and 6–5–6 bays. The site-specific bay-capping rate constants have been utilized in kMC simulations of the PAH growth and the results showed measurable differences when the 6–6–5 and 5–6–5 bay-capping reactions are taken into account, including an increase of the growth rate and the formation of closed-shell PAH and a rise of the number of embedded five-membered rings accompanied with a slight decrease of their overall amount.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Redefining Net-Zero Water for Resilient Aquifers

Groundwater has long been a critical source of potable water, supplying one-third of all global water withdrawals and providing strategic reserves in times of drought (Konikow, 2012; Famiglietti, 2014). The risk in relying on groundwater is that it is often pumped at rates far greater than it can be naturally replenished. With increasing population and a changing climate, the depletion of potable water supplies has become an ever-growing concern (Srinivasan et al., 2012). Recently, the concept of “resilience” has been applied to groundwater, leaving many questions to be explored in terms of what resilience should mean for aquifers (Foster and MacDonald, 2014; Grönwall and Oduro-Kwarteng, 2017). The term is commonly used to indicate resilience to impacts of climate change specifically, but here we consider resilience in the context of more general water insecurity. Relatedly, the concept of “sustainable yield” has emerged in an attempt to determine a metric that can ensure the long-term resilience of groundwater systems, but the definition is fraught with inherent uncertainties and its quantification poses challenges (Rudestam and Langridge, 2014; Grönwall and Oduro-Kwarteng, 2017). At the heart of these concepts is a focus on sustainable management of aquifers. A sustainable approach to managing groundwater resources usually involves balancing long-term abstraction with the long-term recharge taking into account the needs for environmental flows and implementing drought-preparedness measures (Robins et al. 2006; Foster and MacDonald, 2014). At a high level, a sustainable balance of groundwater abstraction versus aquifer recharge may be considered “Net Zero” (NZ) or “Net Positive” (NP) in cases where recharge is equal to or in excess of abstraction, respectively. However, NZ/NP water management programs that address these concerns have varied definitions of compliance, which include considerations for the application at hand (ILFI, 2020; USGBC, 2020). Locations with high risk of low or poor water supply may be particularly interested in pursuing NZ/NP water. The AQUEDUCT Water Risk Atlas (World Resources Institute, 2019) indicates long-term availability, providing risk levels for quantity and quality of water at specific locations across the globe, for existing and predicted future conditions. This paper follows the U.S. Department of Energy (DOE) Federal Energy Management Program (FEMP) NZ water definition adopted by the U.S. Army for use at their installations, including Army Reserve Centers (ARCs). This definition also relates to the U.S. Army’s current focus on water resilience, which includes short-term and long-term availability of water resources.

net zero water, HUC12, Saipan, American Samoa, Mau↗

Estimating heterotrophic respiration at large scales: challenges, approaches, and next steps

Heterotrophic respiration (HR), the aerobic and anaerobic processes mineralizing organic matter, is a key carbon flux but one impossible to measure at scales significantly larger than small experimental plots. This impedes our ability to understand carbon and nutrient cycles, benchmark models, or reliably upscale point measurements. Given that a new generation of highly mechanistic, genomic-specific global models is not imminent, we suggest that a useful step to improve this situation would be the development of "Decomposition Functional Types" (DFTs). Analogous to plant functional types (PFTs), DFTs would abstract and capture important differences in HR metabolism and flux dynamics, allowing models to efficiently group and vary these characteristics across space and time. We argue that DFTs should be initially informed by top-down expert opinion, but ultimately developed using bottom-up, data-driven analyses, and provide specific examples of potential dependent and independent variables that could be used. We present and discuss an example clustering analysis to show how model-produced annual HR can be broken into distinct groups associated with global variability in biotic and abiotic factors, and demonstrate that these groups are distinct from already-existing PFTs. A similar analysis, incorporating observational data, could form a basis for future DFTs. Finally, we suggest next steps and critical priorities: collection and synthesis of existing data; more in-depth analyses combining open data with high-performance computing; rigorous testing of analytical results; and planning by the global modeling community for decoupling decomposition from fixed site data. These are all critical steps to build a foundation for DFTs in global models, thus providing the ecological and climate change communities with robust, scalable estimates of HR at large scales.

carbon cycle↗

Shock‐tube spectroscopic water measurements and detailed kinetics modeling of 1‐pentene and 3‐methyl‐1‐butene

Abstract To understand the effects of the chemical structure of two C 5 alkene isomers on their combustion properties, and to highlight the major chemical reactions occurring during their high‐temperature oxidation, water time histories were measured behind reflected shock waves for the oxidation of 1‐pentene (C 5 H 10 ‐1) and 3‐methyl‐1‐butene (3M1B) in 99.5% Ar. The experiments were carried out at three different equivalence ratios ( φ = 0.5, 1.0, and 2.0) at pressures and temperatures ranging from 1.29 to 1.47 atm and 1 331 to 1 877 K, respectively. The H 2 O quantification extends the database for 1‐pentene and provides new insights for 3M1B. These unique results were used to validate and to develop a new detailed kinetics model. Numerical predictions are presented, and the new model was able to capture the results with suitable accuracy, with 3M1B being notably more reactive than C 5 H 10 ‐1. Sensitivity and rate‐of‐production analyses were performed to help explain the results. Under the present conditions, the reactivity is rapidly initiated by molecular dissociation of a fraction of the pentene isomers. The initiation phase then induces H‐atom abstraction by active radicals (H, OH, O, HO 2 , and CH 3 ) to first produce alkenyl C 5 H 9 radicals (or an alkyl radical and an alkenyl radical by breaking a C─C bond) and subsequent, smaller fragments. The difference in terms of reactivity between the isomers is essentially due to the fact that 3M1B has one particularly weak tertiary allylic C─H bond, which allows for fast H‐atom abstraction compared with 1‐pentene.

Grégoire, Claire M.↗

MatRIS: Addressing the Challenges for Portability and Heterogeneity Using Tasking for Matrix Decomposition (Cholesky)

The ubiquitous in-node heterogeneity of HPC and cloud computing platforms makes software portability and performance optimization extremely challenging. Described here, the MatRIS multilevel math library abstraction framework employs tasking to alleviate these difficulties. MatRIS includes the IRIS task-based runtime on the bottom level and exposes different layers of abstraction to render algorithms architecturally agnostic. MatRIS ensures the decomposition and creation of tasks that represent the necessary encapsulation of the optimized kernels from both vendor and open-source math libraries. Once built, MatRIS can select different combinations of accelerators at runtime, making it portable even on diverse heterogeneous architectures. By leveraging the IRIS runtime’s features for managing heterogeneity, MatRIS deploys algorithms that remove the need to specify orchestration and data transfer. This study describes how the serial task abstraction of a tiled Cholesky factorization is made portable and scalable in the case of multi-device and multi-vendor heterogeneity on a node with NVIDIA and AMD GPUs by using MatRIS. First, we demonstrate that Cholesky in MatRIS provides multi-GPU scalability that offers competitive performance versus cuSolverMG. Then, we present the challenges and opportunities for heterogeneous execution.

Monil, M. A. H.↗