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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Logical inference derivation of the quantum theoretical description of Stern–Gerlach and Einstein–Podolsky–Rosen–Bohm experiments

Highlights: •Logical inference connects data and their description in terms of concepts. •It is used to derive the description of Stern–Gerlach experiments. •Logical inference yields the description of Einstein–Podolsky–Rosen–Bohm experiments. •These logical inference derivations do not rely on concepts of quantum theory. -- Abstract: It is shown that the quantum-theoretical descriptions of idealized Stern–Gerlach and Einstein–Podolsky–Rosen–Bohm experiments result from a logical inference treatment of robust experiments, without relying on concepts of quantum theory. For concreteness, the derivation is given for the case that the Stern–Gerlach magnet deflects the beam in three different directions, which in quantum theory corresponds to a description in terms of spin-1 particles. The logical inference description of the Einstein–Podolsky–Rosen–Bohm experiment is shown to contain the quantum theoretical description as a particular case.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Logical inference approach to relativistic quantum mechanics: Derivation of the Klein–Gordon equation

The logical inference approach to quantum theory, proposed earlier De Raedt et al. (2014), is considered in a relativistic setting. It is shown that the Klein–Gordon equation for a massive, charged, and spinless particle derives from the combination of the requirements that the space–time data collected by probing the particle is obtained from the most robust experiment and that on average, the classical relativistic equation of motion of a particle holds. - Highlights: • Logical inference applied to relativistic, massive, charged, and spinless particle experiments leads to the Klein–Gordon equation. • The relativistic Hamilton–Jacobi is scrutinized by employing a field description for the four-velocity. • Logical inference allows analysis of experiments with uncertainty in detection events and experimental conditions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Rapid Inference of Logic Gate Neural Networks for Anomaly Detection in High Energy Physics

The increasing data rates and complexity of detectors at the Large Hadron Collider (LHC) necessitate fast and efficient machine learning models, particularly for rapid selection of what data to store, known as triggering. Building on recent work in differentiable logic gates, we present a public implementation of a Convolutional Differentiable Logic Gate Neural Network (CLGN). We apply this to detecting anomalies at the Level-1 Trigger at CMS using public data from the CICADA project. We demonstrate that the CLGN achieves physics performance on par with or superior to conventional quantized neural networks. We also synthesize an LGN for a Field-Programmable Gate Array (FPGA) and show highly promising FPGA characteristics, notably zero Digital Signal Processor (DSP) resource usage. This work highlights the potential of logic gate networks for high-speed, on-detector inference in High Energy Physics and beyond.

FOS: Physical sciences↗
DOE OSTI2021

Jaynesian Analysis of Environmental Chemistry: Systems Model Component Integration via the Arctic Aquatic Carbon Cycle

Focal Areas: All three are touched upon from the OBER call. We will consider formal logical inference and entropic information analysis for sparse but intensive chemical measurements, as optimal drivers for managing process complexity. As a centerpiece for the discussion we take soil-to-sea organic structural evolution within the Arctic hydro-geochemosphere, assessing detrital negentropy then algorithmic greed to generate ranked, reduced mechanisms for system integration.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2016

Cosmic logic: a computational model

We initiate a formal study of logical inferences in context of the measure problem in cosmology or what we call cosmic logic. We describe a simple computational model of cosmic logic suitable for analysis of, for example, discretized cosmological systems. The construction is based on a particular model of computation, developed by Alan Turing, with cosmic observers (CO), cosmic measures (CM) and cosmic symmetries (CS) described by Turing machines. CO machines always start with a blank tape and CM machines take CO's Turing number (also known as description number or Gödel number) as input and output the corresponding probability. Similarly, CS machines take CO's Turing number as input, but output either one if the CO machines are in the same equivalence class or zero otherwise. We argue that CS machines are more fundamental than CM machines and, thus, should be used as building blocks in constructing CM machines. We prove the non-computability of a CS machine which discriminates between two classes of CO machines: mortal that halts in finite time and immortal that runs forever. In context of eternal inflation this result implies that it is impossible to construct CM machines to compute probabilities on the set of all CO machines using cut-off prescriptions. The cut-off measures can still be used if the set is reduced to include only machines which halt after a finite and predetermined number of steps.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

The Ontology of Biological Attributes (OBA)—computational traits for the life sciences

Abstract Existing phenotype ontologies were originally developed to represent phenotypes that manifest as a character state in relation to a wild-type or other reference. However, these do not include the phenotypic trait or attribute categories required for the annotation of genome-wide association studies (GWAS), Quantitative Trait Loci (QTL) mappings or any population-focussed measurable trait data. The integration of trait and biological attribute information with an ever increasing body of chemical, environmental and biological data greatly facilitates computational analyses and it is also highly relevant to biomedical and clinical applications. The Ontology of Biological Attributes (OBA) is a formalised, species-independent collection of interoperable phenotypic trait categories that is intended to fulfil a data integration role. OBA is a standardised representational framework for observable attributes that are characteristics of biological entities, organisms, or parts of organisms. OBA has a modular design which provides several benefits for users and data integrators, including an automated and meaningful classification of trait terms computed on the basis of logical inferences drawn from domain-specific ontologies for cells, anatomical and other relevant entities. The logical axioms in OBA also provide a previously missing bridge that can computationally link Mendelian phenotypes with GWAS and quantitative traits. The term components in OBA provide semantic links and enable knowledge and data integration across specialised research community boundaries, thereby breaking silos.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2017

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↗
DOE OSTI2017

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↗
DOE OSTI2024

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↗
DOE OSTI2021

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↗
DOE OSTI2021

Robotic Understanding of Spatial Relationships Using Neural-Logic Learning

Understanding spatial relations of objects is critical in many robotic applications such as grasping, manipulation, and obstacle avoidance. Humans can simply reason object's spatial relations from a glimpse of a scene based on prior knowledge of spatial constraints. The proposed method enables a robot to comprehend spatial relationships among objects from RGB-D data. This paper proposed a neural-logic learning framework to learn and reason spatial relations from raw data by following logic rules on spatial constraints. The neural-logic network consists of three blocks: grounding block, spatial logic block, and inference block. The grounding block extracts high-level features from the raw sensory data. The spatial logic blocks can predicate fundamental spatial relations by training a neural network with spatial constraints. The inference block can infer complex spatial relations based on the predicated fundamental spatial relations. Simulations and robotic experiments evaluated the performance of the proposed method.

Wang, Dali↗
DOE OSTI2024

The Number and Pattern of Viral Genomic Reassortments are not Necessarily Identifiable from Segment Trees

Reassortment is an evolutionary process common in viruses with segmented genomes. These viruses can swap whole genomic segments during cellular co-infection, giving rise to novel progeny formed from the mixture of parental segments. Since large-scale genome rearrangements have the potential to generate new phenotypes, reassortment is important to both evolutionary biology and public health research. However, statistical inference of the pattern of reassortment events from phylogenetic data is exceptionally difficult, potentially involving inference of general graphs in which individual segment trees are embedded. In this paper, we argue that, in general, the number and pattern of reassortment events are not identifiable from segment trees alone, even with theoretically ideal data. We call this fact the fundamental problem of reassortment, which we illustrate using the concept of the “first-infection tree,” a potentially counterfactual genealogy that would have been observed in the segment trees had no reassortment occurred. Further, we illustrate four additional problems that can arise logically in the inference of reassortment events and show, using simulated data, that these problems are not rare and can potentially distort our observation of reassortment even in small data sets. Finally, we discuss how existing methods can be augmented or adapted to account for not only the fundamental problem of reassortment, but also the four additional situations that can complicate the inference of reassortment.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2016

Development of a Severe Accident Analysis Engine Using Approximate Reasoning

In hypothetical severe accident scenarios, nuclear power plant safety is challenged by core degradation and release of fission products. To aid the plant operator and technical support center staff, research has been performed to develop understanding of severe accident phenomenology, assessing their risk and devise measures to mitigate accident consequences (Sehgal, 2011). Nuclear power plant accidents involve highly complex physical and chemical interactions, a large number of safety related systems, and emergency operating procedures (EOP) and severe accident management guidelines (SAMG). Large number of factors with uncertainty and stress can overwhelm the operators. The overall objective of the present research is to develop a methodology and tools that an operator can use to predict severe accident progression and make effective decisions to arrest and manage the accident under large uncertainties. Towards this goal, this study examines a novel approach that brings to bear a combined use of techniques in artificial intelligence (Russel and Norvig, 2010), including Bayesian Network (BN), Answer Set Programming (ASP) and Fuzzy Inference (FI) to achieve faster-than-real-time, yet sufficiently accurate analysis of severe accident progression. Bayesian network (BN) is a type of probabilistic graphical models that can be used to represent knowledge and conditional dependencies about an uncertain realm. It is useful for capturing the causal relationships in a complex system. It also allows prediction via Bayesian inference (Kelly and Smith, 2012). It is composed of nodes and edges, which express random variables and probabilistic relationships between the nodes, respectively. This relationship, given by conditional probability is calculated using stochastic methods. The BN is used in several systems for analysis and management of accident risk; e.g. (Knochenhauer and Frid, 2010). In those systems, the nodes or so-called 'effective factors' are presumably known within the network by system descriptions in SAMGs. There are two steps to configure the BN, namely (i) identifying compositions within the network and (ii) defining conditional dependency between nodes. The first step is performed following the spirit of ASP (Baral, 2003) using Prolog (Wielemaker, 2005). Knowledge representation is used to build databases required for processing by ASP. Knowledge representation is defined as the expression of knowledge in a way that is understandable to both human and computers. Originally knowledge indicates data, information and facts. To focus, knowledge should be formed to achieve a goal. In a severe accident, key physics and safety related components status are defined according to a failure mode. The conditional dependencies between nodes are generated by approximate reasoning using Fuzzy inference (Zadeh, 1995). Fuzzy logic is a multiple-valued logic to treat ambiguous features such as linguistic description. It indicates possibility, which is distinguished from probability. Fuzzy set consists of linguistic variables according to the fixed rule. In other words, even uncertain states could be expressed as not binary logic, but as many-value logic by rule-based technology. Fuzzy control system is comprised of Fuzzy inference engine that is performed based on the 'If-Then Rule'. The 'If-Then Rule' is of the following form. If Y1 is B11 and Y2 is B12 then Z is C1. If Y1 is B21 and Y2 is B22 then Z is C2. Y1 and Y2 are inputs, which indicate conditional variables. Z indicates decision-making and both B and C are linguistic variables. With this rule-based technique, the approximate reasoning can be realized by Fuzzy inference. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2023

Characterization of Quantum Frequency Processors

Frequency-bin qubits possess unique synergies with wavelength-multiplexed lightwave communications, suggesting valuable opportunities for quantum networking with the existing fiber-optic infrastructure. Although the coherent manipulation of frequency-bin states requires highly controllable multi-spectral-mode interference, the quantum frequency processor (QFP) provides a scalable path for gate synthesis leveraging standard telecom components. Here, we summarize the state of the art in experimental QFP characterization. Distinguishing between physically motivated “open box” approaches that treat the QFP as a multiport interferometer, and “black box” approaches that view the QFP as a general quantum operation, we highlight the assumptions and results of multiple techniques, including quantum process tomography of a tunable beamsplitter—to our knowledge the first full process tomography of any frequency-bin operation. Our findings should inform future characterization efforts as the QFP increasingly moves beyond proof-of-principle tabletop demonstrations toward integrated devices and deployed quantum networking experiments.

42 ENGINEERING↗
DOE OSTI2023

Machine Learning 5G Attack Detection in Programmable Logic

Machine learning-assisted network security may significantly contribute to securing 5G components. However, machine learning network security inference speeds generally require tens to hundreds of milliseconds thereby introducing significant latency in 5G operations. The inference latency can be reduced by deploying the machine learning model to programmable logic in a field programmable gate array (FPGA) at the cost of a small loss in accuracy. In order to quantify this loss, as well as to establish baseline performance inference speeds for programmable logic implementations, this work explores an autoencoder and a ß-variational autoencoder deployed on two different FPGA evaluation boards and compares accuracy and performance against an NVIDIA A100 GPU implementation. A publicly available 5G dataset containing 10 types of attacks along with normal traffic is introduced as part of the evaluation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Artificial Reasoning System for Symptom-Based Conditional Failure Probability Estimation Using Bayesian Network

Advances in nuclear power technologies require enhanced capabilities for operator advice and autonomous control. One of the first tasks in the development of such capabilities is the formulation of symptom-based conditional failure probabilities for structures, systems, and components (SSCs) of interest, for which the primary goal is to aid plant personnel in deducing the probabilistic performance status of the monitored SSCs and in detecting impending faults/failure. The task of conditional failure probability estimation is a bidirectional inference problem and shall be logically tackled by the Bayesian network (BN) approach. As a knowledge-based artificial intelligence tool and a probabilistic graphical model, BN offers the capability of reasoning under uncertainty and graphical representation emulating the physical behavior of the target SSC. This paper provides a systematic overview of the BN technique and the software tools for handling implementation of BN models, along with the associated knowledge representation and reasoning paradigm. Both operational data and expert judgement can be readily incorporated into the knowledge base of a BN model. The challenges with data availability are highlighted, and the general approach to target SSC identification is presented. Our focus is upon failure-prone and risk-important balance of plant assets, especially cases having strong operator involvement. An exemplary case study on the failure of a motor-driven centrifugal pump is also conducted to demonstrate the usefulness and technical feasibility of the proposed artificial reasoning system using an expert system shell.

Zhao, Xingang↗