Search NASA⌕ Search

SEARCH · Search NASA

Results for “Logical inference”

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 37 records · Page 2

Computational Intelligence Based Data Fusion Algorithm for Dynamic sEMG and Skeletal Muscle Force Modelling

In this work, an array of three surface Electrography (sEMG) sensors are used to acquired muscle extension and contraction signals for 18 healthy test subjects. The skeletal muscle force is estimated using the acquired sEMG signals and a Non-linear Wiener Hammerstein model, relating the two signals in a dynamic fashion. The model is obtained from using System Identification (SI) algorithm. The obtained force models for each sensor are fused using a proposed fuzzy logic concept with the intent to improve the force estimation accuracy and resilience to sensor failure or misalignment. For the fuzzy logic inference system, the sEMG entropy, the relative error, and the correlation of the force signals are considered for defining the membership functions. The proposed fusion algorithm yields an average of 92.49% correlation between the actual force and the overall estimated force output. In addition, the proposed fusionbased approach is implemented on a test platform. Experiments indicate an improvement in finger/hand force estimation.

42 ENGINEERING↗

Extension of the Kohn-Sham formulation of density functional theory to finite temperature

Based on Mermin's extension of the Hohenberg and Kohn theorems to non-zero temperature, the Kohn-Sham formulation of density functional theory (KS-DFT) is generalized to finite temperature. Here, we show that present formulations are inconsistent with Mermin's functional containing expressions, in particular describing the Coulomb energy, that defy derivation and are even in violation of rules of logical inference. More; current methodology is in violation of fundamental laws of both quantum and classical mechanics. Based on this feature, we demonstrate the impossibility of extending the KS formalism to finite temperature through the self-consistent solutions of the single-particle Schrödinger equation of T>0. Guided by the form of Mermin's functional that depends on the eigenstates of a Hamiltonian, determined at T>0 we base our extension of KS-DFT on the determination of the excited states of a non-interacting system at the zero of temperature. The resulting formulation is consistent with that of Mermin constructing the free energy at T>0 in terms of the excited states of a non-interacting Hamiltonian (system) that, within the KS formalism, are described by Slater determinants. To determine the excited states at T=0 use is made of the extension of the Hohenberg and Kohn theorems to excited states presented in previous work applied here to a non-interacting collection of replicas of a non-interacting N-particle system, whose ground state density is taken to match that of K non-interacting replicas of an interacting N-particle system at T>0. The formalism allows for an ever denser population of the excitation spectrum of a Hamiltonian, within the KS approximation. The form of the auxiliary potential, (Kohn-Sham potential), is formally identical to that in the ground state formalism with the contribution of the Coulomb energy provided by the derivative of the Coulomb energy in all excited states taken into account. Once the excited states are determined, the minimum of the free energy within the KS formalism follows immediately in the form of Mermin's functional, but with the exact excited states in that functional represented by Slater determinants obtained through self-consistency conditions at the zero of temperature. Lastly, it is emphasized that, in departure from all existing formulations, no self-consistency conditions are implemented at finite T; as we show, in fact, such formulations are rigorously blocked.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Comparison of Fickian and temporally nonlocal transport theories over many scales in an exhaustively sampled sandstone slab

It is not a compelling argument, solely on the basis of a better fit to solute breakthrough curve (BTC) data, that a temporally nonlocal model is necessary to simulate transport in an advection-dominated system. One may counter that the classical advection-dispersion equation (ADE) is a valid model at some small scale and that the detailed hydraulic conductivity (K) data must be well-represented: then the nonlocality is only a result of upscaling and loss of information. But is the nonlocal model demonstrably necessary at all scales? We examine the experiment conducted by Klise et al. (2008) in which a 30.5 by 30.5 cm slab of relatively homogeneous, cross-bedded sandstone was exhaustively sampled for K. The slab was sealed, saturated with potassium iodide, and X-rayed 10 times while being flushed with fresh water. The 8,649 air-permeameter measurements were down- and upscaled to make finer and coarser grids on which the velocity field was solved and the ADE applied. The optimized parameters in the ADE were found to scale predictably, most notably the longitudinal dispersivity (α L ), which grew linearly with upscaling. But at all levels of up- and downscaling, including the original K measurement scale of 0.33 cm, the ADE did not adequately represent the late-time tails. The temporally nonlocal, time- fractional ADE (t-FADE) was applied and the optimized parameters (α L and the immobile capacity beta) did not depend on scale. The better fit provided by the t-FADE in the late BTC tails did not bring about a sacrificed fit elsewhere in the BTC. Furthermore, the optimized ADE and t-FADE solutions do not converge at the smallest scale, directly implying that the temporal nonlocality is a necessary model component. We conclude that the logical inference if the ADE is valid in heterogeneous material, then there is tailing in the BTC'' is not a proof that the reverse is true. We provide a clear counterexample. A corollary is that a mismatch between data and a discretized solution to the ADE does not imply that more data will improve fits or predictive ability.

58 GEOSCIENCES↗

Smart Barrier Design and Evaluation (ReKonTM: An Integrated Detection and Assessment Perimeter System)

Many government and military sites continue to demand high performance security technologies such as those afforded by a traditional perimeter intrusion detection and assessment system (PIDAS), but require additional standoff beyond the existing perimeter. To meet such varied needs, a perimeter security system needs to be configurable to meet the demands unique to each site, adaptable to the latest sensor technology and security requirements, and scalable to provide for installation at short temporary perimeters just as well as large multi-mile perimeters. ReKonTM is an integrated perimeter security system solution, one that couples access delay with detection and assessment. A prototype system was designed and built that integrated fiber optic break sensors, active infrared sensors, fence disturbance sensors, video motion detection, ground sensors, and vehicle/human delay barriers. ReKonTM uses a machine learning fusion technique to determine whether an alarm event has occurred as opposed to the conventional system which simply triggers an alarm event when any one sensor is activated. This novel perimeter solution was designed to be configurable for use at facilities ranging from high-security military sites to commercial power plants, to petro/chemical facilities of various kinds. ReKonTM was evaluated against a conventional system and logical inference fusion system with a fixed dataset that was collected over five months from the perimeter. ReKon outperformed both systems with respect to nuisance alarm rate and had only one less alarm detection than the conventional system out of a total of 133 total true alarm events. The sensors on the ReKonTM perimeter generated approximately 8.86 nuisance alarms per day using the conventional system. Using the machine learning fusion these were greatly reduced to approximately 0.02 alarms per day. ReKonTM may enable the use of high performance perimeter security for reduced cost in environments previously incapable of achieving such performance due to budget or installation constraints.

47 OTHER INSTRUMENTATION↗

What Are Ontologies and When Should They Be Used?

Data without description is at best unusable, and at worst, misused. If we do not understand the assumptions and meaning of our data, we are unable to confidently use it. Data today is largely described within a database’s schema, detailing structure and primitive datatypes as part of a relational model, but if we require assurance some data value can be correctly evaluated alongside others beyond the immediate systems in which they are defined, a more portable, richer semantics is needed. Ontologies define knowledge unambiguously across systems and establish the means to reason upon said knowledge using logical inference. They model neutral domains of information rather than data definitions from software or databases that would only serve to enrich a single system’s idiosyncrasies. In this paper, we take a casual stance to explore what ontologies are, how they are built, why they are useful, and when they should be used.

97 MATHEMATICS AND COMPUTING↗

A knowledge based approach to matching human neurodegenerative disease and animal models

Neurodegenerative diseases present a wide and complex range of biological and clinical features. Animal models are key to translational research, yet typically only exhibit a subset of disease features rather than being precise replicas of the disease. Consequently, connecting animal to human conditions using direct data-mining strategies has proven challenging, particularly for diseases of the nervous system, with its complicated anatomy and physiology. To address this challenge we have explored the use of ontologies to create formal descriptions of structural phenotypes across scales that are machine processable and amenable to logical inference. As proof of concept, we built a Neurodegenerative Disease Phenotype Ontology (NDPO) and an associated Phenotype Knowledge Base (PKB) using an entity-quality model that incorporates descriptions for both human disease phenotypes and those of animal models. Entities are drawn from community ontologies made available through the Neuroscience Information Framework (NIF) and qualities are drawn from the Phenotype and Trait Ontology (PATO). We generated ~1200 structured phenotype statements describing structural alterations at the subcellular, cellular and gross anatomical levels observed in 11 human neurodegenerative conditions and associated animal models. PhenoSim, an open source tool for comparing phenotypes, was used to issue a series of competency questions to compare individual phenotypes among organisms and to determine which animal models recapitulate phenotypic aspects of the human disease in aggregate. Overall, the system was able to use relationships within the ontology to bridge phenotypes across scales, returning non-trivial matches based on common subsumers that were meaningful to a neuroscientist with an advanced knowledge of neuroanatomy. The system can be used both to compare individual phenotypes and also phenotypes in aggregate. This proof of concept suggests that expressing complex phenotypes using formal ontologies provides considerable benefit for comparing phenotypes across scales and species.

59 BASIC BIOLOGICAL SCIENCES↗

Research and applications: Artificial intelligence

A program of research in the field of artificial intelligence is presented. The research areas discussed include automatic theorem proving, representations of real-world environments, problem-solving methods, the design of a programming system for problem-solving research, techniques for general scene analysis based upon television data, and the problems of assembling an integrated robot system. Major accomplishments include the development of a new problem-solving system that uses both formal logical inference and informal heuristic methods, the development of a method of automatic learning by generalization, and the design of the overall structure of a new complete robot system. Eight appendices to the report contain extensive technical details of the work described.

Raphael, B.↗

A second generation expert system for checking and diagnosing AXAF's electric power system

AXAF - Advanced X-ray Astrophysics Facility - is a third NASA's great space observatory. Each of these observatories is intended to cover different parts of the electromagnetic spectrum (x-ray for AXAF) and to provide high resolution images of celestial sources in our universe. While the spacecraft is in orbit, the electric power system (EPS) performance is monitored via sensors measuring voltages, currents, pressures, and temperatures. The sensor data are sent from the spacecraft to the ground station as telemetry and analyzed on arrival. Monitoring, diagnosis and maintenance of such EPS is an arduous task which requires expertise and constant attention of the ground personnel. To help the ground crew in this task, much of it should be automated and delegated to expert systems, which draw engineer's attention to possible malfunctions and allows him to review the telemetry to determine the source of the trouble, diagnose the suspected fault and to propose a corrective action. Those systems are built on assumptions such as: (1) domain knowledge is available and can be represented as a set of rules; (2) domain knowledge is circumscribed, static, and monotonic; and (3) expert decision making can be emulated by a logical inference mechanism.

Bykat, Alex↗

The rid-redundant procedure in C-Prolog

C-Prolog can conveniently be used for logical inferences on knowledge bases. However, as similar to many search methods using backward chaining, a large number of redundant computation may be produced in recursive calls. To overcome this problem, the 'rid-redundant' procedure was designed to rid all redundant computations in running multi-recursive procedures. Experimental results obtained for C-Prolog on the Vax 11/780 computer show that there is an order of magnitude improvement in the running time and solvable problem size.

Chen, Huo-Yan↗

AI's Philosophical Underpinnings: A Thinking Person's Walk through the Twists and Turns of Artificial Intelligence's Meandering Path

Few human endeavors can be viewed both as extremely successful and unsuccessful at the same time. This is typically the case when goals have not been well defined or have been shifting in time. This has certainly been true of Artificial Intelligence (AI). The nature of intelligence has been the object of much thought and speculation throughout the history of philosophy. It is in the nature of philosophy that real headway is sometimes made only when appropriate tools become available. Similarly the computer, coupled with the ability to program (at least in principle) any function, appeared to be the tool that could tackle the notion of intelligence. To suit the tool, the problem of the nature of intelligence was soon sidestepped in favor of this notion: If a probing conversation with a computer could not be distinguished from a conversation with a human, then AI had been achieved. This notion became known as the Turing test, after the mathematician Alan Turing who proposed it in 1950. Conceptually rich and interesting, these early efforts gave rise to a large portion of the field's framework. Key to AI, rather than the 'number crunching' typical of computers until then, was viewed as the ability to manipulate symbols and make logical inferences. To facilitate these tasks, AI languages such as LISP and Prolog were invented and used widely in the field. One idea that emerged and enabled some success with real world problems was the notion that 'most intelligence' really resided in knowledge. A phrase attributed to Feigenbaum, one of the pioneers, was 'knowledge is the power.' With this premise, the problem is shifted from 'how do we solve problems' to 'how do we represent knowledge.' A good knowledge representation scheme could allow one to draw conclusions from given premises. Such schemes took forms such as rules,frames and scripts. It allowed the building of what became known as expert systems or knowledge based systems (KBS).

Colombano, Silvano↗

PlanWorks: A Debugging Environment for Constraint Based Planning Systems

Numerous planning and scheduling systems employ underlying constraint reasoning systems. Debugging such systems involves the search for errors in model rules, constraint reasoning algorithms, search heuristics, and the problem instance (initial state and goals). In order to effectively find such problems, users must see why each state or action is in a plan by tracking causal chains back to part of the initial problem instance. They must be able to visualize complex relationships among many different entities and distinguish between those entities easily. For example, a variable can be in the scope of several constraints, as well as part of a state or activity in a plan; the activity can arise as a consequence of another activity and a model rule. Finally, they must be able to track each logical inference made during planning. We have developed PlanWorks, a comprehensive system for debugging constraint-based planning and scheduling systems. PlanWorks assumes a strong transaction model of the entire planning process, including adding and removing parts of the constraint network, variable assignment, and constraint propagation. A planner logs all transactions to a relational database that is tailored to support queries for of specialized views to display different forms of data (e.g. constraints, activities, resources, and causal links). PlanWorks was specifically developed for the Extensible Universal Remote Operations Planning Architecture (EUROPA(sub 2)) developed at NASA, but the underlying principles behind PlanWorks make it useful for many constraint-based planning systems. The paper is organized as follows. We first describe some fundamentals of EUROPA(sub 2). We then describe PlanWorks' principal components. We then discuss each component in detail, and then describe inter-component navigation features. We close with a discussion of how PlanWorks is used to find model flaws.

Daley, Patrick↗

System Would Detect Foreign-Object Damage in Turbofan Engine

A proposed data-fusion system, to be implemented mostly in software, would further process the digitized and preprocessed outputs of sensors in a turbofan engine to detect foreign-object damage (FOD) [more precisely, damage caused by impingement of such foreign objects as birds, pieces of ice, and runway debris]. The proposed system could help a flight crew to decide what, if any, response is necessary to complete a flight safely, and could aid mechanics in deciding what post-flight maintenance action might be needed. The sensory information to be utilized by the proposed system would consist of (1) the output of an accelerometer in an engine-vibration-monitoring subsystem and (2) features extracted from a gas path analysis. ["Gas path analysis" (GPA) is a term of art that denotes comprehensive analysis of engine performance derived from readings of fuel-flow meters, shaft-speed sensors, temperature sensors, and the like.] The acceleration signal would first be processed by a wavelet-transform-based algorithm, using a wavelet created for the specific purpose of finding abrupt FOD-induced changes in noisy accelerometer signals. Two additional features extracted would be the amplitude of vibration (determined via a single- frequency Fourier transform calculated at the rotational speed of the engine), and the rate of change in amplitude due to an FOD-induced rotor imbalance. This system would utilize two GPA features: the fan efficiency and the rate of change of fan efficiency with time. The selected GPA and vibrational features would be assessed by two fuzzy-logic inference engines, denoted the "Gas Path Expert" and the "Vibration Expert," respectively (see Figure 1). Each of these inference engines would generate a "possibility" distribution for occurrence of an FOD event: Each inference engine would assign, to its input information, degrees of membership, which would subsequently be transformed into basic probability assignments for the gas path and vibration components. The outputs of the inference engines would be fused by use of Dempster s combination algorithm (more precisely, an algorithm, based on the Dempster-Shafer-Yager theory of evidence, for fusing uncertain or imprecise information) to provide a reduced body of information to a human or computer decision maker. Figure 2 depicts some outputs generated in response to simulated accelerometer and GPA signals

Torso, James A.↗

Model-Based Method for Sensor Validation

Fault detection, diagnosis, and prognosis are essential tasks in the operation of autonomous spacecraft, instruments, and in situ platforms. One of NASA s key mission requirements is robust state estimation. Sensing, using a wide range of sensors and sensor fusion approaches, plays a central role in robust state estimation, and there is a need to diagnose sensor failure as well as component failure. Sensor validation can be considered to be part of the larger effort of improving reliability and safety. The standard methods for solving the sensor validation problem are based on probabilistic analysis of the system, from which the method based on Bayesian networks is most popular. Therefore, these methods can only predict the most probable faulty sensors, which are subject to the initial probabilities defined for the failures. The method developed in this work is based on a model-based approach and provides the faulty sensors (if any), which can be logically inferred from the model of the system and the sensor readings (observations). The method is also more suitable for the systems when it is hard, or even impossible, to find the probability functions of the system. The method starts by a new mathematical description of the problem and develops a very efficient and systematic algorithm for its solution. The method builds on the concepts of analytical redundant relations (ARRs).

Vatan, Farrokh↗

Inference System Integration Via Logic Morphisms

This is a final report on the accomplishments during the period of the NASA grant. The work on inference servers accomplished the integration of the SLANG logic (Specware's default specification logic) with a number of inference servers in order to make their complementary strengths available. These inverence servers are (1) SNARK. (2) Gandalf, Setheo, and Spass, (3) the Prototype Verification System (PVS) from SRI. (4) HOL98. We designed and implemented MetaSlang, an ML-like language, which we are using to specify and implement all our logic morphisms.

Bjorner, Nikolaj S.↗

What is a Question?

A given question can be defined in terms of the set of statements or assertions that answer it. Application of the logic of inference to this set of assertions allows one to derive the logic of inquiry among questions. There are interesting symmetries between the logics of inference and inquiry; where probability describes the degree to which a premise implies an assertion, there exists an analogous quantity that describes the bearing or relevance that a question has on an outstanding issue. These have been extended to suggest that the logic of inquiry results in functional relationships analogous to, although more general than, those found in information theory. Employing lattice theory, I examine in greater detail the structure of the space of assertions and questions demonstrating that the symmetries between the logical relations in each of the spaces derive directly from the lattice structure. Furthermore, I show that while symmetries between the spaces exist, the two lattices are not isomorphic. The lattice of assertions is described by a Boolean lattice 2(sup N) whereas the lattice of real questions is shown to be a sublattice of the free distributive lattice FD(N) = 2(sup 2(sup N)). Thus there does not exist a one-to-one mapping of assertions to questions, there is no reflection symmetry between the two spaces, and questions in general do not possess unique complements. Last, with these lattice structures in mind, I discuss the relationship between probability, relevance and entropy.

Knuth, Kevin H.↗

Plausible inference: A multi-valued logic for problem solving

A new logic is developed which permits continuously variable strength of belief in the truth of assertions. Four inference rules result, with formal logic as a limiting case. Quantification of belief is defined. Propagation of belief to linked assertions results from dependency-based techniques of truth maintenance so that local consistency is achieved or contradiction discovered in problem solving. Rules for combining, confirming, or disconfirming beliefs are given, and several heuristics are suggested that apply to revising already formed beliefs in the light of new evidence. The strength of belief that results in such revisions based on conflicting evidence are a highly subjective phenomenon. Certain quantification rules appear to reflect an orderliness in the subjectivity. Several examples of reasoning by plausible inference are given, including a legal example and one from robot learning. Propagation of belief takes place in directions forbidden in formal logic and this results in conclusions becoming possible for a given set of assertions that are not reachable by formal logic.

Friedman, L.↗

Quantifying microbial control of soil organic matter dynamics at macrosystem scales

Soil organic matter (SOM) stocks, decomposition and persistence are largely the product of controls that act locally. Yet the controls are shaped and interact at multiple spatiotemporal scales, from which macrosystem patterns in SOM emerge. Theory on SOM turnover recognizes the resulting spatial and temporal conditionality in the effect sizes of controls that play out across macrosystems, and couples them through evolutionary and community assembly processes. For example, climate history shapes plant functional traits, which in turn interact with contemporary climate to influence SOM dynamics. Selection and assembly also shape the functional traits of soil decomposer communities, but it is less clear how in turn these traits influence temporal macrosystem patterns in SOM turnover. Here, we review evidence that establishes the expectation that selection and assembly should generate decomposer communities across macrosystems that have distinct functional effects on SOM dynamics. Representation of this knowledge in soil biogeochemical models affects the magnitude and direction of projected SOM responses under global change. Yet there is high uncertainty and low confidence in these projections. To address these issues, we make the case that a coordinated set of empirical practices are required which necessitate (1) greater use of statistical approaches in biogeochemistry that are suited to causative inference; (2) long-term, macrosystem-scale, observational and experimental networks to reveal conditionality in effect sizes, and embedded correlation, in controls on SOM turnover; and (3) use of multiple measurement grains to capture local- and macroscale variation in controls and outcomes, to avoid obscuring causative understanding through data aggregation. Here, when employed together, along with process-based models to synthesize knowledge and guide further empirical work, we believe these practices will rapidly advance understanding of microbial controls on SOM and improve carbon cycle projections that guide policies on climate adaptation and mitigation.

59 BASIC BIOLOGICAL SCIENCES↗

Development of a coupled expert system for the spacecraft attitude control problem

A majority of the current expert systems focus on the symbolic-oriented logic and inference mechanisms of artificial intelligence (AI). Common rule-based systems employ empirical associations and are not well suited to deal with problems often arising in engineering. Described is a prototype expert system which combines both symbolic and numeric computing. The expert system's configuration is presented and its application to a spacecraft attitude control problem is discussed.

Kawamura, K.↗