SEARCH · Search NASA

Results for “EXISTENCE THEOREM”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 127 records · Page 7

All sources NASA NTRS DOE OSTI

NASA NTRS1988

Inflation in anisotropic scalar-tensor theories

The existence of an inflationary phase in anisotropic Scalar-Tensor Theories is investigated by means of a conformal transformation that allows us to rewrite these theories as gravity minimally coupled to a scalar field with a nontrivial potential. The explicit form of the potential is then used and the No Hair Theorem concludes that there is an inflationary phase in all open or flat anisotropic spacetimes in these theories. Several examples are constructed where the effect becomes manifest.

Pimentel, Luis O.↗

NASA NTRS2001

Automated Theorem Proving in High-Quality Software Design

The amount and complexity of software developed during the last few years has increased tremendously. In particular, programs are being used more and more in embedded systems (from car-brakes to plant-control). Many of these applications are safety-relevant, i.e. a malfunction of hardware or software can cause severe damage or loss. Tremendous risks are typically present in the area of aviation, (nuclear) power plants or (chemical) plant control. Here, even small problems can lead to thousands of casualties and huge financial losses. Large financial risks also exist when computer systems are used in the area of telecommunication (telephone, electronic commerce) or space exploration. Computer applications in this area are not only subject to safety considerations, but also security issues are important. All these systems must be designed and developed to guarantee high quality with respect to safety and security. Even in an industrial setting which is (or at least should be) aware of the high requirements in Software Engineering, many incidents occur. For example, the Warshaw Airbus crash, was caused by an incomplete requirements specification. Uncontrolled reuse of an Ariane 4 software module was the reason for the Ariane 5 disaster. Some recent incidents in the telecommunication area, like illegal "cloning" of smart-cards of D2GSM handies, or the extraction of (secret) passwords from German T-online users show that also in this area serious flaws can happen. Due to the inherent complexity of computer systems, most authors claim that only a rigorous application of formal methods in all stages of the software life cycle can ensure high quality of the software and lead to real safe and secure systems. In this paper, we will have a look, in how far automated theorem proving can contribute to a more widespread application of formal methods and their tools, and what automated theorem provers (ATPs) must provide in order to be useful.

Schumann, Johann↗

NASA NTRS2009

Hyperbolic Orbits and the Planetary Flylby Anomaly

Space probes in the Solar System have experienced unexpected changes in velocity known as the flyby anomaly [1], as well as shifts in acceleration referred to as the Pioneer anomaly [2-4]. In the case of Earth flybys, ESA s Rosetta spacecraft experienced the flyby effect and NASA s Galileo and NEAR satellites did the same, although MESSENGER did not possibly due to a latitudinal property of gravity assists. Measurements indicate that both anomalies exist, and explanations have varied from the unconventional to suggestions that new physics in the form of dark matter might be the cause of both [5]. Although dark matter has been studied for over 30 years, there is as yet no strong experimental evidence supporting it [6]. The existence of dark matter will certainly have a significant impact upon ideas regarding the origin of the Solar System. Hence, the subject is very relevant to planetary science. We will point out here that one of the fundamental problems in science, including planetary physics, is consistency. Using the well-known virial theorem in astrophysics, it will be shown that present-day concepts of orbital mechanics and cosmology are not consistent for reasons having to do with the flyby anomaly. Therefore, the basic solution regarding the anomalies should begin with addressing the inconsistencies first before introducing new physics.

Wilson, T.L.↗

NASA NTRS1975

A Theoretical Investigation of the Input Characteristics of a Rectangular Cavity-Backed Slot Antenna

Equations which represent the magnetic and electric stored energies are derived for an infinite section of rectangular waveguide and a rectangular cavity. These representations which are referred to as being physically observable are obtained by considering the difference in the volume integrals appearing in the complex Poynting theorem. It is shown that the physically observable stored energies are determined by the field components that vanish in a reference plane outside the aperture. These physically observable representations are used to compute the input admittance of a rectangular cavity-backed slot antenna in which a single propagating wave is assumed to exist in the cavity. The slot is excited by a voltage source connected across its center; a sinusoidal distribution is assumed in the slot. Input-admittance calculations are compared with measured data. In addition, input-admittance curves as a function of electrical slot length are presented for several size cavities. For the rectangular cavity backed slot antenna, the quality factor and relative bandwidth were computed independently by using these energy relationships. It is shown that the asymptotic relationship which is usually assumed to exist between the quality bandwidth and the reciprocal of relative bandwidth is equally valid for the rectangular cavity backed slot antenna.

Cockrell, C. R.↗

NASA NTRS1978

Forced oscillations in quadratically damped systems

Bayliss (1975) has studied the question whether in the case of linear differential equations the relationship between the stability of the homogeneous equations and the existence of almost periodic solutions to the inhomogeneous equation is preserved by finite difference approximations. In the current investigation analogous properties are considered for the case in which the damping is quadratic rather than linear. The properties of the considered equation for arbitrary forcing terms are examined and the validity is proved of a theorem concerning the characteristics of the unique solution. By using the Lipschitz continuity of the mapping and the contracting mapping principle, almost periodic solutions can be found for perturbations of the considered equation. Attention is also given to the Lipschitz continuity of the solution operator and the results of numerical tests which have been conducted to test the discussed theory.

Bayliss, A.↗

NASA NTRS1987

The field-aligned flow approximation for electrons within layers possessing a normal mass flux - A corollary to the deHoffmann-Teller theorem

In this paper, an approximate extension of the deHoffmann-Teller (1950) theorem for electrons within layers possessing a normal mass flux is derived. It is shown that the deHoffmann-Teller frame electron bulk velocity is nearly parallel to the magnetic field everywhere through those one-dimensional time-stationary layers which possess a normal mass flux, even though electric field perpendicular to the magnetic field exists throughout such layers. Examples of layers of this class are the fast and slow shocks as well as rotational discontinuities.

Scudder, J. D.↗

NASA NTRS1975

Random coding strategies for minimum entropy

This paper proves that there exists a fixed random coding strategy for block coding a memoryless information source to achieve the absolute epsilon entropy of the source. That is, the strategy can be chosen independent of the block length. The principal new tool is an easy result on the semicontinuity of the relative entropy functional of one probability distribution with respect to another. The theorem generalizes a result from rate-distortion theory to the 'zero-infinity' case.

Posner, E. C.↗

NASA NTRS1972

Review of critical flow rate, propagation of pressure pulse, and sonic velocity in two-phase media

For single-phase media, the critical discharge velocity, the sonic velocity, and the pressure pulse propagation velocity can be expressed in the same form by assuming isentropic, equilibria processes. In two-phase mixtures, the same concept is not valid due to the existence of interfacial transports of momentum, heat, and mass. Thus, the three velocities should be treated differently and separately for each particular condition, taking into account the various transport processes involved under that condition. Various attempts are reviewed to predict the critical discharge rate or the propagation velocities by considering slip ratio (momentum change), evaporation (mass and heat transport), flow pattern, etc. Experimental data were compared with predictions based on various theorems. The importance is stressed of the time required to achieve equilibrium as compared with the time available during the process, for example, of passing a pressure pulse.

Hsu, Y.↗

NASA NTRS1990

On well-partial-order theory and its application to combinatorial problems of VLSI design

We nonconstructively prove the existence of decision algorithms with low-degree polynomial running times for a number of well-studied graph layout, placement, and routing problems. Some were not previously known to be in p at all; others were only known to be in p by way of brute force or dynamic programming formulations with unboundedly high-degree polynomial running times. Our methods include the application of the recent Robertson-Seymour theorems on the well-partial-ordering of graphs under both the minor and immersion orders. We also briefly address the complexity of search versions of these problems.

Fellows, M.↗

NASA NTRS2004

Automatic Generation of Algorithms for the Statistical Analysis of Planetary Nebulae Images

Analyzing data sets collected in experiments or by observations is a Core scientific activity. Typically, experimentd and observational data are &aught with uncertainty, and the analysis is based on a statistical model of the conjectured underlying processes, The large data volumes collected by modern instruments make computer support indispensible for this. Consequently, scientists spend significant amounts of their time with the development and refinement of the data analysis programs. AutoBayes [GF+02, FS03] is a fully automatic synthesis system for generating statistical data analysis programs. Externally, it looks like a compiler: it takes an abstract problem specification and translates it into executable code. Its input is a concise description of a data analysis problem in the form of a statistical model as shown in Figure 1; its output is optimized and fully documented C/C++ code which can be linked dynamically into the Matlab and Octave environments. Internally, however, it is quite different: AutoBayes derives a customized algorithm implementing the given model using a schema-based process, and then further refines and optimizes the algorithm into code. A schema is a parameterized code template with associated semantic constraints which define and restrict the template s applicability. The schema parameters are instantiated in a problem-specific way during synthesis as AutoBayes checks the constraints against the original model or, recursively, against emerging sub-problems. AutoBayes schema library contains problem decomposition operators (which are justified by theorems in a formal logic in the domain of Bayesian networks) as well as machine learning algorithms (e.g., EM, k-Means) and nu- meric optimization methods (e.g., Nelder-Mead simplex, conjugate gradient). AutoBayes augments this schema-based approach by symbolic computation to derive closed-form solutions whenever possible. This is a major advantage over other statistical data analysis systems which use numerical approximations even in cases where closed-form solutions exist. AutoBayes is implemented in Prolog and comprises approximately 75.000 lines of code. In this paper, we take one typical scientific data analysis problem-analyzing planetary nebulae images taken by the Hubble Space Telescope-and show how AutoBayes can be used to automate the implementation of the necessary anal- ysis programs. We initially follow the analysis described by Knuth and Hajian [KHO2] and use AutoBayes to derive code for the published models. We show the details of the code derivation process, including the symbolic computations and automatic integration of library procedures, and compare the results of the automatically generated and manually implemented code. We then go beyond the original analysis and use AutoBayes to derive code for a simple image segmentation procedure based on a mixture model which can be used to automate a manual preproceesing step. Finally, we combine the original approach with the simple segmentation which yields a more detailed analysis. This also demonstrates that AutoBayes makes it easy to combine different aspects of data analysis.

Fischer, Bernd↗

NASA NTRS1992

Purposive discovery of operations

The Generate, Prune & Prove (GPP) methodology for discovering definitions of mathematical operators is introduced. GPP is a task within the IL exploration discovery system. We developed GPP for use in the discovery of mathematical operators with a wider class of representations than was possible with the previous methods by Lenat and by Shen. GPP utilizes the purpose for which an operator is created to prune the possible definitions. The relevant search spaces are immense and there exists insufficient information for a complete evaluation of the purpose constraint, so it is necessary to perform a partial evaluation of the purpose (i.e., pruning) constraint. The constraint is first transformed so that it is operational with respect to the partial information, and then it is applied to examples in order to test the generated candidates for an operator's definition. In the GPP process, once a candidate definition survives this empirical prune, it is passed on to a theorem prover for formal verification. We describe the application of this methodology to the (re)discovery of the definition of multiplication for Conway numbers, a discovery which is difficult for human mathematicians. We successfully model this discovery process utilizing information which was reasonably available at the time of Conway's original discovery. As part of this discovery process, we reduce the size of the search space from a computationally intractable size to 3468 elements.

Sims, Michael H.↗

NASA NTRS2011

Entropy Generation Across Earth's Bow Shock

Earth's bow shock is a transition layer that causes an irreversible change in the state of plasma that is stationary in time. Theories predict entropy increases across the bow shock but entropy has never been directly measured. Cluster and Double Star plasma experiments measure 3D plasma distributions upstream and downstream of the bow shock that allow calculation of Boltzmann's entropy function H and his famous H-theorem, dH/dt ~ O. We present the first direct measurements of entropy density changes across Earth's bow shock. We will show that this entropy generation may be part of the processes that produce the non-thermal plasma distributions is consistent with a kinetic entropy flux model derived from the collisionless Boltzmann equation, giving strong support that solar wind's total entropy across the bow shock remains unchanged. As far as we know, our results are not explained by any existing shock models and should be of interests to theorists.

Parks, George K.↗

NASA NTRS1982

Construction of solutions for some nonlinear two-point boundary value problems

Constructive existence and uniqueness results for boundary value problems associated with some simple special cases of the second order equation y'' = f(x,y,y') 0 or = x or = 1, are sought. The approach considered is to convert the differential equation and boundary conditions to an integral equation via Green's functions, and then to apply fixed point and contraction map principles to a sequence of successive approximations. The approach is tested on several applied problems. Difficulties in trying to prove general theorems are discussed.

Pennline, J. A.↗

NASA NTRS1999

Reconnection in Three Dimensions

Analyzing the qualitative three-dimensional magnetic structure of a plasmoid, we were led to reconsider the concept of magnetic reconnection from a general point of view. The properties of relatively simple magnetic field models provide a strong preference for one of two definitions of magnetic reconnection that exist in the literature. Any concept of magnetic reconnection defined in terms of magnetic topology seems naturally restricted to cases where the magnetic field vanishes somewhere in the nonideal (diffusion) region. The main part of this paper is concerned with magnetic reconnection in nonvanishing magnetic fields (finite-B reconnection), which has attracted less attention in the past. We show that the electric field component parallel to the magnetic field plays a crucial physical role in finite-B reconnection, and we present two theorems involving the former. The first states a necessary and sufficient condition on the parallel electric field for global reconnection to occur. Here the term "global" means the generic case where the breakdown of magnetic connection occurs for plasma elements that stay outside the nonideal region. The second theorem relates the change of magnetic helicity to the parallel electric field for cases where the electric field vanishes at large distances. That these results provide new insight into three-dimensional reconnection processes is illustrated in terms of the plasmoid configuration, which was our starting point.

Hesse, Michael↗

NASA NTRS1984

Kinematics of the CS method for the treatment of molecular collisions

The problem of the quantum treatment of nonreactive collisions of two simple molecules or of an atom and a molecule is considered mathematically. Kinematical structure theorems analogous to the Wigner-Eckart theorem for scalar operators are derived for the transition operator (T-operator) of a two-molecule system, where, in addition to the usual conservation laws, certain additional conservation laws are presumed satisfied in a collision. The additional conservation laws were examined in order to develop a testable approximation scheme (CS method) for the specification of the kinematics of a system of two rigid diatomic molecules. The rand p-helicity basis states for a two-rigid rotor system are defined and unitary transformations established between these and conventional bases. It is found that only questionable criteria exist for testing the on-the-energy-shell matrix of a T(energy) operator for the presence of properties of two of the additional conservation laws.

Hahne, G. E.↗

NASA NTRS2003

Significance of Strain in Formulation in Theory of Solid Mechanics

The basic theory of solid mechanics was deemed complete circa 1860 when St. Venant provided the strain formulation or the field compatibility condition. The strain formulation was incomplete. The missing portion has been formulated and identified as the boundary compatibility condition (BCC). The BCC, derived through a variational formulation, has been verified through integral theorem and solution of problems. The BCC, unlike the field counterpart, do not trivialize when expressed in displacements. Navier s method and the stiffness formulation have to account for the extra conditions especially at the inter-element boundaries in a finite element model. Completion of the strain formulation has led to the revival of the direct force calculation methods: the Integrated Force Method (IFM) and its dual (IFMD) for finite element analysis, and the completed Beltrami-Michell formulation (CBMF) in elasticity. The benefits from the new methods in elasticity, in finite element analysis, and in design optimization are discussed. Existing solutions and computer codes may have to be adjusted for the compliance of the new conditions. Complacency because the discipline is over a century old and computer codes have been developed for half a century can lead to stagnation of the discipline.

Patnaik, Surya N.↗

NASA NTRS1979

Theory of global thermoremanent magnetization of planetary lithospheres in dipole fields of internal origin

A model is presented for the global thermoremanent magnetization of spherical lithospheres which cool in the presence of central dipole fields. Reversals and intensity variations of the field are incorporated in this model, which is applicable to bodies whose interiors have remained above the Curie point throughout their evolution. The model demonstrates that even considering Runcorn's (1975) magnetostatics theorems for spherical shells, a nonzero magnetic permeability and a finite cooling rate in the lithosphere permit the acquisition of a sizable global remanent dipole moment, which would be detectable by external measurements after the magnetizing field has disappeared. Preliminary application of this model to Mercury, Venus, and Mars suggests that only the combination of a nonreversing ancient source field with a surface value near 1 Oe plus a sizable concentration (about 1% by volume) of ferromagnetic material in their crusts could produce remanent planetary dipole fields as large as those measured by spacecraft. On the other hand, if ancient reversing dynamos existed in these planets, it is unlikely that large planetary-scale fields like those observed at Mercury could be due to remanence in their crusts, irrespective of their composition.

Srnka, L. J.↗

NASA NTRS1997

An Arbitrary First Order Theory Can Be Represented by a Program: A Theorem

How can we represent knowledge inside a computer? For formalized knowledge, classical logic seems to be the most adequate tool. Classical logic is behind all formalisms of classical mathematics, and behind many formalisms used in Artificial Intelligence. There is only one serious problem with classical logic: due to the famous Godel's theorem, classical logic is algorithmically undecidable; as a result, when the knowledge is represented in the form of logical statements, it is very difficult to check whether, based on this statement, a given query is true or not. To make knowledge representations more algorithmic, a special field of logic programming was invented. An important portion of logic programming is algorithmically decidable. To cover knowledge that cannot be represented in this portion, several extensions of the decidable fragments have been proposed. In the spirit of logic programming, these extensions are usually introduced in such a way that even if a general algorithm is not available, good heuristic methods exist. It is important to check whether the already proposed extensions are sufficient, or further extensions is necessary. In the present paper, we show that one particular extension, namely, logic programming with classical negation, introduced by M. Gelfond and V. Lifschitz, can represent (in some reasonable sense) an arbitrary first order logical theory.

Hosheleva, Olga↗