SEARCH · Search NASA
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.
Abstracts are provided for 131 patents and patent applications entered into the NASA scientific and technical information system during the period Jun. 1993 through Dec. 1993. Each entry consists of a citation, an abstract, and in most cases, a key illustration selected from the patent or patent application.
Abstracts are provided for 137 patents and patent applications entered into the NASA scientific and technical information system during the period Jan. 1994 through Jun. 1994. Each entry consists of a citation, an abstract, and in most cases, a key illustration selected from the patent or patent application.
Abstracts are provided for 85 patents and patent applications entered into the NASA scientific and technical information system during the period July 1995 through December 1995. Each entry consists of a citation, an abstract, and in most cases, a key illustration selected from the patent or patent application.
Patents and applications for patent introduced into the NASA scientific and technical information system are cited. Each entry consists of a citation, an abstract, and a key illustration selected from the patent or application for patent. The patent and application for patent citations are indexed according to subject, inventor, source, number, and accession number.
No abstract available
No abstract available
No abstract available
No abstract available
No abstract available
No abstract available
This continuing bibliography lists index for 3256 patents and patent applications introduced into the NASA scientific and technical informations system from January 1977 through June 1977. The index section contains fix indexes: subject, inventor, source, number, and accession number.
Entries for 4000 patents and patent applications citations for the period May 1969 through June 1982 are listed. Subject, invention, source, number and accession number indexes are included.
Entries for over 4000 patents and patent applications citations for the period May 1969 through December 1982 are listed. Subject, invention, source, number, and accession number indexes are included.
Topics addressed include: greenstone belt tectonics, thermal constaints, geological structure, rock components, crustal accretion model, geological evolution, synsedimentary deformation, Archean structures and geological faults.
The Galileo Retropropulsion Module (RPM) has performed excellently during nearly seven years of Galileo mission operations. The RPM was provided by the Federal Republic of Germany to NASA to provide directed impulse to the Galileo spacecraft during all phases of the Galileo mission following Inertial Upper Stage (IUS) jettison. This paper documents the in-flight performance of the Galileo propulsion system since July 1993.
In work done jointly with Toby Walsh, the author has provided a sound theoretical foundation to the process of reasoning with abstraction (GW90c, GWS9, GW9Ob, GW90a). The notion of abstraction formalized in this work can be informally described as: (property 1), the process of mapping a representation of a problem, called (following historical convention (Sac74)) the 'ground' representation, onto a new representation, called the 'abstract' representation, which, (property 2) helps deal with the problem in the original search space by preserving certain desirable properties and (property 3) is simpler to handle as it is constructed from the ground representation by "throwing away details". One desirable property preserved by an abstraction is provability; often there is a relationship between provability in the ground representation and provability in the abstract representation. Another can be deduction or, possibly inconsistency. By 'throwing away details' we usually mean that the problem is described in a language with a smaller search space (for instance a propositional language or a language without variables) in which formulae of the abstract representation are obtained from the formulae of the ground representation by the use of some terminating rewriting technique. Often we require that the use of abstraction results in more efficient .reasoning. However, it might simply increase the number of facts asserted (eg. by allowing, in practice, the exploration of deeper search spaces or by implementing some form of learning). Among all abstractions, three very important classes have been identified. They relate the set of facts provable in the ground space to those provable in the abstract space. We call: TI abstractions all those abstractions where the abstractions of all the provable facts of the ground space are provable in the abstract space; TD abstractions all those abstractions wllere the 'unabstractions' of all the provable facts of the abstract space are provable in the ground space; and TC abstractions all those abstractions where a fact is provable in the ground space if and only if its abstraction is provable in the abstract space.
In this paper we present a semantic theory of abstractions based on viewing abstractions as interpretations between theories. This theory captures important aspects of abstractions not captured in the theory of abstractions presented by Giunchiglia and Walsh. Instead of viewing abstractions as syntactic mappings, we view abstractions as a two step process: the intended domain model is first abstracted and then a set of (abstract) formulas is constructed to capture the abstracted domain model. Viewing and justifying abstractions as model level transformations is both natural and insightful. We provide a precise characterization of the abstract theory that exactly implements the intended abstraction, and show that this theory, while being axiomatizable, is not always finitely axiomatizable. A simple corollary of the latter result disproves a conjecture made by Tenenberg that if a theory is finitely axiomatizable, then predicate abstraction of that theory leads to a finitely axiomatizable theory.
Current research is demonstrating that model-checking and other forms of automated finite-state verification can be effective for checking properties of software systems. Due to the exponential costs associated with model-checking, multiple forms of abstraction are often necessary to obtain system models that are tractable for automated checking. The Bandera Tool Set provides multiple forms of automated support for compiling concurrent Java software systems to models that can be supplied to several different model-checking tools. In this paper, we describe the foundations of Bandera's data abstraction mechanism which is used to reduce the cardinality (and the program's state-space) of data domains in software to be model-checked. From a technical standpoint, the form of data abstraction used in Bandera is simple, and it is based on classical presentations of abstract interpretation. We describe the mechanisms that Bandera provides for declaring abstractions, for attaching abstractions to programs, and for generating abstracted programs and properties. The contributions of this work are the design and implementation of various forms of tool support required for effective application of data abstraction to software components written in a programming language like Java which has a rich set of linguistic features.