Using Tableau to Decide Expressive Description Logics with Role Negation
NASA Astrophysics Data System (ADS)
Schmidt, Renate A.; Tishkovsky, Dmitry
This paper presents a tableau approach for deciding description logics outside the scope of OWL DL/1.1 and current state-of-the-art tableau-based description logic systems. In particular, we define a sound and complete tableau calculus for the description logic {ALBO} and show that it provides a basis for decision procedures for this logic and numerous other description logics with full role negation. {ALBO} is the extension of {ALC} with the Boolean role operators, inverse of roles, domain and range restriction operators and it includes full support for nominals (individuals). {ALBO} is a very expressive description logic which subsumes Boolean modal logic and the two-variable fragment of first-order logic and reasoning in it is NExpTime-complete. An important novelty is the use of a generic, unrestricted blocking rule as a replacement for standard loop checking mechanisms implemented in description logic systems. An implementation of our approach exists in the {textsc{MetTeL}} system.
NASA Astrophysics Data System (ADS)
Baader, Franz
Description Logics (DLs) are a well-investigated family of logic-based knowledge representation formalisms, which can be used to represent the conceptual knowledge of an application domain in a structured and formally well-understood way. They are employed in various application domains, such as natural language processing, configuration, and databases, but their most notable success so far is the adoption of the DL-based language OWL as standard ontology language for the semantic web.
Closed terminologies in description logics
Weida, R.A. |
1996-12-31
We introduce a predictive concept recognition methodology for description logics based on a new closed terminology assumption. During knowledge engineering, our system adopts the standard open terminology assumption as it automatically classifies concept descriptions into a taxonomy via subsumption inferences. However, for applications like configuration, the terminology becomes fixed during problem solving. Then, closed terminology reasoning is more appropriate. In our interactive configuration application, a user incrementally specifies an individual computer system in collaboration with a configuration engine. Choices can be made in any order and at any level of abstraction. We distinguish between abstract and concrete concepts to formally define when an individual`s description may be considered finished. We also take advantage of the closed terminology assumption, together with the terminology`s subsumption-based organization, to efficiently track the types of systems and components consistent with current choices, infer additional constraints on current choices, and appropriately guide future choices. Thus, we can help focus the efforts of both user and configuration engine.
The limits on combining recursive horn rules with description logics
Levy, A.Y.; Rousset, M.C.
1996-12-31
Horn rule languages have formed the basis for many Artificial Intelligence application languages, but are not expressive enough to model domains with a rich hierarchical structure. Description logics have been designed especially to model rich hierarchies. Several applications would significantly benefit from combining the expressive power of both formalisms. This paper focuses on combining recursive function-free Horn rules with the expressive description logic ALCNR, and shows exactly when a hybrid language with decidable inference can be obtained. First, we show that several of the core constructors of description logics lead by themselves to undecidability of inference when combined with recursive function-free Horn rules. We then show that without these constructors we obtain a maximal subset of ALCNRR that yields a decidable hybrid language. Finally, we describe a restriction on the Horn rules that guarantees decidable inference when combined with all of ALCNR, and covers many of the common usages of recursive rules.
Integration Proposal for Description Logic and Attributive Logic - Towards Semantic Web Rules
NASA Astrophysics Data System (ADS)
Nalepa, Grzegorz J.; Furmańska, Weronika T.
The current challenge of the Semantic Web is the development of an expressive yet effective rule language. This paper presents an integration proposal for Description Logics (DL) and Attributive Logics (ALSV) is presented. These two formalisms stem from fields of Knowledge Representation and Artificial Intelligence. However, they are based on different design goals and therefore provide different description and reasoning capabilities. ALSV is the foundation of XTT2, an expressive language for rule-based systems. DL provide formulation for expressive ontology languages such as OWL2. An important research direction is the development of rule languages that can be integrated with ontologies. The contribution of the paper consists in introducing a possible transition from ALSV to DL. This opens up possibilities of using XTT2, a well-founded rule-based system modelling rule language, to improve the design of Semantic Web rules.
A Fuzzy Description Logic with Automatic Object Membership Measurement
NASA Astrophysics Data System (ADS)
Cai, Yi; Leung, Ho-Fung
In this paper, we propose a fuzzy description logic named f om -DL by combining the classical view in cognitive psychology and fuzzy set theory. A formal mechanism used to determine object memberships automatically in concepts is also proposed, which is lacked in previous work fuzzy description logics. In this mechanism, object membership is based on the defining properties of concept definition and properties in object description. Moreover, while previous works cannot express the qualitative measurements of an object possessing a property, we introduce two kinds of properties named N-property and L-property, which are quantitative measurements and qualitative measurements of an object possessing a property respectively. The subsumption and implication of concepts and properties are also explored in our work. We believe that it is useful to the Semantic Web community for reasoning the fuzzy membership of objects for concepts in fuzzy ontologies.
Reasoning about Typicality with Low Complexity Description Logics: The Logic {EL}^{+^bot}{T}
NASA Astrophysics Data System (ADS)
Giordano, Laura; Gliozzi, Valentina; Olivetti, Nicola; Pozzato, Gian Luca
We present an extension of the low complexity Description Logic {EL}^{+^bot} for reasoning about prototypical properties and inheritance with exceptions. We add to {EL}^{+^bot} a typicality operator T, which is intended to select the "most normal" instances of a concept. In the resulting logic, called {EL}^{+^bot}{T}, the knowledge base may contain subsumption relations of the form "T(C) is subsumed by P", expressing that typical C-members have the property P. We show that the problem of entailment in {EL}^{+^bot}{T} is in co-NP by proving a small model result.
Research on spatio-temporal ontology based on description logic
NASA Astrophysics Data System (ADS)
Huang, Yongqi; Ding, Zhimin; Zhao, Zhui; Ouyang, Fucheng
2008-10-01
DL, short for Description Logic, is aimed at getting a balance between describing ability and reasoning complexity. Users can adopt DL to write clear and formalized concept description for domain model, which makes ontology description possess well-defined syntax and semantics and helps to resolve the problem of spatio-temporal reasoning based on ontology. This paper studies on basic theory of DL and relationship between DL and OWL at first. By analyzing spatio-temporal concepts and relationship of spatio-temporal GIS, the purpose of this paper is adopting ontology language based on DL to express spatio-temporal ontology, and employing suitable ontology-building tool to build spatio-temporal ontology. With regard to existing spatio-temporal ontology based on first-order predicate logic, we need to transform it into spatio-temporal ontology based on DL so as to make the best of existing research fruits. This paper also makes a research on translating relationships between DL and first-order predicate logic.
Concurrent logic programming as a hardware description tool
Dotan, Y.; Arazi, B. . Dept. of Chemical Engineering)
1990-01-01
This paper discusses the possibility of developing hardware description languages (HDL's) based on the principles of logic programming. The specific logic programming language used to demonstrate this possibility is Flat Concurrent Prolog (FCP). It is shown explicitly how FCP naturally satisfies the commonly accepted fundamental requirements of a hardware description language. It is then demonstrated how FCP overcomes known disadvantages of the highly acclaimed VHDL. Some other parallel logic programming languages beside FCP are also presented briefly and the possibility of using them for hardware description is discussed.
Ideal Downward Refinement in the EL Description Logic
NASA Astrophysics Data System (ADS)
Lehmann, Jens; Haase, Christoph
With the proliferation of the Semantic Web, there has been a rapidly rising interest in description logics, which form the logical foundation of the W3C standard ontology language OWL. While the number of OWL knowledge bases grows, there is an increasing demand for tools assisting knowledge engineers in building up and maintaining their structure. For this purpose, concept learning algorithms based on refinement operators have been investigated. In this paper, we provide an ideal refinement operator for the description logic EL and show that it is computationally feasible on large knowledge bases.
The CSM testbed matrix processors internal logic and dataflow descriptions
NASA Technical Reports Server (NTRS)
Regelbrugge, Marc E.; Wright, Mary A.
1988-01-01
This report constitutes the final report for subtask 1 of Task 5 of NASA Contract NAS1-18444, Computational Structural Mechanics (CSM) Research. This report contains a detailed description of the coded workings of selected CSM Testbed matrix processors (i.e., TOPO, K, INV, SSOL) and of the arithmetic utility processor AUS. These processors and the current sparse matrix data structures are studied and documented. Items examined include: details of the data structures, interdependence of data structures, data-blocking logic in the data structures, processor data flow and architecture, and processor algorithmic logic flow.
Describing and recognizing patterns of events in smart environments with description logic.
Scalmato, Antonello; Sgorbissa, Antonio; Zaccaria, Renato
2013-12-01
This paper describes a system for context awareness in smart environments, which is based on an ontology expressed in description logic and implemented in OWL 2 EL, which is a subset of the Web Ontology Language that allows for reasoning in polynomial time. The approach is different from all other works in the literature since the proposed system requires only the basic reasoning mechanisms of description logic, i.e., subsumption and instance checking, without any additional external reasoning engine. Experiments performed with data collected in three different scenarios are described, i.e., the CASAS Project at Washington State University, the assisted living facility Villa Basilea in Genoa, and the Merry Porter mobile robot at the Polyclinic of Modena. PMID:23757579
Modeling a description logic vocabulary for cancer research.
Hartel, Frank W; de Coronado, Sherri; Dionne, Robert; Fragoso, Gilberto; Golbeck, Jennifer
2005-04-01
The National Cancer Institute has developed the NCI Thesaurus, a biomedical vocabulary for cancer research, covering terminology across a wide range of cancer research domains. A major design goal of the NCI Thesaurus is to facilitate translational research. We describe: the features of Ontylog, a description logic used to build NCI Thesaurus; our methodology for enhancing the terminology through collaboration between ontologists and domain experts, and for addressing certain real world challenges arising in modeling the Thesaurus; and finally, we describe the conversion of NCI Thesaurus from Ontylog into Web Ontology Language Lite. Ontylog has proven well suited for constructing big biomedical vocabularies. We have capitalized on the Ontylog constructs Kind and Role in the collaboration process described in this paper to facilitate communication between ontologists and domain experts. The artifacts and processes developed by NCI for collaboration may be useful in other biomedical terminology development efforts. PMID:15797001
Brewer, Allen; Helfgott, Maxwell A; Novak, Joseph; Schanhals, Rick
2012-09-01
The development and implementation of competent and cost-effective computerized medical records that profoundly improve physician productivity and knowledge management will require the development of a new paradigm for the representation and analysis of medical knowledge and logic. Medical knowledge is acquired inductively by observing, measuring, and eliciting information from patients in a process that is investigational rather than transactional. Most, if not all, current approaches to health information technology (HIT) rely on a logic and data structure that imposes significant limitations on the ability of physicians to thoroughly and efficiently document and access empiric patient data because the information is almost invariably organized in a way which presumes, rather than makes explicit, the relationships of concepts and their meaning. Cmapping provides a graphical method of capturing and displaying expert content knowledge that is simple to comprehend and modify and provides a foundation for a dynamic, inductive, and inclusive method of clinical documentation and research. The basis of medical decision analysis along with representative samples of medical knowledge modeling in the Cmap format is presented. The knowledge structures that are captured in Cmaps can be expressed directly in propositional logic, enabling the capability to convert Cmapped clinical expressions to be used to define a description logic for clinical evidence documentation and analysis that can in turn be mapped to multiple natural languages. The described description logic approach can be used to formulate digital messages and documents and to automate the process of converting description specifications formulated in propositional logic into operational electronic health record solutions for capture and reporting of clinical encounters. It has also been demonstrated that using Cmaps to elicit content knowledge from physicians to build point-of-care clinical documentation screens
Helfgott, Maxwell A.; Novak, Joseph; Schanhals, Rick
2012-01-01
The development and implementation of competent and cost-effective computerized medical records that profoundly improve physician productivity and knowledge management will require the development of a new paradigm for the representation and analysis of medical knowledge and logic. Medical knowledge is acquired inductively by observing, measuring, and eliciting information from patients in a process that is investigational rather than transactional. Most, if not all, current approaches to health information technology (HIT) rely on a logic and data structure that imposes significant limitations on the ability of physicians to thoroughly and efficiently document and access empiric patient data because the information is almost invariably organized in a way which presumes, rather than makes explicit, the relationships of concepts and their meaning. Cmapping provides a graphical method of capturing and displaying expert content knowledge that is simple to comprehend and modify and provides a foundation for a dynamic, inductive, and inclusive method of clinical documentation and research. The basis of medical decision analysis along with representative samples of medical knowledge modeling in the Cmap format is presented. The knowledge structures that are captured in Cmaps can be expressed directly in propositional logic, enabling the capability to convert Cmapped clinical expressions to be used to define a description logic for clinical evidence documentation and analysis that can in turn be mapped to multiple natural languages. The described description logic approach can be used to formulate digital messages and documents and to automate the process of converting description specifications formulated in propositional logic into operational electronic health record solutions for capture and reporting of clinical encounters. It has also been demonstrated that using Cmaps to elicit content knowledge from physicians to build point-of-care clinical documentation screens
Disgust and biological descriptions bias logical reasoning during legal decision-making.
Capestany, Beatrice H; Harris, Lasana T
2014-01-01
Legal decisions often require logical reasoning about the mental states of people who perform gruesome behaviors. We use functional magnetic resonance imaging (fMRI) to examine how brain regions implicated in logical reasoning are modulated by emotion and social cognition during legal decision-making. Participants read vignettes describing crimes that elicit strong or weak disgust matched on punishment severity using the US Federal Sentencing Guidelines. An extraneous sentence at the end of each vignette described the perpetrator's personality using traits or biological language, mimicking the increased use of scientific evidence presented in courts. Behavioral results indicate that crimes weak in disgust receive significantly less punishment than the guidelines recommend. Neuroimaging results indicate that brain regions active during logical reasoning respond less to crimes weak in disgust and biological descriptions of personality, demonstrating the impact of emotion and social cognition on logical reasoning mechanisms necessary for legal decision-making. PMID:24571553
An autonomous molecular computer for logical control of gene expression
NASA Astrophysics Data System (ADS)
Benenson, Yaakov; Gil, Binyamin; Ben-Dor, Uri; Adar, Rivka; Shapiro, Ehud
2004-05-01
Early biomolecular computer research focused on laboratory-scale, human-operated computers for complex computational problems. Recently, simple molecular-scale autonomous programmable computers were demonstrated allowing both input and output information to be in molecular form. Such computers, using biological molecules as input data and biologically active molecules as outputs, could produce a system for `logical' control of biological processes. Here we describe an autonomous biomolecular computer that, at least in vitro, logically analyses the levels of messenger RNA species, and in response produces a molecule capable of affecting levels of gene expression. The computer operates at a concentration of close to a trillion computers per microlitre and consists of three programmable modules: a computation module, that is, a stochastic molecular automaton; an input module, by which specific mRNA levels or point mutations regulate software molecule concentrations, and hence automaton transition probabilities; and an output module, capable of controlled release of a short single-stranded DNA molecule. This approach might be applied in vivo to biochemical sensing, genetic engineering and even medical diagnosis and treatment. As a proof of principle we programmed the computer to identify and analyse mRNA of disease-related genes associated with models of small-cell lung cancer and prostate cancer, and to produce a single-stranded DNA molecule modelled after an anticancer drug.
Walter, K.E.
1995-06-08
This document provides an updated computer software description for the software used on the FFTF R-1 (C-620-A) and R-2 (C-620-B) air compressor programmable controllers. Logic software design changes were required to allow automatic starting of a compressor that had not been previously started.
Card, W I; Lucas, R W; Spiegelhalter, D J
1984-03-01
Although some disease classes can be defined by a single defining characteristic, in terms of traditional logic one that is both necessary and sufficient, other disease classes, such as the so-called "irritable bowel syndrome' (IBS), have only a set of symptoms, signs etc. which are said to characterize it in some undefined way. This characterization might be made definite by using simple Boolean algebra to give a logical description of the disease class. This method can only be used if the individual doctor can be shown to be consistent in his assignment of a set of data to the disease class and also if his assignment agrees independently with that of another doctor. To test such consistency and concordance, 100 case records were collected of supposed IBS and not-IBS; 20 of these were replicated to test consistency, and the total of 120 records was examined by five consultants independently, who assigned them either to an IBS or a not-IBS class. From the 1500 pair-wise comparisons, analysis revealed that the disagreement in assignment between doctors was only slightly greater than the disagreement within doctors, suggesting that the group of doctors acted as if there were an implicit description of IBS with which each of them broadly agreed. This implicit description, if made explicit, could form a basis for diagnosis by logical implication. This method of logical definition has general application in medicine and a set of defined cases could be used to establish entry criteria for multicentre trials of a previously ill-defined class. PMID:6692662
NASA Technical Reports Server (NTRS)
Burgin, G. H.; Fogel, L. J.; Phelps, J. P.
1975-01-01
A technique for computer simulation of air combat is described. Volume 1 decribes the computer program and its development in general terms. Two versions of the program exist. Both incorporate a logic for selecting and executing air combat maneuvers with performance models of specific fighter aircraft. In the batch processing version the flight paths of two aircraft engaged in interactive aerial combat and controlled by the same logic are computed. The realtime version permits human pilots to fly air-to-air combat against the adaptive maneuvering logic (AML) in Langley Differential Maneuvering Simulator (DMS). Volume 2 consists of a detailed description of the computer programs.
Schulz, S.; Romacker, M.; Hahn, U.
1998-01-01
The development of powerful and comprehensive medical ontologies that support formal reasoning on a large scale is one of the key requirements for clinical computing in the next millennium. Taxonomic medical knowledge, a major portion of these ontologies, is mainly characterized by generalization and part-whole relations between concepts. While reasoning in generalization hierarchies is quite well understood, no fully conclusive mechanism as yet exists for part-whole reasoning. The approach we take emulates part-whole reasoning via classification-based reasoning using SEP triplets, a special data structure for encoding part-whole relations that is fully embedded in the formal framework of standard description logics. Images Figure 3 PMID:9929335
An interval logic for higher-level temporal reasoning
NASA Technical Reports Server (NTRS)
Schwartz, R. L.; Melliar-Smith, P. M.; Vogt, F. H.; Plaisted, D. A.
1983-01-01
Prior work explored temporal logics, based on classical modal logics, as a framework for specifying and reasoning about concurrent programs, distributed systems, and communications protocols, and reported on efforts using temporal reasoning primitives to express very high level abstract requirements that a program or system is to satisfy. Based on experience with those primitives, this report describes an Interval Logic that is more suitable for expressing such higher level temporal properties. The report provides a formal semantics for the Interval Logic, and several examples of its use. A description of decision procedures for the logic is also included.
NASA Technical Reports Server (NTRS)
Burgin, G. H.; Owens, A. J.
1975-01-01
A detailed description is presented of the computer programs in order to provide an understanding of the mathematical and geometrical relationships as implemented in the programs. The individual sbbroutines and their underlying mathematical relationships are described, and the required input data and the output provided by the program are explained. The relationship of the adaptive maneuvering logic program with the program to drive the differential maneuvering simulator is discussed.
Song, Mingzhou; Lewis, Chris K.; Lance, Eric; Chesler, Elissa J; Kirova, Roumyana; Langston, Michael A; Bergeson, Susan
2009-01-01
The problem of reconstructing generalized logical networks to account for temporal dependencies among genes and environmental stimuli from high-throughput transcriptomic data is addressed. A network reconstruction algorithm was developed that uses the statistical significance as a criterion for network selection to avoid false-positive interactions arising from pure chance. Using temporal gene expression data collected from the brains of alcohol-treated mice in an analysis of the molecular response to alcohol, this algorithm identified genes from a major neuronal pathway as putative components of the alcohol response mechanism. Three of these genes have known associations with alcohol in the literature. Several other potentially relevant genes, highlighted and agreeing with independent results from literature mining, may play a role in the response to alcohol. Additional, previously-unknown gene interactions were discovered that, subject to biological verification, may offer new clues in the search for the elusive molecular mechanisms of alcoholism.
A Logical Framework to Deal with Variability
NASA Astrophysics Data System (ADS)
Asirelli, Patrizia; Ter Beek, Maurice H.; Fantechi, Alessandro; Gnesi, Stefania
We present a logical framework that is able to deal with variability in product family descriptions. The temporal logic MHML is based on the classical Hennessy-Milner logic with Until and we interpret it over Modal Transition Systems (MTSs). MTSs extend the classical notion of Labelled Transition Systems by distinguishing possible (may) and required (must) transitions: these two types of transitions are useful to describe variability in behavioural descriptions of product families. This leads to a novel deontic interpretation of the classical modal and temporal operators, which allows the expression of both constraints over the products of a family and constraints over their behaviour in a single logical framework. Finally, we sketch model-checking algorithms to verify MHML formulae as well as a way to derive correct products from a product family description.
Deterministic and Stochastic Descriptions of Gene Expression Dynamics
NASA Astrophysics Data System (ADS)
Marathe, Rahul; Bierbaum, Veronika; Gomez, David; Klumpp, Stefan
2012-09-01
A key goal of systems biology is the predictive mathematical description of gene regulatory circuits. Different approaches are used such as deterministic and stochastic models, models that describe cell growth and division explicitly or implicitly etc. Here we consider simple systems of unregulated (constitutive) gene expression and compare different mathematical descriptions systematically to obtain insight into the errors that are introduced by various common approximations such as describing cell growth and division by an effective protein degradation term. In particular, we show that the population average of protein content of a cell exhibits a subtle dependence on the dynamics of growth and division, the specific model for volume growth and the age structure of the population. Nevertheless, the error made by models with implicit cell growth and division is quite small. Furthermore, we compare various models that are partially stochastic to investigate the impact of different sources of (intrinsic) noise. This comparison indicates that different sources of noise (protein synthesis, partitioning in cell division) contribute comparable amounts of noise if protein synthesis is not or only weakly bursty. If protein synthesis is very bursty, the burstiness is the dominant noise source, independent of other details of the model. Finally, we discuss two sources of extrinsic noise: cell-to-cell variations in protein content due to cells being at different stages in the division cycles, which we show to be small (for the protein concentration and, surprisingly, also for the protein copy number per cell) and fluctuations in the growth rate, which can have a significant impact.
Preface of the "Symposium on Logic Synthesis for Programmable Logic Devices"
NASA Astrophysics Data System (ADS)
Kania, Dariusz
2015-12-01
Logic synthesis is an indirect link between design description and technology mapping. In the result of synthesis process an implementation in terms of an interconnection of logic gates, flip-flops, LUTs, etc. is generated. Typically, synthesis is performed for an objective function, such as minimizing the number of logic blocks (area), delay of interconnection, minimizing the power consumed, or making the implementation more testable. Logic synthesis is typically separated into two stages: technology-independent optimization, followed by a technology mapping. Technology mapping is the process of expressing a boolean network in terms of elements characteristic for a given technology (or device family). The aim of the symposium is to show all aspects of logic synthesis dedicated for Programmable Logic Devices.
NASA Technical Reports Server (NTRS)
Knox, Charles E.
1990-01-01
A primary flight display format was integrated with the flight guidance and control system logic in support of various flight tests conducted with the NASA Transport Systems Research Vehicle B-737-100 airplane. The functional operation of the flight guidance mode control panel and the corresponding primary flight display formats are presented.
Ruan, Xiaogang; Wang, Jinlian; Li, Hui; Perozzi, Rhoda E; Perozzi, Edmund F
2008-08-01
The ultimate goal of genomics research is to describe the network of molecules and interactions that govern all biological functions and disease processes in cells. Nonlinear interactions among genes in terms of their logic relationships play a key role for deciphering the networks of molecules that underlie cellular function. We present a method based on a graph coloring scheme and information theory to identify the gene expression network with lower and higher order logic interactions of genes. The analysis of oncogenes and suppressor genes from a colon cancer mRNA microarray dataset identifies a gene expression network with directionality and weights that reflects intracellular communication pathways. The success of the proposed method in mining hidden, complicated gene interactions and reliably interpreting experimental results suggests that the proposed method is a useful tool for understanding cancer systems. Extension of this method holds the potential to be fruitful for understanding other complex, nonsymmetric systems. PMID:18249040
Executing medical logic modules expressed in ArdenML using Drools.
Jung, Chai Young; Sward, Katherine A; Haug, Peter J
2012-01-01
The Arden Syntax is an HL7 standard language for representing medical knowledge as logic statements. Despite nearly 2 decades of availability, Arden Syntax has not been widely used. This has been attributed to the lack of a generally available compiler to implement the logic, to Arden's complex syntax, to the challenges of mapping local data to data references in the Medical Logic Modules (MLMs), or, more globally, to the general absence of decision support in healthcare computing. An XML representation (ArdenML) may partially address the technical challenges. MLMs created in ArdenML can be converted into executable files using standard transforms written in the Extensible Stylesheet Language Transformation (XSLT) language. As an example, we have demonstrated an approach to executing MLMs written in ArdenML using the Drools business rule management system. Extensions to ArdenML make it possible to generate a user interface through which an MLM developer can test for logical errors. PMID:22180871
Temporal Knowledge Expressed in Preschoolers' Descriptions of Familiar Activities.
ERIC Educational Resources Information Center
French, Lucia A.; Nelson, Katherine
Forty-three children, 2;11 to 5;6, described six familiar activities: making cookies, going to the grocery, having a birthday party, going to a restaurant, getting dressed, and having a fire drill. They described each event three times. The descriptions were elicited by initially asking "What happens when...?" or "What do you do when...?" and then…
Computerized logic design of digital circuits
NASA Technical Reports Server (NTRS)
Gussow, S.; Oglesby, R.
1974-01-01
Procedure performs all work required for logic design of digital counters or sequential circuits and simplification of Boolean expressions. Program provides simple, accurate, and comprehensive logic design capability to users both experienced and totally inexperienced in logic design
Choi, Jeeyae; Bakken, Suzanne; Lussier, Yves A; Mendonça, Eneida A
2006-01-01
Medical logic modules are a procedural representation for sharing task-specific knowledge for decision support systems. Based on the premise that clinicians may perceive object-oriented expressions as easier to read than procedural rules in Arden Syntax-based medical logic modules, we developed a method for improving the readability of medical logic modules. Two approaches were applied: exploiting the concept-oriented features of the Medical Entities Dictionary and building an executable Java program to replace Arden Syntax procedural expressions. The usability evaluation showed that 66% of participants successfully mapped all Arden Syntax rules to Java methods. These findings suggest that these approaches can play an essential role in the creation of human readable medical logic modules and can potentially increase the number of clinical experts who are able to participate in the creation of medical logic modules. Although our approaches are broadly applicable, we specifically discuss the relevance to concept-oriented nursing terminologies and automated processing of task-specific nursing knowledge. PMID:16849918
Introducing Exclusion Logic as a Deontic Logic
NASA Astrophysics Data System (ADS)
Evans, Richard
This paper introduces Exclusion Logic - a simple modal logic without negation or disjunction. We show that this logic has an efficient decision procedure. We describe how Exclusion Logic can be used as a deontic logic. We compare this deontic logic with Standard Deontic Logic and with more syntactically restricted logics.
Zadeh, L.A.
1988-01-01
The applicability of conventional mathematical analysis (based on the combination of two-valued logic and probability theory) to problems in which human judgment, perception, or emotions play significant roles is considered theoretically. It is shown that dispositional logic, a branch of fuzzy logic, has particular relevance to the common-sense reasoning typical of human decision-making. The concepts of dispositionality and usuality are defined analytically, and a dispositional conjunctive rule and dispositional modus ponens are derived. 7 references.
NASA Technical Reports Server (NTRS)
Le Balleur, J. C.
1988-01-01
The applicability of conventional mathematical analysis (based on the combination of two-valued logic and probability theory) to problems in which human judgment, perception, or emotions play significant roles is considered theoretically. It is shown that dispositional logic, a branch of fuzzy logic, has particular relevance to the common-sense reasoning typical of human decision-making. The concepts of dispositionality and usuality are defined analytically, and a dispositional conjunctive rule and dispositional modus ponens are derived.
ERIC Educational Resources Information Center
Dyrud, Marilyn A.
To make introducing logic to college students in speech and expository writing classes more interesting, letters to the editor can be used to teach logical fallacies. Letters to the editor are particularly useful because they give students a sense of the community they live in (issues, concerns, and the spectrum of opinion), they are easily…
Application of linear logic to simulation
NASA Astrophysics Data System (ADS)
Clarke, Thomas L.
1998-08-01
Linear logic, since its introduction by Girard in 1987 has proven expressive and powerful. Linear logic has provided natural encodings of Turing machines, Petri nets and other computational models. Linear logic is also capable of naturally modeling resource dependent aspects of reasoning. The distinguishing characteristic of linear logic is that it accounts for resources; two instances of the same variable are considered differently from a single instance. Linear logic thus must obey a form of the linear superposition principle. A proportion can be reasoned with only once, unless a special operator is applied. Informally, linear logic distinguishes two kinds of conjunction, two kinds of disjunction, and also introduces a modal storage operator that explicitly indicates propositions that can be reused. This paper discuses the application of linear logic to simulation. A wide variety of logics have been developed; in addition to classical logic, there are fuzzy logics, affine logics, quantum logics, etc. All of these have found application in simulations of one sort or another. The special characteristics of linear logic and its benefits for simulation will be discussed. Of particular interest is a connection that can be made between linear logic and simulated dynamics by using the concept of Lie algebras and Lie groups. Lie groups provide the connection between the exponential modal storage operators of linear logic and the eigen functions of dynamic differential operators. Particularly suggestive are possible relations between complexity result for linear logic and non-computability results for dynamical systems.
Quantum probabilistic logic programming
NASA Astrophysics Data System (ADS)
Balu, Radhakrishnan
2015-05-01
We describe a quantum mechanics based logic programming language that supports Horn clauses, random variables, and covariance matrices to express and solve problems in probabilistic logic. The Horn clauses of the language wrap random variables, including infinite valued, to express probability distributions and statistical correlations, a powerful feature to capture relationship between distributions that are not independent. The expressive power of the language is based on a mechanism to implement statistical ensembles and to solve the underlying SAT instances using quantum mechanical machinery. We exploit the fact that classical random variables have quantum decompositions to build the Horn clauses. We establish the semantics of the language in a rigorous fashion by considering an existing probabilistic logic language called PRISM with classical probability measures defined on the Herbrand base and extending it to the quantum context. In the classical case H-interpretations form the sample space and probability measures defined on them lead to consistent definition of probabilities for well formed formulae. In the quantum counterpart, we define probability amplitudes on Hinterpretations facilitating the model generations and verifications via quantum mechanical superpositions and entanglements. We cast the well formed formulae of the language as quantum mechanical observables thus providing an elegant interpretation for their probabilities. We discuss several examples to combine statistical ensembles and predicates of first order logic to reason with situations involving uncertainty.
Burrows, Anne M; Waller, Bridget M; Parr, Lisa A; Bonar, Christopher J
2006-01-01
Facial expressions are a critical mode of non-vocal communication for many mammals, particularly non-human primates. Although chimpanzees (Pan troglodytes) have an elaborate repertoire of facial signals, little is known about the facial expression (i.e. mimetic) musculature underlying these movements, especially when compared with some other catarrhines. Here we present a detailed description of the facial muscles of the chimpanzee, framed in comparative and phylogenetic contexts, through the dissection of preserved faces using a novel approach. The arrangement and appearance of muscles were noted and compared with previous studies of chimpanzees and with prosimians, cercopithecoids and humans. The results showed 23 mimetic muscles in P. troglodytes, including a thin sphincter colli muscle, reported previously only in adult prosimians, a bi-layered zygomaticus major muscle and a distinct risorius muscle. The presence of these muscles in such definition supports previous studies that describe an elaborate and highly graded facial communication system in this species that remains qualitatively different from that reported for other non-human primate species. In addition, there are minimal anatomical differences between chimpanzees and humans, contrary to conclusions from previous studies. These results amplify the importance of understanding facial musculature in primate taxa, which may hold great taxonomic value. PMID:16441560
NASA Technical Reports Server (NTRS)
Zadeh, Lofti A.
1988-01-01
The author presents a condensed exposition of some basic ideas underlying fuzzy logic and describes some representative applications. The discussion covers basic principles; meaning representation and inference; basic rules of inference; and the linguistic variable and its application to fuzzy control.
Computerized logic design of digital circuits
NASA Technical Reports Server (NTRS)
Sussow, S.; Oglesby, R.
1973-01-01
This manual presents a computer program that performs all the work required for the logic design of digital counters or sequential circuits and the simplification of Boolean logic expressions. The program provides both the experienced and inexperienced logic designer with a comprehensive logic design capability. The manual contains Boolean simplification and sequential design theory, detailed instructions for use of the program, a large number of illustrative design examples, and complete program documentation.
NASA Astrophysics Data System (ADS)
Merkle, Ralph C.; Drexler, K. Eric
1996-12-01
Helical logic is a theoretical proposal for a future computing technology using the presence or absence of individual electrons (or holes) to encode 1s and 0s. The electrons are constrained to move along helical paths, driven by a rotating electric field in which the entire circuit is immersed. The electric field remains roughly orthogonal to the major axis of the helix and confines each charge carrier to a fraction of a turn of a single helical loop, moving it like water in an Archimedean screw. Each loop could in principle hold an independent carrier, permitting high information density. One computationally universal logic operation involves two helices, one of which splits into two `descendant' helices. At the point of divergence, differences in the electrostatic potential resulting from the presence or absence of a carrier in the adjacent helix controls the direction taken by a carrier in the splitting helix. The reverse of this sequence can be used to merge two initially distinct helical paths into a single outgoing helical path without forcing a dissipative transition. Because these operations are both logically and thermodynamically reversible, energy dissipation can be reduced to extremely low levels. This is the first proposal known to the authors that combines thermodynamic reversibility with the use of single charge carriers. It is important to note that this proposal permits a single electron to switch another single electron, and does not require that many electrons be used to switch one electron. The energy dissipated per logic operation can very likely be reduced to less than 0957-4484/7/4/004/img5 at a temperature of 1 K and a speed of 10 GHz, though further analysis is required to confirm this. Irreversible operations, when required, can be easily implemented and should have a dissipation approaching the fundamental limit of 0957-4484/7/4/004/img6.
NASA Astrophysics Data System (ADS)
Pascal, Robert; Pross, Addy
2016-04-01
In this paper we propose a logical connection between the physical and biological worlds, one resting on a broader understanding of the stability concept. We propose that stability manifests two facets - time and energy, and that stability's time facet, expressed as persistence, is more general than its energy facet. That insight leads to the logical formulation of the Persistence Principle, which describes the general direction of material change in the universe, and which can be stated most simply as: nature seeks persistent forms. Significantly, the principle is found to express itself in two mathematically distinct ways: in the replicative world through Malthusian exponential growth, and in the `regular' physical/chemical world through Boltzmann's probabilistic considerations. By encompassing both `regular' and replicative worlds, the principle appears to be able to help reconcile two of the major scientific theories of the 19th century - the Second Law of Thermodynamics and Darwin's theory of evolution - within a single conceptual framework.
Hardware verification at Computational Logic, Inc.
NASA Technical Reports Server (NTRS)
Brock, Bishop C.; Hunt, Warren A., Jr.
1990-01-01
The following topics are covered in viewgraph form: (1) hardware verification; (2) Boyer-Moore logic; (3) core RISC; (4) the FM8502 fabrication, implementation specification, and pinout; (5) hardware description language; (6) arithmetic logic generator; (7) near term expected results; (8) present trends; (9) future directions; (10) collaborations and technology transfer; and (11) technology enablers.
Programmable Logic Application Notes
NASA Technical Reports Server (NTRS)
Katz, Richard
1999-01-01
This column will be provided each quarter as a source for reliability, radiation results, NASA capabilities, and other information on programmable logic devices and related applications. This quarter the focus is on some experimental data on low voltage drop out regulators to support mixed 5 and 3.3 volt systems. A discussion of the Small Explorer WIRE spacecraft will also be given. Lastly, we show take a first look at robust state machines in Hardware Description Languages (VHDL) and their use in critical systems. If you have information that you would like to submit or an area you would like discussed or researched, please give me a call or e-mail.
Crespo, Isaac; Krishna, Abhimanyu; Le Béchec, Antony; del Sol, Antonio
2013-01-01
The development of new high-throughput technologies enables us to measure genome-wide transcription levels, protein abundance, metabolite concentration, etc. Nevertheless, these experimental data are often noisy and incomplete, which hinders data analysis, modeling and prediction. Here, we propose a method to predict expression values of genes involved in stable cellular phenotypes from the expression values of the remaining genes in a literature-based gene regulatory network. The consistency between predicted and known stable states from experimental data is used to guide an iterative network pruning that contextualizes the network to the biological conditions under which the expression data were obtained. Using the contextualized network and the property of network stability we predict gene expression values missing from experimental data. The prediction method assumes a Boolean model to compute steady states of networks and an evolutionary algorithm to iteratively prune the networks. The evolutionary algorithm samples the probability distribution of positive feedback loops or positive circuits and individual interactions within the subpopulation of the best-pruned networks at each iteration. The resulting expression inference is based not only on previous knowledge about local connectivity but also on a global network property (stability), providing robustness in the predictions. PMID:22941654
A verification logic representation of indeterministic signal states
NASA Technical Reports Server (NTRS)
Gambles, J. W.; Windley, P. J.
1991-01-01
The integration of modern CAD tools with formal verification environments require translation from hardware description language to verification logic. A signal representation including both unknown state and a degree of strength indeterminacy is essential for the correct modeling of many VLSI circuit designs. A higher-order logic theory of indeterministic logic signals is presented.
Notes on stochastic (bio)-logic gates: computing with allosteric cooperativity
NASA Astrophysics Data System (ADS)
Agliari, Elena; Altavilla, Matteo; Barra, Adriano; Dello Schiavo, Lorenzo; Katz, Evgeny
2015-05-01
Recent experimental breakthroughs have finally allowed to implement in-vitro reaction kinetics (the so called enzyme based logic) which code for two-inputs logic gates and mimic the stochastic AND (and NAND) as well as the stochastic OR (and NOR). This accomplishment, together with the already-known single-input gates (performing as YES and NOT), provides a logic base and paves the way to the development of powerful biotechnological devices. However, as biochemical systems are always affected by the presence of noise (e.g. thermal), standard logic is not the correct theoretical reference framework, rather we show that statistical mechanics can work for this scope: here we formulate a complete statistical mechanical description of the Monod-Wyman-Changeaux allosteric model for both single and double ligand systems, with the purpose of exploring their practical capabilities to express noisy logical operators and/or perform stochastic logical operations. Mixing statistical mechanics with logics, and testing quantitatively the resulting findings on the available biochemical data, we successfully revise the concept of cooperativity (and anti-cooperativity) for allosteric systems, with particular emphasis on its computational capabilities, the related ranges and scaling of the involved parameters and its differences with classical cooperativity (and anti-cooperativity).
Notes on stochastic (bio)-logic gates: computing with allosteric cooperativity.
Agliari, Elena; Altavilla, Matteo; Barra, Adriano; Dello Schiavo, Lorenzo; Katz, Evgeny
2015-01-01
Recent experimental breakthroughs have finally allowed to implement in-vitro reaction kinetics (the so called enzyme based logic) which code for two-inputs logic gates and mimic the stochastic AND (and NAND) as well as the stochastic OR (and NOR). This accomplishment, together with the already-known single-input gates (performing as YES and NOT), provides a logic base and paves the way to the development of powerful biotechnological devices. However, as biochemical systems are always affected by the presence of noise (e.g. thermal), standard logic is not the correct theoretical reference framework, rather we show that statistical mechanics can work for this scope: here we formulate a complete statistical mechanical description of the Monod-Wyman-Changeaux allosteric model for both single and double ligand systems, with the purpose of exploring their practical capabilities to express noisy logical operators and/or perform stochastic logical operations. Mixing statistical mechanics with logics, and testing quantitatively the resulting findings on the available biochemical data, we successfully revise the concept of cooperativity (and anti-cooperativity) for allosteric systems, with particular emphasis on its computational capabilities, the related ranges and scaling of the involved parameters and its differences with classical cooperativity (and anti-cooperativity). PMID:25976626
It’s about This and That: A Description of Anaphoric Expressions in Clinical Text
Wang, Yan; Melton, Genevieve B.; Pakhomov, Serguei
2011-01-01
Although anaphoric expressions are very common in biomedical and clinical documents, little work has been done to systematically characterize their use in clinical text. Samples of ‘it’, ‘this’, and ‘that’ expressions occurring in inpatient clinical notes from four metropolitan hospitals were analyzed using a combination of semi-automated and manual annotation techniques. We developed a rule-based approach to filter potential non-referential expressions. A physician then manually annotated 1000 potential referential instances to determine referent status and the antecedent of each referent expression. A distributional analysis of the three referring expressions in the entire corpus of notes demonstrates a high prevalence of anaphora and large variance in distributions of referential expressions with different notes. Our results confirm that anaphoric expressions are common in clinical texts. Effective co-reference resolution with anaphoric expressions remains an important challenge in medical natural language processing research. PMID:22195211
It's about this and that: a description of anaphoric expressions in clinical text.
Wang, Yan; Melton, Genevieve B; Pakhomov, Serguei
2011-01-01
Although anaphoric expressions are very common in biomedical and clinical documents, little work has been done to systematically characterize their use in clinical text. Samples of 'it', 'this', and 'that' expressions occurring in inpatient clinical notes from four metropolitan hospitals were analyzed using a combination of semi-automated and manual annotation techniques. We developed a rule-based approach to filter potential non-referential expressions. A physician then manually annotated 1000 potential referential instances to determine referent status and the antecedent of each referent expression. A distributional analysis of the three referring expressions in the entire corpus of notes demonstrates a high prevalence of anaphora and large variance in distributions of referential expressions with different notes. Our results confirm that anaphoric expressions are common in clinical texts. Effective co-reference resolution with anaphoric expressions remains an important challenge in medical natural language processing research. PMID:22195211
Complementary transistor-transistor logic /CTTL/ - An approach to high-speed micropower logic.
NASA Technical Reports Server (NTRS)
Stehlin, R. A.; Niemann, G. W.
1972-01-01
Description of a new approach to micropower integrated circuits that is called complementary transistor-transistor logic (CTTL). This logic combines the inherent low standby power of a complementary inverter with the high speed of the TTL-type input. Results of monolithic fabricated circuits are presented. These circuits are shown to be equally adaptable to hybrid and discrete circuitry.
Quantificational logic of context
Buvac, Sasa
1996-12-31
In this paper we extend the Propositional Logic of Context, to the quantificational (predicate calculus) case. This extension is important in the declarative representation of knowledge for two reasons. Firstly, since contexts are objects in the semantics which can be denoted by terms in the language and which can be quantified over, the extension enables us to express arbitrary first-order properties of contexts. Secondly, since the extended language is no longer only propositional, we can express that an arbitrary predicate calculus formula is true in a context. The paper describes the syntax and the semantics of a quantificational language of context, gives a Hilbert style formal system, and outlines a proof of the system`s completeness.
ERIC Educational Resources Information Center
Lim, Kok Seng
2010-01-01
Introduction: This study aimed to investigate the errors made by 265 Form 2 male students in simplifying algebraic expressions. Method: A total of 265 Form 2 (Grade 7) male students were selected for this study. 10 high, medium and low ability students in each group were selected for the interviews. 40 items were administered to the respondents to…
Adaptive parallel logic networks
Martinez, T.R.; Vidal, J.J.
1988-02-01
This paper presents a novel class of special purpose processors referred to as ASOCS (adaptive self-organizing concurrent systems). Intended applications include adaptive logic devices, robotics, process control, system malfunction management, and in general, applications of logic reasoning. ASOCS combines massive parallelism with self-organization to attain a distributed mechanism for adaptation. The ASOCS approach is based on an adaptive network composed of many simple computing elements (nodes) which operate in a combinational and asynchronous fashion. Problem specification (programming) is obtained by presenting to the system if-then rules expressed as Boolean conjunctions. New rules are added incrementally. In the current model, when conflicts occur, precedence is given to the most recent inputs. With each rule, desired network response is simply presented to the system, following which the network adjusts itself to maintain consistency and parsimony of representation. Data processing and adaptation form two separate phases of operation. During processing, the network acts as a parallel hardware circuit. Control of the adaptive process is distributed among the network nodes and efficiently exploits parallelism.
Fuzzy logic controller optimization
Sepe, Jr., Raymond B; Miller, John Michael
2004-03-23
A method is provided for optimizing a rotating induction machine system fuzzy logic controller. The fuzzy logic controller has at least one input and at least one output. Each input accepts a machine system operating parameter. Each output produces at least one machine system control parameter. The fuzzy logic controller generates each output based on at least one input and on fuzzy logic decision parameters. Optimization begins by obtaining a set of data relating each control parameter to at least one operating parameter for each machine operating region. A model is constructed for each machine operating region based on the machine operating region data obtained. The fuzzy logic controller is simulated with at least one created model in a feedback loop from a fuzzy logic output to a fuzzy logic input. Fuzzy logic decision parameters are optimized based on the simulation.
NASA Astrophysics Data System (ADS)
Chiara, Maria Luisa Dalla; Giuntini, Roberto
1989-07-01
Paraconsistent quantum logics are weak forms of quantum logic, where the noncontradiction and the excluded-middle laws are violated. These logics find interesting applications in the operational approach to quantum mechanics. In this paper, we present an axiomatization, a Kripke-style, and an algebraic semantical characterization for two forms of paraconsistent quantum logic. Further developments are contained in Giuntini and Greuling's paper in this issue.
OncoLogic^{TM} - A Computer System to Evaluate the Carcinogenic Potential of Chemicals
OncoLogic^{TM} is a software program that evaluates the likelihood that a chemical may cause cancer. OncoLogic^{TM} has been peer reviewed and is being rele...
ERIC Educational Resources Information Center
Beller, Charley
2013-01-01
The study of definite descriptions has been a central part of research in linguistics and philosophy of language since Russell's seminal work "On Denoting" (Russell 1905). In that work Russell quickly dispatches analyses of denoting expressions with forms like "no man," "some man," "a man," and "every…
A Runs-and-Systems Semantics for Logics of Announcements
NASA Astrophysics Data System (ADS)
Pucella, Riccardo; Sadrzadeh, Mehrnoosh
Logics of announcements are logics of knowledge to reason about agents that communicate by broadcasting interpreted messages. These logics are typically given a semantics in terms of updatable Kripke structures, which tend to be abstract. We revisit the semantics of logics of announcements and develop a concrete semantics using runs and systems. The advantage is that we can devise models that capture scenarios without having to express properties of those scenarios within the logic itself. In this concrete setting, we study honesty as well as belief in the presence of announcements that are not broadcast to all agents in a system.
Cosmic logic: a computational model
NASA Astrophysics Data System (ADS)
Vanchurin, Vitaly
2016-02-01
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.
NASA Technical Reports Server (NTRS)
Preston, K., Jr.
1972-01-01
The characteristics of the holographic logic computer are discussed. The holographic operation is reviewed from the Fourier transform viewpoint, and the formation of holograms for use in performing digital logic are described. The operation of the computer with an experiment in which the binary identity function is calculated is discussed along with devices for achieving real-time performance. An application in pattern recognition using neighborhood logic is presented.
Foundations of logic programming
Lloyd, J.W.
1987-01-01
This is the second edition of the first book to give an account of the mathematical foundations of Logic Programming. Its purpose is to collect the basic theoretical results of Logic Programming, which have previously only been available in widely scattered research papers. In addition to presenting the technical results, the book also contains many illustrative examples. Many of the examples and problems are part of the folklore of Logic Programming and are not easily obtainable elsewhere.
Digital Microfluidic Logic Gates
NASA Astrophysics Data System (ADS)
Zhao, Yang; Xu, Tao; Chakrabarty, Krishnendu
Microfluidic computing is an emerging application for microfluidics technology. We propose microfluidic logic gates based on digital microfluidics. Using the principle of electrowetting-on-dielectric, AND, OR, NOT and XOR gates are implemented through basic droplet-handling operations such as transporting, merging and splitting. The same input-output interpretation enables the cascading of gates to create nontrivial computing systems. We present a potential application for microfluidic logic gates by implementing microfluidic logic operations for on-chip HIV test.
Ferrite logic reliability study
NASA Technical Reports Server (NTRS)
Baer, J. A.; Clark, C. B.
1973-01-01
Development and use of digital circuits called all-magnetic logic are reported. In these circuits the magnetic elements and their windings comprise the active circuit devices in the logic portion of a system. The ferrite logic device belongs to the all-magnetic class of logic circuits. The FLO device is novel in that it makes use of a dual or bimaterial ferrite composition in one physical ceramic body. This bimaterial feature, coupled with its potential for relatively high speed operation, makes it attractive for high reliability applications. (Maximum speed of operation approximately 50 kHz.)
Electrically reconfigurable logic array
NASA Technical Reports Server (NTRS)
Agarwal, R. K.
1982-01-01
To compose the complicated systems using algorithmically specialized logic circuits or processors, one solution is to perform relational computations such as union, division and intersection directly on hardware. These relations can be pipelined efficiently on a network of processors having an array configuration. These processors can be designed and implemented with a few simple cells. In order to determine the state-of-the-art in Electrically Reconfigurable Logic Array (ERLA), a survey of the available programmable logic array (PLA) and the logic circuit elements used in such arrays was conducted. Based on this survey some recommendations are made for ERLA devices.
NASA Technical Reports Server (NTRS)
Howard, Ayanna
2005-01-01
The Fuzzy Logic Engine is a software package that enables users to embed fuzzy-logic modules into their application programs. Fuzzy logic is useful as a means of formulating human expert knowledge and translating it into software to solve problems. Fuzzy logic provides flexibility for modeling relationships between input and output information and is distinguished by its robustness with respect to noise and variations in system parameters. In addition, linguistic fuzzy sets and conditional statements allow systems to make decisions based on imprecise and incomplete information. The user of the Fuzzy Logic Engine need not be an expert in fuzzy logic: it suffices to have a basic understanding of how linguistic rules can be applied to the user's problem. The Fuzzy Logic Engine is divided into two modules: (1) a graphical-interface software tool for creating linguistic fuzzy sets and conditional statements and (2) a fuzzy-logic software library for embedding fuzzy processing capability into current application programs. The graphical- interface tool was developed using the Tcl/Tk programming language. The fuzzy-logic software library was written in the C programming language.
Programmable Logic Controllers.
ERIC Educational Resources Information Center
Insolia, Gerard; Anderson, Kathleen
This document contains a 40-hour course in programmable logic controllers (PLC), developed for a business-industry technology resource center for firms in eastern Pennsylvania by Northampton Community College. The 10 units of the course cover the following: (1) introduction to programmable logic controllers; (2) DOS primer; (3) prerequisite…
AROUSAL AND LOGICAL INFERENCE.
ERIC Educational Resources Information Center
KOEN, FRANK
THE PURPOSE OF THE EXPERIMENT WAS TO DETERMINE THE DEGREE TO WHICH PHYSIOLOGICAL AROUSAL, AS INDEXED BY THE GRASON STADLER TYPE OPERANT CONDITIONING APPARATUS (GSR), IS RELATED TO THE ACCURACY OF LOGICAL REASONING. THE STIMULI WERE 12 SYLLOGISMS, THREE OF EACH OF FOUR DIFFERENT LOGICAL FORMS. THE 14 SUBJECTS (SS) INDICATED THEIR AGREEMENT OR…
Fundamentals of Digital Logic.
ERIC Educational Resources Information Center
Noell, Monica L.
This course is designed to prepare electronics personnel for further training in digital techniques, presenting need to know information that is basic to any maintenance course on digital equipment. It consists of seven study units: (1) binary arithmetic; (2) boolean algebra; (3) logic gates; (4) logic flip-flops; (5) nonlogic circuits; (6)…
Logic via Computer Programming.
ERIC Educational Resources Information Center
Wieschenberg, Agnes A.
This paper proposed the question "How do we teach logical thinking and sophisticated mathematics to unsophisticated college students?" One answer among many is through the writing of computer programs. The writing of computer algorithms is mathematical problem solving and logic in disguise and it may attract students who would otherwise stop…
ERIC Educational Resources Information Center
Yopp, David
2010-01-01
Understanding logical necessity is an important component of proof and reasoning for teachers of grades K-8. The ability to determine exactly where young students' arguments are faulty offers teachers the chance to give youngsters feedback as they progress toward writing mathematically valid deductive proofs. As defined, logical necessity is the…
Microelectromechanical reprogrammable logic device
Hafiz, M. A. A.; Kosuru, L.; Younis, M. I.
2016-01-01
In modern computing, the Boolean logic operations are set by interconnect schemes between the transistors. As the miniaturization in the component level to enhance the computational power is rapidly approaching physical limits, alternative computing methods are vigorously pursued. One of the desired aspects in the future computing approaches is the provision for hardware reconfigurability at run time to allow enhanced functionality. Here we demonstrate a reprogrammable logic device based on the electrothermal frequency modulation scheme of a single microelectromechanical resonator, capable of performing all the fundamental 2-bit logic functions as well as n-bit logic operations. Logic functions are performed by actively tuning the linear resonance frequency of the resonator operated at room temperature and under modest vacuum conditions, reprogrammable by the a.c.-driving frequency. The device is fabricated using complementary metal oxide semiconductor compatible mass fabrication process, suitable for on-chip integration, and promises an alternative electromechanical computing scheme. PMID:27021295
NASA Astrophysics Data System (ADS)
Malhas, Othman Qasim
1993-10-01
The concept of “abacus logic” has recently been developed by the author (Malhas, n.d.). In this paper the relation of abacus logic to the concept of fuzziness is explored. It is shown that if a certain “regularity” condition is met, concepts from fuzzy set theory arise naturally within abacus logics. In particular it is shown that every abacus logic then has a “pre-Zadeh orthocomplementation”. It is also shown that it is then possible to associate a fuzzy set with every proposition of abacus logic and that the collection of all such sets satisfies natural conditions expected in systems of fuzzy logic. Finally, the relevance to quantum mechanics is discussed.
Microelectromechanical reprogrammable logic device.
Hafiz, M A A; Kosuru, L; Younis, M I
2016-01-01
In modern computing, the Boolean logic operations are set by interconnect schemes between the transistors. As the miniaturization in the component level to enhance the computational power is rapidly approaching physical limits, alternative computing methods are vigorously pursued. One of the desired aspects in the future computing approaches is the provision for hardware reconfigurability at run time to allow enhanced functionality. Here we demonstrate a reprogrammable logic device based on the electrothermal frequency modulation scheme of a single microelectromechanical resonator, capable of performing all the fundamental 2-bit logic functions as well as n-bit logic operations. Logic functions are performed by actively tuning the linear resonance frequency of the resonator operated at room temperature and under modest vacuum conditions, reprogrammable by the a.c.-driving frequency. The device is fabricated using complementary metal oxide semiconductor compatible mass fabrication process, suitable for on-chip integration, and promises an alternative electromechanical computing scheme. PMID:27021295
Microelectromechanical reprogrammable logic device
NASA Astrophysics Data System (ADS)
Hafiz, M. A. A.; Kosuru, L.; Younis, M. I.
2016-03-01
In modern computing, the Boolean logic operations are set by interconnect schemes between the transistors. As the miniaturization in the component level to enhance the computational power is rapidly approaching physical limits, alternative computing methods are vigorously pursued. One of the desired aspects in the future computing approaches is the provision for hardware reconfigurability at run time to allow enhanced functionality. Here we demonstrate a reprogrammable logic device based on the electrothermal frequency modulation scheme of a single microelectromechanical resonator, capable of performing all the fundamental 2-bit logic functions as well as n-bit logic operations. Logic functions are performed by actively tuning the linear resonance frequency of the resonator operated at room temperature and under modest vacuum conditions, reprogrammable by the a.c.-driving frequency. The device is fabricated using complementary metal oxide semiconductor compatible mass fabrication process, suitable for on-chip integration, and promises an alternative electromechanical computing scheme.
Regulatory Conformance Checking: Logic and Logical Form
ERIC Educational Resources Information Center
Dinesh, Nikhil
2010-01-01
We consider the problem of checking whether an organization conforms to a body of regulation. Conformance is studied in a runtime verification setting. The regulation is translated to a logic, from which we synthesize monitors. The monitors are evaluated as the state of an organization evolves over time, raising an alarm if a violation is…
Zargham, M.R.
1995-06-01
Recently, fuzzy logic has been applied to many areas, such as process control, image understanding, robots, expert systems, and decision support systems. This paper will explain the basic concepts of fuzzy logic and its application in different fields. The steps to design a control system will be explained in detail. Fuzzy control is the first successful industrial application of fuzzy logic. A fuzzy controller is able to control systems which previously could only be controlled by skilled operators. In recent years Japan has achieved significant progress in this area and has applied it to variety of products such as cruise control for cars, video cameras, rice cookers, washing machines, etc.
Tanida, J.; Ichioka, Y.
1983-01-01
A simple method for optically implementing digital logic gates in parallel has been developed. Parallel logic gates can be achieved by using a lensless shadow-casting system with a light emitting diode array as an incoherent light source. All the sixteen logic functions for two binary variables, which are the fundamental computations of Boolean algebra, can be simply realised in parallel with these gates by changing the switching modes of a led array. Parallel computation structures of the developed optical digital array processor are demonstrated by implementing pattern logics for two binary images with high space-bandwidth product. Applications of the proposed method to parallel shift operation of the image, differentiation, and processing of gray-level image are shown. 9 references.
Acquisition of teleological descriptions
NASA Astrophysics Data System (ADS)
Franke, David W.
1992-03-01
Teleology descriptions capture the purpose of an entity, mechanism, or activity with which they are associated. These descriptions can be used in explanation, diagnosis, and design reuse. We describe a technique for acquiring teleological descriptions expressed in the teleology language TeD. Acquisition occurs during design by observing design modifications and design verification. We demonstrate the acquisition technique in an electronic circuit design.
Logical reformulation of quantum mechanics. I. Foundations
Omnes, R.
1988-11-01
The basic rules of quantum mechanics are reformulated. They deal primarily with individual systems and do not assume that every ket may represent a physical state. The customary kinematic and dynamic rules then allow to construct consistent Boolean logics describing the history of a system, following essentially Griffiths' proposal. Logical implication is defined within these logics, the multiplicity of which reflects the complementary principle. Only one interpretive rule of quantum mechanics is necessary in such a framework. It states that these logics provide bona fide foundations for the description of a quantum system and for reasoning about it. One attempts to build up classical physics, including classical logic, on these quantum foundations. The resulting theory of measurement needs not to state a priori that the eigenvalues of an observable have to be the results of individual measurements nor to assume wave packet reduction. Both these properties can be obtained as consequences of the basic rules. One also needs not to postulate that every observable is measurable, even in principle. A proposition calculus is obtained, allowing in principle the replacement of the discussion of problems concerned with the practical interpretation of experiments by due calculations.
HDL to verification logic translator
NASA Astrophysics Data System (ADS)
Gambles, J. W.; Windley, P. J.
The increasingly higher number of transistors possible in VLSI circuits compounds the difficulty in insuring correct designs. As the number of possible test cases required to exhaustively simulate a circuit design explodes, a better method is required to confirm the absence of design faults. Formal verification methods provide a way to prove, using logic, that a circuit structure correctly implements its specification. Before verification is accepted by VLSI design engineers, the stand alone verification tools that are in use in the research community must be integrated with the CAD tools used by the designers. One problem facing the acceptance of formal verification into circuit design methodology is that the structural circuit descriptions used by the designers are not appropriate for verification work and those required for verification lack some of the features needed for design. We offer a solution to this dilemma: an automatic translation from the designers' HDL models into definitions for the higher-ordered logic (HOL) verification system. The translated definitions become the low level basis of circuit verification which in turn increases the designer's confidence in the correctness of higher level behavioral models.
HDL to verification logic translator
NASA Technical Reports Server (NTRS)
Gambles, J. W.; Windley, P. J.
1992-01-01
The increasingly higher number of transistors possible in VLSI circuits compounds the difficulty in insuring correct designs. As the number of possible test cases required to exhaustively simulate a circuit design explodes, a better method is required to confirm the absence of design faults. Formal verification methods provide a way to prove, using logic, that a circuit structure correctly implements its specification. Before verification is accepted by VLSI design engineers, the stand alone verification tools that are in use in the research community must be integrated with the CAD tools used by the designers. One problem facing the acceptance of formal verification into circuit design methodology is that the structural circuit descriptions used by the designers are not appropriate for verification work and those required for verification lack some of the features needed for design. We offer a solution to this dilemma: an automatic translation from the designers' HDL models into definitions for the higher-ordered logic (HOL) verification system. The translated definitions become the low level basis of circuit verification which in turn increases the designer's confidence in the correctness of higher level behavioral models.
The Impact of Fuzzy Logic on Student Press Law.
ERIC Educational Resources Information Center
McCool, Lauralee; Plopper, Bruce L.
2001-01-01
Uses the relatively new science of fuzzy logic to review lower court and appellate court decisions from the last four decades regarding free expression in student publications. Finds pronounced effects, showing that fuzzy sets inherently favor administrators, while students show a strikingly high win/loss ratio when courts avoid fuzzy logic. (SR)
Designing a Software Tool for Fuzzy Logic Programming
NASA Astrophysics Data System (ADS)
Abietar, José M.; Morcillo, Pedro J.; Moreno, Ginés
2007-12-01
Fuzzy Logic Programming is an interesting and still growing research area that agglutinates the efforts for introducing fuzzy logic into logic programming (LP), in order to incorporate more expressive resources on such languages for dealing with uncertainty and approximated reasoning. The multi-adjoint logic programming approach is a recent and extremely flexible fuzzy logic paradigm for which, unfortunately, we have not found practical tools implemented so far. In this work, we describe a prototype system which is able to directly translate fuzzy logic programs into Prolog code in order to safely execute these residual programs inside any standard Prolog interpreter in a completely transparent way for the final user. We think that the development of such fuzzy languages and programing tools might play an important role in the design of advanced software applications for computational physics, chemistry, mathematics, medicine, industrial control and so on.
Mechanical passive logic module
NASA Astrophysics Data System (ADS)
Chattopadhyay, Tanay; Caulfield, H. John
2015-02-01
Nothing from nothing gives simple simile, but something from nothing is an interesting and challenging task. Adolf Lohmann once proposed 'do nothing machine' in optics, which only copies input to output. Passive logic module (PALM) is a special type of 'do nothing machine' which can converts inputs into one of 16 possible binary outputs. This logic module is not like the conventional irreversible one. It is a simple type of reversible Turing machine. In this manuscript we discussed and demonstrated PALM using mechanical movement of plane mirrors. Also we discussed the theoretical model of micro electro mechanical system (MEMS) based PALM in this manuscript. It may have several valuable properties such as passive operation (no need for nonlinear elements as other logic device require) and modular logic (one device implementing any Boolean logic function with simple internal changes). The result is obtained from the demonstration by only looking up the output. No calculation is required to get the result. Not only that, PALM is a simple type of the famous 'billiard ball machine', which also discussed in this manuscript.
Runtime Analysis of Linear Temporal Logic Specifications
NASA Technical Reports Server (NTRS)
Giannakopoulou, Dimitra; Havelund, Klaus
2001-01-01
This report presents an approach to checking a running program against its Linear Temporal Logic (LTL) specifications. LTL is a widely used logic for expressing properties of programs viewed as sets of executions. Our approach consists of translating LTL formulae to finite-state automata, which are used as observers of the program behavior. The translation algorithm we propose modifies standard LTL to B chi automata conversion techniques to generate automata that check finite program traces. The algorithm has been implemented in a tool, which has been integrated with the generic JPaX framework for runtime analysis of Java programs.
Diagnosable structured logic array
NASA Technical Reports Server (NTRS)
Whitaker, Sterling (Inventor); Miles, Lowell (Inventor); Gambles, Jody (Inventor); Maki, Gary K. (Inventor)
2009-01-01
A diagnosable structured logic array and associated process is provided. A base cell structure is provided comprising a logic unit comprising a plurality of input nodes, a plurality of selection nodes, and an output node, a plurality of switches coupled to the selection nodes, where the switches comprises a plurality of input lines, a selection line and an output line, a memory cell coupled to the output node, and a test address bus and a program control bus coupled to the plurality of input lines and the selection line of the plurality of switches. A state on each of the plurality of input nodes is verifiably loaded and read from the memory cell. A trusted memory block is provided. The associated process is provided for testing and verifying a plurality of truth table inputs of the logic unit.
Benchmarking emerging logic devices
NASA Astrophysics Data System (ADS)
Nikonov, Dmitri
2014-03-01
As complementary metal-oxide-semiconductor field-effect transistors (CMOS FET) are being scaled to ever smaller sizes by the semiconductor industry, the demand is growing for emerging logic devices to supplement CMOS in various special functions. Research directions and concepts of such devices are overviewed. They include tunneling, graphene based, spintronic devices etc. The methodology to estimate future performance of emerging (beyond CMOS) devices and simple logic circuits based on them is explained. Results of benchmarking are used to identify more promising concepts and to map pathways for improvement of beyond CMOS computing.
NASA Technical Reports Server (NTRS)
Agarwal, R. K.
1983-01-01
The source code for the SPICE 2 program was deblocked in order to isolate and compile the subroutine in an effort to provide a software simulation of discrete and combinatorial electronic components. Incompatibilities between the UNIVAC 1180 FORTRAN and the Sigma V CP-V FORTRAN 4 were resolved. The SPICE 2 model is to be used to determine gate and fan-out delays, logic state conditions, and signal race conditions for transistor array elements and circuit logic to be patterned in the (SPI) 7101 CMOS silicon gate semicustom array. The simulator is to be operable from the CP-V time sharing terminals.
Logical elements in living cells.
Kremen, A
1984-11-01
Recognition processes with enhanced accuracy (as performed by structures like enzymes or ribosomes) are investigated using elementary ideas of statistical mechanics and related concepts of thermodynamics. The analysis starts from a formal definition of recognition and provides a correspondence with appropriate physical properties of the macromolecular logical elements. Transitions of the recognizing system between different modifications are a necessary feature of a more exacting recognition process. Rearrangement steps provide the process with higher accuracy by performing two physical operations: (1) rearranging the phase space of the system so that the "correct" states be better separated from the "wrong" states and the probability of occupation of the "correct" states be enhanced, (2) directing the process toward the more favourable modifications thus formed. Both operations are related to changes in the physical properties of the recognizing system. These changes can be expressed as differences of macromolecular Gibbs energy levels; if ligand binding or release participate in a step, directivity of the step depends also on the actual chemical potentials of the ligands in solution. The two operations just mentioned resemble two basic operations known to be necessary in electronic digital networks: directivity of control and signal standardization. An analysis of the entire reaction catalysed by a macromolecular logical element takes into account the requirements imposed by the logical functions as well as the need that the chemical potential of the product be not restricted to very low values. To satisfy these conditions, the reaction must be supported by a so-called non-specific reaction, usually implemented by the cleavage reaction of a nucleoside triphosphate. PMID:6513567
Molecular implementation of simple logic programs
NASA Astrophysics Data System (ADS)
Ran, Tom; Kaplan, Shai; Shapiro, Ehud
2009-11-01
Autonomous programmable computing devices made of biomolecules could interact with a biological environment and be used in future biological and medical applications. Biomolecular implementations of finite automata and logic gates have already been developed. Here, we report an autonomous programmable molecular system based on the manipulation of DNA strands that is capable of performing simple logical deductions. Using molecular representations of facts such as Man(Socrates) and rules such as Mortal(X) <-- Man(X) (Every Man is Mortal), the system can answer molecular queries such as Mortal(Socrates)? (Is Socrates Mortal?) and Mortal(X)? (Who is Mortal?). This biomolecular computing system compares favourably with previous approaches in terms of expressive power, performance and precision. A compiler translates facts, rules and queries into their molecular representations and subsequently operates a robotic system that assembles the logical deductions and delivers the result. This prototype is the first simple programming language with a molecular-scale implementation.
Molecular implementation of simple logic programs.
Ran, Tom; Kaplan, Shai; Shapiro, Ehud
2009-10-01
Autonomous programmable computing devices made of biomolecules could interact with a biological environment and be used in future biological and medical applications. Biomolecular implementations of finite automata and logic gates have already been developed. Here, we report an autonomous programmable molecular system based on the manipulation of DNA strands that is capable of performing simple logical deductions. Using molecular representations of facts such as Man(Socrates) and rules such as Mortal(X) <-- Man(X) (Every Man is Mortal), the system can answer molecular queries such as Mortal(Socrates)? (Is Socrates Mortal?) and Mortal(X)? (Who is Mortal?). This biomolecular computing system compares favourably with previous approaches in terms of expressive power, performance and precision. A compiler translates facts, rules and queries into their molecular representations and subsequently operates a robotic system that assembles the logical deductions and delivers the result. This prototype is the first simple programming language with a molecular-scale implementation. PMID:19809454
Anatomy Ontology Matching Using Markov Logic Networks
Li, Chunhua; Zhao, Pengpeng; Wu, Jian; Cui, Zhiming
2016-01-01
The anatomy of model species is described in ontologies, which are used to standardize the annotations of experimental data, such as gene expression patterns. To compare such data between species, we need to establish relationships between ontologies describing different species. Ontology matching is a kind of solutions to find semantic correspondences between entities of different ontologies. Markov logic networks which unify probabilistic graphical model and first-order logic provide an excellent framework for ontology matching. We combine several different matching strategies through first-order logic formulas according to the structure of anatomy ontologies. Experiments on the adult mouse anatomy and the human anatomy have demonstrated the effectiveness of proposed approach in terms of the quality of result alignment. PMID:27382498
Radiation tolerant combinational logic cell
NASA Technical Reports Server (NTRS)
Maki, Gary R. (Inventor); Gambles, Jody W. (Inventor); Whitaker, Sterling (Inventor)
2009-01-01
A system has a reduced sensitivity to Single Event Upset and/or Single Event Transient(s) compared to traditional logic devices. In a particular embodiment, the system includes an input, a logic block, a bias stage, a state machine, and an output. The logic block is coupled to the input. The logic block is for implementing a logic function, receiving a data set via the input, and generating a result f by applying the data set to the logic function. The bias stage is coupled to the logic block. The bias stage is for receiving the result from the logic block and presenting it to the state machine. The state machine is coupled to the bias stage. The state machine is for receiving, via the bias stage, the result generated by the logic block. The state machine is configured to retain a state value for the system. The state value is typically based on the result generated by the logic block. The output is coupled to the state machine. The output is for providing the value stored by the state machine. Some embodiments of the invention produce dual rail outputs Q and Q'. The logic block typically contains combinational logic and is similar, in size and transistor configuration, to a conventional CMOS combinational logic design. However, only a very small portion of the circuits of these embodiments, is sensitive to Single Event Upset and/or Single Event Transients.
Programmable Logic Application Notes
NASA Technical Reports Server (NTRS)
Katz, Richard
2000-01-01
This column will be provided each quarter as a source for reliability, radiation results, NASA capabilities, and other information on programmable logic devices and related applications. This quarter will start a series of notes concentrating on analysis techniques with this issues section discussing worst-case analysis requirements.
Temporal logics meet telerobotics
NASA Technical Reports Server (NTRS)
Rutten, Eric; Marce, Lionel
1989-01-01
The specificity of telerobotics being the presence of a human operator, decision assistance tools are necessary for the operator, especially in hostile environments. In order to reduce execution hazards due to a degraded ability for quick and efficient recovery of unexpected dangerous situations, it is of importance to have the opportunity, amongst others, to simulate the possible consequences of a plan before its actual execution, in order to detect these problematic situations. Hence the idea of providing the operator with a simulator enabling him to verify the temporal and logical coherence of his plans. Therefore, the power of logical formalisms is used for representation and deduction purposes. Starting from the class of situations that are represented, a STRIPS (the STanford Research Institute Problem Solver)-like formalism and its underlying logic are adapted to the simulation of plans of actions in time. The choice of a temporal logic enables to build a world representation, on which the effects of plans, grouping actions into control structures, will be transcribed by the simulation, resulting in a verdict and information about the plan's coherence.
Programmable Logic Application Notes
NASA Technical Reports Server (NTRS)
Katz, Richard; Day, John H. (Technical Monitor)
2001-01-01
This report will be provided each quarter as a source for reliability, radiation results, NASA capabilities, and other information on programmable logic devices and related applications. This quarter will continue a series of notes concentrating on analysis techniques with this issue's section discussing the use of Root-Sum-Square calculations for digital delays.
ERIC Educational Resources Information Center
Straumanis, Joan
A major problem in teaching symbolic logic is that of providing individualized and early feedback to students who are learning to do proofs. To overcome this difficulty, a computer program was developed which functions as a line-by-line proof checker in Sentential Calculus. The program, DEMON, first evaluates any statement supplied by the student…
Fuzzy logic based robotic controller
NASA Technical Reports Server (NTRS)
Attia, F.; Upadhyaya, M.
1994-01-01
Existing Proportional-Integral-Derivative (PID) robotic controllers rely on an inverse kinematic model to convert user-specified cartesian trajectory coordinates to joint variables. These joints experience friction, stiction, and gear backlash effects. Due to lack of proper linearization of these effects, modern control theory based on state space methods cannot provide adequate control for robotic systems. In the presence of loads, the dynamic behavior of robotic systems is complex and nonlinear, especially where mathematical modeling is evaluated for real-time operators. Fuzzy Logic Control is a fast emerging alternative to conventional control systems in situations where it may not be feasible to formulate an analytical model of the complex system. Fuzzy logic techniques track a user-defined trajectory without having the host computer to explicitly solve the nonlinear inverse kinematic equations. The goal is to provide a rule-based approach, which is closer to human reasoning. The approach used expresses end-point error, location of manipulator joints, and proximity to obstacles as fuzzy variables. The resulting decisions are based upon linguistic and non-numerical information. This paper presents a solution to the conventional robot controller which is independent of computationally intensive kinematic equations. Computer simulation results of this approach as obtained from software implementation are also discussed.
Sandia ATM SONET Interface Logic
Energy Science and Technology Software Center (ESTSC)
1994-07-21
SASIL is used to program the EPLD's (Erasable Programmable Logic Devices) and PAL's (Programmable Array Logic) that make up a large percentage of the Sandia ATM SONET Interface (OC3 version) for the INTEL Paragon.
A biochemical logic gate using an enzyme and its inhibitor. Part II: The logic gate.
Sivan, Sarit; Tuchman, Samuel; Lotan, Noah
2003-06-01
Enzyme-Based Logic Gates (ENLOGs) are key components in bio-molecular systems for information processing. This report and the previous one in this series address the characterization of two bio-molecular switching elements, namely the alpha-chymotrypsin (alphaCT) derivative p-phenylazobenzoyl-alpha-chymotrypsin (PABalphaCT) and its inhibitor (proflavine), as well as their assembly into a logic gate. The experimental output of the proposed system is expressed in terms of enzymic activity and this was translated into logic output (i.e. "1" or "0") relative to a predetermined threshold value. We have found that an univalent link exists between the dominant isomers of PABalphaCT (cis or trans), the dominant form of either acridine (proflavine) or acridan and the logic output of the system. Thus, of all possible combinations, only the trans-PABalphaCT and the acridan lead to an enzymic activity that can be defined as logic output "1". The system operates under the rules of Boolean algebra and performs as an "AND" logic gate. PMID:12753934
Conditional Logic and Primary Children.
ERIC Educational Resources Information Center
Ennis, Robert H.
Conditional logic, as interpreted in this paper, means deductive logic characterized by "if-then" statements. This study sought to investigate the knowledge of conditional logic possessed by primary children and to test their readiness to learn such concepts. Ninety students were designated the experimental group and participated in a 15-week…
Quantum logics and chemical kinetics
NASA Astrophysics Data System (ADS)
Ivanov, C. I.
1981-06-01
A statistical theory of chemical kinetics is presented based on the quantum logical concept of chemical observables. The apparatus of Boolean algebra B is applied for the construction of appropriate composition polynomials referring to any stipulated arrangement of the atomic constituents. A physically motivated probability measure μ( F) is introduced on the field B of chemical observables, which considers the occurrence of the yes response of a given F ɛ B. The equations for the time evolution of the species density operators and the master equations for the corresponding number densities are derived. The general treatment is applied to a superposition of elementary substitution reactions (AB) α + C ⇄ (AC) β + B. The expressions for the reaction rate coefficients are established.
A Logic for Qualified Syllogisms
NASA Astrophysics Data System (ADS)
Schwartz, Daniel G.
In various works, L.A. Zadeh has introduced fuzzy quantifiers, fuzzy usuality modifiers, and fuzzy likelihood modifiers. This paper provides these notions with a unified semantics and uses this to define a formal logic capable of expressing and validating arguments such as 'Most birds can fly; Tweety is a bird; therefore, it is likely that Tweety can fly'. In effect, these are classical Aristotelean syllogisms that have been "qualified" through the use of fuzzy quantifiers. It is briefly outlined how these, together with some likelihood combination rules, can be used to address some well-known problems in the theory of nonmonotonic reasoning. The work is aimed at future applications in expert systems and robotics, including both hardware and software agents.
Programmable Logic Application Notes
NASA Technical Reports Server (NTRS)
Katz, Richard
1998-01-01
This column will be provided each quarter as a source for reliability, radiation results, NASA capabilities, and other information on programmable logic devices and related applications. This quarter's column will include some announcements and some recent radiation test results and evaluations of interest. Specifically, the following topics will be covered: the Military and Aerospace Applications of Programmable Devices and Technologies Conference to be held at GSFC in September, 1998, proton test results, heavy ion test results, and some total dose results.
Programmable Logic Application Notes
NASA Technical Reports Server (NTRS)
Katz, Richard
1998-01-01
This column will be provided each quarter as a source for reliability, radiation results, NASA capabilities, and other information on programmable logic devices and related applications. This quarter's column will include some announcements and some recent radiation test results and evaluations of interest. Specifically, the following topics will be covered: the Military and Aerospace Applications of Programmable Devices and Technologies Conference to be held at GSFC in September, 1998, proton test results, and some total dose results.
Synthetic circuits integrating logic and memory in living cells.
Siuti, Piro; Yazbek, John; Lu, Timothy K
2013-05-01
Logic and memory are essential functions of circuits that generate complex, state-dependent responses. Here we describe a strategy for efficiently assembling synthetic genetic circuits that use recombinases to implement Boolean logic functions with stable DNA-encoded memory of events. Application of this strategy allowed us to create all 16 two-input Boolean logic functions in living Escherichia coli cells without requiring cascades comprising multiple logic gates. We demonstrate long-term maintenance of memory for at least 90 cell generations and the ability to interrogate the states of these synthetic devices with fluorescent reporters and PCR. Using this approach we created two-bit digital-to-analog converters, which should be useful in biotechnology applications for encoding multiple stable gene expression outputs using transient inputs of inducers. We envision that this integrated logic and memory system will enable the implementation of complex cellular state machines, behaviors and pathways for therapeutic, diagnostic and basic science applications. PMID:23396014
Kompa, K. L.; Levine, R. D.
2001-01-01
We propose a scheme for molecule-based information processing by combining well-studied spectroscopic techniques and recent results from chemical dynamics. Specifically it is discussed how optical transitions in single molecules can be used to rapidly perform classical (Boolean) logical operations. In the proposed way, a restricted number of states in a single molecule can act as a logical gate equivalent to at least two switches. It is argued that the four-level scheme can also be used to produce gain, because it allows an inversion, and not only a switching ability. The proposed scheme is quantum mechanical in that it takes advantage of the discrete nature of the energy levels but, we here discuss the temporal evolution, with the use of the populations only. On a longer time range we suggest that the same scheme could be extended to perform quantum logic, and a tentative suggestion, based on an available experiment, is discussed. We believe that the pumping can provide a partial proof of principle, although this and similar experiments were not interpreted thus far in our terms. PMID:11209046
NASA Astrophysics Data System (ADS)
Giordano, P.
2010-06-01
We introduce a ring of the so-called Fermat reals, which is an extension of the real field containing nilpotent infinitesimals. The construction is inspired by Smooth Infinitesimal Analysis (SIA) and provides a powerful theory of actual infinitesimals without any background in mathematical logic. In particular, in contrast to SIA, which admits models in intuitionistic logic only, the theory of Fermat reals is consistent with the classical logic. We face the problem of deciding whether or not a product of powers of nilpotent infinitesimals vanishes, study the identity principle for polynomials, and discuss the definition and properties of the total order relation. The construction is highly constructive, and every Fermat real admits a clear and order-preserving geometrical representation. Using nilpotent infinitesimals, every smooth function becomes a polynomial because the remainder in Taylor’s formulas is now zero. Finally, we present several applications to informal classical calculations used in physics, and all these calculations now become rigorous, and at the same time, formally equal to the informal ones. In particular, an interesting rigorous deduction of the wave equation is given, which clarifies how to formalize the approximations tied with Hooke’s law using the language of nilpotent infinitesimals.
FUZZY LOGIC CONTROL OF ELECTRIC MOTORS AND MOTOR DRIVES: FEASIBILITY STUDY
The report gives results of a study (part 1) of fuzzy logic motor control (FLMC). The study included: 1) reviews of existing applications of fuzzy logic, of motor operation, and of motor control; 2) a description of motor control schemes that can utilize FLMC; 3) selection of a m...
The Body Logic Program for Adolescents: A Treatment Manual for the Prevention of Eating Disorders
ERIC Educational Resources Information Center
Varnado-Sullivan, Paula J.; Zucker, Nancy
2004-01-01
The Body Logic Program for Adolescents was developed as a two-stage intervention to prevent the development of eating disorder symptoms. Preliminary results indicate that this program shows promise as an effective prevention effort. The current article provides a detailed description of the protocol for implementing Body Logic Part I, a…
Yong, Chin W
2016-08-22
DL_F Notation is an easy-to-understand, standardized atom typesetting expression for molecular simulations for a range of organic force field (FF) schemes such as OPLSAA, PCFF, and CVFF. It is implemented within DL_FIELD, a software program that facilitates the setting up of molecular FF models for DL_POLY molecular dynamics simulation software. By making use of the Notation, a single core conversion module (the DL_F conversion Engine) implemented within DL_FIELD can be used to analyze a molecular structure and determine the types of atoms for a given FF scheme. Users only need to provide the molecular input structure in a simple xyz format and DL_FIELD can produce the necessary force field file for DL_POLY automatically. In commensurate with the development concept of DL_FIELD, which placed emphasis on robustness and user friendliness, the Engine provides a single-step solution to setup complex FF models. This allows users to switch from one of the above-mentioned FF seamlessly to another while at the same time provides a consistent atom typing that is expressed in a natural chemical sense. PMID:27455451
Oak Ridge National Laboratory Technology Logic Diagram. Executive Summary
Not Available
1993-06-30
This executive summary contains a description of the logic diagram format; some examples from the diagram (Vol. 2) and associated technology evaluation data sheets (Vol. 3); a complete (albeit condensed) listing of the RA, D&D, and WM problems at ORNL; and a complete listing of the technology rankings for all the areas covered by the diagram.
The Concept of Need: Its Hedonistic and Logical Nature.
ERIC Educational Resources Information Center
Mattimore-Knudson, Russell
1983-01-01
Descriptions and clarifications of the concept of need have not included some of the problems inherent in the use of the term or implied by the term. This paper addresses the logical problem of the concept of need as a "referent" term and its hedonistic implications. (Author/SSH)
Logic brightens my day: Evidence for implicit sensitivity to logical validity.
Trippas, Dries; Handley, Simon J; Verde, Michael F; Morsanyi, Kinga
2016-09-01
A key assumption of dual process theory is that reasoning is an explicit, effortful, deliberative process. The present study offers evidence for an implicit, possibly intuitive component of reasoning. Participants were shown sentences embedded in logically valid or invalid arguments. Participants were not asked to reason but instead rated the sentences for liking (Experiment 1) and physical brightness (Experiments 2-3). Sentences that followed logically from preceding sentences were judged to be more likable and brighter. Two other factors thought to be linked to implicit processing-sentence believability and facial expression-had similar effects on liking and brightness ratings. The authors conclude that sensitivity to logical structure was implicit, occurring potentially automatically and outside of awareness. They discuss the results within a fluency misattribution framework and make reference to the literature on discourse comprehension. (PsycINFO Database Record PMID:26889685
Adaptive parallel logic networks
NASA Technical Reports Server (NTRS)
Martinez, Tony R.; Vidal, Jacques J.
1988-01-01
Adaptive, self-organizing concurrent systems (ASOCS) that combine self-organization with massive parallelism for such applications as adaptive logic devices, robotics, process control, and system malfunction management, are presently discussed. In ASOCS, an adaptive network composed of many simple computing elements operating in combinational and asynchronous fashion is used and problems are specified by presenting if-then rules to the system in the form of Boolean conjunctions. During data processing, which is a different operational phase from adaptation, the network acts as a parallel hardware circuit.
Flexible programmable logic module
Robertson, Perry J.; Hutchinson, Robert L.; Pierson, Lyndon G.
2001-01-01
The circuit module of this invention is a VME board containing a plurality of programmable logic devices (PLDs), a controlled impedance clock tree, and interconnecting buses. The PLDs are arranged to permit systolic processing of a problem by offering wide data buses and a plurality of processing nodes. The board contains a clock reference and clock distribution tree that can drive each of the PLDs with two critically timed clock references. External clock references can be used to drive additional circuit modules all operating from the same synchronous clock reference.
Barriers in Concurrent Separation Logic
NASA Astrophysics Data System (ADS)
Hobor, Aquinas; Gherghina, Cristian
We develop and prove sound a concurrent separation logic for Pthreads-style barriers. Although Pthreads barriers are widely used in systems, and separation logic is widely used for verification, there has not been any effort to combine the two. Unlike locks and critical sections, Pthreads barriers enable simultaneous resource redistribution between multiple threads and are inherently stateful, leading to significant complications in the design of the logic and its soundness proof. We show how our logic can be applied to a specific example program in a modular way. Our proofs are machine-checked in Coq.
NASA Technical Reports Server (NTRS)
Canaris, J.
1991-01-01
A new logic family, which is immune to single event upsets, is described. Members of the logic family are capable of recovery, regardless of the shape of the upsetting event. Glitch propagation from an upset node is also blocked. Logic diagrams for an Inverter, Nor, Nand, and Complex Gates are provided. The logic family can be implemented in a standard, commercial CMOS process with no additional masks. DC, transient, static power, upset recovery and layout characteristics of the new family, based on a commercial 1 micron CMOS N-Well process, are described.
The music of morality and logic.
Mesz, Bruno; Rodriguez Zivic, Pablo H; Cecchi, Guillermo A; Sigman, Mariano; Trevisan, Marcos A
2015-01-01
Musical theory has built on the premise that musical structures can refer to something different from themselves (Nattiez and Abbate, 1990). The aim of this work is to statistically corroborate the intuitions of musical thinkers and practitioners starting at least with Plato, that music can express complex human concepts beyond merely "happy" and "sad" (Mattheson and Lenneberg, 1958). To do so, we ask whether musical improvisations can be used to classify the semantic category of the word that triggers them. We investigated two specific domains of semantics: morality and logic. While morality has been historically associated with music, logic concepts, which involve more abstract forms of thought, are more rarely associated with music. We examined musical improvisations inspired by positive and negative morality (e.g., good and evil) and logic concepts (true and false), analyzing the associations between these words and their musical representations in terms of acoustic and perceptual features. We found that music conveys information about valence (good and true vs. evil and false) with remarkable consistency across individuals. This information is carried by several musical dimensions which act in synergy to achieve very high classification accuracy. Positive concepts are represented by music with more ordered pitch structure and lower harmonic and sensorial dissonance than negative concepts. Music also conveys information indicating whether the word which triggered it belongs to the domains of logic or morality (true vs. good), principally through musical articulation. In summary, improvisations consistently map logic and morality information to specific musical dimensions, testifying the capacity of music to accurately convey semantic information in domains related to abstract forms of thought. PMID:26191020
The music of morality and logic
Mesz, Bruno; Rodriguez Zivic, Pablo H.; Cecchi, Guillermo A.; Sigman, Mariano; Trevisan, Marcos A.
2015-01-01
Musical theory has built on the premise that musical structures can refer to something different from themselves (Nattiez and Abbate, 1990). The aim of this work is to statistically corroborate the intuitions of musical thinkers and practitioners starting at least with Plato, that music can express complex human concepts beyond merely “happy” and “sad” (Mattheson and Lenneberg, 1958). To do so, we ask whether musical improvisations can be used to classify the semantic category of the word that triggers them. We investigated two specific domains of semantics: morality and logic. While morality has been historically associated with music, logic concepts, which involve more abstract forms of thought, are more rarely associated with music. We examined musical improvisations inspired by positive and negative morality (e.g., good and evil) and logic concepts (true and false), analyzing the associations between these words and their musical representations in terms of acoustic and perceptual features. We found that music conveys information about valence (good and true vs. evil and false) with remarkable consistency across individuals. This information is carried by several musical dimensions which act in synergy to achieve very high classification accuracy. Positive concepts are represented by music with more ordered pitch structure and lower harmonic and sensorial dissonance than negative concepts. Music also conveys information indicating whether the word which triggered it belongs to the domains of logic or morality (true vs. good), principally through musical articulation. In summary, improvisations consistently map logic and morality information to specific musical dimensions, testifying the capacity of music to accurately convey semantic information in domains related to abstract forms of thought. PMID:26191020
Fuzzy logic and coarse coding using programmable logic devices
NASA Astrophysics Data System (ADS)
Brooks, Geoffrey
2009-05-01
Naturally-occurring sensory signal processing algorithms, such as those that inspired fuzzy-logic control, can be integrated into non-naturally-occurring high-performance technology, such as programmable logic devices, to realize novel bio-inspired designs. Research is underway concerning an investigation into using field programmable logic devices (FPLD's) to implement fuzzy logic sensory processing. A discussion is provided concerning the commonality between bio-inspired fuzzy logic algorithms and coarse coding that is prevalent in naturally-occurring sensory systems. Undergraduate design projects using fuzzy logic for an obstacle-avoidance robot has been accomplished at our institution and other places; numerous other successful fuzzy logic applications can be found as well. The long-term goal is to leverage such biomimetic algorithms for future applications. This paper outlines a design approach for implementing fuzzy-logic algorithms into reconfigurable computing devices. This paper is presented in an effort to connect with others who may be interested in collaboration as well as to establish a starting point for future research.
Matalas, N.C.
1991-01-01
What constitutes a comprehensive description of drought, a description forming a basis for answering why a drought occurred is outlined. The description entails two aspects that are "naturally" coupled, named physical and economic, and treats the set of hydrologic measures of droughts in terms of their multivariate distribution, rather than in terms of a collection of the marginal distributions. ?? 1991 Springer-Verlag.
NASA Technical Reports Server (NTRS)
2005-01-01
A new all-electronic Particle Image Velocimetry technique that can efficiently map high speed gas flows has been developed in-house at the NASA Lewis Research Center. Particle Image Velocimetry is an optical technique for measuring the instantaneous two component velocity field across a planar region of a seeded flow field. A pulsed laser light sheet is used to illuminate the seed particles entrained in the flow field at two instances in time. One or more charged coupled device (CCD) cameras can be used to record the instantaneous positions of particles. Using the time between light sheet pulses and determining either the individual particle displacements or the average displacement of particles over a small subregion of the recorded image enables the calculation of the fluid velocity. Fuzzy logic minimizes the required operator intervention in identifying particles and computing velocity. Using two cameras that have the same view of the illumination plane yields two single exposure image frames. Two competing techniques that yield unambiguous velocity vector direction information have been widely used for reducing the single-exposure, multiple image frame data: (1) cross-correlation and (2) particle tracking. Correlation techniques yield averaged velocity estimates over subregions of the flow, whereas particle tracking techniques give individual particle velocity estimates. For the correlation technique, the correlation peak corresponding to the average displacement of particles across the subregion must be identified. Noise on the images and particle dropout result in misidentification of the true correlation peak. The subsequent velocity vector maps contain spurious vectors where the displacement peaks have been improperly identified. Typically these spurious vectors are replaced by a weighted average of the neighboring vectors, thereby decreasing the independence of the measurements. In this work, fuzzy logic techniques are used to determine the true
Conceptual and logical level of database modeling
NASA Astrophysics Data System (ADS)
Hunka, Frantisek; Matula, Jiri
2016-06-01
Conceptual and logical levels form the top most levels of database modeling. Usually, ORM (Object Role Modeling) and ER diagrams are utilized to capture the corresponding schema. The final aim of business process modeling is to store its results in the form of database solution. For this reason, value oriented business process modeling which utilizes ER diagram to express the modeling entities and relationships between them are used. However, ER diagrams form the logical level of database schema. To extend possibilities of different business process modeling methodologies, the conceptual level of database modeling is needed. The paper deals with the REA value modeling approach to business process modeling using ER-diagrams, and derives conceptual model utilizing ORM modeling approach. Conceptual model extends possibilities for value modeling to other business modeling approaches.
Reversible logic gates on Physarum Polycephalum
Schumann, Andrew
2015-03-10
In this paper, we consider possibilities how to implement asynchronous sequential logic gates and quantum-style reversible logic gates on Physarum polycephalum motions. We show that in asynchronous sequential logic gates we can erase information because of uncertainty in the direction of plasmodium propagation. Therefore quantum-style reversible logic gates are more preferable for designing logic circuits on Physarum polycephalum.
Kenny, A.
1985-01-01
In The Logic of Deterrence, Kenny presents a guide to the theory and ethics of the complicated subject of deterrence. Kenny begins by examining the necessary conditions for any war to be just and then applies these principles to the cases of limited and total nuclear war. He then critiques current deterrence policies of both East and West, concluding that they are based on a willingness to kill millions of innocent people and are morally wrong. In the final section of the book, Kenny offers proposals for nuclear disarmament. Charting a course ''between the illusory hopes of the multilateralists who seek disarmament by negotiating and the impractical idealism of those who call for immediate and total unilateral disarmament by the West,'' Kenny proposes a series of phased and partial unilateral steps by the West, coupled with pressure on the East to reciprocate.
NASA Astrophysics Data System (ADS)
Whitfield, James; Faccin, Mauro; Biamonte, Jacob
2013-03-01
Designing and optimizing cost functions and energy landscapes is a problem encountered in many fields of science and engineering. These landscapes and cost functions can be embedded and annealed in experimentally controllable spin Hamiltonians. Using an approach based on group theory and symmetries, we examine the embedding of Boolean logic gates into the ground-state subspace of such spin systems. We describe parameterized families of diagonal Hamiltonians and symmetry operations which preserve the ground-state subspace encoding the truth tables of Boolean formulas. The ground-state embeddings of adder circuits are used to illustrate how gates are combined and simplified using symmetry. Our work is relevant for experimental demonstrations of ground-state embeddings found in both classical optimization as well as adiabatic quantum optimization.
NASA Technical Reports Server (NTRS)
Cleaveland, Rance; Luettgen, Gerald; Bushnell, Dennis M. (Technical Monitor)
2002-01-01
This paper presents the Logical Process Calculus (LPC), a formalism that supports heterogeneous system specifications containing both operational and declarative subspecifications. Syntactically, LPC extends Milner's Calculus of Communicating Systems with operators from the alternation-free linear-time mu-calculus (LT(mu)). Semantically, LPC is equipped with a behavioral preorder that generalizes Hennessy's and DeNicola's must-testing preorder as well as LT(mu's) satisfaction relation, while being compositional for all LPC operators. From a technical point of view, the new calculus is distinguished by the inclusion of: (1) both minimal and maximal fixed-point operators and (2) an unimple-mentability predicate on process terms, which tags inconsistent specifications. The utility of LPC is demonstrated by means of an example highlighting the benefits of heterogeneous system specification.
Borresen, Jon; Lynch, Stephen
2012-01-01
In the 1940s, the first generation of modern computers used vacuum tube oscillators as their principle components, however, with the development of the transistor, such oscillator based computers quickly became obsolete. As the demand for faster and lower power computers continues, transistors are themselves approaching their theoretical limit and emerging technologies must eventually supersede them. With the development of optical oscillators and Josephson junction technology, we are again presented with the possibility of using oscillators as the basic components of computers, and it is possible that the next generation of computers will be composed almost entirely of oscillatory devices. Here, we demonstrate how coupled threshold oscillators may be used to perform binary logic in a manner entirely consistent with modern computer architectures. We describe a variety of computational circuitry and demonstrate working oscillator models of both computation and memory. PMID:23173034
Partial quantum logics revisited
NASA Astrophysics Data System (ADS)
Vetterlein, Thomas
2011-01-01
Partial Boolean algebras (PBAs) were introduced by Kochen and Specker as an algebraic model reflecting the mutual relationships among quantum-physical yes-no tests. The fact that not all pairs of tests are compatible was taken into special account. In this paper, we review PBAs from two sides. First, we generalise the concept, taking into account also those yes-no tests which are based on unsharp measurements. Namely, we introduce partial MV-algebras, and we define a corresponding logic. Second, we turn to the representation theory of PBAs. In analogy to the case of orthomodular lattices, we give conditions for a PBA to be isomorphic to the PBA of closed subspaces of a complex Hilbert space. Hereby, we do not restrict ourselves to purely algebraic statements; we rather give preference to conditions involving automorphisms of a PBA. We conclude by outlining a critical view on the logico-algebraic approach to the foundational problem of quantum physics.
NASA Technical Reports Server (NTRS)
2003-01-01
The same software controlling autonomous and crew-assisted operations for the International Space Station (ISS) is enabling commercial enterprises to integrate and automate manual operations, also known as decision logic, in real time across complex and disparate networked applications, databases, servers, and other devices, all with quantifiable business benefits. Auspice Corporation, of Framingham, Massachusetts, developed the Auspice TLX (The Logical Extension) software platform to effectively mimic the human decision-making process. Auspice TLX automates operations across extended enterprise systems, where any given infrastructure can include thousands of computers, servers, switches, and modems that are connected, and therefore, dependent upon each other. The concept behind the Auspice software spawned from a computer program originally developed in 1981 by Cambridge, Massachusetts-based Draper Laboratory for simulating tasks performed by astronauts aboard the Space Shuttle. At the time, the Space Shuttle Program was dependent upon paper-based procedures for its manned space missions, which typically averaged 2 weeks in duration. As the Shuttle Program progressed, NASA began increasing the length of manned missions in preparation for a more permanent space habitat. Acknowledging the need to relinquish paper-based procedures in favor of an electronic processing format to properly monitor and manage the complexities of these longer missions, NASA realized that Draper's task simulation software could be applied to its vision of year-round space occupancy. In 1992, Draper was awarded a NASA contract to build User Interface Language software to enable autonomous operations of a multitude of functions on Space Station Freedom (the station was redesigned in 1993 and converted into the international venture known today as the ISS)
Flammable gas tank exhauster interlock (LFGTEI) computer software design description
Smith, S.O.; Irvitt, R.W., Fluor Daniel Hanford
1997-02-21
Modicon Compact Programmable Logic Controller (PLC). The device configuration integrates the isolation and current- carrying capacities of mechanical relays with the logic and programming sophistication of the PLC. This revised document provides descriptions of components and tasks involved in the PLC system for controlling and monitoring the FGTEI. All control functions required by the PLC, and how they are implemented, are described in detail.
Flammable gas tank exhauster interlock (FGTEI) computer software design description
Smith, S.0.
1996-09-10
Modicon Compact Programmable Logic Controller (PLC). The device configuration integrates the isolation and current-carrying capacities of mechanical relays with the logic and programming sophistication of the PLC. This document provides descriptions of components and tasks involved in the PLC system for controlling and monitoring the FGTEI. All control functions required by the PLC, and how they are implemented, are described in detail.
Flammable gas tank exhauster interlock (FGTEI) computer software design description
Smith, S.O., Westinghouse Hanford
1996-09-20
Modicon Compact Programmable Logic Controller (PLC). The device configuration integrates the isolation and current- carrying capacities of mechanical relays with the logic and programming sophistication of the PLC. This revised document provides descriptions of components and tasks involved in the PLC system for controlling and monitoring the FGTEI. All control functions required by the PLC, and how they are implemented, are described in detail.
Simulated Laboratory in Digital Logic.
ERIC Educational Resources Information Center
Cleaver, Thomas G.
Design of computer circuits used to be a pencil and paper task followed by laboratory tests, but logic circuit design can now be done in half the time as the engineer accesses a program which simulates the behavior of real digital circuits, and does all the wiring and testing on his computer screen. A simulated laboratory in digital logic has been…
Programmable Logic Controllers. Teacher Edition.
ERIC Educational Resources Information Center
Rauh, Bob; Kaltwasser, Stan
These materials were developed for a seven-unit secondary or postsecondary education course on programmable logic controllers (PLCs) that treats most of the skills needed to work effectively with PLCs as programming skills. The seven units of the course cover the following topics: fundamentals of programmable logic controllers; contracts, timers,…
Japanese Logic Puzzles and Proof
ERIC Educational Resources Information Center
Wanko, Jeffrey J.
2009-01-01
An understanding of proof does not start in a high school geometry course. Rather, attention to logical reasoning throughout a student's school experience can help the development of proof readiness. In the spirit of problem solving, the author has begun to use some Japanese logic puzzles other than sudoku to help students develop additional…
Power optimization in logic isomers
NASA Technical Reports Server (NTRS)
Panwar, Ramesh; Rennels, David; Alkalaj, Leon
1993-01-01
Logic isomers are labeled, 2-isomorphic graphs that implement the same logic function. Logic isomers may have significantly different power requirements even though they have the same number of transistors in the implementation. The power requirements of the isomers depend on the transition activity of the input signals. The power requirements of isomorphic graph isomers of n-input NAND and NOR gates are shown. Choosing the less power-consuming isomer instead of the others can yield significant power savings. Experimental results on a ripple-carry adder are presented to show that the implementation using the least power-consuming isomers requires approximately 10 percent less power than the implementation using the most power-consuming isomers. Simulations of other random logic designs also confirm that designs using less power-consuming isomers can reduce the logic power demand by approximately 10 percent as compared to designs using more power-consuming isomers.
ERIC Educational Resources Information Center
Pease, Craig M.; Bull, J. J.
1992-01-01
Offers a concise, abstract description of the scientific method different from the historical, philosophical, and case-study approaches, which lead to comprehension of this method. Discusses features of scientific models, dynamic interactions underlying scientific progress, ways that scientist successfully understand nature, mechanisms for…
Quantum integrals and anhomomorphic logics
NASA Astrophysics Data System (ADS)
Gudder, Stan
2010-11-01
The basic arena for a probabilistic structure is a set A of events. Corresponding to A is a dual structure A^* of coevents. We call A^* an anhomomorphic logic and the coevents are given by "truth functions" from A to the two-element Boolean algebra {Z}_2=lbrace 0,1rbrace. One of the main goals of a physical theory is to describe physical reality and a coevent φ:ArArr {Z}_2 provides such a description in the sense that an event Ain A "actually occurs" if and only if ϕ(A) = 1. The quantum integral over an event A with respect to a coevent ϕ is defined and its properties are treated. Integrals with respect to various coevents are computed. Quantum systems are frequently described by a quantum measure μ which gives the propensity μ(A) that an event A occurs. For φ in A^*, if ϕ(A) = 0 whenever μ(A) = 0 we say that ϕ is preclusive. Preclusivity is a reality filter because it eliminates coevents that do not describe a possible reality for the system. A quantum measure that can be represented as a quantum integral with respect to a coevent ϕ is said to 1-generate ϕ. This gives a stronger reality filter than preclusivity. What we believe to be a more general filter is defined in terms of a double quantum integral and is called 2-generation. We show that there are quantum measures that 2-generate coevents, but do not 1-generate coevents. Examples also show that there are coevents that are 2-generated but not 1-generated. For simplicity only finite systems are considered.
Learning a Markov Logic network for supervised gene regulatory network inference
2013-01-01
Background Gene regulatory network inference remains a challenging problem in systems biology despite the numerous approaches that have been proposed. When substantial knowledge on a gene regulatory network is already available, supervised network inference is appropriate. Such a method builds a binary classifier able to assign a class (Regulation/No regulation) to an ordered pair of genes. Once learnt, the pairwise classifier can be used to predict new regulations. In this work, we explore the framework of Markov Logic Networks (MLN) that combine features of probabilistic graphical models with the expressivity of first-order logic rules. Results We propose to learn a Markov Logic network, e.g. a set of weighted rules that conclude on the predicate “regulates”, starting from a known gene regulatory network involved in the switch proliferation/differentiation of keratinocyte cells, a set of experimental transcriptomic data and various descriptions of genes all encoded into first-order logic. As training data are unbalanced, we use asymmetric bagging to learn a set of MLNs. The prediction of a new regulation can then be obtained by averaging predictions of individual MLNs. As a side contribution, we propose three in silico tests to assess the performance of any pairwise classifier in various network inference tasks on real datasets. A first test consists of measuring the average performance on balanced edge prediction problem; a second one deals with the ability of the classifier, once enhanced by asymmetric bagging, to update a given network. Finally our main result concerns a third test that measures the ability of the method to predict regulations with a new set of genes. As expected, MLN, when provided with only numerical discretized gene expression data, does not perform as well as a pairwise SVM in terms of AUPR. However, when a more complete description of gene properties is provided by heterogeneous sources, MLN achieves the same performance as a black
NASA Astrophysics Data System (ADS)
Sosa, M.; Grundel, L.; Simini, F.
2016-04-01
Logical reasoning is part of medical practice since its origins. Modern Medicine has included information-intensive tools to refine diagnostics and treatment protocols. We are introducing formal logic teaching in Medical School prior to Clinical Internship, to foster medical practice. Two simple examples (Acute Myocardial Infarction and Diabetes Mellitus) are given in terms of formal logic expression and truth tables. Flowcharts of both diagnostic processes help understand the procedures and to validate them logically. The particularity of medical information is that it is often accompanied by “missing data” which suggests to adapt formal logic to a “three state” logic in the future. Medical Education must include formal logic to understand complex protocols and best practices, prone to mutual interactions.
Frameworks for Logically Classifying Polynomial-Time Optimisation Problems
NASA Astrophysics Data System (ADS)
Gate, James; Stewart, Iain A.
We show that a logical framework, based around a fragment of existential second-order logic formerly proposed by others so as to capture the class of polynomially-bounded P-optimisation problems, cannot hope to do so, under the assumption that P ≠ NP. We do this by exhibiting polynomially-bounded maximisation and minimisation problems that can be expressed in the framework but whose decision versions are NP-complete. We propose an alternative logical framework, based around inflationary fixed-point logic, and show that we can capture the above classes of optimisation problems. We use the inductive depth of an inflationary fixed-point as a means to describe the objective functions of the instances of our optimisation problems.
Control of a fluidized bed combustor using fuzzy logic
Koffman, S.J.; Brown, R.C.; Fullmer, R.R.
1996-01-01
Fuzzy logic--an artificial intelligence technique--can be employed to exploit the wealth of information human experts have learned about complex systems while attempting to control them. This information is usually of a qualitative nature that is unusable by rigid conventional control techniques. Fuzzy logic, uses as a control method, manipulates linguistically expressed, heuristic knowledge from a human expert to derive control actions for a described system. As an alternative approach to classical controls, fuzzy logic is examined for start-up control and normal regulation of a bubbling fluidized bed combustor. To validate the fuzzy logic approach, the fuzzy controller is compared to a classical proportional and integral (PI) controller, commonly used in industrial applications, designed by Ziegler-Nichols tuning.
MLS, a magnetic logic simulator for magnetic bubble logic design
NASA Astrophysics Data System (ADS)
Kinsman, Thomas B.; Cendes, Zoltan J.
1987-04-01
A computer program that simulates the logic functions of magnetic bubble devices has been developed. The program uses a color graphics screen to display the locations of bubbles on a chip during operation. It complements the simulator previously developed for modeling bubble devices on the gate level [Smith et al., IEEE Trans. Magn. MAG-19, 1835 (1983); Smith and Kryder, ibid. MAG-21, 1779 (1985)]. This new tool simplifies the design and testing of bubble logic devices, and facilitates the development of complicated LSI bubble circuits. The program operation is demonstrated with the design of an in-stream faulty loop compensator using bubble logic.
Contradicting logics in everyday practice.
Kristiansen, Margrethe; Obstfelder, Aud; Lotherington, Ann Therese
2016-03-21
Purpose - Performance management is criticised as a direct challenge to the dominant logic of professionalism in health care organisations. The purpose of this paper is to report an ethnographic study that investigates how performance management and professionalism as contradicting logics are interpreted and implemented by managers and nurses in everyday practice within Norwegian nursing homes. Design/methodology/approach - The paper presents an analysis of 18 semistructured interviews and 100 hours of observation of managers and nurses from three nursing homes. The study draws on the institutional logic perspective as a theoretical framework. In the analysis, the authors searched for patterns of activities and interactions that reflected managers and nurses' coping strategies for handling contradicting logics. Qualitative content analysis was used to systematically code the data, supported by NVIVO software. Findings - The authors identified three forms of coping strategies: the adjustment of professionalism to standards, the reinforcement of professional flexibility and problem solving, and the strategic adoption of documentation. These patterns of activities and interactions reflect new organisational structures that allowed contradicting logics to co-exist. The study demonstrates that a new complex dimension of governing processes within nursing homes is the way in which managers and nurses handle the tension between contradicting logics in their daily work and clinicians' everyday practice. Originality/value - The study provides new insight into how managers and nurses reshape internal organisational structures to cope with contradicting logics in nursing homes. PMID:26964849
Fuzzy logic in control systems: Fuzzy logic controller. I, II
NASA Technical Reports Server (NTRS)
Lee, Chuen Chien
1990-01-01
Recent advances in the theory and applications of fuzzy-logic controllers (FLCs) are examined in an analytical review. The fundamental principles of fuzzy sets and fuzzy logic are recalled; the basic FLC components (fuzzification and defuzzification interfaces, knowledge base, and decision-making logic) are described; and the advantages of FLCs for incorporating expert knowledge into a control system are indicated. Particular attention is given to fuzzy implication functions, the interpretation of sentence connectives (and, also), compositional operators, and inference mechanisms. Applications discussed include the FLC-guided automobile developed by Sugeno and Nishida (1985), FLC hardware systems, FLCs for subway trains and ship-loading cranes, fuzzy-logic chips, and fuzzy computers.
Kral, M J
1994-01-01
Although suicide is not viewed as a mental disorder per se, it is viewed by many if not most clinicians, researchers, and lay people as a real or natural symptom of depression. It is at least most typically seen as the unfortunate, severe, yet logical end result of a chain of negative self-appraisals, negative events, and hopelessness. Extending an approach articulated by the early French sociologist Gabriel Tarde, in this paper I argue that suicide is merely an idea, albeit a very bad one, having more in common with societal beliefs and norms regarding such things as divorce, abortion, sex, politics, consumer behavior, and fashion. I make a sharp contrast between perturbation and lethality, concepts central to Edwin S. Shneidman's theory of suicide. Evidence supportive of suicide as an idea is discussed based on what we are learning from the study of history and culture, and about contagion/cluster phenomena, media/communication, and choice of method. It is suggested that certain individuals are more vulnerable to incorporate the idea and act of suicide into their concepts of self, based on the same principles by which ideas are spread throughout society. Just as suicide impacts on society, so does society impact on suicide. PMID:7825197
NASA Technical Reports Server (NTRS)
Smith, David E.; Jonsson, Ari K.; Clancy, Daniel (Technical Monitor)
2001-01-01
In recent years, Graphplan style reachability analysis and mutual exclusion reasoning have been used in many high performance planning systems. While numerous refinements and extensions have been developed, the basic plan graph structure and reasoning mechanisms used in these systems are tied to the very simple STRIPS model of action. In 1999, Smith and Weld generalized the Graphplan methods for reachability and mutex reasoning to allow actions to have differing durations. However, the representation of actions still has some severe limitations that prevent the use of these techniques for many real-world planning systems. In this paper, we 1) separate the logic of reachability from the particular representation and inference methods used in Graphplan, and 2) extend the notions of reachability and mutual exclusion to more general notions of time and action. As it turns out, the general rules for mutual exclusion reasoning take on a remarkably clean and simple form. However, practical instantiations of them turn out to be messy, and require that we make representation and reasoning choices.
Logic synthesis of cascade circuits
NASA Astrophysics Data System (ADS)
Zakrevskii, A. D.
The work reviews aspects of the logic design of cascade circuits, particularly programmable logic matrices. Effective methods for solving various problems of the analysis and synthesis of these devices are examined; these methods are based on a matrix representation of the structure of these devices, and a vector-matrix interpretation of certain aspects of Boolean algebra. Particular consideration is given to the theory of elementary matrix circuits, methods for the minimization of Boolean functions, the synthesis of programmable logic matrices, multilevel combinational networks, and the development of automata with memory.
Mapping Physical Formats to Logical Models to Extract Data and Metadata: The Defuddle Parsing Engine
Talbott, Tara D.; Schuchardt, Karen L.; Stephan, Eric G.; Myers, James D.
2006-07-25
Scientists, fueled by the desire for systems-level understanding of phenomena, increasingly need to share their results across multiple disciplines. Accomplishing this requires data to be annotated, contextualized, and readily searchable and translated into other formats. While these requirements can be addressed by custom programming or obviated by community standardization, neither approach has ‘solved’ the problem. In this paper, we describe a complementary approach – a general capability for articulating the format of arbitrary textual and binary data using a logical data model, expressed in XML-Schema, which can be used to provide annotation and context, extract metadata, and enable translation. This work is based on the draft specification for the Data Format Description Language and our open source “Defuddle” parser. We present an overview of the specification, detail the design of Defuddle, and discuss the benefits and challenges of this general approach to enabling discovery and sharing of diverse data sets.
Mischnik, Marcel; Gambaryan, Stepan; Subramanian, Hariharan; Geiger, Jörg; Schütz, Claudia; Timmer, Jens; Dandekar, Thomas
2014-08-01
A kinetic description of the fragile equilibrium in thrombozytes regulating blood flow would be an important basis for rational medical interventions. Challenges for such a model include regulation by a complex bistability switch that determines the transition from reversible to irreversible aggregation and sparse data on the kinetics. A so far scarcely applied technique is given by the derivation of ordinary differential equations from Boolean expressions, which are called logic ODEs. We employ a combination of light-scattering based thrombocyte aggregation data, western blot and calcium measurements to compare three different ODE approaches regarding their suitability to achieve a data-consistent model of the switch. Our analysis reveals the standardized qualitative dynamical system approach (SQUAD) to be a better choice than classical mass action formalisms. Furthermore, we analyze the dynamical properties of the platelet aggregation threshold as a basis for medical interventions such as novel platelet aggregation inhibitors. PMID:24852796
Knowledge representation in fuzzy logic
NASA Technical Reports Server (NTRS)
Zadeh, Lotfi A.
1989-01-01
The author presents a summary of the basic concepts and techniques underlying the application of fuzzy logic to knowledge representation. He then describes a number of examples relating to its use as a computational system for dealing with uncertainty and imprecision in the context of knowledge, meaning, and inference. It is noted that one of the basic aims of fuzzy logic is to provide a computational framework for knowledge representation and inference in an environment of uncertainty and imprecision. In such environments, fuzzy logic is effective when the solutions need not be precise and/or it is acceptable for a conclusion to have a dispositional rather than categorical validity. The importance of fuzzy logic derives from the fact that there are many real-world applications which fit these conditions, especially in the realm of knowledge-based systems for decision-making and control.
Fuzzy logic and neural networks
Loos, J.R.
1994-11-01
Combine fuzzy logic`s fuzzy sets, fuzzy operators, fuzzy inference, and fuzzy rules - like defuzzification - with neural networks and you can arrive at very unfuzzy real-time control. Fuzzy logic, cursed with a very whimsical title, simply means multivalued logic, which includes not only the conventional two-valued (true/false) crisp logic, but also the logic of three or more values. This means one can assign logic values of true, false, and somewhere in between. This is where fuzziness comes in. Multi-valued logic avoids the black-and-white, all-or-nothing assignment of true or false to an assertion. Instead, it permits the assignment of shades of gray. When assigning a value of true or false to an assertion, the numbers typically used are {open_quotes}1{close_quotes} or {open_quotes}0{close_quotes}. This is the case for programmed systems. If {open_quotes}0{close_quotes} means {open_quotes}false{close_quotes} and {open_quotes}1{close_quotes} means {open_quotes}true,{close_quotes} then {open_quotes}shades of gray{close_quotes} are any numbers between 0 and 1. Therefore, {open_quotes}nearly true{close_quotes} may be represented by 0.8 or 0.9, {open_quotes}nearly false{close_quotes} may be represented by 0.1 or 0.2, and {close_quotes}your guess is as good as mine{close_quotes} may be represented by 0.5. The flexibility available to one is limitless. One can associate any meaning, such as {open_quotes}nearly true{close_quotes}, to any value of any granularity, such as 0.9999. 2 figs.
Heat exchanger expert system logic
NASA Technical Reports Server (NTRS)
Cormier, R.
1988-01-01
The reduction is described of the operation and fault diagnostics of a Deep Space Network heat exchanger to a rule base by the application of propositional calculus to a set of logic statements. The value of this approach lies in the ease of converting the logic and subsequently implementing it on a computer as an expert system. The rule base was written in Process Intelligent Control software.
Optically controllable molecular logic circuits
NASA Astrophysics Data System (ADS)
Nishimura, Takahiro; Fujii, Ryo; Ogura, Yusuke; Tanida, Jun
2015-07-01
Molecular logic circuits represent a promising technology for observation and manipulation of biological systems at the molecular level. However, the implementation of molecular logic circuits for temporal and programmable operation remains challenging. In this paper, we demonstrate an optically controllable logic circuit that uses fluorescence resonance energy transfer (FRET) for signaling. The FRET-based signaling process is modulated by both molecular and optical inputs. Based on the distance dependence of FRET, the FRET pathways required to execute molecular logic operations are formed on a DNA nanostructure as a circuit based on its molecular inputs. In addition, the FRET pathways on the DNA nanostructure are controlled optically, using photoswitching fluorescent molecules to instruct the execution of the desired operation and the related timings. The behavior of the circuit can thus be controlled using external optical signals. As an example, a molecular logic circuit capable of executing two different logic operations was studied. The circuit contains functional DNAs and a DNA scaffold to construct two FRET routes for executing Input 1 AND Input 2 and Input 1 AND NOT Input 3 operations on molecular inputs. The circuit produced the correct outputs with all possible combinations of the inputs by following the light signals. Moreover, the operation execution timings were controlled based on light irradiation and the circuit responded to time-dependent inputs. The experimental results demonstrate that the circuit changes the output for the required operations following the input of temporal light signals.
Optically controllable molecular logic circuits
Nishimura, Takahiro Fujii, Ryo; Ogura, Yusuke; Tanida, Jun
2015-07-06
Molecular logic circuits represent a promising technology for observation and manipulation of biological systems at the molecular level. However, the implementation of molecular logic circuits for temporal and programmable operation remains challenging. In this paper, we demonstrate an optically controllable logic circuit that uses fluorescence resonance energy transfer (FRET) for signaling. The FRET-based signaling process is modulated by both molecular and optical inputs. Based on the distance dependence of FRET, the FRET pathways required to execute molecular logic operations are formed on a DNA nanostructure as a circuit based on its molecular inputs. In addition, the FRET pathways on the DNA nanostructure are controlled optically, using photoswitching fluorescent molecules to instruct the execution of the desired operation and the related timings. The behavior of the circuit can thus be controlled using external optical signals. As an example, a molecular logic circuit capable of executing two different logic operations was studied. The circuit contains functional DNAs and a DNA scaffold to construct two FRET routes for executing Input 1 AND Input 2 and Input 1 AND NOT Input 3 operations on molecular inputs. The circuit produced the correct outputs with all possible combinations of the inputs by following the light signals. Moreover, the operation execution timings were controlled based on light irradiation and the circuit responded to time-dependent inputs. The experimental results demonstrate that the circuit changes the output for the required operations following the input of temporal light signals.
Modular Logic Programming for Web Data, Inheritance and Agents
NASA Astrophysics Data System (ADS)
Karali, Isambo
The Semantic Web provides a framework and a set of technologies enabling an effective machine processable information. However, most of the problems that are addressed in the Semantic Web were tackled by the artificial intelligence community, in the past. Within this period, Logic Programming emerged as a complete framework ranging from a sound formal theory, based on Horn clauses, to a declarative description language and an operational behavior that can be executed. Logic programming and its extensions have been already used in various approaches in the Semantic Web or the traditional Web context. In this work, we investigate the use of Modular Logic Programming, i.e. Logic Programming extended with modules, to address issues of the Semantic Web ranging from the ontology layer to reasoning and agents. These techniques provide a uniform framework ranging from the data layer to the higher layers of logic, avoiding the problem of incompatibilities of technologies related with different Semantic Web layers. What is more is that it can operate directly on top of existent World Wide Web sources.
Some logical functions of joint control.
Lowenkron, B
1998-01-01
Constructing a behavioral account of the language-related performances that characterize responding to logical and symbolic relations between stimuli is commonly viewed as a problem for the area of stimulus control. In response to this problem, the notion of joint control is presented here, and its ability to provide an interpretative account of these kinds of performances is explored. Joint control occurs when the currently rehearsed topography of a verbal operant, as evoked by one stimulus, is simultaneously evoked by another stimulus. This event, the onset of joint stimulus control by two stimuli over a common response topography, then sets the occasion for a response appropriate to this special relation between the stimuli. Although the mechanism described is simple, it seems to have broad explanatory properties. In what follows, these properties are applied to provide a behavioral interpretation of two sorts of fundamental, putatively cognitive, performances: those based on logical relations and those based on semantic relations. The first includes responding to generalized conceptual relations such as identity, order, relative size, distance, and orientation. The second includes responding to relations usually ascribed to word meaning. These include relations between words and objects, the specification of objects by words, name-object bidirectionality, and the recognition of objects from their description. Finally, as a preview of some further possibilities, the role of joint control in goal-oriented behavior is considered briefly. PMID:9599452
Neural logic molecular, counter-intuitive.
Egorov, Igor K
2007-09-01
A hypothesis is proposed that multiple "LOGIC" genes control Boolean logic in a neuron. Each hypothetical LOGIC gene encodes a transcription factor that regulates another LOGIC gene(s). Through transcription regulation, LOGIC genes connect into a complex circuit, such as a XOR logic gate or a two-input flip-flop logic circuit capable of retaining information. LOGIC gene duplication, mutation and recombination may result in the diversification of Boolean logic gates. Creative thinking may sometimes require counter-intuitive reasoning, rather than common sense. Such reasoning is likely to engage novel logic circuits produced by LOGIC somatic mutations. An individual's logic maturates by a mechanism of somatic hypermutation, gene conversion and recombination of LOGIC genes in precursor cells followed by selection of neurons in the brain for functional competence. In this model, a single neuron among billions in the brain may contain a unique logic circuit being the key to a hard intellectual problem. The output of a logic neuron is likely to be a neurotransmitter. This neuron is connected to other neurons in the spiking neural network. The LOGIC gene hypothesis is testable by molecular techniques. Understanding mechanisms of authentic human ingenuity may help to invent digital systems capable of creative thinking. PMID:17509937
Pass transistor implementations of multivalued logic
NASA Technical Reports Server (NTRS)
Maki, G.; Whitaker, S.
1990-01-01
A simple straight-forward Karnaugh map logic design procedure for realization of multiple-valued logic circuits is presented in this paper. Pass transistor logic gates are used to realize multiple-valued networks. This work is an extension of pass transistor implementations for binary-valued logic.
Describing the What and Why of Students' Difficulties in Boolean Logic
ERIC Educational Resources Information Center
Herman, Geoffrey L.; Loui, Michael C.; Kaczmarczyk, Lisa; Zilles, Craig
2012-01-01
The ability to reason with formal logic is a foundational skill for computer scientists and computer engineers that scaffolds the abilities to design, debug, and optimize. By interviewing students about their understanding of propositional logic and their ability to translate from English specifications to Boolean expressions, we characterized…
Fluorescence resonance energy transfer-based molecular logic circuit using a DNA scaffold
NASA Astrophysics Data System (ADS)
Nishimura, Takahiro; Ogura, Yusuke; Tanida, Jun
2012-12-01
This paper presents a method of information processing using biomolecular input signals and fluorescence resonance energy transfer (FRET) signaling constructed on a DNA scaffold. Logic operations are achieved by encoding molecular inputs into an arrangement of fluorescence dyes using simple DNA reactions and by evaluating a logic expression using local photonic signaling that is much faster than DNA reactions. Experimental results verify the operation of a complete set of Boolean logic functions (AND, OR, NOT) and combinational logic operations using a FRET-signal cascade.
Shi, Runhua; McLarty, Jerry W
2009-10-01
In this article, we introduced basic concepts of statistics, type of distributions, and descriptive statistics. A few examples were also provided. The basic concepts presented herein are only a fraction of the concepts related to descriptive statistics. Also, there are many commonly used distributions not presented herein, such as Poisson distributions for rare events and exponential distributions, F distributions, and logistic distributions. More information can be found in many statistics books and publications. PMID:19891281
Fuzzy logic of Aristotelian forms
Perlovsky, L.I.
1996-12-31
Model-based approaches to pattern recognition and machine vision have been proposed to overcome the exorbitant training requirements of earlier computational paradigms. However, uncertainties in data were found to lead to a combinatorial explosion of the computational complexity. This issue is related here to the roles of a priori knowledge vs. adaptive learning. What is the a-priori knowledge representation that supports learning? I introduce Modeling Field Theory (MFT), a model-based neural network whose adaptive learning is based on a priori models. These models combine deterministic, fuzzy, and statistical aspects to account for a priori knowledge, its fuzzy nature, and data uncertainties. In the process of learning, a priori fuzzy concepts converge to crisp or probabilistic concepts. The MFT is a convergent dynamical system of only linear computational complexity. Fuzzy logic turns out to be essential for reducing the combinatorial complexity to linear one. I will discuss the relationship of the new computational paradigm to two theories due to Aristotle: theory of Forms and logic. While theory of Forms argued that the mind cannot be based on ready-made a priori concepts, Aristotelian logic operated with just such concepts. I discuss an interpretation of MFT suggesting that its fuzzy logic, combining a-priority and adaptivity, implements Aristotelian theory of Forms (theory of mind). Thus, 2300 years after Aristotle, a logic is developed suitable for his theory of mind.
An Adaptive Fuzzy-Logic Traffic Control System in Conditions of Saturated Transport Stream.
Yusupbekov, N R; Marakhimov, A R; Igamberdiev, H Z; Umarov, Sh X
2016-01-01
This paper considers the problem of building adaptive fuzzy-logic traffic control systems (AFLTCS) to deal with information fuzziness and uncertainty in case of heavy traffic streams. Methods of formal description of traffic control on the crossroads based on fuzzy sets and fuzzy logic are proposed. This paper also provides efficient algorithms for implementing AFLTCS and develops the appropriate simulation models to test the efficiency of suggested approach. PMID:27517081
An Adaptive Fuzzy-Logic Traffic Control System in Conditions of Saturated Transport Stream
Marakhimov, A. R.; Igamberdiev, H. Z.; Umarov, Sh. X.
2016-01-01
This paper considers the problem of building adaptive fuzzy-logic traffic control systems (AFLTCS) to deal with information fuzziness and uncertainty in case of heavy traffic streams. Methods of formal description of traffic control on the crossroads based on fuzzy sets and fuzzy logic are proposed. This paper also provides efficient algorithms for implementing AFLTCS and develops the appropriate simulation models to test the efficiency of suggested approach. PMID:27517081
Table-top mirror based parallel programmable optical logic device
NASA Astrophysics Data System (ADS)
Chattopadhyay, Tanay
2014-12-01
Light rays can easily be reflected to different path by mechanical movement of mirrors. Using this basic operational principle we can design parallel programmable optical logic device (PPOLD) by arranging mirrors on a table. The ‘table-top mirror' models of this proposed circuit have been shown here. We can program it to design all the two input 16-Boolean logical expressions from a single design. The design is based on only plane mirrors. No active optical material is used in this design. Not only that the proposed circuit is optically reversible in nature. Moreover this design is very simple in sense. It can be fabricated in MEMS based optical switches.
Fuzzy logic particle tracking velocimetry
NASA Technical Reports Server (NTRS)
Wernet, Mark P.
1993-01-01
Fuzzy logic has proven to be a simple and robust method for process control. Instead of requiring a complex model of the system, a user defined rule base is used to control the process. In this paper the principles of fuzzy logic control are applied to Particle Tracking Velocimetry (PTV). Two frames of digitally recorded, single exposure particle imagery are used as input. The fuzzy processor uses the local particle displacement information to determine the correct particle tracks. Fuzzy PTV is an improvement over traditional PTV techniques which typically require a sequence (greater than 2) of image frames for accurately tracking particles. The fuzzy processor executes in software on a PC without the use of specialized array or fuzzy logic processors. A pair of sample input images with roughly 300 particle images each, results in more than 200 velocity vectors in under 8 seconds of processing time.
Intersecting Adjectives in Syllogistic Logic
NASA Astrophysics Data System (ADS)
Moss, Lawrence S.
The goal of natural logic is to present and study logical systems for reasoning with sentences of (or which are reasonably close to) ordinary language. This paper explores simple systems of natural logic which make use of intersecting adjectives; these are adjectives whose interpretation does not vary with the noun they modify. Our project in this paper is to take one of the simplest syllogistic fragments, that of all and some, and to add intersecting adjectives. There are two ways to do this, depending on whether one allows iteration or prefers a "flat" structure of at most one adjective. We present rules of inference for both types of syntax, and these differ. The main results are four completeness theorems: for each of the two types of syntax we have completeness for the all fragment and for the full language of this paper.
Reversible logic gate using adiabatic superconducting devices
Takeuchi, N.; Yamanashi, Y.; Yoshikawa, N.
2014-01-01
Reversible computing has been studied since Rolf Landauer advanced the argument that has come to be known as Landauer's principle. This principle states that there is no minimum energy dissipation for logic operations in reversible computing, because it is not accompanied by reductions in information entropy. However, until now, no practical reversible logic gates have been demonstrated. One of the problems is that reversible logic gates must be built by using extremely energy-efficient logic devices. Another difficulty is that reversible logic gates must be both logically and physically reversible. Here we propose the first practical reversible logic gate using adiabatic superconducting devices and experimentally demonstrate the logical and physical reversibility of the gate. Additionally, we estimate the energy dissipation of the gate, and discuss the minimum energy dissipation required for reversible logic operations. It is expected that the results of this study will enable reversible computing to move from the theoretical stage into practical usage. PMID:25220698
High-speed, cascaded optical logic operations using programmable optical logic gate arrays
Lu, B.; Lu, Y.C.; Cheng, J.; Hafich, M.J.; Klem, J.; Zolper, J.C.
1996-01-01
Programmable optical logic operations are demonstrated using arrays of nonlatching binary optical switches consisting of vertical-cavity surface-emitting lasers, p-i-n photodetectors and heterojunction bipolar transistors. Individual arrays can perform Boolean optical logic functions at 100 Mb/s using both optical and electrical logic inputs, while the routing and fan-out of the optical logic outputs can be controlled at the gate level. Cascaded optical logic operation is demonstrated using two programmable logic gate arrays.
A Logical Approach to Entanglement
NASA Astrophysics Data System (ADS)
Das, Abhishek
2016-05-01
In this paper we innovate a logical approach to develop an intuition regarding the phenomenon of quantum entanglement. In the vein of the logic introduced we substantiate that particles that were entangled in the past will be entangled in perpetuity and thereby abide a rule that restricts them to act otherwise. We also introduce a game and by virtue of the concept of Nash equilibrium we have been able to show that entangled particles will mutually correspond to an experiment that is performed on any one of the particle.
NASA Technical Reports Server (NTRS)
Ruspini, Enrique H.
1991-01-01
Summarized here are the results of recent research on the conceptual foundations of fuzzy logic. The focus is primarily on the principle characteristics of a model that quantifies resemblance between possible worlds by means of a similarity function that assigns a number between 0 and 1 to every pair of possible worlds. Introduction of such a function permits one to interpret the major constructs and methods of fuzzy logic: conditional and unconditional possibility and necessity distributions and the generalized modus ponens of Zadeh on the basis of related metric relationships between subsets of possible worlds.
Logic programming and metadata specifications
NASA Technical Reports Server (NTRS)
Lopez, Antonio M., Jr.; Saacks, Marguerite E.
1992-01-01
Artificial intelligence (AI) ideas and techniques are critical to the development of intelligent information systems that will be used to collect, manipulate, and retrieve the vast amounts of space data produced by 'Missions to Planet Earth.' Natural language processing, inference, and expert systems are at the core of this space application of AI. This paper presents logic programming as an AI tool that can support inference (the ability to draw conclusions from a set of complicated and interrelated facts). It reports on the use of logic programming in the study of metadata specifications for a small problem domain of airborne sensors, and the dataset characteristics and pointers that are needed for data access.
Quantum Decoherence: A Logical Perspective
NASA Astrophysics Data System (ADS)
Fortin, Sebastian; Vanni, Leonardo
2014-12-01
The so-called classical limit of quantum mechanics is generally studied in terms of the decoherence of the state operator that characterizes a system. This is not the only possible approach to decoherence. In previous works we have presented the possibility of studying the classical limit in terms of the decoherence of relevant observables of the system. On the basis of this approach, in this paper we introduce the classical limit from a logical perspective, by studying the way in which the logical structure of quantum properties corresponding to relevant observables acquires Boolean characteristics.
Integrating logic functions inside a single molecule
NASA Astrophysics Data System (ADS)
Stadler, R.; Ami, S.; Joachim, C.; Forshaw, M.
2004-04-01
In Stadler et al (2003 Nanotechnology 14 138), a scheme for a molecular memory was presented. It was based on the influence of the positions of chemical side-groups attached to aromatic molecules on the paths for electrons propagating through these molecules in the ballistic and tunnelling transport regimes. Here we extend this concept in the following ways. (i) A graphical method is derived from an electron scattering formalism based on a topological Hückel description, which allows us to estimate whether the electron transport between two electrodes attached to specific atomic sites in an arbitrary molecule is finite or zero at the Fermi level. (ii) The same scheme that was used for the implementation of the molecular memory is extended to logic functions, in particular a half-adder. (iii) A more realistic description of the chemical nature of the proposed intra-molecular circuits is achieved by using the elastic scattering quantum chemistry (ESQC) technique in an extended Hückel implementation and by specifying the side-groups as nitro-groups, which are rotated in order to feed the signal inputs into the computational circuit.
Mathematical Induction: Deductive Logic Perspective
ERIC Educational Resources Information Center
Dogan, Hamide
2016-01-01
Many studies mentioned the deductive nature of Mathematical Induction (MI) proofs but almost all fell short in explaining its potential role in the formation of the misconceptions reported in the literature. This paper is the first of its kind looking at the misconceptions from the perspective of the abstract of the deductive logic from one's…
Logical Empiricism, Politics, and Professionalism
ERIC Educational Resources Information Center
Edgar, Scott
2009-01-01
This paper considers George A. Reisch's account of the role of Cold War political forces in shaping the apolitical stance that came to dominate philosophy of science in the late 1940s and 1950s. It argues that at least as early as the 1930s, Logical Empiricists such as Rudolf Carnap already held that philosophy of science could not properly have…
Miniaturization of magnetic logic circuitry
NASA Technical Reports Server (NTRS)
Baba, P. D.
1969-01-01
Magnetic logic circuit design features two ferrite materials, with different formulation and magnetic characteristics, which are bonded into a continuous structure by preparing the materials as a slurry and using the doctor blade method to form flexible ferrite sheets. After firing, the sintering process was continuous across the bond.
Energy Science and Technology Software Center (ESTSC)
2011-05-07
Current mode logic is used in high speed timing systems for particle accelerators due to the fast rise time of the electrical signal. This software provides the necessary documentation to produce multiple copies of a single input for distribution to multiple devices. This software supports the DOE mission by providing a method for producing high speed signals in accelerator timing systems.
Soft computing and fuzzy logic
Zadeh, L.A.
1994-12-31
Soft computing is a collection of methodologies that aim to exploit the tolerance for imprecision and uncertainty to achieve tractability, robustness, and low solution cost. Its principal constituents are fuzzy logic, neuro-computing, and probabilistic reasoning. Soft computing is likely to play an increasingly important role in many application areas, including software engineering. The role model for soft computing is the human mind.
The Temporal Logic Model Concept.
ERIC Educational Resources Information Center
den Heyer, Molly
2002-01-01
Proposes an alternative program logic model based on the concepts of learning organizations and systems theory. By redefining time as an evolutionary process, the model provides a space for stakeholders to record changes in program context, interim assessments, and program modifications. (SLD)
The Logic of Research Evaluation
ERIC Educational Resources Information Center
Scriven, Michael; Coryn, Chris L. S.
2008-01-01
The authors offer suggestions about logical distinctions often overlooked in the evaluation of research, beginning with a strong plea not to treat technology as applied science, and especially not to treat research in technology as important only if it makes a contribution to scientific knowledge. They argue that the frameworks illustrated in this…
Generic physical protection logic trees
Paulus, W.K.
1981-10-01
Generic physical protection logic trees, designed for application to nuclear facilities and materials, are presented together with a method of qualitative evaluation of the trees for design and analysis of physical protection systems. One or more defense zones are defined where adversaries interact with the physical protection system. Logic trees that are needed to describe the possible scenarios within a defense zone are selected. Elements of a postulated or existing physical protection system are tagged to the primary events of the logic tree. The likelihood of adversary success in overcoming these elements is evaluated on a binary, yes/no basis. The effect of these evaluations is propagated through the logic of each tree to determine whether the adversary is likely to accomplish the end event of the tree. The physical protection system must be highly likely to overcome the adversary before he accomplishes his objective. The evaluation must be conducted for all significant states of the site. Deficiencies uncovered become inputs to redesign and further analysis, closing the loop on the design/analysis cycle.
Boggle Logic Puzzles: Minimal Solutions
ERIC Educational Resources Information Center
Needleman, Jonathan
2013-01-01
Boggle logic puzzles are based on the popular word game Boggle played backwards. Given a list of words, the problem is to recreate the board. We explore these puzzles on a 3 x 3 board and find the minimum number of three-letter words needed to create a puzzle with a unique solution. We conclude with a series of open questions.
Program Theory Evaluation: Logic Analysis
ERIC Educational Resources Information Center
Brousselle, Astrid; Champagne, Francois
2011-01-01
Program theory evaluation, which has grown in use over the past 10 years, assesses whether a program is designed in such a way that it can achieve its intended outcomes. This article describes a particular type of program theory evaluation--logic analysis--that allows us to test the plausibility of a program's theory using scientific knowledge.…
Gateways to Writing Logical Arguments
ERIC Educational Resources Information Center
McCann, Thomas M.
2010-01-01
Middle school and high school students have a conception of what the basic demands of logic are, and they draw on this understanding in anticipating certain demands of parents and teachers when the adolescents have to defend positions. At the same time, many adolescents struggle to "write" highly elaborated arguments. Teaching students lessons in…
Implementing Exclusive-OR Logic
NASA Technical Reports Server (NTRS)
Hough, M. E.
1983-01-01
Two integrated circuits, BCD-to-decimal decoder and four-input NAND gate, form basic four, input XOR circuit. Multiple-input exclusive-OR logic is implemented by combining several basic elements. 16-input XOR gate is assembled from five NAND gates and five decoders. Same principle extended to handle more inputs.
Coreflections in Algebraic Quantum Logic
NASA Astrophysics Data System (ADS)
Jacobs, Bart; Mandemaker, Jorik
2012-07-01
Various generalizations of Boolean algebras are being studied in algebraic quantum logic, including orthomodular lattices, orthomodular po-sets, orthoalgebras and effect algebras. This paper contains a systematic study of the structure in and between categories of such algebras. It does so via a combination of totalization (of partially defined operations) and transfer of structure via coreflections.
Fuzzy logic control of telerobot manipulators
NASA Technical Reports Server (NTRS)
Franke, Ernest A.; Nedungadi, Ashok
1992-01-01
Telerobot systems for advanced applications will require manipulators with redundant 'degrees of freedom' (DOF) that are capable of adapting manipulator configurations to avoid obstacles while achieving the user specified goal. Conventional methods for control of manipulators (based on solution of the inverse kinematics) cannot be easily extended to these situations. Fuzzy logic control offers a possible solution to these needs. A current research program at SRI developed a fuzzy logic controller for a redundant, 4 DOF, planar manipulator. The manipulator end point trajectory can be specified by either a computer program (robot mode) or by manual input (teleoperator). The approach used expresses end-point error and the location of manipulator joints as fuzzy variables. Joint motions are determined by a fuzzy rule set without requiring solution of the inverse kinematics. Additional rules for sensor data, obstacle avoidance and preferred manipulator configuration, e.g., 'righty' or 'lefty', are easily accommodated. The procedure used to generate the fuzzy rules can be extended to higher DOF systems.
Learning fuzzy logic control system
NASA Technical Reports Server (NTRS)
Lung, Leung Kam
1994-01-01
The performance of the Learning Fuzzy Logic Control System (LFLCS), developed in this thesis, has been evaluated. The Learning Fuzzy Logic Controller (LFLC) learns to control the motor by learning the set of teaching values that are generated by a classical PI controller. It is assumed that the classical PI controller is tuned to minimize the error of a position control system of the D.C. motor. The Learning Fuzzy Logic Controller developed in this thesis is a multi-input single-output network. Training of the Learning Fuzzy Logic Controller is implemented off-line. Upon completion of the training process (using Supervised Learning, and Unsupervised Learning), the LFLC replaces the classical PI controller. In this thesis, a closed loop position control system of a D.C. motor using the LFLC is implemented. The primary focus is on the learning capabilities of the Learning Fuzzy Logic Controller. The learning includes symbolic representation of the Input Linguistic Nodes set and Output Linguistic Notes set. In addition, we investigate the knowledge-based representation for the network. As part of the design process, we implement a digital computer simulation of the LFLCS. The computer simulation program is written in 'C' computer language, and it is implemented in DOS platform. The LFLCS, designed in this thesis, has been developed on a IBM compatible 486-DX2 66 computer. First, the performance of the Learning Fuzzy Logic Controller is evaluated by comparing the angular shaft position of the D.C. motor controlled by a conventional PI controller and that controlled by the LFLC. Second, the symbolic representation of the LFLC and the knowledge-based representation for the network are investigated by observing the parameters of the Fuzzy Logic membership functions and the links at each layer of the LFLC. While there are some limitations of application with this approach, the result of the simulation shows that the LFLC is able to control the angular shaft position of the
Ulysses: A functional description and simulation software system
NASA Technical Reports Server (NTRS)
Griswold, T. W.; Hendry, D. F.
1986-01-01
Current design tools for digital circuits and systems are not well-integrated among the behavioral, gate, and transistor levels of design. Ulysses is a prototype software system that consists of a description language, a description compiler, and a simulator that make no distinction among these levels. The language is uniform over the entire range of logical descriptions, the description is hierarchical with no fundamental restrictions on depth or mixing of levels, and the simulator is fully integrated with the description. The structure of the language, compiler, and simulator are described in terms of their relationships to the abstractions of physical systems that are made in order to create logical descriptions and models of behavior.
Quantum Logics of Idempotents of Unital Rings
NASA Astrophysics Data System (ADS)
Bikchentaev, Airat; Navara, Mirko; Yakushev, Rinat
2015-06-01
We introduce some new examples of quantum logics of idempotents in a ring. We continue the study of symmetric logics, i.e., collections of subsets generalizing Boolean algebras and closed under the symmetric difference.
SASIL. Sandia ATM SONET Interface Logic
Kitta, J.P.
1994-07-01
SASIL is used to program the EPLD`s (Erasable Programmable Logic Devices) and PAL`s (Programmable Array Logic) that make up a large percentage of the Sandia ATM SONET Interface (OC3 version) for the INTEL Paragon.
Circulating Packet Threshold Logic To Implement Msd Logic Modules
NASA Astrophysics Data System (ADS)
Flannery, David L.; Vail, L. Maugh; Gustafson, Steven C.
1986-03-01
Threshold logic element designs in circulating packet form are presented for the implementation of addition and subtraction using modified sign digit (MSD) arithmetic. This arithmetic is attractive for digital optical computing due to its inherent parallelism and pipelining characteristics, which capitalize on natural strengths of optics. To illustrate application of these concepts, a design for CORDIC rotation modules to accomplish the complex Givens rotations required for systolic array QU matrix factorization is presented. This design accomplishes QU factorization using only threshold logic elements and bit-shift operations in a systolic configuration. Although implementable in principle by either electronic or optical means, the design is amenable to optical implementation because it involves high levels of parallelism and interconnections.
Piaget's Logic of Meanings: Still Relevant Today
ERIC Educational Resources Information Center
Wavering, Michael James
2011-01-01
In his last book, "Toward a Logic of Meanings" (Piaget & Garcia, 1991), Jean Piaget describes how thought can be categorized into a form of propositional logic, a logic of meanings. The intent of this article is to offer this analysis by Piaget as a means to understand the language and teaching of science. Using binary propositions, conjunctions,…
Applications of Logic Coverage Criteria and Logic Mutation to Software Testing
ERIC Educational Resources Information Center
Kaminski, Garrett K.
2011-01-01
Logic is an important component of software. Thus, software logic testing has enjoyed significant research over a period of decades, with renewed interest in the last several years. One approach to detecting logic faults is to create and execute tests that satisfy logic coverage criteria. Another approach to detecting faults is to perform mutation…
Integrated Risk Information System (IRIS)
Express ; CASRN 101200 - 48 - 0 Human health assessment information on a chemical substance is included in the IRIS database only after a comprehensive review of toxicity data , as outlined in the IRIS assessment development process . Sections I ( Health Hazard Assessments for Noncarcinogenic Effect
A logical foundation for representation of clinical data.
Campbell, K E; Das, A K; Musen, M A
1994-01-01
OBJECTIVE: A general framework for representation of clinical data that provides a declarative semantics of terms and that allows developers to define explicitly the relationships among both terms and combinations of terms. DESIGN: Use of conceptual graphs as a standard representation of logic and of an existing standardized vocabulary, the Systematized Nomenclature of Medicine (SNOMED International), for lexical elements. Concepts such as time, anatomy, and uncertainty must be modeled explicitly in a way that allows relation of these foundational concepts to surface-level clinical descriptions in a uniform manner. RESULTS: The proposed framework was used to model a simple radiology report, which included temporal references. CONCLUSION: Formal logic provides a framework for formalizing the representation of medical concepts. Actual implementations will be required to evaluate the practicality of this approach. PMID:7719805
Celik, Safiye; Logsdon, Benjamin A; Battle, Stephanie; Drescher, Charles W; Rendi, Mara; Hawkins, R David; Lee, Su-In
2016-01-01
Patterns in expression data conserved across multiple independent disease studies are likely to represent important molecular events underlying the disease. We present the INSPIRE method to infer modules of co-expressed genes and the dependencies among the modules from multiple expression datasets that may contain different sets of genes. We show that INSPIRE infers more accurate models than existing methods to extract low-dimensional representation of expression data. We demonstrate that applying INSPIRE to nine ovarian cancer datasets leads to a new marker and potential driver of tumor-associated stroma, HOPX, followed by experimental validation. The implementation of INSPIRE is available at http://inspire.cs.washington.edu . PMID:27287041
Fuzzy Versions of Epistemic and Deontic Logic
NASA Technical Reports Server (NTRS)
Gounder, Ramasamy S.; Esterline, Albert C.
1998-01-01
Epistemic and deontic logics are modal logics, respectively, of knowledge and of the normative concepts of obligation, permission, and prohibition. Epistemic logic is useful in formalizing systems of communicating processes and knowledge and belief in AI (Artificial Intelligence). Deontic logic is useful in computer science wherever we must distinguish between actual and ideal behavior, as in fault tolerance and database integrity constraints. We here discuss fuzzy versions of these logics. In the crisp versions, various axioms correspond to various properties of the structures used in defining the semantics of the logics. Thus, any axiomatic theory will be characterized not only by its axioms but also by the set of properties holding of the corresponding semantic structures. Fuzzy logic does not proceed with axiomatic systems, but fuzzy versions of the semantic properties exist and can be shown to correspond to some of the axioms for the crisp systems in special ways that support dependency networks among assertions in a modal domain. This in turn allows one to implement truth maintenance systems. For the technical development of epistemic logic, and for that of deontic logic. To our knowledge, we are the first to address fuzzy epistemic and fuzzy deontic logic explicitly and to consider the different systems and semantic properties available. We give the syntax and semantics of epistemic logic and discuss the correspondence between axioms of epistemic logic and properties of semantic structures. The same topics are covered for deontic logic. Fuzzy epistemic and fuzzy deontic logic discusses the relationship between axioms and semantic properties for these logics. Our results can be exploited in truth maintenance systems.
An Embedded Reconfigurable Logic Module
NASA Technical Reports Server (NTRS)
Tucker, Jerry H.; Klenke, Robert H.; Shams, Qamar A. (Technical Monitor)
2002-01-01
A Miniature Embedded Reconfigurable Computer and Logic (MERCAL) module has been developed and verified. MERCAL was designed to be a general-purpose, universal module that that can provide significant hardware and software resources to meet the requirements of many of today's complex embedded applications. This is accomplished in the MERCAL module by combining a sub credit card size PC in a DIMM form factor with a XILINX Spartan I1 FPGA. The PC has the ability to download program files to the FPGA to configure it for different hardware functions and to transfer data to and from the FPGA via the PC's ISA bus during run time. The MERCAL module combines, in a compact package, the computational power of a 133 MHz PC with up to 150,000 gate equivalents of digital logic that can be reconfigured by software. The general architecture and functionality of the MERCAL hardware and system software are described.
The Logic Behind Feynman's Paths
NASA Astrophysics Data System (ADS)
García Álvarez, Edgardo T.
The classical notions of continuity and mechanical causality are left in order to reformulate the Quantum Theory starting from two principles: (I) the intrinsic randomness of quantum process at microphysical level, (II) the projective representations of symmetries of the system. The second principle determines the geometry and then a new logic for describing the history of events (Feynman's paths) that modifies the rules of classical probabilistic calculus. The notion of classical trajectory is replaced by a history of spontaneous, random and discontinuous events. So the theory is reduced to determining the probability distribution for such histories accordingly with the symmetries of the system. The representation of the logic in terms of amplitudes leads to Feynman rules and, alternatively, its representation in terms of projectors results in the Schwinger trace formula.
Nanowire NMOS Logic Inverter Characterization.
Hashim, Yasir
2016-06-01
This study is the first to demonstrate characteristics optimization of nanowire N-Channel Metal Oxide Semiconductor (NW-MOS) logic inverter. Noise margins and inflection voltage of transfer characteristics are used as limiting factors in this optimization. A computer-based model used to produce static characteristics of NW-NMOS logic inverter. In this research two circuit configuration of NW-NMOS inverter was studied, in first NW-NMOS circuit, the noise margin for (low input-high output) condition was very low. For second NMOS circuit gives excellent noise margins, and results indicate that optimization depends on applied voltage to the inverter. Increasing gate to source voltage with (2/1) nanowires ratio results better noise margins. Increasing of applied DC load transistor voltage tends to increasing in decreasing noise margins; decreasing this voltage will improve noise margins significantly. PMID:27427653
All-optical symmetric ternary logic gate
NASA Astrophysics Data System (ADS)
Chattopadhyay, Tanay
2010-09-01
Symmetric ternary number (radix=3) has three logical states (1¯, 0, 1). It is very much useful in carry free arithmetical operation. Beside this, the logical operation using this type of number system is also effective in high speed computation and communication in multi-valued logic. In this literature all-optical circuits for three basic symmetrical ternary logical operations (inversion, MIN and MAX) are proposed and described. Numerical simulation verifies the theoretical model. In this present scheme the different ternary logical states are represented by different polarized state of light. Terahertz optical asymmetric demultiplexer (TOAD) based interferometric switch has been used categorically in this manuscript.
Logic and structured design for computer programmers
Rood, H.J.
1985-01-01
This text provides a language- and system-independent introduction to logical structures, and teaches logic plus the programming and data processing applications in which logic is used. The author has eliminated the need to cover basic program design at the beginning of every language course, and has used logic of sets, Boolean algebra, conditional statements, and truth tables to establish logic of structure flowchart, pseudocode, Warnier/Orr diagrams, and so on. After chapter three, the chapters are independent so that instructors can select the coverage of programming tools and techniques most relevant to their students.
Realization of all-optical logic gates through three core photonic crystal fiber
NASA Astrophysics Data System (ADS)
Uthayakumar, T.; Vasantha Jayakantha Raja, R.; Porsezian, K.
2013-06-01
We present the practical design of novel three core photonic crystal fiber (TPCF) for optical switching and logic operations by employing all optical control. To accomplish the proposed aim, we put forth two types of symmetrical TPCF designs, one with cores of planar geometry and the other with equilateral triangular geometry. The dynamics of the individual pulse parameters through the proposed geometries are analyzed numerically using split step Fourier method (SSFM). The steering characteristics of the coupler are demonstrated by the transmission curve. The truth tables expressing Boolean algebra for different logic operations are constructed from the transmission curves of the individual coupler configurations. Out of all configurations, we observe that the chloroform filled triangular core demonstrates all the logic operations namely OR, NOR, AND, NAND, X-OR, X-NOR and NOT with low input power. A figure of merit of logic gates (FOMEL) is also made to compare the performance of all the logic gates.
The universal magnetic tunnel junction logic gates representing 16 binary Boolean logic operations
NASA Astrophysics Data System (ADS)
Lee, Junwoo; Suh, Dong Ik; Park, Wanjun
2015-05-01
The novel devices are expected to shift the paradigm of a logic operation by their own nature, replacing the conventional devices. In this study, the nature of our fabricated magnetic tunnel junction (MTJ) that responds to the two external inputs, magnetic field and voltage bias, demonstrated seven basic logic operations. The seven operations were obtained by the electric-field-assisted switching characteristics, where the surface magnetoelectric effect occurs due to a sufficiently thin free layer. The MTJ was transformed as a universal logic gate combined with three supplementary circuits: A multiplexer (MUX), a Wheatstone bridge, and a comparator. With these circuits, the universal logic gates demonstrated 16 binary Boolean logic operations in one logic stage. A possible further approach is parallel computations through a complimentary of MUX and comparator, capable of driving multiple logic gates. A reconfigurable property can also be realized when different logic operations are produced from different level of voltages applying to the same configuration of the logic gate.
Relentful Strategic Reasoning in Alternating-Time Temporal Logic
NASA Astrophysics Data System (ADS)
Mogavero, Fabio; Murano, Aniello; Vardi, Moshe Y.
Temporal logics are a well investigated formalism for the specification, verification, and synthesis of reactive systems. Within this family, alternating temporal logic, Atl *, has been introduced as a useful generalization of classical linear- and branching-time temporal logics by allowing temporal operators to be indexed by coalitions of agents. Classically, temporal logics are memoryless: once a path in the computation tree is quantified at a given node, the computation that has led to that node is forgotten. Recently, mCtl * has been defined as a memoryful variant of Ctl *, where path quantification is memoryful. In the context of multi-agent planning, memoryful quantification enables agents to "relent" and change their goals and strategies depending on their past history. In this paper, we define mAtl *, a memoryful extension of Atl *, in which a formula is satisfied at a certain node of a path by taking into account both the future and the past. We study the expressive power of mAtl *, its succinctness, as well as related decision problems. We also investigate the relationship between memoryful quantification and past modalities and show their equivalence. We show that both the memoryful and the past extensions come without any computational price; indeed, we prove that both the satisfiability and the model-checking problems are 2ExpTime-Complete, as they are for Atl *.
Introducing Programmable Logic to Undergraduate Engineering Students in a Digital Electronics Course
ERIC Educational Resources Information Center
Todorovich, E.; Marone, J. A.; Vazquez, M.
2012-01-01
Due to significant technological advances and industry requirements, many universities have introduced programmable logic and hardware description languages into undergraduate engineering curricula. This has led to a number of logistical and didactical challenges, in particular for computer science students. In this paper, the integration of some…
R-189 (C-620) air compressor control logic software documentation. Revision 1
Walter, K.E.
1995-06-08
This relates to FFTF plant air compressors. Purpose of this document is to provide an updated Computer Software Description for the software to be used on R-189 (C-620-C) air compressor programmable controllers. Logic software design changes were required to allow automatic starting of a compressor that had not been previously started.
Computer-Assisted Instruction in Elementary Logic at the University Level. Technical Report No. 239.
ERIC Educational Resources Information Center
Goldberg, Adele; Suppes, Patrick
Earlier research by the authors in the design and use of computer-assisted instructional systems and curricula for teaching mathematical logic to gifted elementary school students has been extended to the teaching of university-level courses. This report is a description of the curriculum and problem types of a computer-based course offered at…
Pan, Deng; Wei, Hong; Xu, Hongxing
2013-04-22
Optical interferometric logic gates in metal slot waveguide network are designed and investigated by electromagnetic simulations. The designed logic gates can realize all fundamental logic operations. A single Y-shaped junction can work as logic gate for four logic functions: AND, NOT, OR and XOR. By cascading two Y-shaped junctions, NAND, NOR and XNOR can be realized. The working principle is analyzed in detail. In the simulations, these gates show large intensity contrast for the Boolean logic states of the output. These results can be useful for future integrated optical computing. PMID:23609666
Electronic logic for enhanced switch reliability
Cooper, J.A.
1984-01-20
A logic circuit is used to enhance redundant switch reliability. Two or more switches are monitored for logical high or low output. The output for the logic circuit produces a redundant and fail-safe representation of the switch outputs. When both switch outputs are high, the output is high. Similarly, when both switch outputs are low, the logic circuit's output is low. When the output states of the two switches do not agree, the circuit resolves the conflict by memorizing the last output state which both switches were simultaneously in and produces the logical complement of this output state. Thus, the logic circuit of the present invention allows the redundant switches to be treated as if they were in parallel when the switches are open and as if they were in series when the switches are closed. A failsafe system having maximum reliability is thereby produced.
Synthesizing Biomolecule-based Boolean Logic Gates
Miyamoto, Takafumi; Razavi, Shiva; DeRose, Robert; Inoue, Takanari
2012-01-01
One fascinating recent avenue of study in the field of synthetic biology is the creation of biomolecule-based computers. The main components of a computing device consist of an arithmetic logic unit, the control unit, memory, and the input and output devices. Boolean logic gates are at the core of the operational machinery of these parts, hence to make biocomputers a reality, biomolecular logic gates become a necessity. Indeed, with the advent of more sophisticated biological tools, both nucleic acid- and protein-based logic systems have been generated. These devices function in the context of either test tubes or living cells and yield highly specific outputs given a set of inputs. In this review, we discuss various types of biomolecular logic gates that have been synthesized, with particular emphasis on recent developments that promise increased complexity of logic gate circuitry, improved computational speed, and potential clinical applications. PMID:23526588
NASA Astrophysics Data System (ADS)
Ford, David; Huntsman, Steven
2006-06-01
Thermodynamics (in concert with its sister discipline, statistical physics) can be regarded as a data reduction scheme based on partitioning a total system into a subsystem and a bath that weakly interact with each other. Whereas conventionally, the systems investigated require this form of data reduction in order to facilitate prediction, a different problem also occurs, in the context of communication networks, markets, etc. Such “empirically accessible” systems typically overwhelm observers with the sort of information that in the case of (say) a gas is effectively unobtainable. What is required for such complex interacting systems is not prediction (this may be impossible when humans besides the observer are responsible for the interactions) but rather, description as a route to understanding. Still, the need for a thermodynamical data reduction scheme remains. In this paper, we show how an empirical temperature can be computed for finite, empirically accessible systems, and further outline how this construction allows the age-old science of thermodynamics to be fruitfully applied to them.
Selection Shapes Transcriptional Logic and Regulatory Specialization in Genetic Networks
Fogelmark, Karl; Peterson, Carsten; Troein, Carl
2016-01-01
Background Living organisms need to regulate their gene expression in response to environmental signals and internal cues. This is a computational task where genes act as logic gates that connect to form transcriptional networks, which are shaped at all scales by evolution. Large-scale mutations such as gene duplications and deletions add and remove network components, whereas smaller mutations alter the connections between them. Selection determines what mutations are accepted, but its importance for shaping the resulting networks has been debated. Methodology To investigate the effects of selection in the shaping of transcriptional networks, we derive transcriptional logic from a combinatorially powerful yet tractable model of the binding between DNA and transcription factors. By evolving the resulting networks based on their ability to function as either a simple decision system or a circadian clock, we obtain information on the regulation and logic rules encoded in functional transcriptional networks. Comparisons are made between networks evolved for different functions, as well as with structurally equivalent but non-functional (neutrally evolved) networks, and predictions are validated against the transcriptional network of E. coli. Principal Findings We find that the logic rules governing gene expression depend on the function performed by the network. Unlike the decision systems, the circadian clocks show strong cooperative binding and negative regulation, which achieves tight temporal control of gene expression. Furthermore, we find that transcription factors act preferentially as either activators or repressors, both when binding multiple sites for a single target gene and globally in the transcriptional networks. This separation into positive and negative regulators requires gene duplications, which highlights the interplay between mutation and selection in shaping the transcriptional networks. PMID:26927540
NASA Astrophysics Data System (ADS)
Laxton, J.; Wyborn, L.
2007-12-01
GeoSciML is being developed as an interchange language for geoscience. The initial scope has been designed to include the information generally shown on geological maps, and some observations, in particular using boreholes. The logical model has been built in UML and the model includes packages for mapped features, geologic units, earth material and geologic structures. The model inherits from GML, for spatial information, and observations and measurements (O&M) in particular. At present the scope of the model is largely interpreted information, but the intention is to extend it to include more observational data. A 'mapped feature' can be considered an occurrence, such as a polygon on a geologic map, of a real-world geologic feature the full extent of which is unknown. Geologic features are associated with geologic events for recording their age, process and environment of formation. The two main types of geologic feature modelled are geologic units and geologic structures. Geologic units have specialisations for lithostratigraphic units, lithodemic units, chronostratigraphic units and deformation units, but more will be added in the future as required. The model allows for composite geologic units, made up of other geologic units, to be described. Geologic structures include fractures, shear displacement structures, contacts, fold and foliation. The earth material package allows for the description of both individual components such as minerals and compound materials such as rocks or unconsolidated material. The model incorporates a structure for controlled concepts which can be defined in terms of normative descriptions of geologic units or earth materials. These can be built into geologic vocabularies, such as stratigraphic lexicons. Two data types of particular use in describing geologic properties have been defined: one allows properties to be recorded with term, number and range values along with a qualifier property for handling the 'fuzziness' of much
Quantum theory as the most robust description of reproducible experiments
NASA Astrophysics Data System (ADS)
De Raedt, Hans; Katsnelson, Mikhail I.; Michielsen, Kristel
2014-08-01
suggests that quantum theory is a powerful language to describe a certain class of statistical experiments but remains vague about the properties of the class. Similar views were expressed by other fathers of quantum mechanics, e.g., Max Born and Wolfgang Pauli [50]. They can be summarized as "Quantum theory describes our knowledge of the atomic phenomena rather than the atomic phenomena themselves". Our aim is, in a sense, to replace the philosophical components of these statements by well-defined mathematical concepts and to carefully study their relevance for physical phenomena. Specifically, by applying the general formalism of logical inference to a well-defined class of statistical experiments, the present paper shows that quantum theory is indeed the kind of language envisaged by Bohr.Theories such as Newtonian mechanics, Maxwell's electrodynamics, and Einstein's (general) relativity are deductive in character. Starting from a few axioms, abstracted from experimental observations and additional assumptions about the irrelevance of a large number of factors for the description of the phenomena of interest, deductive reasoning is used to prove or disprove unambiguous statements, propositions, about the mathematical objects which appear in the theory.The method of deductive reasoning conforms to the Boolean algebra of propositions. The deductive, reductionist methodology has the appealing feature that one can be sure that the propositions are either right or wrong, and disregarding the possibility that some of the premises on which the deduction is built may not apply, there is no doubt that the conclusions are correct. Clearly, these theories successfully describe a wide range of physical phenomena in a manner and language which is unambiguous and independent of the individual.At the same time, the construction of a physical theory, and a scientific theory in general, from "first principles" is, for sure, not something self-evident, and not even safe. Our basic
McGavin, Dennis G; Tennant, W Craighead
2009-06-17
In setting up a spin Hamiltonian (SH) to study high-spin Zeeman and high-spin nuclear and/or electronic interactions in electron paramagnetic resonance (EPR) experiments, it is argued that a maximally reduced SH (MRSH) framed in tesseral combinations of spherical tensor operators is necessary. Then, the SH contains only those terms that are necessary and sufficient to describe the particular spin system. The paper proceeds then to obtain interrelationships between the parameters of the MRSH and those of alternative SHs expressed in Cartesian tensor and Stevens operator-equivalent forms. The examples taken, initially, are those of Cartesian and Stevens' expressions for high-spin Zeeman terms of dimension BS(3) and BS(5). Starting from the well-known decomposition of the general Cartesian tensor of second rank to three irreducible tensors of ranks 0, 1 and 2, the decomposition of Cartesian tensors of ranks 4 and 6 are treated similarly. Next, following a generalization of the tesseral spherical tensor equations, the interrelationships amongst the parameters of the three kinds of expressions, as derived from equivalent SHs, are determined and detailed tables, including all redundancy equations, set out. In each of these cases the lowest symmetry, [Formula: see text] Laue class, is assumed and then examples of relationships for specific higher symmetries derived therefrom. The validity of a spin Hamiltonian containing mixtures of terms from the three expressions is considered in some detail for several specific symmetries, including again the lowest symmetry. Finally, we address the application of some of the relationships derived here to seldom-observed low-symmetry effects in EPR spectra, when high-spin electronic and nuclear interactions are present. PMID:21693947
Quantum theory as the most robust description of reproducible experiments
De Raedt, Hans; Katsnelson, Mikhail I.; Michielsen, Kristel
2014-08-15
It is shown that the basic equations of quantum theory can be obtained from a straightforward application of logical inference to experiments for which there is uncertainty about individual events and for which the frequencies of the observed events are robust with respect to small changes in the conditions under which the experiments are carried out. - Highlights: • It is shown that logical inference, that is, inductive reasoning, provides a rational explanation for the success of quantum theory. • The Schrödinger equation is obtained through logical inference applied to robust experiments. • The singlet and triplet states follow from logical inference applied to the Einstein-Podolsky-Rosen-Bohm experiment. • Robustness also leads to the quantum theoretical description of the Stern-Gerlach experiment.
Eye Selector Logic for a Coordinated Cell Cycle Exit
Lopes, Carla S.; Casares, Fernando
2015-01-01
Organ-selector transcription factors control simultaneously cell differentiation and proliferation, ensuring the development of functional organs and their homeostasis. How this is achieved at the molecular level is still unclear. Here we have investigated how the transcriptional pulse of string/cdc25 (stg), the universal mitotic trigger, is regulated during Drosophila retina development as an example of coordinated deployment of differentiation and proliferation programs. We identify the eye specific stg enhancer, stg-FMW, and show that Pax6 selector genes, in cooperation with Eya and So, two members of the retinal determination network, activate stg-FMW, establishing a positive feed-forward loop. This loop is negatively modulated by the Meis1 protein, Hth. This regulatory logic is reminiscent of that controlling the expression of differentiation transcription factors. Our work shows that subjecting transcription factors and key cell cycle regulators to the same regulatory logic ensures the coupling between differentiation and proliferation programs during organ development. PMID:25695251
High-Order Noise Filtering in Nontrivial Quantum Logic Gates
NASA Astrophysics Data System (ADS)
Green, Todd; Uys, Hermann; Biercuk, Michael J.
2012-07-01
Treating the effects of a time-dependent classical dephasing environment during quantum logic operations poses a theoretical challenge, as the application of noncommuting control operations gives rise to both dephasing and depolarization errors that must be accounted for in order to understand total average error rates. We develop a treatment based on effective Hamiltonian theory that allows us to efficiently model the effect of classical noise on nontrivial single-bit quantum logic operations composed of arbitrary control sequences. We present a general method to calculate the ensemble-averaged entanglement fidelity to arbitrary order in terms of noise filter functions, and provide explicit expressions to fourth order in the noise strength. In the weak noise limit we derive explicit filter functions for a broad class of piecewise-constant control sequences, and use them to study the performance of dynamically corrected gates, yielding good agreement with brute-force numerics.
High-order noise filtering in nontrivial quantum logic gates.
Green, Todd; Uys, Hermann; Biercuk, Michael J
2012-07-13
Treating the effects of a time-dependent classical dephasing environment during quantum logic operations poses a theoretical challenge, as the application of noncommuting control operations gives rise to both dephasing and depolarization errors that must be accounted for in order to understand total average error rates. We develop a treatment based on effective Hamiltonian theory that allows us to efficiently model the effect of classical noise on nontrivial single-bit quantum logic operations composed of arbitrary control sequences. We present a general method to calculate the ensemble-averaged entanglement fidelity to arbitrary order in terms of noise filter functions, and provide explicit expressions to fourth order in the noise strength. In the weak noise limit we derive explicit filter functions for a broad class of piecewise-constant control sequences, and use them to study the performance of dynamically corrected gates, yielding good agreement with brute-force numerics. PMID:23030139
Moral Particularism and Deontic Logic
NASA Astrophysics Data System (ADS)
Parent, Xavier
The aim of this paper is to strengthen the point made by Horty about the relationship between reason holism and moral particularism. In the literature prima facie obligations have been considered as the only source of reason holism. I strengthen Horty's point in two ways. First, I show that contrary-to-duties provide another independent support for reason holism. Next I outline a formal theory that is able to capture these two sources of holism. While in simple settings the proposed account coincides with Horty's one, this is not true in more complicated or "realistic" settings in which more than two norms collide. My chosen formalism is so-called input/output logic.
Double patterning compliant logic design
NASA Astrophysics Data System (ADS)
Ma, Yuangsheng; Sweis, Jason; Bencher, Chris; Deng, Yunfei; Dai, Huixiong; Yoshida, Hidekazu; Gisuthan, Bimal; Kye, Jongwook; Levinson, Harry J.
2011-04-01
Double patterning technology (DPT) is the only solution to enable the scaling for advanced technology nodes before EUV or any other advanced patterning techniques become available. In general, there are two major double patterning techniques: one is Litho-Etch-Litho-Etch (LELE), and the other is sidewall spacer technology, a Self-Aligned Double Patterning technique (SADP). While numerous papers have previously demonstrated these techniques on wafer process capabilities and processing costs, more study needs to be done in the context of standard cell design flow to enable their applications in mass production. In this paper, we will present the impact of DPT on logic designs, and give a thorough discussion on how to make DPT-compliant constructs, placement and routing using examples with Cadence's Encounter Digital Implementation System (EDI System).
NASA Astrophysics Data System (ADS)
Whitfield, J. D.; Faccin, M.; Biamonte, J. D.
2012-09-01
Designing and optimizing cost functions and energy landscapes is a problem encountered in many fields of science and engineering. These landscapes and cost functions can be embedded and annealed in experimentally controllable spin Hamiltonians. Using an approach based on group theory and symmetries, we examine the embedding of Boolean logic gates into the ground-state subspace of such spin systems. We describe parameterized families of diagonal Hamiltonians and symmetry operations which preserve the ground-state subspace encoding the truth tables of Boolean formulas. The ground-state embeddings of adder circuits are used to illustrate how gates are combined and simplified using symmetry. Our work is relevant for experimental demonstrations of ground-state embeddings found in both classical optimization as well as adiabatic quantum optimization.
Logical Empiricism, Politics, and Professionalism
NASA Astrophysics Data System (ADS)
Edgar, Scott
2009-02-01
This paper considers George A. Reisch’s account of the role of Cold War political forces in shaping the apolitical stance that came to dominate philosophy of science in the late 1940s and 1950s. It argues that at least as early as the 1930s, Logical Empiricists such as Rudolf Carnap already held that philosophy of science could not properly have political aims, and further suggests that political forces alone cannot explain this view’s rise to dominance during the Cold War, since political forces cannot explain why a philosophy of science with liberal democratic, anti-communist aims did not flourish. The paper then argues that if professionalization is understood in the right way, it might point toward an explanation of the apolitical stance of Cold War philosophy of science.
Rationality and the Logic of Good Reasons.
ERIC Educational Resources Information Center
Fisher, Walter R.
This paper contends that the rationality of the logic of good reasons is constituted in its use. To support this claim, the paper presents an analysis of the relationship between being reasonable and being rational. It then considers how following the logic of good reasons leads to rationality in the behavior of individuals and groups; the latter…
Toward a Logic of Good Reasons.
ERIC Educational Resources Information Center
Fisher, Walter R.
1978-01-01
Explores the assumptions underlying the role of values in rhetorical interactions, the meaning of "logic" in relation to "good reasons," a reconceptualization of "good reasons," implementation of a "logic of 'good reasons'," and the uses of hierarchies of values in assessing rhetorical reasoning. (JMF)
Strategy: The logic of war and peace
Luttwak, E.N.
1987-01-01
This book expounds a new way of thinking about the conduct of war and the diplomacy of peace, a theory Luttwak calls ''paradoxical logic,'' and illustrates, through abundant historical examples, the failure of commonsense logic in matters of military strategy and international politics. Topics considered include nuclear weapons, military strategy, decision making, historical aspects, political aspects, global aspects, and warfare.
Logic Design Pathology and Space Flight Electronics
NASA Technical Reports Server (NTRS)
Katz, Richard B.; Barto, Rod L.; Erickson, Ken
1999-01-01
This paper presents a look at logic design from early in the US Space Program and examines faults in recent logic designs. Most examples are based on flight hardware failures and analysis of new tools and techniques. The paper is presented in viewgraph form.
Calculator Logic Systems and Mathematical Understandings.
ERIC Educational Resources Information Center
Burrows, Enid R.
This monograph is aimed at helping the reader understand the built-in logic of various calculator operating systems. It is an outgrowth of workshop contacts with in-service and pre-service teachers of mathematics and is in response to their request for a book on the subject of calculator logic systems and calculator algorithms. The mathematical…
Fuzzy Logic in Medicine and Bioinformatics
Torres, Angela; Nieto, Juan J.
2006-01-01
The purpose of this paper is to present a general view of the current applications of fuzzy logic in medicine and bioinformatics. We particularly review the medical literature using fuzzy logic. We then recall the geometrical interpretation of fuzzy sets as points in a fuzzy hypercube and present two concrete illustrations in medicine (drug addictions) and in bioinformatics (comparison of genomes). PMID:16883057
NASA Astrophysics Data System (ADS)
Jetli, Priyedarshi
Modern logic begins with Boole's The Mathematical Analysis of Logic when the algebra of logic was developed so that classical logic syllogisms were proven as algebraic equations and the turn from the logic of classes to propositional logic was suggested. The emergence was incomplete as Boole algebraised classical logic. Frege in Begriffsschrift replaced Aristotelian subject-predicate propositions by function and argument and displaced syllogisms with an axiomatic propositional calculus using conditionals, modus ponens and the law of substitution. Further Frege provided the breakthrough to lay down the groundwork for the development of quantified logic as well as the logic of relations. He achieved all of this through his innovative formal notations which have remained underrated. Frege hence completed the emergence of modern logic. Both Boole and Frege mathematised logic, but Frege's goal was to logicise mathematics. However the emergence of modern logic in Frege should be detached from his logicism.
Zhang, Lina; Zhang, Hui; Liu, Mei; Dong, Bin
2016-06-22
In this paper, we report a polymer-based raspberry-like micromotor. Interestingly, the resulting micromotor exhibits multistimuli-responsive motion behavior. Its on-off-on motion can be regulated by the application of stimuli such as H2O2, near-infrared light, NH3, or their combinations. Because of the versatility in motion control, the current micromotor has great potential in the application field of logic gate and logic circuit. With use of different stimuli as the inputs and the micromotor motion as the output, reprogrammable OR and INHIBIT logic gates or logic circuit consisting of OR, NOT, and AND logic gates can be achieved. PMID:27237969
A computer program for the generation of logic networks from task chart data
NASA Technical Reports Server (NTRS)
Herbert, H. E.
1980-01-01
The Network Generation Program (NETGEN), which creates logic networks from task chart data is presented. NETGEN is written in CDC FORTRAN IV (Extended) and runs in a batch mode on the CDC 6000 and CYBER 170 series computers. Data is input via a two-card format and contains information regarding the specific tasks in a project. From this data, NETGEN constructs a logic network of related activities with each activity having unique predecessor and successor nodes, activity duration, descriptions, etc. NETGEN then prepares this data on two files that can be used in the Project Planning Analysis and Reporting System Batch Network Scheduling program and the EZPERT graphics program.
Processing device with self-scrubbing logic
Wojahn, Christopher K.
2016-03-01
An apparatus includes a processing unit including a configuration memory and self-scrubber logic coupled to read the configuration memory to detect compromised data stored in the configuration memory. The apparatus also includes a watchdog unit external to the processing unit and coupled to the self-scrubber logic to detect a failure in the self-scrubber logic. The watchdog unit is coupled to the processing unit to selectively reset the processing unit in response to detecting the failure in the self-scrubber logic. The apparatus also includes an external memory external to the processing unit and coupled to send configuration data to the configuration memory in response to a data feed signal outputted by the self-scrubber logic.
Magnetic tunnel junction based spintronic logic devices
NASA Astrophysics Data System (ADS)
Lyle, Andrew Paul
The International Technology Roadmap for Semiconductors (ITRS) predicts that complimentary metal oxide semiconductor (CMOS) based technologies will hit their last generation on or near the 16 nm node, which we expect to reach by the year 2025. Thus future advances in computational power will not be realized from ever-shrinking device sizes, but rather by 'outside the box' designs and new physics, including molecular or DNA based computation, organics, magnonics, or spintronic. This dissertation investigates magnetic logic devices for post-CMOS computation. Three different architectures were studied, each relying on a different magnetic mechanism to compute logic functions. Each design has it benefits and challenges that must be overcome. This dissertation focuses on pushing each design from the drawing board to a realistic logic technology. The first logic architecture is based on electrically connected magnetic tunnel junctions (MTJs) that allow direct communication between elements without intermediate sensing amplifiers. Two and three input logic gates, which consist of two and three MTJs connected in parallel, respectively were fabricated and are compared. The direct communication is realized by electrically connecting the output in series with the input and applying voltage across the series connections. The logic gates rely on the fact that a change in resistance at the input modulates the voltage that is needed to supply the critical current for spin transfer torque switching the output. The change in resistance at the input resulted in a voltage margin of 50--200 mV and 250--300 mV for the closest input states for the three and two input designs, respectively. The two input logic gate realizes the AND, NAND, NOR, and OR logic functions. The three input logic function realizes the Majority, AND, NAND, NOR, and OR logic operations. The second logic architecture utilizes magnetostatically coupled nanomagnets to compute logic functions, which is the basis of
ERIC Educational Resources Information Center
Levin-Rozalis, Miri
2010-01-01
Background: Two kinds of research logic prevail in scientific research: deductive research logic and inductive research logic. However, both fail in the field of evaluation, especially evaluation conducted in unfamiliar environments. Purpose: In this article I wish to suggest the application of a research logic--"abduction"--"the logic of…
Using Pipelined XNOR Logic to Reduce SEU Risks in State Machines
NASA Technical Reports Server (NTRS)
Le, Martin; Zheng, Xin; Katanyoutant, Sunant
2008-01-01
Single-event upsets (SEUs) pose great threats to avionic systems state machine control logic, which are frequently used to control sequence of events and to qualify protocols. The risks of SEUs manifest in two ways: (a) the state machine s state information is changed, causing the state machine to unexpectedly transition to another state; (b) due to the asynchronous nature of SEU, the state machine's state registers become metastable, consequently causing any combinational logic associated with the metastable registers to malfunction temporarily. Effect (a) can be mitigated with methods such as triplemodular redundancy (TMR). However, effect (b) cannot be eliminated and can degrade the effectiveness of any mitigation method of effect (a). Although there is no way to completely eliminate the risk of SEU-induced errors, the risk can be made very small by use of a combination of very fast state-machine logic and error-detection logic. Therefore, one goal of two main elements of the present method is to design the fastest state-machine logic circuitry by basing it on the fastest generic state-machine design, which is that of a one-hot state machine. The other of the two main design elements is to design fast error-detection logic circuitry and to optimize it for implementation in a field-programmable gate array (FPGA) architecture: In the resulting design, the one-hot state machine is fitted with a multiple-input XNOR gate for detection of illegal states. The XNOR gate is implemented with lookup tables and with pipelines for high speed. In this method, the task of designing all the logic must be performed manually because no currently available logic synthesis software tool can produce optimal solutions of design problems of this type. However, some assistance is provided by a script, written for this purpose in the Python language (an object-oriented interpretive computer language) to automatically generate hardware description language (HDL) code from state
Dynamic regimes of random fuzzy logic networks
NASA Astrophysics Data System (ADS)
Wittmann, Dominik M.; Theis, Fabian J.
2011-01-01
Random multistate networks, generalizations of the Boolean Kauffman networks, are generic models for complex systems of interacting agents. Depending on their mean connectivity, these networks exhibit ordered as well as chaotic behavior with a critical boundary separating both regimes. Typically, the nodes of these networks are assigned single discrete states. Here, we describe nodes by fuzzy numbers, i.e. vectors of degree-of-membership (DOM) functions specifying the degree to which the nodes are in each of their discrete states. This allows our models to deal with imprecision and uncertainties. Compatible update rules are constructed by expressing the update rules of the multistate network in terms of Boolean operators and generalizing them to fuzzy logic (FL) operators. The standard choice for these generalizations is the Gödel FL, where AND and OR are replaced by the minimum and maximum of two DOMs, respectively. In mean-field approximations we are able to analytically describe the percolation and asymptotic distribution of DOMs in random Gödel FL networks. This allows us to characterize the different dynamic regimes of random multistate networks in terms of FL. In a low-dimensional example, we provide explicit computations and validate our mean-field results by showing that they agree well with network simulations.
Natural Language Description of Emotion
ERIC Educational Resources Information Center
Kazemzadeh, Abe
2013-01-01
This dissertation studies how people describe emotions with language and how computers can simulate this descriptive behavior. Although many non-human animals can express their current emotions as social signals, only humans can communicate about emotions symbolically. This symbolic communication of emotion allows us to talk about emotions that we…
Project W-058 monitor and control system logic
ROBERTS, J.B.
1999-05-12
This supporting document contains the printout of the control logic for the Project W-058 Monitor and Control System, as developed by Programmable Control Services, Inc. The logic is arranged in five appendices, one for each programmable logic controller console.
Two Influential Primate Classifications Logically Aligned
Franz, Nico M.; Pier, Naomi M.; Reeder, Deeann M.; Chen, Mingmin; Yu, Shizhuo; Kianmajd, Parisa; Bowers, Shawn; Ludäscher, Bertram
2016-01-01
Classifications and phylogenies of perceived natural entities change in the light of new evidence. Taxonomic changes, translated into Code-compliant names, frequently lead to name:meaning dissociations across succeeding treatments. Classification standards such as the Mammal Species of the World (MSW) may experience significant levels of taxonomic change from one edition to the next, with potential costs to long-term, large-scale information integration. This circumstance challenges the biodiversity and phylogenetic data communities to express taxonomic congruence and incongruence in ways that both humans and machines can process, that is, to logically represent taxonomic alignments across multiple classifications. We demonstrate that such alignments are feasible for two classifications of primates corresponding to the second and third MSW editions. Our approach has three main components: (i) use of taxonomic concept labels, that is name sec. author (where sec. means according to), to assemble each concept hierarchy separately via parent/child relationships; (ii) articulation of select concepts across the two hierarchies with user-provided Region Connection Calculus (RCC-5) relationships; and (iii) the use of an Answer Set Programming toolkit to infer and visualize logically consistent alignments of these input constraints. Our use case entails the Primates sec. Groves (1993; MSW2–317 taxonomic concepts; 233 at the species level) and Primates sec. Groves (2005; MSW3–483 taxonomic concepts; 376 at the species level). Using 402 RCC-5 input articulations, the reasoning process yields a single, consistent alignment and 153,111 Maximally Informative Relations that constitute a comprehensive meaning resolution map for every concept pair in the Primates sec. MSW2/MSW3. The complete alignment, and various partitions thereof, facilitate quantitative analyses of name:meaning dissociation, revealing that nearly one in three taxonomic names are not reliable across
Two Influential Primate Classifications Logically Aligned.
Franz, Nico M; Pier, Naomi M; Reeder, Deeann M; Chen, Mingmin; Yu, Shizhuo; Kianmajd, Parisa; Bowers, Shawn; Ludäscher, Bertram
2016-07-01
Classifications and phylogenies of perceived natural entities change in the light of new evidence. Taxonomic changes, translated into Code-compliant names, frequently lead to name:meaning dissociations across succeeding treatments. Classification standards such as the Mammal Species of the World (MSW) may experience significant levels of taxonomic change from one edition to the next, with potential costs to long-term, large-scale information integration. This circumstance challenges the biodiversity and phylogenetic data communities to express taxonomic congruence and incongruence in ways that both humans and machines can process, that is, to logically represent taxonomic alignments across multiple classifications. We demonstrate that such alignments are feasible for two classifications of primates corresponding to the second and third MSW editions. Our approach has three main components: (i) use of taxonomic concept labels, that is name sec. author (where sec. means according to), to assemble each concept hierarchy separately via parent/child relationships; (ii) articulation of select concepts across the two hierarchies with user-provided Region Connection Calculus (RCC-5) relationships; and (iii) the use of an Answer Set Programming toolkit to infer and visualize logically consistent alignments of these input constraints. Our use case entails the Primates sec. Groves (1993; MSW2-317 taxonomic concepts; 233 at the species level) and Primates sec. Groves (2005; MSW3-483 taxonomic concepts; 376 at the species level). Using 402 RCC-5 input articulations, the reasoning process yields a single, consistent alignment and 153,111 Maximally Informative Relations that constitute a comprehensive meaning resolution map for every concept pair in the Primates sec. MSW2/MSW3. The complete alignment, and various partitions thereof, facilitate quantitative analyses of name:meaning dissociation, revealing that nearly one in three taxonomic names are not reliable across treatments