Search NASA⌕ Search

SEARCH · Search NASA

Results for “Set theory”

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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
NASA NTRS1992

Towards an Effective Theory of Reformulation: Semantics - Part 1

This paper describes an investigation into the structure of representations of sets of actions, utilizing semigroup theory. The goals of this project are twofold: to shed light on the relationship between tasks and representations, leading to a classification of tasks according to the representations they admit; and to develop techniques for automatically transforming representations so as to improve problem-solving performance. A method is demonstrated for automatically generating serial algorithms for representations whose actions form a finite group. This method is then extended to representations whose actions form a finite inverse semigroup.

Benjamin, D. Paul↗
NASA NTRS1971

On a programming language for graph algorithms

An algorithmic language, GRAAL, is presented for describing and implementing graph algorithms of the type primarily arising in applications. The language is based on a set algebraic model of graph theory which defines the graph structure in terms of morphisms between certain set algebraic structures over the node set and arc set. GRAAL is modular in the sense that the user specifies which of these mappings are available with any graph. This allows flexibility in the selection of the storage representation for different graph structures. In line with its set theoretic foundation, the language introduces sets as a basic data type and provides for the efficient execution of all set and graph operators. At present, GRAAL is defined as an extension of ALGOL 60 (revised) and its formal description is given as a supplement to the syntactic and semantic definition of ALGOL. Several typical graph algorithms are written in GRAAL to illustrate various features of the language and to show its applicability.

Rheinboldt, W. C.↗
NASA NTRS1985

Reassessment of the theory of stimulated Raman scattering

A modification of the standard theory of stimulated Raman scattering (SRS) first proposed by Sparks (1974, 1975) is analyzed and shown to incorporate a possibly important physical effect; however, its original formulation is incorrect. The analysis is based on an exact numerical integration of the coupled equations of the modified theory, the results of which are compared with both the conventional theory of SRS and with one set of experimental data. A reformulation of the modified theory is suggested that leads to a gain which is in somewhat better agreement with the data than is the conventional theory.

Fralick, G. C.↗
NASA NTRS1986

Probabilistic versus fuzzy reasoning

This paper shows how to solve problems using probability theory that the fuzzy approaches claim probability cannot solve. By using the view that probabilities are a measure of belief in a proposition in a particular context, limitations imposed by the frequncy interpretations of probability are avoided. The various fuzzy approaches (fuzzy sets, fuzzy logic, possibility theory and higher order generalizations) seem to fill the gap caused by the restricted frequency interpretation. Close examination shows that the fuzzy approaches have exactly the same representation as the corresponding probabilistc approach and include similar calculi. The probabilistic approach assumes less information when the calculi differ.

Cheeseman, Peter↗
NASA NTRS1991

Excursion set mass functions for hierarchical Gaussian fluctuations

It is pointed out that most schemes for determining the mass function of virialized objects from the statistics of the initial density perturbation field suffer from the cloud-in-cloud problem of miscounting the number of low-mass clumps, many of which would have been subsumed into larger objects. The paper proposes a solution based on the theory of the excursion sets of F(r, R sub f), the four-dimensional initial density perturbation field smoothed with a continuous hierarchy of filters of radii R sub f.

Bond, J. R.↗
NASA NTRS1982

Equivalent damage: A critical assessment

Concepts in equivalent damage were evaluated to determine their applicability to the life prediction of hot path components of aircraft gas turbine engines. Equivalent damage was defined as being those effects which influence the crack initiation life-time beyond the damage that is measured in uniaxial, fully-reversed sinusoidal and isothermal experiments at low homologous temperatures. Three areas of equivalent damage were examined: mean stress, cumulative damage, and multiaxiality. For each area, a literature survey was conducted to aid in selecting the most appropriate theories. Where possible, data correlations were also used in the evaluation process. A set of criteria was developed for ranking the theories in each equivalent damage regime. These criteria considered aspects of engine utilization as well as the theoretical basis and correlative ability of each theory. In addition, consideration was given to the complex nature of the loading cycle at fatigue critical locations of hot path components; this loading includes non-proportional multiaxial stressing, combined temperature and strain fluctuations, and general creep-fatigue interactions. Through applications of selected equivalent damage theories to some suitable data sets it was found that there is insufficient data to allow specific recommendations of preferred theories for general applications. A series of experiments and areas of further investigations were identified.

Laflen, J. R.↗
NASA NTRS2010

Efficient Web Services Policy Combination

Large-scale Web security systems usually involve cooperation between domains with non-identical policies. The network management and Web communication software used by the different organizations presents a stumbling block. Many of the tools used by the various divisions do not have the ability to communicate network management data with each other. At best, this means that manual human intervention into the communication protocols used at various network routers and endpoints is required. Developing practical, sound, and automated ways to compose policies to bridge these differences is a long-standing problem. One of the key subtleties is the need to deal with inconsistencies and defaults where one organization proposes a rule on a particular feature, and another has a different rule or expresses no rule. A general approach is to assign priorities to rules and observe the rules with the highest priorities when there are conflicts. The present methods have inherent inefficiency, which heavily restrict their practical applications. A new, efficient algorithm combines policies utilized for Web services. The method is based on an algorithm that allows an automatic and scalable composition of security policies between multiple organizations. It is based on defeasible policy composition, a promising approach for finding conflicts and resolving priorities between rules. In the general case, policy negotiation is an intractable problem. A promising method, suggested in the literature, is when policies are represented in defeasible logic, and composition is based on rules for non-monotonic inference. In this system, policy writers construct metapolicies describing both the policy that they wish to enforce and annotations describing their composition preferences. These annotations can indicate whether certain policy assertions are required by the policy writer or, if not, under what circumstances the policy writer is willing to compromise and allow other assertions to take precedence. Meta-policies are specified in defeasible logic, a computationally efficient non-monotonic logic developed to model human reasoning. One drawback of this method is that at one point the algorithm starts an exhaustive search of all subsets of the set of conclusions of a defeasible theory. Although the propositional defeasible logic has linear complexity, the set of conclusions here may be large, especially in real-life practical cases. This phenomenon leads to an inefficient exponential explosion of complexity. The current process of getting a Web security policy from combination of two meta-policies consists of two steps. The first is generating a new meta-policy that is a composition of the input meta-policies, and the second is mapping the meta-policy onto a security policy. The new algorithm avoids the exhaustive search in the current algorithm, and provides a security policy that matches all requirements of the involved metapolicies.

Vatan, Farrokh↗
NASA NTRS1985

A theory of post-stall transients in multistage axial compression systems

A theory is presented for post stall transients in multistage axial compressors. The theory leads to a set of coupled first-order ordinary differential equations capable of describing the growth and possible decay of a rotating-stall cell during a compressor mass-flow transient. These changing flow features are shown to have a significant effect on the instantaneous compressor pumping characteristic during unsteady operation, and henace on the overall system behavior. It is also found from the theory that the ultimate mode of system response, stable rotating stall or surge, depends not only on the B parameter but also on other parameters, such as the compressor length-to-diameter ratio. Small values of this latter quantity tend to favor the occurrence of surge, as do large values of B. A limited parametric study is carried out to show the impact of the different system features on transient behavior. Based on analytical and numerical results, several specific topics are suggested for future research on post-stall transients.

Moore, F. K.↗
NASA NTRS1984

Basis set limit geometries for ammonia at the SCF and MP2 levels of theory

The controversy over the Hartree-Fock bond angle of NH3 is resolved and the convergence of the geometry for the molecule as the basis set is systematically improved with both SCF and correlated MP2 wave functions. The results of the geometrical optimizations, carried out in four stages with a series of uncontracted bases sets, are shown. The obtained structure for NH3 supports the results of Radom and Rodwell (1980) that the Hartree-Fock limit angle is significantly greater than was previously believed.

Defrees, D. J.↗
NASA NTRS1989

A Boltzmann machine for the organization of intelligent machines

In the present technological society, there is a major need to build machines that would execute intelligent tasks operating in uncertain environments with minimum interaction with a human operator. Although some designers have built smart robots, utilizing heuristic ideas, there is no systematic approach to design such machines in an engineering manner. Recently, cross-disciplinary research from the fields of computers, systems AI and information theory has served to set the foundations of the emerging area of the design of intelligent machines. Since 1977 Saridis has been developing an approach, defined as Hierarchical Intelligent Control, designed to organize, coordinate and execute anthropomorphic tasks by a machine with minimum interaction with a human operator. This approach utilizes analytical (probabilistic) models to describe and control the various functions of the intelligent machine structured by the intuitively defined principle of Increasing Precision with Decreasing Intelligence (IPDI) (Saridis 1979). This principle, even though resembles the managerial structure of organizational systems (Levis 1988), has been derived on an analytic basis by Saridis (1988). The purpose is to derive analytically a Boltzmann machine suitable for optimal connection of nodes in a neural net (Fahlman, Hinton, Sejnowski, 1985). Then this machine will serve to search for the optimal design of the organization level of an intelligent machine. In order to accomplish this, some mathematical theory of the intelligent machines will be first outlined. Then some definitions of the variables associated with the principle, like machine intelligence, machine knowledge, and precision will be made (Saridis, Valavanis 1988). Then a procedure to establish the Boltzmann machine on an analytic basis will be presented and illustrated by an example in designing the organization level of an Intelligent Machine. A new search technique, the Modified Genetic Algorithm, is presented and proved to converge to the minimum of a cost function. Finally, simulations will show the effectiveness of a variety of search techniques for the intelligent machine.

Moed, Michael C.↗
NASA NTRS2006

Extended Aging Theories for Predictions of Safe Operational Life of Critical Airborne Structural Components

The previously developed Ko closed-form aging theory has been reformulated into a more compact mathematical form for easier application. A new equivalent loading theory and empirical loading theories have also been developed and incorporated into the revised Ko aging theory for the prediction of a safe operational life of airborne failure-critical structural components. The new set of aging and loading theories were applied to predict the safe number of flights for the B-52B aircraft to carry a launch vehicle, the structural life of critical components consumed by load excursion to proof load value, and the ground-sitting life of B-52B pylon failure-critical structural components. A special life prediction method was developed for the preflight predictions of operational life of failure-critical structural components of the B-52H pylon system, for which no flight data are available.

Ko, William L.↗
NASA NTRS1983

The constancy of G and other gravitational experiments

Recent solar system experimental tests of the general relativity theory are reviewed. The solar system data set available at the Harvard-Smithsonian Center for Astrophysics is first reviewed. Investigations of the secular variation of G in the solar system are discussed; recent analyses using Viking data yield G-dot/G of less than 3 x 10 to the -11th/yr. The present data set will make it possible to distinguish between competitive theories. Shapiro's time-delay effect has provided the most stringent solar system test of general relativity. The effect has been measured to be consistent with the predictions of the theory to within an uncertainty of 0.1 percent. Tests which can be performed in the near future, including the measurement of relativistic effects due to the square of the solar potential and the detection of the Lense-Thirring effect, are discussed.

Reasenberg, R. D.↗
NASA NTRS1975

Estimation and Analysis of Nonlinear Stochastic Systems

The algebraic and geometric structures of certain classes of nonlinear stochastic systems were exploited in order to obtain useful stability and estimation results. The class of bilinear stochastic systems (or linear systems with multiplicative noise) was discussed. The stochastic stability of bilinear systems driven by colored noise was considered. Approximate methods for obtaining sufficient conditions for the stochastic stability of bilinear systems evolving on general Lie groups were discussed. Two classes of estimation problems involving bilinear systems were considered. It was proved that, for systems described by certain types of Volterra series expansions or by certain bilinear equations evolving on nilpotent or solvable Lie groups, the optimal conditional mean estimator consists of a finite dimensional nonlinear set of equations. The theory of harmonic analysis was used to derive suboptimal estimators for bilinear systems driven by white noise which evolve on compact Lie groups or homogeneous spaces.

Marcus, S. I.↗
NASA NTRS1976

High-speed solar wind flow parameters at 1 AU

Nineteen high-speed solar-wind streams observed at 1 AU between March 1971 and July 1974 are studied to develop a more realistic set of constraints for theories on such streams. The streams were chosen because their speeds exceeded 650 km/s for at least several consecutive three-hour periods and because their properties met certain other criteria. A comparison of average stream parameters with predictions of existing steady-state models shows that no single model is adequate to explain the observations. In particular, it is found that no existing model consistent with reasonable coronal conditions predicts the particle fluxes, the convected proton bulk-flow-energy fluxes, and the convected proton enthalpy fluxes observed at 1 AU when the flow speed exceeds 650 km/s.

Feldman, W. C.↗
NASA NTRS1979

Orbital theories of outer planet satellites

An analytical theory of Mimas and Tethys was developed, retaining terms which produce perturbations of the order of + or - 10 km. The theory uses a novel set of variables, and was developed with the Hori-Lie algorithm, using the algebraic manipulation language TRIGMAN. the perturbations were implemented by means of FORTRAN subroutines produced by the computer.

Jefferys, W. H.↗
NASA NTRS1980

Steady state solutions to dynamically loaded periodic structures

The general problem of solving for the steady state (time domain) dynamic response (i.e., NASTRAN rigid format-8) of a general elastic periodic structure subject to a phase difference loading of the type encountered in traveling wave propagation problems was studied. Two types of structural configurations were considered; in the first type, the structure has a repeating pattern over a span that is long enough to be considered, for all practical purposes, as infinite; in the second type, the structure has structural rotational symmetry in the circumferential direction. The theory and a corresponding set of DMAP instructions which permits the NASTRAN user to automatically alter the rigid format-8 sequence to solve the intended class of problems are presented. Final results are recovered as with any ordinary rigid format-8 solution, except that the results are only printed for the typical periodic segment of the structure. A simple demonstration problem having a known exact solution is used to illustrate the implementation of the procedure.

Kalinowski, A. J.↗