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.

SourceResearch connectionFrom yearThrough year

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

At least 217 records · Page 12

All sources NASA NTRS DOE OSTI

NASA NTRS2011

Simulation and Verification of Synchronous Set Relations in Rewriting Logic

This paper presents a mathematical foundation and a rewriting logic infrastructure for the execution and property veri cation of synchronous set relations. The mathematical foundation is given in the language of abstract set relations. The infrastructure consists of an ordersorted rewrite theory in Maude, a rewriting logic system, that enables the synchronous execution of a set relation provided by the user. By using the infrastructure, existing algorithm veri cation techniques already available in Maude for traditional asynchronous rewriting, such as reachability analysis and model checking, are automatically available to synchronous set rewriting. The use of the infrastructure is illustrated with an executable operational semantics of a simple synchronous language and the veri cation of temporal properties of a synchronous system.

Rocha, Camilo↗

NASA NTRS2003

Intelligent Machines in the 21st Century: Automating the Processes of Inference and Inquiry

The last century saw the application of Boolean algebra toward the construction of computing machines, which work by applying logical transformations to information contained in their memory. The development of information theory and the generalization of Boolean algebra to Bayesian inference have enabled these computing machines. in the last quarter of the twentieth century, to be endowed with the ability to learn by making inferences from data. This revolution is just beginning as new computational techniques continue to make difficult problems more accessible. However, modern intelligent machines work by inferring knowledge using only their pre-programmed prior knowledge and the data provided. They lack the ability to ask questions, or request data that would aid their inferences. Recent advances in understanding the foundations of probability theory have revealed implications for areas other than logic. Of relevance to intelligent machines, we identified the algebra of questions as the free distributive algebra, which now allows us to work with questions in a way analogous to that which Boolean algebra enables us to work with logical statements. In this paper we describe this logic of inference and inquiry using the mathematics of partially ordered sets and the scaffolding of lattice theory, discuss the far-reaching implications of the methodology, and demonstrate its application with current examples in machine learning. Automation of both inference and inquiry promises to allow robots to perform science in the far reaches of our solar system and in other star systems by enabling them to not only make inferences from data, but also decide which question to ask, experiment to perform, or measurement to take given what they have learned and what they are designed to understand.

Knuth, Kevin H.↗

NASA NTRS1994

Finding accurate frontiers: A knowledge-intensive approach to relational learning

An approach to analytic learning is described that searches for accurate entailments of a Horn Clause domain theory. A hill-climbing search, guided by an information based evaluation function, is performed by applying a set of operators that derive frontiers from domain theories. The analytic learning system is one component of a multi-strategy relational learning system. We compare the accuracy of concepts learned with this analytic strategy to concepts learned with an analytic strategy that operationalizes the domain theory.

Pazzani, Michael↗

NASA NTRS1988

Toward a computational theory for motion understanding: The expert animators model

Artificial intelligence researchers claim to understand some aspect of human intelligence when their model is able to emulate it. In the context of computer graphics, the ability to go from motion representation to convincing animation should accordingly be treated not simply as a trick for computer graphics programmers but as important epistemological and methodological goal. In this paper we investigate a unifying model for animating a group of articulated bodies such as humans and robots in a three-dimensional environment. The proposed model is considered in the framework of knowledge representation and processing, with special reference to motion knowledge. The model is meant to help setting the basis for a computational theory for motion understanding applied to articulated bodies.

Mohamed, Ahmed S.↗

NASA NTRS2002

Comparing a Coevolutionary Genetic Algorithm for Multiobjective Optimization

We present results from a study comparing a recently developed coevolutionary genetic algorithm (CGA) against a set of evolutionary algorithms using a suite of multiobjective optimization benchmarks. The CGA embodies competitive coevolution and employs a simple, straightforward target population representation and fitness calculation based on developmental theory of learning. Because of these properties, setting up the additional population is trivial making implementation no more difficult than using a standard GA. Empirical results using a suite of two-objective test functions indicate that this CGA performs well at finding solutions on convex, nonconvex, discrete, and deceptive Pareto-optimal fronts, while giving respectable results on a nonuniform optimization. On a multimodal Pareto front, the CGA finds a solution that dominates solutions produced by eight other algorithms, yet the CGA has poor coverage across the Pareto front.

Lohn, Jason D.↗

NASA NTRS1980

The primer vector in linear, relative-motion equations

Primer vector theory is used in analyzing a set of linear, relative-motion equations - the Clohessy-Wiltshire equations - to determine the criteria and necessary conditions for an optimal, N-impulse trajectory. Since the state vector for these equations is defined in terms of a linear system of ordinary differential equations, all fundamental relations defining the solution of the state and costate equations, and the necessary conditions for optimality, can be expressed in terms of elementary functions. The analysis develops the analytical criteria for improving a solution by (1) moving any dependent or independent variable in the initial and/or final orbit, and (2) adding intermediate impulses. If these criteria are violated, the theory establishes a sufficient number of analytical equations. The subsequent satisfaction of these equations will result in the optimal position vectors and times of an N-impulse trajectory. The solution is examined for the specific boundary conditions of (1) fixed-end conditions, two-impulse, and time-open transfer; (2) an orbit-to-orbit transfer; and (3) a generalized rendezvous problem. A sequence of rendezvous problems is solved to illustrate the analysis and the computational procedure.

Source record↗

NASA NTRS2003

Intelligent machines in the twenty-first century: foundations of inference and inquiry

The last century saw the application of Boolean algebra to the construction of computing machines, which work by applying logical transformations to information contained in their memory. The development of information theory and the generalization of Boolean algebra to Bayesian inference have enabled these computing machines, in the last quarter of the twentieth century, to be endowed with the ability to learn by making inferences from data. This revolution is just beginning as new computational techniques continue to make difficult problems more accessible. Recent advances in our understanding of the foundations of probability theory have revealed implications for areas other than logic. Of relevance to intelligent machines, we recently identified the algebra of questions as the free distributive algebra, which will now allow us to work with questions in a way analogous to that which Boolean algebra enables us to work with logical statements. In this paper, we examine the foundations of inference and inquiry. We begin with a history of inferential reasoning, highlighting key concepts that have led to the automation of inference in modern machine-learning systems. We then discuss the foundations of inference in more detail using a modern viewpoint that relies on the mathematics of partially ordered sets and the scaffolding of lattice theory. This new viewpoint allows us to develop the logic of inquiry and introduce a measure describing the relevance of a proposed question to an unresolved issue. Last, we will demonstrate the automation of inference, and discuss how this new logic of inquiry will enable intelligent machines to ask questions. Automation of both inference and inquiry promises to allow robots to perform science in the far reaches of our solar system and in other star systems by enabling them not only to make inferences from data, but also to decide which question to ask, which experiment to perform, or which measurement to take given what they have learned and what they are designed to understand.

Review↗

NASA NTRS2005

Distributed Adaptive Control: Beyond Single-Instant, Discrete Variables

In extensive form noncooperative game theory, at each instant t, each agent i sets its state x, independently of the other agents, by sampling an associated distribution, q(sub i)(x(sub i)). The coupling between the agents arises in the joint evolution of those distributions. Distributed control problems can be cast the same way. In those problems the system designer sets aspects of the joint evolution of the distributions to try to optimize the goal for the overall system. Now information theory tells us what the separate q(sub i) of the agents are most likely to be if the system were to have a particular expected value of the objective function G(x(sub 1),x(sub 2), ...). So one can view the job of the system designer as speeding an iterative process. Each step of that process starts with a specified value of E(G), and the convergence of the q(sub i) to the most likely set of distributions consistent with that value. After this the target value for E(sub q)(G) is lowered, and then the process repeats. Previous work has elaborated many schemes for implementing this process when the underlying variables x(sub i) all have a finite number of possible values and G does not extend to multiple instants in time. That work also is based on a fixed mapping from agents to control devices, so that the the statistical independence of the agents' moves means independence of the device states. This paper also extends that work to relax all of these restrictions. This extends the applicability of that work to include continuous spaces and Reinforcement Learning. This paper also elaborates how some of that earlier work can be viewed as a first-principles justification of evolution-based search algorithms.

Wolpert, David H.↗

NASA NTRS1981

PAN AIR: A computer program for predicting subsonic or supersonic linear potential flows about arbitrary configurations using a higher order panel method. Volume 1: Theory document (version 1.1)

Panel aerodynamics (PAN AIR) is a system of computer programs designed to analyze subsonic and supersonic inviscid flows about arbitrary configurations. A panel method is a program which solves a linear partial differential equation by approximating the configuration surface by a set of panels. An overview of the theory of potential flow in general and PAN AIR in particular is given along with detailed mathematical formulations. Fluid dynamics, the Navier-Stokes equation, and the theory of panel methods were also discussed.

Magnus, A. E.↗

NASA NTRS1982

Quantitative tests of a steady state theory of solar wind electrons

A comparison is made of IMP 6, 7 and 8 electron data with the predictions of a solar wind electron steady state theory in which the control of transport by the macroscopic interplanetary electric and magnetic fields, as well as elastic Coulomb collisions with solar wind protons and thermal electrons, is assumed. While a ratio of forward to backward phase density for field-aligned extrathermal electrons of 6:1 is predicted, electron distribution measurements within the high speed solar wind show this ratio to be typically about an order of magnitude larger. A set of solar wind bulk speed anticorrelations predicted by the theory on the basis of a larger set of assumptions cannot be found in the IMP electron data set, so that improved agreement may require such modifications of the theory's assumptions as the inclusion of inelastic Coulomb and/or wave electron collisions.

Feldman, W. C.↗

NASA NTRS1991

Laser transit anemometer and Pitot probe comparative measurements in a sharp cone boundary layer at Mach 4

Laser transit anemometer (LTA) measurements of a 7 degree sharp cone boundary layer were conducted in the Air Force/AEDC Supersonic Tunnel A Mach 4 flow field. These measurements are compared with Pitot probe measurements and tricone theory provided by AEDC staff. Measurements were made both in laminar and turbulent boundary layers of the model. Comparison of LTA measurements with theory showed agreement to better than 1 percent for the laminar boundary layer cases. This level of agreement was obtained after small position corrections, 0.01 to 0.6 mm, were applied to the experimental data sets. Pitot probe data when compared with theory also showed small positioning errors. The Pitot data value was also limited due to probe interference with the flow near the model. The LTA turbulent boundary layer data indicated a power law dependence of 6.3 to 6.9. The LTA data was analyzed in the time (Tau) domain in which it was obtained and in the velocity domain. No significant differences were noted between Tau and velocity domain results except in one turbulent boundary layer case.

Hunter, W. W., Jr.↗

NASA NTRS1971

Longitudinal impact of cylindrical shells.

The transient response due to longitudinal impact of three aluminum cylindrical shells of different thickness-to-radius ratios is studied both analytically and experimentally. The analyses were obtained from method of characteristics' solutions of two sets of equations: one which includes the transverse shear, radial inertia, and rotary inertial effects; and the other set is from a modified membrane theory. Experimentally, longitudinal and circumferential strains are monitored along the length of each of the shells; the velocity of the impacter ring is also measured. The experimental results of this study indicate that the wave front, after traveling three diameters from the impacted end, propagates at essentially the plate velocity, in agreement with the theory. In addition, the longitudinal and circumferential strain calculated from the two theories are in good agreement with the experimental results.

Mortimer, R. W.↗

NASA NTRS1974

A general solution for the registration of optical multispectral scanners

The paper documents a general theory for registration (mapping) of data sets gathered by optical scanners such as the ERTS satellite MSS and the Skylab S-192 MSS. This solution is generally applicable to scanners which have rotating optics. Navigation data and ground control points are used in a statistically weighted adjustment based on a mathematical model of the dynamics of the spacecraft and the scanner system. This adjustment is very similar to the well known photogrammetric adjustments used in aerial mapping. Actual tests have been completed on NASA aircraft 24 channel MSS data, and the results are very encouraging.

Rader, M. L.↗

NASA NTRS1981

Baseline mathematics and geodetics for tracking operations

Various geodetic and mapping algorithms are analyzed as they apply to radar tracking systems and tested in extended BASIC computer language for real time computer applications. Closed-form approaches to the solution of converting Earth centered coordinates to latitude, longitude, and altitude are compared with classical approximations. A simplified approach to atmospheric refractivity called gradient refraction is compared with conventional ray tracing processes. An extremely detailed set of documentation which provides the theory, derivations, and application of algorithms used in the programs is included. Validation methods are also presented for testing the accuracy of the algorithms.

James, R.↗

NASA NTRS1983

Application of an adaptive blade control algorithm to a gust alleviation system

The feasibility of an adaptive control system designed to alleviate helicopter gust induced vibration was analytically investigated for an articulated rotor system. This control system is based on discrete optimal control theory, and is composed of a set of measurements (oscillatory hub forces and moments), an identification system using a Kalman filter, a control system based on the minimization of the quadratic performance function, and a simulation system of the helicopter rotor. The gust models are step and sinusoidal vertical gusts. Control inputs are selected at the gust frequency, subharmonic frequency, and superharmonic frequency, and are superimposed on the basic collective and cyclic control inputs. The response to be reduced is selected to be that at the gust frequency because this is the dominant response compared with sub- and superharmonics. Numerical calculations show that the adaptive blade pitch control algorithm satisfactorily alleviates the hub gust response. Almost 100% reduction of the perturbation thrust response to a step gust and more than 50% reduction to a sinusoidal gust are achieved in the numerical simulations.

Saito, S.↗

NASA NTRS1984

Application of an adaptive blade control algorithm to a gust alleviation system

The feasibility of an adaptive control system designed to alleviate helicopter gust induced vibration was analytically investigated for an articulated rotor system. This control system is based on discrete optimal control theory, and is composed of a set of measurements (oscillatory hub forces and moments), an identification system using a Kalman filter, a control system based on the minimization of the quadratic performance function, and a simulation system of the helicopter rotor. The gust models are step and sinusoidal vertical gusts. Control inputs are selected at the gust frequency, subharmonic frequency, and superharmonic frequency, and are superimposed on the basic collective and cyclic control inputs. The response to be reduced is selected to be that at the gust frequency because this is the dominant response compared with sub- and superharmonics. Numerical calculations show that the adaptive blade pitch control algorithm satisfactorily alleviates the hub gust response. Almost 100 percent reduction of the perturbation thrust response to a step gust and more than 50 percent reduction to a sinusoidal gust are achieved in the numerical simulations.

Saito, S.↗

NASA NTRS1986

Electromagnetic scattering from a class of open-ended waveguide discontinuities

A relatively simple high frequency analysis of electromagnetic scattering from a class of open-ended waveguide discontinuites was developed. The waveguides are composed of perfectly-conducting sections in which the electromagnetic field can be written as the sum of waveguide modes. Junctions are formed at the open end and also within interior regions where different sections are joined. The reflection and transmission properties of each junction are described in terms of a scattering matrix which is determined by combining the modal ray picture with high frequency techniques such as the Geometrical Theory of Diffraction (GTD), the Equivalent Current Method (ECM), and modifications of the Physical Theory of Diffraction (PTD). A new set of equivalent circuits are employed in this ECM analysis which leads to a simple treatment of many types of junction discontinuities. Also, a new procedure is presented to improve the efficiency of the aperture integration at the open end which is required in the PTD procedure for finding the fields radiated from (or coupled to) the open end. Once the scattering matrices are determined, they are then combined using a self-consistent multiple scattering method to obtain the total scattered fields.

Altintas, A.↗

NASA NTRS1988

A unified framework for approximation in inverse problems for distributed parameter systems

A theoretical framework is presented that can be used to treat approximation techniques for very general classes of parameter estimation problems involving distributed systems that are either first or second order in time. Using the approach developed, one can obtain both convergence and stability (continuous dependence of parameter estimates with respect to the observations) under very weak regularity and compactness assumptions on the set of admissible parameters. This unified theory can be used for many problems found in the recent literature and in many cases offers significant improvements to existing results.

Banks, H. T.↗