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,387 records · Page 77

Synthesis of main group, rare-earth, and d{sup 0} metal complexes containing beta-hydrogen

A series of organometallic compounds containing the tris(dimethylsilyl)methyl ligand are described. The potassium carbanions KC(SiHMe 2 ) 3 and KC(SiHMe 2 }) 3 TMEDA are synthesized by deprotonation of the hydrocarbon HC(SiHMe 2 ) 3 with potassium benzyl. KC(SiHMe 2 ) 3 TMEDA crystallizes as a dimer with two types of three-center-two-electron KH- Si interactions. Homoleptic Ln(III) tris(silylalkyl) complexes containing β-SiH groups M{C(SiHMe 2 ) 3 } 3 (Ln = Y, Lu, La) are synthesized from salt elimination of the corresponding lanthanide halide and 3 equiv. of KC(SiHMe 2 ) 3 . The related reactions with Sc yield bis(silylalkyl) ate-complexes containing either LiCl or KCl. The divalent calcium and ytterbium compounds M{C(SiHMe 2 ) 3 } 2 L (M = Ca, Yb; L = THF 2 or TMEDA) are prepared from MI 2 and 2 equiv of KC(SiHMe 2 ) 3 . The compounds M{C(SiHMe 2 ) 3 } 2 L (M = Ca, Yb; L = THF 2 or TMEDA) and La{C(SiHMe 2 ) 3 } 3 react with 1 equiv of B(C 6 F 5 ) 3 to give 1,3- disilacyclobutane {Me2Si-C(SiHMe2)2}2 and MC(SiHMe2)3HB(C6F5)3L, and La{C(SiHMe 2 ) 3 } 2 HB(C 6 F 5 ) 3 , respectively. The corresponding reactions of Ln{C(SiHMe 2 ) 3 } 3 (Ln = Y, Lu) give the β-SiH abstraction product [{(Me 2 HSi) 3 C} 2 LnC(SiHMe 2 ) 2 SiMe 2 ][HB(C 6 F 5 ) 3 ] (Ln = Y, Lu), but the silene remains associated with the Y or Lu center. The abstraction reactions of M{C(SiHMe 2 ) 3 } 2 L (M = Ca, Yb; L = THF 2 or TMEDA) and Ln{C(SiHMe 2 ) 3 } 3 (Ln = Y, Lu, La) and 2 equiv of B(C 6 F 5 ) 3 give the expected dicationic M{HB(C 6 F 5 ) 3 } 2 L (M = Ca, Yb; L = THF 2 or TMEDA) and dicationic mono(silylalkyl) LnC(SiHMe 2 ) 3 {HB(C 6 F 5 ) 3 } 2 (Ln = Y, Lu, La), respectively. Salt metathesis reactions of Cp 2 (NR 2 )ZrX (X = Cl, I, OTf; R = t-Bu, SiHMe 2 ) and lithium hydrosilazide ultimately afford hydride products Cp 2 (NR 2 )ZrH that suggest unusual β-hydrogen elimination processes. A likely intermediate in one of these reactions, Cp 2 Zr[N(SiHMe 2 )t-Bu][N(SiHMe 2 ) 2 ], is isolated under controlled synthetic conditions. Addition of alkali metal salts to this zirconium hydrosilazide compound produces the corresponding zirconium hydride. However as conditions are varied, a number of other pathways are also accessible, including C-H/Si-H dehydrocoupling, γ-abstraction of a CH, and β-abstraction of a SiH. Our observations suggest that the conversion of (hydrosilazido)zirconocene to zirconium hydride does not follow the classical four-center β- elimination mechanism.

36 MATERIALS SCIENCE↗

Initial CEED API (CEED-MS10)

Key components of CEED software development involve fast finite element operator storage and evaluation, architecture optimizations, performant algorithms for all orders, global kernels for finite element operators, efficient use of the memory sub-system, optimal data locality and motion, enhanced scalability and parallelism, and fast tensor contractions. As ultimate goals of the project, CEED is exploring and identifying the best algorithms for the full range of discretizations and applying algorithmic and software development to support ECP applications’ needs. In this milestone, we initiated the development and implementation of a common CEED API consisting of two main components: low-level and high-level APIs. We accomplished the goal of having the low-level component ready for the release of CEED v1.0 in the next quarter, see CEED-MS13. In this report we also provide a highlight from CEED’s integration with the MARBL app and the corresponding Laghos miniapp. A main theme in this work has been the systematic transition of advanced algorithms, developed and tested in Laghos, to the large-scale multi-physics settings of the MARBL code. The low-level CEED API provides a set of FE kernels and components for writing new low-level kernels. Examples include: vector and sparse linear algebra, element matrix assembly over a batch of elements, partial assembly and action for efficient high-order operators like mass, diffusion, advection, etc. The main goal of the low-level API is to establish the basis for the high-level API. Also, identifying such low-level kernels and providing a reference implementation for them serves as the basis for collaboration with vendors and STs. Another goal for the low-level API is to make it easy for applications with their own discretization infrastructure, who do not want to switch directly to using the high-level CEED API, to still evaluate and use the core operations provided by the low-level API. One of the challenges with high-order methods is that a global sparse matrix is no longer a good representation of a high-order linear operator, both with respect to the FLOPs needed for its evaluation, as well as the memory transfer needed for a matvec. Thus, another important question we tried to address while developing the low-level API is: is it possible to abstract out in a natural and efficient way the different implementations and data structures that arise when dealing with various computational device types: CPUs, GPUs, etc. Fully answering this question is beyond the scope of this particular milestone, since that requires longer time as we develop and expand the devices we support. The future high-level API will be the frontend provided by CEED consisting of high-level abstractions such as meshes, finite element spaces and solutions, bilinear forms, solvers, etc. At this high-level, an important aspect of the API will be to provide a uniform abstraction layer for writing code in a portable manner. To achieve that, we plan to utilize the MPI programming model combined with a device abstraction layer (DAL) for finite element computations that we will develop. The DAL will serve as the bridge between the low- and the high-level APIs, allowing a variety of programming models to be used for the low-level kernel implementations. The software artifacts delivered as part of this milestone include an initial CEED API software implementation (libCEED) provided through the CEED website, http://ceed.exascaleproject.org and the CEED GitHub organization, http://github.com/ceed. In addition to details and results from the above R&D efforts, in this document we are also reporting on other project-wide activities performed in Q1 of FY18, including: the Nek5000 v17.0 MFEM v3.3.2 and PETSc v3.8 releases, collaborations with ECP/ST and SciDAC projects, the inaugural Nek5000 hackathon and various outreach activities.

97 MATHEMATICS AND COMPUTING↗

Programmable formatting of program text: Experiences drawn from the TAMPR system

The TAMPR System originated as an approach to the problem of automating the routine modifications of FORTRAN source programs required to adapt them to a variety of uses or environments. Three steps are involved: (1) A FORTRAN source program is processed by the TAMPR Recognizer, yielding essentially a parse tree called the abstract form, (2) the Transformation Interpreter applies IGT's (Intragrammatical Transformations) to the abstract form as tree operations, and (3) the abstract form is then reconverted to source program form by the Formatter. By ensuring that the transformations are applied only to the correct syntactic entities and only in the intended contexts, the use of the abstract form greatly simplifies establishing the reliability of the overall process.

Dritz, K. W.↗

Hierarchical specification of the SIFT fault tolerant flight control system

The specification and mechanical verification of the Software Implemented Fault Tolerance (SIFT) flight control system is described. The methodology employed in the verification effort is discussed, and a description of the hierarchical models of the SIFT system is given. To meet the objective of NASA for the reliability of safety critical flight control systems, the SIFT computer must achieve a reliability well beyond the levels at which reliability can be actually measured. The methodology employed to demonstrate rigorously that the SIFT computer meets as reliability requirements is described. The hierarchy of design specifications from very abstract descriptions of system function down to the actual implementation is explained. The most abstract design specifications can be used to verify that the system functions correctly and with the desired reliability since almost all details of the realization were abstracted out. A succession of lower level models refine these specifications to the level of the actual implementation, and can be used to demonstrate that the implementation has the properties claimed of the abstract design specifications.

Melliar-Smith, P. M.↗

Intrinsic adaptive mesh techniques

An alternating direction adaptive grid movement code was developed and a thesis adaptive angular meshes was directed. The alternating direction code was also established on the NASA Langley computer system and is available for use there. In essence, grid points are moved on an abstract surface above physical space by means of alternating coordinate directions. The abstract surface is formed with the salient solution properties if they can be extracted by a priori physical reasoning; or otherwise, in the absence of such reasoning, by the use of error estimates in some chosen norm. Upon formulation, all important driving properties for adaptive purposes are consolidated into one object - the abstract surface. At a basic level, a uniform distribution of surface points is equivalent to gradient resolution. This arises from a projection back down into physical space. At a higher level, a more accurate view of the abstract surface is obtained when changes in surface direction are also resolved. The appropriate measure for direction changes is normal curvature. It is defined as the rate of change of surface tangent planes as a surface coordinate curve is transversed in uniform increments of arc length.

Eiseman, P. R.↗

The Hierarchical Specification and Mechanical Verification of the SIFT Design

The formal specification and proof methodology employed to demonstrate that the SIFT computer system meets its requirements are described. The hierarchy of design specifications is shown, from very abstract descriptions of system function down to the implementation. The most abstract design specifications are simple and easy to understand, almost all details of the realization were abstracted out, and are used to ensure that the system functions reliably and as intended. A succession of lower level specifications refines these specifications into more detailed, and more complex, views of the system design, culminating in the Pascal implementation. The section describes the rigorous mechanical proof that the abstract specifications are satisfied by the actual implementation.

Source record↗

Verification of Numerical Algorithms

The following strategy is suggested for specification and proof: (1) Defer the construction of a formal program specification with respect to I/O assertions unit the correctness of the program with respect to an abstract mathematical model of program intent is demonstrated. (2) Prove that an abstract machine (using infinite precision arithmetic) would compute that object exactly. (3) Prove that the computational sequences of arithmetic operations that occur in the abstract machine must be precisely the same at every step as those occurring on an actual machine (with finite precision arithmetic), executing the same program. (4) Use a Verification Conditions VC-generator that knows about the semantics of arithmetic operations to annotate the program with assertions that bound (or in some circumstances estimate) the difference between the actual machine state variables and the corresponding ones of the abstract machine. Construct the formal program specification by combining the verification conditions into theorems about computational error that can be proved with mechanical assistance.

Source record↗

Automated generation of reliability models

The abstract semi-Markov specification interface to the SURE (Semi-Markov Range Evaluator) tool (ASSIST) program allows the user to describe the Markov model in a high-level language. Instead of listing the individual states of the model, the user specifies the rules governing the behavior of the system, and these are used to automatically generate the model. A small number of statements in the abstract language can describe a large, complex model. Becuase no assumptions are made about the system being modeled, ASSIST can be used to generate models describing the behavior of any type of system. The abstract model definition and the automatic model generation strategy are described. Analysis of an example fault-tolerant architecture, a triad of processor with cold spare processors, shows how the behavior of a system can be captured by a few general rules. The syntax of the ASSIST input language is then described and demonstrated by creating a model to describe the fault behavior of the example architecture. The flexibility of the abstract language is demonstrated by expanding the example to model multiple triads of processors sharing a pool of cold spare processors.

Johnson, Sally C.↗

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.↗