Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Abstracts”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRS2004

Full Text Searching and Customization in the NASA ADS Abstract Service

The NASA-ADS Abstract Service provides a sophisticated search capability for the literature in Astronomy, Planetary Sciences, Physics/Geophysics, and Space Instrumentation. The ADS is funded by NASA and access to the ADS services is free to anybody worldwide without restrictions. It allows the user to search the literature by author, title, and abstract text. The ADS database contains over 3.6 million references, with 965,000 in the Astronomy/Planetary Sciences database, and 1.6 million in the Physics/Geophysics database. 2/3 of the records have full abstracts, the rest are table of contents entries (titles and author lists only). The coverage for the Astronomy literature is better than 95% from 1975. Before that we cover all major journals and many smaller ones. Most of the journal literature is covered back to volume 1. We now get abstracts on a regular basis from most journals. Over the last year we have entered basically all conference proceedings tables of contents that are available at the Harvard Smithsonian Center for Astrophysics library. This has greatly increased the coverage of conference proceedings in the ADS. The ADS also covers the ArXiv Preprints. We download these preprints every night and index all the preprints. They can be searched either together with the other abstracts or separately. There are currently about 260,000 preprints in that database. In January 2004 we have introduced two new services, full text searching and a personal notification service called "myADS". As all other ADS services, these are free to use for anybody.

Eichhorn, G.↗
DOE OSTI2021

Transformation of an Embedded Five-Membered Ring in Polycyclic Aromatic Hydrocarbons via the Hydrogen-Abstraction–Acetylene-Addition Mechanism: A Theoretical Study

Five-membered rings are constituents of many polycyclic aromatic hydrocarbons (PAHs) and their presence on the edges of large PAHs has been repeatedly observed experimentally. However, modern kinetic combustion models often do not consider the growth of PAHs through the transformation of the five-membered rings. Here, in connection with the above, we carried out a theoretical study of the mechanism of Hydrogen-Abstraction-aCetylene-Addition (HACA) transformation of an embedded five-membered ring on the armchair PAH edge to a six-membered ring, considering cyclopenta[d,e,f]phenanthrene (4,5-methylenephenanthrene) as a prototype system for this process. The potential energy surface for the reactions of cyclopenta[d,e,f]phenanthrenyl radicals produced by direct H abstractions from cyclopenta[d,e,f]phenanthrene with acetylene has been compiled at the G3(MP2,CC)//B3LYP/6-311G(d,p) level of theory including zero-point vibrational energy corrections. The computed energies and molecular parameters were then used to solve the Rice-Ramsperger-Kassel-Marcus Master Equation (RRKM-ME) in order to calculate reaction rate at various pressures and temperatures, which were fitted to modified Arrhenius equation for further kinetic modeling. The results show that the HACA transformation of the embedded five-membered ring to a six-membered ring is possible, albeit slow. The most viable reaction mechanism involves the R2 + C 2 H 2 reaction, where the acetylene molecules adds to a σ-radical in the six-membered ring adjacent to the five-membered ring via a low entrance barrier. The predominant product of R2 + C 2 H 2 is predicted to be 3 ethynyl 4H cyclopenta[def]phenanthrene Pr5 via immediate H elimination from the initial addition complex. Next, Pr5 undergoes H-assisted isomerization to 4aH-pentaleno[4,3,2,1-cdef]phenanthrene Pr4, and the latter adds an H atom eventually forming the 1-pyrenylmethyl radical Pr3: R2 + C 2 H 2 ⇌ 3 ethynyl 4H cyclopenta[def]phenanthrene (Pr5) + H ⇌ 4aH-pentaleno[4,3,2,1-cdef]phenanthrene (Pr4) + H Pr5 + H ⇌ Pr4 + H Pr4 + H → 1-pyrenylmethyl (Pr3) This HACA sequence may be competitive with the methyl radical addition to the R1 radical formed by H abstraction from the CH 2 group in the five-membered ring of cyclopenta[d,e,f]phenanthrene, which provides a pathway to pyrene following two H atom losses. Relative contributions of the two mechanisms of the five- to six-membered ring transformation would strongly depend on the branching ratios of the R1 and R2 radicals produced by the H abstractions and the available concentration of C 2 H 2 vs. CH 3 and hence differ in different flames.

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

A unifying modeling abstraction for infinite-dimensional optimization

Infinite-dimensional optimization (InfiniteOpt) problems involve modeling components (variables, objectives, and constraints) that are functions defined over infinite-dimensional domains. Examples include continuous-time dynamic optimization (time is an infinite domain and components are functions of time), PDE optimization problems (space and time are infinite domains and components are functions of space-time), as well as stochastic and semi-infinite optimization (random space is an infinite domain and components are a function of such random space). InfiniteOpt problems also arise from combinations of these problem classes (e.g., stochastic PDE optimization). Given the infinite-dimensional nature of objectives and constraints, one often needs to define appropriate quantities (measures) to properly pose the problem. Moreover, InfiniteOpt problems often need to be transformed into a finite dimensional representation so that they can be solved numerically. Here in this work, we present a unifying abstraction that facilitates the modeling, analysis, and solution of InfiniteOpt problems. The proposed abstraction enables a general treatment of infinite-dimensional domains and provides a measure-centric paradigm to handle associated variables, objectives, and constraints. This abstraction allows us to transfer techniques across disciplines and with this identify new, interesting, and useful modeling paradigms (e.g., event constraints and risk measures defined over time domains). Our abstraction serves as the backbone of an intuitive Julia-based modeling package that we call InfiniteOpt.jl. We demonstrate the developments using diverse case studies arising in engineering.

42 ENGINEERING↗
DOE OSTI2021

Con Connections: Detecting Fraud from Abstracts using Topological Data Analysis

In this paper we present a novel approach for identifying fraudulent papers from their titles and abstracts. The premise of the approach is that there are holes in the presentation of the approach and findings of fraudulent research papers. As an abstract is intended to highlight key features of the approach as well as important conclusions the authors seek to determine if the assumed existence of holes can be identified from analysis of abstracts alone. The data set considered is derived from papers sharing a single author with labels determined based on a formal linguistic analysis of the complete documents. To detect these logical and literary holes we utilize techniques from topological data analysis which summarizes data based on the presence of multi-dimensional, topological holes. We find that, in fact, topological features derived through a combination of techniques in natural language processing and time-series analysis allow for superior detection of the fraudulent papers than the natural language processing tools alone. Thus we conclude that the connections and holes present in the abstracts of research cons contributes to an ability to infer the scientific validity of the corresponding work.

Tymochko, Sarah J.↗
NASA NTRS1976

NASA patent abstracts bibliography: A continuing bibliography. Section 2: Indexes (supplement 08)

This bibliography is issued in two sections: Section 1 - Abstracts, and Section 2 - Indexes. This issue of the Abstract Section cites 180 patents and applications for patents introduced into the NASA scientific and technical information system during the period July 1975 through December 1975. Each entry in the Abstract Section consists of a citation, an abstract, and, in most cases, a key illustration selected from the patent or application for patent. This issue of the Index Section contains entries for 2,905 patents and applications for patent citations covering the period May 1969 through December 1975. The Index Section contains five indexes -- subject, inventor, source, number, and accession number.

Source record↗
NASA NTRS1986

Intuitive reasoning about abstract and familiar physics problems

Previous research has demonstrated that many people have misconceptions about basic properties of motion. Two experiments examined whether people are more likely to produce dynamically correct predictions about basic motion problems involving situations with which they are familiar, and whether solving such problems enhances performance on a subsequent abstract problem. In experiment 1, college students were asked to predict the trajectories of objects exiting a curved tube. Subjects were more accurate on the familiar version of the problem, and there was no evidence of transfer to the abstract problem. In experiment 2, two familiar problems were provided in an attempt to enhance subjects' tendency to extract the general structure of the problems. Once again, they gave more correct responses to the familiar problems but failed to generalize to the abstract problem. Formal physics training was associated with correct predictions for the abstract problem but was unrelated to performance on the familiar problems.

Kaiser, Mary Kister↗
NASA NTRS1990

Masking failures of multidimensional sensors (extended abstract)

When a computer monitors a physical process, the computer uses sensors to determine the values of the physical variables that represent the state of the process. A sensor can sometimes fail, however, and in the worst case report a value completely unrelated to the true physical value. The work described is motivated by a methodology for transforming a process control program that can not tolerate sensor failure into one that can. In this methodology, a reliable abstract sensor is created by combining information from several real sensors that measure the same physical value. To be useful, an abstract sensor must deliver reasonably accurate information at reasonable computational cost. Sensors are considered that deliver multidimensional values (e.g., location or velocity in three dimensions, or both temperature and pressure). Geometric techniques are used to derive upper bounds on abstract sensor accuracy and to develop efficient algorithms for implementing abstract sensors.

Chew, Paul↗
NASA NTRS1991

NASA Automated Rendezvous and Capture Review. A compilation of the abstracts

This document presents a compilation of abstracts of papers solicited for presentation at the NASA Automated Rendezvous and Capture Review held in Williamsburg, VA on November 19-21, 1991. Due to limitations on time and other considerations, not all abstracts could be presented during the review. The organizing committee determined however, that all abstracts merited availability to all participants and represented data and information reflecting state-of-the-art of this technology which should be captured in one document for future use and reference. The organizing committee appreciates the interest shown in the review and the response by the authors in submitting these abstracts.

Source record↗
NASA NTRS1992

An Integrated Planning Representation Using Macros, Abstractions, and Cases

Planning will be an essential part of future autonomous robots and integrated intelligent systems. This paper focuses on learning problem solving knowledge in planning systems. The system is based on a common representation for macros, abstractions, and cases. Therefore, it is able to exploit both classical and case based techniques. The general operators in a successful plan derivation would be assessed for their potential usefulness, and some stored. The feasibility of this approach was studied through the implementation of a learning system for abstraction. New macros are motivated by trying to improve the operatorset. One heuristic used to improve the operator set is generating operators with more general preconditions than existing ones. This heuristic leads naturally to abstraction hierarchies. This investigation showed promising results on the towers of Hanoi problem. The paper concludes by describing methods for learning other problem solving knowledge. This knowledge can be represented by allowing operators at different levels of abstraction in a refinement.

Baltes, Jacky↗
NASA NTRS1992

Localization Versus Abstraction: A Comparison of Two Search Reduction Techniques

There has been much recent work on the use of abstraction to improve planning behavior and cost. Another technique for dealing with the inherently explosive cost of planning is localization. This paper compares the relative strengths of localization and abstraction in reducing planning search cost. In particular, localization is shown to subsume abstraction. Localization techniques can model the various methods of abstraction that have been used, but also provide a much more flexible framework, with a broader range of benefits.

Lansky, Amy L.↗
NASA NTRS1991

Automatic Abstraction in Planning

Traditionally, abstraction in planning has been accomplished by either state abstraction or operator abstraction, neither of which has been fully automatic. We present a new method, predicate relaxation, for automatically performing state abstraction. PABLO, a nonlinear hierarchical planner, implements predicate relaxation. Theoretical, as well as empirical results are presented which demonstrate the potential advantages of using predicate relaxation in planning. We also present a new definition of hierarchical operators that allows us to guarantee a limited form of completeness. This new definition is shown to be, in some ways, more flexible than previous definitions of hierarchical operators. Finally, a Classical Truth Criterion is presented that is proven to be sound and complete for a planning formalism that is general enough to include most classical planning formalisms that are based on the STRIPS assumption.

LOGIC PROGRAMMING↗
NASA NTRS2004

Abstraction and Assume-Guarantee Reasoning for Automated Software Verification

Compositional verification and abstraction are the key techniques to address the state explosion problem associated with model checking of concurrent software. A promising compositional approach is to prove properties of a system by checking properties of its components in an assume-guarantee style. This article proposes a framework for performing abstraction and assume-guarantee reasoning of concurrent C code in an incremental and fully automated fashion. The framework uses predicate abstraction to extract and refine finite state models of software and it uses an automata learning algorithm to incrementally construct assumptions for the compositional verification of the abstract models. The framework can be instantiated with different assume-guarantee rules. We have implemented our approach in the COMFORT reasoning framework and we show how COMFORT out-performs several previous software model checking approaches when checking safety properties of non-trivial concurrent programs.

Chaki, S.↗
NASA NTRS2006

NASA Patent Abstracts October 2006: A Continuing Bibliography

Several thousand inventions result each year from research supported by the National Aeronautics and Space Administration. NASA seeks patent protection on inventions to which it has title if the invention has important use in government programs or significant commercial potential. These inventions cover a broad range of technologies and include many that have useful and valuable commercial application. NASA inventions best serve the interests of the United States when their benefits are available to the public. In many instances, the granting of nonexclusive or exclusive licenses for the practice of these inventions may assist in the accomplishment of this objective. This bibliography is published as a service to companies, firms, and individuals seeking new, licensable products for the commercial market. The NASA Patent Abstracts Bibliography is an annual NASA publication containing comprehensive abstracts of NASA-owned inventions covered by U.S. patents. The citations included were originally published in NASA s Scientific and Technical Aerospace Reports (STAR) and cover STAR announcements made since May 1969. The citations published in this issue cover the period July 2005 through September 2006. The range of subjects covered includes the NASA Scope and Subject Category Guide's 10 broad subject divisions separated further into 76 specific categories. However, not all categories contain citations during the dates covered for this issue; therefore, the Table of Contents does not include all divisions and categories. This scheme was devised in 1975 and last revised in 2005 in lieu of the 34 category divisions which were utilized in supplements (01) through (06) covering STAR abstracts from May 1969 through January 1974. Each entry consists of a citation accompanied by an abstract and, when appropriate, a key illustration taken from the patent or application for patent. Entries are arranged by subject category in ascending order. When available, citations contain a link to the full-text document online. Two indexes, Subject Term and Personal Author, are available within the publication.

Source record↗
NASA NTRS2008

Automated Assume-Guarantee Reasoning by Abstraction Refinement

Current automated approaches for compositional model checking in the assume-guarantee style are based on learning of assumptions as deterministic automata. We propose an alternative approach based on abstraction refinement. Our new method computes the assumptions for the assume-guarantee rules as conservative and not necessarily deterministic abstractions of some of the components, and refines those abstractions using counter-examples obtained from model checking them together with the other components. Our approach also exploits the alphabets of the interfaces between components and performs iterative refinement of those alphabets as well as of the abstractions. We show experimentally that our preliminary implementation of the proposed alternative achieves similar or better performance than a previous learning-based implementation.

Pasareanu, Corina S.↗
DOE OSTI2025

SynopFrame: Multiscale time-dependent visual abstraction framework for analyzing DNA nanotechnology simulations

We present an open-source framework, SynopFrame, that allows DNA nanotechnology (DNA-nano) experts to analyze and understand molecular dynamics simulation trajectories of their designs. We use a multiscale multi-dimensional abstraction space, connect the representations to a projected conformational space plot of the structure’s temporal sequence, and thus enable experts to analyze the dynamics of their structural designs and, specifically, failure cases of the assembly. In addition, our time-dependent abstraction representation allows the biologists, for the first time in a smooth and structurally clear way, to identify and observe temporal transitions of a DNA-nano design from one configuration to another, and to highlight important periods of the simulation for further analysis. We realize SynopFrame as a dashboard of the different synchronized 3D spatial and 2D schematic visual representations, with a color overlay to show essential properties such as the status of hydrogen bonds. The linking of the spatial, schematic, and abstract views ensures that users can effectively analyze the high-frequency motion. We also categorize the status of the hydrogen bonds into a new format to allow us to color-encode it and overlay it on the representations. To demonstrate the utility of SynopFrame, we describe example usage scenarios and report user feedback.

Abstraction space↗
DOE OSTI2023

Theory-Based Mechanism for Fluoromethane Combustion I: Thermochemistry and Abstraction Reactions

A new detailed chemical kinetic mechanism is presented for small fluorinated hydrocarbons. Ab initio electronic structure theory is used to provide heats of formation with subchemical accuracy. The ANL0 method is extended to include fluorine. The resulting heats of formation at 0 K are in excellent agreement with 36 benchmark species in the Active Thermochemical Tables, with a mean error of μ = –0.02 kJ/mol and a standard deviation of σ = 0.91 kJ/mol. The thermophysical properties for 92 small-molecule H/C/O/F species are computed. The rate coefficients for 40+ H-abstraction reactions involving H, O, F, OH, OF, HO 2 , and various methyl radicals with CH 4 , CH 3 F, CH 2 F 2 , CHF 3 , CH 2 O, and CHFO are discussed. Here, the computed rate constants are in excellent agreement with the available literature. Additionally, 30+ rate constants are provided for F abstraction, which are several orders of magnitude smaller than H abstraction. The thermophysical properties and rate constants are provided in a mechanism. This mechanism is the first in a series of theory-based investigations into the thermal destruction of per- and polyfluorinated species.

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

A Pd III Sulfate Dimer Initiates Rapid Methane Monofunctionalization by H Atom Abstraction

An electrogenerated Pd III 2 species in fuming sulfuric acid is competent for rapid and concurrent methane monohydroxylation to methyl bisulfate (CH 3 OSO 3 H) and methane sulfonation to methanesulfonic acid (CH 3 SO 3 H). In situ NMR at 50 °C is used to track methane transformation exclusively to CH 3 OSO 3 H and CH 3 SO 3 H at high conversions. Integrating a set of kinetic and computational studies, the mechanism of methane monofunctionalization by Pd III 2 is examined. Here, experimental rate laws and common kinetic isotope effects for CH 3 OSO 3 H and CH 3 SO 3 H formation suggest that both transformations proceed via a common rate-limiting C-H activation step. Introduction of O 2 or Pd II,III 2 suppresses CH 3 SO 3 H generation, indicating a radical chain sequence. Although the metal-metal bonded Pd III 2 complex is a net two-electron oxidant, our aggregate kinetic data point to a mechanistic model that features rate-limiting H atom abstraction by the Pd III 2 complex to generate a methyl radical intermediate. The CH 3 • intermediate then recombines with Pd II,III 2 to furnish a CH 3 Pd III 2 intermediate that reductively eliminates CH 3 OSO 3 H. Alternatively, the CH 3 intermediate can enter a chain reaction with SO 3 to generate CH 3 SO 3 H. DFT computations support the radical-based C-H activation by Pd III 2 and delineate H atom abstraction pathways with computed reaction barriers and kinetic isotope effects (KIEs) that are consistent with experimental data. These mechanistic investigations challenge the paradigm of electrophilic C-H activation and highlight H atom abstraction as a potent pathway for selective methane C-H oxidative functionalization at high reaction rates.

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

Weakening the N–H Bonds of NH 3 Ligands: Triple Hydrogen-Atom Abstraction to Form a Chromium(V) Nitride

Weakening and cleaving N-H bonds is crucial for improving molecular ammonia oxidation catalysts. In this work, we report the synthesis and hydrogen atom abstraction chemistry of bis(ammonia) Cr porphyrin complexes Cr(TPP)(NH 3 ) 2 and Cr(TMP)(NH 3 ) 2 (TPP = 5,10,15,20-tetraphenyl-meso-porphyrin and TMP = 5,10,15,20-tetramesityl-meso-porphyrin) using bulky aryloxyl radicals. The triple hydrogen atom abstraction reaction results in the formation of Cr V (por)(≡N), with the nitride deriving from ammonia, as indicated by UV-Vis and FT-IR spectroscopy, and a single crystal structural determination of Cr(TPP)(≡N). Subsequent oxidation of this chromium(V)-nitrido complex results in the formation of Cr III (por), with scission of the Cr≡N bond. A computational analysis illustrates the progression from Cr II to Cr V and evaluates the energetics of abstracting hydrogen atoms from Cr II -NH 3 to generate Cr V ≡N. The formation and isolation of Cr V (por)(≡N) illustrates the stability of these species and the need to chemically activate the nitride moiety for atom transfer or N-N coupling reactivity.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗