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 1,369 records · Page 76

Earth observations and global change decision making: A special bibliography, 1991

The first section of the bibliography contains 294 bibliographic citations and abstracts of relevant reports, articles, and documents announced in 'Scientific and Technical Aerospace Reports (STAR)' and 'International Aerospace Abstracts (IAA)'. These abstracts are categorized by the following major subject divisions: aeronautics, astronautics, chemistry and materials, engineering, geosciences, life sciences, mathematical and computer sciences, physics, social sciences, space sciences and general. Following the abstract section, seven indexes are provided for further assistance.

Source record↗

Parallel computation of manipulator inverse dynamics

In this article, parallel computation of manipulator inverse dynamics is investigated. A hierarchical graph-based mapping approach is devised to analyze the inherent parallelism in the Newton-Euler formulation at several computational levels, and to derive the features of an abstract architecture for exploitation of parallelism. At each level, a parallel algorithm represents the application of a parallel model of computation that transforms the computation into a graph whose structure defines the features of an abstract architecture, i.e., number of processors, communication structure, etc. Data-flow analysis is employed to derive the time lower bound in the computation as well as the sequencing of the abstract architecture. The features of the target architecture are defined by optimization of the abstract architecture to exploit maximum parallelism while minimizing architectural complexity. An architecture is designed and implemented that is capable of efficient exploitation of parallelism at several computational levels. The computation time of the Newton-Euler formulation for a 6-degree-of-freedom (dof) general manipulator is measured as 187 microsec. The increase in computation time for each additional dof is 23 microsec, which leads to a computation time of less than 500 microsec, even for a 12-dof redundant arm.

Fijany, Amir↗

Acronym dictionary

This reference was originally compiled as a tool for abstracters who need to know the expansion of acronyms they may encounter in the texts they are analyzing. It is a general rule of abstracting at the NASA Center For Aerospace Information (CASI) that acronyms are expanded in the abstract to enhance both information content and searchability. Over the last 22 years, abstracters at CASI have recorded acronyms and their expansions as they were encountered in documents. This is therefore an ad-hoc reference, rather than a systematic collection of all acronyms related to aerospace science and technology.

Source record↗

Irrelevance Reasoning in Knowledge Based Systems

This dissertation considers the problem of reasoning about irrelevance of knowledge in a principled and efficient manner. Specifically, it is concerned with two key problems: (1) developing algorithms for automatically deciding what parts of a knowledge base are irrelevant to a query and (2) the utility of relevance reasoning. The dissertation describes a novel tool, the query-tree, for reasoning about irrelevance. Based on the query-tree, we develop several algorithms for deciding what formulas are irrelevant to a query. Our general framework sheds new light on the problem of detecting independence of queries from updates. We present new results that significantly extend previous work in this area. The framework also provides a setting in which to investigate the connection between the notion of irrelevance and the creation of abstractions. We propose a new approach to research on reasoning with abstractions, in which we investigate the properties of an abstraction by considering the irrelevance claims on which it is based. We demonstrate the potential of the approach for the cases of abstraction of predicates and projection of predicate arguments. Finally, we describe an application of relevance reasoning to the domain of modeling physical devices.

INFERENCE↗

Practical Application of Model Checking in Software Verification

This paper presents our experiences in applying the JAVA PATHFINDER (J(sub PF)), a recently developed JAVA to SPIN translator, in the finding of synchronization bugs in a Chinese Chess game server application written in JAVA. We give an overview of J(sub PF) and the subset of JAVA that it supports and describe the abstraction and verification of the game server. Finally, we analyze the results of the effort. We argue that abstraction by under-approximation is necessary for abstracting sufficiently smaller models for verification purposes; that user guidance is crucial for effective abstraction; and that current model checkers do not conveniently support the computational models of software in general and JAVA in particular.

Havelund, Klaus↗

Sixth International Conference on Mars

This publication contains the extended abstracts that were accepted for presentation at the 6th International Conference on Mars, held in Pasadena, CA July 20-25, 2003. The file contains the preface, table of contents, program, abstracts, and indexes. The extended abstracts review and debate some of the key questions and controversies that have matured during the flood of MGS and Odyssey data. The papers are presented in PDF format and are indexed by abstract author, and program author.

Steven Mackwell↗

Retrofitting the AutoBayes Program Synthesis System with Concrete Syntax

AutoBayes is a fully automatic, schema-based program synthesis system for statistical data analysis applications. Its core component is a schema library. i.e., a collection of generic code templates with associated applicability constraints which are instantiated in a problem-specific way during synthesis. Currently, AutoBayes is implemented in Prolog; the schemas thus use abstract syntax (i.e., Prolog terms) to formulate the templates. However, the conceptual distance between this abstract representation and the concrete syntax of the generated programs makes the schemas hard to create and maintain. In this paper we describe how AutoBayes is retrofitted with concrete syntax. We show how it is integrated into Prolog and describe how the seamless interaction of concrete syntax fragments with AutoBayes's remaining legacy meta-programming kernel based on abstract syntax is achieved. We apply the approach to gradually mitigate individual schemas without forcing a disruptive migration of the entire system to a different First experiences show that a smooth migration can be achieved. Moreover, it can result in a considerable reduction of the code size and improved readability of the code. In particular, abstracting out fresh-variable generation and second-order term construction allows the formulation of larger continuous fragments.

Fischer, Bernd↗

Structure, Intent and Conformance Monitoring in ATC

Infield studies of current Air Traffic Control operations it is found that controllers rely on underlying airspace structure to reduce the complexity of the planning and conformance monitoring tasks. The structure appears to influence the controller's working mental model through abstractions that reduce the apparent cognitive complexity. These structure-based abstractions are useful for the controller's key tasks of planning, implementing, monitoring, and evaluating tactical situations. In addition, the structure-based abstractions appear to be important in the maintenance of Situation Awareness. The process of conformance monitoring is analyzed in more detail and an approach to conformance monitoring which utilizes both the structure-based abstractions and intent is presented.

Reynolds, Tom G.↗

A Modeling Pattern for Layered System Interfaces

Communications between systems is often initially represented at a single, high level of abstraction, a link between components. During design evolution it is usually necessary to elaborate the interface model, defining it from several different, related viewpoints and levels of abstraction. This paper presents a pattern to model such multi-layered interface architectures simply and efficiently, in a way that supports expression of technical complexity, interfaces and behavior, and analysis of complexity. Each viewpoint and layer of abstraction has its own properties and behaviors. System elements are logically connected both horizontally along the communication path, and vertically across the different layers of protocols. The performance of upper layers depends on the performance of lower layers, yet the implementation of lower layers is intentionally opaque to upper layers. Upper layers are hidden from lower layers except as sources and sinks of data. The system elements may not be linked directly at each horizontal layer but only via a communication path, and end-to-end communications may depend on intermediate components that are hidden from them, but may need to be shown in certain views and analyzed for certain purposes. This architectural model pattern uses methods described in ISO 42010, Recommended Practice for Architectural Description of Software-intensive Systems and CCSDS 311.0-M-1, Reference Architecture for Space Data Systems (RASDS). A set of useful viewpoints and views are presented, along with the associated modeling representations, stakeholders and concerns. These viewpoints, views, and concerns then inform the modeling pattern. This pattern permits viewing the system from several different perspectives and at different layers of abstraction. An external viewpoint treats the systems of interest as black boxes and focuses on the applications view, another view exposes the details of the connections and other components between the black boxes. An internal view focuses on the implementation within the systems of interest, either showing external interface bindings and specific standards that define the communication stack profile or at the level of internal behavior. Orthogonally, a horizontal view isolates a single layer and a vertical viewpoint shows all layers at a single interface point between the systems of interest. Each of these views can in turn be described from both behavioral and structural viewpoints.

Shames, Peter M.↗

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↗